From f25e3e69f88ed571f46b838a6360d679d2a77a1f Mon Sep 17 00:00:00 2001
From: "Nicholas Carrigan (he/him)" <nhcarrigan@gmail.com>
Date: Tue, 15 Jun 2021 00:49:18 -0700
Subject: [PATCH] feat: enable new langs (#42491)

Enable italian and portuguese
---
 client/i18n/locales/italian/links.json        |   17 +
 client/i18n/locales/italian/meta-tags.json    |   32 +
 client/i18n/locales/italian/motivation.json   |  819 ++++++++++++
 client/i18n/locales/italian/trending.json     |   62 +
 client/i18n/locales/portuguese/links.json     |   17 +
 client/i18n/locales/portuguese/meta-tags.json |   32 +
 .../i18n/locales/portuguese/motivation.json   |  819 ++++++++++++
 client/i18n/locales/portuguese/trending.json  |   62 +
 client/src/utils/algolia-locale-setup.js      |    9 +
 config/i18n/all-langs.js                      |   30 +-
 ...dd-elements-within-your-bootstrap-wells.md |   90 ++
 ...ont-awesome-icons-to-all-of-our-buttons.md |  177 +++
 .../add-font-awesome-icons-to-our-buttons.md  |  194 +++
 ...add-id-attributes-to-bootstrap-elements.md |   93 ++
 ...pply-the-default-bootstrap-button-style.md |   77 ++
 ...call-out-optional-actions-with-btn-info.md |  175 +++
 .../bootstrap/center-text-with-bootstrap.md   |  157 +++
 ...create-a-block-element-bootstrap-button.md |  185 +++
 .../bootstrap/create-a-bootstrap-button.md    |  176 +++
 .../bootstrap/create-a-bootstrap-headline.md  |   67 +
 .../bootstrap/create-a-bootstrap-row.md       |   68 +
 ...a-class-to-target-with-jquery-selectors.md |   71 ++
 .../bootstrap/create-a-custom-heading.md      |  177 +++
 .../bootstrap/create-bootstrap-wells.md       |   71 ++
 .../ditch-custom-css-for-bootstrap.md         |  188 +++
 .../give-each-element-a-unique-id.md          |  125 ++
 ...-within-a-bootstrap-container-fluid-div.md |   53 +
 .../bootstrap/label-bootstrap-buttons.md      |  105 ++
 .../bootstrap/label-bootstrap-wells.md        |  101 ++
 ...rm-elements-responsively-with-bootstrap.md |  214 ++++
 .../make-images-mobile-responsive.md          |  176 +++
 .../responsively-style-checkboxes.md          |  191 +++
 .../responsively-style-radio-buttons.md       |  175 +++
 .../bootstrap/split-your-bootstrap-row.md     |   57 +
 .../style-text-inputs-as-form-controls.md     |  201 +++
 ...aste-the-bootstrap-button-color-rainbow.md |  167 +++
 .../use-a-span-to-target-inline-elements.md   |  185 +++
 .../bootstrap/use-comments-to-clarify-code.md |   98 ++
 ...-design-with-bootstrap-fluid-containers.md |  170 +++
 ...strap-grid-to-put-elements-side-by-side.md |  196 +++
 ...s-of-a-dangerous-action-with-btn-danger.md |  176 +++
 .../build-a-25-5-clock.md                     |   81 ++
 .../build-a-drum-machine.md                   |   39 +
 .../build-a-javascript-calculator.md          |   62 +
 .../build-a-markdown-previewer.md             |   39 +
 .../build-a-random-quote-machine.md           |   49 +
 ...nge-text-inside-an-element-using-jquery.md |  131 ++
 ...ange-the-css-of-an-element-using-jquery.md |  118 ++
 .../jquery/clone-an-element-using-jquery.md   |  121 ++
 .../jquery/delete-your-jquery-functions.md    |  124 ++
 .../jquery/disable-an-element-using-jquery.md |  120 ++
 ...how-script-tags-and-document-ready-work.md |  118 ++
 .../jquery/remove-an-element-using-jquery.md  |  109 ++
 ...ove-classes-from-an-element-with-jquery.md |  121 ++
 ...ecific-child-of-an-element-using-jquery.md |  143 +++
 .../target-elements-by-class-using-jquery.md  |  112 ++
 .../target-elements-by-id-using-jquery.md     |  122 ++
 .../target-even-elements-using-jquery.md      |  138 +++
 ...ml-elements-with-selectors-using-jquery.md |  117 ++
 ...the-children-of-an-element-using-jquery.md |  125 ++
 ...t-the-parent-of-an-element-using-jquery.md |  140 +++
 ...-element-with-multiple-jquery-selectors.md |  142 +++
 ...e-appendto-to-move-elements-with-jquery.md |  117 ++
 .../use-jquery-to-modify-the-entire-page.md   |  117 ++
 .../react-and-redux/connect-redux-to-react.md |  156 +++
 .../connect-redux-to-the-messages-app.md      |  300 +++++
 .../extract-local-state-into-redux.md         |  397 ++++++
 .../extract-state-logic-to-redux.md           |  115 ++
 .../getting-started-with-react-redux.md       |  102 ++
 .../manage-state-locally-first.md             |  260 ++++
 .../react-and-redux/map-dispatch-to-props.md  |  107 ++
 .../react-and-redux/map-state-to-props.md     |   69 ++
 .../moving-forward-from-here.md               |   69 ++
 .../use-provider-to-connect-redux-to-react.md |  263 ++++
 .../react/access-props-using-this.props.md    |  165 +++
 .../react/add-comments-in-jsx.md              |   82 ++
 .../react/add-event-listeners.md              |  179 +++
 .../react/add-inline-styles-in-react.md       |  112 ++
 .../react/bind-this-to-a-class-method.md      |  136 ++
 ...-conditionally-based-on-component-state.md |  176 +++
 .../react/compose-react-components.md         |  199 +++
 .../react/create-a-complex-jsx-element.md     |  110 ++
 .../create-a-component-with-composition.md    |  134 ++
 .../react/create-a-controlled-form.md         |  209 ++++
 .../react/create-a-controlled-input.md        |  150 +++
 .../react/create-a-react-component.md         |  102 ++
 .../react/create-a-simple-jsx-element.md      |   57 +
 .../react/create-a-stateful-component.md      |  134 ++
 ...create-a-stateless-functional-component.md |  102 ++
 .../react/define-an-html-class-in-jsx.md      |   62 +
 ...sibling-elements-a-unique-key-attribute.md |  147 +++
 .../react/introducing-inline-styles.md        |  104 ++
 .../learn-about-self-closing-jsx-tags.md      |   75 ++
 ...e-re-renders-with-shouldcomponentupdate.md |  187 +++
 .../react/override-default-props.md           |  112 ++
 .../react/pass-a-callback-as-props.md         |  217 ++++
 .../react/pass-an-array-as-props.md           |  186 +++
 ...ops-to-a-stateless-functional-component.md |  164 +++
 ...pass-state-as-props-to-child-components.md |  145 +++
 .../render-a-class-component-to-the-dom.md    |  159 +++
 .../react/render-conditionally-from-props.md  |  303 +++++
 .../react/render-html-elements-to-the-dom.md  |   75 ++
 ...react-on-the-server-with-rendertostring.md |   76 ++
 ...state-in-the-user-interface-another-way.md |  119 ++
 .../render-state-in-the-user-interface.md     |  113 ++
 .../react/render-with-an-if-else-condition.md |  155 +++
 ...ps-with-stateless-functional-components.md |  145 +++
 .../react/set-state-with-this.setstate.md     |  143 +++
 .../use--for-a-more-concise-conditional.md    |  146 +++
 ...ry-expression-for-conditional-rendering.md |  280 +++++
 ...anced-javascript-in-react-render-method.md |  334 +++++
 ...y.filter-to-dynamically-filter-an-array.md |  236 ++++
 ...rray.map-to-dynamically-render-elements.md |  265 ++++
 .../react/use-default-props.md                |   78 ++
 ...roptypes-to-define-the-props-you-expect.md |  132 ++
 .../use-react-to-render-nested-components.md  |  150 +++
 .../react/use-state-to-toggle-an-element.md   |  189 +++
 ...-the-lifecycle-method-componentdidmount.md |  127 ++
 ...the-lifecycle-method-componentwillmount.md |   87 ++
 .../write-a-react-component-from-scratch.md   |   84 ++
 .../react/write-a-simple-counter.md           |  146 +++
 .../redux/combine-multiple-reducers.md        |  175 +++
 .../copy-an-object-with-object.assign.md      |  133 ++
 .../redux/create-a-redux-store.md             |   61 +
 .../redux/define-a-redux-action.md            |   55 +
 .../redux/define-an-action-creator.md         |   57 +
 .../redux/dispatch-an-action-event.md         |   85 ++
 .../redux/get-state-from-the-redux-store.md   |   55 +
 .../redux/handle-an-action-in-the-store.md    |  108 ++
 .../redux/never-mutate-state.md               |  133 ++
 .../redux/register-a-store-listener.md        |  118 ++
 .../redux/remove-an-item-from-an-array.md     |  114 ++
 .../redux/send-action-data-to-the-store.md    |  107 ++
 ...ch-statement-to-handle-multiple-actions.md |  152 +++
 .../redux/use-const-for-action-types.md       |  204 +++
 ...ddleware-to-handle-asynchronous-actions.md |  170 +++
 .../use-the-spread-operator-on-arrays.md      |  114 ++
 .../redux/write-a-counter-with-redux.md       |  116 ++
 ...yle-until-a-condition-is-met-with-while.md |  117 ++
 .../sass/create-reusable-css-with-mixins.md   |  132 ++
 ...ne-set-of-css-styles-to-another-element.md |  116 ++
 .../sass/nest-css-with-sass.md                |  105 ++
 ...tyles-into-smaller-chunks-with-partials.md |   47 +
 .../sass/store-data-with-sass-variables.md    |  121 ++
 .../use-each-to-map-over-items-in-a-list.md   |  135 ++
 .../sass/use-for-to-create-a-sass-loop.md     |  139 +++
 ...if-and-else-to-add-logic-to-your-styles.md |  145 +++
 .../d3-dashboard/part-001.md                  |   33 +
 .../d3-dashboard/part-002.md                  |   43 +
 .../d3-dashboard/part-003.md                  |   51 +
 .../d3-dashboard/part-004.md                  |   55 +
 .../d3-dashboard/part-005.md                  |   55 +
 .../d3-dashboard/part-006.md                  |   55 +
 .../d3-dashboard/part-007.md                  |   66 +
 .../d3-dashboard/part-008.md                  |   73 ++
 .../d3-dashboard/part-009.md                  |   73 ++
 .../d3-dashboard/part-010.md                  |   75 ++
 .../d3-dashboard/part-011.md                  |   81 ++
 .../d3-dashboard/part-012.md                  |   79 ++
 .../d3-dashboard/part-013.md                  |   96 ++
 .../d3-dashboard/part-014.md                  |   95 ++
 .../d3-dashboard/part-015.md                  |  103 ++
 .../d3-dashboard/part-016.md                  |  108 ++
 .../d3-dashboard/part-017.md                  |  113 ++
 .../d3-dashboard/part-018.md                  |  117 ++
 .../d3-dashboard/part-019.md                  |  124 ++
 .../d3-dashboard/part-020.md                  |  116 ++
 .../d3-dashboard/part-021.md                  |  123 ++
 .../d3-dashboard/part-022.md                  |  123 ++
 .../d3-dashboard/part-023.md                  |  129 ++
 .../d3-dashboard/part-024.md                  |  129 ++
 .../d3-dashboard/part-025.md                  |  131 ++
 .../d3-dashboard/part-026.md                  |  133 ++
 .../d3-dashboard/part-027.md                  |  138 +++
 .../d3-dashboard/part-028.md                  |  142 +++
 .../d3-dashboard/part-029.md                  |  143 +++
 .../d3-dashboard/part-030.md                  |  147 +++
 .../d3-dashboard/part-031.md                  |  151 +++
 .../d3-dashboard/part-032.md                  |  150 +++
 .../d3-dashboard/part-033.md                  |  153 +++
 .../d3-dashboard/part-034.md                  |  156 +++
 .../d3-dashboard/part-035.md                  |  158 +++
 .../d3-dashboard/part-036.md                  |  168 +++
 .../d3-dashboard/part-037.md                  |  168 +++
 .../d3-dashboard/part-038.md                  |  168 +++
 .../d3-dashboard/part-039.md                  |  173 +++
 .../d3-dashboard/part-040.md                  |  178 +++
 .../d3-dashboard/part-041.md                  |  171 +++
 .../d3-dashboard/part-042.md                  |  178 +++
 .../d3-dashboard/part-043.md                  |  178 +++
 .../d3-dashboard/part-044.md                  |  192 +++
 .../d3-dashboard/part-045.md                  |  183 +++
 .../d3-dashboard/part-046.md                  |  189 +++
 .../d3-dashboard/part-047.md                  |  189 +++
 .../d3-dashboard/part-048.md                  |  193 +++
 .../d3-dashboard/part-049.md                  |  199 +++
 .../d3-dashboard/part-050.md                  |  198 +++
 .../d3-dashboard/part-051.md                  |  204 +++
 .../d3-dashboard/part-052.md                  |  207 ++++
 .../d3-dashboard/part-053.md                  |  209 ++++
 .../d3-dashboard/part-054.md                  |  209 ++++
 .../d3-dashboard/part-055.md                  |  218 ++++
 .../d3-dashboard/part-056.md                  |  218 ++++
 .../d3-dashboard/part-057.md                  |  226 ++++
 .../d3-dashboard/part-058.md                  |  229 ++++
 .../d3-dashboard/part-059.md                  |  231 ++++
 .../d3-dashboard/part-060.md                  |  230 ++++
 .../d3-dashboard/part-061.md                  |  239 ++++
 .../d3-dashboard/part-062.md                  |  247 ++++
 .../d3-dashboard/part-063.md                  |  246 ++++
 .../d3-dashboard/part-064.md                  |  248 ++++
 .../d3-dashboard/part-065.md                  |  246 ++++
 .../d3-dashboard/part-066.md                  |  250 ++++
 .../d3-dashboard/part-067.md                  |  252 ++++
 .../d3-dashboard/part-068.md                  |  252 ++++
 .../d3-dashboard/part-069.md                  |  258 ++++
 .../d3-dashboard/part-070.md                  |  258 ++++
 .../d3-dashboard/part-071.md                  |  263 ++++
 .../d3-dashboard/part-072.md                  |  268 ++++
 .../d3-dashboard/part-073.md                  |  274 +++++
 .../d3-dashboard/part-074.md                  |  280 +++++
 .../d3-dashboard/part-075.md                  |  280 +++++
 .../d3-dashboard/part-076.md                  |  287 +++++
 .../d3-dashboard/part-077.md                  |  288 +++++
 .../d3-dashboard/part-078.md                  |  296 +++++
 .../d3-dashboard/part-079.md                  |  302 +++++
 .../d3-dashboard/part-080.md                  |  302 +++++
 .../d3-dashboard/part-081.md                  |  309 +++++
 .../d3-dashboard/part-082.md                  |  312 +++++
 .../d3-dashboard/part-083.md                  |  315 +++++
 .../d3-dashboard/part-084.md                  |  318 +++++
 .../d3-dashboard/part-085.md                  |  319 +++++
 .../d3-dashboard/part-086.md                  |  324 +++++
 .../d3-dashboard/part-087.md                  |  328 +++++
 .../d3-dashboard/part-088.md                  |  329 +++++
 .../d3-dashboard/part-089.md                  |  334 +++++
 .../d3-dashboard/part-090.md                  |  336 +++++
 .../d3-dashboard/part-091.md                  |  335 +++++
 .../d3-dashboard/part-092.md                  |  344 ++++++
 .../d3-dashboard/part-093.md                  |  345 ++++++
 .../d3-dashboard/part-094.md                  |  348 ++++++
 .../d3-dashboard/part-095.md                  |  367 ++++++
 .../d3-dashboard/part-096.md                  |  350 ++++++
 .../d3-dashboard/part-097.md                  |  348 ++++++
 .../d3-dashboard/part-098.md                  |  351 ++++++
 .../d3-dashboard/part-099.md                  |  352 ++++++
 .../d3-dashboard/part-100.md                  |  372 ++++++
 .../d3-dashboard/part-101.md                  |  377 ++++++
 .../d3-dashboard/part-102.md                  |  364 ++++++
 .../d3-dashboard/part-103.md                  |  365 ++++++
 .../d3-dashboard/part-104.md                  |  381 ++++++
 .../d3-dashboard/part-105.md                  |  383 ++++++
 .../d3-dashboard/part-106.md                  |  372 ++++++
 .../d3-dashboard/part-107.md                  |  376 ++++++
 .../d3-dashboard/part-108.md                  |  388 ++++++
 .../d3-dashboard/part-109.md                  |  388 ++++++
 .../d3-dashboard/part-110.md                  |  389 ++++++
 .../d3-dashboard/part-111.md                  |  391 ++++++
 .../d3-dashboard/part-112.md                  |  394 ++++++
 .../d3-dashboard/part-113.md                  |  396 ++++++
 .../d3-dashboard/part-114.md                  |  401 ++++++
 .../d3-dashboard/part-115.md                  |  401 ++++++
 .../d3-dashboard/part-116.md                  |  404 ++++++
 .../d3-dashboard/part-117.md                  |  406 ++++++
 .../d3-dashboard/part-118.md                  |  412 +++++++
 .../d3-dashboard/part-119.md                  |  417 +++++++
 .../d3-dashboard/part-120.md                  |  417 +++++++
 .../d3-dashboard/part-121.md                  |  418 +++++++
 .../d3-dashboard/part-122.md                  |  422 +++++++
 .../d3-dashboard/part-123.md                  |  426 +++++++
 .../d3-dashboard/part-124.md                  |  431 +++++++
 .../d3-dashboard/part-125.md                  |  430 +++++++
 .../d3-dashboard/part-126.md                  |  437 +++++++
 .../d3-dashboard/part-127.md                  |  435 +++++++
 .../d3-dashboard/part-128.md                  |  438 +++++++
 .../d3-dashboard/part-129.md                  |  443 +++++++
 .../d3-dashboard/part-130.md                  |  443 +++++++
 .../d3-dashboard/part-131.md                  |  446 +++++++
 .../d3-dashboard/part-132.md                  |  450 +++++++
 .../d3-dashboard/part-133.md                  |  448 +++++++
 .../d3-dashboard/part-134.md                  |  453 +++++++
 .../d3-dashboard/part-135.md                  |  464 +++++++
 .../d3-dashboard/part-136.md                  |  476 +++++++
 .../d3-dashboard/part-137.md                  |  484 ++++++++
 .../d3-dashboard/part-138.md                  |  479 +++++++
 .../d3-dashboard/part-139.md                  |  485 ++++++++
 .../d3-dashboard/part-140.md                  |  478 +++++++
 .../d3-dashboard/part-141.md                  |  489 ++++++++
 .../d3-dashboard/part-142.md                  |  481 ++++++++
 .../d3-dashboard/part-143.md                  |  483 ++++++++
 .../d3-dashboard/part-144.md                  |  490 ++++++++
 .../d3-dashboard/part-145.md                  |  494 ++++++++
 .../d3-dashboard/part-146.md                  |  483 ++++++++
 .../visualize-data-with-a-bar-chart.md        |   53 +
 .../visualize-data-with-a-choropleth-map.md   |   52 +
 .../visualize-data-with-a-heat-map.md         |   61 +
 ...visualize-data-with-a-scatterplot-graph.md |   57 +
 .../visualize-data-with-a-treemap-diagram.md  |   53 +
 .../add-a-hover-effect-to-a-d3-element.md     |  118 ++
 .../add-a-tooltip-to-a-d3-element.md          |  175 +++
 .../add-attributes-to-the-circle-elements.md  |  211 ++++
 .../add-axes-to-a-visualization.md            |  198 +++
 .../add-classes-with-d3.md                    |   93 ++
 .../add-document-elements-with-d3.md          |  105 ++
 .../add-inline-styling-to-elements.md         |   76 ++
 .../add-labels-to-d3-elements.md              |  153 +++
 .../add-labels-to-scatter-plot-circles.md     |  224 ++++
 .../change-styles-based-on-data.md            |  123 ++
 .../change-the-color-of-an-svg-element.md     |   88 ++
 .../change-the-presentation-of-a-bar-chart.md |  161 +++
 ...te-a-bar-for-each-data-point-in-the-set.md |  110 ++
 .../create-a-linear-scale-with-d3.md          |   88 ++
 .../create-a-scatterplot-with-svg-circles.md  |  103 ++
 .../display-shapes-with-svg.md                |  103 ++
 ...namically-change-the-height-of-each-bar.md |  145 +++
 ...ically-set-the-coordinates-for-each-bar.md |  151 +++
 .../invert-svg-elements.md                    |  143 +++
 .../learn-about-svg-in-d3.md                  |   93 ++
 .../select-a-group-of-elements-with-d3.md     |   82 ++
 .../set-a-domain-and-a-range-on-a-scale.md    |  106 ++
 .../style-d3-labels.md                        |  110 ++
 ...te-the-height-of-an-element-dynamically.md |  137 +++
 ...e-a-pre-defined-scale-to-place-elements.md |  347 ++++++
 .../use-dynamic-scales.md                     |  156 +++
 ...minimum-and-maximum-values-in-a-dataset.md |   91 ++
 .../work-with-data-in-d3.md                   |  105 ++
 .../work-with-dynamic-data-in-d3.md           |  122 ++
 .../access-the-json-data-from-an-api.md       |  167 +++
 .../change-text-with-click-events.md          |  140 +++
 .../convert-json-data-to-html.md              |  199 +++
 ...on-data-to-find-a-users-gps-coordinates.md |   98 ++
 ...t-json-with-the-javascript-fetch-method.md |  174 +++
 ...th-the-javascript-xmlhttprequest-method.md |  196 +++
 ...h-javascript-using-the-onclick-property.md |  140 +++
 ...th-the-javascript-xmlhttprequest-method.md |  206 ++++
 ...re-filter-json-to-get-the-data-you-need.md |  171 +++
 .../render-images-from-data-sources.md        |  163 +++
 .../exercise-tracker.md                       |  255 ++++
 .../file-metadata-microservice.md             |   88 ++
 .../request-header-parser-microservice.md     |   77 ++
 .../timestamp-microservice.md                 |  154 +++
 .../url-shortener-microservice.md             |  119 ++
 ...hain-middleware-to-create-a-time-server.md |   79 ++
 .../get-data-from-post-requests.md            |   78 ++
 ...t-query-parameter-input-from-the-client.md |   67 +
 ...t-route-parameter-input-from-the-client.md |   65 +
 ...-a-root-level-request-logger-middleware.md |   57 +
 .../meet-the-node-console.md                  |   53 +
 .../serve-an-html-file.md                     |   51 +
 .../serve-json-on-a-specific-route.md         |   47 +
 .../serve-static-assets.md                    |   51 +
 .../start-a-working-express-server.md         |   57 +
 .../use-body-parser-to-parse-post-requests.md |   61 +
 .../use-the-.env-file.md                      |   52 +
 .../add-a-description-to-your-package.json.md |   52 +
 .../add-a-license-to-your-package.json.md     |   48 +
 .../add-a-version-to-your-package.json.md     |   46 +
 .../add-keywords-to-your-package.json.md      |   84 ++
 ...project-with-external-packages-from-npm.md |   77 ++
 ...e-of-any-node.js-project-or-npm-package.md |   60 +
 ...es-by-understanding-semantic-versioning.md |   73 ++
 ...remove-a-package-from-your-dependencies.md |   52 +
 ...he-latest-minor-version-of-a-dependency.md |   75 ++
 ...he-latest-patch-version-of-a-dependency.md |   75 ++
 ...-query-helpers-to-narrow-search-results.md |   76 ++
 .../mongodb-and-mongoose/create-a-model.md    |   88 ++
 .../create-and-save-a-record-of-a-model.md    |   56 +
 .../create-many-records-with-model.create.md  |   68 +
 ...delete-many-documents-with-model.remove.md |   57 +
 ...-document-using-model.findbyidandremove.md |   53 +
 .../install-and-set-up-mongoose.md            |   85 ++
 ...-updates-by-running-find-edit-then-save.md |   54 +
 ...a-document-using-model.findoneandupdate.md |   58 +
 .../use-model.find-to-search-your-database.md |   53 +
 ....findbyid-to-search-your-database-by-id.md |   48 +
 ...le-matching-document-from-your-database.md |   51 +
 .../announce-new-users.md                     |   90 ++
 .../authentication-strategies.md              |   96 ++
 .../authentication-with-socket.io.md          |  150 +++
 .../clean-up-your-project-with-modules.md     |   64 +
 .../communicate-by-emitting.md                |  107 ++
 .../create-new-middleware.md                  |   87 ++
 .../handle-a-disconnect.md                    |   69 ++
 .../hashing-your-passwords.md                 |   86 ++
 .../how-to-put-a-profile-together.md          |   57 +
 .../how-to-use-passport-strategies.md         |   79 ++
 ...nt-the-serialization-of-a-passport-user.md |   91 ++
 ...lementation-of-social-authentication-ii.md |  114 ++
 ...ementation-of-social-authentication-iii.md |   80 ++
 ...implementation-of-social-authentication.md |   82 ++
 .../logging-a-user-out.md                     |   81 ++
 .../registration-of-new-users.md              |  205 +++
 .../send-and-display-chat-messages.md         |   79 ++
 .../serialization-of-a-user-object.md         |  131 ++
 .../set-up-a-template-engine.md               |  116 ++
 .../set-up-passport.md                        |  132 ++
 .../set-up-the-environment.md                 |  148 +++
 .../use-a-template-engines-powers.md          |   53 +
 ...ality-with-.deepequal-and-.notdeepequal.md |   79 ++
 .../compare-the-properties-of-two-elements.md |  109 ++
 .../learn-how-javascript-assertions-work.md   |   75 ++
 ...sponse-using-chai-http-iii---put-method.md |  140 +++
 ...esponse-using-chai-http-iv---put-method.md |  124 ++
 ...sts-on-api-endpoints-using-chai-http-ii.md |   75 ++
 ...-tests-on-api-endpoints-using-chai-http.md |  101 ++
 ...ional-tests-using-a-headless-browser-ii.md |  115 ++
 ...nctional-tests-using-a-headless-browser.md |  140 +++
 ...mulate-actions-using-a-headless-browser.md |   76 ++
 .../test-for-truthiness.md                    |  101 ++
 .../test-if-a-string-contains-a-substring.md  |   79 ++
 ...f-a-value-falls-within-a-specific-range.md |   87 ++
 .../test-if-a-value-is-a-string.md            |   93 ++
 .../test-if-a-value-is-an-array.md            |   77 ++
 ...ue-is-of-a-specific-data-structure-type.md |  133 ++
 ...st-if-a-variable-or-function-is-defined.md |   95 ++
 .../test-if-an-array-contains-an-item.md      |   77 ++
 .../test-if-an-object-has-a-property.md       |   93 ++
 ...-object-is-an-instance-of-a-constructor.md |  115 ++
 ...s-below-or-at-least-as-large-as-another.md |  109 ++
 .../use-assert.isok-and-assert.isnotok.md     |   87 ++
 ...se-regular-expressions-to-test-a-string.md |   79 ++
 ...se-the-double-equals-to-assert-equality.md |  111 ++
 ...triple-equals-to-assert-strict-equality.md |  111 ++
 .../american-british-translator.md            |  337 +++++
 .../issue-tracker.md                          |  369 ++++++
 .../metric-imperial-converter.md              |  318 +++++
 .../personal-library.md                       |  221 ++++
 .../sudoku-solver.md                          |  379 ++++++
 .../build-your-own-functions.md               |   67 +
 .../comparing-and-sorting-tuples.md           |   57 +
 .../conditional-execution.md                  |   50 +
 .../data-visualization-mailing-lists.md       |   52 +
 .../data-visualization-page-rank.md           |   30 +
 .../dictionaries-and-loops.md                 |   49 +
 .../dictionaries-common-applications.md       |   43 +
 .../files-as-a-sequence.md                    |   40 +
 .../intermediate-expressions.md               |   52 +
 .../intermediate-strings.md                   |   49 +
 .../introduction-elements-of-python.md        |   36 +
 .../introduction-hardware-achitecture.md      |   30 +
 .../introduction-python-as-a-language.md      |   39 +
 .../introduction-why-program.md               |   38 +
 .../iterations-definite-loops.md              |   39 +
 .../iterations-loop-idioms.md                 |   45 +
 .../iterations-more-patterns.md               |   48 +
 .../loops-and-iterations.md                   |   51 +
 .../make-a-relational-database.md             |   48 +
 .../more-conditional-structures.md            |   56 +
 .../networking-protocol.md                    |   34 +
 .../networking-text-processing.md             |   30 +
 .../networking-using-urllib-in-python.md      |   37 +
 .../networking-web-scraping-with-python.md    |   56 +
 .../networking-with-python.md                 |   34 +
 .../networking-write-a-web-browser.md         |   50 +
 .../python-for-everybody/object-lifecycle.md  |   67 +
 .../objects-a-sample-class.md                 |   58 +
 .../objects-inheritance.md                    |   34 +
 .../python-dictionaries.md                    |   55 +
 .../python-for-everybody/python-functions.md  |   38 +
 .../python-for-everybody/python-lists.md      |   39 +
 .../python-for-everybody/python-objects.md    |   34 +
 .../python-for-everybody/reading-files.md     |   38 +
 ...xpressions-matching-and-extracting-data.md |   41 +
 ...ular-expressions-practical-applications.md |   34 +
 .../regular-expressions.md                    |   38 +
 .../relational-database-design.md             |   34 +
 .../relational-databases-and-sqlite.md        |   34 +
 .../relational-databases-join-operation.md    |   30 +
 ...al-databases-many-to-many-relationships.md |   48 +
 ...ational-databases-relationship-building.md |   30 +
 ...-relationships-in-a-relational-database.md |   34 +
 .../python-for-everybody/strings-and-lists.md |   47 +
 .../python-for-everybody/strings-in-python.md |   59 +
 .../the-tuples-collection.md                  |   59 +
 .../using-web-services.md                     |   38 +
 .../variables-expressions-and-statements.md   |   34 +
 .../visualizing-data-with-python.md           |   38 +
 ...services-api-rate-limiting-and-security.md |   46 +
 .../python-for-everybody/web-services-apis.md |   34 +
 .../python-for-everybody/web-services-json.md |   56 +
 .../web-services-service-oriented-approach.md |   30 +
 .../web-services-xml-schema.md                |   30 +
 .../python-for-everybody/web-services-xml.md  |   43 +
 .../working-with-lists.md                     |   34 +
 .../arithmetic-formatter.md                   |   44 +
 .../budget-app.md                             |   44 +
 .../polygon-area-calculator.md                |   44 +
 .../probability-calculator.md                 |   42 +
 .../time-calculator.md                        |   42 +
 .../data-analysis-example-a.md                |   43 +
 .../data-analysis-example-b.md                |   39 +
 .../data-cleaning-and-visualizations.md       |   43 +
 .../data-cleaning-duplicates.md               |   39 +
 .../data-cleaning-introduction.md             |   58 +
 .../data-cleaning-with-dataframes.md          |   70 ++
 .../how-to-use-jupyter-notebooks-intro.md     |   39 +
 .../introduction-to-data-analysis.md          |   39 +
 .../jupyter-notebooks-cells.md                |   38 +
 ...-notebooks-importing-and-exporting-data.md |   47 +
 .../numpy-algebra-and-size.md                 |   43 +
 .../numpy-arrays.md                           |   59 +
 .../numpy-boolean-arrays.md                   |   57 +
 .../numpy-introduction-a.md                   |   39 +
 .../numpy-introduction-b.md                   |   43 +
 .../numpy-operations.md                       |   50 +
 ...onal-selection-and-modifying-dataframes.md |   73 ++
 .../pandas-creating-columns.md                |   58 +
 .../pandas-dataframes.md                      |   66 +
 ...ndas-indexing-and-conditional-selection.md |   65 +
 .../pandas-introduction.md                    |   68 +
 .../parsing-html-and-saving-data.md           |   43 +
 .../python-functions-and-collections.md       |   39 +
 .../python-introduction.md                    |   43 +
 .../python-iteration-and-modules.md           |   56 +
 .../reading-data-csv-and-txt.md               |   55 +
 .../reading-data-from-databases.md            |   39 +
 .../reading-data-introduction.md              |   72 ++
 .../demographic-data-analyzer.md              |   33 +
 ...-variance-standard-deviation-calculator.md |   33 +
 .../medical-data-visualizer.md                |   33 +
 .../page-view-time-series-visualizer.md       |   33 +
 .../sea-level-predictor.md                    |   33 +
 ...ng-and-changing-elements,-rows,-columns.md |   50 +
 .../numpy/basics-of-numpy.md                  |   45 +
 .../numpy/copying-arrays-warning.md           |   44 +
 .../numpy/initialize-array-problem.md         |   61 +
 .../numpy/initializing-different-arrays.md    |   44 +
 .../loading-data-and-advanced-indexing.md     |   56 +
 .../numpy/mathematics.md                      |   49 +
 .../numpy/reorganizing-arrays.md              |   49 +
 .../numpy/what-is-numpy.md                    |   34 +
 .../anonymous-message-board.md                |  172 +++
 .../port-scanner.md                           |   43 +
 .../secure-real-time-multiplayer-game.md      |  175 +++
 .../sha-1-password-cracker.md                 |   43 +
 .../stock-price-checker.md                    |  134 ++
 ...ur-site-via-https-only-with-helmet.hsts.md |   63 +
 ...-response-mime-type-with-helmet.nosniff.md |   42 +
 ...lmet-using-the-parent-helmet-middleware.md |   50 +
 ...client-side-caching-with-helmet.nocache.md |   47 +
 ...fetching-with-helmet.dnsprefetchcontrol.md |   44 +
 ...sh-and-compare-passwords-asynchronously.md |   81 ++
 ...ash-and-compare-passwords-synchronously.md |   66 +
 ...-information-using-helmet.hidepoweredby.md |   40 +
 .../install-and-require-helmet.md             |   53 +
 ...-of-clickjacking-with-helmet.frameguard.md |   64 +
 ...pting-xss-attacks-with-helmet.xssfilter.md |   52 +
 ...ing-untrusted-html-with-helmet.ienoopen.md |   44 +
 ...olicy-with-helmet.contentsecuritypolicy.md |   71 ++
 .../understand-bcrypt-hashes.md               |   72 ++
 .../creating-a-tcp-client.md                  |   30 +
 .../developing-a-banner-grabber.md            |   43 +
 .../developing-a-port-scanner.md              |   30 +
 .../developing-an-nmap-scanner-part-1.md      |   30 +
 .../developing-an-nmap-scanner-part-2.md      |   30 +
 .../introduction-and-setup.md                 |   30 +
 ...nding-sockets-and-creating-a-tcp-server.md |   30 +
 .../find-the-symmetric-difference.md          |  150 +++
 .../algorithms/implement-bubble-sort.md       |  140 +++
 .../algorithms/implement-insertion-sort.md    |  131 ++
 .../algorithms/implement-merge-sort.md        |  158 +++
 .../algorithms/implement-quick-sort.md        |  142 +++
 .../algorithms/implement-selection-sort.md    |  134 ++
 .../algorithms/inventory-update.md            |  228 ++++
 .../algorithms/no-repeats-please.md           |  126 ++
 .../algorithms/pairwise.md                    |  100 ++
 ...d-a-new-element-to-a-binary-search-tree.md |  191 +++
 ...ts-at-a-specific-index-in-a-linked-list.md |  161 +++
 .../data-structures/adjacency-list.md         |   91 ++
 .../data-structures/adjacency-matrix.md       |  108 ++
 .../data-structures/breadth-first-search.md   |  182 +++
 ...ment-is-present-in-a-binary-search-tree.md |  175 +++
 .../check-if-binary-search-tree.md            |  136 ++
 .../create-a-circular-queue.md                |  235 ++++
 .../create-a-doubly-linked-list.md            |  216 ++++
 .../data-structures/create-a-hash-table.md    |  260 ++++
 .../create-a-linked-list-class.md             |  145 +++
 .../create-a-map-data-structure.md            |  204 +++
 .../create-a-priority-queue-class.md          |  231 ++++
 .../data-structures/create-a-queue-class.md   |  174 +++
 .../data-structures/create-a-set-class.md     |  219 ++++
 .../data-structures/create-a-stack-class.md   |  167 +++
 .../create-a-trie-search-tree.md              |  151 +++
 .../create-an-es6-javascript-map.md           |   43 +
 .../create-and-add-to-sets-in-es6.md          |   92 ++
 ...ete-a-leaf-node-in-a-binary-search-tree.md |  195 +++
 ...-with-one-child-in-a-binary-search-tree.md |  285 +++++
 ...th-two-children-in-a-binary-search-tree.md |  399 ++++++
 .../data-structures/depth-first-search.md     |  208 ++++
 ...-maximum-height-of-a-binary-search-tree.md |  346 ++++++
 ...d-maximum-value-in-a-binary-search-tree.md |  369 ++++++
 .../implement-heap-sort-with-a-min-heap.md    |  144 +++
 .../data-structures/incidence-matrix.md       |  110 ++
 .../insert-an-element-into-a-max-heap.md      |  153 +++
 .../data-structures/invert-a-binary-tree.md   |  192 +++
 .../learn-how-a-stack-works.md                |   71 ++
 ...erform-a-difference-on-two-sets-of-data.md |  219 ++++
 ...form-a-subset-check-on-two-sets-of-data.md |  302 +++++
 .../perform-a-union-on-two-sets.md            |  155 +++
 ...orm-an-intersection-on-two-sets-of-data.md |  184 +++
 .../remove-an-element-from-a-max-heap.md      |  143 +++
 ...ve-elements-from-a-linked-list-by-index.md |  242 ++++
 .../remove-elements-from-a-linked-list.md     |  210 ++++
 .../remove-items-from-a-set-in-es6.md         |   64 +
 .../reverse-a-doubly-linked-list.md           |  205 +++
 .../search-within-a-linked-list.md            |  293 +++++
 .../data-structures/typed-arrays.md           |   94 ++
 .../use-.has-and-.size-on-an-es6-set.md       |   73 ++
 ...th-first-search-in-a-binary-search-tree.md |  261 ++++
 ...th-first-search-in-a-binary-search-tree.md |  328 +++++
 ...pread-and-notes-for-es5-set-integration.md |   59 +
 .../work-with-nodes-in-a-linked-list.md       |   55 +
 .../problem-1-multiples-of-3-and-5.md         |   73 ++
 .../problem-10-summation-of-primes.md         |   81 ++
 .../problem-100-arranged-probability.md       |   87 ++
 .../problem-101-optimum-polynomial.md         |   52 +
 .../problem-102-triangle-containment.md       |  156 +++
 ...problem-103-special-subset-sums-optimum.md |   54 +
 .../problem-104-pandigital-fibonacci-ends.md  |   44 +
 ...problem-105-special-subset-sums-testing.md |   48 +
 ...em-106-special-subset-sums-meta-testing.md |   50 +
 .../problem-107-minimal-network.md            |   42 +
 .../problem-108-diophantine-reciprocals-i.md  |   48 +
 .../project-euler/problem-109-darts.md        |   54 +
 .../problem-11-largest-product-in-a-grid.md   |  182 +++
 .../problem-110-diophantine-reciprocals-ii.md |   44 +
 .../problem-111-primes-with-runs.md           |   50 +
 .../problem-112-bouncy-numbers.md             |   48 +
 .../problem-113-non-bouncy-numbers.md         |   46 +
 ...oblem-114-counting-block-combinations-i.md |   40 +
 ...blem-115-counting-block-combinations-ii.md |   50 +
 .../problem-116-red-green-or-blue-tiles.md    |   46 +
 .../problem-117-red-green-and-blue-tiles.md   |   40 +
 .../problem-118-pandigital-prime-sets.md      |   40 +
 .../problem-119-digit-power-sum.md            |   44 +
 ...m-12-highly-divisible-triangular-number.md |  139 +++
 .../problem-120-square-remainders.md          |   42 +
 .../problem-121-disc-game-prize-fund.md       |   44 +
 .../problem-122-efficient-exponentiation.md   |   52 +
 .../problem-123-prime-square-remainders.md    |   44 +
 .../problem-124-ordered-radicals.md           |   66 +
 .../problem-125-palindromic-sums.md           |   42 +
 .../problem-126-cuboid-layers.md              |   40 +
 .../project-euler/problem-127-abc-hits.md     |   62 +
 .../problem-128-hexagonal-tile-differences.md |   42 +
 .../problem-129-repunit-divisibility.md       |   44 +
 .../project-euler/problem-13-large-sum.md     |  286 +++++
 ...-composites-with-prime-repunit-property.md |   46 +
 .../problem-131-prime-cube-partnership.md     |   44 +
 .../problem-132-large-repunit-factors.md      |   42 +
 .../problem-133-repunit-nonfactors.md         |   44 +
 .../problem-134-prime-pair-connection.md      |   42 +
 .../problem-135-same-differences.md           |   44 +
 .../problem-136-singleton-difference.md       |   44 +
 .../problem-137-fibonacci-golden-nuggets.md   |   54 +
 ...problem-138-special-isosceles-triangles.md |   40 +
 .../problem-139-pythagorean-tiles.md          |   42 +
 .../problem-14-longest-collatz-sequence.md    |  111 ++
 ...m-140-modified-fibonacci-golden-nuggets.md |   46 +
 ...ressive-numbers-n-which-are-also-square.md |   46 +
 .../problem-142-perfect-square-collection.md  |   38 +
 ...ting-the-torricelli-point-of-a-triangle.md |   44 +
 ...ng-multiple-reflections-of-a-laser-beam.md |   46 +
 ...ble-numbers-are-there-below-one-billion.md |   42 +
 ...oblem-146-investigating-a-prime-pattern.md |   40 +
 ...m-147-rectangles-in-cross-hatched-grids.md |   44 +
 .../problem-148-exploring-pascals-triangle.md |   54 +
 ...searching-for-a-maximum-sum-subsequence.md |   52 +
 .../project-euler/problem-15-lattice-paths.md |   68 +
 ...y-for-a-sub-triangle-having-minimum-sum.md |   58 +
 ...tandard-sizes-an-expected-value-problem.md |   46 +
 ...ng-one-half-as-a-sum-of-inverse-squares.md |   42 +
 ...lem-153-investigating-gaussian-integers.md |   70 ++
 .../problem-154-exploring-pascals-pyramid.md  |   40 +
 ...problem-155-counting-capacitor-circuits.md |   44 +
 .../problem-156-counting-digits.md            |   52 +
 ...em-157-solving-the-diophantine-equation.md |   82 ++
 ...hically-after-its-neighbour-to-the-left.md |   55 +
 ...159-digital-root-sums-of-factorisations.md |   44 +
 .../problem-16-power-digit-sum.md             |   85 ++
 .../problem-160-factorial-trailing-digits.md  |   48 +
 .../project-euler/problem-161-triominoes.md   |   46 +
 .../problem-162-hexadecimal-numbers.md        |   52 +
 .../problem-163-cross-hatched-triangles.md    |   40 +
 ...s-have-a-sum-greater-than-a-given-value.md |   41 +
 .../problem-165-intersections.md              |   46 +
 .../project-euler/problem-166-criss-cross.md  |   46 +
 ...roblem-167-investigating-ulam-sequences.md |   48 +
 .../problem-168-number-rotations.md           |   44 +
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |   53 +
 .../problem-17-number-letter-counts.md        |  130 ++
 ...can-be-formed-by-concatenating-products.md |   49 +
 ...f-the-squares-of-the-digits-is-a-square.md |   49 +
 ...gating-numbers-with-few-repeated-digits.md |   38 +
 ...ent-hollow-square-laminae-can-be-formed.md |   43 +
 ...one-two-three-...-distinct-arrangements.md |   45 +
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |   45 +
 ...-angled-triangles-that-share-a-cathetus.md |   40 +
 ...oblem-177-integer-angled-quadrilaterals.md |   40 +
 .../project-euler/problem-178-step-numbers.md |   46 +
 ...oblem-179-consecutive-positive-divisors.md |   38 +
 .../problem-18-maximum-path-sum-i.md          |  109 ++
 ...-zeros-of-a-function-of-three-variables.md |   54 +
 ...of-two-different-colours-can-be-grouped.md |   47 +
 .../problem-182-rsa-encryption.md             |  113 ++
 .../problem-183-maximum-product-of-parts.md   |   54 +
 ...lem-184-triangles-containing-the-origin.md |   44 +
 .../project-euler/problem-185-number-mind.md  |   48 +
 .../problem-186-connectedness-of-a-network.md |   48 +
 .../project-euler/problem-187-semiprimes.md   |   42 +
 ...188-the-hyperexponentiation-of-a-number.md |   44 +
 ...lem-189-tri-colouring-a-triangular-grid.md |   46 +
 .../problem-19-counting-sundays.md            |   76 ++
 ...oblem-190-maximising-a-weighted-product.md |   42 +
 .../problem-191-prize-strings.md              |   46 +
 .../problem-192-best-approximations.md        |   46 +
 .../problem-193-squarefree-numbers.md         |   40 +
 .../problem-194-coloured-configurations.md    |   48 +
 ...-triangles-with-one-angle-of-60-degrees.md |   48 +
 .../problem-196-prime-triplets.md             |   54 +
 ...viour-of-a-recursively-defined-sequence.md |   42 +
 .../problem-198-ambiguous-numbers.md          |   42 +
 .../problem-199-iterative-circle-packing.md   |   75 ++
 .../problem-2-even-fibonacci-numbers.md       |  103 ++
 .../problem-20-factorial-digit-sum.md         |   79 ++
 ...ontaining-the-contiguous-sub-string-200.md |   49 +
 .../problem-201-subsets-with-a-unique-sum.md  |   48 +
 .../project-euler/problem-202-laserbeam.md    |   44 +
 ...em-203-squarefree-binomial-coefficients.md |   46 +
 ...problem-204-generalised-hamming-numbers.md |   46 +
 .../project-euler/problem-205-dice-game.md    |   44 +
 .../problem-206-concealed-square.md           |   38 +
 ...problem-207-integer-partition-equations.md |   48 +
 .../project-euler/problem-208-robot-walks.md  |   42 +
 .../problem-209-circular-logic.md             |   44 +
 .../problem-21-amicable-numbers.md            |   84 ++
 .../problem-210-obtuse-angled-triangles.md    |   46 +
 .../problem-211-divisor-square-sum.md         |   42 +
 .../problem-212-combined-volume-of-cuboids.md |   52 +
 .../project-euler/problem-213-flea-circus.md  |   42 +
 .../problem-214-totient-chains.md             |   48 +
 .../problem-215-crack-free-walls.md           |   44 +
 ...-primality-of-numbers-of-the-form-2n2-1.md |   46 +
 .../problem-217-balanced-numbers.md           |   46 +
 ...blem-218-perfect-right-angled-triangles.md |   50 +
 .../problem-219-skew-cost-coding.md           |   50 +
 .../project-euler/problem-22-names-scores.md  |   90 ++
 .../problem-220-heighway-dragon.md            |   48 +
 .../problem-221-alexandrian-integers.md       |   44 +
 .../problem-222-sphere-packing.md             |   40 +
 ...lem-223-almost-right-angled-triangles-i.md |   40 +
 ...em-224-almost-right-angled-triangles-ii.md |   40 +
 .../problem-225-tribonacci-non-divisors.md    |   44 +
 .../problem-226-a-scoop-of-blancmange.md      |   44 +
 .../project-euler/problem-227-the-chase.md    |   42 +
 .../problem-228-minkowski-sums.md             |   58 +
 ...-229-four-representations-using-squares.md |   52 +
 .../problem-23-non-abundant-sums.md           |  101 ++
 .../problem-230-fibonacci-words.md            |   56 +
 ...-factorisation-of-binomial-coefficients.md |   44 +
 .../project-euler/problem-232-the-race.md     |   44 +
 .../problem-233-lattice-points-on-a-circle.md |   42 +
 .../problem-234-semidivisible-numbers.md      |   46 +
 ...em-235-an-arithmetic-geometric-sequence.md |   44 +
 .../problem-236-luxury-hampers.md             |   48 +
 ...blem-237-tours-on-a-4-x-n-playing-board.md |   50 +
 .../problem-238-infinite-string-tour.md       |   58 +
 .../problem-239-twenty-two-foolish-primes.md  |   42 +
 .../problem-24-lexicographic-permutations.md  |   66 +
 .../project-euler/problem-240-top-dice.md     |   48 +
 .../problem-241-perfection-quotients.md       |   42 +
 .../project-euler/problem-242-odd-triplets.md |   44 +
 .../project-euler/problem-243-resilience.md   |   44 +
 .../project-euler/problem-244-sliders.md      |   54 +
 .../project-euler/problem-245-coresilience.md |   40 +
 .../problem-246-tangents-to-an-ellipse.md     |   46 +
 .../problem-247-squares-under-a-hyperbola.md  |   44 +
 ...which-eulers-totient-function-equals-13.md |   40 +
 .../problem-249-prime-subset-sums.md          |   42 +
 .../problem-25-1000-digit-fibonacci-number.md |   85 ++
 .../project-euler/problem-250-250250.md       |   38 +
 .../problem-251-cardano-triplets.md           |   44 +
 .../project-euler/problem-252-convex-holes.md |   48 +
 .../project-euler/problem-253-tidying-up.md   |   52 +
 .../problem-254-sums-of-digit-factorials.md   |   48 +
 .../problem-255-rounded-square-roots.md       |   50 +
 .../problem-256-tatami-free-rooms.md          |   54 +
 .../problem-257-angular-bisectors.md          |   46 +
 ...problem-258-a-lagged-fibonacci-sequence.md |   40 +
 .../problem-259-reachable-numbers.md          |   42 +
 .../problem-26-reciprocal-cycles.md           |   68 +
 .../project-euler/problem-260-stone-game.md   |   50 +
 .../problem-261-pivotal-square-sums.md        |   42 +
 .../problem-262-mountain-range.md             |   48 +
 ...roblem-263-an-engineers-dream-come-true.md |   54 +
 .../problem-264-triangle-centres.md           |   54 +
 .../problem-265-binary-circles.md             |   48 +
 .../problem-266-pseudo-square-root.md         |   46 +
 .../project-euler/problem-267-billionaire.md  |   48 +
 ...ur-distinct-prime-factors-less-than-100.md |   43 +
 ...ynomials-with-at-least-one-integer-root.md |   48 +
 .../problem-27-quadratic-primes.md            |   78 ++
 .../problem-270-cutting-squares.md            |   48 +
 .../problem-271-modular-cubes-part-1.md       |   42 +
 .../problem-272-modular-cubes-part-2.md       |   42 +
 .../problem-273-sum-of-squares.md             |   40 +
 .../problem-274-divisibility-multipliers.md   |   50 +
 .../problem-275-balanced-sculptures.md        |   50 +
 .../problem-276-primitive-triangles.md        |   42 +
 ...problem-277-a-modified-collatz-sequence.md |   52 +
 ...m-278-linear-combinations-of-semiprimes.md |   44 +
 ...th-integral-sides-and-an-integral-angle.md |   38 +
 .../problem-28-number-spiral-diagonals.md     |   83 ++
 .../problem-280-ant-and-seeds.md              |   42 +
 .../problem-281-pizza-toppings.md             |   44 +
 .../problem-282-the-ackermann-function.md     |   42 +
 ...h-the-area--perimeter-ratio-is-integral.md |   49 +
 .../problem-284-steady-squares.md             |   44 +
 .../problem-285-pythagorean-odds.md           |   46 +
 .../problem-286-scoring-probabilities.md      |   42 +
 ...encoding-a-simple-compression-algorithm.md |   54 +
 .../problem-288-an-enormous-factorial.md      |   48 +
 .../problem-289-eulerian-cycles.md            |   48 +
 .../problem-29-distinct-powers.md             |   86 ++
 .../problem-290-digital-signature.md          |   38 +
 .../problem-291-panaitopol-primes.md          |   40 +
 .../problem-292-pythagorean-polygons.md       |   48 +
 .../problem-293-pseudo-fortunate-numbers.md   |   46 +
 ...oblem-294-sum-of-digits---experience-23.md |   46 +
 .../problem-295-lenticular-holes.md           |   56 +
 ...roblem-296-angular-bisector-and-tangent.md |   42 +
 .../problem-297-zeckendorf-representation.md  |   46 +
 .../problem-298-selective-amnesia.md          |   44 +
 .../problem-299-three-similar-triangles.md    |   50 +
 .../problem-3-largest-prime-factor.md         |   95 ++
 .../problem-30-digit-n-powers.md              |   74 ++
 .../problem-300-protein-folding.md            |   50 +
 .../project-euler/problem-301-nim.md          |   53 +
 .../problem-302-strong-achilles-numbers.md    |   50 +
 ...problem-303-multiples-with-small-digits.md |   44 +
 .../project-euler/problem-304-primonacci.md   |   46 +
 .../problem-305-reflexive-position.md         |   46 +
 .../problem-306-paper-strip-game.md           |   46 +
 .../project-euler/problem-307-chip-defects.md |   42 +
 ...8-an-amazing-prime-generating-automaton.md |   46 +
 .../problem-309-integer-ladders.md            |   44 +
 .../project-euler/problem-31-coin-sums.md     |   77 ++
 .../project-euler/problem-310-nim-square.md   |   46 +
 ...em-311-biclinic-integral-quadrilaterals.md |   48 +
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |   46 +
 .../project-euler/problem-313-sliding-game.md |   44 +
 .../problem-314-the-mouse-on-the-moon.md      |   46 +
 .../problem-315-digital-root-clocks.md        |   58 +
 ...oblem-316-numbers-in-decimal-expansions.md |   50 +
 .../project-euler/problem-317-firecracker.md  |   42 +
 .../project-euler/problem-318-2011-nines.md   |   68 +
 .../problem-319-bounded-sequences.md          |   50 +
 .../problem-32-pandigital-products.md         |  118 ++
 ...-factorials-divisible-by-a-huge-integer.md |   44 +
 .../problem-321-swapping-counters.md          |   46 +
 ...2-binomial-coefficients-divisible-by-10.md |   42 +
 ...itwise-or-operations-on-random-integers.md |   48 +
 .../problem-324-building-a-tower.md           |   42 +
 .../problem-325-stone-game-ii.md              |   50 +
 .../problem-326-modulo-summations.md          |   48 +
 .../problem-327-rooms-of-doom.md              |   54 +
 .../problem-328-lowest-cost-search.md         |   56 +
 .../project-euler/problem-329-prime-frog.md   |   48 +
 .../problem-33-digit-cancelling-fractions.md  |  102 ++
 .../problem-330-eulers-number.md              |   54 +
 .../project-euler/problem-331-cross-flips.md  |   50 +
 .../problem-332-spherical-triangles.md        |   44 +
 .../problem-333-special-partitions.md         |   50 +
 .../problem-334-spilling-the-beans.md         |   48 +
 .../problem-335-gathering-the-beans.md        |   44 +
 .../problem-336-maximix-arrangements.md       |   50 +
 ...problem-337-totient-stairstep-sequences.md |   52 +
 ...blem-338-cutting-rectangular-grid-paper.md |   50 +
 .../problem-339-peredur-fab-efrawg.md         |   42 +
 .../problem-34-digit-factorials.md            |   50 +
 .../problem-340-crazy-function.md             |   48 +
 ...em-341-golombs-self-describing-sequence.md |   44 +
 ...m-342-the-totient-of-a-square-is-a-cube.md |   46 +
 .../problem-343-fractional-sequences.md       |   56 +
 .../problem-344-silver-dollar-game.md         |   54 +
 .../project-euler/problem-345-matrix-sum.md   |   44 +
 .../problem-346-strong-repunits.md            |   42 +
 ...largest-integer-divisible-by-two-primes.md |   48 +
 .../problem-348-sum-of-a-square-and-a-cube.md |   42 +
 .../project-euler/problem-349-langtons-ant.md |   46 +
 .../problem-35-circular-primes.md             |  132 ++
 ...e-least-greatest-and-the-greatest-least.md |   48 +
 .../problem-351-hexagonal-orchards.md         |   46 +
 .../project-euler/problem-352-blood-tests.md  |   56 +
 .../project-euler/problem-353-risky-moon.md   |   52 +
 ...oblem-354-distances-in-a-bees-honeycomb.md |   42 +
 .../problem-355-maximal-coprime-subset.md     |   42 +
 ...-356-largest-roots-of-cubic-polynomials.md |   44 +
 .../problem-357-prime-generating-integers.md  |   42 +
 .../problem-358-cyclic-numbers.md             |   48 +
 .../problem-359-hilberts-new-hotel.md         |   48 +
 .../problem-36-double-base-palindromes.md     |   66 +
 .../project-euler/problem-360-scary-sphere.md |   44 +
 ...-361-subsequence-of-thue-morse-sequence.md |   54 +
 .../problem-362-squarefree-factors.md         |   52 +
 .../project-euler/problem-363-bzier-curves.md |   48 +
 .../problem-364-comfortable-distance.md       |   48 +
 ...problem-365-a-huge-binomial-coefficient.md |   42 +
 .../problem-366-stone-game-iii.md             |   54 +
 .../project-euler/problem-367-bozo-sort.md    |   44 +
 .../problem-368-a-kempner-like-series.md      |   46 +
 .../project-euler/problem-369-badugi.md       |   42 +
 .../problem-37-truncatable-primes.md          |   66 +
 .../problem-370-geometric-triangles.md        |   44 +
 .../problem-371-licence-plates.md             |   48 +
 .../problem-372-pencils-of-rays.md            |   40 +
 .../problem-373-circumscribed-circles.md      |   46 +
 ...m-374-maximum-integer-partition-product.md |   52 +
 .../problem-375-minimum-of-subsequences.md    |   54 +
 .../problem-376-nontransitive-sets-of-dice.md |   54 +
 ...problem-377-sum-of-digits-experience-13.md |   46 +
 .../problem-378-triangle-triples.md           |   48 +
 ...problem-379-least-common-multiple-count.md |   44 +
 .../problem-38-pandigital-multiples.md        |  100 ++
 .../problem-380-amazing-mazes.md              |   44 +
 .../problem-381-prime-k-factorial.md          |   44 +
 .../problem-382-generating-polygons.md        |   48 +
 ...isibility-comparison-between-factorials.md |   44 +
 .../problem-384-rudin-shapiro-sequence.md     |   54 +
 .../problem-385-ellipses-inside-triangles.md  |   53 +
 ...blem-386-maximum-length-of-an-antichain.md |   46 +
 .../problem-387-harshad-numbers.md            |   54 +
 .../problem-388-distinct-lines.md             |   44 +
 .../problem-389-platonic-dice.md              |   40 +
 .../problem-39-integer-right-triangles.md     |   91 ++
 ...th-non-rational-sides-and-integral-area.md |   48 +
 .../project-euler/problem-391-hopping-game.md |   52 +
 .../problem-392-enmeshed-unit-circle.md       |   48 +
 .../problem-393-migrating-ants.md             |   44 +
 .../project-euler/problem-394-eating-pie.md   |   52 +
 .../problem-395-pythagorean-tree.md           |   46 +
 .../problem-396-weak-goodstein-sequence.md    |   54 +
 .../problem-397-triangle-on-parabola.md       |   42 +
 .../project-euler/problem-398-cutting-rope.md |   42 +
 ...roblem-399-squarefree-fibonacci-numbers.md |   54 +
 .../problem-4-largest-palindrome-product.md   |   64 +
 .../problem-40-champernownes-constant.md      |   77 ++
 .../problem-400-fibonacci-tree-game.md        |   52 +
 .../problem-401-sum-of-squares-of-divisors.md |   46 +
 .../problem-402-integer-valued-polynomials.md |   48 +
 ...ce-points-enclosed-by-parabola-and-line.md |   44 +
 .../problem-404-crisscross-ellipses.md        |   46 +
 .../problem-405-a-rectangular-tiling.md       |   48 +
 .../problem-406-guessing-game.md              |   56 +
 .../project-euler/problem-407-idempotents.md  |   42 +
 ...lem-408-admissible-paths-through-a-grid.md |   46 +
 .../project-euler/problem-409-nim-extreme.md  |   48 +
 .../problem-41-pandigital-prime.md            |  117 ++
 .../problem-410-circle-and-tangent-line.md    |   44 +
 .../project-euler/problem-411-uphill-paths.md |   46 +
 .../problem-412-gnomon-numbering.md           |   48 +
 .../problem-413-one-child-numbers.md          |   44 +
 .../problem-414-kaprekar-constant.md          |   60 +
 .../project-euler/problem-415-titanic-sets.md |   46 +
 .../project-euler/problem-416-a-frogs-trip.md |   42 +
 .../problem-417-reciprocal-cycles-ii.md       |   48 +
 .../problem-418-factorisation-triples.md      |   46 +
 .../problem-419-look-and-say-sequence.md      |   58 +
 .../problem-42-coded-triangle-numbers.md      |   71 ++
 ...problem-420-2x2-positive-integer-matrix.md |   44 +
 .../problem-421-prime-factors-of-n151.md      |   44 +
 ...m-422-sequence-of-points-on-a-hyperbola.md |   46 +
 .../problem-423-consecutive-die-throws.md     |   50 +
 .../project-euler/problem-424-kakuro.md       |   54 +
 .../problem-425-prime-connection.md           |   50 +
 .../problem-426-box-ball-system.md            |   50 +
 .../project-euler/problem-427-n-sequences.md  |   48 +
 .../problem-428-necklace-of-circles.md        |   54 +
 ...-429-sum-of-squares-of-unitary-divisors.md |   46 +
 .../problem-43-sub-string-divisibility.md     |  126 ++
 .../project-euler/problem-430-range-flips.md  |   48 +
 .../problem-431-square-space-silo.md          |   46 +
 .../project-euler/problem-432-totient-sum.md  |   42 +
 .../problem-433-steps-in-euclids-algorithm.md |   46 +
 .../project-euler/problem-434-rigid-graphs.md |   52 +
 ...em-435-polynomials-of-fibonacci-numbers.md |   44 +
 .../project-euler/problem-436-unfair-wager.md |   54 +
 .../problem-437-fibonacci-primitive-roots.md  |   64 +
 ...-part-of-polynomial-equations-solutions.md |   44 +
 .../problem-439-sum-of-sum-of-divisors.md     |   44 +
 .../problem-44-pentagon-numbers.md            |   77 ++
 .../problem-440-gcd-and-tiling.md             |   48 +
 ...he-inverse-summation-of-coprime-couples.md |   44 +
 .../problem-442-eleven-free-integers.md       |   44 +
 .../project-euler/problem-443-gcd-sequence.md |   48 +
 .../problem-444-the-roundtable-lottery.md     |   53 +
 .../problem-445-retractions-a.md              |   44 +
 .../problem-446-retractions-b.md              |   44 +
 .../problem-447-retractions-c.md              |   44 +
 ...oblem-448-average-least-common-multiple.md |   46 +
 .../problem-449-chocolate-covered-candy.md    |   48 +
 ...-45-triangular-pentagonal-and-hexagonal.md |   82 ++
 ...blem-450-hypocycloid-and-lattice-points.md |   60 +
 .../problem-451-modular-inverses.md           |   60 +
 .../problem-452-long-products.md              |   44 +
 .../problem-453-lattice-quadrilaterals.md     |   46 +
 ...problem-454-diophantine-reciprocals-iii.md |   44 +
 ...problem-455-powers-with-trailing-digits.md |   42 +
 ...-456-triangles-containing-the-origin-ii.md |   48 +
 ...polynomial-modulo-the-square-of-a-prime.md |   46 +
 .../problem-458-permutations-of-project.md    |   44 +
 .../problem-459-flipping-game.md              |   52 +
 .../problem-46-goldbachs-other-conjecture.md  |   99 ++
 .../problem-460-an-ant-on-the-move.md         |   48 +
 .../project-euler/problem-461-almost-pi.md    |  153 +++
 ...lem-462-permutation-of-3-smooth-numbers.md |   52 +
 ...problem-463-a-weird-recurrence-relation.md |   50 +
 ...roblem-464-mbius-function-and-intervals.md |   50 +
 .../problem-465-polar-polygons.md             |   52 +
 ...istinct-terms-in-a-multiplication-table.md |   48 +
 .../project-euler/problem-467-superinteger.md |   50 +
 ...mooth-divisors-of-binomial-coefficients.md |   44 +
 .../project-euler/problem-469-empty-chairs.md |   46 +
 .../problem-47-distinct-primes-factors.md     |  113 ++
 .../project-euler/problem-470-super-ramvok.md |   50 +
 ...oblem-471-triangle-inscribed-in-ellipse.md |   44 +
 .../problem-472-comfortable-distance-ii.md    |   56 +
 .../problem-473-phigital-number-base.md       |   54 +
 .../problem-474-last-digits-of-divisors.md    |   44 +
 .../problem-475-music-festival.md             |   46 +
 .../problem-476-circle-packing-ii.md          |   44 +
 .../problem-477-number-sequence-game.md       |   66 +
 .../project-euler/problem-478-mixtures.md     |   50 +
 .../problem-479-roots-on-the-rise.md          |   46 +
 .../project-euler/problem-48-self-powers.md   |   80 ++
 .../problem-480-the-last-question.md          |  114 ++
 .../problem-49-prime-permutations.md          |   93 ++
 .../problem-5-smallest-multiple.md            |   83 ++
 .../problem-50-consecutive-prime-sum.md       |   95 ++
 .../problem-51-prime-digit-replacements.md    |   48 +
 .../problem-52-permuted-multiples.md          |   81 ++
 .../problem-53-combinatoric-selections.md     |   89 ++
 .../project-euler/problem-54-poker-hands.md   | 1096 +++++++++++++++++
 .../problem-55-lychrel-numbers.md             |  113 ++
 .../problem-56-powerful-digit-sum.md          |  101 ++
 .../problem-57-square-root-convergents.md     |   98 ++
 .../project-euler/problem-58-spiral-primes.md |  105 ++
 .../problem-59-xor-decryption.md              |   58 +
 .../problem-6-sum-square-difference.md        |   78 ++
 .../problem-60-prime-pair-sets.md             |   46 +
 .../problem-61-cyclical-figurate-numbers.md   |  252 ++++
 .../problem-62-cubic-permutations.md          |   97 ++
 .../problem-63-powerful-digit-counts.md       |  122 ++
 .../problem-64-odd-period-square-roots.md     |  148 +++
 .../problem-65-convergents-of-e.md            |  117 ++
 .../problem-66-diophantine-equation.md        |  129 ++
 .../problem-67-maximum-path-sum-ii.md         |   96 ++
 .../problem-68-magic-5-gon-ring.md            |   71 ++
 .../problem-69-totient-maximum.md             |  110 ++
 .../project-euler/problem-7-10001st-prime.md  |   86 ++
 .../problem-70-totient-permutation.md         |  118 ++
 .../problem-71-ordered-fractions.md           |   95 ++
 .../problem-72-counting-fractions.md          |   90 ++
 ...roblem-73-counting-fractions-in-a-range.md |   83 ++
 .../problem-74-digit-factorial-chains.md      |  131 ++
 ...lem-75-singular-integer-right-triangles.md |  117 ++
 .../problem-76-counting-summations.md         |   83 ++
 .../problem-77-prime-summations.md            |  110 ++
 .../problem-78-coin-partitions.md             |  103 ++
 .../problem-79-passcode-derivation.md         |  115 ++
 .../problem-8-largest-product-in-a-series.md  |   92 ++
 ...roblem-80-square-root-digital-expansion.md |  109 ++
 .../problem-81-path-sum-two-ways.md           |  189 +++
 .../problem-82-path-sum-three-ways.md         |  199 +++
 .../problem-83-path-sum-four-ways.md          |  219 ++++
 .../project-euler/problem-84-monopoly-odds.md |  268 ++++
 .../problem-85-counting-rectangles.md         |  109 ++
 .../project-euler/problem-86-cuboid-route.md  |   94 ++
 .../problem-87-prime-power-triples.md         |  131 ++
 .../problem-88-product-sum-numbers.md         |  110 ++
 .../problem-89-roman-numerals.md              |  117 ++
 .../problem-9-special-pythagorean-triplet.md  |   74 ++
 .../problem-90-cube-digit-pairs.md            |   65 +
 ...ight-triangles-with-integer-coordinates.md |  119 ++
 .../problem-92-square-digit-chains.md         |  155 +++
 .../problem-93-arithmetic-expressions.md      |   59 +
 ...problem-94-almost-equilateral-triangles.md |   84 ++
 .../problem-95-amicable-chains.md             |  126 ++
 .../project-euler/problem-96-su-doku.md       |  296 +++++
 .../problem-97-large-non-mersenne-prime.md    |   88 ++
 .../problem-98-anagramic-squares.md           |  205 +++
 .../problem-99-largest-exponential.md         |   83 ++
 .../rosetta-code/100-doors.md                 |   67 +
 .../rosetta-code/24-game.md                   |  203 +++
 .../9-billion-names-of-god-the-integer.md     |  116 ++
 .../rosetta-code/abc-problem.md               |  136 ++
 ...ient-and-perfect-number-classifications.md |   95 ++
 .../rosetta-code/accumulator-factory.md       |   79 ++
 .../rosetta-code/ackermann-function.md        |   71 ++
 .../rosetta-code/align-columns.md             |  194 +++
 .../rosetta-code/amicable-pairs.md            |  126 ++
 .../rosetta-code/averages-mode.md             |   79 ++
 .../averages-pythagorean-means.md             |  144 +++
 .../rosetta-code/averages-root-mean-square.md |   57 +
 .../rosetta-code/babbage-problem.md           |   78 ++
 .../rosetta-code/balanced-brackets.md         |  188 +++
 ...cles-of-given-radius-through-two-points.md |  150 +++
 .../rosetta-code/closest-pair-problem.md      |  414 +++++++
 .../rosetta-code/combinations.md              |   95 ++
 .../rosetta-code/comma-quibbling.md           |  101 ++
 .../rosetta-code/compare-a-list-of-strings.md |  132 ++
 .../convert-seconds-to-compound-duration.md   |  129 ++
 .../count-occurrences-of-a-substring.md       |   79 ++
 .../rosetta-code/count-the-coins.md           |   93 ++
 .../rosetta-code/cramers-rule.md              |  167 +++
 .../cumulative-standard-deviation.md          |  101 ++
 .../rosetta-code/cusip.md                     |  118 ++
 .../rosetta-code/cut-a-rectangle.md           |  203 +++
 .../rosetta-code/date-format.md               |   90 ++
 .../rosetta-code/date-manipulation.md         |  109 ++
 .../rosetta-code/day-of-the-week.md           |   74 ++
 .../rosetta-code/deal-cards-for-freecell.md   |  210 ++++
 .../rosetta-code/deepcopy.md                  |   85 ++
 .../define-a-primitive-data-type.md           |  132 ++
 .../rosetta-code/department-numbers.md        |  126 ++
 .../rosetta-code/discordian-date.md           |  195 +++
 .../rosetta-code/dot-product.md               |   75 ++
 .../rosetta-code/element-wise-operations.md   |  214 ++++
 .../rosetta-code/emirp-primes.md              |  138 +++
 .../rosetta-code/entropy.md                   |   96 ++
 .../rosetta-code/equilibrium-index.md         |  130 ++
 .../rosetta-code/ethiopian-multiplication.md  |  156 +++
 .../rosetta-code/euler-method.md              |  152 +++
 .../evaluate-binomial-coefficients.md         |   74 ++
 .../execute-a-markov-algorithm.md             |  246 ++++
 .../rosetta-code/execute-brain.md             |  202 +++
 .../extensible-prime-generator.md             |  139 +++
 .../rosetta-code/factorial.md                 |   80 ++
 .../factors-of-a-mersenne-number.md           |  148 +++
 .../rosetta-code/factors-of-an-integer.md     |   74 ++
 .../rosetta-code/farey-sequence.md            |  109 ++
 .../fibonacci-n-step-number-sequences.md      |  133 ++
 .../rosetta-code/fibonacci-sequence.md        |   75 ++
 .../rosetta-code/fibonacci-word.md            |  121 ++
 .../rosetta-code/fizzbuzz.md                  |   92 ++
 .../rosetta-code/fractran.md                  |  139 +++
 .../rosetta-code/gamma-function.md            |  104 ++
 .../rosetta-code/gaussian-elimination.md      |  230 ++++
 .../rosetta-code/general-fizzbuzz.md          |  175 +++
 .../generate-lower-case-ascii-alphabet.md     |   99 ++
 .../rosetta-code/generator-exponential.md     |  117 ++
 .../rosetta-code/gray-code.md                 |  122 ++
 .../rosetta-code/greatest-common-divisor.md   |   79 ++
 .../greatest-subsequential-sum.md             |  113 ++
 .../rosetta-code/hailstone-sequence.md        |   98 ++
 .../rosetta-code/happy-numbers.md             |  129 ++
 .../rosetta-code/harshad-or-niven-series.md   |   87 ++
 .../rosetta-code/hash-from-two-arrays.md      |  105 ++
 .../rosetta-code/hash-join.md                 |  237 ++++
 .../rosetta-code/heronian-triangles.md        |  155 +++
 .../hofstadter-figure-figure-sequences.md     |  166 +++
 .../rosetta-code/hofstadter-q-sequence.md     |   92 ++
 .../rosetta-code/i-before-e-except-after-c.md |  101 ++
 .../rosetta-code/iban.md                      |  104 ++
 .../rosetta-code/identity-matrix.md           |   88 ++
 .../rosetta-code/iterated-digits-squaring.md  |   96 ++
 .../rosetta-code/jaro-distance.md             |  146 +++
 .../rosetta-code/jortsort.md                  |   90 ++
 .../rosetta-code/josephus-problem.md          |   98 ++
 .../rosetta-code/k-d-tree.md                  |  469 +++++++
 .../rosetta-code/kaprekar-numbers.md          |  110 ++
 .../rosetta-code/knapsack-problem-0-1.md      |  255 ++++
 .../rosetta-code/knapsack-problem-bounded.md  |  212 ++++
 .../knapsack-problem-continuous.md            |  169 +++
 .../knapsack-problem-unbounded.md             |  185 +++
 .../rosetta-code/knights-tour.md              |  225 ++++
 .../largest-int-from-concatenated-ints.md     |   85 ++
 .../rosetta-code/last-friday-of-each-month.md |   99 ++
 .../rosetta-code/last-letter-first-letter.md  |  211 ++++
 .../rosetta-code/leap-year.md                 |   79 ++
 .../rosetta-code/least-common-multiple.md     |   87 ++
 .../rosetta-code/left-factorials.md           |  115 ++
 .../rosetta-code/letter-frequency.md          |  209 ++++
 .../rosetta-code/levenshtein-distance.md      |  105 ++
 .../linear-congruential-generator.md          |   97 ++
 .../rosetta-code/long-multiplication.md       |  111 ++
 .../longest-common-subsequence.md             |  102 ++
 .../longest-increasing-subsequence.md         |  120 ++
 .../rosetta-code/longest-string-challenge.md  |  101 ++
 .../rosetta-code/look-and-say-sequence.md     |   92 ++
 ...oop-over-multiple-arrays-simultaneously.md |  139 +++
 .../rosetta-code/lu-decomposition.md          |  318 +++++
 .../rosetta-code/lucas-lehmer-test.md         |  109 ++
 .../rosetta-code/ludic-numbers.md             |  129 ++
 .../luhn-test-of-credit-card-numbers.md       |  125 ++
 .../rosetta-code/lychrel-numbers.md           |  151 +++
 .../rosetta-code/lzw-compression.md           |  239 ++++
 .../rosetta-code/s-expressions.md             |   96 ++
 .../sailors-coconuts-and-a-monkey-problem.md  |   90 ++
 .../rosetta-code/search-a-list-of-records.md  |  103 ++
 .../rosetta-code/sedols.md                    |   96 ++
 .../rosetta-code/self-describing-numbers.md   |  100 ++
 .../rosetta-code/self-referential-sequence.md |  202 +++
 .../rosetta-code/semiprime.md                 |  146 +++
 .../rosetta-code/set-consolidation.md         |  196 +++
 .../rosetta-code/set-of-real-numbers.md       |  239 ++++
 .../rosetta-code/sha-1.md                     |  180 +++
 .../rosetta-code/sha-256.md                   |  436 +++++++
 .../sort-an-array-of-composite-structures.md  |  116 ++
 .../rosetta-code/sort-disjoint-sublist.md     |  147 +++
 .../rosetta-code/sort-stability.md            |  168 +++
 .../sort-using-a-custom-comparator.md         |  121 ++
 .../sorting-algorithms-bead-sort.md           |  129 ++
 .../sorting-algorithms-bogosort.md            |  126 ++
 .../sorting-algorithms-cocktail-sort.md       |  140 +++
 .../sorting-algorithms-comb-sort.md           |  179 +++
 .../sorting-algorithms-gnome-sort.md          |  124 ++
 .../sorting-algorithms-pancake-sort.md        |  124 ++
 .../sorting-algorithms-permutation-sort.md    |  131 ++
 .../sorting-algorithms-shell-sort.md          |  106 ++
 .../sorting-algorithms-stooge-sort.md         |  125 ++
 .../sorting-algorithms-strand-sort.md         |  118 ++
 .../rosetta-code/soundex.md                   |  151 +++
 .../rosetta-code/spiral-matrix.md             |  109 ++
 ...ter-string-based-on-change-of-character.md |  145 +++
 .../rosetta-code/state-name-puzzle.md         |  159 +++
 .../rosetta-code/stern-brocot-sequence.md     |  114 ++
 .../rosetta-code/straddling-checkerboard.md   |  186 +++
 .../rosetta-code/stream-merge.md              |  140 +++
 ...s-and-extended-characters-from-a-string.md |   80 ++
 .../rosetta-code/subleq.md                    |  196 +++
 .../rosetta-code/sudoku.md                    |  321 +++++
 .../rosetta-code/sum-digits-of-an-integer.md  |   89 ++
 .../rosetta-code/sum-multiples-of-3-and-5.md  |   77 ++
 .../rosetta-code/sum-of-a-series.md           |   82 ++
 .../rosetta-code/sum-of-squares.md            |   79 ++
 .../rosetta-code/sum-to-100.md                |  180 +++
 .../sutherland-hodgman-polygon-clipping.md    |  199 +++
 .../rosetta-code/symmetric-difference.md      |  121 ++
 .../rosetta-code/taxicab-numbers.md           |  140 +++
 .../tokenize-a-string-with-escaping.md        |  124 ++
 .../rosetta-code/top-rank-per-group.md        |  192 +++
 .../rosetta-code/topological-sort.md          |  185 +++
 .../rosetta-code/towers-of-hanoi.md           |   87 ++
 .../rosetta-code/vector-cross-product.md      |   75 ++
 .../rosetta-code/vector-dot-product.md        |   96 ++
 .../rosetta-code/word-frequency.md            |  136 ++
 .../rosetta-code/word-wrap.md                 |  106 ++
 .../rosetta-code/y-combinator.md              |   87 ++
 .../zeckendorf-number-representation.md       |  205 +++
 .../zhang-suen-thinning-algorithm.md          |  321 +++++
 .../rosetta-code/zig-zag-matrix.md            |  117 ++
 .../build-a-camper-leaderboard.md             |   31 +
 .../build-a-light-bright-app.md               |   37 +
 .../build-a-nightlife-coordination-app.md     |   31 +
 .../build-a-pinterest-clone.md                |   37 +
 .../take-home-projects/build-a-pong-game.md   |   33 +
 .../take-home-projects/build-a-recipe-box.md  |   37 +
 .../build-a-roguelike-dungeon-crawler-game.md |   41 +
 .../take-home-projects/build-a-simon-game.md  |   41 +
 .../build-a-tic-tac-toe-game.md               |   29 +
 .../take-home-projects/build-a-voting-app.md  |   37 +
 .../build-a-wikipedia-viewer.md               |   33 +
 ...build-an-image-search-abstraction-layer.md |   27 +
 .../build-the-game-of-life.md                 |   39 +
 .../chart-the-stock-market.md                 |   29 +
 .../manage-a-book-trading-club.md             |   31 +
 .../map-data-across-the-globe.md              |   31 +
 .../p2p-video-chat-application.md             |   41 +
 ...-contiguity-with-a-force-directed-graph.md |   31 +
 .../show-the-local-weather.md                 |   33 +
 .../use-the-twitch-json-api.md                |   35 +
 .../deep-learning-demystified.md              |   34 +
 .../how-convolutional-neural-networks-work.md |   30 +
 .../how-deep-neural-networks-work.md          |   30 +
 ...rks-rnn-and-long-short-term-memory-lstm.md |   30 +
 .../book-recommendation-engine-using-knn.md   |   35 +
 .../cat-and-dog-image-classifier.md           |   33 +
 ...near-regression-health-costs-calculator.md |   35 +
 .../neural-network-sms-text-classifier.md     |   33 +
 .../rock-paper-scissors.md                    |   33 +
 .../tensorflow/conclusion.md                  |   30 +
 ...al-neural-networks-evaluating-the-model.md |   30 +
 ...ral-networks-picking-a-pretrained-model.md |   49 +
 ...neural-networks-the-convolutional-layer.md |   30 +
 .../convolutional-neural-networks.md          |   30 +
 ...-learning-algorithms-building-the-model.md |   30 +
 ...core-learning-algorithms-classification.md |   30 +
 .../core-learning-algorithms-clustering.md    |   38 +
 ...earning-algorithms-hidden-markov-models.md |   30 +
 ...earning-algorithms-the-training-process.md |   30 +
 ...ng-algorithms-training-and-testing-data.md |   30 +
 ...using-probabilities-to-make-predictions.md |   30 +
 ...e-learning-algorithms-working-with-data.md |   30 +
 .../tensorflow/core-learning-algorithms.md    |   36 +
 ...creating-a-convolutional-neural-network.md |   52 +
 ...roduction-machine-learning-fundamentals.md |   30 +
 .../tensorflow/introduction-to-tensorflow.md  |   38 +
 ...processing-with-rnns-building-the-model.md |   62 +
 ...ssing-with-rnns-create-a-play-generator.md |   40 +
 ...processing-with-rnns-making-predictions.md |   30 +
 ...al-language-processing-with-rnns-part-2.md |   30 +
 ...ing-with-rnns-recurring-neural-networks.md |   34 +
 ...ocessing-with-rnns-sentimental-analysis.md |   50 +
 ...processing-with-rnns-training-the-model.md |   54 +
 .../natural-language-processing-with-rnns.md  |   30 +
 .../neural-networks-activation-functions.md   |   30 +
 .../neural-networks-creating-a-model.md       |   50 +
 .../tensorflow/neural-networks-optimizers.md  |   30 +
 .../neural-networks-with-tensorflow.md        |   30 +
 ...cement-learning-with-q-learning-example.md |   46 +
 ...rcement-learning-with-q-learning-part-2.md |   26 +
 .../reinforcement-learning-with-q-learning.md |   30 +
 .../basic-algorithm-scripting/boo-who.md      |   97 ++
 .../chunky-monkey.md                          |  110 ++
 .../confirm-the-ending.md                     |  113 ++
 .../convert-celsius-to-fahrenheit.md          |   76 ++
 .../factorialize-a-number.md                  |   73 ++
 .../falsy-bouncer.md                          |   63 +
 .../find-the-longest-word-in-a-string.md      |   87 ++
 .../finders-keepers.md                        |   58 +
 .../basic-algorithm-scripting/mutations.md    |  117 ++
 .../repeat-a-string-repeat-a-string.md        |   84 ++
 .../return-largest-numbers-in-arrays.md       |   92 ++
 .../reverse-a-string.md                       |   63 +
 .../slice-and-splice.md                       |   98 ++
 .../title-case-a-sentence.md                  |   64 +
 .../truncate-a-string.md                      |   91 ++
 .../where-do-i-belong.md                      |  143 +++
 ...-arrays-contents-using-bracket-notation.md |   82 ++
 ...ss-property-names-with-bracket-notation.md |  101 ++
 ...items-to-an-array-with-push-and-unshift.md |   87 ++
 .../add-items-using-splice.md                 |   93 ++
 ...d-key-value-pairs-to-javascript-objects.md |  124 ++
 ...the-presence-of-an-element-with-indexof.md |   93 ++
 .../check-if-an-object-has-a-property.md      |  161 +++
 ...combine-arrays-with-the-spread-operator.md |   63 +
 .../copy-an-array-with-the-spread-operator.md |  102 ++
 .../copy-array-items-using-slice.md           |   65 +
 ...create-complex-multi-dimensional-arrays.md |  218 ++++
 ...ray-of-all-object-keys-with-object.keys.md |  111 ++
 ...ugh-all-an-arrays-items-using-for-loops.md |  138 +++
 ...-of-an-object-with-a-for...in-statement.md |  138 +++
 .../modify-an-array-stored-in-an-object.md    |  112 ++
 ...odify-an-object-nested-within-an-object.md |  101 ++
 ...-items-from-an-array-with-pop-and-shift.md |   86 ++
 .../remove-items-using-splice.md              |   87 ++
 ...-an-array-to-store-a-collection-of-data.md |   95 ++
 ...ete-keyword-to-remove-object-properties.md |   86 ++
 .../basic-javascript-rpg-game/part-001.md     |  113 ++
 .../basic-javascript-rpg-game/part-002.md     |  113 ++
 .../basic-javascript-rpg-game/part-003.md     |  117 ++
 .../basic-javascript-rpg-game/part-004.md     |  123 ++
 .../basic-javascript-rpg-game/part-005.md     |  119 ++
 .../basic-javascript-rpg-game/part-006.md     |  120 ++
 .../basic-javascript-rpg-game/part-007.md     |  124 ++
 .../basic-javascript-rpg-game/part-008.md     |  132 ++
 .../basic-javascript-rpg-game/part-009.md     |  122 ++
 .../basic-javascript-rpg-game/part-010.md     |  131 ++
 .../basic-javascript-rpg-game/part-011.md     |  126 ++
 .../basic-javascript-rpg-game/part-012.md     |  165 +++
 .../basic-javascript-rpg-game/part-013.md     |  148 +++
 .../basic-javascript-rpg-game/part-014.md     |  150 +++
 .../basic-javascript-rpg-game/part-015.md     |  155 +++
 .../basic-javascript-rpg-game/part-016.md     |  162 +++
 .../basic-javascript-rpg-game/part-017.md     |  171 +++
 .../basic-javascript-rpg-game/part-018.md     |  170 +++
 .../basic-javascript-rpg-game/part-019.md     |  180 +++
 .../basic-javascript-rpg-game/part-020.md     |  185 +++
 .../basic-javascript-rpg-game/part-021.md     |  189 +++
 .../basic-javascript-rpg-game/part-022.md     |  189 +++
 .../basic-javascript-rpg-game/part-023.md     |  193 +++
 .../basic-javascript-rpg-game/part-024.md     |  203 +++
 .../basic-javascript-rpg-game/part-025.md     |  228 ++++
 .../basic-javascript-rpg-game/part-026.md     |  230 ++++
 .../basic-javascript-rpg-game/part-027.md     |  235 ++++
 .../basic-javascript-rpg-game/part-028.md     |  230 ++++
 .../basic-javascript-rpg-game/part-029.md     |  236 ++++
 .../basic-javascript-rpg-game/part-030.md     |  246 ++++
 .../basic-javascript-rpg-game/part-031.md     |  252 ++++
 .../basic-javascript-rpg-game/part-032.md     |  248 ++++
 .../basic-javascript-rpg-game/part-033.md     |  247 ++++
 .../basic-javascript-rpg-game/part-034.md     |  248 ++++
 .../basic-javascript-rpg-game/part-035.md     |  261 ++++
 .../basic-javascript-rpg-game/part-036.md     |  267 ++++
 .../basic-javascript-rpg-game/part-037.md     |  247 ++++
 .../basic-javascript-rpg-game/part-038.md     |  248 ++++
 .../basic-javascript-rpg-game/part-039.md     |  246 ++++
 .../basic-javascript-rpg-game/part-040.md     |  252 ++++
 .../basic-javascript-rpg-game/part-041.md     |  252 ++++
 .../basic-javascript-rpg-game/part-042.md     |  257 ++++
 .../basic-javascript-rpg-game/part-043.md     |  262 ++++
 .../basic-javascript-rpg-game/part-044.md     |  248 ++++
 .../basic-javascript-rpg-game/part-045.md     |  247 ++++
 .../basic-javascript-rpg-game/part-046.md     |  266 ++++
 .../basic-javascript-rpg-game/part-047.md     |  265 ++++
 .../basic-javascript-rpg-game/part-048.md     |  266 ++++
 .../basic-javascript-rpg-game/part-049.md     |  275 +++++
 .../basic-javascript-rpg-game/part-050.md     |  275 +++++
 .../basic-javascript-rpg-game/part-051.md     |  281 +++++
 .../basic-javascript-rpg-game/part-052.md     |  281 +++++
 .../basic-javascript-rpg-game/part-053.md     |  302 +++++
 .../basic-javascript-rpg-game/part-054.md     |  292 +++++
 .../basic-javascript-rpg-game/part-055.md     |  295 +++++
 .../basic-javascript-rpg-game/part-056.md     |  290 +++++
 .../basic-javascript-rpg-game/part-057.md     |  290 +++++
 .../basic-javascript-rpg-game/part-058.md     |  314 +++++
 .../basic-javascript-rpg-game/part-059.md     |  329 +++++
 .../basic-javascript-rpg-game/part-060.md     |  332 +++++
 .../basic-javascript-rpg-game/part-061.md     |  333 +++++
 .../basic-javascript-rpg-game/part-062.md     |  342 +++++
 .../basic-javascript-rpg-game/part-063.md     |  340 +++++
 .../basic-javascript-rpg-game/part-064.md     |  339 +++++
 .../basic-javascript-rpg-game/part-065.md     |  340 +++++
 .../basic-javascript-rpg-game/part-066.md     |  342 +++++
 .../basic-javascript-rpg-game/part-067.md     |  351 ++++++
 .../basic-javascript-rpg-game/part-068.md     |  348 ++++++
 .../basic-javascript-rpg-game/part-069.md     |  349 ++++++
 .../basic-javascript-rpg-game/part-070.md     |  350 ++++++
 .../basic-javascript-rpg-game/part-071.md     |  352 ++++++
 .../basic-javascript-rpg-game/part-072.md     |  361 ++++++
 .../basic-javascript-rpg-game/part-073.md     |  358 ++++++
 .../basic-javascript-rpg-game/part-074.md     |  358 ++++++
 .../basic-javascript-rpg-game/part-075.md     |  360 ++++++
 .../basic-javascript-rpg-game/part-076.md     |  364 ++++++
 .../basic-javascript-rpg-game/part-077.md     |  363 ++++++
 .../basic-javascript-rpg-game/part-078.md     |  373 ++++++
 .../basic-javascript-rpg-game/part-079.md     |  386 ++++++
 .../basic-javascript-rpg-game/part-080.md     |  379 ++++++
 .../basic-javascript-rpg-game/part-081.md     |  388 ++++++
 .../basic-javascript-rpg-game/part-082.md     |  380 ++++++
 .../basic-javascript-rpg-game/part-083.md     |  384 ++++++
 .../basic-javascript-rpg-game/part-084.md     |  387 ++++++
 .../basic-javascript-rpg-game/part-085.md     |  408 ++++++
 .../basic-javascript-rpg-game/part-086.md     |  423 +++++++
 .../basic-javascript-rpg-game/part-087.md     |  430 +++++++
 .../basic-javascript-rpg-game/part-088.md     |  436 +++++++
 .../basic-javascript-rpg-game/part-089.md     |  452 +++++++
 .../basic-javascript-rpg-game/part-090.md     |  454 +++++++
 .../basic-javascript-rpg-game/part-091.md     |  461 +++++++
 .../basic-javascript-rpg-game/part-092.md     |  476 +++++++
 .../basic-javascript-rpg-game/part-093.md     |  471 +++++++
 .../basic-javascript-rpg-game/part-094.md     |  483 ++++++++
 .../basic-javascript-rpg-game/part-095.md     |  471 +++++++
 .../basic-javascript-rpg-game/part-096.md     |  478 +++++++
 .../basic-javascript-rpg-game/part-097.md     |  475 +++++++
 .../basic-javascript-rpg-game/part-098.md     |  477 +++++++
 .../basic-javascript-rpg-game/part-099.md     |  484 ++++++++
 .../basic-javascript-rpg-game/part-100.md     |  485 ++++++++
 .../basic-javascript-rpg-game/part-101.md     |  489 ++++++++
 .../basic-javascript-rpg-game/part-102.md     |  508 ++++++++
 .../basic-javascript-rpg-game/part-103.md     |  498 ++++++++
 .../basic-javascript-rpg-game/part-104.md     |  507 ++++++++
 .../basic-javascript-rpg-game/part-105.md     |  509 ++++++++
 .../basic-javascript-rpg-game/part-106.md     |  509 ++++++++
 .../basic-javascript-rpg-game/part-107.md     |  516 ++++++++
 .../basic-javascript-rpg-game/part-108.md     |  518 ++++++++
 .../basic-javascript-rpg-game/part-109.md     |  532 ++++++++
 .../basic-javascript-rpg-game/part-110.md     |  538 ++++++++
 .../basic-javascript-rpg-game/part-111.md     |  542 ++++++++
 .../basic-javascript-rpg-game/part-112.md     |  544 ++++++++
 .../basic-javascript-rpg-game/part-113.md     |  546 ++++++++
 .../basic-javascript-rpg-game/part-114.md     |  575 +++++++++
 .../basic-javascript-rpg-game/part-115.md     |  578 +++++++++
 .../basic-javascript-rpg-game/part-116.md     |  592 +++++++++
 .../basic-javascript-rpg-game/part-117.md     |  572 +++++++++
 .../basic-javascript-rpg-game/part-118.md     |  587 +++++++++
 .../basic-javascript-rpg-game/part-119.md     |  595 +++++++++
 .../basic-javascript-rpg-game/part-120.md     |  594 +++++++++
 .../basic-javascript-rpg-game/part-121.md     |  601 +++++++++
 .../basic-javascript-rpg-game/part-122.md     |  604 +++++++++
 .../basic-javascript-rpg-game/part-123.md     |  611 +++++++++
 .../basic-javascript-rpg-game/part-124.md     |  614 +++++++++
 .../basic-javascript-rpg-game/part-125.md     |  609 +++++++++
 .../basic-javascript-rpg-game/part-126.md     |  620 ++++++++++
 .../basic-javascript-rpg-game/part-127.md     |  614 +++++++++
 .../basic-javascript-rpg-game/part-128.md     |  630 ++++++++++
 .../basic-javascript-rpg-game/part-129.md     |  628 ++++++++++
 .../basic-javascript-rpg-game/part-130.md     |  625 ++++++++++
 .../basic-javascript-rpg-game/part-131.md     |  646 ++++++++++
 .../basic-javascript-rpg-game/part-132.md     |  632 ++++++++++
 .../basic-javascript-rpg-game/part-133.md     |  643 ++++++++++
 .../basic-javascript-rpg-game/part-134.md     |  637 ++++++++++
 .../basic-javascript-rpg-game/part-135.md     |  651 ++++++++++
 .../basic-javascript-rpg-game/part-136.md     |  662 ++++++++++
 .../basic-javascript-rpg-game/part-137.md     |  664 ++++++++++
 .../basic-javascript-rpg-game/part-138.md     |  675 ++++++++++
 .../basic-javascript-rpg-game/part-139.md     |  692 +++++++++++
 .../basic-javascript-rpg-game/part-140.md     |  681 ++++++++++
 .../basic-javascript-rpg-game/part-141.md     |  679 ++++++++++
 .../basic-javascript-rpg-game/part-142.md     |  693 +++++++++++
 .../basic-javascript-rpg-game/part-143.md     |  692 +++++++++++
 .../basic-javascript-rpg-game/part-144.md     |  692 +++++++++++
 .../basic-javascript-rpg-game/part-145.md     |  690 +++++++++++
 .../basic-javascript-rpg-game/part-146.md     |  690 +++++++++++
 .../basic-javascript-rpg-game/part-147.md     |  693 +++++++++++
 .../basic-javascript-rpg-game/part-148.md     |  699 +++++++++++
 .../basic-javascript-rpg-game/part-149.md     |  705 +++++++++++
 .../basic-javascript-rpg-game/part-150.md     |  712 +++++++++++
 .../basic-javascript-rpg-game/part-151.md     |  718 +++++++++++
 .../basic-javascript-rpg-game/part-152.md     |  724 +++++++++++
 .../basic-javascript-rpg-game/part-153.md     |  714 +++++++++++
 .../access-array-data-with-indexes.md         |   89 ++
 ...s-multi-dimensional-arrays-with-indexes.md |   71 ++
 .../accessing-nested-arrays.md                |  120 ++
 .../accessing-nested-objects.md               |   99 ++
 ...object-properties-with-bracket-notation.md |  103 ++
 ...ing-object-properties-with-dot-notation.md |   99 ++
 ...essing-object-properties-with-variables.md |  121 ++
 ...d-new-properties-to-a-javascript-object.md |   90 ++
 .../add-two-numbers-with-javascript.md        |   62 +
 ...g-a-default-option-in-switch-statements.md |  128 ++
 .../appending-variables-to-strings.md         |   78 ++
 ...ng-the-value-of-one-variable-to-another.md |   86 ++
 .../assignment-with-a-returned-value.md       |   71 ++
 .../build-javascript-objects.md               |  159 +++
 .../chaining-if-else-statements.md            |  149 +++
 .../comment-your-javascript-code.md           |   63 +
 .../comparison-with-the-equality-operator.md  |   91 ++
 ...mparison-with-the-greater-than-operator.md |  113 ++
 ...h-the-greater-than-or-equal-to-operator.md |  115 ++
 ...comparison-with-the-inequality-operator.md |   93 ++
 .../comparison-with-the-less-than-operator.md |  108 ++
 ...with-the-less-than-or-equal-to-operator.md |  114 ++
 ...rison-with-the-strict-equality-operator.md |   82 ++
 ...son-with-the-strict-inequality-operator.md |   85 ++
 ...mparisons-with-the-logical-and-operator.md |  130 ++
 ...omparisons-with-the-logical-or-operator.md |  135 ++
 ...ound-assignment-with-augmented-addition.md |  101 ++
 ...ound-assignment-with-augmented-division.md |   95 ++
 ...ssignment-with-augmented-multiplication.md |   95 ++
 ...d-assignment-with-augmented-subtraction.md |   93 ++
 ...oncatenating-strings-with-plus-operator.md |   83 ++
 ...g-strings-with-the-plus-equals-operator.md |   70 ++
 .../constructing-strings-with-variables.md    |   75 ++
 .../count-backwards-with-a-for-loop.md        |   75 ++
 .../basic-javascript/counting-cards.md        |  202 +++
 .../create-decimal-numbers-with-javascript.md |   54 +
 .../declare-javascript-variables.md           |   61 +
 .../declare-string-variables.md               |   81 ++
 .../decrement-a-number-with-javascript.md     |   80 ++
 ...ete-properties-from-a-javascript-object.md |   95 ++
 ...-one-decimal-by-another-with-javascript.md |   56 +
 ...e-one-number-by-another-with-javascript.md |   59 +
 .../escape-sequences-in-strings.md            |   99 ++
 .../escaping-literal-quotes-in-strings.md     |   72 ++
 .../find-the-length-of-a-string.md            |   69 ++
 .../finding-a-remainder-in-javascript.md      |   69 ++
 ...nerate-random-fractions-with-javascript.md |   69 ++
 ...te-random-whole-numbers-with-javascript.md |   90 ++
 ...ate-random-whole-numbers-within-a-range.md |  102 ++
 .../global-scope-and-functions.md             |  128 ++
 .../global-vs.-local-scope-in-functions.md    |   78 ++
 .../basic-javascript/golf-code.md             |  135 ++
 .../increment-a-number-with-javascript.md     |   80 ++
 ...-variables-with-the-assignment-operator.md |   50 +
 .../introducing-else-if-statements.md         |  114 ++
 .../introducing-else-statements.md            |  106 ++
 .../iterate-odd-numbers-with-a-for-loop.md    |   67 +
 ...terate-through-an-array-with-a-for-loop.md |   79 ++
 ...terate-with-javascript-do...while-loops.md |  102 ++
 .../iterate-with-javascript-for-loops.md      |   79 ++
 .../iterate-with-javascript-while-loops.md    |   73 ++
 .../local-scope-and-functions.md              |   86 ++
 .../logical-order-in-if-else-statements.md    |  109 ++
 .../manipulate-arrays-with-pop.md             |   90 ++
 .../manipulate-arrays-with-push.md            |   77 ++
 .../manipulate-arrays-with-shift.md           |   88 ++
 .../manipulate-arrays-with-unshift.md         |   78 ++
 .../manipulating-complex-objects.md           |  179 +++
 .../modify-array-data-with-indexes.md         |   86 ++
 ...-identical-options-in-switch-statements.md |  149 +++
 .../multiply-two-decimals-with-javascript.md  |   52 +
 .../multiply-two-numbers-with-javascript.md   |   60 +
 .../nest-one-array-within-another-array.md    |   51 +
 .../basic-javascript/nesting-for-loops.md     |   93 ++
 ...sing-values-to-functions-with-arguments.md |  120 ++
 .../practice-comparing-different-values.md    |   78 ++
 .../basic-javascript/profile-lookup.md        |  151 +++
 .../quoting-strings-with-single-quotes.md     |   81 ++
 .../basic-javascript/record-collection.md     |  181 +++
 .../replace-loops-using-recursion.md          |  105 ++
 .../replacing-if-else-chains-with-switch.md   |  157 +++
 ...urn-a-value-from-a-function-with-return.md |   72 ++
 .../return-early-pattern-for-functions.md     |  106 ++
 ...returning-boolean-values-from-functions.md |   82 ++
 ...rom-many-options-with-switch-statements.md |  114 ++
 .../basic-javascript/shopping-list.md         |   97 ++
 .../basic-javascript/stand-in-line.md         |  118 ++
 ...in-one-variable-using-javascript-arrays.md |   63 +
 ...ing-values-with-the-assignment-operator.md |   77 ++
 ...one-number-from-another-with-javascript.md |   59 +
 .../testing-objects-for-properties.md         |   98 ++
 .../understand-string-immutability.md         |   70 ++
 .../understanding-boolean-values.md           |   61 +
 ...rstanding-case-sensitivity-in-variables.md |  100 ++
 ...ndefined-value-returned-from-a-function.md |   94 ++
 .../understanding-uninitialized-variables.md  |   79 ++
 .../updating-object-properties.md             |   77 ++
 ...to-find-the-first-character-in-a-string.md |   74 ++
 ...-to-find-the-last-character-in-a-string.md |   68 +
 ...n-to-find-the-nth-character-in-a-string.md |   68 +
 ...d-the-nth-to-last-character-in-a-string.md |   68 +
 ...se-conditional-logic-with-if-statements.md |   97 ++
 ...-multiple-conditional-ternary-operators.md |   96 ++
 .../use-recursion-to-create-a-countdown.md    |   92 ++
 ...-recursion-to-create-a-range-of-numbers.md |   81 ++
 .../use-the-conditional-ternary-operator.md   |   84 ++
 .../use-the-parseint-function-with-a-radix.md |   82 ++
 .../use-the-parseint-function.md              |   74 ++
 .../using-objects-for-lookups.md              |  154 +++
 .../basic-javascript/word-blanks.md           |  107 ++
 ...rite-reusable-javascript-with-functions.md |  101 ++
 ...the-wrong-order-when-calling-a-function.md |   57 +
 ...osing-parenthesis-after-a-function-call.md |   69 ++
 ...-misspelled-variable-and-function-names.md |   69 ++
 ...mixed-usage-of-single-and-double-quotes.md |   63 +
 ...h-off-by-one-errors-when-using-indexing.md |   93 ++
 ...-parentheses-brackets-braces-and-quotes.md |   49 +
 ...t-operator-instead-of-equality-operator.md |   81 ++
 ...e-loops-with-a-valid-terminal-condition.md |   63 +
 ...en-the-freecodecamp-and-browser-console.md |   73 ++
 ...-reinitializing-variables-inside-a-loop.md |   89 ++
 ...onsole-to-check-the-value-of-a-variable.md |   54 +
 ...-typeof-to-check-the-type-of-a-variable.md |   66 +
 ...pare-scopes-of-the-var-and-let-keywords.md |  135 ++
 ...plete-a-promise-with-resolve-and-reject.md |   77 ++
 .../es6/create-a-javascript-promise.md        |   55 +
 .../es6/create-a-module-script.md             |   73 ++
 ...-an-export-fallback-with-export-default.md |   63 +
 .../create-strings-using-template-literals.md |  116 ++
 ...ad-only-variable-with-the-const-keyword.md |   89 ++
 ...rences-between-the-var-and-let-keywords.md |   91 ++
 .../handle-a-fulfilled-promise-with-then.md   |   92 ++
 .../handle-a-rejected-promise-with-catch.md   |  100 ++
 .../es6/import-a-default-export.md            |   48 +
 .../mutate-an-array-declared-with-const.md    |   89 ++
 .../es6/prevent-object-mutation.md            |  104 ++
 .../es6/reuse-javascript-code-using-import.md |   70 ++
 ...t-default-parameters-for-your-functions.md |   64 +
 .../use--to-import-everything-from-a-file.md  |   60 +
 ...ns-to-write-concise-anonymous-functions.md |   91 ++
 ...syntax-to-define-a-constructor-function.md |  100 ++
 ...ignment-to-assign-variables-from-arrays.md |   71 ++
 ...to-assign-variables-from-nested-objects.md |  106 ++
 ...gnment-to-assign-variables-from-objects.md |   97 ++
 ...signment-to-extract-values-from-objects.md |  101 ++
 ...ass-an-object-as-a-functions-parameters.md |   94 ++
 ...st-parameter-to-reassign-array-elements.md |   86 ++
 .../es6/use-export-to-share-a-code-block.md   |   85 ++
 ...-setters-to-control-access-to-an-object.md |  174 +++
 ...rest-parameter-with-function-parameters.md |   80 ++
 ...ad-operator-to-evaluate-arrays-in-place.md |   84 ++
 .../write-arrow-functions-with-parameters.md  |   94 ++
 ...-concise-declarative-functions-with-es6.md |   86 ++
 ...rations-using-object-property-shorthand.md |   75 ++
 .../part-001.md                               |   76 ++
 .../part-002.md                               |   78 ++
 .../part-003.md                               |   82 ++
 .../part-004.md                               |   86 ++
 .../part-005.md                               |   92 ++
 .../part-006.md                               |   92 ++
 .../part-007.md                               |   88 ++
 .../part-008.md                               |   80 ++
 .../part-009.md                               |   82 ++
 .../part-010.md                               |   80 ++
 .../part-011.md                               |   85 ++
 .../part-012.md                               |   90 ++
 .../part-013.md                               |   96 ++
 .../part-014.md                               |   95 ++
 .../part-015.md                               |  100 ++
 .../part-016.md                               |  102 ++
 .../part-017.md                               |   98 ++
 .../part-018.md                               |  101 ++
 .../part-019.md                               |  108 ++
 .../part-020.md                               |  103 ++
 .../part-021.md                               |  105 ++
 .../part-022.md                               |  118 ++
 .../part-023.md                               |  112 ++
 .../part-024.md                               |  110 ++
 .../part-025.md                               |  118 ++
 .../part-026.md                               |  126 ++
 .../part-027.md                               |  129 ++
 .../part-028.md                               |  131 ++
 .../part-029.md                               |  132 ++
 .../part-030.md                               |  136 ++
 .../part-031.md                               |  140 +++
 .../part-032.md                               |  137 +++
 .../part-033.md                               |  138 +++
 .../part-034.md                               |  139 +++
 .../part-035.md                               |  137 +++
 .../part-036.md                               |  140 +++
 .../part-037.md                               |  148 +++
 .../part-038.md                               |  144 +++
 .../part-039.md                               |  148 +++
 .../part-040.md                               |  156 +++
 .../part-041.md                               |  155 +++
 .../part-042.md                               |  168 +++
 .../part-043.md                               |  161 +++
 .../part-044.md                               |  156 +++
 .../part-045.md                               |  155 +++
 .../part-046.md                               |  152 +++
 .../part-047.md                               |  157 +++
 .../part-048.md                               |  152 +++
 .../part-049.md                               |  154 +++
 .../part-050.md                               |  154 +++
 .../part-051.md                               |  158 +++
 .../part-052.md                               |  157 +++
 .../part-053.md                               |  171 +++
 .../part-054.md                               |  174 +++
 .../part-055.md                               |  174 +++
 .../part-056.md                               |  174 +++
 .../part-057.md                               |  175 +++
 .../part-058.md                               |  181 +++
 .../part-059.md                               |  181 +++
 .../part-060.md                               |  185 +++
 .../part-061.md                               |  187 +++
 .../part-062.md                               |  182 +++
 .../part-063.md                               |  181 +++
 .../part-064.md                               |  180 +++
 .../part-065.md                               |  184 +++
 .../part-066.md                               |  180 +++
 .../part-067.md                               |  190 +++
 .../part-068.md                               |  184 +++
 .../part-069.md                               |  182 +++
 .../part-070.md                               |  186 +++
 .../part-071.md                               |  188 +++
 .../part-072.md                               |  190 +++
 .../part-073.md                               |  186 +++
 .../part-074.md                               |  188 +++
 .../part-075.md                               |  195 +++
 .../part-076.md                               |  193 +++
 .../part-077.md                               |  198 +++
 .../part-078.md                               |  206 ++++
 .../part-079.md                               |  209 ++++
 .../part-080.md                               |  215 ++++
 .../part-081.md                               |  218 ++++
 .../part-082.md                               |  227 ++++
 .../part-083.md                               |  223 ++++
 .../part-084.md                               |  223 ++++
 .../part-085.md                               |  228 ++++
 .../part-086.md                               |  230 ++++
 .../part-087.md                               |  235 ++++
 .../part-088.md                               |  238 ++++
 .../part-089.md                               |  249 ++++
 .../part-090.md                               |  250 ++++
 .../part-091.md                               |  255 ++++
 .../part-092.md                               |  259 ++++
 .../part-093.md                               |  258 ++++
 .../part-094.md                               |  258 ++++
 .../part-095.md                               |  260 ++++
 .../part-096.md                               |  264 ++++
 .../part-097.md                               |  271 ++++
 .../part-098.md                               |  265 ++++
 .../part-099.md                               |  274 +++++
 .../part-100.md                               |  269 ++++
 .../part-101.md                               |  266 ++++
 .../part-102.md                               |  268 ++++
 .../part-103.md                               |  263 ++++
 .../part-104.md                               |  265 ++++
 .../part-105.md                               |  262 ++++
 .../part-106.md                               |  270 ++++
 .../part-107.md                               |  266 ++++
 .../part-108.md                               |  267 ++++
 .../part-109.md                               |  273 ++++
 .../part-110.md                               |  270 ++++
 .../part-111.md                               |  270 ++++
 .../part-112.md                               |  267 ++++
 .../part-113.md                               |  269 ++++
 .../part-114.md                               |  271 ++++
 .../part-115.md                               |  277 +++++
 .../part-116.md                               |  283 +++++
 .../part-117.md                               |  286 +++++
 .../part-118.md                               |  290 +++++
 .../part-119.md                               |  295 +++++
 .../part-120.md                               |  289 +++++
 .../part-121.md                               |  299 +++++
 .../part-122.md                               |  291 +++++
 .../part-123.md                               |  296 +++++
 .../part-124.md                               |  291 +++++
 .../part-125.md                               |  296 +++++
 .../part-126.md                               |  306 +++++
 .../part-127.md                               |  298 +++++
 .../part-128.md                               |  310 +++++
 .../part-129.md                               |  316 +++++
 .../part-130.md                               |  310 +++++
 .../part-131.md                               |  310 +++++
 .../part-132.md                               |  309 +++++
 .../part-133.md                               |  314 +++++
 .../part-134.md                               |  318 +++++
 .../part-135.md                               |  323 +++++
 .../part-136.md                               |  325 +++++
 .../part-137.md                               |  326 +++++
 .../part-138.md                               |  322 +++++
 .../part-139.md                               |  325 +++++
 .../part-140.md                               |  328 +++++
 .../part-141.md                               |  316 +++++
 ...f-an-array-using-concat-instead-of-push.md |   88 ++
 ...ramming-to-convert-strings-to-url-slugs.md |   84 ++
 ...de-effects-using-functional-programming.md |   78 ++
 ...ray-into-a-string-using-the-join-method.md |   90 ++
 ...bine-two-arrays-using-the-concat-method.md |   79 ++
 .../implement-map-on-a-prototype.md           |   75 ++
 ...lement-the-filter-method-on-a-prototype.md |   70 ++
 ...ion-to-currying-and-partial-application.md |  100 ++
 .../learn-about-functional-programming.md     |   86 ++
 ...avoid-external-dependence-in-a-function.md |   80 ++
 ...actor-global-variables-out-of-functions.md |  141 +++
 ...-an-array-using-slice-instead-of-splice.md |   86 ++
 ...ray-without-changing-the-original-array.md |   91 ++
 ...part-of-an-array-using-the-slice-method.md |   95 ++
 ...ay-alphabetically-using-the-sort-method.md |  101 ++
 ...ng-into-an-array-using-the-split-method.md |   88 ++
 ...tand-functional-programming-terminology.md |  112 ++
 ...nd-the-hazards-of-using-imperative-code.md |  145 +++
 ...er-or-reduce-to-solve-a-complex-problem.md |   97 ++
 ...ry-element-in-an-array-meets-a-criteria.md |   77 ++
 ...er-method-to-extract-data-from-an-array.md |  317 +++++
 ...ap-method-to-extract-data-from-an-array.md |  330 +++++
 .../use-the-reduce-method-to-analyze-data.md  |  345 ++++++
 ...ny-elements-in-an-array-meet-a-criteria.md |   77 ++
 .../arguments-optional.md                     |   91 ++
 .../binary-agents.md                          |   57 +
 .../convert-html-entities.md                  |   89 ++
 .../diff-two-arrays.md                        |  190 +++
 .../dna-pairing.md                            |   83 ++
 .../drop-it.md                                |  104 ++
 .../everything-be-true.md                     |  155 +++
 .../make-a-person.md                          |  197 +++
 .../map-the-debris.md                         |   78 ++
 .../missing-letters.md                        |   72 ++
 .../pig-latin.md                              |   93 ++
 .../search-and-replace.md                     |  100 ++
 .../seek-and-destroy.md                       |  104 ++
 .../smallest-common-multiple.md               |   90 ++
 .../sorted-union.md                           |   68 +
 .../spinal-tap-case.md                        |   70 ++
 .../steamroller.md                            |   72 ++
 .../sum-all-numbers-in-a-range.md             |   70 ++
 .../sum-all-odd-fibonacci-numbers.md          |   82 ++
 .../sum-all-primes.md                         |   75 ++
 .../wherefore-art-thou.md                     |  130 ++
 .../part-001.md                               |   98 ++
 .../part-002.md                               |  112 ++
 .../part-003.md                               |  117 ++
 .../part-004.md                               |  109 ++
 .../part-005.md                               |  113 ++
 .../part-006.md                               |  111 ++
 .../part-007.md                               |  120 ++
 .../part-008.md                               |  117 ++
 .../part-009.md                               |  119 ++
 .../part-010.md                               |  114 ++
 .../part-011.md                               |  115 ++
 .../part-012.md                               |  127 ++
 .../part-013.md                               |  125 ++
 .../part-014.md                               |  123 ++
 .../part-015.md                               |  121 ++
 .../part-016.md                               |  120 ++
 .../part-017.md                               |  121 ++
 .../part-018.md                               |  137 +++
 .../part-019.md                               |  137 +++
 .../part-020.md                               |  145 +++
 .../part-021.md                               |  134 ++
 .../part-022.md                               |  137 +++
 .../part-023.md                               |  131 ++
 .../part-024.md                               |  129 ++
 .../part-025.md                               |  139 +++
 .../part-026.md                               |  127 ++
 .../part-027.md                               |  139 +++
 .../part-028.md                               |  141 +++
 .../part-029.md                               |  149 +++
 .../part-030.md                               |  152 +++
 .../part-031.md                               |  149 +++
 .../part-032.md                               |  149 +++
 .../part-033.md                               |  147 +++
 .../part-034.md                               |  151 +++
 .../part-035.md                               |  159 +++
 .../part-036.md                               |  151 +++
 .../part-037.md                               |  152 +++
 .../part-038.md                               |  157 +++
 .../part-039.md                               |  156 +++
 .../part-040.md                               |  165 +++
 .../part-041.md                               |  168 +++
 .../part-042.md                               |  173 +++
 .../part-043.md                               |  173 +++
 .../part-044.md                               |  172 +++
 .../part-045.md                               |  181 +++
 .../part-046.md                               |  190 +++
 .../part-047.md                               |  180 +++
 .../part-048.md                               |  191 +++
 .../part-049.md                               |  197 +++
 .../part-050.md                               |  196 +++
 .../part-051.md                               |  203 +++
 .../part-052.md                               |  205 +++
 .../part-053.md                               |  201 +++
 .../part-054.md                               |  202 +++
 .../part-055.md                               |  208 ++++
 .../part-056.md                               |  212 ++++
 .../part-057.md                               |  209 ++++
 .../part-058.md                               |  216 ++++
 .../part-059.md                               |  218 ++++
 .../part-060.md                               |  218 ++++
 .../part-061.md                               |  220 ++++
 .../part-062.md                               |  224 ++++
 .../part-063.md                               |  227 ++++
 .../part-064.md                               |  224 ++++
 .../part-065.md                               |  235 ++++
 .../part-066.md                               |  241 ++++
 .../part-067.md                               |  248 ++++
 .../part-068.md                               |  241 ++++
 .../part-069.md                               |  241 ++++
 .../part-070.md                               |  257 ++++
 .../part-071.md                               |  255 ++++
 .../part-072.md                               |  261 ++++
 .../part-073.md                               |  269 ++++
 .../part-074.md                               |  267 ++++
 .../part-075.md                               |  275 +++++
 .../part-076.md                               |  185 +++
 .../caesars-cipher.md                         |   89 ++
 .../cash-register.md                          |  249 ++++
 .../palindrome-checker.md                     |  127 ++
 .../roman-numeral-converter.md                |  199 +++
 .../telephone-number-validator.md             |  211 ++++
 .../add-methods-after-inheritance.md          |  133 ++
 .../change-the-prototype-to-a-new-object.md   |  103 ++
 .../create-a-basic-javascript-object.md       |   69 ++
 .../create-a-method-on-an-object.md           |   70 ++
 .../define-a-constructor-function.md          |   67 +
 ...xtend-constructors-to-receive-arguments.md |   89 ++
 .../inherit-behaviors-from-a-supertype.md     |  127 ++
 .../iterate-over-all-properties.md            |  106 ++
 ...ode-more-reusable-with-the-this-keyword.md |   75 ++
 .../override-inherited-methods.md             |  100 ++
 ...or-property-when-changing-the-prototype.md |   86 ++
 ...reset-an-inherited-constructor-property.md |   91 ++
 ...-prototype-to-an-instance-of-the-parent.md |   79 ++
 .../understand-own-properties.md              |  104 ++
 .../understand-the-constructor-property.md    |   85 ++
 ...iately-invoked-function-expression-iife.md |   83 ++
 .../understand-the-prototype-chain.md         |   74 ++
 ...d-where-an-objects-prototype-comes-from.md |   63 +
 .../use-a-constructor-to-create-objects.md    |   80 ++
 ...mmon-behavior-between-unrelated-objects.md |  111 ++
 .../use-an-iife-to-create-a-module.md         |  106 ++
 ...n-object-from-being-modified-externally.md |   82 ++
 ...n-to-access-the-properties-of-an-object.md |   62 +
 ...inheritance-so-you-dont-repeat-yourself.md |  142 +++
 ...ype-properties-to-reduce-duplicate-code.md |   77 ++
 ...-an-objects-constructor-with-instanceof.md |   79 ++
 .../check-for-all-or-none.md                  |   77 ++
 .../check-for-mixed-grouping-of-characters.md |   90 ++
 .../regular-expressions/extract-matches.md    |   73 ++
 .../find-characters-with-lazy-matching.md     |   61 +
 .../find-more-than-the-first-match.md         |   85 ++
 .../find-one-or-more-criminals-in-a-hunt.md   |  106 ++
 .../ignore-case-while-matching.md             |   99 ++
 ...ral-string-with-different-possibilities.md |   83 ++
 .../match-all-letters-and-numbers.md          |   98 ++
 .../match-all-non-numbers.md                  |   85 ++
 .../regular-expressions/match-all-numbers.md  |   85 ++
 .../match-anything-with-wildcard-period.md    |  119 ++
 .../match-beginning-string-patterns.md        |   71 ++
 ...characters-that-occur-one-or-more-times.md |   59 +
 ...haracters-that-occur-zero-or-more-times.md |   96 ++
 .../match-ending-string-patterns.md           |   65 +
 ...atch-everything-but-letters-and-numbers.md |   92 ++
 .../match-letters-of-the-alphabet.md          |   71 ++
 .../match-literal-strings.md                  |   72 ++
 .../match-non-whitespace-characters.md        |   78 ++
 ...tch-numbers-and-letters-of-the-alphabet.md |   63 +
 ...e-character-with-multiple-possibilities.md |   85 ++
 .../match-single-characters-not-specified.md  |   57 +
 .../regular-expressions/match-whitespace.md   |   77 ++
 .../positive-and-negative-lookahead.md        |  114 ++
 .../remove-whitespace-from-start-and-end.md   |   55 +
 .../restrict-possible-usernames.md            |  123 ++
 .../reuse-patterns-using-capture-groups.md    |  106 ++
 .../specify-exact-number-of-matches.md        |   92 ++
 ...pecify-only-the-lower-number-of-matches.md |   93 ++
 ...ecify-upper-and-lower-number-of-matches.md |   91 ++
 ...se-capture-groups-to-search-and-replace.md |   88 ++
 .../using-the-test-method.md                  |   59 +
 ...dd-elements-within-your-bootstrap-wells.md |   90 ++
 ...ont-awesome-icons-to-all-of-our-buttons.md |  177 +++
 .../add-font-awesome-icons-to-our-buttons.md  |  194 +++
 ...add-id-attributes-to-bootstrap-elements.md |   93 ++
 ...pply-the-default-bootstrap-button-style.md |   77 ++
 ...call-out-optional-actions-with-btn-info.md |  175 +++
 .../bootstrap/center-text-with-bootstrap.md   |  157 +++
 ...create-a-block-element-bootstrap-button.md |  185 +++
 .../bootstrap/create-a-bootstrap-button.md    |  176 +++
 .../bootstrap/create-a-bootstrap-headline.md  |   67 +
 .../bootstrap/create-a-bootstrap-row.md       |   68 +
 ...a-class-to-target-with-jquery-selectors.md |   71 ++
 .../bootstrap/create-a-custom-heading.md      |  177 +++
 .../bootstrap/create-bootstrap-wells.md       |   71 ++
 .../ditch-custom-css-for-bootstrap.md         |  188 +++
 .../give-each-element-a-unique-id.md          |  125 ++
 ...-within-a-bootstrap-container-fluid-div.md |   53 +
 .../bootstrap/label-bootstrap-buttons.md      |  105 ++
 .../bootstrap/label-bootstrap-wells.md        |  101 ++
 ...rm-elements-responsively-with-bootstrap.md |  214 ++++
 .../make-images-mobile-responsive.md          |  176 +++
 .../responsively-style-checkboxes.md          |  191 +++
 .../responsively-style-radio-buttons.md       |  175 +++
 .../bootstrap/split-your-bootstrap-row.md     |   57 +
 .../style-text-inputs-as-form-controls.md     |  201 +++
 ...aste-the-bootstrap-button-color-rainbow.md |  167 +++
 .../use-a-span-to-target-inline-elements.md   |  185 +++
 .../bootstrap/use-comments-to-clarify-code.md |   98 ++
 ...-design-with-bootstrap-fluid-containers.md |  170 +++
 ...strap-grid-to-put-elements-side-by-side.md |  196 +++
 ...s-of-a-dangerous-action-with-btn-danger.md |  176 +++
 .../build-a-25-5-clock.md                     |   81 ++
 .../build-a-drum-machine.md                   |   39 +
 .../build-a-javascript-calculator.md          |   62 +
 .../build-a-markdown-previewer.md             |   39 +
 .../build-a-random-quote-machine.md           |   49 +
 ...nge-text-inside-an-element-using-jquery.md |  131 ++
 ...ange-the-css-of-an-element-using-jquery.md |  118 ++
 .../jquery/clone-an-element-using-jquery.md   |  121 ++
 .../jquery/delete-your-jquery-functions.md    |  124 ++
 .../jquery/disable-an-element-using-jquery.md |  120 ++
 ...how-script-tags-and-document-ready-work.md |  118 ++
 .../jquery/remove-an-element-using-jquery.md  |  109 ++
 ...ove-classes-from-an-element-with-jquery.md |  121 ++
 ...ecific-child-of-an-element-using-jquery.md |  143 +++
 .../target-elements-by-class-using-jquery.md  |  112 ++
 .../target-elements-by-id-using-jquery.md     |  122 ++
 .../target-even-elements-using-jquery.md      |  138 +++
 ...ml-elements-with-selectors-using-jquery.md |  117 ++
 ...the-children-of-an-element-using-jquery.md |  125 ++
 ...t-the-parent-of-an-element-using-jquery.md |  140 +++
 ...-element-with-multiple-jquery-selectors.md |  142 +++
 ...e-appendto-to-move-elements-with-jquery.md |  117 ++
 .../use-jquery-to-modify-the-entire-page.md   |  117 ++
 .../react-and-redux/connect-redux-to-react.md |  156 +++
 .../connect-redux-to-the-messages-app.md      |  300 +++++
 .../extract-local-state-into-redux.md         |  397 ++++++
 .../extract-state-logic-to-redux.md           |  115 ++
 .../getting-started-with-react-redux.md       |  102 ++
 .../manage-state-locally-first.md             |  260 ++++
 .../react-and-redux/map-dispatch-to-props.md  |  107 ++
 .../react-and-redux/map-state-to-props.md     |   69 ++
 .../moving-forward-from-here.md               |   69 ++
 .../use-provider-to-connect-redux-to-react.md |  263 ++++
 .../react/access-props-using-this.props.md    |  165 +++
 .../react/add-comments-in-jsx.md              |   82 ++
 .../react/add-event-listeners.md              |  179 +++
 .../react/add-inline-styles-in-react.md       |  112 ++
 .../react/bind-this-to-a-class-method.md      |  136 ++
 ...-conditionally-based-on-component-state.md |  176 +++
 .../react/compose-react-components.md         |  199 +++
 .../react/create-a-complex-jsx-element.md     |  110 ++
 .../create-a-component-with-composition.md    |  134 ++
 .../react/create-a-controlled-form.md         |  209 ++++
 .../react/create-a-controlled-input.md        |  150 +++
 .../react/create-a-react-component.md         |  102 ++
 .../react/create-a-simple-jsx-element.md      |   57 +
 .../react/create-a-stateful-component.md      |  134 ++
 ...create-a-stateless-functional-component.md |  102 ++
 .../react/define-an-html-class-in-jsx.md      |   62 +
 ...sibling-elements-a-unique-key-attribute.md |  147 +++
 .../react/introducing-inline-styles.md        |  104 ++
 .../learn-about-self-closing-jsx-tags.md      |   75 ++
 ...e-re-renders-with-shouldcomponentupdate.md |  187 +++
 .../react/override-default-props.md           |  112 ++
 .../react/pass-a-callback-as-props.md         |  217 ++++
 .../react/pass-an-array-as-props.md           |  186 +++
 ...ops-to-a-stateless-functional-component.md |  164 +++
 ...pass-state-as-props-to-child-components.md |  145 +++
 .../render-a-class-component-to-the-dom.md    |  159 +++
 .../react/render-conditionally-from-props.md  |  303 +++++
 .../react/render-html-elements-to-the-dom.md  |   75 ++
 ...react-on-the-server-with-rendertostring.md |   76 ++
 ...state-in-the-user-interface-another-way.md |  119 ++
 .../render-state-in-the-user-interface.md     |  113 ++
 .../react/render-with-an-if-else-condition.md |  155 +++
 ...ps-with-stateless-functional-components.md |  145 +++
 .../react/set-state-with-this.setstate.md     |  143 +++
 .../use--for-a-more-concise-conditional.md    |  146 +++
 ...ry-expression-for-conditional-rendering.md |  280 +++++
 ...anced-javascript-in-react-render-method.md |  334 +++++
 ...y.filter-to-dynamically-filter-an-array.md |  236 ++++
 ...rray.map-to-dynamically-render-elements.md |  265 ++++
 .../react/use-default-props.md                |   78 ++
 ...roptypes-to-define-the-props-you-expect.md |  132 ++
 .../use-react-to-render-nested-components.md  |  150 +++
 .../react/use-state-to-toggle-an-element.md   |  189 +++
 ...-the-lifecycle-method-componentdidmount.md |  127 ++
 ...the-lifecycle-method-componentwillmount.md |   87 ++
 .../write-a-react-component-from-scratch.md   |   84 ++
 .../react/write-a-simple-counter.md           |  146 +++
 .../redux/combine-multiple-reducers.md        |  175 +++
 .../copy-an-object-with-object.assign.md      |  133 ++
 .../redux/create-a-redux-store.md             |   61 +
 .../redux/define-a-redux-action.md            |   55 +
 .../redux/define-an-action-creator.md         |   57 +
 .../redux/dispatch-an-action-event.md         |   85 ++
 .../redux/get-state-from-the-redux-store.md   |   55 +
 .../redux/handle-an-action-in-the-store.md    |  108 ++
 .../redux/never-mutate-state.md               |  133 ++
 .../redux/register-a-store-listener.md        |  118 ++
 .../redux/remove-an-item-from-an-array.md     |  114 ++
 .../redux/send-action-data-to-the-store.md    |  107 ++
 ...ch-statement-to-handle-multiple-actions.md |  152 +++
 .../redux/use-const-for-action-types.md       |  204 +++
 ...ddleware-to-handle-asynchronous-actions.md |  170 +++
 .../use-the-spread-operator-on-arrays.md      |  114 ++
 .../redux/write-a-counter-with-redux.md       |  116 ++
 ...yle-until-a-condition-is-met-with-while.md |  117 ++
 .../sass/create-reusable-css-with-mixins.md   |  132 ++
 ...ne-set-of-css-styles-to-another-element.md |  116 ++
 .../sass/nest-css-with-sass.md                |  105 ++
 ...tyles-into-smaller-chunks-with-partials.md |   47 +
 .../sass/store-data-with-sass-variables.md    |  121 ++
 .../use-each-to-map-over-items-in-a-list.md   |  135 ++
 .../sass/use-for-to-create-a-sass-loop.md     |  139 +++
 ...if-and-else-to-add-logic-to-your-styles.md |  145 +++
 .../d3-dashboard/part-001.md                  |   33 +
 .../d3-dashboard/part-002.md                  |   43 +
 .../d3-dashboard/part-003.md                  |   51 +
 .../d3-dashboard/part-004.md                  |   55 +
 .../d3-dashboard/part-005.md                  |   55 +
 .../d3-dashboard/part-006.md                  |   55 +
 .../d3-dashboard/part-007.md                  |   66 +
 .../d3-dashboard/part-008.md                  |   73 ++
 .../d3-dashboard/part-009.md                  |   73 ++
 .../d3-dashboard/part-010.md                  |   75 ++
 .../d3-dashboard/part-011.md                  |   81 ++
 .../d3-dashboard/part-012.md                  |   79 ++
 .../d3-dashboard/part-013.md                  |   96 ++
 .../d3-dashboard/part-014.md                  |   95 ++
 .../d3-dashboard/part-015.md                  |  103 ++
 .../d3-dashboard/part-016.md                  |  108 ++
 .../d3-dashboard/part-017.md                  |  113 ++
 .../d3-dashboard/part-018.md                  |  117 ++
 .../d3-dashboard/part-019.md                  |  124 ++
 .../d3-dashboard/part-020.md                  |  116 ++
 .../d3-dashboard/part-021.md                  |  123 ++
 .../d3-dashboard/part-022.md                  |  123 ++
 .../d3-dashboard/part-023.md                  |  129 ++
 .../d3-dashboard/part-024.md                  |  129 ++
 .../d3-dashboard/part-025.md                  |  131 ++
 .../d3-dashboard/part-026.md                  |  133 ++
 .../d3-dashboard/part-027.md                  |  138 +++
 .../d3-dashboard/part-028.md                  |  142 +++
 .../d3-dashboard/part-029.md                  |  143 +++
 .../d3-dashboard/part-030.md                  |  147 +++
 .../d3-dashboard/part-031.md                  |  151 +++
 .../d3-dashboard/part-032.md                  |  150 +++
 .../d3-dashboard/part-033.md                  |  153 +++
 .../d3-dashboard/part-034.md                  |  156 +++
 .../d3-dashboard/part-035.md                  |  158 +++
 .../d3-dashboard/part-036.md                  |  168 +++
 .../d3-dashboard/part-037.md                  |  168 +++
 .../d3-dashboard/part-038.md                  |  168 +++
 .../d3-dashboard/part-039.md                  |  173 +++
 .../d3-dashboard/part-040.md                  |  178 +++
 .../d3-dashboard/part-041.md                  |  171 +++
 .../d3-dashboard/part-042.md                  |  178 +++
 .../d3-dashboard/part-043.md                  |  178 +++
 .../d3-dashboard/part-044.md                  |  192 +++
 .../d3-dashboard/part-045.md                  |  183 +++
 .../d3-dashboard/part-046.md                  |  189 +++
 .../d3-dashboard/part-047.md                  |  189 +++
 .../d3-dashboard/part-048.md                  |  193 +++
 .../d3-dashboard/part-049.md                  |  199 +++
 .../d3-dashboard/part-050.md                  |  198 +++
 .../d3-dashboard/part-051.md                  |  204 +++
 .../d3-dashboard/part-052.md                  |  207 ++++
 .../d3-dashboard/part-053.md                  |  209 ++++
 .../d3-dashboard/part-054.md                  |  209 ++++
 .../d3-dashboard/part-055.md                  |  218 ++++
 .../d3-dashboard/part-056.md                  |  218 ++++
 .../d3-dashboard/part-057.md                  |  226 ++++
 .../d3-dashboard/part-058.md                  |  229 ++++
 .../d3-dashboard/part-059.md                  |  231 ++++
 .../d3-dashboard/part-060.md                  |  230 ++++
 .../d3-dashboard/part-061.md                  |  239 ++++
 .../d3-dashboard/part-062.md                  |  247 ++++
 .../d3-dashboard/part-063.md                  |  246 ++++
 .../d3-dashboard/part-064.md                  |  248 ++++
 .../d3-dashboard/part-065.md                  |  246 ++++
 .../d3-dashboard/part-066.md                  |  250 ++++
 .../d3-dashboard/part-067.md                  |  252 ++++
 .../d3-dashboard/part-068.md                  |  252 ++++
 .../d3-dashboard/part-069.md                  |  258 ++++
 .../d3-dashboard/part-070.md                  |  258 ++++
 .../d3-dashboard/part-071.md                  |  263 ++++
 .../d3-dashboard/part-072.md                  |  268 ++++
 .../d3-dashboard/part-073.md                  |  274 +++++
 .../d3-dashboard/part-074.md                  |  280 +++++
 .../d3-dashboard/part-075.md                  |  280 +++++
 .../d3-dashboard/part-076.md                  |  287 +++++
 .../d3-dashboard/part-077.md                  |  288 +++++
 .../d3-dashboard/part-078.md                  |  296 +++++
 .../d3-dashboard/part-079.md                  |  302 +++++
 .../d3-dashboard/part-080.md                  |  302 +++++
 .../d3-dashboard/part-081.md                  |  309 +++++
 .../d3-dashboard/part-082.md                  |  312 +++++
 .../d3-dashboard/part-083.md                  |  315 +++++
 .../d3-dashboard/part-084.md                  |  318 +++++
 .../d3-dashboard/part-085.md                  |  319 +++++
 .../d3-dashboard/part-086.md                  |  324 +++++
 .../d3-dashboard/part-087.md                  |  328 +++++
 .../d3-dashboard/part-088.md                  |  329 +++++
 .../d3-dashboard/part-089.md                  |  334 +++++
 .../d3-dashboard/part-090.md                  |  336 +++++
 .../d3-dashboard/part-091.md                  |  335 +++++
 .../d3-dashboard/part-092.md                  |  344 ++++++
 .../d3-dashboard/part-093.md                  |  345 ++++++
 .../d3-dashboard/part-094.md                  |  348 ++++++
 .../d3-dashboard/part-095.md                  |  367 ++++++
 .../d3-dashboard/part-096.md                  |  350 ++++++
 .../d3-dashboard/part-097.md                  |  348 ++++++
 .../d3-dashboard/part-098.md                  |  351 ++++++
 .../d3-dashboard/part-099.md                  |  352 ++++++
 .../d3-dashboard/part-100.md                  |  372 ++++++
 .../d3-dashboard/part-101.md                  |  377 ++++++
 .../d3-dashboard/part-102.md                  |  364 ++++++
 .../d3-dashboard/part-103.md                  |  365 ++++++
 .../d3-dashboard/part-104.md                  |  381 ++++++
 .../d3-dashboard/part-105.md                  |  383 ++++++
 .../d3-dashboard/part-106.md                  |  372 ++++++
 .../d3-dashboard/part-107.md                  |  376 ++++++
 .../d3-dashboard/part-108.md                  |  388 ++++++
 .../d3-dashboard/part-109.md                  |  388 ++++++
 .../d3-dashboard/part-110.md                  |  389 ++++++
 .../d3-dashboard/part-111.md                  |  391 ++++++
 .../d3-dashboard/part-112.md                  |  394 ++++++
 .../d3-dashboard/part-113.md                  |  396 ++++++
 .../d3-dashboard/part-114.md                  |  401 ++++++
 .../d3-dashboard/part-115.md                  |  401 ++++++
 .../d3-dashboard/part-116.md                  |  404 ++++++
 .../d3-dashboard/part-117.md                  |  406 ++++++
 .../d3-dashboard/part-118.md                  |  412 +++++++
 .../d3-dashboard/part-119.md                  |  417 +++++++
 .../d3-dashboard/part-120.md                  |  417 +++++++
 .../d3-dashboard/part-121.md                  |  418 +++++++
 .../d3-dashboard/part-122.md                  |  422 +++++++
 .../d3-dashboard/part-123.md                  |  426 +++++++
 .../d3-dashboard/part-124.md                  |  431 +++++++
 .../d3-dashboard/part-125.md                  |  430 +++++++
 .../d3-dashboard/part-126.md                  |  437 +++++++
 .../d3-dashboard/part-127.md                  |  435 +++++++
 .../d3-dashboard/part-128.md                  |  438 +++++++
 .../d3-dashboard/part-129.md                  |  443 +++++++
 .../d3-dashboard/part-130.md                  |  443 +++++++
 .../d3-dashboard/part-131.md                  |  446 +++++++
 .../d3-dashboard/part-132.md                  |  450 +++++++
 .../d3-dashboard/part-133.md                  |  448 +++++++
 .../d3-dashboard/part-134.md                  |  453 +++++++
 .../d3-dashboard/part-135.md                  |  464 +++++++
 .../d3-dashboard/part-136.md                  |  476 +++++++
 .../d3-dashboard/part-137.md                  |  484 ++++++++
 .../d3-dashboard/part-138.md                  |  479 +++++++
 .../d3-dashboard/part-139.md                  |  485 ++++++++
 .../d3-dashboard/part-140.md                  |  478 +++++++
 .../d3-dashboard/part-141.md                  |  489 ++++++++
 .../d3-dashboard/part-142.md                  |  481 ++++++++
 .../d3-dashboard/part-143.md                  |  483 ++++++++
 .../d3-dashboard/part-144.md                  |  490 ++++++++
 .../d3-dashboard/part-145.md                  |  494 ++++++++
 .../d3-dashboard/part-146.md                  |  483 ++++++++
 .../visualize-data-with-a-bar-chart.md        |   53 +
 .../visualize-data-with-a-choropleth-map.md   |   52 +
 .../visualize-data-with-a-heat-map.md         |   61 +
 ...visualize-data-with-a-scatterplot-graph.md |   57 +
 .../visualize-data-with-a-treemap-diagram.md  |   53 +
 .../add-a-hover-effect-to-a-d3-element.md     |  118 ++
 .../add-a-tooltip-to-a-d3-element.md          |  175 +++
 .../add-attributes-to-the-circle-elements.md  |  211 ++++
 .../add-axes-to-a-visualization.md            |  198 +++
 .../add-classes-with-d3.md                    |   93 ++
 .../add-document-elements-with-d3.md          |  105 ++
 .../add-inline-styling-to-elements.md         |   76 ++
 .../add-labels-to-d3-elements.md              |  153 +++
 .../add-labels-to-scatter-plot-circles.md     |  224 ++++
 .../change-styles-based-on-data.md            |  123 ++
 .../change-the-color-of-an-svg-element.md     |   88 ++
 .../change-the-presentation-of-a-bar-chart.md |  161 +++
 ...te-a-bar-for-each-data-point-in-the-set.md |  110 ++
 .../create-a-linear-scale-with-d3.md          |   88 ++
 .../create-a-scatterplot-with-svg-circles.md  |  103 ++
 .../display-shapes-with-svg.md                |  103 ++
 ...namically-change-the-height-of-each-bar.md |  145 +++
 ...ically-set-the-coordinates-for-each-bar.md |  151 +++
 .../invert-svg-elements.md                    |  143 +++
 .../learn-about-svg-in-d3.md                  |   93 ++
 .../select-a-group-of-elements-with-d3.md     |   82 ++
 .../set-a-domain-and-a-range-on-a-scale.md    |  106 ++
 .../style-d3-labels.md                        |  110 ++
 ...te-the-height-of-an-element-dynamically.md |  137 +++
 ...e-a-pre-defined-scale-to-place-elements.md |  347 ++++++
 .../use-dynamic-scales.md                     |  156 +++
 ...minimum-and-maximum-values-in-a-dataset.md |   91 ++
 .../work-with-data-in-d3.md                   |  105 ++
 .../work-with-dynamic-data-in-d3.md           |  122 ++
 .../access-the-json-data-from-an-api.md       |  167 +++
 .../change-text-with-click-events.md          |  140 +++
 .../convert-json-data-to-html.md              |  199 +++
 ...on-data-to-find-a-users-gps-coordinates.md |   98 ++
 ...t-json-with-the-javascript-fetch-method.md |  174 +++
 ...th-the-javascript-xmlhttprequest-method.md |  196 +++
 ...h-javascript-using-the-onclick-property.md |  140 +++
 ...th-the-javascript-xmlhttprequest-method.md |  206 ++++
 ...re-filter-json-to-get-the-data-you-need.md |  171 +++
 .../render-images-from-data-sources.md        |  163 +++
 .../exercise-tracker.md                       |  255 ++++
 .../file-metadata-microservice.md             |   88 ++
 .../request-header-parser-microservice.md     |   77 ++
 .../timestamp-microservice.md                 |  154 +++
 .../url-shortener-microservice.md             |  119 ++
 ...hain-middleware-to-create-a-time-server.md |   79 ++
 .../get-data-from-post-requests.md            |   78 ++
 ...t-query-parameter-input-from-the-client.md |   67 +
 ...t-route-parameter-input-from-the-client.md |   65 +
 ...-a-root-level-request-logger-middleware.md |   57 +
 .../meet-the-node-console.md                  |   53 +
 .../serve-an-html-file.md                     |   51 +
 .../serve-json-on-a-specific-route.md         |   47 +
 .../serve-static-assets.md                    |   51 +
 .../start-a-working-express-server.md         |   57 +
 .../use-body-parser-to-parse-post-requests.md |   61 +
 .../use-the-.env-file.md                      |   52 +
 .../add-a-description-to-your-package.json.md |   52 +
 .../add-a-license-to-your-package.json.md     |   48 +
 .../add-a-version-to-your-package.json.md     |   46 +
 .../add-keywords-to-your-package.json.md      |   84 ++
 ...project-with-external-packages-from-npm.md |   77 ++
 ...e-of-any-node.js-project-or-npm-package.md |   60 +
 ...es-by-understanding-semantic-versioning.md |   73 ++
 ...remove-a-package-from-your-dependencies.md |   52 +
 ...he-latest-minor-version-of-a-dependency.md |   75 ++
 ...he-latest-patch-version-of-a-dependency.md |   75 ++
 ...-query-helpers-to-narrow-search-results.md |   76 ++
 .../mongodb-and-mongoose/create-a-model.md    |   88 ++
 .../create-and-save-a-record-of-a-model.md    |   56 +
 .../create-many-records-with-model.create.md  |   68 +
 ...delete-many-documents-with-model.remove.md |   57 +
 ...-document-using-model.findbyidandremove.md |   53 +
 .../install-and-set-up-mongoose.md            |   85 ++
 ...-updates-by-running-find-edit-then-save.md |   54 +
 ...a-document-using-model.findoneandupdate.md |   58 +
 .../use-model.find-to-search-your-database.md |   53 +
 ....findbyid-to-search-your-database-by-id.md |   48 +
 ...le-matching-document-from-your-database.md |   51 +
 .../announce-new-users.md                     |   90 ++
 .../authentication-strategies.md              |   96 ++
 .../authentication-with-socket.io.md          |  150 +++
 .../clean-up-your-project-with-modules.md     |   64 +
 .../communicate-by-emitting.md                |  107 ++
 .../create-new-middleware.md                  |   87 ++
 .../handle-a-disconnect.md                    |   69 ++
 .../hashing-your-passwords.md                 |   86 ++
 .../how-to-put-a-profile-together.md          |   57 +
 .../how-to-use-passport-strategies.md         |   79 ++
 ...nt-the-serialization-of-a-passport-user.md |   91 ++
 ...lementation-of-social-authentication-ii.md |  114 ++
 ...ementation-of-social-authentication-iii.md |   80 ++
 ...implementation-of-social-authentication.md |   82 ++
 .../logging-a-user-out.md                     |   81 ++
 .../registration-of-new-users.md              |  205 +++
 .../send-and-display-chat-messages.md         |   79 ++
 .../serialization-of-a-user-object.md         |  131 ++
 .../set-up-a-template-engine.md               |  116 ++
 .../set-up-passport.md                        |  132 ++
 .../set-up-the-environment.md                 |  148 +++
 .../use-a-template-engines-powers.md          |   53 +
 ...ality-with-.deepequal-and-.notdeepequal.md |   79 ++
 .../compare-the-properties-of-two-elements.md |  109 ++
 .../learn-how-javascript-assertions-work.md   |   75 ++
 ...sponse-using-chai-http-iii---put-method.md |  140 +++
 ...esponse-using-chai-http-iv---put-method.md |  124 ++
 ...sts-on-api-endpoints-using-chai-http-ii.md |   75 ++
 ...-tests-on-api-endpoints-using-chai-http.md |  101 ++
 ...ional-tests-using-a-headless-browser-ii.md |  115 ++
 ...nctional-tests-using-a-headless-browser.md |  140 +++
 ...mulate-actions-using-a-headless-browser.md |   76 ++
 .../test-for-truthiness.md                    |  101 ++
 .../test-if-a-string-contains-a-substring.md  |   79 ++
 ...f-a-value-falls-within-a-specific-range.md |   87 ++
 .../test-if-a-value-is-a-string.md            |   93 ++
 .../test-if-a-value-is-an-array.md            |   77 ++
 ...ue-is-of-a-specific-data-structure-type.md |  133 ++
 ...st-if-a-variable-or-function-is-defined.md |   95 ++
 .../test-if-an-array-contains-an-item.md      |   77 ++
 .../test-if-an-object-has-a-property.md       |   93 ++
 ...-object-is-an-instance-of-a-constructor.md |  115 ++
 ...s-below-or-at-least-as-large-as-another.md |  109 ++
 .../use-assert.isok-and-assert.isnotok.md     |   87 ++
 ...se-regular-expressions-to-test-a-string.md |   79 ++
 ...se-the-double-equals-to-assert-equality.md |  111 ++
 ...triple-equals-to-assert-strict-equality.md |  111 ++
 .../american-british-translator.md            |  337 +++++
 .../issue-tracker.md                          |  369 ++++++
 .../metric-imperial-converter.md              |  318 +++++
 .../personal-library.md                       |  221 ++++
 .../sudoku-solver.md                          |  379 ++++++
 .../build-your-own-functions.md               |   67 +
 .../comparing-and-sorting-tuples.md           |   57 +
 .../conditional-execution.md                  |   50 +
 .../data-visualization-mailing-lists.md       |   52 +
 .../data-visualization-page-rank.md           |   30 +
 .../dictionaries-and-loops.md                 |   49 +
 .../dictionaries-common-applications.md       |   43 +
 .../files-as-a-sequence.md                    |   40 +
 .../intermediate-expressions.md               |   52 +
 .../intermediate-strings.md                   |   49 +
 .../introduction-elements-of-python.md        |   36 +
 .../introduction-hardware-achitecture.md      |   30 +
 .../introduction-python-as-a-language.md      |   39 +
 .../introduction-why-program.md               |   38 +
 .../iterations-definite-loops.md              |   39 +
 .../iterations-loop-idioms.md                 |   45 +
 .../iterations-more-patterns.md               |   48 +
 .../loops-and-iterations.md                   |   51 +
 .../make-a-relational-database.md             |   48 +
 .../more-conditional-structures.md            |   56 +
 .../networking-protocol.md                    |   34 +
 .../networking-text-processing.md             |   30 +
 .../networking-using-urllib-in-python.md      |   37 +
 .../networking-web-scraping-with-python.md    |   56 +
 .../networking-with-python.md                 |   34 +
 .../networking-write-a-web-browser.md         |   50 +
 .../python-for-everybody/object-lifecycle.md  |   67 +
 .../objects-a-sample-class.md                 |   58 +
 .../objects-inheritance.md                    |   34 +
 .../python-dictionaries.md                    |   55 +
 .../python-for-everybody/python-functions.md  |   38 +
 .../python-for-everybody/python-lists.md      |   39 +
 .../python-for-everybody/python-objects.md    |   34 +
 .../python-for-everybody/reading-files.md     |   38 +
 ...xpressions-matching-and-extracting-data.md |   41 +
 ...ular-expressions-practical-applications.md |   34 +
 .../regular-expressions.md                    |   38 +
 .../relational-database-design.md             |   34 +
 .../relational-databases-and-sqlite.md        |   34 +
 .../relational-databases-join-operation.md    |   30 +
 ...al-databases-many-to-many-relationships.md |   48 +
 ...ational-databases-relationship-building.md |   30 +
 ...-relationships-in-a-relational-database.md |   34 +
 .../python-for-everybody/strings-and-lists.md |   47 +
 .../python-for-everybody/strings-in-python.md |   59 +
 .../the-tuples-collection.md                  |   59 +
 .../using-web-services.md                     |   38 +
 .../variables-expressions-and-statements.md   |   34 +
 .../visualizing-data-with-python.md           |   38 +
 ...services-api-rate-limiting-and-security.md |   46 +
 .../python-for-everybody/web-services-apis.md |   34 +
 .../python-for-everybody/web-services-json.md |   56 +
 .../web-services-service-oriented-approach.md |   30 +
 .../web-services-xml-schema.md                |   30 +
 .../python-for-everybody/web-services-xml.md  |   43 +
 .../working-with-lists.md                     |   34 +
 .../arithmetic-formatter.md                   |   44 +
 .../budget-app.md                             |   44 +
 .../polygon-area-calculator.md                |   44 +
 .../probability-calculator.md                 |   42 +
 .../time-calculator.md                        |   42 +
 .../data-analysis-example-a.md                |   43 +
 .../data-analysis-example-b.md                |   39 +
 .../data-cleaning-and-visualizations.md       |   43 +
 .../data-cleaning-duplicates.md               |   39 +
 .../data-cleaning-introduction.md             |   58 +
 .../data-cleaning-with-dataframes.md          |   70 ++
 .../how-to-use-jupyter-notebooks-intro.md     |   39 +
 .../introduction-to-data-analysis.md          |   39 +
 .../jupyter-notebooks-cells.md                |   38 +
 ...-notebooks-importing-and-exporting-data.md |   47 +
 .../numpy-algebra-and-size.md                 |   43 +
 .../numpy-arrays.md                           |   59 +
 .../numpy-boolean-arrays.md                   |   57 +
 .../numpy-introduction-a.md                   |   39 +
 .../numpy-introduction-b.md                   |   43 +
 .../numpy-operations.md                       |   50 +
 ...onal-selection-and-modifying-dataframes.md |   73 ++
 .../pandas-creating-columns.md                |   58 +
 .../pandas-dataframes.md                      |   66 +
 ...ndas-indexing-and-conditional-selection.md |   65 +
 .../pandas-introduction.md                    |   68 +
 .../parsing-html-and-saving-data.md           |   43 +
 .../python-functions-and-collections.md       |   39 +
 .../python-introduction.md                    |   43 +
 .../python-iteration-and-modules.md           |   56 +
 .../reading-data-csv-and-txt.md               |   55 +
 .../reading-data-from-databases.md            |   39 +
 .../reading-data-introduction.md              |   72 ++
 .../demographic-data-analyzer.md              |   33 +
 ...-variance-standard-deviation-calculator.md |   33 +
 .../medical-data-visualizer.md                |   33 +
 .../page-view-time-series-visualizer.md       |   33 +
 .../sea-level-predictor.md                    |   33 +
 ...ng-and-changing-elements,-rows,-columns.md |   50 +
 .../numpy/basics-of-numpy.md                  |   45 +
 .../numpy/copying-arrays-warning.md           |   44 +
 .../numpy/initialize-array-problem.md         |   61 +
 .../numpy/initializing-different-arrays.md    |   44 +
 .../loading-data-and-advanced-indexing.md     |   56 +
 .../numpy/mathematics.md                      |   49 +
 .../numpy/reorganizing-arrays.md              |   49 +
 .../numpy/what-is-numpy.md                    |   34 +
 .../anonymous-message-board.md                |  172 +++
 .../port-scanner.md                           |   43 +
 .../secure-real-time-multiplayer-game.md      |  175 +++
 .../sha-1-password-cracker.md                 |   43 +
 .../stock-price-checker.md                    |  134 ++
 ...ur-site-via-https-only-with-helmet.hsts.md |   63 +
 ...-response-mime-type-with-helmet.nosniff.md |   42 +
 ...lmet-using-the-parent-helmet-middleware.md |   50 +
 ...client-side-caching-with-helmet.nocache.md |   47 +
 ...fetching-with-helmet.dnsprefetchcontrol.md |   44 +
 ...sh-and-compare-passwords-asynchronously.md |   81 ++
 ...ash-and-compare-passwords-synchronously.md |   66 +
 ...-information-using-helmet.hidepoweredby.md |   40 +
 .../install-and-require-helmet.md             |   53 +
 ...-of-clickjacking-with-helmet.frameguard.md |   64 +
 ...pting-xss-attacks-with-helmet.xssfilter.md |   52 +
 ...ing-untrusted-html-with-helmet.ienoopen.md |   44 +
 ...olicy-with-helmet.contentsecuritypolicy.md |   71 ++
 .../understand-bcrypt-hashes.md               |   72 ++
 .../creating-a-tcp-client.md                  |   30 +
 .../developing-a-banner-grabber.md            |   43 +
 .../developing-a-port-scanner.md              |   30 +
 .../developing-an-nmap-scanner-part-1.md      |   30 +
 .../developing-an-nmap-scanner-part-2.md      |   30 +
 .../introduction-and-setup.md                 |   30 +
 ...nding-sockets-and-creating-a-tcp-server.md |   30 +
 .../find-the-symmetric-difference.md          |  150 +++
 .../algorithms/implement-bubble-sort.md       |  140 +++
 .../algorithms/implement-insertion-sort.md    |  131 ++
 .../algorithms/implement-merge-sort.md        |  158 +++
 .../algorithms/implement-quick-sort.md        |  142 +++
 .../algorithms/implement-selection-sort.md    |  134 ++
 .../algorithms/inventory-update.md            |  228 ++++
 .../algorithms/no-repeats-please.md           |  126 ++
 .../algorithms/pairwise.md                    |  100 ++
 ...d-a-new-element-to-a-binary-search-tree.md |  191 +++
 ...ts-at-a-specific-index-in-a-linked-list.md |  161 +++
 .../data-structures/adjacency-list.md         |   91 ++
 .../data-structures/adjacency-matrix.md       |  108 ++
 .../data-structures/breadth-first-search.md   |  182 +++
 ...ment-is-present-in-a-binary-search-tree.md |  175 +++
 .../check-if-binary-search-tree.md            |  136 ++
 .../create-a-circular-queue.md                |  235 ++++
 .../create-a-doubly-linked-list.md            |  216 ++++
 .../data-structures/create-a-hash-table.md    |  260 ++++
 .../create-a-linked-list-class.md             |  145 +++
 .../create-a-map-data-structure.md            |  204 +++
 .../create-a-priority-queue-class.md          |  231 ++++
 .../data-structures/create-a-queue-class.md   |  174 +++
 .../data-structures/create-a-set-class.md     |  219 ++++
 .../data-structures/create-a-stack-class.md   |  167 +++
 .../create-a-trie-search-tree.md              |  151 +++
 .../create-an-es6-javascript-map.md           |   43 +
 .../create-and-add-to-sets-in-es6.md          |   92 ++
 ...ete-a-leaf-node-in-a-binary-search-tree.md |  195 +++
 ...-with-one-child-in-a-binary-search-tree.md |  285 +++++
 ...th-two-children-in-a-binary-search-tree.md |  399 ++++++
 .../data-structures/depth-first-search.md     |  208 ++++
 ...-maximum-height-of-a-binary-search-tree.md |  346 ++++++
 ...d-maximum-value-in-a-binary-search-tree.md |  369 ++++++
 .../implement-heap-sort-with-a-min-heap.md    |  144 +++
 .../data-structures/incidence-matrix.md       |  110 ++
 .../insert-an-element-into-a-max-heap.md      |  153 +++
 .../data-structures/invert-a-binary-tree.md   |  192 +++
 .../learn-how-a-stack-works.md                |   71 ++
 ...erform-a-difference-on-two-sets-of-data.md |  219 ++++
 ...form-a-subset-check-on-two-sets-of-data.md |  302 +++++
 .../perform-a-union-on-two-sets.md            |  155 +++
 ...orm-an-intersection-on-two-sets-of-data.md |  184 +++
 .../remove-an-element-from-a-max-heap.md      |  143 +++
 ...ve-elements-from-a-linked-list-by-index.md |  242 ++++
 .../remove-elements-from-a-linked-list.md     |  210 ++++
 .../remove-items-from-a-set-in-es6.md         |   64 +
 .../reverse-a-doubly-linked-list.md           |  205 +++
 .../search-within-a-linked-list.md            |  293 +++++
 .../data-structures/typed-arrays.md           |   94 ++
 .../use-.has-and-.size-on-an-es6-set.md       |   73 ++
 ...th-first-search-in-a-binary-search-tree.md |  261 ++++
 ...th-first-search-in-a-binary-search-tree.md |  328 +++++
 ...pread-and-notes-for-es5-set-integration.md |   59 +
 .../work-with-nodes-in-a-linked-list.md       |   55 +
 .../problem-1-multiples-of-3-and-5.md         |   73 ++
 .../problem-10-summation-of-primes.md         |   81 ++
 .../problem-100-arranged-probability.md       |   87 ++
 .../problem-101-optimum-polynomial.md         |   52 +
 .../problem-102-triangle-containment.md       |  156 +++
 ...problem-103-special-subset-sums-optimum.md |   54 +
 .../problem-104-pandigital-fibonacci-ends.md  |   44 +
 ...problem-105-special-subset-sums-testing.md |   48 +
 ...em-106-special-subset-sums-meta-testing.md |   50 +
 .../problem-107-minimal-network.md            |   42 +
 .../problem-108-diophantine-reciprocals-i.md  |   48 +
 .../project-euler/problem-109-darts.md        |   54 +
 .../problem-11-largest-product-in-a-grid.md   |  182 +++
 .../problem-110-diophantine-reciprocals-ii.md |   44 +
 .../problem-111-primes-with-runs.md           |   50 +
 .../problem-112-bouncy-numbers.md             |   48 +
 .../problem-113-non-bouncy-numbers.md         |   46 +
 ...oblem-114-counting-block-combinations-i.md |   40 +
 ...blem-115-counting-block-combinations-ii.md |   50 +
 .../problem-116-red-green-or-blue-tiles.md    |   46 +
 .../problem-117-red-green-and-blue-tiles.md   |   40 +
 .../problem-118-pandigital-prime-sets.md      |   40 +
 .../problem-119-digit-power-sum.md            |   44 +
 ...m-12-highly-divisible-triangular-number.md |  139 +++
 .../problem-120-square-remainders.md          |   42 +
 .../problem-121-disc-game-prize-fund.md       |   44 +
 .../problem-122-efficient-exponentiation.md   |   52 +
 .../problem-123-prime-square-remainders.md    |   44 +
 .../problem-124-ordered-radicals.md           |   66 +
 .../problem-125-palindromic-sums.md           |   42 +
 .../problem-126-cuboid-layers.md              |   40 +
 .../project-euler/problem-127-abc-hits.md     |   62 +
 .../problem-128-hexagonal-tile-differences.md |   42 +
 .../problem-129-repunit-divisibility.md       |   44 +
 .../project-euler/problem-13-large-sum.md     |  286 +++++
 ...-composites-with-prime-repunit-property.md |   46 +
 .../problem-131-prime-cube-partnership.md     |   44 +
 .../problem-132-large-repunit-factors.md      |   42 +
 .../problem-133-repunit-nonfactors.md         |   44 +
 .../problem-134-prime-pair-connection.md      |   42 +
 .../problem-135-same-differences.md           |   44 +
 .../problem-136-singleton-difference.md       |   44 +
 .../problem-137-fibonacci-golden-nuggets.md   |   54 +
 ...problem-138-special-isosceles-triangles.md |   40 +
 .../problem-139-pythagorean-tiles.md          |   42 +
 .../problem-14-longest-collatz-sequence.md    |  111 ++
 ...m-140-modified-fibonacci-golden-nuggets.md |   46 +
 ...ressive-numbers-n-which-are-also-square.md |   46 +
 .../problem-142-perfect-square-collection.md  |   38 +
 ...ting-the-torricelli-point-of-a-triangle.md |   44 +
 ...ng-multiple-reflections-of-a-laser-beam.md |   46 +
 ...ble-numbers-are-there-below-one-billion.md |   42 +
 ...oblem-146-investigating-a-prime-pattern.md |   40 +
 ...m-147-rectangles-in-cross-hatched-grids.md |   44 +
 .../problem-148-exploring-pascals-triangle.md |   54 +
 ...searching-for-a-maximum-sum-subsequence.md |   52 +
 .../project-euler/problem-15-lattice-paths.md |   68 +
 ...y-for-a-sub-triangle-having-minimum-sum.md |   58 +
 ...tandard-sizes-an-expected-value-problem.md |   46 +
 ...ng-one-half-as-a-sum-of-inverse-squares.md |   42 +
 ...lem-153-investigating-gaussian-integers.md |   70 ++
 .../problem-154-exploring-pascals-pyramid.md  |   40 +
 ...problem-155-counting-capacitor-circuits.md |   44 +
 .../problem-156-counting-digits.md            |   52 +
 ...em-157-solving-the-diophantine-equation.md |   82 ++
 ...hically-after-its-neighbour-to-the-left.md |   55 +
 ...159-digital-root-sums-of-factorisations.md |   44 +
 .../problem-16-power-digit-sum.md             |   85 ++
 .../problem-160-factorial-trailing-digits.md  |   48 +
 .../project-euler/problem-161-triominoes.md   |   46 +
 .../problem-162-hexadecimal-numbers.md        |   52 +
 .../problem-163-cross-hatched-triangles.md    |   40 +
 ...s-have-a-sum-greater-than-a-given-value.md |   41 +
 .../problem-165-intersections.md              |   46 +
 .../project-euler/problem-166-criss-cross.md  |   46 +
 ...roblem-167-investigating-ulam-sequences.md |   48 +
 .../problem-168-number-rotations.md           |   44 +
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |   53 +
 .../problem-17-number-letter-counts.md        |  130 ++
 ...can-be-formed-by-concatenating-products.md |   49 +
 ...f-the-squares-of-the-digits-is-a-square.md |   49 +
 ...gating-numbers-with-few-repeated-digits.md |   38 +
 ...ent-hollow-square-laminae-can-be-formed.md |   43 +
 ...one-two-three-...-distinct-arrangements.md |   45 +
 ...an-be-expressed-as-a-sum-of-powers-of-2.md |   45 +
 ...-angled-triangles-that-share-a-cathetus.md |   40 +
 ...oblem-177-integer-angled-quadrilaterals.md |   40 +
 .../project-euler/problem-178-step-numbers.md |   46 +
 ...oblem-179-consecutive-positive-divisors.md |   38 +
 .../problem-18-maximum-path-sum-i.md          |  109 ++
 ...-zeros-of-a-function-of-three-variables.md |   54 +
 ...of-two-different-colours-can-be-grouped.md |   47 +
 .../problem-182-rsa-encryption.md             |  113 ++
 .../problem-183-maximum-product-of-parts.md   |   54 +
 ...lem-184-triangles-containing-the-origin.md |   44 +
 .../project-euler/problem-185-number-mind.md  |   48 +
 .../problem-186-connectedness-of-a-network.md |   48 +
 .../project-euler/problem-187-semiprimes.md   |   42 +
 ...188-the-hyperexponentiation-of-a-number.md |   44 +
 ...lem-189-tri-colouring-a-triangular-grid.md |   46 +
 .../problem-19-counting-sundays.md            |   76 ++
 ...oblem-190-maximising-a-weighted-product.md |   42 +
 .../problem-191-prize-strings.md              |   46 +
 .../problem-192-best-approximations.md        |   46 +
 .../problem-193-squarefree-numbers.md         |   40 +
 .../problem-194-coloured-configurations.md    |   48 +
 ...-triangles-with-one-angle-of-60-degrees.md |   48 +
 .../problem-196-prime-triplets.md             |   54 +
 ...viour-of-a-recursively-defined-sequence.md |   42 +
 .../problem-198-ambiguous-numbers.md          |   42 +
 .../problem-199-iterative-circle-packing.md   |   75 ++
 .../problem-2-even-fibonacci-numbers.md       |  103 ++
 .../problem-20-factorial-digit-sum.md         |   79 ++
 ...ontaining-the-contiguous-sub-string-200.md |   49 +
 .../problem-201-subsets-with-a-unique-sum.md  |   48 +
 .../project-euler/problem-202-laserbeam.md    |   44 +
 ...em-203-squarefree-binomial-coefficients.md |   46 +
 ...problem-204-generalised-hamming-numbers.md |   46 +
 .../project-euler/problem-205-dice-game.md    |   44 +
 .../problem-206-concealed-square.md           |   38 +
 ...problem-207-integer-partition-equations.md |   48 +
 .../project-euler/problem-208-robot-walks.md  |   42 +
 .../problem-209-circular-logic.md             |   44 +
 .../problem-21-amicable-numbers.md            |   84 ++
 .../problem-210-obtuse-angled-triangles.md    |   46 +
 .../problem-211-divisor-square-sum.md         |   42 +
 .../problem-212-combined-volume-of-cuboids.md |   52 +
 .../project-euler/problem-213-flea-circus.md  |   42 +
 .../problem-214-totient-chains.md             |   48 +
 .../problem-215-crack-free-walls.md           |   44 +
 ...-primality-of-numbers-of-the-form-2n2-1.md |   46 +
 .../problem-217-balanced-numbers.md           |   46 +
 ...blem-218-perfect-right-angled-triangles.md |   50 +
 .../problem-219-skew-cost-coding.md           |   50 +
 .../project-euler/problem-22-names-scores.md  |   90 ++
 .../problem-220-heighway-dragon.md            |   48 +
 .../problem-221-alexandrian-integers.md       |   44 +
 .../problem-222-sphere-packing.md             |   40 +
 ...lem-223-almost-right-angled-triangles-i.md |   40 +
 ...em-224-almost-right-angled-triangles-ii.md |   40 +
 .../problem-225-tribonacci-non-divisors.md    |   44 +
 .../problem-226-a-scoop-of-blancmange.md      |   44 +
 .../project-euler/problem-227-the-chase.md    |   42 +
 .../problem-228-minkowski-sums.md             |   58 +
 ...-229-four-representations-using-squares.md |   52 +
 .../problem-23-non-abundant-sums.md           |  101 ++
 .../problem-230-fibonacci-words.md            |   56 +
 ...-factorisation-of-binomial-coefficients.md |   44 +
 .../project-euler/problem-232-the-race.md     |   44 +
 .../problem-233-lattice-points-on-a-circle.md |   42 +
 .../problem-234-semidivisible-numbers.md      |   46 +
 ...em-235-an-arithmetic-geometric-sequence.md |   44 +
 .../problem-236-luxury-hampers.md             |   48 +
 ...blem-237-tours-on-a-4-x-n-playing-board.md |   50 +
 .../problem-238-infinite-string-tour.md       |   58 +
 .../problem-239-twenty-two-foolish-primes.md  |   42 +
 .../problem-24-lexicographic-permutations.md  |   66 +
 .../project-euler/problem-240-top-dice.md     |   48 +
 .../problem-241-perfection-quotients.md       |   42 +
 .../project-euler/problem-242-odd-triplets.md |   44 +
 .../project-euler/problem-243-resilience.md   |   44 +
 .../project-euler/problem-244-sliders.md      |   54 +
 .../project-euler/problem-245-coresilience.md |   40 +
 .../problem-246-tangents-to-an-ellipse.md     |   46 +
 .../problem-247-squares-under-a-hyperbola.md  |   44 +
 ...which-eulers-totient-function-equals-13.md |   40 +
 .../problem-249-prime-subset-sums.md          |   42 +
 .../problem-25-1000-digit-fibonacci-number.md |   85 ++
 .../project-euler/problem-250-250250.md       |   38 +
 .../problem-251-cardano-triplets.md           |   44 +
 .../project-euler/problem-252-convex-holes.md |   48 +
 .../project-euler/problem-253-tidying-up.md   |   52 +
 .../problem-254-sums-of-digit-factorials.md   |   48 +
 .../problem-255-rounded-square-roots.md       |   50 +
 .../problem-256-tatami-free-rooms.md          |   54 +
 .../problem-257-angular-bisectors.md          |   46 +
 ...problem-258-a-lagged-fibonacci-sequence.md |   40 +
 .../problem-259-reachable-numbers.md          |   42 +
 .../problem-26-reciprocal-cycles.md           |   68 +
 .../project-euler/problem-260-stone-game.md   |   50 +
 .../problem-261-pivotal-square-sums.md        |   42 +
 .../problem-262-mountain-range.md             |   48 +
 ...roblem-263-an-engineers-dream-come-true.md |   54 +
 .../problem-264-triangle-centres.md           |   54 +
 .../problem-265-binary-circles.md             |   48 +
 .../problem-266-pseudo-square-root.md         |   46 +
 .../project-euler/problem-267-billionaire.md  |   48 +
 ...ur-distinct-prime-factors-less-than-100.md |   43 +
 ...ynomials-with-at-least-one-integer-root.md |   48 +
 .../problem-27-quadratic-primes.md            |   78 ++
 .../problem-270-cutting-squares.md            |   48 +
 .../problem-271-modular-cubes-part-1.md       |   42 +
 .../problem-272-modular-cubes-part-2.md       |   42 +
 .../problem-273-sum-of-squares.md             |   40 +
 .../problem-274-divisibility-multipliers.md   |   50 +
 .../problem-275-balanced-sculptures.md        |   50 +
 .../problem-276-primitive-triangles.md        |   42 +
 ...problem-277-a-modified-collatz-sequence.md |   52 +
 ...m-278-linear-combinations-of-semiprimes.md |   44 +
 ...th-integral-sides-and-an-integral-angle.md |   38 +
 .../problem-28-number-spiral-diagonals.md     |   83 ++
 .../problem-280-ant-and-seeds.md              |   42 +
 .../problem-281-pizza-toppings.md             |   44 +
 .../problem-282-the-ackermann-function.md     |   42 +
 ...h-the-area--perimeter-ratio-is-integral.md |   49 +
 .../problem-284-steady-squares.md             |   44 +
 .../problem-285-pythagorean-odds.md           |   46 +
 .../problem-286-scoring-probabilities.md      |   42 +
 ...encoding-a-simple-compression-algorithm.md |   54 +
 .../problem-288-an-enormous-factorial.md      |   48 +
 .../problem-289-eulerian-cycles.md            |   48 +
 .../problem-29-distinct-powers.md             |   86 ++
 .../problem-290-digital-signature.md          |   38 +
 .../problem-291-panaitopol-primes.md          |   40 +
 .../problem-292-pythagorean-polygons.md       |   48 +
 .../problem-293-pseudo-fortunate-numbers.md   |   46 +
 ...oblem-294-sum-of-digits---experience-23.md |   46 +
 .../problem-295-lenticular-holes.md           |   56 +
 ...roblem-296-angular-bisector-and-tangent.md |   42 +
 .../problem-297-zeckendorf-representation.md  |   46 +
 .../problem-298-selective-amnesia.md          |   44 +
 .../problem-299-three-similar-triangles.md    |   50 +
 .../problem-3-largest-prime-factor.md         |   95 ++
 .../problem-30-digit-n-powers.md              |   74 ++
 .../problem-300-protein-folding.md            |   50 +
 .../project-euler/problem-301-nim.md          |   53 +
 .../problem-302-strong-achilles-numbers.md    |   50 +
 ...problem-303-multiples-with-small-digits.md |   44 +
 .../project-euler/problem-304-primonacci.md   |   46 +
 .../problem-305-reflexive-position.md         |   46 +
 .../problem-306-paper-strip-game.md           |   46 +
 .../project-euler/problem-307-chip-defects.md |   42 +
 ...8-an-amazing-prime-generating-automaton.md |   46 +
 .../problem-309-integer-ladders.md            |   44 +
 .../project-euler/problem-31-coin-sums.md     |   77 ++
 .../project-euler/problem-310-nim-square.md   |   46 +
 ...em-311-biclinic-integral-quadrilaterals.md |   48 +
 ...em-312-cyclic-paths-on-sierpiski-graphs.md |   46 +
 .../project-euler/problem-313-sliding-game.md |   44 +
 .../problem-314-the-mouse-on-the-moon.md      |   46 +
 .../problem-315-digital-root-clocks.md        |   58 +
 ...oblem-316-numbers-in-decimal-expansions.md |   50 +
 .../project-euler/problem-317-firecracker.md  |   42 +
 .../project-euler/problem-318-2011-nines.md   |   68 +
 .../problem-319-bounded-sequences.md          |   50 +
 .../problem-32-pandigital-products.md         |  118 ++
 ...-factorials-divisible-by-a-huge-integer.md |   44 +
 .../problem-321-swapping-counters.md          |   46 +
 ...2-binomial-coefficients-divisible-by-10.md |   42 +
 ...itwise-or-operations-on-random-integers.md |   48 +
 .../problem-324-building-a-tower.md           |   42 +
 .../problem-325-stone-game-ii.md              |   50 +
 .../problem-326-modulo-summations.md          |   48 +
 .../problem-327-rooms-of-doom.md              |   54 +
 .../problem-328-lowest-cost-search.md         |   56 +
 .../project-euler/problem-329-prime-frog.md   |   48 +
 .../problem-33-digit-cancelling-fractions.md  |  102 ++
 .../problem-330-eulers-number.md              |   54 +
 .../project-euler/problem-331-cross-flips.md  |   50 +
 .../problem-332-spherical-triangles.md        |   44 +
 .../problem-333-special-partitions.md         |   50 +
 .../problem-334-spilling-the-beans.md         |   48 +
 .../problem-335-gathering-the-beans.md        |   44 +
 .../problem-336-maximix-arrangements.md       |   50 +
 ...problem-337-totient-stairstep-sequences.md |   52 +
 ...blem-338-cutting-rectangular-grid-paper.md |   50 +
 .../problem-339-peredur-fab-efrawg.md         |   42 +
 .../problem-34-digit-factorials.md            |   50 +
 .../problem-340-crazy-function.md             |   48 +
 ...em-341-golombs-self-describing-sequence.md |   44 +
 ...m-342-the-totient-of-a-square-is-a-cube.md |   46 +
 .../problem-343-fractional-sequences.md       |   56 +
 .../problem-344-silver-dollar-game.md         |   54 +
 .../project-euler/problem-345-matrix-sum.md   |   44 +
 .../problem-346-strong-repunits.md            |   42 +
 ...largest-integer-divisible-by-two-primes.md |   48 +
 .../problem-348-sum-of-a-square-and-a-cube.md |   42 +
 .../project-euler/problem-349-langtons-ant.md |   46 +
 .../problem-35-circular-primes.md             |  132 ++
 ...e-least-greatest-and-the-greatest-least.md |   48 +
 .../problem-351-hexagonal-orchards.md         |   46 +
 .../project-euler/problem-352-blood-tests.md  |   56 +
 .../project-euler/problem-353-risky-moon.md   |   52 +
 ...oblem-354-distances-in-a-bees-honeycomb.md |   42 +
 .../problem-355-maximal-coprime-subset.md     |   42 +
 ...-356-largest-roots-of-cubic-polynomials.md |   44 +
 .../problem-357-prime-generating-integers.md  |   42 +
 .../problem-358-cyclic-numbers.md             |   48 +
 .../problem-359-hilberts-new-hotel.md         |   48 +
 .../problem-36-double-base-palindromes.md     |   66 +
 .../project-euler/problem-360-scary-sphere.md |   44 +
 ...-361-subsequence-of-thue-morse-sequence.md |   54 +
 .../problem-362-squarefree-factors.md         |   52 +
 .../project-euler/problem-363-bzier-curves.md |   48 +
 .../problem-364-comfortable-distance.md       |   48 +
 ...problem-365-a-huge-binomial-coefficient.md |   42 +
 .../problem-366-stone-game-iii.md             |   54 +
 .../project-euler/problem-367-bozo-sort.md    |   44 +
 .../problem-368-a-kempner-like-series.md      |   46 +
 .../project-euler/problem-369-badugi.md       |   42 +
 .../problem-37-truncatable-primes.md          |   66 +
 .../problem-370-geometric-triangles.md        |   44 +
 .../problem-371-licence-plates.md             |   48 +
 .../problem-372-pencils-of-rays.md            |   40 +
 .../problem-373-circumscribed-circles.md      |   46 +
 ...m-374-maximum-integer-partition-product.md |   52 +
 .../problem-375-minimum-of-subsequences.md    |   54 +
 .../problem-376-nontransitive-sets-of-dice.md |   54 +
 ...problem-377-sum-of-digits-experience-13.md |   46 +
 .../problem-378-triangle-triples.md           |   48 +
 ...problem-379-least-common-multiple-count.md |   44 +
 .../problem-38-pandigital-multiples.md        |  100 ++
 .../problem-380-amazing-mazes.md              |   44 +
 .../problem-381-prime-k-factorial.md          |   44 +
 .../problem-382-generating-polygons.md        |   48 +
 ...isibility-comparison-between-factorials.md |   44 +
 .../problem-384-rudin-shapiro-sequence.md     |   54 +
 .../problem-385-ellipses-inside-triangles.md  |   53 +
 ...blem-386-maximum-length-of-an-antichain.md |   46 +
 .../problem-387-harshad-numbers.md            |   54 +
 .../problem-388-distinct-lines.md             |   44 +
 .../problem-389-platonic-dice.md              |   40 +
 .../problem-39-integer-right-triangles.md     |   91 ++
 ...th-non-rational-sides-and-integral-area.md |   48 +
 .../project-euler/problem-391-hopping-game.md |   52 +
 .../problem-392-enmeshed-unit-circle.md       |   48 +
 .../problem-393-migrating-ants.md             |   44 +
 .../project-euler/problem-394-eating-pie.md   |   52 +
 .../problem-395-pythagorean-tree.md           |   46 +
 .../problem-396-weak-goodstein-sequence.md    |   54 +
 .../problem-397-triangle-on-parabola.md       |   42 +
 .../project-euler/problem-398-cutting-rope.md |   42 +
 ...roblem-399-squarefree-fibonacci-numbers.md |   54 +
 .../problem-4-largest-palindrome-product.md   |   64 +
 .../problem-40-champernownes-constant.md      |   77 ++
 .../problem-400-fibonacci-tree-game.md        |   52 +
 .../problem-401-sum-of-squares-of-divisors.md |   46 +
 .../problem-402-integer-valued-polynomials.md |   48 +
 ...ce-points-enclosed-by-parabola-and-line.md |   44 +
 .../problem-404-crisscross-ellipses.md        |   46 +
 .../problem-405-a-rectangular-tiling.md       |   48 +
 .../problem-406-guessing-game.md              |   56 +
 .../project-euler/problem-407-idempotents.md  |   42 +
 ...lem-408-admissible-paths-through-a-grid.md |   46 +
 .../project-euler/problem-409-nim-extreme.md  |   48 +
 .../problem-41-pandigital-prime.md            |  117 ++
 .../problem-410-circle-and-tangent-line.md    |   44 +
 .../project-euler/problem-411-uphill-paths.md |   46 +
 .../problem-412-gnomon-numbering.md           |   48 +
 .../problem-413-one-child-numbers.md          |   44 +
 .../problem-414-kaprekar-constant.md          |   60 +
 .../project-euler/problem-415-titanic-sets.md |   46 +
 .../project-euler/problem-416-a-frogs-trip.md |   42 +
 .../problem-417-reciprocal-cycles-ii.md       |   48 +
 .../problem-418-factorisation-triples.md      |   46 +
 .../problem-419-look-and-say-sequence.md      |   58 +
 .../problem-42-coded-triangle-numbers.md      |   71 ++
 ...problem-420-2x2-positive-integer-matrix.md |   44 +
 .../problem-421-prime-factors-of-n151.md      |   44 +
 ...m-422-sequence-of-points-on-a-hyperbola.md |   46 +
 .../problem-423-consecutive-die-throws.md     |   50 +
 .../project-euler/problem-424-kakuro.md       |   54 +
 .../problem-425-prime-connection.md           |   50 +
 .../problem-426-box-ball-system.md            |   50 +
 .../project-euler/problem-427-n-sequences.md  |   48 +
 .../problem-428-necklace-of-circles.md        |   54 +
 ...-429-sum-of-squares-of-unitary-divisors.md |   46 +
 .../problem-43-sub-string-divisibility.md     |  126 ++
 .../project-euler/problem-430-range-flips.md  |   48 +
 .../problem-431-square-space-silo.md          |   46 +
 .../project-euler/problem-432-totient-sum.md  |   42 +
 .../problem-433-steps-in-euclids-algorithm.md |   46 +
 .../project-euler/problem-434-rigid-graphs.md |   52 +
 ...em-435-polynomials-of-fibonacci-numbers.md |   44 +
 .../project-euler/problem-436-unfair-wager.md |   54 +
 .../problem-437-fibonacci-primitive-roots.md  |   64 +
 ...-part-of-polynomial-equations-solutions.md |   44 +
 .../problem-439-sum-of-sum-of-divisors.md     |   44 +
 .../problem-44-pentagon-numbers.md            |   77 ++
 .../problem-440-gcd-and-tiling.md             |   48 +
 ...he-inverse-summation-of-coprime-couples.md |   44 +
 .../problem-442-eleven-free-integers.md       |   44 +
 .../project-euler/problem-443-gcd-sequence.md |   48 +
 .../problem-444-the-roundtable-lottery.md     |   53 +
 .../problem-445-retractions-a.md              |   44 +
 .../problem-446-retractions-b.md              |   44 +
 .../problem-447-retractions-c.md              |   44 +
 ...oblem-448-average-least-common-multiple.md |   46 +
 .../problem-449-chocolate-covered-candy.md    |   48 +
 ...-45-triangular-pentagonal-and-hexagonal.md |   82 ++
 ...blem-450-hypocycloid-and-lattice-points.md |   60 +
 .../problem-451-modular-inverses.md           |   60 +
 .../problem-452-long-products.md              |   44 +
 .../problem-453-lattice-quadrilaterals.md     |   46 +
 ...problem-454-diophantine-reciprocals-iii.md |   44 +
 ...problem-455-powers-with-trailing-digits.md |   42 +
 ...-456-triangles-containing-the-origin-ii.md |   48 +
 ...polynomial-modulo-the-square-of-a-prime.md |   46 +
 .../problem-458-permutations-of-project.md    |   44 +
 .../problem-459-flipping-game.md              |   52 +
 .../problem-46-goldbachs-other-conjecture.md  |   99 ++
 .../problem-460-an-ant-on-the-move.md         |   48 +
 .../project-euler/problem-461-almost-pi.md    |  153 +++
 ...lem-462-permutation-of-3-smooth-numbers.md |   52 +
 ...problem-463-a-weird-recurrence-relation.md |   50 +
 ...roblem-464-mbius-function-and-intervals.md |   50 +
 .../problem-465-polar-polygons.md             |   52 +
 ...istinct-terms-in-a-multiplication-table.md |   48 +
 .../project-euler/problem-467-superinteger.md |   50 +
 ...mooth-divisors-of-binomial-coefficients.md |   44 +
 .../project-euler/problem-469-empty-chairs.md |   46 +
 .../problem-47-distinct-primes-factors.md     |  113 ++
 .../project-euler/problem-470-super-ramvok.md |   50 +
 ...oblem-471-triangle-inscribed-in-ellipse.md |   44 +
 .../problem-472-comfortable-distance-ii.md    |   56 +
 .../problem-473-phigital-number-base.md       |   54 +
 .../problem-474-last-digits-of-divisors.md    |   44 +
 .../problem-475-music-festival.md             |   46 +
 .../problem-476-circle-packing-ii.md          |   44 +
 .../problem-477-number-sequence-game.md       |   66 +
 .../project-euler/problem-478-mixtures.md     |   50 +
 .../problem-479-roots-on-the-rise.md          |   46 +
 .../project-euler/problem-48-self-powers.md   |   80 ++
 .../problem-480-the-last-question.md          |  114 ++
 .../problem-49-prime-permutations.md          |   93 ++
 .../problem-5-smallest-multiple.md            |   83 ++
 .../problem-50-consecutive-prime-sum.md       |   95 ++
 .../problem-51-prime-digit-replacements.md    |   48 +
 .../problem-52-permuted-multiples.md          |   81 ++
 .../problem-53-combinatoric-selections.md     |   89 ++
 .../project-euler/problem-54-poker-hands.md   | 1096 +++++++++++++++++
 .../problem-55-lychrel-numbers.md             |  113 ++
 .../problem-56-powerful-digit-sum.md          |  101 ++
 .../problem-57-square-root-convergents.md     |   98 ++
 .../project-euler/problem-58-spiral-primes.md |  105 ++
 .../problem-59-xor-decryption.md              |   58 +
 .../problem-6-sum-square-difference.md        |   78 ++
 .../problem-60-prime-pair-sets.md             |   46 +
 .../problem-61-cyclical-figurate-numbers.md   |  252 ++++
 .../problem-62-cubic-permutations.md          |   97 ++
 .../problem-63-powerful-digit-counts.md       |  122 ++
 .../problem-64-odd-period-square-roots.md     |  148 +++
 .../problem-65-convergents-of-e.md            |  117 ++
 .../problem-66-diophantine-equation.md        |  129 ++
 .../problem-67-maximum-path-sum-ii.md         |   96 ++
 .../problem-68-magic-5-gon-ring.md            |   71 ++
 .../problem-69-totient-maximum.md             |  110 ++
 .../project-euler/problem-7-10001st-prime.md  |   86 ++
 .../problem-70-totient-permutation.md         |  118 ++
 .../problem-71-ordered-fractions.md           |   95 ++
 .../problem-72-counting-fractions.md          |   90 ++
 ...roblem-73-counting-fractions-in-a-range.md |   83 ++
 .../problem-74-digit-factorial-chains.md      |  131 ++
 ...lem-75-singular-integer-right-triangles.md |  117 ++
 .../problem-76-counting-summations.md         |   83 ++
 .../problem-77-prime-summations.md            |  110 ++
 .../problem-78-coin-partitions.md             |  103 ++
 .../problem-79-passcode-derivation.md         |  115 ++
 .../problem-8-largest-product-in-a-series.md  |   92 ++
 ...roblem-80-square-root-digital-expansion.md |  109 ++
 .../problem-81-path-sum-two-ways.md           |  189 +++
 .../problem-82-path-sum-three-ways.md         |  199 +++
 .../problem-83-path-sum-four-ways.md          |  219 ++++
 .../project-euler/problem-84-monopoly-odds.md |  268 ++++
 .../problem-85-counting-rectangles.md         |  109 ++
 .../project-euler/problem-86-cuboid-route.md  |   94 ++
 .../problem-87-prime-power-triples.md         |  131 ++
 .../problem-88-product-sum-numbers.md         |  110 ++
 .../problem-89-roman-numerals.md              |  117 ++
 .../problem-9-special-pythagorean-triplet.md  |   74 ++
 .../problem-90-cube-digit-pairs.md            |   65 +
 ...ight-triangles-with-integer-coordinates.md |  119 ++
 .../problem-92-square-digit-chains.md         |  155 +++
 .../problem-93-arithmetic-expressions.md      |   59 +
 ...problem-94-almost-equilateral-triangles.md |   84 ++
 .../problem-95-amicable-chains.md             |  126 ++
 .../project-euler/problem-96-su-doku.md       |  296 +++++
 .../problem-97-large-non-mersenne-prime.md    |   88 ++
 .../problem-98-anagramic-squares.md           |  205 +++
 .../problem-99-largest-exponential.md         |   83 ++
 .../rosetta-code/100-doors.md                 |   67 +
 .../rosetta-code/24-game.md                   |  203 +++
 .../9-billion-names-of-god-the-integer.md     |  116 ++
 .../rosetta-code/abc-problem.md               |  136 ++
 ...ient-and-perfect-number-classifications.md |   95 ++
 .../rosetta-code/accumulator-factory.md       |   79 ++
 .../rosetta-code/ackermann-function.md        |   71 ++
 .../rosetta-code/align-columns.md             |  194 +++
 .../rosetta-code/amicable-pairs.md            |  126 ++
 .../rosetta-code/averages-mode.md             |   79 ++
 .../averages-pythagorean-means.md             |  144 +++
 .../rosetta-code/averages-root-mean-square.md |   57 +
 .../rosetta-code/babbage-problem.md           |   78 ++
 .../rosetta-code/balanced-brackets.md         |  188 +++
 ...cles-of-given-radius-through-two-points.md |  150 +++
 .../rosetta-code/closest-pair-problem.md      |  414 +++++++
 .../rosetta-code/combinations.md              |   95 ++
 .../rosetta-code/comma-quibbling.md           |  101 ++
 .../rosetta-code/compare-a-list-of-strings.md |  132 ++
 .../convert-seconds-to-compound-duration.md   |  129 ++
 .../count-occurrences-of-a-substring.md       |   79 ++
 .../rosetta-code/count-the-coins.md           |   93 ++
 .../rosetta-code/cramers-rule.md              |  167 +++
 .../cumulative-standard-deviation.md          |  101 ++
 .../rosetta-code/cusip.md                     |  118 ++
 .../rosetta-code/cut-a-rectangle.md           |  203 +++
 .../rosetta-code/date-format.md               |   90 ++
 .../rosetta-code/date-manipulation.md         |  109 ++
 .../rosetta-code/day-of-the-week.md           |   74 ++
 .../rosetta-code/deal-cards-for-freecell.md   |  210 ++++
 .../rosetta-code/deepcopy.md                  |   85 ++
 .../define-a-primitive-data-type.md           |  132 ++
 .../rosetta-code/department-numbers.md        |  126 ++
 .../rosetta-code/discordian-date.md           |  195 +++
 .../rosetta-code/dot-product.md               |   75 ++
 .../rosetta-code/element-wise-operations.md   |  214 ++++
 .../rosetta-code/emirp-primes.md              |  138 +++
 .../rosetta-code/entropy.md                   |   96 ++
 .../rosetta-code/equilibrium-index.md         |  130 ++
 .../rosetta-code/ethiopian-multiplication.md  |  156 +++
 .../rosetta-code/euler-method.md              |  152 +++
 .../evaluate-binomial-coefficients.md         |   74 ++
 .../execute-a-markov-algorithm.md             |  246 ++++
 .../rosetta-code/execute-brain.md             |  202 +++
 .../extensible-prime-generator.md             |  139 +++
 .../rosetta-code/factorial.md                 |   80 ++
 .../factors-of-a-mersenne-number.md           |  148 +++
 .../rosetta-code/factors-of-an-integer.md     |   74 ++
 .../rosetta-code/farey-sequence.md            |  109 ++
 .../fibonacci-n-step-number-sequences.md      |  133 ++
 .../rosetta-code/fibonacci-sequence.md        |   75 ++
 .../rosetta-code/fibonacci-word.md            |  121 ++
 .../rosetta-code/fizzbuzz.md                  |   92 ++
 .../rosetta-code/fractran.md                  |  139 +++
 .../rosetta-code/gamma-function.md            |  104 ++
 .../rosetta-code/gaussian-elimination.md      |  230 ++++
 .../rosetta-code/general-fizzbuzz.md          |  175 +++
 .../generate-lower-case-ascii-alphabet.md     |   99 ++
 .../rosetta-code/generator-exponential.md     |  117 ++
 .../rosetta-code/gray-code.md                 |  122 ++
 .../rosetta-code/greatest-common-divisor.md   |   79 ++
 .../greatest-subsequential-sum.md             |  113 ++
 .../rosetta-code/hailstone-sequence.md        |   98 ++
 .../rosetta-code/happy-numbers.md             |  129 ++
 .../rosetta-code/harshad-or-niven-series.md   |   87 ++
 .../rosetta-code/hash-from-two-arrays.md      |  105 ++
 .../rosetta-code/hash-join.md                 |  237 ++++
 .../rosetta-code/heronian-triangles.md        |  155 +++
 .../hofstadter-figure-figure-sequences.md     |  166 +++
 .../rosetta-code/hofstadter-q-sequence.md     |   92 ++
 .../rosetta-code/i-before-e-except-after-c.md |  101 ++
 .../rosetta-code/iban.md                      |  104 ++
 .../rosetta-code/identity-matrix.md           |   88 ++
 .../rosetta-code/iterated-digits-squaring.md  |   96 ++
 .../rosetta-code/jaro-distance.md             |  146 +++
 .../rosetta-code/jortsort.md                  |   90 ++
 .../rosetta-code/josephus-problem.md          |   98 ++
 .../rosetta-code/k-d-tree.md                  |  469 +++++++
 .../rosetta-code/kaprekar-numbers.md          |  110 ++
 .../rosetta-code/knapsack-problem-0-1.md      |  255 ++++
 .../rosetta-code/knapsack-problem-bounded.md  |  212 ++++
 .../knapsack-problem-continuous.md            |  169 +++
 .../knapsack-problem-unbounded.md             |  185 +++
 .../rosetta-code/knights-tour.md              |  225 ++++
 .../largest-int-from-concatenated-ints.md     |   85 ++
 .../rosetta-code/last-friday-of-each-month.md |   99 ++
 .../rosetta-code/last-letter-first-letter.md  |  211 ++++
 .../rosetta-code/leap-year.md                 |   79 ++
 .../rosetta-code/least-common-multiple.md     |   87 ++
 .../rosetta-code/left-factorials.md           |  115 ++
 .../rosetta-code/letter-frequency.md          |  209 ++++
 .../rosetta-code/levenshtein-distance.md      |  105 ++
 .../linear-congruential-generator.md          |   97 ++
 .../rosetta-code/long-multiplication.md       |  111 ++
 .../longest-common-subsequence.md             |  102 ++
 .../longest-increasing-subsequence.md         |  120 ++
 .../rosetta-code/longest-string-challenge.md  |  101 ++
 .../rosetta-code/look-and-say-sequence.md     |   92 ++
 ...oop-over-multiple-arrays-simultaneously.md |  139 +++
 .../rosetta-code/lu-decomposition.md          |  318 +++++
 .../rosetta-code/lucas-lehmer-test.md         |  109 ++
 .../rosetta-code/ludic-numbers.md             |  129 ++
 .../luhn-test-of-credit-card-numbers.md       |  125 ++
 .../rosetta-code/lychrel-numbers.md           |  151 +++
 .../rosetta-code/lzw-compression.md           |  239 ++++
 .../rosetta-code/s-expressions.md             |   96 ++
 .../sailors-coconuts-and-a-monkey-problem.md  |   90 ++
 .../rosetta-code/search-a-list-of-records.md  |  103 ++
 .../rosetta-code/sedols.md                    |   96 ++
 .../rosetta-code/self-describing-numbers.md   |  100 ++
 .../rosetta-code/self-referential-sequence.md |  202 +++
 .../rosetta-code/semiprime.md                 |  146 +++
 .../rosetta-code/set-consolidation.md         |  196 +++
 .../rosetta-code/set-of-real-numbers.md       |  239 ++++
 .../rosetta-code/sha-1.md                     |  180 +++
 .../rosetta-code/sha-256.md                   |  436 +++++++
 .../sort-an-array-of-composite-structures.md  |  116 ++
 .../rosetta-code/sort-disjoint-sublist.md     |  147 +++
 .../rosetta-code/sort-stability.md            |  168 +++
 .../sort-using-a-custom-comparator.md         |  121 ++
 .../sorting-algorithms-bead-sort.md           |  129 ++
 .../sorting-algorithms-bogosort.md            |  126 ++
 .../sorting-algorithms-cocktail-sort.md       |  140 +++
 .../sorting-algorithms-comb-sort.md           |  179 +++
 .../sorting-algorithms-gnome-sort.md          |  124 ++
 .../sorting-algorithms-pancake-sort.md        |  124 ++
 .../sorting-algorithms-permutation-sort.md    |  131 ++
 .../sorting-algorithms-shell-sort.md          |  106 ++
 .../sorting-algorithms-stooge-sort.md         |  125 ++
 .../sorting-algorithms-strand-sort.md         |  118 ++
 .../rosetta-code/soundex.md                   |  151 +++
 .../rosetta-code/spiral-matrix.md             |  109 ++
 ...ter-string-based-on-change-of-character.md |  145 +++
 .../rosetta-code/state-name-puzzle.md         |  159 +++
 .../rosetta-code/stern-brocot-sequence.md     |  114 ++
 .../rosetta-code/straddling-checkerboard.md   |  186 +++
 .../rosetta-code/stream-merge.md              |  140 +++
 ...s-and-extended-characters-from-a-string.md |   80 ++
 .../rosetta-code/subleq.md                    |  196 +++
 .../rosetta-code/sudoku.md                    |  321 +++++
 .../rosetta-code/sum-digits-of-an-integer.md  |   89 ++
 .../rosetta-code/sum-multiples-of-3-and-5.md  |   77 ++
 .../rosetta-code/sum-of-a-series.md           |   82 ++
 .../rosetta-code/sum-of-squares.md            |   79 ++
 .../rosetta-code/sum-to-100.md                |  180 +++
 .../sutherland-hodgman-polygon-clipping.md    |  199 +++
 .../rosetta-code/symmetric-difference.md      |  121 ++
 .../rosetta-code/taxicab-numbers.md           |  140 +++
 .../tokenize-a-string-with-escaping.md        |  124 ++
 .../rosetta-code/top-rank-per-group.md        |  192 +++
 .../rosetta-code/topological-sort.md          |  185 +++
 .../rosetta-code/towers-of-hanoi.md           |   87 ++
 .../rosetta-code/vector-cross-product.md      |   75 ++
 .../rosetta-code/vector-dot-product.md        |   96 ++
 .../rosetta-code/word-frequency.md            |  136 ++
 .../rosetta-code/word-wrap.md                 |  106 ++
 .../rosetta-code/y-combinator.md              |   87 ++
 .../zeckendorf-number-representation.md       |  205 +++
 .../zhang-suen-thinning-algorithm.md          |  321 +++++
 .../rosetta-code/zig-zag-matrix.md            |  117 ++
 .../build-a-camper-leaderboard.md             |   31 +
 .../build-a-light-bright-app.md               |   37 +
 .../build-a-nightlife-coordination-app.md     |   31 +
 .../build-a-pinterest-clone.md                |   37 +
 .../take-home-projects/build-a-pong-game.md   |   33 +
 .../take-home-projects/build-a-recipe-box.md  |   37 +
 .../build-a-roguelike-dungeon-crawler-game.md |   41 +
 .../take-home-projects/build-a-simon-game.md  |   41 +
 .../build-a-tic-tac-toe-game.md               |   29 +
 .../take-home-projects/build-a-voting-app.md  |   37 +
 .../build-a-wikipedia-viewer.md               |   33 +
 ...build-an-image-search-abstraction-layer.md |   27 +
 .../build-the-game-of-life.md                 |   39 +
 .../chart-the-stock-market.md                 |   29 +
 .../manage-a-book-trading-club.md             |   31 +
 .../map-data-across-the-globe.md              |   31 +
 .../p2p-video-chat-application.md             |   41 +
 ...-contiguity-with-a-force-directed-graph.md |   31 +
 .../show-the-local-weather.md                 |   33 +
 .../use-the-twitch-json-api.md                |   35 +
 .../deep-learning-demystified.md              |   34 +
 .../how-convolutional-neural-networks-work.md |   30 +
 .../how-deep-neural-networks-work.md          |   30 +
 ...rks-rnn-and-long-short-term-memory-lstm.md |   30 +
 .../book-recommendation-engine-using-knn.md   |   35 +
 .../cat-and-dog-image-classifier.md           |   33 +
 ...near-regression-health-costs-calculator.md |   35 +
 .../neural-network-sms-text-classifier.md     |   33 +
 .../rock-paper-scissors.md                    |   33 +
 .../tensorflow/conclusion.md                  |   30 +
 ...al-neural-networks-evaluating-the-model.md |   30 +
 ...ral-networks-picking-a-pretrained-model.md |   49 +
 ...neural-networks-the-convolutional-layer.md |   30 +
 .../convolutional-neural-networks.md          |   30 +
 ...-learning-algorithms-building-the-model.md |   30 +
 ...core-learning-algorithms-classification.md |   30 +
 .../core-learning-algorithms-clustering.md    |   38 +
 ...earning-algorithms-hidden-markov-models.md |   30 +
 ...earning-algorithms-the-training-process.md |   30 +
 ...ng-algorithms-training-and-testing-data.md |   30 +
 ...using-probabilities-to-make-predictions.md |   30 +
 ...e-learning-algorithms-working-with-data.md |   30 +
 .../tensorflow/core-learning-algorithms.md    |   36 +
 ...creating-a-convolutional-neural-network.md |   52 +
 ...roduction-machine-learning-fundamentals.md |   30 +
 .../tensorflow/introduction-to-tensorflow.md  |   38 +
 ...processing-with-rnns-building-the-model.md |   62 +
 ...ssing-with-rnns-create-a-play-generator.md |   40 +
 ...processing-with-rnns-making-predictions.md |   30 +
 ...al-language-processing-with-rnns-part-2.md |   30 +
 ...ing-with-rnns-recurring-neural-networks.md |   34 +
 ...ocessing-with-rnns-sentimental-analysis.md |   50 +
 ...processing-with-rnns-training-the-model.md |   54 +
 .../natural-language-processing-with-rnns.md  |   30 +
 .../neural-networks-activation-functions.md   |   30 +
 .../neural-networks-creating-a-model.md       |   50 +
 .../tensorflow/neural-networks-optimizers.md  |   30 +
 .../neural-networks-with-tensorflow.md        |   30 +
 ...cement-learning-with-q-learning-example.md |   46 +
 ...rcement-learning-with-q-learning-part-2.md |   26 +
 .../reinforcement-learning-with-q-learning.md |   30 +
 .../apis-and-microservices-certificate.yml    |   15 +
 .../data-analysis-with-python-certificate.yml |   16 +
 .../data-visualization-certificate.yml        |   15 +
 .../front-end-libraries-certificate.yml       |   15 +
 .../information-security-certificate.yml      |   15 +
 ...rithms-and-data-structures-certificate.yml |   15 +
 .../legacy-back-end-certificate.yml           |   25 +
 .../legacy-data-visualization-certificate.yml |   25 +
 .../legacy-front-end-certificate.yml          |   25 +
 .../legacy-full-stack-certificate.yml         |   17 +
 ...rity-and-quality-assurance-certificate.yml |   15 +
 ...chine-learning-with-python-certificate.yml |   16 +
 .../quality-assurance-certificate.yml         |   16 +
 .../responsive-web-design-certificate.yml     |   15 +
 ...ific-computing-with-python-certificate.yml |   15 +
 utils/is-audited.js                           |    7 +-
 3301 files changed, 423168 insertions(+), 6 deletions(-)
 create mode 100644 client/i18n/locales/italian/links.json
 create mode 100644 client/i18n/locales/italian/meta-tags.json
 create mode 100644 client/i18n/locales/italian/motivation.json
 create mode 100644 client/i18n/locales/italian/trending.json
 create mode 100644 client/i18n/locales/portuguese/links.json
 create mode 100644 client/i18n/locales/portuguese/meta-tags.json
 create mode 100644 client/i18n/locales/portuguese/motivation.json
 create mode 100644 client/i18n/locales/portuguese/trending.json
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-custom-heading.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/delete-your-jquery-functions.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-state-to-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/access-props-using-this.props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/add-comments-in-jsx.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/add-event-listeners.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/add-inline-styles-in-react.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/bind-this-to-a-class-method.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/compose-react-components.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-complex-jsx-element.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-component-with-composition.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-form.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-input.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-react-component.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-simple-jsx-element.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateful-component.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateless-functional-component.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/define-an-html-class-in-jsx.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/introducing-inline-styles.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/override-default-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/pass-a-callback-as-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/pass-an-array-as-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-conditionally-from-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-html-elements-to-the-dom.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/render-with-an-if-else-condition.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/set-state-with-this.setstate.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-default-props.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-react-to-render-nested-components.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-state-to-toggle-an-element.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/write-a-react-component-from-scratch.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/react/write-a-simple-counter.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/combine-multiple-reducers.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/create-a-redux-store.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/define-a-redux-action.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/define-an-action-creator.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/dispatch-an-action-event.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/get-state-from-the-redux-store.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/handle-an-action-in-the-store.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/never-mutate-state.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/register-a-store-listener.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/remove-an-item-from-an-array.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/send-action-data-to-the-store.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/use-const-for-action-types.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/redux/write-a-counter-with-redux.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/nest-css-with-sass.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/store-data-with-sass-variables.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
 create mode 100644 curriculum/challenges/italian/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-001.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-002.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-003.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-004.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-005.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-006.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-007.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-008.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-009.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-010.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-011.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-012.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-013.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-014.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-015.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-016.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-017.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-018.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-019.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-020.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-021.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-022.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-023.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-024.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-025.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-026.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-027.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-028.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-029.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-030.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-031.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-032.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-033.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-034.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-035.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-036.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-037.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-038.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-039.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-040.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-041.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-042.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-043.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-044.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-045.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-046.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-047.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-048.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-049.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-050.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-051.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-052.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-053.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-054.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-055.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-056.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-057.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-058.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-059.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-060.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-061.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-062.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-063.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-064.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-065.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-066.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-067.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-068.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-069.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-070.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-071.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-072.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-073.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-074.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-075.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-076.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-077.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-078.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-079.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-080.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-081.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-082.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-083.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-084.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-085.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-086.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-087.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-088.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-089.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-090.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-091.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-092.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-093.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-094.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-095.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-096.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-097.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-098.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-099.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-100.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-101.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-102.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-103.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-104.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-105.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-106.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-107.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-108.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-109.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-110.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-111.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-112.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-113.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-114.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-115.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-116.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-117.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-118.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-119.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-120.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-121.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-122.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-123.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-124.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-125.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-126.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-127.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-128.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-129.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-130.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-131.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-132.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-133.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-134.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-135.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-136.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-137.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-138.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-139.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-140.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-141.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-142.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-143.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-144.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-145.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-146.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
 create mode 100644 curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
 create mode 100644 curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/american-british-translator.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/issue-tracker.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/personal-library.md
 create mode 100644 curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-functions.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-lists.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-objects.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/reading-files.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
 create mode 100644 curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/basics-of-numpy.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/copying-arrays-warning.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/initialize-array-problem.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/initializing-different-arrays.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/mathematics.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/reorganizing-arrays.md
 create mode 100644 curriculum/challenges/italian/08-data-analysis-with-python/numpy/what-is-numpy.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-projects/anonymous-message-board.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-projects/port-scanner.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-projects/sha-1-password-cracker.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-projects/stock-price-checker.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
 create mode 100644 curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/introduction-and-setup.md
 create mode 100644 curriculum/challenges/italian/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-bubble-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-insertion-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-merge-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-quick-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-selection-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/inventory-update.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/no-repeats-please.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/algorithms/pairwise.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/breadth-first-search.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-circular-queue.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-hash-table.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-queue-class.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-set-class.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-stack-class.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/depth-first-search.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/incidence-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/typed-arrays.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-109-darts.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-13-large-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-135-same-differences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-161-triominoes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-165-intersections.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-185-number-mind.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-205-dice-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-22-names-scores.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-227-the-chase.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-232-the-race.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-240-top-dice.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-243-resilience.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-244-sliders.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-245-coresilience.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-250-250250.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-260-stone-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-267-billionaire.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-301-nim.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-304-primonacci.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-310-nim-square.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-317-firecracker.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-369-badugi.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-407-idempotents.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-424-kakuro.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-430-range-flips.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-452-long-products.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-467-superinteger.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-475-music-festival.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-478-mixtures.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-48-self-powers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-96-su-doku.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/100-doors.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/24-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abc-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ackermann-function.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/align-columns.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-mode.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/babbage-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/balanced-brackets.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/combinations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-the-coins.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cramers-rule.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cusip.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-format.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-manipulation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/day-of-the-week.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deepcopy.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/department-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/discordian-date.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/dot-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/element-wise-operations.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/emirp-primes.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/entropy.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/equilibrium-index.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/euler-method.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-brain.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factorial.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/farey-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fizzbuzz.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fractran.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gamma-function.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generator-exponential.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gray-code.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/happy-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-join.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iban.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/identity-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jaro-distance.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jortsort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/josephus-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/k-d-tree.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knights-tour.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/leap-year.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/left-factorials.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/letter-frequency.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/long-multiplication.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lzw-compression.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/s-expressions.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sedols.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/semiprime.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-consolidation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-1.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-256.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-stability.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/soundex.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/spiral-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stream-merge.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/subleq.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sudoku.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-squares.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-to-100.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/topological-sort.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-cross-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-dot-product.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-frequency.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-wrap.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/y-combinator.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
 create mode 100644 curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/conclusion.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
 create mode 100644 curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/convert-celsius-to-fahrenheit.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/finders-keepers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/reverse-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-an-arrays-contents-using-bracket-notation.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-property-names-with-bracket-notation.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-to-an-array-with-push-and-unshift.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-using-splice.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-key-value-pairs-to-javascript-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-for-the-presence-of-an-element-with-indexof.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-if-an-object-has-a-property.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/combine-arrays-with-the-spread-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-an-array-with-the-spread-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-array-items-using-slice.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/create-complex-multi-dimensional-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/generate-an-array-of-all-object-keys-with-object.keys.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-array-stored-in-an-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-object-nested-within-an-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-from-an-array-with-pop-and-shift.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-using-splice.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-an-array-to-store-a-collection-of-data.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-the-delete-keyword-to-remove-object-properties.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-001.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-002.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-003.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-004.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-005.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-006.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-007.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-008.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-009.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-010.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-011.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-012.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-013.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-014.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-015.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-016.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-017.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-018.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-019.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-020.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-021.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-022.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-023.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-024.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-025.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-026.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-027.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-028.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-029.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-030.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-031.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-032.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-033.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-034.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-035.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-036.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-037.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-038.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-039.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-040.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-041.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-042.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-043.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-044.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-045.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-046.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-047.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-048.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-049.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-050.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-051.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-052.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-053.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-054.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-055.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-056.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-057.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-058.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-059.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-060.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-061.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-062.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-063.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-064.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-065.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-066.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-067.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-068.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-069.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-070.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-071.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-072.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-073.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-074.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-075.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-076.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-077.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-078.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-079.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-080.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-081.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-082.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-083.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-084.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-085.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-086.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-087.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-088.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-089.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-090.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-091.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-092.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-093.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-094.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-095.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-096.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-097.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-098.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-099.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-100.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-101.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-102.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-103.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-104.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-105.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-106.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-107.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-108.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-109.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-110.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-111.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-112.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-113.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-114.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-115.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-116.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-117.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-118.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-119.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-120.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-121.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-122.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-123.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-124.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-125.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-126.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-127.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-128.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-129.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-130.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-131.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-132.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-133.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-134.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-135.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-136.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-137.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-138.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-139.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-140.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-141.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-142.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-143.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-144.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-145.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-146.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-147.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-148.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-149.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-150.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-151.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-152.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-153.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-bracket-notation.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-dot-notation.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-new-properties-to-a-javascript-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-two-numbers-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/adding-a-default-option-in-switch-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/appending-variables-to-strings.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assigning-the-value-of-one-variable-to-another.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/build-javascript-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-addition.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-division.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-multiplication.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-subtraction.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/count-backwards-with-a-for-loop.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-javascript-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-string-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/delete-properties-from-a-javascript-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-number-by-another-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/finding-a-remainder-in-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-vs.-local-scope-in-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/increment-a-number-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-odd-numbers-with-a-for-loop.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-through-an-array-with-a-for-loop.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-for-loops.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-while-loops.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/logical-order-in-if-else-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-pop.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-push.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-shift.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-unshift.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulating-complex-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/modify-array-data-with-indexes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-decimals-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-numbers-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nest-one-array-within-another-array.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nesting-for-loops.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/passing-values-to-functions-with-arguments.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/profile-lookup.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replacing-if-else-chains-with-switch.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-a-value-from-a-function-with-return.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/shopping-list.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/store-multiple-values-in-one-variable-using-javascript-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/subtract-one-number-from-another-with-javascript.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-boolean-values.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-undefined-value-returned-from-a-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/updating-object-properties.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-first-character-in-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-last-character-in-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-character-in-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-to-last-character-in-a-string.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-conditional-logic-with-if-statements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-multiple-conditional-ternary-operators.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-conditional-ternary-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/write-reusable-javascript-with-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-arguments-passed-in-the-wrong-order-when-calling-a-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-missing-open-and-closing-parenthesis-after-a-function-call.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-mixed-usage-of-single-and-double-quotes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-off-by-one-errors-when-using-indexing.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-unclosed-parentheses-brackets-braces-and-quotes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-use-of-assignment-operator-instead-of-equality-operator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/prevent-infinite-loops-with-a-valid-terminal-condition.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/understanding-the-differences-between-the-freecodecamp-and-browser-console.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-caution-when-reinitializing-variables-inside-a-loop.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-the-javascript-console-to-check-the-value-of-a-variable.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-typeof-to-check-the-type-of-a-variable.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/compare-scopes-of-the-var-and-let-keywords.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-javascript-promise.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-an-export-fallback-with-export-default.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-strings-using-template-literals.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/declare-a-read-only-variable-with-the-const-keyword.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/explore-differences-between-the-var-and-let-keywords.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-fulfilled-promise-with-then.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-rejected-promise-with-catch.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/import-a-default-export.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/prevent-object-mutation.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/reuse-javascript-code-using-import.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use--to-import-everything-from-a-file.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-arrow-functions-to-write-concise-anonymous-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-nested-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-pass-an-object-as-a-functions-parameters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-with-the-rest-parameter-to-reassign-array-elements.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-export-to-share-a-code-block.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-getters-and-setters-to-control-access-to-an-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-rest-parameter-with-function-parameters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-spread-operator-to-evaluate-arrays-in-place.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-arrow-functions-with-parameters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-object-literal-declarations-using-object-property-shorthand.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-001.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-002.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-003.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-004.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-005.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-006.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-007.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-008.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-009.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-010.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-011.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-012.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-013.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-014.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-015.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-016.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-017.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-018.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-019.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-020.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-021.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-022.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-023.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-024.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-025.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-026.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-027.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-028.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-029.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-030.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-031.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-032.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-033.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-034.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-035.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-036.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-037.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-038.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-039.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-040.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-041.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-042.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-043.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-044.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-045.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-046.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-047.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-048.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-049.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-050.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-051.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-052.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-053.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-054.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-055.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-056.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-057.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-058.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-059.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-060.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-061.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-062.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-063.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-064.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-065.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-066.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-067.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-068.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-069.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-070.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-071.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-072.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-073.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-074.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-075.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-076.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-077.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-078.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-079.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-080.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-081.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-082.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-083.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-084.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-085.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-086.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-087.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-088.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-089.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-090.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-091.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-092.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-093.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-094.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-095.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-096.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-097.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-098.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-099.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-100.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-101.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-102.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-103.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-104.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-105.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-106.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-107.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-108.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-109.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-110.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-111.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-112.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-113.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-114.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-115.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-116.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-117.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-118.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-119.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-120.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-121.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-122.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-123.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-124.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-125.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-126.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-127.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-128.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-129.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-130.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-131.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-132.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-133.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-134.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-135.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-136.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-137.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-138.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-139.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-140.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-141.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/apply-functional-programming-to-convert-strings-to-url-slugs.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/avoid-mutations-and-side-effects-using-functional-programming.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-an-array-into-a-string-using-the-join-method.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-two-arrays-using-the-concat-method.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-map-on-a-prototype.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-the-filter-method-on-a-prototype.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/introduction-to-currying-and-partial-application.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/learn-about-functional-programming.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/pass-arguments-to-avoid-external-dependence-in-a-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/refactor-global-variables-out-of-functions.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/remove-elements-from-an-array-using-slice-instead-of-splice.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-a-sorted-array-without-changing-the-original-array.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-part-of-an-array-using-the-slice-method.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/sort-an-array-alphabetically-using-the-sort-method.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/split-a-string-into-an-array-using-the-split-method.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-the-hazards-of-using-imperative-code.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-filter-method-to-extract-data-from-an-array.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-map-method-to-extract-data-from-an-array.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-reduce-method-to-analyze-data.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/arguments-optional.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/convert-html-entities.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/pig-latin.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-001.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-002.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-003.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-004.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-005.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-006.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-007.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-008.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-009.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-010.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-011.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-012.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-013.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-014.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-015.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-016.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-017.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-018.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-019.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-020.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-021.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-022.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-023.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-024.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-025.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-026.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-027.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-028.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-029.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-030.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-031.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-032.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-033.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-034.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-035.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-036.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-037.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-038.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-039.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-040.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-041.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-042.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-043.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-044.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-045.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-046.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-047.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-048.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-049.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-050.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-051.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-052.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-053.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-054.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-055.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-056.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-057.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-058.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-059.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-060.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-061.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-062.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-063.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-064.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-065.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-066.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-067.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-068.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-069.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-070.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-071.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-072.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-073.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-074.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-075.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-076.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/caesars-cipher.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/change-the-prototype-to-a-new-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-basic-javascript-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-method-on-an-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/define-a-constructor-function.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/extend-constructors-to-receive-arguments.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/inherit-behaviors-from-a-supertype.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/iterate-over-all-properties.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/make-code-more-reusable-with-the-this-keyword.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/override-inherited-methods.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/remember-to-set-the-constructor-property-when-changing-the-prototype.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/reset-an-inherited-constructor-property.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/set-the-childs-prototype-to-an-instance-of-the-parent.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-own-properties.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-constructor-property.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-immediately-invoked-function-expression-iife.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-prototype-chain.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-where-an-objects-prototype-comes-from.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-constructor-to-create-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-mixin-to-add-common-behavior-between-unrelated-objects.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-an-iife-to-create-a-module.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-closure-to-protect-properties-within-an-object-from-being-modified-externally.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-dot-notation-to-access-the-properties-of-an-object.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-inheritance-so-you-dont-repeat-yourself.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-prototype-properties-to-reduce-duplicate-code.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/verify-an-objects-constructor-with-instanceof.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-all-or-none.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-mixed-grouping-of-characters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/extract-matches.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-characters-with-lazy-matching.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-more-than-the-first-match.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-one-or-more-criminals-in-a-hunt.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/ignore-case-while-matching.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-a-literal-string-with-different-possibilities.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-letters-and-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-non-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-anything-with-wildcard-period.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-beginning-string-patterns.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-ending-string-patterns.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-everything-but-letters-and-numbers.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-letters-of-the-alphabet.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-literal-strings.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-non-whitespace-characters.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-numbers-and-letters-of-the-alphabet.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-character-with-multiple-possibilities.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-characters-not-specified.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-whitespace.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/positive-and-negative-lookahead.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/remove-whitespace-from-start-and-end.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/restrict-possible-usernames.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/reuse-patterns-using-capture-groups.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-exact-number-of-matches.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-only-the-lower-number-of-matches.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-upper-and-lower-number-of-matches.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/use-capture-groups-to-search-and-replace.md
 create mode 100644 curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/using-the-test-method.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-custom-heading.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/delete-your-jquery-functions.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-state-to-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/access-props-using-this.props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/add-comments-in-jsx.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/add-event-listeners.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/add-inline-styles-in-react.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/bind-this-to-a-class-method.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/compose-react-components.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-complex-jsx-element.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-component-with-composition.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-form.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-input.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-react-component.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-simple-jsx-element.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateful-component.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateless-functional-component.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/define-an-html-class-in-jsx.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/introducing-inline-styles.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/override-default-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/pass-a-callback-as-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/pass-an-array-as-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-conditionally-from-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-html-elements-to-the-dom.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/render-with-an-if-else-condition.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/set-state-with-this.setstate.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-default-props.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-react-to-render-nested-components.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-state-to-toggle-an-element.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-react-component-from-scratch.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-simple-counter.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/combine-multiple-reducers.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/create-a-redux-store.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/define-a-redux-action.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/define-an-action-creator.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/dispatch-an-action-event.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/get-state-from-the-redux-store.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/handle-an-action-in-the-store.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/never-mutate-state.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/register-a-store-listener.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/remove-an-item-from-an-array.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/send-action-data-to-the-store.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/use-const-for-action-types.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/redux/write-a-counter-with-redux.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/nest-css-with-sass.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/store-data-with-sass-variables.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
 create mode 100644 curriculum/challenges/portuguese/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-001.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-002.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-003.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-004.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-005.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-006.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-007.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-008.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-009.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-010.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-011.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-012.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-013.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-014.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-015.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-016.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-017.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-018.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-019.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-020.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-021.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-022.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-023.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-024.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-025.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-026.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-027.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-028.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-029.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-030.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-031.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-032.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-033.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-034.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-035.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-036.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-037.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-038.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-039.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-040.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-041.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-042.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-043.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-044.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-045.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-046.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-047.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-048.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-049.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-050.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-051.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-052.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-053.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-054.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-055.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-056.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-057.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-058.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-059.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-060.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-061.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-062.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-063.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-064.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-065.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-066.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-067.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-068.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-069.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-070.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-071.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-072.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-073.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-074.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-075.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-076.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-077.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-078.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-079.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-080.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-081.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-082.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-083.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-084.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-085.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-086.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-087.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-088.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-089.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-090.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-091.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-092.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-093.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-094.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-095.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-096.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-097.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-098.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-099.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-100.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-101.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-102.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-103.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-104.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-105.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-106.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-107.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-108.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-109.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-110.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-111.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-112.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-113.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-114.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-115.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-116.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-117.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-118.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-119.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-120.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-121.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-122.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-123.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-124.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-125.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-126.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-127.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-128.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-129.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-130.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-131.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-132.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-133.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-134.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-135.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-136.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-137.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-138.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-139.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-140.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-141.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-142.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-143.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-144.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-145.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-146.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
 create mode 100644 curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
 create mode 100644 curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/announce-new-users.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/personal-library.md
 create mode 100644 curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-functions.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-lists.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-objects.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/reading-files.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
 create mode 100644 curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/basics-of-numpy.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/copying-arrays-warning.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initialize-array-problem.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initializing-different-arrays.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/mathematics.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/reorganizing-arrays.md
 create mode 100644 curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/what-is-numpy.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-projects/anonymous-message-board.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-projects/port-scanner.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-projects/sha-1-password-cracker.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-projects/stock-price-checker.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/introduction-and-setup.md
 create mode 100644 curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-bubble-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-insertion-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-merge-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-quick-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-selection-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/inventory-update.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/no-repeats-please.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/pairwise.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/breadth-first-search.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-hash-table.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-queue-class.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-set-class.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-stack-class.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/depth-first-search.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/incidence-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/typed-arrays.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-109-darts.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-165-intersections.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-232-the-race.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-243-resilience.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-244-sliders.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-250-250250.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-301-nim.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-369-badugi.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-452-long-products.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-96-su-doku.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/100-doors.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/24-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abc-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ackermann-function.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/align-columns.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-mode.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/babbage-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/combinations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-the-coins.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cramers-rule.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cusip.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-format.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-manipulation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deepcopy.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/department-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/discordian-date.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/dot-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/emirp-primes.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/entropy.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/euler-method.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-brain.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factorial.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/farey-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fractran.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gamma-function.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generator-exponential.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gray-code.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/happy-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-join.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iban.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/identity-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jaro-distance.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jortsort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/josephus-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/k-d-tree.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knights-tour.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/leap-year.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/left-factorials.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/letter-frequency.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/long-multiplication.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lzw-compression.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/s-expressions.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sedols.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/semiprime.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-consolidation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-1.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-256.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-stability.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/soundex.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stream-merge.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/subleq.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sudoku.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-to-100.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/topological-sort.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-frequency.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-wrap.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/y-combinator.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
 create mode 100644 curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/conclusion.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
 create mode 100644 curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
 create mode 100644 curriculum/challenges/portuguese/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/information-security-certificate/information-security-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/responsive-web-design-certificate/responsive-web-design-certificate.yml
 create mode 100644 curriculum/challenges/portuguese/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml

diff --git a/client/i18n/locales/italian/links.json b/client/i18n/locales/italian/links.json
new file mode 100644
index 0000000000..a3f22393f4
--- /dev/null
+++ b/client/i18n/locales/italian/links.json
@@ -0,0 +1,17 @@
+{
+  "help-translate-link-url": "https://contribute.freecodecamp.org/#/how-to-translate-files",
+  "footer": {
+    "about-url": "https://www.freecodecamp.org/news/about/",
+    "shop-url": "https://www.freecodecamp.org/shop/",
+    "support-url": "https://www.freecodecamp.org/news/support/",
+    "sponsors-url": "https://www.freecodecamp.org/news/sponsors/",
+    "honesty-url": "https://www.freecodecamp.org/news/academic-honesty-policy/",
+    "coc-url": "https://www.freecodecamp.org/news/code-of-conduct/",
+    "privacy-url": "https://www.freecodecamp.org/news/privacy-policy/",
+    "tos-url": "https://www.freecodecamp.org/news/terms-of-service/",
+    "copyright-url": "https://www.freecodecamp.org/news/copyright-policy/"
+  },
+  "donate": {
+    "other-ways-url": "https://www.freecodecamp.org/news/how-to-donate-to-free-code-camp"
+  }
+}
diff --git a/client/i18n/locales/italian/meta-tags.json b/client/i18n/locales/italian/meta-tags.json
new file mode 100644
index 0000000000..cf2020dbfb
--- /dev/null
+++ b/client/i18n/locales/italian/meta-tags.json
@@ -0,0 +1,32 @@
+{
+  "title": "Learn to Code — For Free — Coding Courses for Busy People",
+  "description": "Learn to Code — For Free",
+  "social-description": "Learn to Code — For Free",
+  "keywords": [
+    "python",
+    "javascript",
+    "js",
+    "git",
+    "github",
+    "website",
+    "web",
+    "development",
+    "free",
+    "code",
+    "camp",
+    "course",
+    "courses",
+    "html",
+    "css",
+    "react",
+    "redux",
+    "api",
+    "front",
+    "back",
+    "end",
+    "learn",
+    "tutorial",
+    "programming"
+  ],
+  "youre-unsubscribed": "You have been unsubscribed"
+}
diff --git a/client/i18n/locales/italian/motivation.json b/client/i18n/locales/italian/motivation.json
new file mode 100644
index 0000000000..d0cf5c66ae
--- /dev/null
+++ b/client/i18n/locales/italian/motivation.json
@@ -0,0 +1,819 @@
+{
+  "compliments": [
+    "Over the top!",
+    "Down the rabbit hole we go!",
+    "Bring that rain!",
+    "Target acquired.",
+    "Feel that need for speed!",
+    "You've got guts!",
+    "We have liftoff!",
+    "To infinity and beyond!",
+    "Encore!",
+    "Onward!",
+    "Challenge destroyed!",
+    "It's on like Donkey Kong!",
+    "Power level? It's over 9000!",
+    "Coding spree!",
+    "Code long and prosper.",
+    "The crowd goes wild!",
+    "One for the guinness book!",
+    "Flawless victory!",
+    "Most efficient!",
+    "You've got the touch!",
+    "You're on fire!",
+    "The town is now red!",
+    "To the nines!",
+    "To the Batmobile!",
+    "Pull out all the stops!",
+    "You're a wizard, Harry!",
+    "You're an all star!",
+    "Way to go!",
+    "Outta sight!",
+    "You're crushing it!",
+    "What sorcery is this?",
+    "The world rejoices!",
+    "That's the way it's done!",
+    "You rock!",
+    "Woo-hoo!",
+    "We knew you could do it!",
+    "Hyper Combo Finish!",
+    "Nothing but net!",
+    "Boom-shakalaka!",
+    "You're a shooting star!",
+    "You're unstoppable!",
+    "Way cool!",
+    "Walk on that sunshine!",
+    "Keep on trucking!",
+    "Off the charts!",
+    "There is no spoon!",
+    "Cranked it up to 11!",
+    "Escape velocity reached!",
+    "You make this look easy!",
+    "Passed with flying colors!",
+    "You've got this!",
+    "Happy, happy, joy, joy!",
+    "Tomorrow, the world!",
+    "Your powers combined!",
+    "It's alive. It's alive!",
+    "Sonic Boom!",
+    "Here's looking at you, Code!",
+    "Ride like the wind!",
+    "Legen - wait for it - dary!",
+    "Ludicrous Speed! Go!",
+    "Most triumphant!",
+    "One loop to rule them all!",
+    "By the power of Grayskull!",
+    "You did it!",
+    "Storm that castle!",
+    "Face-melting guitar solo!",
+    "Checkmate!",
+    "Bodacious!",
+    "Tubular!",
+    "You're outta sight!",
+    "Keep calm and code on!",
+    "Even sad panda smiles!",
+    "Even grumpy cat approves!",
+    "Kool Aid Man says oh yeah!",
+    "Bullseye!",
+    "Far out!",
+    "You're heating up!",
+    "Standing ovation!",
+    "Nice one!",
+    "All right!",
+    "Hasta la vista, challenge!",
+    "Terminated.",
+    "Off the hook!",
+    "Thundercats, Hooo!",
+    "Shiver me timbers!",
+    "Raise the roof!",
+    "Bingo!",
+    "Even honeybadger cares!",
+    "Helm, Warp Nine. Engage!",
+    "Gotta code 'em all!",
+    "Spool up the FTL drive!",
+    "Cool beans!",
+    "They're in another castle.",
+    "Power UP!",
+    "Pikachu chooses you!",
+    "I gotta have more cow bell.",
+    "Gotta go fast!",
+    "Yipee!",
+    "Cowabunga!",
+    "Moon Prism Power!",
+    "Plus Ultra!"
+  ],
+  "motivationalQuotes": [
+    {
+      "quote": "Whatever you are, be a good one.",
+      "author": "Abraham Lincoln"
+    },
+    {
+      "quote": "A change in perspective is worth 80 IQ points.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "The best way to predict the future is to invent it.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "The future is not laid out on a track. It is something that we can decide, and to the extent that we do not violate any known laws of the universe, we can probably make it work the way that we want to.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "We can only see a short distance ahead, but we can see plenty there that needs to be done.",
+      "author": "Alan Turing"
+    },
+    {
+      "quote": "In the depth of winter, I finally learned that within me there lay an invincible summer.",
+      "author": "Albert Camus"
+    },
+    {
+      "quote": "A person who never made a mistake never tried anything new.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Creativity is intelligence having fun.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "I have no special talents. I am only passionately curious.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Life is like riding a bicycle. To keep your balance, you must keep moving.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Make everything as simple as possible, but not simpler.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Never memorize something that you can look up.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Once we accept our limits, we go beyond them.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Play is the highest form of research.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "We cannot solve our problems with the same thinking we used when we created them.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Wisdom is not a product of schooling but of the lifelong attempt to acquire it.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Your imagination is your preview of life's coming attractions.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "There is only one corner of the universe you can be certain of improving, and that's your own self.",
+      "author": "Aldous Huxley"
+    },
+    {
+      "quote": "The most common way people give up their power is by thinking they don't have any.",
+      "author": "Alice Walker"
+    },
+    {
+      "quote": "Follow your inner moonlight. Don't hide the madness.",
+      "author": "Allen Ginsberg"
+    },
+    {
+      "quote": "The most difficult thing is the decision to act. The rest is merely tenacity.",
+      "author": "Amelia Earhart"
+    },
+    {
+      "quote": "Life shrinks or expands in proportion with one's courage.",
+      "author": "Anaïs Nin"
+    },
+    {
+      "quote": "Weeks of programming can save you hours of planning.",
+      "author": "Unknown"
+    },
+    {
+      "quote": "Quality is not an act, it is a habit.",
+      "author": "Aristotle"
+    },
+    {
+      "quote": "Start where you are. Use what you have. Do what you can.",
+      "author": "Arthur Ashe"
+    },
+    {
+      "quote": "Nothing is impossible, the word itself says \"I'm possible\"!",
+      "author": "Audrey Hepburn"
+    },
+    {
+      "quote": "Every strike brings me closer to the next home run.",
+      "author": "Babe Ruth"
+    },
+    {
+      "quote": "By failing to prepare, you are preparing to fail.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "Tell me and I forget.  Teach me and I remember.  Involve me and I learn.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "Well done is better than well said.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "There are no short cuts to any place worth going.",
+      "author": "Beverly Sills"
+    },
+    {
+      "quote": "Controlling complexity is the essence of computer programming.",
+      "author": "Brian Kernighan"
+    },
+    {
+      "quote": "I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.",
+      "author": "Bruce Lee"
+    },
+    {
+      "quote": "There are far, far better things ahead than any we leave behind.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "We are what we believe we are.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "With the possible exception of the equator, everything begins somewhere.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "You are never too old to set another goal, or to dream a new dream.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "Somewhere, something incredible is waiting to be known.",
+      "author": "Carl Sagan"
+    },
+    {
+      "quote": "If you're not making mistakes, then you're not making decisions.",
+      "author": "Catherine Cook"
+    },
+    {
+      "quote": "Find what you love and let it kill you.",
+      "author": "Charles Bukowski"
+    },
+    {
+      "quote": "What matters most is how well you walk through the fire.",
+      "author": "Charles Bukowski"
+    },
+    {
+      "quote": "It is not the strongest of the species that survive, nor the most intelligent, but the one most responsive to change.",
+      "author": "Charles Darwin"
+    },
+    {
+      "quote": "Life is 10% what happens to you and 90% how you react to it.",
+      "author": "Charles R. Swindoll"
+    },
+    {
+      "quote": "You will do foolish things, but do them with enthusiasm.",
+      "author": "Colette"
+    },
+    {
+      "quote": "It does not matter how slowly you go as long as you do not stop.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "Real knowledge is to know the extent of one's ignorance.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "The past cannot be changed. The future is yet in your power.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "Looking at code you wrote more than two weeks ago is like looking at code you are seeing for the first time.",
+      "author": "Dan Hurvitz"
+    },
+    {
+      "quote": "Someday is not a day of the week.",
+      "author": "Denise Brennan-Nelson"
+    },
+    {
+      "quote": "UNIX is simple.  It just takes a genius to understand its simplicity.",
+      "author": "Dennis Ritchie"
+    },
+    {
+      "quote": "Computers are good at following instructions, but not at reading your mind.",
+      "author": "Donald Knuth"
+    },
+    {
+      "quote": "A good programmer is someone who always looks both ways before crossing a one-way street.",
+      "author": "Doug Linder"
+    },
+    {
+      "quote": "Tough times never last, but tough people do.",
+      "author": "Dr. Robert Schuller"
+    },
+    {
+      "quote": "If things start happening, don't worry, don't stew, just go right along and you'll start happening too.",
+      "author": "Dr. Seuss"
+    },
+    {
+      "quote": "Do not go gentle into that good night. Rage, rage against the dying of the light.",
+      "author": "Dylan Thomas"
+    },
+    {
+      "quote": "The question of whether computers can think is like the question of whether submarines can swim.",
+      "author": "E.W. Dijkstra"
+    },
+    {
+      "quote": "Any code of your own that you haven't looked at for six or more months might as well have been written by someone else.",
+      "author": "Eagleson's Law"
+    },
+    {
+      "quote": "Do one thing every day that scares you.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "With the new day comes new strength and new thoughts.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "You must do the things you think you cannot do.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "Light tomorrow with today.",
+      "author": "Elizabeth Barrett Browning"
+    },
+    {
+      "quote": "Forever is composed of nows.",
+      "author": "Emily Dickinson"
+    },
+    {
+      "quote": "Computer science education cannot make anybody an expert programmer any more than studying brushes and pigment can make somebody an expert painter.",
+      "author": "Eric Raymond"
+    },
+    {
+      "quote": "If you don't risk anything, you risk even more.",
+      "author": "Erica Jong"
+    },
+    {
+      "quote": "The world breaks everyone, and afterward, many are strong at the broken places.",
+      "author": "Ernest Hemingway"
+    },
+    {
+      "quote": "There is nothing noble in being superior to your fellow man; true nobility is being superior to your former self.",
+      "author": "Ernest Hemingway"
+    },
+    {
+      "quote": "Never confuse a single defeat with a final defeat.",
+      "author": "F. Scott Fitzgerald"
+    },
+    {
+      "quote": "I attribute my success to this - I never gave or took any excuse.",
+      "author": "Florence Nightingale"
+    },
+    {
+      "quote": "The best revenge is massive success.",
+      "author": "Frank Sinatra"
+    },
+    {
+      "quote": "The only limit to our realization of tomorrow, will be our doubts of today.",
+      "author": "Franklin D. Roosevelt"
+    },
+    {
+      "quote": "Right or wrong, it's very pleasant to break something from time to time.",
+      "author": "Fyodor Dostoevsky"
+    },
+    {
+      "quote": "The harder I work, the luckier I get.",
+      "author": "Gary Player"
+    },
+    {
+      "quote": "Giving up is the only sure way to fail.",
+      "author": "Gena Showalter"
+    },
+    {
+      "quote": "The only truly secure system is one that is powered off, cast in a block of concrete and sealed in a lead-lined room with armed guards.",
+      "author": "Gene Spafford"
+    },
+    {
+      "quote": "A life spent making mistakes is not only more honorable, but more useful than a life spent doing nothing.",
+      "author": "George Bernard Shaw"
+    },
+    {
+      "quote": "First learn computer science and all the theory. Next develop a programming style. Then forget all that and just hack.",
+      "author": "George Carrette"
+    },
+    {
+      "quote": "Discovering the unexpected is more important than confirming the known.",
+      "author": "George Box"
+    },
+    {
+      "quote": "We only see what we know.",
+      "author": "Goethe"
+    },
+    {
+      "quote": "Without hard work, nothing grows but weeds.",
+      "author": "Gordon B. Hinckley"
+    },
+    {
+      "quote": "The function of good software is to make the complex appear to be simple.",
+      "author": "Grady Booch"
+    },
+    {
+      "quote": "When you know that you're capable of dealing with whatever comes, you have the only security the world has to offer.",
+      "author": "Harry Browne"
+    },
+    {
+      "quote": "Pain is inevitable. Suffering is optional.",
+      "author": "Haruki Murakami"
+    },
+    {
+      "quote": "Optimism is the faith that leads to achievement. Nothing can be done without hope and confidence.",
+      "author": "Helen Keller"
+    },
+    {
+      "quote": "The price of anything is the amount of life you exchange for it.",
+      "author": "Henry David Thoreau"
+    },
+    {
+      "quote": "Whether you think you can or think you can't, you're right.",
+      "author": "Henry Ford"
+    },
+    {
+      "quote": "The most exciting phrase to hear in science, the one that heralds discoveries, is not 'Eureka!' but 'Now that's funny…'",
+      "author": "Isaac Asimov"
+    },
+    {
+      "quote": "We are all failures. At least the best of us are.",
+      "author": "J.M. Barrie"
+    },
+    {
+      "quote": "You can't wait for inspiration. You have to go after it with a club.",
+      "author": "Jack London"
+    },
+    {
+      "quote": "Don't wish it were easier, wish you were better.",
+      "author": "Jim Rohn"
+    },
+    {
+      "quote": "By seeking and blundering we learn.",
+      "author": "Johann Wolfgang von Goethe"
+    },
+    {
+      "quote": "Knowing is not enough; we must apply. Wishing is not enough; we must do.",
+      "author": "Johann Wolfgang von Goethe"
+    },
+    {
+      "quote": "We first make our habits, then our habits make us.",
+      "author": "John Dryden"
+    },
+    {
+      "quote": "The power of imagination makes us infinite.",
+      "author": "John Muir"
+    },
+    {
+      "quote": "May you live every day of your life.",
+      "author": "Jonathan Swift"
+    },
+    {
+      "quote": "Perseverance is failing 19 times and succeeding the 20th.",
+      "author": "Julie Andrews"
+    },
+    {
+      "quote": "The work of today is the history of tomorrow, and we are its makers.",
+      "author": "Juliette Gordon Low"
+    },
+    {
+      "quote": "If you reveal your secrets to the wind, you should not blame the wind for revealing them to the trees.",
+      "author": "Kahlil Gibran"
+    },
+    {
+      "quote": "Optimism is an occupational hazard of programming; feedback is the treatment.",
+      "author": "Kent Beck"
+    },
+    {
+      "quote": "Opportunity does not knock, it presents itself when you beat down the door.",
+      "author": "Kyle Chandler"
+    },
+    {
+      "quote": "To iterate is human, to recurse divine.",
+      "author": "Peter Deutsch"
+    },
+    {
+      "quote": "A good traveler has no fixed plans and is not intent on arriving.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "An ant on the move does more than a dozing ox.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "Do the difficult things while they are easy and do the great things while they are small. A journey of a thousand miles must begin with a single step.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "That's the thing about people who think they hate computers. What they really hate is lousy programmers.",
+      "author": "Larry Niven"
+    },
+    {
+      "quote": "It had long since come to my attention that people of accomplishment rarely sat back and let things happen to them. They went out and happened to things.",
+      "author": "Leonardo da Vinci"
+    },
+    {
+      "quote": "If you're any good at all, you know you can be better.",
+      "author": "Lindsay Buckingham"
+    },
+    {
+      "quote": "If people never did silly things, nothing intelligent would ever get done.",
+      "author": "Ludwig Wittgenstein"
+    },
+    {
+      "quote": "You only live once, but if you do it right, once is enough.",
+      "author": "Mae West"
+    },
+    {
+      "quote": "Live as if you were to die tomorrow. Learn as if you were to live forever.",
+      "author": "Mahatma Gandhi"
+    },
+    {
+      "quote": "Strength does not come from physical capacity. It comes from an indomitable will.",
+      "author": "Mahatma Gandhi"
+    },
+    {
+      "quote": "One person's 'paranoia' is another person's 'engineering redundancy'.",
+      "author": "Marcus J. Ranum"
+    },
+    {
+      "quote": "Nothing in life is to be feared, it is only to be understood. Now is the time to understand more, so that we may fear less.",
+      "author": "Marie Curie"
+    },
+    {
+      "quote": "If you have everything under control, you're not moving fast enough.",
+      "author": "Mario Andretti"
+    },
+    {
+      "quote": "Education: the path from cocky ignorance to miserable uncertainty.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "It ain't what you don't know that gets you into trouble. It's what you know for sure that just ain't so.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "The secret of getting ahead is getting started.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "The two most important days in your life are the day you are born and the day you find out why.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "Twenty years from now you will be more disappointed by the things that you didn't do than by the ones you did do. So throw off the bowlines. Sail away from the safe harbor. Catch the trade winds in your sails.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "Any fool can write code that a computer can understand. Good programmers write code that humans can understand.",
+      "author": "Martin Fowler"
+    },
+    {
+      "quote": "I know, somehow, that only when it is dark enough can you see the stars.",
+      "author": "Martin Luther King Jr."
+    },
+    {
+      "quote": "It is never too late to be what you might have been.",
+      "author": "Mary Anne Evans"
+    },
+    {
+      "quote": "Nothing will work unless you do.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "We delight in the beauty of the butterfly, but rarely admit the changes it has gone through to achieve that beauty.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "We may encounter many defeats, but we must not be defeated.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "Everybody has talent, but ability takes hard work.",
+      "author": "Michael Jordan"
+    },
+    {
+      "quote": "I've missed more than 9,000 shots during my career. I've lost almost 300 games. 26 times, I've been trusted to take the game winning shot and missed. I've failed over and over and over again in my life. And that is why I succeed.",
+      "author": "Michael Jordan"
+    },
+    {
+      "quote": "Impossible is just a big word thrown around by small men who find it easier to live in the world they've been given than to explore the power they have to change it. Impossible is not a fact. It's an opinion. Impossible is not a declaration. It's a dare. Impossible is potential. Impossible is temporary. Impossible is nothing.",
+      "author": "Muhammad Ali"
+    },
+    {
+      "quote": "A winner is a dreamer who never gives up.",
+      "author": "Nelson Mandela"
+    },
+    {
+      "quote": "It always seems impossible until it's done.",
+      "author": "Nelson Mandela"
+    },
+    {
+      "quote": "Failure will never overtake me if my determination to succeed is strong enough.",
+      "author": "Og Mandino"
+    },
+    {
+      "quote": "I am not young enough to know everything.",
+      "author": "Oscar Wilde"
+    },
+    {
+      "quote": "There is only one thing that makes a dream impossible to achieve: the fear of failure.",
+      "author": "Paulo Coelho"
+    },
+    {
+      "quote": "Never go to bed mad. Stay up and fight.",
+      "author": "Phyllis Diller"
+    },
+    {
+      "quote": "You can't cross the sea merely by standing and staring at the water.",
+      "author": "Rabindranath Tagore"
+    },
+    {
+      "quote": "The only person you are destined to become is the person you decide to be.",
+      "author": "Ralph Waldo Emerson"
+    },
+    {
+      "quote": "What you do speaks so loudly that I cannot hear what you say.",
+      "author": "Ralph Waldo Emerson"
+    },
+    {
+      "quote": "People who are crazy enough to think they can change the world, are the ones who do.",
+      "author": "Rob Siltanen"
+    },
+    {
+      "quote": "The best way out is always through.",
+      "author": "Robert Frost"
+    },
+    {
+      "quote": "Today's accomplishments were yesterday's impossibilities.",
+      "author": "Robert H. Schuller"
+    },
+    {
+      "quote": "Don't be satisfied with stories, how things have gone with others. Unfold your own myth.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Forget safety. Live where you fear to live. Destroy your reputation. Be notorious.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Sell your cleverness and buy bewilderment.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "The cure for pain is in the pain.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Have no fear of perfection - you'll never reach it.",
+      "author": "Salvador Dalí"
+    },
+    {
+      "quote": "Don't watch the clock. Do what it does. Keep going.",
+      "author": "Sam Levenson"
+    },
+    {
+      "quote": "Ever Tried. Ever failed. No matter. Try again. Fail again. Fail better.",
+      "author": "Samuel Beckett"
+    },
+    {
+      "quote": "The more you know, the more you realize you know nothing.",
+      "author": "Socrates"
+    },
+    {
+      "quote": "The greatest enemy of knowledge is not ignorance, it is the illusion of knowledge.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "The universe doesn't allow perfection.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "Whether you want to uncover the secrets of the universe, or you want to pursue a career in the 21st century, basic computer programming is an essential skill to learn.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "The scariest moment is always just before you start.",
+      "author": "Stephen King"
+    },
+    {
+      "quote": "You can, you should, and if you're brave enough to start, you will.",
+      "author": "Stephen King"
+    },
+    {
+      "quote": "Arise, Awake and Stop not until the goal is reached.",
+      "author": "Swami Vivekananda"
+    },
+    {
+      "quote": "It is said that your life flashes before your eyes just before you die. That is true, it's called Life.",
+      "author": "Terry Pratchett"
+    },
+    {
+      "quote": "Believe you can and you're halfway there.",
+      "author": "Theodore Roosevelt"
+    },
+    {
+      "quote": "I have not failed. I've just found 10,000 ways that won't work.",
+      "author": "Thomas A. Edison"
+    },
+    {
+      "quote": "Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.",
+      "author": "Thomas A. Edison"
+    },
+    {
+      "quote": "The harder the conflict, the more glorious the triumph.",
+      "author": "Thomas Paine"
+    },
+    {
+      "quote": "The Web as I envisaged it, we have not seen it yet. The future is still so much bigger than the past.",
+      "author": "Tim Berners-Lee"
+    },
+    {
+      "quote": "Failure is the condiment that gives success its flavor.",
+      "author": "Truman Capote"
+    },
+    {
+      "quote": "Those who says it cannot be done should not interrupt the person doing it.",
+      "author": "Unknown"
+    },
+    {
+      "quote": "Even if you fall on your face, you're still moving forward.",
+      "author": "Victor Kiam"
+    },
+    {
+      "quote": "It's not whether you get knocked down, it's whether you get up.",
+      "author": "Vince Lombardi"
+    },
+    {
+      "quote": "I dream my painting and I paint my dream.",
+      "author": "Vincent van Gogh"
+    },
+    {
+      "quote": "Let us cultivate our garden.",
+      "author": "Voltaire"
+    },
+    {
+      "quote": "Aim for the moon. If you miss, you may hit a star.",
+      "author": "W. Clement Stone"
+    },
+    {
+      "quote": "The way to get started is to quit talking and begin doing.",
+      "author": "Walt Disney"
+    },
+    {
+      "quote": "You miss 100% of the shots you don't take.",
+      "author": "Wayne Gretzky"
+    },
+    {
+      "quote": "Don't let yesterday take up too much of today.",
+      "author": "Will Rogers"
+    },
+    {
+      "quote": "Even if you're on the right track, you'll get run over if you just sit there.",
+      "author": "Will Rogers"
+    },
+    {
+      "quote": "Do not wait to strike till the iron is hot; but make it hot by striking.",
+      "author": "William Butler Yeats"
+    },
+    {
+      "quote": "You cannot swim for new horizons until you have courage to lose sight of the shore.",
+      "author": "William Faulkner"
+    },
+    {
+      "quote": "Be not afraid of greatness. Some are born great, some achieve greatness, and others have greatness thrust upon them.",
+      "author": "William Shakespeare"
+    },
+    {
+      "quote": "We know what we are, but not what we may be.",
+      "author": "William Shakespeare"
+    },
+    {
+      "quote": "In theory there is no difference between theory and practice. In practice there is.",
+      "author": "Yogi Berra"
+    },
+    {
+      "quote": "You can see a lot by just looking.",
+      "author": "Yogi Berra"
+    },
+    {
+      "quote": "There is no elevator to success, you have to take the stairs.",
+      "author": "Zig Ziglar"
+    },
+    {
+      "quote": "You don't have to be great to start, but you have to start to be great.",
+      "author": "Zig Ziglar"
+    }
+  ]
+}
diff --git a/client/i18n/locales/italian/trending.json b/client/i18n/locales/italian/trending.json
new file mode 100644
index 0000000000..5997a20ec9
--- /dev/null
+++ b/client/i18n/locales/italian/trending.json
@@ -0,0 +1,62 @@
+{
+  "article0title":"10 to the Power of 0",
+  "article0link":"https://www.freecodecamp.org/news/10-to-the-power-of-0-the-zero-exponent-rule-and-the-power-of-zero-explained/",
+  "article1title":"Git Reset to Remote",
+  "article1link":"https://www.freecodecamp.org/news/git-reset-to-remote-head-how-to-reset-a-remote-branch-to-origin/",
+  "article2title":"R Value in Statistics",
+  "article2link":"https://www.freecodecamp.org/news/what-is-a-correlation-coefficient-r-value-in-statistics-explains/",
+  "article3title":"What is Economics?",
+  "article3link":"https://www.freecodecamp.org/news/what-is-economics/",
+  "article4title":"Module Exports",
+  "article4link":"https://www.freecodecamp.org/news/node-module-exports-explained-with-javascript-export-function-examples/",
+  "article5title":"Python VS JavaScript",
+  "article5link":"https://www.freecodecamp.org/news/python-vs-javascript-what-are-the-key-differences-between-the-two-popular-programming-languages/",
+  "article6title":"Model View Controller",
+  "article6link":"https://www.freecodecamp.org/news/model-view-architecture/",
+  "article7title":"React Testing Library",
+  "article7link":"https://www.freecodecamp.org/news/react-testing-library-tutorial-javascript-example-code/",
+  "article8title":"ASCII Table Chart",
+  "article8link":"https://www.freecodecamp.org/news/ascii-table-hex-to-ascii-value-character-code-chart-2/",
+  "article9title":"Data Validation",
+  "article9link":"https://www.freecodecamp.org/news/form-validation-with-html5-and-javascript/",
+  "article10title":"Recursion",
+  "article10link":"https://www.freecodecamp.org/news/what-is-recursion-in-javascript/",
+  "article11title":"ISO File",
+  "article11link":"https://www.freecodecamp.org/news/what-is-an-iso-file-explained-in-plain-english/",
+  "article12title":"ADB",
+  "article12link":"https://www.freecodecamp.org/news/adb-android-install-guide-drivers-and-commands/",
+  "article13title":"MBR VS GPT",
+  "article13link":"https://www.freecodecamp.org/news/mbr-vs-gpt-whats-the-difference-between-an-mbr-partition-and-a-gpt-partition-solved/",
+  "article14title":"Debounce",
+  "article14link":"https://www.freecodecamp.org/news/javascript-debounce-example/",
+  "article15title":"Helm Chart",
+  "article15link":"https://www.freecodecamp.org/news/what-is-a-helm-chart-tutorial-for-kubernetes-beginners/",
+  "article16title":"80-20 Rule",
+  "article16link":"https://www.freecodecamp.org/news/the-80-20-rule-pareto-principle-explained-in-plain-english/",
+  "article17title":"OSI Model",
+  "article17link":"https://www.freecodecamp.org/news/osi-model-networking-layers-explained-in-plain-english/",
+  "article18title":"HTML Link Code",
+  "article18link":"https://www.freecodecamp.org/news/html-link-code-how-to-insert-a-link-to-a-website-with-href-3/",
+  "article19title":"SDLC",
+  "article19link":"https://www.freecodecamp.org/news/what-is-sdlc-software-development-life-cycle-phases-methodologies-and-processes-explained/",
+  "article20title":"Inductive VS Deductive",
+  "article20link":"https://www.freecodecamp.org/news/inductive-vs-deductive-reasoning/",
+  "article21title":"JavaScript Empty Array",
+  "article21link":"https://www.freecodecamp.org/news/check-if-javascript-array-is-empty-or-not-with-length/",
+  "article22title":"Best Instagram Post Time",
+  "article22link":"https://www.freecodecamp.org/news/the-best-time-to-post-on-instagram-the-best-days-and-times-to-reach-your-ig-followers/",
+  "article23title":"Garbage Collection in Java",
+  "article23link":"https://www.freecodecamp.org/news/garbage-collection-in-java-what-is-gc-and-how-it-works-in-the-jvm/",
+  "article24title":"Auto-Numbering in Excel",
+  "article24link":"https://www.freecodecamp.org/news/auto-numbering-in-excel/",
+  "article25title":"JavaScript Keycode List",
+  "article25link":"https://www.freecodecamp.org/news/javascript-keycode-list-keypress-event-key-codes/",
+  "article26title":"JavaScript Reverse Array",
+  "article26link":"https://www.freecodecamp.org/news/javascript-array-reverse-tutorial-with-example-js-code/",
+  "article27title":"How to Screenshot on Mac",
+  "article27link":"https://www.freecodecamp.org/news/how-to-take-a-screenshot-on-a-mac-keyboard-shortcut/",
+  "article28title":"How to Reverse Image Search",
+  "article28link":"https://www.freecodecamp.org/news/how-to-reverse-image-search-on-your-phone-or-desktop/",
+  "article29title":"Ternary Operator JavaScript",
+  "article29link":"https://www.freecodecamp.org/news/ternary-operator-javascript-if-statement-tutorial/"
+}
diff --git a/client/i18n/locales/portuguese/links.json b/client/i18n/locales/portuguese/links.json
new file mode 100644
index 0000000000..a3f22393f4
--- /dev/null
+++ b/client/i18n/locales/portuguese/links.json
@@ -0,0 +1,17 @@
+{
+  "help-translate-link-url": "https://contribute.freecodecamp.org/#/how-to-translate-files",
+  "footer": {
+    "about-url": "https://www.freecodecamp.org/news/about/",
+    "shop-url": "https://www.freecodecamp.org/shop/",
+    "support-url": "https://www.freecodecamp.org/news/support/",
+    "sponsors-url": "https://www.freecodecamp.org/news/sponsors/",
+    "honesty-url": "https://www.freecodecamp.org/news/academic-honesty-policy/",
+    "coc-url": "https://www.freecodecamp.org/news/code-of-conduct/",
+    "privacy-url": "https://www.freecodecamp.org/news/privacy-policy/",
+    "tos-url": "https://www.freecodecamp.org/news/terms-of-service/",
+    "copyright-url": "https://www.freecodecamp.org/news/copyright-policy/"
+  },
+  "donate": {
+    "other-ways-url": "https://www.freecodecamp.org/news/how-to-donate-to-free-code-camp"
+  }
+}
diff --git a/client/i18n/locales/portuguese/meta-tags.json b/client/i18n/locales/portuguese/meta-tags.json
new file mode 100644
index 0000000000..cf2020dbfb
--- /dev/null
+++ b/client/i18n/locales/portuguese/meta-tags.json
@@ -0,0 +1,32 @@
+{
+  "title": "Learn to Code — For Free — Coding Courses for Busy People",
+  "description": "Learn to Code — For Free",
+  "social-description": "Learn to Code — For Free",
+  "keywords": [
+    "python",
+    "javascript",
+    "js",
+    "git",
+    "github",
+    "website",
+    "web",
+    "development",
+    "free",
+    "code",
+    "camp",
+    "course",
+    "courses",
+    "html",
+    "css",
+    "react",
+    "redux",
+    "api",
+    "front",
+    "back",
+    "end",
+    "learn",
+    "tutorial",
+    "programming"
+  ],
+  "youre-unsubscribed": "You have been unsubscribed"
+}
diff --git a/client/i18n/locales/portuguese/motivation.json b/client/i18n/locales/portuguese/motivation.json
new file mode 100644
index 0000000000..d0cf5c66ae
--- /dev/null
+++ b/client/i18n/locales/portuguese/motivation.json
@@ -0,0 +1,819 @@
+{
+  "compliments": [
+    "Over the top!",
+    "Down the rabbit hole we go!",
+    "Bring that rain!",
+    "Target acquired.",
+    "Feel that need for speed!",
+    "You've got guts!",
+    "We have liftoff!",
+    "To infinity and beyond!",
+    "Encore!",
+    "Onward!",
+    "Challenge destroyed!",
+    "It's on like Donkey Kong!",
+    "Power level? It's over 9000!",
+    "Coding spree!",
+    "Code long and prosper.",
+    "The crowd goes wild!",
+    "One for the guinness book!",
+    "Flawless victory!",
+    "Most efficient!",
+    "You've got the touch!",
+    "You're on fire!",
+    "The town is now red!",
+    "To the nines!",
+    "To the Batmobile!",
+    "Pull out all the stops!",
+    "You're a wizard, Harry!",
+    "You're an all star!",
+    "Way to go!",
+    "Outta sight!",
+    "You're crushing it!",
+    "What sorcery is this?",
+    "The world rejoices!",
+    "That's the way it's done!",
+    "You rock!",
+    "Woo-hoo!",
+    "We knew you could do it!",
+    "Hyper Combo Finish!",
+    "Nothing but net!",
+    "Boom-shakalaka!",
+    "You're a shooting star!",
+    "You're unstoppable!",
+    "Way cool!",
+    "Walk on that sunshine!",
+    "Keep on trucking!",
+    "Off the charts!",
+    "There is no spoon!",
+    "Cranked it up to 11!",
+    "Escape velocity reached!",
+    "You make this look easy!",
+    "Passed with flying colors!",
+    "You've got this!",
+    "Happy, happy, joy, joy!",
+    "Tomorrow, the world!",
+    "Your powers combined!",
+    "It's alive. It's alive!",
+    "Sonic Boom!",
+    "Here's looking at you, Code!",
+    "Ride like the wind!",
+    "Legen - wait for it - dary!",
+    "Ludicrous Speed! Go!",
+    "Most triumphant!",
+    "One loop to rule them all!",
+    "By the power of Grayskull!",
+    "You did it!",
+    "Storm that castle!",
+    "Face-melting guitar solo!",
+    "Checkmate!",
+    "Bodacious!",
+    "Tubular!",
+    "You're outta sight!",
+    "Keep calm and code on!",
+    "Even sad panda smiles!",
+    "Even grumpy cat approves!",
+    "Kool Aid Man says oh yeah!",
+    "Bullseye!",
+    "Far out!",
+    "You're heating up!",
+    "Standing ovation!",
+    "Nice one!",
+    "All right!",
+    "Hasta la vista, challenge!",
+    "Terminated.",
+    "Off the hook!",
+    "Thundercats, Hooo!",
+    "Shiver me timbers!",
+    "Raise the roof!",
+    "Bingo!",
+    "Even honeybadger cares!",
+    "Helm, Warp Nine. Engage!",
+    "Gotta code 'em all!",
+    "Spool up the FTL drive!",
+    "Cool beans!",
+    "They're in another castle.",
+    "Power UP!",
+    "Pikachu chooses you!",
+    "I gotta have more cow bell.",
+    "Gotta go fast!",
+    "Yipee!",
+    "Cowabunga!",
+    "Moon Prism Power!",
+    "Plus Ultra!"
+  ],
+  "motivationalQuotes": [
+    {
+      "quote": "Whatever you are, be a good one.",
+      "author": "Abraham Lincoln"
+    },
+    {
+      "quote": "A change in perspective is worth 80 IQ points.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "The best way to predict the future is to invent it.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "The future is not laid out on a track. It is something that we can decide, and to the extent that we do not violate any known laws of the universe, we can probably make it work the way that we want to.",
+      "author": "Alan Kay"
+    },
+    {
+      "quote": "We can only see a short distance ahead, but we can see plenty there that needs to be done.",
+      "author": "Alan Turing"
+    },
+    {
+      "quote": "In the depth of winter, I finally learned that within me there lay an invincible summer.",
+      "author": "Albert Camus"
+    },
+    {
+      "quote": "A person who never made a mistake never tried anything new.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Creativity is intelligence having fun.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "I have no special talents. I am only passionately curious.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Life is like riding a bicycle. To keep your balance, you must keep moving.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Make everything as simple as possible, but not simpler.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Never memorize something that you can look up.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Once we accept our limits, we go beyond them.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Play is the highest form of research.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "We cannot solve our problems with the same thinking we used when we created them.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Wisdom is not a product of schooling but of the lifelong attempt to acquire it.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "Your imagination is your preview of life's coming attractions.",
+      "author": "Albert Einstein"
+    },
+    {
+      "quote": "There is only one corner of the universe you can be certain of improving, and that's your own self.",
+      "author": "Aldous Huxley"
+    },
+    {
+      "quote": "The most common way people give up their power is by thinking they don't have any.",
+      "author": "Alice Walker"
+    },
+    {
+      "quote": "Follow your inner moonlight. Don't hide the madness.",
+      "author": "Allen Ginsberg"
+    },
+    {
+      "quote": "The most difficult thing is the decision to act. The rest is merely tenacity.",
+      "author": "Amelia Earhart"
+    },
+    {
+      "quote": "Life shrinks or expands in proportion with one's courage.",
+      "author": "Anaïs Nin"
+    },
+    {
+      "quote": "Weeks of programming can save you hours of planning.",
+      "author": "Unknown"
+    },
+    {
+      "quote": "Quality is not an act, it is a habit.",
+      "author": "Aristotle"
+    },
+    {
+      "quote": "Start where you are. Use what you have. Do what you can.",
+      "author": "Arthur Ashe"
+    },
+    {
+      "quote": "Nothing is impossible, the word itself says \"I'm possible\"!",
+      "author": "Audrey Hepburn"
+    },
+    {
+      "quote": "Every strike brings me closer to the next home run.",
+      "author": "Babe Ruth"
+    },
+    {
+      "quote": "By failing to prepare, you are preparing to fail.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "Tell me and I forget.  Teach me and I remember.  Involve me and I learn.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "Well done is better than well said.",
+      "author": "Benjamin Franklin"
+    },
+    {
+      "quote": "There are no short cuts to any place worth going.",
+      "author": "Beverly Sills"
+    },
+    {
+      "quote": "Controlling complexity is the essence of computer programming.",
+      "author": "Brian Kernighan"
+    },
+    {
+      "quote": "I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.",
+      "author": "Bruce Lee"
+    },
+    {
+      "quote": "There are far, far better things ahead than any we leave behind.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "We are what we believe we are.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "With the possible exception of the equator, everything begins somewhere.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "You are never too old to set another goal, or to dream a new dream.",
+      "author": "C.S. Lewis"
+    },
+    {
+      "quote": "Somewhere, something incredible is waiting to be known.",
+      "author": "Carl Sagan"
+    },
+    {
+      "quote": "If you're not making mistakes, then you're not making decisions.",
+      "author": "Catherine Cook"
+    },
+    {
+      "quote": "Find what you love and let it kill you.",
+      "author": "Charles Bukowski"
+    },
+    {
+      "quote": "What matters most is how well you walk through the fire.",
+      "author": "Charles Bukowski"
+    },
+    {
+      "quote": "It is not the strongest of the species that survive, nor the most intelligent, but the one most responsive to change.",
+      "author": "Charles Darwin"
+    },
+    {
+      "quote": "Life is 10% what happens to you and 90% how you react to it.",
+      "author": "Charles R. Swindoll"
+    },
+    {
+      "quote": "You will do foolish things, but do them with enthusiasm.",
+      "author": "Colette"
+    },
+    {
+      "quote": "It does not matter how slowly you go as long as you do not stop.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "Real knowledge is to know the extent of one's ignorance.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "The past cannot be changed. The future is yet in your power.",
+      "author": "Confucius"
+    },
+    {
+      "quote": "Looking at code you wrote more than two weeks ago is like looking at code you are seeing for the first time.",
+      "author": "Dan Hurvitz"
+    },
+    {
+      "quote": "Someday is not a day of the week.",
+      "author": "Denise Brennan-Nelson"
+    },
+    {
+      "quote": "UNIX is simple.  It just takes a genius to understand its simplicity.",
+      "author": "Dennis Ritchie"
+    },
+    {
+      "quote": "Computers are good at following instructions, but not at reading your mind.",
+      "author": "Donald Knuth"
+    },
+    {
+      "quote": "A good programmer is someone who always looks both ways before crossing a one-way street.",
+      "author": "Doug Linder"
+    },
+    {
+      "quote": "Tough times never last, but tough people do.",
+      "author": "Dr. Robert Schuller"
+    },
+    {
+      "quote": "If things start happening, don't worry, don't stew, just go right along and you'll start happening too.",
+      "author": "Dr. Seuss"
+    },
+    {
+      "quote": "Do not go gentle into that good night. Rage, rage against the dying of the light.",
+      "author": "Dylan Thomas"
+    },
+    {
+      "quote": "The question of whether computers can think is like the question of whether submarines can swim.",
+      "author": "E.W. Dijkstra"
+    },
+    {
+      "quote": "Any code of your own that you haven't looked at for six or more months might as well have been written by someone else.",
+      "author": "Eagleson's Law"
+    },
+    {
+      "quote": "Do one thing every day that scares you.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "With the new day comes new strength and new thoughts.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "You must do the things you think you cannot do.",
+      "author": "Eleanor Roosevelt"
+    },
+    {
+      "quote": "Light tomorrow with today.",
+      "author": "Elizabeth Barrett Browning"
+    },
+    {
+      "quote": "Forever is composed of nows.",
+      "author": "Emily Dickinson"
+    },
+    {
+      "quote": "Computer science education cannot make anybody an expert programmer any more than studying brushes and pigment can make somebody an expert painter.",
+      "author": "Eric Raymond"
+    },
+    {
+      "quote": "If you don't risk anything, you risk even more.",
+      "author": "Erica Jong"
+    },
+    {
+      "quote": "The world breaks everyone, and afterward, many are strong at the broken places.",
+      "author": "Ernest Hemingway"
+    },
+    {
+      "quote": "There is nothing noble in being superior to your fellow man; true nobility is being superior to your former self.",
+      "author": "Ernest Hemingway"
+    },
+    {
+      "quote": "Never confuse a single defeat with a final defeat.",
+      "author": "F. Scott Fitzgerald"
+    },
+    {
+      "quote": "I attribute my success to this - I never gave or took any excuse.",
+      "author": "Florence Nightingale"
+    },
+    {
+      "quote": "The best revenge is massive success.",
+      "author": "Frank Sinatra"
+    },
+    {
+      "quote": "The only limit to our realization of tomorrow, will be our doubts of today.",
+      "author": "Franklin D. Roosevelt"
+    },
+    {
+      "quote": "Right or wrong, it's very pleasant to break something from time to time.",
+      "author": "Fyodor Dostoevsky"
+    },
+    {
+      "quote": "The harder I work, the luckier I get.",
+      "author": "Gary Player"
+    },
+    {
+      "quote": "Giving up is the only sure way to fail.",
+      "author": "Gena Showalter"
+    },
+    {
+      "quote": "The only truly secure system is one that is powered off, cast in a block of concrete and sealed in a lead-lined room with armed guards.",
+      "author": "Gene Spafford"
+    },
+    {
+      "quote": "A life spent making mistakes is not only more honorable, but more useful than a life spent doing nothing.",
+      "author": "George Bernard Shaw"
+    },
+    {
+      "quote": "First learn computer science and all the theory. Next develop a programming style. Then forget all that and just hack.",
+      "author": "George Carrette"
+    },
+    {
+      "quote": "Discovering the unexpected is more important than confirming the known.",
+      "author": "George Box"
+    },
+    {
+      "quote": "We only see what we know.",
+      "author": "Goethe"
+    },
+    {
+      "quote": "Without hard work, nothing grows but weeds.",
+      "author": "Gordon B. Hinckley"
+    },
+    {
+      "quote": "The function of good software is to make the complex appear to be simple.",
+      "author": "Grady Booch"
+    },
+    {
+      "quote": "When you know that you're capable of dealing with whatever comes, you have the only security the world has to offer.",
+      "author": "Harry Browne"
+    },
+    {
+      "quote": "Pain is inevitable. Suffering is optional.",
+      "author": "Haruki Murakami"
+    },
+    {
+      "quote": "Optimism is the faith that leads to achievement. Nothing can be done without hope and confidence.",
+      "author": "Helen Keller"
+    },
+    {
+      "quote": "The price of anything is the amount of life you exchange for it.",
+      "author": "Henry David Thoreau"
+    },
+    {
+      "quote": "Whether you think you can or think you can't, you're right.",
+      "author": "Henry Ford"
+    },
+    {
+      "quote": "The most exciting phrase to hear in science, the one that heralds discoveries, is not 'Eureka!' but 'Now that's funny…'",
+      "author": "Isaac Asimov"
+    },
+    {
+      "quote": "We are all failures. At least the best of us are.",
+      "author": "J.M. Barrie"
+    },
+    {
+      "quote": "You can't wait for inspiration. You have to go after it with a club.",
+      "author": "Jack London"
+    },
+    {
+      "quote": "Don't wish it were easier, wish you were better.",
+      "author": "Jim Rohn"
+    },
+    {
+      "quote": "By seeking and blundering we learn.",
+      "author": "Johann Wolfgang von Goethe"
+    },
+    {
+      "quote": "Knowing is not enough; we must apply. Wishing is not enough; we must do.",
+      "author": "Johann Wolfgang von Goethe"
+    },
+    {
+      "quote": "We first make our habits, then our habits make us.",
+      "author": "John Dryden"
+    },
+    {
+      "quote": "The power of imagination makes us infinite.",
+      "author": "John Muir"
+    },
+    {
+      "quote": "May you live every day of your life.",
+      "author": "Jonathan Swift"
+    },
+    {
+      "quote": "Perseverance is failing 19 times and succeeding the 20th.",
+      "author": "Julie Andrews"
+    },
+    {
+      "quote": "The work of today is the history of tomorrow, and we are its makers.",
+      "author": "Juliette Gordon Low"
+    },
+    {
+      "quote": "If you reveal your secrets to the wind, you should not blame the wind for revealing them to the trees.",
+      "author": "Kahlil Gibran"
+    },
+    {
+      "quote": "Optimism is an occupational hazard of programming; feedback is the treatment.",
+      "author": "Kent Beck"
+    },
+    {
+      "quote": "Opportunity does not knock, it presents itself when you beat down the door.",
+      "author": "Kyle Chandler"
+    },
+    {
+      "quote": "To iterate is human, to recurse divine.",
+      "author": "Peter Deutsch"
+    },
+    {
+      "quote": "A good traveler has no fixed plans and is not intent on arriving.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "An ant on the move does more than a dozing ox.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "Do the difficult things while they are easy and do the great things while they are small. A journey of a thousand miles must begin with a single step.",
+      "author": "Lao Tzu"
+    },
+    {
+      "quote": "That's the thing about people who think they hate computers. What they really hate is lousy programmers.",
+      "author": "Larry Niven"
+    },
+    {
+      "quote": "It had long since come to my attention that people of accomplishment rarely sat back and let things happen to them. They went out and happened to things.",
+      "author": "Leonardo da Vinci"
+    },
+    {
+      "quote": "If you're any good at all, you know you can be better.",
+      "author": "Lindsay Buckingham"
+    },
+    {
+      "quote": "If people never did silly things, nothing intelligent would ever get done.",
+      "author": "Ludwig Wittgenstein"
+    },
+    {
+      "quote": "You only live once, but if you do it right, once is enough.",
+      "author": "Mae West"
+    },
+    {
+      "quote": "Live as if you were to die tomorrow. Learn as if you were to live forever.",
+      "author": "Mahatma Gandhi"
+    },
+    {
+      "quote": "Strength does not come from physical capacity. It comes from an indomitable will.",
+      "author": "Mahatma Gandhi"
+    },
+    {
+      "quote": "One person's 'paranoia' is another person's 'engineering redundancy'.",
+      "author": "Marcus J. Ranum"
+    },
+    {
+      "quote": "Nothing in life is to be feared, it is only to be understood. Now is the time to understand more, so that we may fear less.",
+      "author": "Marie Curie"
+    },
+    {
+      "quote": "If you have everything under control, you're not moving fast enough.",
+      "author": "Mario Andretti"
+    },
+    {
+      "quote": "Education: the path from cocky ignorance to miserable uncertainty.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "It ain't what you don't know that gets you into trouble. It's what you know for sure that just ain't so.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "The secret of getting ahead is getting started.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "The two most important days in your life are the day you are born and the day you find out why.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "Twenty years from now you will be more disappointed by the things that you didn't do than by the ones you did do. So throw off the bowlines. Sail away from the safe harbor. Catch the trade winds in your sails.",
+      "author": "Mark Twain"
+    },
+    {
+      "quote": "Any fool can write code that a computer can understand. Good programmers write code that humans can understand.",
+      "author": "Martin Fowler"
+    },
+    {
+      "quote": "I know, somehow, that only when it is dark enough can you see the stars.",
+      "author": "Martin Luther King Jr."
+    },
+    {
+      "quote": "It is never too late to be what you might have been.",
+      "author": "Mary Anne Evans"
+    },
+    {
+      "quote": "Nothing will work unless you do.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "We delight in the beauty of the butterfly, but rarely admit the changes it has gone through to achieve that beauty.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "We may encounter many defeats, but we must not be defeated.",
+      "author": "Maya Angelou"
+    },
+    {
+      "quote": "Everybody has talent, but ability takes hard work.",
+      "author": "Michael Jordan"
+    },
+    {
+      "quote": "I've missed more than 9,000 shots during my career. I've lost almost 300 games. 26 times, I've been trusted to take the game winning shot and missed. I've failed over and over and over again in my life. And that is why I succeed.",
+      "author": "Michael Jordan"
+    },
+    {
+      "quote": "Impossible is just a big word thrown around by small men who find it easier to live in the world they've been given than to explore the power they have to change it. Impossible is not a fact. It's an opinion. Impossible is not a declaration. It's a dare. Impossible is potential. Impossible is temporary. Impossible is nothing.",
+      "author": "Muhammad Ali"
+    },
+    {
+      "quote": "A winner is a dreamer who never gives up.",
+      "author": "Nelson Mandela"
+    },
+    {
+      "quote": "It always seems impossible until it's done.",
+      "author": "Nelson Mandela"
+    },
+    {
+      "quote": "Failure will never overtake me if my determination to succeed is strong enough.",
+      "author": "Og Mandino"
+    },
+    {
+      "quote": "I am not young enough to know everything.",
+      "author": "Oscar Wilde"
+    },
+    {
+      "quote": "There is only one thing that makes a dream impossible to achieve: the fear of failure.",
+      "author": "Paulo Coelho"
+    },
+    {
+      "quote": "Never go to bed mad. Stay up and fight.",
+      "author": "Phyllis Diller"
+    },
+    {
+      "quote": "You can't cross the sea merely by standing and staring at the water.",
+      "author": "Rabindranath Tagore"
+    },
+    {
+      "quote": "The only person you are destined to become is the person you decide to be.",
+      "author": "Ralph Waldo Emerson"
+    },
+    {
+      "quote": "What you do speaks so loudly that I cannot hear what you say.",
+      "author": "Ralph Waldo Emerson"
+    },
+    {
+      "quote": "People who are crazy enough to think they can change the world, are the ones who do.",
+      "author": "Rob Siltanen"
+    },
+    {
+      "quote": "The best way out is always through.",
+      "author": "Robert Frost"
+    },
+    {
+      "quote": "Today's accomplishments were yesterday's impossibilities.",
+      "author": "Robert H. Schuller"
+    },
+    {
+      "quote": "Don't be satisfied with stories, how things have gone with others. Unfold your own myth.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Forget safety. Live where you fear to live. Destroy your reputation. Be notorious.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Sell your cleverness and buy bewilderment.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "The cure for pain is in the pain.",
+      "author": "Rumi"
+    },
+    {
+      "quote": "Have no fear of perfection - you'll never reach it.",
+      "author": "Salvador Dalí"
+    },
+    {
+      "quote": "Don't watch the clock. Do what it does. Keep going.",
+      "author": "Sam Levenson"
+    },
+    {
+      "quote": "Ever Tried. Ever failed. No matter. Try again. Fail again. Fail better.",
+      "author": "Samuel Beckett"
+    },
+    {
+      "quote": "The more you know, the more you realize you know nothing.",
+      "author": "Socrates"
+    },
+    {
+      "quote": "The greatest enemy of knowledge is not ignorance, it is the illusion of knowledge.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "The universe doesn't allow perfection.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "Whether you want to uncover the secrets of the universe, or you want to pursue a career in the 21st century, basic computer programming is an essential skill to learn.",
+      "author": "Stephen Hawking"
+    },
+    {
+      "quote": "The scariest moment is always just before you start.",
+      "author": "Stephen King"
+    },
+    {
+      "quote": "You can, you should, and if you're brave enough to start, you will.",
+      "author": "Stephen King"
+    },
+    {
+      "quote": "Arise, Awake and Stop not until the goal is reached.",
+      "author": "Swami Vivekananda"
+    },
+    {
+      "quote": "It is said that your life flashes before your eyes just before you die. That is true, it's called Life.",
+      "author": "Terry Pratchett"
+    },
+    {
+      "quote": "Believe you can and you're halfway there.",
+      "author": "Theodore Roosevelt"
+    },
+    {
+      "quote": "I have not failed. I've just found 10,000 ways that won't work.",
+      "author": "Thomas A. Edison"
+    },
+    {
+      "quote": "Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.",
+      "author": "Thomas A. Edison"
+    },
+    {
+      "quote": "The harder the conflict, the more glorious the triumph.",
+      "author": "Thomas Paine"
+    },
+    {
+      "quote": "The Web as I envisaged it, we have not seen it yet. The future is still so much bigger than the past.",
+      "author": "Tim Berners-Lee"
+    },
+    {
+      "quote": "Failure is the condiment that gives success its flavor.",
+      "author": "Truman Capote"
+    },
+    {
+      "quote": "Those who says it cannot be done should not interrupt the person doing it.",
+      "author": "Unknown"
+    },
+    {
+      "quote": "Even if you fall on your face, you're still moving forward.",
+      "author": "Victor Kiam"
+    },
+    {
+      "quote": "It's not whether you get knocked down, it's whether you get up.",
+      "author": "Vince Lombardi"
+    },
+    {
+      "quote": "I dream my painting and I paint my dream.",
+      "author": "Vincent van Gogh"
+    },
+    {
+      "quote": "Let us cultivate our garden.",
+      "author": "Voltaire"
+    },
+    {
+      "quote": "Aim for the moon. If you miss, you may hit a star.",
+      "author": "W. Clement Stone"
+    },
+    {
+      "quote": "The way to get started is to quit talking and begin doing.",
+      "author": "Walt Disney"
+    },
+    {
+      "quote": "You miss 100% of the shots you don't take.",
+      "author": "Wayne Gretzky"
+    },
+    {
+      "quote": "Don't let yesterday take up too much of today.",
+      "author": "Will Rogers"
+    },
+    {
+      "quote": "Even if you're on the right track, you'll get run over if you just sit there.",
+      "author": "Will Rogers"
+    },
+    {
+      "quote": "Do not wait to strike till the iron is hot; but make it hot by striking.",
+      "author": "William Butler Yeats"
+    },
+    {
+      "quote": "You cannot swim for new horizons until you have courage to lose sight of the shore.",
+      "author": "William Faulkner"
+    },
+    {
+      "quote": "Be not afraid of greatness. Some are born great, some achieve greatness, and others have greatness thrust upon them.",
+      "author": "William Shakespeare"
+    },
+    {
+      "quote": "We know what we are, but not what we may be.",
+      "author": "William Shakespeare"
+    },
+    {
+      "quote": "In theory there is no difference between theory and practice. In practice there is.",
+      "author": "Yogi Berra"
+    },
+    {
+      "quote": "You can see a lot by just looking.",
+      "author": "Yogi Berra"
+    },
+    {
+      "quote": "There is no elevator to success, you have to take the stairs.",
+      "author": "Zig Ziglar"
+    },
+    {
+      "quote": "You don't have to be great to start, but you have to start to be great.",
+      "author": "Zig Ziglar"
+    }
+  ]
+}
diff --git a/client/i18n/locales/portuguese/trending.json b/client/i18n/locales/portuguese/trending.json
new file mode 100644
index 0000000000..5997a20ec9
--- /dev/null
+++ b/client/i18n/locales/portuguese/trending.json
@@ -0,0 +1,62 @@
+{
+  "article0title":"10 to the Power of 0",
+  "article0link":"https://www.freecodecamp.org/news/10-to-the-power-of-0-the-zero-exponent-rule-and-the-power-of-zero-explained/",
+  "article1title":"Git Reset to Remote",
+  "article1link":"https://www.freecodecamp.org/news/git-reset-to-remote-head-how-to-reset-a-remote-branch-to-origin/",
+  "article2title":"R Value in Statistics",
+  "article2link":"https://www.freecodecamp.org/news/what-is-a-correlation-coefficient-r-value-in-statistics-explains/",
+  "article3title":"What is Economics?",
+  "article3link":"https://www.freecodecamp.org/news/what-is-economics/",
+  "article4title":"Module Exports",
+  "article4link":"https://www.freecodecamp.org/news/node-module-exports-explained-with-javascript-export-function-examples/",
+  "article5title":"Python VS JavaScript",
+  "article5link":"https://www.freecodecamp.org/news/python-vs-javascript-what-are-the-key-differences-between-the-two-popular-programming-languages/",
+  "article6title":"Model View Controller",
+  "article6link":"https://www.freecodecamp.org/news/model-view-architecture/",
+  "article7title":"React Testing Library",
+  "article7link":"https://www.freecodecamp.org/news/react-testing-library-tutorial-javascript-example-code/",
+  "article8title":"ASCII Table Chart",
+  "article8link":"https://www.freecodecamp.org/news/ascii-table-hex-to-ascii-value-character-code-chart-2/",
+  "article9title":"Data Validation",
+  "article9link":"https://www.freecodecamp.org/news/form-validation-with-html5-and-javascript/",
+  "article10title":"Recursion",
+  "article10link":"https://www.freecodecamp.org/news/what-is-recursion-in-javascript/",
+  "article11title":"ISO File",
+  "article11link":"https://www.freecodecamp.org/news/what-is-an-iso-file-explained-in-plain-english/",
+  "article12title":"ADB",
+  "article12link":"https://www.freecodecamp.org/news/adb-android-install-guide-drivers-and-commands/",
+  "article13title":"MBR VS GPT",
+  "article13link":"https://www.freecodecamp.org/news/mbr-vs-gpt-whats-the-difference-between-an-mbr-partition-and-a-gpt-partition-solved/",
+  "article14title":"Debounce",
+  "article14link":"https://www.freecodecamp.org/news/javascript-debounce-example/",
+  "article15title":"Helm Chart",
+  "article15link":"https://www.freecodecamp.org/news/what-is-a-helm-chart-tutorial-for-kubernetes-beginners/",
+  "article16title":"80-20 Rule",
+  "article16link":"https://www.freecodecamp.org/news/the-80-20-rule-pareto-principle-explained-in-plain-english/",
+  "article17title":"OSI Model",
+  "article17link":"https://www.freecodecamp.org/news/osi-model-networking-layers-explained-in-plain-english/",
+  "article18title":"HTML Link Code",
+  "article18link":"https://www.freecodecamp.org/news/html-link-code-how-to-insert-a-link-to-a-website-with-href-3/",
+  "article19title":"SDLC",
+  "article19link":"https://www.freecodecamp.org/news/what-is-sdlc-software-development-life-cycle-phases-methodologies-and-processes-explained/",
+  "article20title":"Inductive VS Deductive",
+  "article20link":"https://www.freecodecamp.org/news/inductive-vs-deductive-reasoning/",
+  "article21title":"JavaScript Empty Array",
+  "article21link":"https://www.freecodecamp.org/news/check-if-javascript-array-is-empty-or-not-with-length/",
+  "article22title":"Best Instagram Post Time",
+  "article22link":"https://www.freecodecamp.org/news/the-best-time-to-post-on-instagram-the-best-days-and-times-to-reach-your-ig-followers/",
+  "article23title":"Garbage Collection in Java",
+  "article23link":"https://www.freecodecamp.org/news/garbage-collection-in-java-what-is-gc-and-how-it-works-in-the-jvm/",
+  "article24title":"Auto-Numbering in Excel",
+  "article24link":"https://www.freecodecamp.org/news/auto-numbering-in-excel/",
+  "article25title":"JavaScript Keycode List",
+  "article25link":"https://www.freecodecamp.org/news/javascript-keycode-list-keypress-event-key-codes/",
+  "article26title":"JavaScript Reverse Array",
+  "article26link":"https://www.freecodecamp.org/news/javascript-array-reverse-tutorial-with-example-js-code/",
+  "article27title":"How to Screenshot on Mac",
+  "article27link":"https://www.freecodecamp.org/news/how-to-take-a-screenshot-on-a-mac-keyboard-shortcut/",
+  "article28title":"How to Reverse Image Search",
+  "article28link":"https://www.freecodecamp.org/news/how-to-reverse-image-search-on-your-phone-or-desktop/",
+  "article29title":"Ternary Operator JavaScript",
+  "article29link":"https://www.freecodecamp.org/news/ternary-operator-javascript-if-statement-tutorial/"
+}
diff --git a/client/src/utils/algolia-locale-setup.js b/client/src/utils/algolia-locale-setup.js
index 0519e568fa..1ced1eaa7b 100644
--- a/client/src/utils/algolia-locale-setup.js
+++ b/client/src/utils/algolia-locale-setup.js
@@ -18,6 +18,15 @@ const algoliaIndices = {
   'chinese-traditional': {
     name: 'news-zh',
     searchPage: 'https://chinese.freecodecamp.org/news/search'
+  },
+  // TODO: Replace with i18n pages when shipped
+  italian: {
+    name: 'news',
+    searchPage: 'https://www.freecodecamp.org/news/search/'
+  },
+  portuguese: {
+    name: 'news',
+    searchPage: 'https://www.freecodecamp.org/news/search/'
   }
 };
 
diff --git a/config/i18n/all-langs.js b/config/i18n/all-langs.js
index de460f6d98..1c724ab9f1 100644
--- a/config/i18n/all-langs.js
+++ b/config/i18n/all-langs.js
@@ -2,8 +2,22 @@
  * from the .env file aren't found in their respective arrays below
  */
 const availableLangs = {
-  client: ['english', 'espanol', 'chinese', 'chinese-traditional'],
-  curriculum: ['english', 'espanol', 'chinese', 'chinese-traditional']
+  client: [
+    'english',
+    'espanol',
+    'chinese',
+    'chinese-traditional',
+    'italian',
+    'portuguese'
+  ],
+  curriculum: [
+    'english',
+    'espanol',
+    'chinese',
+    'chinese-traditional',
+    'italian',
+    'portuguese'
+  ]
 };
 
 // Each client language needs an entry in the rest of the variables below
@@ -16,7 +30,9 @@ const i18nextCodes = {
   english: 'en',
   espanol: 'es',
   chinese: 'zh',
-  'chinese-traditional': 'zh-Hant'
+  'chinese-traditional': 'zh-Hant',
+  italian: 'it',
+  portuguese: 'pt-BR'
 };
 
 // These are for the language selector dropdown menu in the footer
@@ -24,7 +40,9 @@ const langDisplayNames = {
   english: 'English',
   espanol: 'Español',
   chinese: '中文（简体字）',
-  'chinese-traditional': '中文（繁體字）'
+  'chinese-traditional': '中文（繁體字）',
+  italian: 'Italiano',
+  portuguese: 'Português'
 };
 
 /* These are for formatting dates and numbers. Used with JS .toLocaleString().
@@ -35,7 +53,9 @@ const langCodes = {
   english: 'en-US',
   espanol: 'es-419',
   chinese: 'zh',
-  'chinese-traditional': 'zh-Hant'
+  'chinese-traditional': 'zh-Hant',
+  italian: 'it',
+  portuguese: 'pt-BR'
 };
 
 exports.availableLangs = availableLangs;
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
new file mode 100644
index 0000000000..2326bddd3c
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
@@ -0,0 +1,90 @@
+---
+id: bad87fee1348bd9aec908849
+title: Add Elements within Your Bootstrap Wells
+challengeType: 0
+forumTopicId: 16636
+dashedName: add-elements-within-your-bootstrap-wells
+---
+
+# --description--
+
+Now we're several `div` elements deep on each column of our row. This is as deep as we'll need to go. Now we can add our `button` elements.
+
+Nest three `button` elements within each of your `div` elements having the class name `well`.
+
+# --hints--
+
+Three `button` elements should be nested within each of your `div` elements with class `well`.
+
+```js
+assert(
+  $('div.well:eq(0)').children('button').length === 3 &&
+    $('div.well:eq(1)').children('button').length === 3
+);
+```
+
+You should have a total of 6 `button` elements.
+
+```js
+assert($('button') && $('button').length > 5);
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
new file mode 100644
index 0000000000..9c9a200e02
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
@@ -0,0 +1,177 @@
+---
+id: bad87fee1348bd9aedc08845
+title: Add Font Awesome Icons to all of our Buttons
+challengeType: 0
+forumTopicId: 16637
+required:
+  - link: 'https://use.fontawesome.com/releases/v5.8.1/css/all.css'
+    raw: true
+dashedName: add-font-awesome-icons-to-all-of-our-buttons
+---
+
+# --description--
+
+Font Awesome is a convenient library of icons. These icons can be web fonts or vector graphics. 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.
+
+# --instructions--
+
+Use Font Awesome to add an `info-circle` icon to your info button and a `trash` icon to your delete button.
+
+**Note:** The `span` element is an acceptable alternative to the `i` element for the directions below.
+
+# --hints--
+
+You should add a `<i class="fas fa-info-circle"></i>` within your `info` button element.
+
+```js
+assert(
+  $('.btn-info > i').is('.fas.fa-info-circle') ||
+    $('.btn-info > span').is('.fas.fa-info-circle')
+);
+```
+
+You should add a `<i class="fas fa-trash"></i>` within your `delete` button element.
+
+```js
+assert(
+  $('.btn-danger > i').is('.fas.fa-trash') ||
+    $('.btn-danger > span').is('.fas.fa-trash')
+);
+```
+
+Each of your `i` elements should have a closing tag and `<i class="fas fa-thumbs-up"></i>` is in your `like` button element.
+
+```js
+assert(
+  code.match(/<\/i>|<\/span/g) &&
+    code.match(/<\/i|<\/span>/g).length > 2 &&
+    ($('.btn-primary > i').is('.fas.fa-thumbs-up') ||
+      $('.btn-primary > span').is('.fas.fa-thumbs-up'))
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="fas 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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="fas fa-thumbs-up"></i> Like</button>
+    </div>
+    <div class="col-xs-4">
+      <button class="btn btn-block btn-info"><i class="fas fa-info-circle"></i> Info</button>
+    </div>
+    <div class="col-xs-4">
+      <button class="btn btn-block btn-danger"><i class="fas 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
new file mode 100644
index 0000000000..bda1cf6d31
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
@@ -0,0 +1,194 @@
+---
+id: bad87fee1348bd9aedd08845
+title: Add Font Awesome Icons to our Buttons
+challengeType: 0
+forumTopicId: 16638
+required:
+  - link: 'https://use.fontawesome.com/releases/v5.8.1/css/all.css'
+    raw: true
+dashedName: add-font-awesome-icons-to-our-buttons
+---
+
+# --description--
+
+Font Awesome is a convenient library of icons. These icons can be webfonts or vector graphics. 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:
+
+```html
+<link rel="stylesheet" href="https://use.fontawesome.com/releases/v5.8.1/css/all.css" integrity="sha384-50oBUHEmvpQ+1lW4y57PTFmhCaXp0ML5d60M1M7uH2+nqUivzIebhndOJK28anvf" crossorigin="anonymous">
+```
+
+In this case, we've already added it for you to this page behind the scenes.
+
+The `i` 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 `i` element to turn it into an icon, for example:
+
+```html
+<i class="fas fa-info-circle"></i>
+```
+
+Note that the `span` element is also acceptable for use with icons.
+
+# --instructions--
+
+Use Font Awesome to add a `thumbs-up` icon to your like button by giving it an `i` element with the classes `fas` and `fa-thumbs-up`. Make sure to keep the text `Like` next to the icon.
+
+# --hints--
+
+You should add an `i` element with the classes `fas` and `fa-thumbs-up`.
+
+```js
+assert($('i').is('.fas.fa-thumbs-up') || $('span').is('.fas.fa-thumbs-up'));
+```
+
+Your `fa-thumbs-up` icon should be located within the Like button.
+
+```js
+assert(
+  ($('i.fa-thumbs-up').parent().text().match(/Like/gi) &&
+    $('.btn-primary > i').is('.fas.fa-thumbs-up')) ||
+    ($('span.fa-thumbs-up').parent().text().match(/Like/gi) &&
+      $('.btn-primary > span').is('.fas.fa-thumbs-up'))
+);
+```
+
+Your `i` element should be nested within your `button` element.
+
+```js
+assert(
+  $('button').children('i').length > 0 ||
+    $('button').children('span').length > 0
+);
+```
+
+Your icon element should have a closing tag.
+
+```js
+assert(code.match(/<\/i>|<\/span>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="fas 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
new file mode 100644
index 0000000000..66b46cd625
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
@@ -0,0 +1,93 @@
+---
+id: bad87fee1348bd9aec908853
+title: Add id Attributes to Bootstrap Elements
+challengeType: 0
+forumTopicId: 16639
+dashedName: add-id-attributes-to-bootstrap-elements
+---
+
+# --description--
+
+Recall that in addition to class attributes, you can give each of your elements an `id` 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 `div` elements of class `well`.
+
+Remember that you can give an element an id like this:
+
+```html
+<div class="well" id="center-well">
+```
+
+Give the well on the left the id of `left-well`. Give the well on the right the id of `right-well`.
+
+# --hints--
+
+Your left `well` should have the id of `left-well`.
+
+```js
+assert(
+  $('.col-xs-6').children('#left-well') &&
+    $('.col-xs-6').children('#left-well').length > 0
+);
+```
+
+Your right `well` should have the id of `right-well`.
+
+```js
+assert(
+  $('.col-xs-6').children('#right-well') &&
+    $('.col-xs-6').children('#right-well').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
new file mode 100644
index 0000000000..4ec8c688fc
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
@@ -0,0 +1,77 @@
+---
+id: bad87fee1348bd9aec908850
+title: Apply the Default Bootstrap Button Style
+challengeType: 0
+forumTopicId: 16657
+dashedName: apply-the-default-bootstrap-button-style
+---
+
+# --description--
+
+Bootstrap has another button class called `btn-default`.
+
+Apply both the `btn` and `btn-default` classes to each of your `button` elements.
+
+# --hints--
+
+You should apply the `btn` class to each of your `button` elements.
+
+```js
+assert($('.btn').length > 5);
+```
+
+You should apply the `btn-default` class to each of your `button` elements.
+
+```js
+assert($('.btn-default').length > 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
new file mode 100644
index 0000000000..50f3b1dbd7
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
@@ -0,0 +1,175 @@
+---
+id: bad87fee1348cd8acef08813
+title: Call out Optional Actions with btn-info
+challengeType: 0
+forumTopicId: 16770
+dashedName: call-out-optional-actions-with-btn-info
+---
+
+# --description--
+
+Bootstrap comes with several pre-defined colors for buttons. The `btn-info` 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 `btn-info` and `btn-block` classes to it.
+
+Note that these buttons still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+You should create a new `button` element with the text `Info`.
+
+```js
+assert(new RegExp('info', 'gi').test($('button').text()));
+```
+
+Both of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+
+```js
+assert($('button.btn-block.btn').length > 1);
+```
+
+Your new button should have the class `btn-info`.
+
+```js
+assert($('button').hasClass('btn-info'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
new file mode 100644
index 0000000000..9aeceadaa1
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
@@ -0,0 +1,157 @@
+---
+id: bad87fee1348bd8acde08812
+title: Center Text with Bootstrap
+challengeType: 0
+forumTopicId: 16771
+dashedName: 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 `text-center` to our `h2` element.
+
+Remember that you can add several classes to the same element by separating each of them with a space, like this:
+
+```html
+<h2 class="red-text text-center">your text</h2>
+```
+
+# --hints--
+
+Your `h2` element should be centered by applying the class `text-center`
+
+```js
+assert($('h2').hasClass('text-center'));
+```
+
+Your `h2` element should still have the class `red-text`
+
+```js
+assert($('h2').hasClass('red-text'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
new file mode 100644
index 0000000000..1573a5fc26
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
@@ -0,0 +1,185 @@
+---
+id: bad87fee1348cd8acef08812
+title: Create a Block Element Bootstrap Button
+challengeType: 0
+forumTopicId: 16810
+dashedName: create-a-block-element-bootstrap-button
+---
+
+# --description--
+
+Normally, your `button` elements with the `btn` and `btn-default` classes are only as wide as the text that they contain. For example:
+
+```html
+<button class="btn btn-default">Submit</button>
+```
+
+This button would only be as wide as the word `Submit`.
+
+<button class='btn btn-default'>Submit</button>
+
+By making them block elements with the additional class of `btn-block`, 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.
+
+```html
+<button class="btn btn-default btn-block">Submit</button>
+```
+
+This button would take up 100% of the available width.
+
+<button class='btn btn-default btn-block'>Submit</button>
+
+Note that these buttons still need the `btn` class.
+
+Add Bootstrap's `btn-block` class to your Bootstrap button.
+
+# --hints--
+
+Your button should still have the `btn` and `btn-default` classes.
+
+```js
+assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
+```
+
+Your button should have the class `btn-block`.
+
+```js
+assert($('button').hasClass('btn-block'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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-default">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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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-default">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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
new file mode 100644
index 0000000000..3014dc6931
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348cd8acdf08812
+title: Create a Bootstrap Button
+challengeType: 0
+forumTopicId: 16811
+dashedName: create-a-bootstrap-button
+---
+
+# --description--
+
+Bootstrap has its own styles for `button` elements, which look much better than the plain HTML ones.
+
+Create a new `button` element below your large kitten photo. Give it the `btn` and `btn-default` classes, as well as the text of `Like`.
+
+# --hints--
+
+You should create a new `button` element with the text `Like`.
+
+```js
+assert(
+  new RegExp('like', 'gi').test($('button').text()) &&
+    $('img.img-responsive + button.btn').length > 0
+);
+```
+
+Your new button should have two classes: `btn` and `btn-default`.
+
+```js
+assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<html>
+<head>
+<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css">
+<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>
+</head>
+<body>
+<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.">
+
+   <!-- ADD Bootstrap Styled Button -->
+  <button class="btn btn-default">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="https://freecatphotoapp.com/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>
+</html>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
new file mode 100644
index 0000000000..5292646446
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
@@ -0,0 +1,67 @@
+---
+id: bad87fee1348bd9aec908846
+title: Create a Bootstrap Headline
+challengeType: 0
+forumTopicId: 16812
+dashedName: 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 `h3` element, with the text `jQuery Playground`.
+
+Color your `h3` element with the `text-primary` Bootstrap class, and center it with the `text-center` Bootstrap class.
+
+# --hints--
+
+You should add an `h3` element to your page.
+
+```js
+assert($('h3') && $('h3').length > 0);
+```
+
+Your `h3` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/h3>/g) &&
+    code.match(/<h3/g) &&
+    code.match(/<\/h3>/g).length === code.match(/<h3/g).length
+);
+```
+
+Your `h3` element should be colored by applying the class `text-primary`
+
+```js
+assert($('h3').hasClass('text-primary'));
+```
+
+Your `h3` element should be centered by applying the class `text-center`
+
+```js
+assert($('h3').hasClass('text-center'));
+```
+
+Your `h3` element should have the text `jQuery Playground`.
+
+```js
+assert.isTrue(/jquery(\s)+playground/gi.test($('h3').text()));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+
+```
+
+# --solutions--
+
+```html
+<h3 class="text-primary text-center">jQuery Playground</h3>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
new file mode 100644
index 0000000000..3a5ff315bb
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
@@ -0,0 +1,68 @@
+---
+id: bad87fee1348bd9bec908846
+title: Create a Bootstrap Row
+challengeType: 0
+forumTopicId: 16813
+dashedName: create-a-bootstrap-row
+---
+
+# --description--
+
+Now we'll create a Bootstrap row for our inline elements.
+
+Create a `div` element below the `h3` tag, with a class of `row`.
+
+# --hints--
+
+You should add a `div` element below your `h3` element.
+
+```js
+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
+);
+```
+
+Your `div` element should have the class `row`
+
+```js
+assert($('div').hasClass('row'));
+```
+
+Your `row div` should be nested inside the `container-fluid div`
+
+```js
+assert($('div.container-fluid div.row').length > 0);
+```
+
+Your `div` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+
+</div>
+```
+
+# --solutions--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+  <div class="row"></div>
+</div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
new file mode 100644
index 0000000000..eaea933735
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
@@ -0,0 +1,71 @@
+---
+id: bad87fee1348bd9aec908852
+title: Create a Class to Target with jQuery Selectors
+challengeType: 0
+forumTopicId: 16815
+dashedName: 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 `button` elements the class `target`.
+
+# --hints--
+
+You should apply the `target` class to each of your `button` elements.
+
+```js
+assert($('.target').length > 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+      </div>
+    </div>
+    <div class="col-xs-6">
+      <div class="well">
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+      </div>
+    </div>
+  </div>
+</div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-custom-heading.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-custom-heading.md
new file mode 100644
index 0000000000..646afcbe0f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-a-custom-heading.md
@@ -0,0 +1,177 @@
+---
+id: bad87fee1348bd9aede08845
+title: Create a Custom Heading
+challengeType: 0
+forumTopicId: 16816
+dashedName: 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 `div` element.
+
+Nest your first image and your `h2` element within a single `<div class="row">` element. Nest your `h2` element within a `<div class="col-xs-8">` and your image in a `<div class="col-xs-4">` so that they are on the same line.
+
+Notice how the image is now just the right size to fit along the text?
+
+# --hints--
+
+Your `h2` element and topmost `img` element should both be nested together within a `div` element with the class `row`.
+
+```js
+assert($('div.row:has(h2)').length > 0 && $('div.row:has(img)').length > 0);
+```
+
+Your topmost `img` element should be nested within a `div` with the class `col-xs-4`.
+
+```js
+assert(
+  $('div.col-xs-4:has(img)').length > 0 &&
+    $('div.col-xs-4:has(div)').length === 0
+);
+```
+
+Your `h2` element should be nested within a `div` with the class `col-xs-8`.
+
+```js
+assert(
+  $('div.col-xs-8:has(h2)').length > 0 &&
+    $('div.col-xs-8:has(div)').length === 0
+);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-bootstrap-wells.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
new file mode 100644
index 0000000000..47de1536d6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
@@ -0,0 +1,71 @@
+---
+id: bad87fee1348bd9aec908848
+title: Create Bootstrap Wells
+challengeType: 0
+forumTopicId: 16825
+dashedName: create-bootstrap-wells
+---
+
+# --description--
+
+Bootstrap has a class called `well` that can create a visual sense of depth for your columns.
+
+Nest one `div` element with the class `well` within each of your `col-xs-6` `div` elements.
+
+# --hints--
+
+You should add a `div` element with the class `well` inside each of your `div` elements with the class `col-xs-6`
+
+```js
+assert($('div.col-xs-6').not(':has(>div.well)').length < 1);
+```
+
+Both of your `div` elements with the class `col-xs-6` should be nested within your `div` element with the class `row`.
+
+```js
+assert($('div.row > div.col-xs-6').length > 1);
+```
+
+All your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
new file mode 100644
index 0000000000..76a1bffcd7
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
@@ -0,0 +1,188 @@
+---
+id: bad87fee1347bd9aedf08845
+title: Ditch Custom CSS for Bootstrap
+challengeType: 0
+forumTopicId: 17565
+dashedName: 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 `.red-text`, `p`, and `.smaller-image` CSS declarations from your `style` element so that the only declarations left in your `style` element are `h2` and `thick-green-border`.
+
+Then delete the `p` element that contains a dead link. Then remove the `red-text` class from your `h2` element and replace it with the `text-primary` Bootstrap class.
+
+Finally, remove the `smaller-image` class from your first `img` element and replace it with the `img-responsive` class.
+
+# --hints--
+
+Your `h2` element should no longer have the class `red-text`.
+
+```js
+assert(!$('h2').hasClass('red-text'));
+```
+
+Your `h2` element should now have the class `text-primary`.
+
+```js
+assert($('h2').hasClass('text-primary'));
+```
+
+Your paragraph elements should no longer use the font `Monospace`.
+
+```js
+assert(
+  !$('p')
+    .css('font-family')
+    .match(/monospace/i)
+);
+```
+
+The `smaller-image` class should be removed from your top image.
+
+```js
+assert(!$('img').hasClass('smaller-image'));
+```
+
+You should add the `img-responsive` class to your top image.
+
+```js
+assert($('.img-responsive').length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
new file mode 100644
index 0000000000..290766d634
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
@@ -0,0 +1,125 @@
+---
+id: bad87fee1348bd9aec908855
+title: Give Each Element a Unique id
+challengeType: 0
+forumTopicId: 18191
+dashedName: 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 `target1` and ending with `target6`.
+
+Make sure that `target1` to `target3` are in `#left-well`, and `target4` to `target6` are in `#right-well`.
+
+# --hints--
+
+One `button` element should have the id `target1`.
+
+```js
+assert(
+  $('#left-well').children('#target1') &&
+    $('#left-well').children('#target1').length > 0
+);
+```
+
+One `button` element should have the id `target2`.
+
+```js
+assert(
+  $('#left-well').children('#target2') &&
+    $('#left-well').children('#target2').length > 0
+);
+```
+
+One `button` element should have the id `target3`.
+
+```js
+assert(
+  $('#left-well').children('#target3') &&
+    $('#left-well').children('#target3').length > 0
+);
+```
+
+One `button` element should have the id `target4`.
+
+```js
+assert(
+  $('#right-well').children('#target4') &&
+    $('#right-well').children('#target4').length > 0
+);
+```
+
+One `button` element should have the id `target5`.
+
+```js
+assert(
+  $('#right-well').children('#target5') &&
+    $('#right-well').children('#target5').length > 0
+);
+```
+
+One `button` element should have the id `target6`.
+
+```js
+assert(
+  $('#right-well').children('#target6') &&
+    $('#right-well').children('#target6').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
new file mode 100644
index 0000000000..452f52ab47
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
@@ -0,0 +1,53 @@
+---
+id: bad87fee1348bd9aec908746
+title: House our page within a Bootstrap container-fluid div
+challengeType: 0
+forumTopicId: 18198
+dashedName: 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 `h3` element within a `div` element with the class `container-fluid`.
+
+# --hints--
+
+Your `div` element should have the class `container-fluid`.
+
+```js
+assert($('div').hasClass('container-fluid'));
+```
+
+Each of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+Your `h3` element should be nested inside a `div` element.
+
+```js
+assert($('div').children('h3').length > 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<h3 class="text-primary text-center">jQuery Playground</h3>
+```
+
+# --solutions--
+
+```html
+<div class="container-fluid">
+    <h3 class="text-primary text-center">jQuery Playground</h3>
+</div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
new file mode 100644
index 0000000000..6d995aa318
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
@@ -0,0 +1,105 @@
+---
+id: bad87fee1348bd9aec908856
+title: Label Bootstrap Buttons
+challengeType: 0
+forumTopicId: 18222
+dashedName: label-bootstrap-buttons
+---
+
+# --description--
+
+Just like we labeled our wells, we want to label our buttons.
+
+Give each of your `button` elements text that corresponds to its id selector.
+
+# --hints--
+
+Your `button` element with the id `target1` should have the text `#target1`.
+
+```js
+assert(new RegExp('#target1', 'gi').test($('#target1').text()));
+```
+
+Your `button` element with the id `target2` should have the text `#target2`.
+
+```js
+assert(new RegExp('#target2', 'gi').test($('#target2').text()));
+```
+
+Your `button` element with the id `target3` should have the text `#target3`.
+
+```js
+assert(new RegExp('#target3', 'gi').test($('#target3').text()));
+```
+
+Your `button` element with the id `target4` should have the text `#target4`.
+
+```js
+assert(new RegExp('#target4', 'gi').test($('#target4').text()));
+```
+
+Your `button` element with the id `target5` should have the text `#target5`.
+
+```js
+assert(new RegExp('#target5', 'gi').test($('#target5').text()));
+```
+
+Your `button` element with the id `target6` should have the text `#target6`.
+
+```js
+assert(new RegExp('#target6', 'gi').test($('#target6').text()));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-wells.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
new file mode 100644
index 0000000000..cae4c4837f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
@@ -0,0 +1,101 @@
+---
+id: bad87fee1348bd9aec908854
+title: Label Bootstrap Wells
+challengeType: 0
+forumTopicId: 18223
+dashedName: 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 `col-xs-6` `div` element, add a `h4` element with the text `#left-well`.
+
+Above your right-well, inside its `col-xs-6` `div` element, add a `h4` element with the text `#right-well`.
+
+# --hints--
+
+You should add an `h4` element to each of your `<div class="col-xs-6">` elements.
+
+```js
+assert(
+  $('.col-xs-6').children('h4') && $('.col-xs-6').children('h4').length > 1
+);
+```
+
+One `h4` element should have the text `#left-well`.
+
+```js
+assert(new RegExp('#left-well', 'gi').test($('h4').text()));
+```
+
+One `h4` element should have the text `#right-well`.
+
+```js
+assert(new RegExp('#right-well', 'gi').test($('h4').text()));
+```
+
+All of your `h4` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/h4>/g) &&
+    code.match(/<h4/g) &&
+    code.match(/<\/h4>/g).length === code.match(/<h4/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
new file mode 100644
index 0000000000..426dad2cb4
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
@@ -0,0 +1,214 @@
+---
+id: bad87fee1348bd9aec908845
+title: Line up Form Elements Responsively with Bootstrap
+challengeType: 0
+forumTopicId: 18225
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: line-up-form-elements-responsively-with-bootstrap
+---
+
+# --description--
+
+Now let's get your form `input` and your submission `button` on the same line. We'll do this the same way we have previously: by using a `div` element with the class `row`, and other `div` elements within it using the `col-xs-*` class.
+
+Nest both your form's text `input` and submit `button` within a `div` with the class `row`. Nest your form's text `input` within a div with the class of `col-xs-7`. Nest your form's submit `button` in a `div` with the class `col-xs-5`.
+
+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!
+
+# --hints--
+
+Your form submission button and text input should be nested in a div with class `row`.
+
+```js
+assert(
+  $('div.row:has(input[type="text"])').length > 0 &&
+    $('div.row:has(button[type="submit"])').length > 0
+);
+```
+
+Your form text input should be nested in a div with the class `col-xs-7`.
+
+```js
+assert($('div.col-xs-7:has(input[type="text"])').length > 0);
+```
+
+Your form submission button should be nested in a div with the class `col-xs-5`.
+
+```js
+assert($('div.col-xs-5:has(button[type="submit"])').length > 0);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+    <div class="row">
+      <div class="col-xs-7">
+        <input type="text" class="form-control" placeholder="cat photo URL" required>
+      </div>
+      <div class="col-xs-5">
+        <button type="submit" class="btn btn-primary"><i class="fa fa-paper-plane"></i> Submit</button>
+      </div>
+    </div>
+  </form>
+</div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
new file mode 100644
index 0000000000..54c1ec8e26
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348bd9acde08812
+title: Make Images Mobile Responsive
+challengeType: 0
+forumTopicId: 18232
+dashedName: make-images-mobile-responsive
+---
+
+# --description--
+
+First, add a new image below the existing one. Set its `src` attribute to `https://bit.ly/fcc-running-cats`.
+
+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 `img-responsive` class to your image. Do this, and the image should perfectly fit the width of your page.
+
+# --hints--
+
+You should have a total of two images.
+
+```js
+assert($('img').length === 2);
+```
+
+Your new image should be below your old one and have the class `img-responsive`.
+
+```js
+assert($('img:eq(1)').hasClass('img-responsive'));
+```
+
+Your new image should not have the class `smaller-image`.
+
+```js
+assert(!$('img:eq(1)').hasClass('smaller-image'));
+```
+
+Your new image should have a `src` of `https://bit.ly/fcc-running-cats`.
+
+```js
+assert($('img:eq(1)').attr('src') === 'https://bit.ly/fcc-running-cats');
+```
+
+Your new `img` element should have a closing angle bracket.
+
+```js
+assert(
+  code.match(/<img/g) &&
+    code.match(/<img[^<]*>/g).length === 2 &&
+    code.match(/<img/g).length === 2
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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">
+
+  <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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
new file mode 100644
index 0000000000..33c062bdf5
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
@@ -0,0 +1,191 @@
+---
+id: bad87fee1348bd9aeda08845
+title: Responsively Style Checkboxes
+challengeType: 0
+forumTopicId: 18269
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: responsively-style-checkboxes
+---
+
+# --description--
+
+Since Bootstrap's `col-xs-*` classes are applicable to all `form` elements, you can use them on your checkboxes too! This way, the checkboxes will be evenly spread out across the page, regardless of how wide the screen resolution is.
+
+# --instructions--
+
+Nest all three of your checkboxes in a `<div class="row">` element. Then nest each of them in a `<div class="col-xs-4">` element.
+
+# --hints--
+
+All of your checkboxes should be nested inside one `div` with the class `row`.
+
+```js
+assert($('div.row:has(input[type="checkbox"])').length > 0);
+```
+
+Each of your checkboxes should be nested inside its own `div` with the class `col-xs-4`.
+
+```js
+assert($('div.col-xs-4:has(input[type="checkbox"])').length > 2);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
new file mode 100644
index 0000000000..b2ec1682b3
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
@@ -0,0 +1,175 @@
+---
+id: bad87fee1348bd9aedb08845
+title: Responsively Style Radio Buttons
+challengeType: 0
+forumTopicId: 18270
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: responsively-style-radio-buttons
+---
+
+# --description--
+
+You can use Bootstrap's `col-xs-*` classes on `form` 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 `<div class="row">` element. Then nest each of them within a `<div class="col-xs-6">` element.
+
+**Note:** As a reminder, radio buttons are `input` elements of type `radio`.
+
+# --hints--
+
+All of your radio buttons should be nested inside one `div` with the class `row`.
+
+```js
+assert($('div.row:has(input[type="radio"])').length > 0);
+```
+
+Each of your radio buttons should be nested inside its own `div` with the class `col-xs-6`.
+
+```js
+assert($('div.col-xs-6:has(input[type="radio"])').length > 1);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
new file mode 100644
index 0000000000..440c9a7740
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
@@ -0,0 +1,57 @@
+---
+id: bad87fee1348bd9aec908847
+title: Split Your Bootstrap Row
+challengeType: 0
+forumTopicId: 18306
+dashedName: 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 `div` elements within your row, both with the class `col-xs-6`.
+
+# --hints--
+
+Two `div class="col-xs-6"` elements should be nested within your `div class="row"` element.
+
+```js
+assert($('div.row > div.col-xs-6').length > 1);
+```
+
+All your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+  <div class="row">
+
+
+  </div>
+</div>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
new file mode 100644
index 0000000000..ddbc6ab0ab
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
@@ -0,0 +1,201 @@
+---
+id: bad87fee1348bd9aed908845
+title: Style Text Inputs as Form Controls
+challengeType: 0
+forumTopicId: 18312
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: style-text-inputs-as-form-controls
+---
+
+# --description--
+
+You can add the `fa-paper-plane` Font Awesome icon by adding `<i class="fa fa-paper-plane"></i>` within your submit `button` element.
+
+Give your form's text input field a class of `form-control`. Give your form's submit button the classes `btn btn-primary`. Also give this button the Font Awesome icon of `fa-paper-plane`.
+
+All textual `<input>`, `<textarea>`, and `<select>` elements with the class `.form-control` have a width of 100%.
+
+# --hints--
+
+The submit button in your form should have the classes `btn btn-primary`.
+
+```js
+assert($('button[type="submit"]').hasClass('btn btn-primary'));
+```
+
+You should add a `<i class="fa fa-paper-plane"></i>` within your submit `button` element.
+
+```js
+assert($('button[type="submit"]:has(i.fa.fa-paper-plane)').length > 0);
+```
+
+The text `input` in your form should have the class `form-control`.
+
+```js
+assert($('input[type="text"]').hasClass('form-control'));
+```
+
+Each of your `i` elements should have a closing tag.
+
+```js
+assert(code.match(/<\/i>/g) && code.match(/<\/i/g).length > 3);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
new file mode 100644
index 0000000000..a3e9e1b9ec
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
@@ -0,0 +1,167 @@
+---
+id: bad87fee1348cd8acef08811
+title: Taste the Bootstrap Button Color Rainbow
+challengeType: 0
+forumTopicId: 18323
+dashedName: taste-the-bootstrap-button-color-rainbow
+---
+
+# --description--
+
+The `btn-primary` class is the main color you'll use in your app. It is useful for highlighting actions you want your user to take.
+
+Replace Bootstrap's `btn-default` class with `btn-primary` in your button.
+
+Note that this button will still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+Your button should have the class `btn-primary`.
+
+```js
+assert($('button').hasClass('btn-primary'));
+```
+
+Your button should still have the `btn` and `btn-block` classes.
+
+```js
+assert($('button').hasClass('btn-block') && $('button').hasClass('btn'));
+```
+
+All your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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-default 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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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-primary 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
new file mode 100644
index 0000000000..b4e04ccd5b
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
@@ -0,0 +1,185 @@
+---
+id: bad87fee1348bd9aedf08845
+title: Use a span to Target Inline Elements
+challengeType: 0
+forumTopicId: 18370
+dashedName: use-a-span-to-target-inline-elements
+---
+
+# --description--
+
+You can use spans to create inline elements. Remember when we used the `btn-block` class to make the button fill the entire row?
+
+<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>normal button</button>
+
+<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>btn-block button</button>
+
+That illustrates the difference between an "inline" element and a "block" element.
+
+By using the inline `span` element, you can put several elements on the same line, and even style different parts of the same line differently.
+
+Using a `span` element, nest the word `love` inside the `p` element that currently has the text `Things cats love`. Then give the `span` the class `text-danger` to make the text red.
+
+Here's how you would do this for the `p` element that has the text `Top 3 things cats hate`:
+
+```html
+<p>Top 3 things cats <span class="text-danger">hate:</span></p>
+```
+
+# --hints--
+
+Your `span` element should be inside your `p` element.
+
+```js
+assert($('p span') && $('p span').length > 0);
+```
+
+Your `span` element should have just the text `love`.
+
+```js
+assert(
+  $('p span') &&
+    $('p span').text().match(/love/i) &&
+    !$('p span')
+      .text()
+      .match(/Things cats/i)
+);
+```
+
+Your `span` element should have class `text-danger`.
+
+```js
+assert($('span').hasClass('text-danger'));
+```
+
+Your `span` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/span>/g) &&
+    code.match(/<span/g) &&
+    code.match(/<\/span>/g).length === code.match(/<span/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
new file mode 100644
index 0000000000..d53b768509
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
@@ -0,0 +1,98 @@
+---
+id: bad87fee1348bd9aec908857
+title: Use Comments to Clarify Code
+challengeType: 0
+forumTopicId: 18347
+dashedName: 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 `<!--` and end a comment with `-->`
+
+Add a comment at the top of your HTML that says `Code below this line should not be changed`
+
+# --hints--
+
+You should start a comment with `<!--` at the top of your HTML.
+
+```js
+assert(code.match(/^\s*<!--/));
+```
+
+Your comment should have the text `Code below this line should not be changed`.
+
+```js
+assert(code.match(/<!--(?!(>|->|.*-->.*this line))\s*.*this line.*\s*-->/gi));
+```
+
+You should close your comment with `-->`.
+
+```js
+assert(code.match(/-->.*\n+.+/g));
+```
+
+You should have the same number of comment openers and closers.
+
+```js
+assert(code.match(/<!--/g).length === code.match(/-->/g).length);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<!-- Code below this line should not be changed -->
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
new file mode 100644
index 0000000000..3e5204468d
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
@@ -0,0 +1,170 @@
+---
+id: bad87fee1348bd9acde08712
+title: Use Responsive Design with Bootstrap Fluid Containers
+challengeType: 0
+forumTopicId: 18362
+dashedName: 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 <dfn>responsive design</dfn>.
+
+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:
+
+```html
+<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css" integrity="sha384-BVYiiSIFeK1dGmJRAkycuHAHRg32OmUcww7on3RYdg4Va+PmSTsz/K68vbdEjh4u" crossorigin="anonymous"/>
+```
+
+In this case, we've already added it for you to this page behind the scenes. Note that using either `>` or `/>` to close the `link` tag is acceptable.
+
+To get started, we should nest all of our HTML (except the `link` tag and the `style` element) in a `div` element with the class `container-fluid`.
+
+# --hints--
+
+Your `div` element should have the class `container-fluid`.
+
+```js
+assert($('div').hasClass('container-fluid'));
+```
+
+Your `div` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+All HTML elements after the closing `style` tag should be nested in `.container-fluid`.
+
+```js
+assert($('.container-fluid').children().length >= 8 && !$('.container-fluid').has("style").length && !$('.container-fluid').has("link").length);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
new file mode 100644
index 0000000000..67a3387379
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
@@ -0,0 +1,196 @@
+---
+id: bad88fee1348ce8acef08815
+title: Use the Bootstrap Grid to Put Elements Side By Side
+challengeType: 0
+forumTopicId: 18371
+dashedName: use-the-bootstrap-grid-to-put-elements-side-by-side
+---
+
+# --description--
+
+Bootstrap uses a responsive 12-column 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 `div` element.
+
+Bootstrap has different column width attributes that it uses depending on how wide the user's screen is. For example, phones have narrow screens, and laptops have wider screens.
+
+Take for example Bootstrap's `col-md-*` class. Here, `md` means medium, and `*` 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 `col-xs-*`, where `xs` means extra small (like an extra-small mobile phone screen), and `*` is the number of columns specifying how many columns wide the element should be.
+
+Put the `Like`, `Info` and `Delete` buttons side-by-side by nesting all three of them within one `<div class="row">` element, then each of them within a `<div class="col-xs-4">` element.
+
+The `row` class is applied to a `div`, and the buttons themselves can be nested within it.
+
+# --hints--
+
+Your buttons should all be nested within the same `div` element with the class `row`.
+
+```js
+assert($('div.row:has(button)').length > 0);
+```
+
+Each of your Bootstrap buttons should be nested within its own `div` element with the class `col-xs-4`.
+
+```js
+assert($('div.col-xs-4:has(button)').length > 2);
+```
+
+Each of your `button` elements should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+Each of your `div` elements should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
new file mode 100644
index 0000000000..3102b61875
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348ce8acef08814
+title: Warn Your Users of a Dangerous Action with btn-danger
+challengeType: 0
+forumTopicId: 18375
+dashedName: warn-your-users-of-a-dangerous-action-with-btn-danger
+---
+
+# --description--
+
+Bootstrap comes with several pre-defined colors for buttons. The `btn-danger` 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 `btn-danger`.
+
+Note that these buttons still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+You should create a new `button` element with the text `Delete`.
+
+```js
+assert(new RegExp('Delete', 'gi').test($('button').text()));
+```
+
+All of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+
+```js
+assert($('button.btn-block.btn').length > 2);
+```
+
+Your new button should have the class `btn-danger`.
+
+```js
+assert($('button').hasClass('btn-danger'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
new file mode 100644
index 0000000000..cbb6d71c11
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
@@ -0,0 +1,81 @@
+---
+id: bd7158d8c442eddfaeb5bd0f
+title: Build a 25 + 5 Clock
+challengeType: 3
+forumTopicId: 301373
+dashedName: build-a-25--5-clock
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XpKrrW>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see an element with `id="break-label"` that contains a string (e.g. "Break Length").
+
+**User Story #2:** I can see an element with `id="session-label"` that contains a string (e.g. "Session Length").
+
+**User Story #3:** I can see two clickable elements with corresponding IDs: `id="break-decrement"` and `id="session-decrement"`.
+
+**User Story #4:** I can see two clickable elements with corresponding IDs: `id="break-increment"` and `id="session-increment"`.
+
+**User Story #5:** I can see an element with a corresponding `id="break-length"`, which by default (on load) displays a value of 5.
+
+**User Story #6:** I can see an element with a corresponding `id="session-length"`, which by default displays a value of 25.
+
+**User Story #7:** I can see an element with a corresponding `id="timer-label"`, that contains a string indicating a session is initialized (e.g. "Session").
+
+**User Story #8:** I can see an element with corresponding `id="time-left"`. NOTE: Paused or running, the value in this field should always be displayed in `mm:ss` format (i.e. 25:00).
+
+**User Story #9:** I can see a clickable element with a corresponding `id="start_stop"`.
+
+**User Story #10:** I can see a clickable element with a corresponding `id="reset"`.
+
+**User Story #11:** When I click the element with the id of `reset`, any running timer should be stopped, the value within `id="break-length"` should return to `5`, the value within `id="session-length"` should return to 25, and the element with `id="time-left"` should reset to its default state.
+
+**User Story #12:** When I click the element with the id of `break-decrement`, the value within `id="break-length"` decrements by a value of 1, and I can see the updated value.
+
+**User Story #13:** When I click the element with the id of `break-increment`, the value within `id="break-length"` increments by a value of 1, and I can see the updated value.
+
+**User Story #14:** When I click the element with the id of `session-decrement`, the value within `id="session-length"` decrements by a value of 1, and I can see the updated value.
+
+**User Story #15:** When I click the element with the id of `session-increment`, the value within `id="session-length"` increments by a value of 1, and I can see the updated value.
+
+**User Story #16:** I should not be able to set a session or break length to &lt;= 0.
+
+**User Story #17:** I should not be able to set a session or break length to > 60.
+
+**User Story #18:** When I first click the element with `id="start_stop"`, the timer should begin running from the value currently displayed in `id="session-length"`, even if the value has been incremented or decremented from the original value of 25.
+
+**User Story #19:** If the timer is running, the element with the id of `time-left` should display the remaining time in `mm:ss` format (decrementing by a value of 1 and updating the display every 1000ms).
+
+**User Story #20:** If the timer is running and I click the element with `id="start_stop"`, the countdown should pause.
+
+**User Story #21:** If the timer is paused and I click the element with `id="start_stop"`, the countdown should resume running from the point at which it was paused.
+
+**User Story #22:** When a session countdown reaches zero (NOTE: timer MUST reach 00:00), and a new countdown begins, the element with the id of `timer-label` should display a string indicating a break has begun.
+
+**User Story #23:** When a session countdown reaches zero (NOTE: timer MUST reach 00:00), a new break countdown should begin, counting down from the value currently displayed in the `id="break-length"` element.
+
+**User Story #24:** When a break countdown reaches zero (NOTE: timer MUST reach 00:00), and a new countdown begins, the element with the id of `timer-label` should display a string indicating a session has begun.
+
+**User Story #25:** When a break countdown reaches zero (NOTE: timer MUST reach 00:00), a new session countdown should begin, counting down from the value currently displayed in the `id="session-length"` element.
+
+**User Story #26:** When a countdown reaches zero (NOTE: timer MUST reach 00:00), a sound indicating that time is up should play. This should utilize an HTML5 `audio` tag and have a corresponding `id="beep"`.
+
+**User Story #27:** The audio element with `id="beep"` must be 1 second or longer.
+
+**User Story #28:** The audio element with id of `beep` must stop playing and be rewound to the beginning when the element with the id of `reset` is clicked.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
new file mode 100644
index 0000000000..4cf667cf9e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
@@ -0,0 +1,39 @@
+---
+id: 587d7dbc367417b2b2512bae
+title: Build a Drum Machine
+challengeType: 3
+forumTopicId: 301370
+dashedName: build-a-drum-machine
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/MJyNMd>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I should be able to see an outer container with a corresponding `id="drum-machine"` that contains all other elements.
+
+**User Story #2:** Within `#drum-machine` I can see an element with a corresponding `id="display"`.
+
+**User Story #3:** Within `#drum-machine` I can see 9 clickable drum pad elements, each with a class name of `drum-pad`, a unique id that describes the audio clip the drum pad will be set up to trigger, and an inner text that corresponds to one of the following keys on the keyboard: `Q`, `W`, `E`, `A`, `S`, `D`, `Z`, `X`, `C`. The drum pads MUST be in this order.
+
+**User Story #4:** Within each `.drum-pad`, there should be an HTML5 `audio` element which has a `src` attribute pointing to an audio clip, a class name of `clip`, and an id corresponding to the inner text of its parent `.drum-pad` (e.g. `id="Q"`, `id="W"`, `id="E"` etc.).
+
+**User Story #5:** When I click on a `.drum-pad` element, the audio clip contained in its child `audio` element should be triggered.
+
+**User Story #6:** When I press the trigger key associated with each `.drum-pad`, the audio clip contained in its child `audio` element should be triggered (e.g. pressing the `Q` key should trigger the drum pad which contains the string `Q`, pressing the `W` key should trigger the drum pad which contains the string `W`, etc.).
+
+**User Story #7:** When a `.drum-pad` is triggered, a string describing the associated audio clip is displayed as the inner text of the `#display` element (each string must be unique).
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
new file mode 100644
index 0000000000..cb20e900bb
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
@@ -0,0 +1,62 @@
+---
+id: bd7158d8c442eddfaeb5bd17
+title: Build a JavaScript Calculator
+challengeType: 3
+forumTopicId: 301371
+dashedName: build-a-javascript-calculator
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wgGVVX>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** My calculator should contain a clickable element containing an `=` (equal sign) with a corresponding `id="equals"`.
+
+**User Story #2:** My calculator should contain 10 clickable elements containing one number each from 0-9, with the following corresponding IDs: `id="zero"`, `id="one"`, `id="two"`, `id="three"`, `id="four"`, `id="five"`, `id="six"`, `id="seven"`, `id="eight"`, and `id="nine"`.
+
+**User Story #3:** My calculator should contain 4 clickable elements each containing one of the 4 primary mathematical operators with the following corresponding IDs: `id="add"`, `id="subtract"`, `id="multiply"`, `id="divide"`.
+
+**User Story #4:** My calculator should contain a clickable element containing a `.` (decimal point) symbol with a corresponding `id="decimal"`.
+
+**User Story #5:** My calculator should contain a clickable element with an `id="clear"`.
+
+**User Story #6:** My calculator should contain an element to display values with a corresponding `id="display"`.
+
+**User Story #7:** At any time, pressing the `clear` button clears the input and output values, and returns the calculator to its initialized state; 0 should be shown in the element with the id of `display`.
+
+**User Story #8:** As I input numbers, I should be able to see my input in the element with the id of `display`.
+
+**User Story #9:** In any order, I should be able to add, subtract, multiply and divide a chain of numbers of any length, and when I hit `=`, the correct result should be shown in the element with the id of `display`.
+
+**User Story #10:** When inputting numbers, my calculator should not allow a number to begin with multiple zeros.
+
+**User Story #11:** When the decimal element is clicked, a `.` should append to the currently displayed value; two `.` in one number should not be accepted.
+
+**User Story #12:** I should be able to perform any operation (`+`, `-`, `*`, `/`) on numbers containing decimal points.
+
+**User Story #13:** If 2 or more operators are entered consecutively, the operation performed should be the last operator entered (excluding the negative (`-`) sign). For example, if `5 + * 7 =` is entered, the result should be `35` (i.e. `5 * 7`); if `5 * - 5 =` is entered, the result should be `-25` (i.e. `5 * (-5)`).
+
+**User Story #14:** Pressing an operator immediately following `=` should start a new calculation that operates on the result of the previous evaluation.
+
+**User Story #15:** My calculator should have several decimal places of precision when it comes to rounding (note that there is no exact standard, but you should be able to handle calculations like `2 / 7` with reasonable precision to at least 4 decimal places).
+
+**Note On Calculator Logic:** 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.
+
+**EXAMPLE:** `3 + 5 x 6 - 2 / 4 =`  
+
+-   **Immediate Execution Logic:** `11.5`
+-   **Formula/Expression Logic:** `32.5`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
new file mode 100644
index 0000000000..2be74eba1c
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
@@ -0,0 +1,39 @@
+---
+id: bd7157d8c242eddfaeb5bd13
+title: Build a Markdown Previewer
+challengeType: 3
+forumTopicId: 301372
+dashedName: build-a-markdown-previewer
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/GrZVVO>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see a `textarea` element with a corresponding `id="editor"`.
+
+**User Story #2:** I can see an element with a corresponding `id="preview"`.
+
+**User Story #3:** When I enter text into the `#editor` element, the `#preview` element is updated as I type to display the content of the textarea.
+
+**User Story #4:** When I enter GitHub flavored markdown into the `#editor` element, the text is rendered as HTML in the `#preview` element as I type (HINT: You don't need to parse Markdown yourself - you can import the Marked library for this: <https://cdnjs.com/libraries/marked>).
+
+**User Story #5:** When my markdown previewer first loads, the default text in the `#editor` field should contain valid markdown that represents at least one of each of the following elements: a header (H1 size), a sub header (H2 size), a link, inline code, a code block, a list item, a blockquote, an image, and bolded text.
+
+**User Story #6:** When my markdown previewer first loads, the default markdown in the `#editor` field should be rendered as HTML in the `#preview` element.
+
+**Optional Bonus (you do not need to make this test pass):** My markdown previewer interprets carriage returns and renders them as `br` (line break) elements.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
new file mode 100644
index 0000000000..f70f8dab0f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
@@ -0,0 +1,49 @@
+---
+id: bd7158d8c442eddfaeb5bd13
+title: Build a Random Quote Machine
+challengeType: 3
+forumTopicId: 301374
+dashedName: build-a-random-quote-machine
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/qRZeGZ>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see a wrapper element with a corresponding `id="quote-box"`.
+
+**User Story #2:** Within `#quote-box`, I can see an element with a corresponding `id="text"`.
+
+**User Story #3:** Within `#quote-box`, I can see an element with a corresponding `id="author"`.
+
+**User Story #4:** Within `#quote-box`, I can see a clickable element with a corresponding `id="new-quote"`.
+
+**User Story #5:** Within `#quote-box`, I can see a clickable `a` element with a corresponding `id="tweet-quote"`.
+
+**User Story #6:** On first load, my quote machine displays a random quote in the element with `id="text"`.
+
+**User Story #7:** On first load, my quote machine displays the random quote's author in the element with `id="author"`.
+
+**User Story #8:** When the `#new-quote` button is clicked, my quote machine should fetch a new quote and display it in the `#text` element.
+
+**User Story #9:** My quote machine should fetch the new quote's author when the `#new-quote` button is clicked and display it in the `#author` element.
+
+**User Story #10:** I can tweet the current quote by clicking on the `#tweet-quote` `a` element. This `a` element should include the `"twitter.com/intent/tweet"` path in its `href` attribute to tweet the current quote.
+
+**User Story #11:** The `#quote-box` wrapper element should be horizontally centered. Please run tests with browser's zoom level at 100% and page maximized.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+**Note:** Twitter does not allow links to be loaded in an iframe. Try using the `target="_blank"` or `target="_top"` attribute on the `#tweet-quote` element if your tweet won't load. `target="_top"` will replace the current tab so make sure your work is saved.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
new file mode 100644
index 0000000000..50960b60c6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
@@ -0,0 +1,131 @@
+---
+id: 564944c91be2204b269d51e3
+title: Change Text Inside an Element Using jQuery
+challengeType: 6
+forumTopicId: 16773
+dashedName: 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 `.html()` 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:
+
+```js
+$("h3").html("<em>jQuery Playground</em>");
+```
+
+jQuery also has a similar function called `.text()` 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 `target4` by emphasizing its text.
+
+[View our news article for &lt;em>](https://www.freecodecamp.org/news/html-elements-explained-what-are-html-tags/#em-element) to learn the difference between `<i>` and `<em>` and their uses.
+
+Note that while the `<i>` tag has traditionally been used to emphasize text, it has since been adopted for use as a tag for icons. The `<em>` tag is now widely accepted as the tag for emphasis. Either will work for this challenge.
+
+# --hints--
+
+You should emphasize the text in your `target4` button by adding HTML tags.
+
+```js
+assert.isTrue(
+  /<em>|<i>\s*#target4\s*<\/em>|<\/i>/gi.test($('#target4').html())
+);
+```
+
+The text should otherwise remain unchanged.
+
+```js
+assert($('#target4') && $('#target4').text().trim() === '#target4');
+```
+
+You should not alter any other text.
+
+```js
+assert.isFalse(/<em>|<i>/gi.test($('h3').html()));
+```
+
+You should be using `.html()` and not `.text()`.
+
+```js
+assert(code.match(/\.html\(/g));
+```
+
+You should select `button id="target4"` with jQuery.
+
+```js
+assert(code.match(/\$\(\s*?(\"|\')#target4(\"|\')\s*?\)\.html\(/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target4").html('<em>#target4</em>');
+  });
+</script>
+
+<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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..aa09b454b9
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
@@ -0,0 +1,118 @@
+---
+id: bad87fee1348bd9aed908826
+title: Change the CSS of an Element Using jQuery
+challengeType: 6
+forumTopicId: 16776
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: change-the-css-of-an-element-using-jquery
+---
+
+# --description--
+
+We can also change the CSS of an HTML element directly with jQuery.
+
+jQuery has a function called `.css()` that allows you to change the CSS of an element.
+
+Here's how we would change its color to blue:
+
+```js
+$("#target1").css("color", "blue");
+```
+
+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 `document ready function`.
+
+Select `target1` and change its color to red.
+
+# --hints--
+
+Your `target1` element should have red text.
+
+```js
+assert($('#target1').css('color') === 'rgb(255, 0, 0)');
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+    $("#target1").css("color", "red");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/clone-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
new file mode 100644
index 0000000000..9bb02186d5
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
@@ -0,0 +1,121 @@
+---
+id: bad87fee1348bd9aed508826
+title: Clone an Element Using jQuery
+challengeType: 6
+forumTopicId: 16780
+dashedName: 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 `clone()` that makes a copy of an element.
+
+For example, if we wanted to copy `target2` from our `left-well` to our `right-well`, we would use:
+
+```js
+$("#target2").clone().appendTo("#right-well");
+```
+
+Did you notice this involves sticking two jQuery functions together? This is called <dfn>function chaining</dfn> and it's a convenient way to get things done with jQuery.
+
+Clone your `target5` element and append it to your `left-well`.
+
+# --hints--
+
+Your `target5` element should be inside your `right-well`.
+
+```js
+assert($('#right-well').children('#target5').length > 0);
+```
+
+A copy of your `target5` element should also be inside your `left-well`.
+
+```js
+assert($('#left-well').children('#target5').length > 0);
+```
+
+You should only use jQuery to move these elements.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+    $("#target5").clone().appendTo("#left-well");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/delete-your-jquery-functions.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/delete-your-jquery-functions.md
new file mode 100644
index 0000000000..e5d188bff7
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/delete-your-jquery-functions.md
@@ -0,0 +1,124 @@
+---
+id: bad87fee1348bd9aeda08726
+title: Delete Your jQuery Functions
+challengeType: 6
+forumTopicId: 17561
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: delete-your-jquery-functions
+---
+
+# --description--
+
+These animations were cool at first, but now they're getting kind of distracting.
+
+Delete all three of these jQuery functions from your `document ready function`, but leave your `document ready function` itself intact.
+
+# --hints--
+
+All three of your jQuery functions should be deleted from your `document ready function`.
+
+```js
+assert(code.match(/\{\s*\}\);/g));
+```
+
+You should leave your `script` element intact.
+
+```js
+assert(code.match(/<script>/g));
+```
+
+You should leave your `$(document).ready(function() {` at the beginning of your `script` element.
+
+```js
+assert(code.match(/\$\(document\)\.ready\(function\(\)\s?\{/g));
+```
+
+You should leave the `document.ready` function's closing `})` intact.
+
+```js
+assert(code.match(/.*\s*\}\);/g));
+```
+
+You should leave your `script` element closing tag intact.
+
+```js
+assert(
+  code.match(/<\/script>/g) &&
+    code.match(/<script/g) &&
+    code.match(/<\/script>/g).length === code.match(/<script/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/disable-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
new file mode 100644
index 0000000000..07162e70b8
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
@@ -0,0 +1,120 @@
+---
+id: bad87fee1348bd9aed808826
+title: Disable an Element Using jQuery
+challengeType: 6
+forumTopicId: 17563
+dashedName: 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 `.prop()` that allows you to adjust the properties of elements.
+
+Here's how you would disable all buttons:
+
+```js
+$("button").prop("disabled", true);
+```
+
+Disable only the `target1` button.
+
+# --hints--
+
+Your `target1` button should be disabled.
+
+```js
+assert(
+  $('#target1') &&
+    $('#target1').prop('disabled') &&
+    code.match(/["']disabled["'],( true|true)/g)
+);
+```
+
+No other buttons should be disabled.
+
+```js
+assert($('#target2') && !$('#target2').prop('disabled'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/disabled[^<]*>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
new file mode 100644
index 0000000000..3835dfeca8
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
@@ -0,0 +1,118 @@
+---
+id: bad87fee1348bd9acdd08826
+title: Learn How Script Tags and Document Ready Work
+challengeType: 6
+forumTopicId: 18224
+dashedName: 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 `script` element at the top of your page. Be sure to close it on the following line.
+
+Your browser will run any JavaScript inside a `script` element, including jQuery.
+
+Inside your `script` element, add this code: `$(document).ready(function() {` to your `script`. Then close it on the following line (still inside your `script` element) with: `});`
+
+We'll learn more about `functions` later. The important thing to know is that code you put inside this `function` will run as soon as your browser has loaded your page.
+
+This is important because without your `document ready function`, your code may run before your HTML is rendered, which would cause bugs.
+
+# --hints--
+
+You should create a `script` element making sure it is valid and has a closing tag.
+
+```js
+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
+);
+```
+
+You should add `$(document).ready(function() {` to the beginning of your `script` element.
+
+```js
+assert(
+  code.match(
+    /\$\s*?\(\s*?document\s*?\)\.ready\s*?\(\s*?function\s*?\(\s*?\)\s*?\{/g
+  )
+);
+```
+
+You should close your `$(document).ready(function() {` function with `});`
+
+```js
+assert(code.match(/\n*?\s*?\}\s*?\);/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+  });
+</script>
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
new file mode 100644
index 0000000000..94c5908436
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
@@ -0,0 +1,109 @@
+---
+id: bad87fee1348bd9aed708826
+title: Remove an Element Using jQuery
+challengeType: 6
+forumTopicId: 18262
+dashedName: remove-an-element-using-jquery
+---
+
+# --description--
+
+Now let's remove an HTML element from your page using jQuery.
+
+jQuery has a function called `.remove()` that will remove an HTML element entirely
+
+Remove the `#target4` element from the page by using the `.remove()` function.
+
+# --hints--
+
+You should use jQuery to remove your `target4` element from your page.
+
+```js
+assert(
+  $('#target4').length === 0 && code.match(/\$\(["']#target4["']\).remove\(\)/g)
+);
+```
+
+You should only use jQuery to remove this element.
+
+```js
+assert(
+  code.match(/id="target4/g) &&
+    !code.match(/<!--.*id="target4".*-->/g) &&
+    $('#right-well').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
new file mode 100644
index 0000000000..7df3b8052f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
@@ -0,0 +1,121 @@
+---
+id: bad87fee1348bd9aed918626
+title: Remove Classes from an Element with jQuery
+challengeType: 6
+forumTopicId: 18264
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: remove-classes-from-an-element-with-jquery
+---
+
+# --description--
+
+In the same way you can add classes to an element with jQuery's `addClass()` function, you can remove them with jQuery's `removeClass()` function.
+
+Here's how you would do this for a specific button:
+
+```js
+$("#target2").removeClass("btn-default");
+```
+
+Let's remove the `btn-default` class from all of our `button` elements.
+
+# --hints--
+
+The `btn-default` class should be removed from all of your `button` elements.
+
+```js
+assert($('.btn-default').length === 0);
+```
+
+You should only use jQuery to remove this class from the element.
+
+```js
+assert(code.match(/btn btn-default/g));
+```
+
+You should only remove the `btn-default` class.
+
+```js
+assert(
+  code.match(
+    /\.[\v\s]*removeClass[\s\v]*\([\s\v]*('|")\s*btn-default\s*('|")[\s\v]*\)/gm
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..0e082e179f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
@@ -0,0 +1,143 @@
+---
+id: bad87fee1348bd9aed108826
+title: Target a Specific Child of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18315
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-a-specific-child-of-an-element-using-jquery
+---
+
+# --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 `target:nth-child(n)` 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:
+
+```js
+$(".target:nth-child(3)").addClass("animated bounce");
+```
+
+Make the second child in each of your well elements bounce. You must select the elements' children with the `target` class.
+
+# --hints--
+
+The second element in your `target` elements should bounce.
+
+```js
+assert(
+  $('.target:nth-child(2)').hasClass('animated') &&
+    $('.target:nth-child(2)').hasClass('bounce')
+);
+```
+
+Only two elements should bounce.
+
+```js
+assert($('.animated.bounce').length === 2);
+```
+
+You should use the `:nth-child()` selector to modify these elements.
+
+```js
+assert(code.match(/\:nth-child\(/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+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)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+    $(".target:nth-child(2)").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
new file mode 100644
index 0000000000..525a6106cf
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
@@ -0,0 +1,112 @@
+---
+id: bad87fee1348bd9aedc08826
+title: Target Elements by Class Using jQuery
+challengeType: 6
+forumTopicId: 18316
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-elements-by-class-using-jquery
+---
+
+# --description--
+
+You see how we made all of your `button` elements bounce? We selected them with `$("button")`, then we added some CSS classes to them with `.addClass("animated bounce");`.
+
+You just used jQuery's `.addClass()` function, which allows you to add classes to elements.
+
+First, let's target your `div` elements with the class `well` by using the `$(".well")` selector.
+
+Note that, just like with CSS declarations, you type a `.` before the class's name.
+
+Then use jQuery's `.addClass()` function to add the classes `animated` and `shake`.
+
+For example, you could make all the elements with the class `text-primary` shake by adding the following to your `document ready function`:
+
+```js
+$(".text-primary").addClass("animated shake");
+```
+
+# --hints--
+
+You should use the jQuery `addClass()` function to give the classes `animated` and `shake` to all your elements with the class `well`.
+
+```js
+assert($('.well').hasClass('animated') && $('.well').hasClass('shake'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class\.\*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
new file mode 100644
index 0000000000..e63f60b4e5
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
@@ -0,0 +1,122 @@
+---
+id: bad87fee1348bd9aeda08826
+title: Target Elements by id Using jQuery
+challengeType: 6
+forumTopicId: 18317
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-elements-by-id-using-jquery
+---
+
+# --description--
+
+You can also target elements by their id attributes.
+
+First target your `button` element with the id `target3` by using the `$("#target3")` selector.
+
+Note that, just like with CSS declarations, you type a `#` before the id's name.
+
+Then use jQuery's `.addClass()` function to add the classes `animated` and `fadeOut`.
+
+Here's how you'd make the `button` element with the id `target6` fade out:
+
+```js
+$("#target6").addClass("animated fadeOut");
+```
+
+# --hints--
+
+You should select the `button` element with the `id` of `target3` and use the jQuery `addClass()` function to give it the class of `animated`.
+
+```js
+assert($('#target3').hasClass('animated'));
+```
+
+You should target the element with the id `target3` and use the jQuery `addClass()` function to give it the class `fadeOut`.
+
+```js
+assert(
+  ($('#target3').hasClass('fadeOut') || $('#target3').hasClass('fadeout')) &&
+    code.match(/\$\(\s*.#target3.\s*\)/g)
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-even-elements-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
new file mode 100644
index 0000000000..d89318eb3e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
@@ -0,0 +1,138 @@
+---
+id: bad87fee1348bd9aed008826
+title: Target Even Elements Using jQuery
+challengeType: 6
+forumTopicId: 18318
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-even-elements-using-jquery
+---
+
+# --description--
+
+You can also target elements based on their positions using `:odd` or `:even` 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, `:odd` 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 `target` and give them classes:
+
+```js
+$(".target:odd").addClass("animated shake");
+```
+
+Try selecting all the even `target` elements and giving them the classes of `animated` and `shake`. Remember that **even** refers to the position of elements with a zero-based system in mind.
+
+# --hints--
+
+All of the `target` elements that jQuery considers to be even should shake.
+
+```js
+assert(
+  $('.target:even').hasClass('animated') && $('.target:even').hasClass('shake')
+);
+```
+
+You should use the `:even` selector to modify these elements.
+
+```js
+assert(code.match(/\:even/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(
+  code.match(/\$\(".target:even"\)/g) ||
+    code.match(/\$\('.target:even'\)/g) ||
+    code.match(/\$\(".target"\).filter\(":even"\)/g) ||
+    code.match(/\$\('.target'\).filter\(':even'\)/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
new file mode 100644
index 0000000000..5b45498d38
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9bedc08826
+title: Target HTML Elements with Selectors Using jQuery
+challengeType: 6
+forumTopicId: 18319
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-html-elements-with-selectors-using-jquery
+---
+
+# --description--
+
+Now we have a `document ready function`.
+
+Now let's write our first jQuery statement. All jQuery functions start with a `$`, usually referred to as a dollar sign operator, or as bling.
+
+jQuery often selects an HTML element with a <dfn>selector</dfn>, then does something to that element.
+
+For example, let's make all of your `button` elements bounce. Just add this code inside your document ready function:
+
+```js
+$("button").addClass("animated bounce");
+```
+
+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 `bounce` class to your `button` elements.
+
+# --hints--
+
+You should use the jQuery `addClass()` function to give the classes `animated` and `bounce` to your `button` elements.
+
+```js
+assert($('button').hasClass('animated') && $('button').hasClass('bounce'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+Your jQuery code should be within the `$(document).ready();` function.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/\$\(document\)\.ready\(function\(\)\{\$/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..5b75dd072b
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
@@ -0,0 +1,125 @@
+---
+id: bad87fee1348bd9aed208826
+title: Target the Children of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18320
+dashedName: target-the-children-of-an-element-using-jquery
+---
+
+# --description--
+
+When HTML elements are placed one level below another they are called <dfn>children</dfn> of that element. For example, the button elements in this challenge with the text `#target1`, `#target2`, and `#target3` are all children of the `<div class="well" id="left-well">` element.
+
+jQuery has a function called `children()` that allows you to access the children of whichever element you've selected.
+
+Here's an example of how you would use the `children()` function to give the children of your `left-well` element the color `blue`:
+
+```js
+$("#left-well").children().css("color", "blue")
+```
+
+# --instructions--
+
+Give all the children of your `right-well` element the color orange.
+
+# --hints--
+
+All children of `#right-well` should have orange text.
+
+```js
+assert($('#right-well').children().css('color') === 'rgb(255, 165, 0)');
+```
+
+You should use the `children()` function to modify these elements.
+
+```js
+assert(code.match(/\.children\(\)\.css/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(code.match(/<div class="well" id="right-well">/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..48985e399e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
@@ -0,0 +1,140 @@
+---
+id: bad87fee1348bd9aed308826
+title: Target the Parent of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18321
+dashedName: target-the-parent-of-an-element-using-jquery
+---
+
+# --description--
+
+Every HTML element has a `parent` element from which it `inherits` properties.
+
+For example, your `jQuery Playground` `h3` element has the parent element of `<div class="container-fluid">`, which itself has the parent `body`.
+
+jQuery has a function called `parent()` that allows you to access the parent of whichever element you've selected.
+
+Here's an example of how you would use the `parent()` function if you wanted to give the parent element of the `left-well` element a background color of blue:
+
+```js
+$("#left-well").parent().css("background-color", "blue")
+```
+
+Give the parent of the `#target1` element a background-color of red.
+
+# --hints--
+
+Your `left-well` element should have a red background.
+
+```js
+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'
+);
+```
+
+You should use the `.parent()` function to modify this element.
+
+```js
+assert(code.match(/\.parent\s*\(\s*\)\s*\.css/g));
+```
+
+The `.parent()` method should be called on the `#target1` element.
+
+```js
+assert(
+  code.match(/\$\s*?\(\s*?(?:'|")\s*?#target1\s*?(?:'|")\s*?\)\s*?\.parent/gi)
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(code.match(/<div class="well" id="left-well">/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+    $("#target5").clone().appendTo("#left-well");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
new file mode 100644
index 0000000000..65e25dbc54
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
@@ -0,0 +1,142 @@
+---
+id: bad87fee1348bd9aed908626
+title: Target the Same Element with Multiple jQuery Selectors
+challengeType: 6
+forumTopicId: 18322
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-the-same-element-with-multiple-jquery-selectors
+---
+
+# --description--
+
+Now you know three ways of targeting elements: by type: `$("button")`, by class: `$(".btn")`, and by id `$("#target1")`.
+
+Although it is possible to add multiple classes in a single `.addClass()` call, let's add them to the same element in *three separate ways*.
+
+Using `.addClass()`, add only one class at a time to the same element, three different ways:
+
+Add the `animated` class to all elements with type `button`.
+
+Add the `shake` class to all the buttons with class `.btn`.
+
+Add the `btn-primary` class to the button with id `#target1`.
+
+**Note:** 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 `shake`, `animated`, and `btn-primary` to `#target1`.
+
+# --hints--
+
+Your code should use the `$("button")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?button\s*?(?:'|")/gi));
+```
+
+Your code should use the `$(".btn")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?\.btn\s*?(?:'|")/gi));
+```
+
+Your code should use the `$("#target1")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?#target1\s*?(?:'|")/gi));
+```
+
+You should only add one class with each of your three selectors.
+
+```js
+assert(
+  code.match(/addClass/g) &&
+    code.match(/addClass\s*?\(\s*?('|")\s*?[\w-]+\s*?\1\s*?\)/g).length > 2
+);
+```
+
+Your `#target1` element should have the classes `animated`‚ `shake` and `btn-primary`.
+
+```js
+assert(
+  $('#target1').hasClass('animated') &&
+    $('#target1').hasClass('shake') &&
+    $('#target1').hasClass('btn-primary')
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated");
+    $(".btn").addClass("shake");
+    $("#target1").addClass("btn-primary");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
new file mode 100644
index 0000000000..5b0f8ef1fe
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9aed608826
+title: Use appendTo to Move Elements with jQuery
+challengeType: 6
+forumTopicId: 18340
+dashedName: use-appendto-to-move-elements-with-jquery
+---
+
+# --description--
+
+Now let's try moving elements from one `div` to another.
+
+jQuery has a function called `appendTo()` that allows you to select HTML elements and append them to another element.
+
+For example, if we wanted to move `target4` from our right well to our left well, we would use:
+
+```js
+$("#target4").appendTo("#left-well");
+```
+
+Move your `target2` element from your `left-well` to your `right-well`.
+
+# --hints--
+
+Your `target2` element should not be inside your `left-well`.
+
+```js
+assert($('#left-well').children('#target2').length === 0);
+```
+
+Your `target2` element should be inside your `right-well`.
+
+```js
+assert($('#right-well').children('#target2').length > 0);
+```
+
+You should only use jQuery to move these elements.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md b/curriculum/challenges/italian/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
new file mode 100644
index 0000000000..4123f59226
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9aecb08826
+title: Use jQuery to Modify the Entire Page
+challengeType: 6
+forumTopicId: 18361
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: use-jquery-to-modify-the-entire-page
+---
+
+# --description--
+
+We're done playing with our jQuery playground. Let's tear it down!
+
+jQuery can target the `body` element as well.
+
+Here's how we would make the entire body fade out: `$("body").addClass("animated fadeOut");`
+
+But let's do something more dramatic. Add the classes `animated` and `hinge` to your `body` element.
+
+# --hints--
+
+You should add the classes `animated` and `hinge` to your `body` element.
+
+```js
+assert($('body').hasClass('animated') && $('body').hasClass('hinge'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+    $("body").addClass("animated hinge");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-react.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
new file mode 100644
index 0000000000..b016ed7ef1
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
@@ -0,0 +1,156 @@
+---
+id: 5a24c314108439a4d4036147
+title: Connect Redux to React
+challengeType: 6
+forumTopicId: 301426
+dashedName: connect-redux-to-react
+---
+
+# --description--
+
+Now that you've written both the `mapStateToProps()` and the `mapDispatchToProps()` functions, you can use them to map `state` and `dispatch` to the `props` of one of your React components. The `connect` method from React Redux can handle this task. This method takes two optional arguments, `mapStateToProps()` and `mapDispatchToProps()`. They are optional because you may have a component that only needs access to `state` but doesn't need to dispatch any actions, or vice versa.
+
+To use this method, pass in the functions as arguments, and immediately call the result with your component. This syntax is a little unusual and looks like:
+
+```js
+connect(mapStateToProps, mapDispatchToProps)(MyComponent)
+```
+
+**Note:** If you want to omit one of the arguments to the `connect` method, you pass `null` in its place.
+
+# --instructions--
+
+The code editor has the `mapStateToProps()` and `mapDispatchToProps()` functions and a new React component called `Presentational`. Connect this component to Redux with the `connect` method from the `ReactRedux` global object, and call it immediately on the `Presentational` component. Assign the result to a new `const` called `ConnectedComponent` that represents the connected component. That's it, now you're connected to Redux! Try changing either of `connect`'s arguments to `null` and observe the test results.
+
+# --hints--
+
+The `Presentational` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should receive a prop `messages` via `connect`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const props = mockedComponent.find('Presentational').props();
+    return props.messages === '__INITIAL__STATE__';
+  })()
+);
+```
+
+The `Presentational` component should receive a prop `submitNewMessage` via `connect`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const props = mockedComponent.find('Presentational').props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+const store = Redux.createStore(
+  (state = '__INITIAL__STATE__', action) => state
+);
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <ReactRedux.Provider store = {store}>
+        <ConnectedComponent/>
+      </ReactRedux.Provider>
+    );
+  }
+};
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message));
+    }
+  }
+};
+
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h3>This is a Presentational Component</h3>
+  }
+};
+
+const connect = ReactRedux.connect;
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message));
+    }
+  }
+};
+
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h3>This is a Presentational Component</h3>
+  }
+};
+
+const connect = ReactRedux.connect;
+// Change code below this line
+
+const ConnectedComponent = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
new file mode 100644
index 0000000000..ce25f89ba6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
@@ -0,0 +1,300 @@
+---
+id: 5a24c314108439a4d4036148
+title: Connect Redux to the Messages App
+challengeType: 6
+forumTopicId: 301427
+dashedName: connect-redux-to-the-messages-app
+---
+
+# --description--
+
+Now that you understand how to use `connect` to connect React to Redux, you can apply what you've learned to your React component that handles messages.
+
+In the last lesson, the component you connected to Redux was named `Presentational`, and this wasn't arbitrary. This term *generally* refers to React components that are not directly connected to Redux. They are simply responsible for the presentation of UI and do this as a function of the props they receive. By contrast, container components are connected to Redux. These are typically responsible for dispatching actions to the store and often pass store state to child components as props.
+
+# --instructions--
+
+The code editor has all the code you've written in this section so far. The only change is that the React component is renamed to `Presentational`. Create a new component held in a constant called `Container` that uses `connect` to connect the `Presentational` component to Redux. Then, in the `AppWrapper`, render the React Redux `Provider` component. Pass `Provider` the Redux `store` as a prop and render `Container` as a child. Once everything is setup, you will see the messages app rendered to the page again.
+
+# --hints--
+
+The `AppWrapper` should render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render to page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render an `h2`, `input`, `button`, and `ul` elements.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    return (
+      PresentationalComponent.find('div').length === 1 &&
+      PresentationalComponent.find('h2').length === 1 &&
+      PresentationalComponent.find('button').length === 1 &&
+      PresentationalComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+The `Presentational` component should receive `messages` from the Redux store as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return Array.isArray(props.messages);
+  })()
+);
+```
+
+The `Presentational` component should receive the `submitMessage` action creator as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+// React-Redux:
+const mapStateToProps = (state) => {
+  return { messages: state }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (newMessage) => {
+       dispatch(addMessage(newMessage))
+    }
+  }
+};
+
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Define the Container component here:
+
+
+class AppWrapper extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Complete the return statement:
+    return (null);
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+// React-Redux:
+const mapStateToProps = (state) => {
+  return { messages: state }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (newMessage) => {
+       dispatch(addMessage(newMessage))
+    }
+  }
+};
+
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
new file mode 100644
index 0000000000..b1c4581f2e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
@@ -0,0 +1,397 @@
+---
+id: 5a24c314108439a4d4036149
+title: Extract Local State into Redux
+challengeType: 6
+forumTopicId: 301428
+dashedName: extract-local-state-into-redux
+---
+
+# --description--
+
+You're almost done! Recall that you wrote all the Redux code so that Redux could control the state management of your React messages app. Now that Redux is connected, you need to extract the state management out of the `Presentational` component and into Redux. Currently, you have Redux connected, but you are handling the state locally within the `Presentational` component.
+
+# --instructions--
+
+In the `Presentational` component, first, remove the `messages` property in the local `state`. These messages will be managed by Redux. Next, modify the `submitMessage()` method so that it dispatches `submitNewMessage()` from `this.props`, and pass in the current message input from local `state` as an argument. Because you removed `messages` from local state, remove the `messages` property from the call to `this.setState()` here as well. Finally, modify the `render()` method so that it maps over the messages received from `props` rather than `state`.
+
+Once these changes are made, the app will continue to function the same, except Redux manages the state. This example also illustrates how a component may have local `state`: your component still tracks user input locally in its own `state`. You can see how Redux provides a useful state management framework on top of React. You achieved the same result using only React's local state at first, and this is usually possible with simple apps. However, as your apps become larger and more complex, so does your state management, and this is the problem Redux solves.
+
+# --hints--
+
+The `AppWrapper` should render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render to page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render an `h2`, `input`, `button`, and `ul` elements.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    return (
+      PresentationalComponent.find('div').length === 1 &&
+      PresentationalComponent.find('h2').length === 1 &&
+      PresentationalComponent.find('button').length === 1 &&
+      PresentationalComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+The `Presentational` component should receive `messages` from the Redux store as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return Array.isArray(props.messages);
+  })()
+);
+```
+
+The `Presentational` component should receive the `submitMessage` action creator as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+The state of the `Presentational` component should contain one property, `input`, which is initialized to an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalState = mockedComponent
+      .find('Presentational')
+      .instance().state;
+    return (
+      typeof PresentationalState.input === 'string' &&
+      Object.keys(PresentationalState).length === 1
+    );
+  })()
+);
+```
+
+Typing in the `input` element should update the state of the `Presentational` component.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const testValue = '__MOCK__INPUT__';
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  let initialInput = mockedComponent.find('Presentational').find('input');
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await changed();
+  const updatedInput = updated.find('Presentational').find('input');
+  assert(
+    initialInput.props().value === '' &&
+      updatedInput.props().value === '__MOCK__INPUT__'
+  );
+};
+```
+
+Dispatching the `submitMessage` on the `Presentational` component should update Redux store and clear the input in local state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  let beforeProps = mockedComponent.find('Presentational').props();
+  const testValue = '__TEST__EVENT__INPUT__';
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const clickButton = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterChange = await changed();
+  const afterChangeInput = afterChange.find('input').props().value;
+  const afterClick = await clickButton();
+  const afterProps = mockedComponent.find('Presentational').props();
+  assert(
+    beforeProps.messages.length === 0 &&
+      afterChangeInput === testValue &&
+      afterProps.messages.pop() === testValue &&
+      afterClick.find('input').props().value === ''
+  );
+};
+```
+
+The `Presentational` component should render the `messages` from the Redux store.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  let beforeProps = mockedComponent.find('Presentational').props();
+  const testValue = '__TEST__EVENT__INPUT__';
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const clickButton = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterChange = await changed();
+  const afterChangeInput = afterChange.find('input').props().value;
+  const afterClick = await clickButton();
+  const afterProps = mockedComponent.find('Presentational').props();
+  assert(
+    beforeProps.messages.length === 0 &&
+      afterChangeInput === testValue &&
+      afterProps.messages.pop() === testValue &&
+      afterClick.find('input').props().value === '' &&
+      afterClick.find('ul').childAt(0).text() === testValue
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Change code below this line
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => ({
+      input: '',
+      messages: state.messages.concat(state.input)
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+// Change code above this line
+
+const mapStateToProps = (state) => {
+  return {messages: state}
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message))
+    }
+  }
+};
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Change code below this line
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.props.submitNewMessage(this.state.input);
+    this.setState({
+      input: ''
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.props.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+// Change code above this line
+
+const mapStateToProps = (state) => {
+  return {messages: state}
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message))
+    }
+  }
+};
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
new file mode 100644
index 0000000000..6718ed802e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
@@ -0,0 +1,115 @@
+---
+id: 5a24c314108439a4d4036143
+title: Extract State Logic to Redux
+challengeType: 6
+forumTopicId: 301429
+dashedName: extract-state-logic-to-redux
+---
+
+# --description--
+
+Now that you finished the React component, you need to move the logic it's performing locally in its `state` into Redux. This is the first step to connect the simple React app to Redux. The only functionality your app has is to add new messages from the user to an unordered list. The example is simple in order to demonstrate how React and Redux work together.
+
+# --instructions--
+
+First, define an action type `ADD` and set it to a const `ADD`. Next, define an action creator `addMessage()` which creates the action to add a message. You'll need to pass a `message` to this action creator and include the message in the returned `action`.
+
+Then create a reducer called `messageReducer()` that handles the state for the messages. The initial state should equal an empty array. This reducer should add a message to the array of messages held in state, or return the current state. Finally, create your Redux store and pass it the reducer.
+
+# --hints--
+
+The const `ADD` should exist and hold a value equal to the string `ADD`
+
+```js
+assert(ADD === 'ADD');
+```
+
+The action creator `addMessage` should return an object with `type` equal to `ADD` and `message` equal to the message that is passed in.
+
+```js
+assert(
+  (function () {
+    const addAction = addMessage('__TEST__MESSAGE__');
+    return addAction.type === ADD && addAction.message === '__TEST__MESSAGE__';
+  })()
+);
+```
+
+`messageReducer` should be a function.
+
+```js
+assert(typeof messageReducer === 'function');
+```
+
+The store should exist and have an initial state set to an empty array.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return typeof store === 'object' && initialState.length === 0;
+  })()
+);
+```
+
+Dispatching `addMessage` against the store should immutably add a new message to the array of messages held in state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addMessage('__A__TEST__MESSAGE'));
+    const addState = store.getState();
+    return isFrozen && addState[0] === '__A__TEST__MESSAGE';
+  })()
+);
+```
+
+The `messageReducer` should return the current state if called with any other actions.
+
+```js
+assert(
+  (function () {
+    const addState = store.getState();
+    store.dispatch({ type: 'FAKE_ACTION' });
+    const testState = store.getState();
+    return addState === testState;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+// Define ADD, addMessage(), messageReducer(), and store here:
+```
+
+# --solutions--
+
+```jsx
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
new file mode 100644
index 0000000000..8bf764191f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036141
+title: Getting Started with React Redux
+challengeType: 6
+forumTopicId: 301430
+dashedName: getting-started-with-react-redux
+---
+
+# --description--
+
+This series of challenges introduces how to use Redux with React. First, here's a review of some of the key principles of each technology. React is a view library that you provide with data, then it renders the view in an efficient, predictable way. Redux is a state management framework that you can use to simplify the management of your application's state. Typically, in a React Redux app, you create a single Redux store that manages the state of your entire app. Your React components subscribe to only the pieces of data in the store that are relevant to their role. Then, you dispatch actions directly from React components, which then trigger store updates.
+
+Although React components can manage their own state locally, when you have a complex app, it's generally better to keep the app state in a single location with Redux. There are exceptions when individual components may have local state specific only to them. Finally, because Redux is not designed to work with React out of the box, you need to use the `react-redux` package. It provides a way for you to pass Redux `state` and `dispatch` to your React components as `props`.
+
+Over the next few challenges, first, you'll create a simple React component which allows you to input new text messages. These are added to an array that's displayed in the view. This should be a nice review of what you learned in the React lessons. Next, you'll create a Redux store and actions that manage the state of the messages array. Finally, you'll use `react-redux` to connect the Redux store with your component, thereby extracting the local state into the Redux store.
+
+# --instructions--
+
+Start with a `DisplayMessages` component. Add a constructor to this component and initialize it with a state that has two properties: `input`, that's set to an empty string, and `messages`, that's set to an empty array.
+
+# --hints--
+
+The `DisplayMessages` component should render an empty `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    return mockedComponent.find('div').text() === '';
+  })()
+);
+```
+
+The `DisplayMessages` constructor should be called properly with `super`, passing in `props`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        noWhiteSpace.includes('constructor(props)') &&
+        noWhiteSpace.includes('super(props')
+      );
+    })()
+  );
+```
+
+The `DisplayMessages` component should have an initial state equal to `{input: "", messages: []}`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' &&
+      initialState.input === '' &&
+      Array.isArray(initialState.messages) &&
+      initialState.messages.length === 0
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<DisplayMessages />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class DisplayMessages extends React.Component {
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return <div />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+  }
+  render() {
+    return <div/>
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/manage-state-locally-first.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
new file mode 100644
index 0000000000..ec7c618f3d
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
@@ -0,0 +1,260 @@
+---
+id: 5a24c314108439a4d4036142
+title: Manage State Locally First
+challengeType: 6
+forumTopicId: 301431
+dashedName: manage-state-locally-first
+---
+
+# --description--
+
+Here you'll finish creating the `DisplayMessages` component.
+
+# --instructions--
+
+First, in the `render()` method, have the component render an `input` element, `button` element, and `ul` element. When the `input` element changes, it should trigger a `handleChange()` method. Also, the `input` element should render the value of `input` that's in the component's state. The `button` element should trigger a `submitMessage()` method when it's clicked.
+
+Second, write these two methods. The `handleChange()` method should update the `input` with what the user is typing. The `submitMessage()` method should concatenate the current message (stored in `input`) to the `messages` array in local state, and clear the value of the `input`.
+
+Finally, use the `ul` to map over the array of `messages` and render it to the screen as a list of `li` elements.
+
+# --hints--
+
+The `DisplayMessages` component should initialize with a state equal to `{ input: "", messages: [] }`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' &&
+      initialState.input === '' &&
+      initialState.messages.length === 0
+    );
+  })()
+);
+```
+
+The `DisplayMessages` component should render a `div` containing an `h2` element, a `button` element, a `ul` element, and `li` elements as children.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const state = () => {
+    mockedComponent.setState({ messages: ['__TEST__MESSAGE'] });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('h2').length === 1 &&
+      updated.find('button').length === 1 &&
+      updated.find('ul').length === 1 &&
+      updated.find('li').length > 0
+  );
+};
+```
+
+`.map` should be used on the `messages` array.
+
+```js
+assert(code.match(/this\.state\.messages\.map/g));
+```
+
+The `input` element should render the value of `input` in local state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const testValue = '__TEST__EVENT__INPUT';
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await changed();
+  assert(updated.find('input').props().value === testValue);
+};
+```
+
+Calling the method `handleChange` should update the `input` value in state to the current input.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage = '__TEST__EVENT__MESSAGE__';
+  const changed = () => {
+    causeChange(mockedComponent, testMessage);
+    return waitForIt(() => mockedComponent);
+  };
+  const afterInput = await changed();
+  assert(
+    initialState.input === '' &&
+      afterInput.state().input === '__TEST__EVENT__MESSAGE__'
+  );
+};
+```
+
+Clicking the `Add message` button should call the method `submitMessage` which should add the current `input` to the `messages` array in state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage_1 = '__FIRST__MESSAGE__';
+  const firstChange = () => {
+    causeChange(mockedComponent, testMessage_1);
+    return waitForIt(() => mockedComponent);
+  };
+  const firstResult = await firstChange();
+  const firstSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit_1 = await firstSubmit();
+  const submitState_1 = afterSubmit_1.state();
+  const testMessage_2 = '__SECOND__MESSAGE__';
+  const secondChange = () => {
+    causeChange(mockedComponent, testMessage_2);
+    return waitForIt(() => mockedComponent);
+  };
+  const secondResult = await secondChange();
+  const secondSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit_2 = await secondSubmit();
+  const submitState_2 = afterSubmit_2.state();
+  assert(
+    initialState.messages.length === 0 &&
+      submitState_1.messages.length === 1 &&
+      submitState_2.messages.length === 2 &&
+      submitState_2.messages[1] === testMessage_2
+  );
+};
+```
+
+The `submitMessage` method should clear the current input.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage = '__FIRST__MESSAGE__';
+  const firstChange = () => {
+    causeChange(mockedComponent, testMessage);
+    return waitForIt(() => mockedComponent);
+  };
+  const firstResult = await firstChange();
+  const firstState = firstResult.state();
+  const firstSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit = await firstSubmit();
+  const submitState = afterSubmit.state();
+  assert(firstState.input === testMessage && submitState.input === '');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<DisplayMessages />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+  }
+  // Add handleChange() and submitMessage() methods here
+
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        { /* Render an input, button, and ul below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+   this.submitMessage = this.submitMessage.bind(this);
+ }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };  
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
new file mode 100644
index 0000000000..72dae912c2
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
@@ -0,0 +1,107 @@
+---
+id: 5a24c314108439a4d4036146
+title: Map Dispatch to Props
+challengeType: 6
+forumTopicId: 301432
+dashedName: map-dispatch-to-props
+---
+
+# --description--
+
+The `mapDispatchToProps()` function is used to provide specific action creators to your React components so they can dispatch actions against the Redux store. It's similar in structure to the `mapStateToProps()` function you wrote in the last challenge. It returns an object that maps dispatch actions to property names, which become component `props`. However, instead of returning a piece of `state`, each property returns a function that calls `dispatch` with an action creator and any relevant action data. You have access to this `dispatch` because it's passed in to `mapDispatchToProps()` as a parameter when you define the function, just like you passed `state` to `mapStateToProps()`. Behind the scenes, React Redux is using Redux's `store.dispatch()` to conduct these dispatches with `mapDispatchToProps()`. This is similar to how it uses `store.subscribe()` for components that are mapped to `state`.
+
+For example, you have a `loginUser()` action creator that takes a `username` as an action payload. The object returned from `mapDispatchToProps()` for this action creator would look something like:
+
+```jsx
+{
+  submitLoginUser: function(username) {
+    dispatch(loginUser(username));
+  }
+}
+```
+
+# --instructions--
+
+The code editor provides an action creator called `addMessage()`. Write the function `mapDispatchToProps()` that takes `dispatch` as an argument, then returns an object. The object should have a property `submitNewMessage` set to the dispatch function, which takes a parameter for the new message to add when it dispatches `addMessage()`.
+
+# --hints--
+
+`addMessage` should return an object with keys `type` and `message`.
+
+```js
+assert(
+  (function () {
+    const addMessageTest = addMessage();
+    return (
+      addMessageTest.hasOwnProperty('type') &&
+      addMessageTest.hasOwnProperty('message')
+    );
+  })()
+);
+```
+
+`mapDispatchToProps` should be a function.
+
+```js
+assert(typeof mapDispatchToProps === 'function');
+```
+
+`mapDispatchToProps` should return an object.
+
+```js
+assert(typeof mapDispatchToProps() === 'object');
+```
+
+Dispatching `addMessage` with `submitNewMessage` from `mapDispatchToProps` should return a message to the dispatch function.
+
+```js
+assert(
+  (function () {
+    let testAction;
+    const dispatch = (fn) => {
+      testAction = fn;
+    };
+    let dispatchFn = mapDispatchToProps(dispatch);
+    dispatchFn.submitNewMessage('__TEST__MESSAGE__');
+    return (
+      testAction.type === 'ADD' && testAction.message === '__TEST__MESSAGE__'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+// Change code below this line
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: function(message) {
+      dispatch(addMessage(message));
+    }
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-state-to-props.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-state-to-props.md
new file mode 100644
index 0000000000..e75b1fb34c
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/map-state-to-props.md
@@ -0,0 +1,69 @@
+---
+id: 5a24c314108439a4d4036145
+title: Map State to Props
+challengeType: 6
+forumTopicId: 301433
+dashedName: map-state-to-props
+---
+
+# --description--
+
+The `Provider` component allows you to provide `state` and `dispatch` to your React components, but you must specify exactly what state and actions you want. This way, you make sure that each component only has access to the state it needs. You accomplish this by creating two functions: `mapStateToProps()` and `mapDispatchToProps()`.
+
+In these functions, you declare what pieces of state you want to have access to and which action creators you need to be able to dispatch. Once these functions are in place, you'll see how to use the React Redux `connect` method to connect them to your components in another challenge.
+
+**Note:** Behind the scenes, React Redux uses the `store.subscribe()` method to implement `mapStateToProps()`.
+
+# --instructions--
+
+Create a function `mapStateToProps()`. This function should take `state` as an argument, then return an object which maps that state to specific property names. These properties will become accessible to your component via `props`. Since this example keeps the entire state of the app in a single array, you can pass that entire state to your component. Create a property `messages` in the object that's being returned, and set it to `state`.
+
+# --hints--
+
+The const `state` should be an empty array.
+
+```js
+assert(Array.isArray(state) && state.length === 0);
+```
+
+`mapStateToProps` should be a function.
+
+```js
+assert(typeof mapStateToProps === 'function');
+```
+
+`mapStateToProps` should return an object.
+
+```js
+assert(typeof mapStateToProps() === 'object');
+```
+
+Passing an array as state to `mapStateToProps` should return this array assigned to a key of `messages`.
+
+```js
+assert(mapStateToProps(['messages']).messages.pop() === 'messages');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const state = [];
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const state = [];
+
+// Change code below this line
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/moving-forward-from-here.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
new file mode 100644
index 0000000000..b7921af1cc
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
@@ -0,0 +1,69 @@
+---
+id: 5a24c314108439a4d403614a
+title: Moving Forward From Here
+challengeType: 6
+forumTopicId: 301434
+dashedName: moving-forward-from-here
+---
+
+# --description--
+
+Congratulations! You finished the lessons on React and Redux. There's one last item worth pointing out before you move on. Typically, you won't write React apps in a code editor like this. This challenge gives you a glimpse of what the syntax looks like if you're working with npm and a file system on your own machine. The code should look similar, except for the use of `import` statements (these pull in all of the dependencies that have been provided for you in the challenges). The "Managing Packages with npm" section covers npm in more detail.
+
+Finally, writing React and Redux code generally requires some configuration. This can get complicated quickly. If you are interested in experimenting on your own machine, the <a href="https://github.com/facebookincubator/create-react-app" target="_blank" rel="nofollow">Create React App</a> comes configured and ready to go.
+
+Alternatively, you can enable Babel as a JavaScript Preprocessor in CodePen, add React and ReactDOM as external JavaScript resources, and work there as well.
+
+# --instructions--
+
+Log the message `'Now I know React and Redux!'` to the console.
+
+# --hints--
+
+The message `Now I know React and Redux!` should be logged to the console.
+
+```js
+(getUserInput) =>
+  assert(
+    /console\s*\.\s*log\s*\(\s*('|"|`)Now I know React and Redux!\1\s*\)/.test(
+      getUserInput('index')
+    )
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+/*
+import React from 'react'
+import ReactDOM from 'react-dom'
+import { Provider, connect } from 'react-redux'
+import { createStore, combineReducers, applyMiddleware } from 'redux'
+import thunk from 'redux-thunk'
+
+import rootReducer from './redux/reducers'
+import App from './components/App'
+
+const store = createStore(
+  rootReducer,
+  applyMiddleware(thunk)
+);
+
+ReactDOM.render(
+  <Provider store={store}>
+    <App/>
+  </Provider>,
+  document.getElementById('root')
+);
+*/
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```jsx
+console.log('Now I know React and Redux!');
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
new file mode 100644
index 0000000000..dfef55cdd2
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
@@ -0,0 +1,263 @@
+---
+id: 5a24c314108439a4d4036144
+title: Use Provider to Connect Redux to React
+challengeType: 6
+forumTopicId: 301435
+dashedName: use-provider-to-connect-redux-to-react
+---
+
+# --description--
+
+In the last challenge, you created a Redux store to handle the messages array and created an action for adding new messages. The next step is to provide React access to the Redux store and the actions it needs to dispatch updates. React Redux provides its `react-redux` package to help accomplish these tasks.
+
+React Redux provides a small API with two key features: `Provider` and `connect`. Another challenge covers `connect`. The `Provider` is a wrapper component from React Redux that wraps your React app. This wrapper then allows you to access the Redux `store` and `dispatch` functions throughout your component tree. `Provider` takes two props, the Redux store and the child components of your app. Defining the `Provider` for an App component might look like this:
+
+```jsx
+<Provider store={store}>
+  <App/>
+</Provider>
+```
+
+# --instructions--
+
+The code editor now shows all your Redux and React code from the past several challenges. It includes the Redux store, actions, and the `DisplayMessages` component. The only new piece is the `AppWrapper` component at the bottom. Use this top level component to render the `Provider` from `ReactRedux`, and pass the Redux store as a prop. Then render the `DisplayMessages` component as a child. Once you are finished, you should see your React component rendered to the page.
+
+**Note:** React Redux is available as a global variable here, so you can access the Provider with dot notation. The code in the editor takes advantage of this and sets it to a constant `Provider` for you to use in the `AppWrapper` render method.
+
+# --hints--
+
+The `AppWrapper` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Provider` wrapper component should have a prop of `store` passed to it, equal to the Redux store.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+      return __helpers
+        .removeWhiteSpace(getUserInput('index'))
+        .includes('<Providerstore={store}>');
+    })()
+  );
+```
+
+`DisplayMessages` should render as a child of `AppWrapper`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return (
+      mockedComponent.find('AppWrapper').find('DisplayMessages').length === 1
+    );
+  })()
+);
+```
+
+The `DisplayMessages` component should render an `h2`, `input`, `button`, and `ul` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h2').length === 1 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {  
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+const Provider = ReactRedux.Provider;
+
+class AppWrapper extends React.Component {
+  // Render the Provider below this line
+
+  // Change code above this line
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+ }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };  
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+const Provider = ReactRedux.Provider;
+
+class AppWrapper extends React.Component {
+  // Change code below this line
+  render() {
+    return (
+      <Provider store = {store}>
+        <DisplayMessages/>
+      </Provider>
+    );
+  }
+  // Change code above this line
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/access-props-using-this.props.md b/curriculum/challenges/italian/03-front-end-libraries/react/access-props-using-this.props.md
new file mode 100644
index 0000000000..5fe3a39679
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/access-props-using-this.props.md
@@ -0,0 +1,165 @@
+---
+id: 5a24c314108439a4d403616e
+title: Access Props Using this.props
+challengeType: 6
+forumTopicId: 301375
+dashedName: access-props-using-this-props
+---
+
+# --description--
+
+The last several challenges covered the basic ways to pass props to child components. But what if the child component that you're passing a prop to is an ES6 class component, rather than a stateless functional component? The ES6 class component uses a slightly different convention to access props.
+
+Anytime you refer to a class component within itself, you use the `this` keyword. To access props within a class component, you preface the code that you use to access it with `this`. For example, if an ES6 class component has a prop called `data`, you write `{this.props.data}` in JSX.
+
+# --instructions--
+
+Render an instance of the `ReturnTempPassword` component in the parent component `ResetPassword`. Here, give `ReturnTempPassword` a prop of `tempPassword` and assign it a value of a string that is at least 8 characters long. Within the child, `ReturnTempPassword`, access the `tempPassword` prop within the `strong` tags to make sure the user sees the temporary password.
+
+# --hints--
+
+The `ResetPassword` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The fourth child of `ResetPassword` should be the `ReturnTempPassword` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return (
+      mockedComponent.children().childAt(3).name() === 'ReturnTempPassword'
+    );
+  })()
+);
+```
+
+The `ReturnTempPassword` component should have a prop called `tempPassword`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return mockedComponent.find('ReturnTempPassword').props().tempPassword;
+  })()
+);
+```
+
+The `tempPassword` prop of `ReturnTempPassword` should be equal to a string of at least 8 characters.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    const temp = mockedComponent.find('ReturnTempPassword').props()
+      .tempPassword;
+    return typeof temp === 'string' && temp.length >= 8;
+  })()
+);
+```
+
+The `ReturnTempPassword` component should display the password you create as the `tempPassword` prop within `strong` tags.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return (
+      mockedComponent.find('strong').text() ===
+      mockedComponent.find('ReturnTempPassword').props().tempPassword
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ResetPassword />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class ReturnTempPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+            { /* Change code below this line */ }
+            <p>Your temporary password is: <strong></strong></p>
+            { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+
+class ResetPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+          <h2>Reset Password</h2>
+          <h3>We've generated a new temporary password for you.</h3>
+          <h3>Please reset this password from your account settings ASAP.</h3>
+          { /* Change code below this line */ }
+
+          { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class ReturnTempPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+            <p>Your temporary password is: <strong>{this.props.tempPassword}</strong></p>
+        </div>
+    );
+  }
+};
+
+class ResetPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+          <h2>Reset Password</h2>
+          <h3>We've generated a new temporary password for you.</h3>
+          <h3>Please reset this password from your account settings ASAP.</h3>
+          { /* Change code below this line */ }
+          <ReturnTempPassword tempPassword="serrPbqrPnzc" />
+          { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/add-comments-in-jsx.md b/curriculum/challenges/italian/03-front-end-libraries/react/add-comments-in-jsx.md
new file mode 100644
index 0000000000..94a2131b27
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/add-comments-in-jsx.md
@@ -0,0 +1,82 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5e
+title: Add Comments in JSX
+challengeType: 6
+forumTopicId: 301376
+dashedName: add-comments-in-jsx
+---
+
+# --description--
+
+JSX is a syntax that gets compiled into valid JavaScript. Sometimes, for readability, you might need to add comments to your code. Like most programming languages, JSX has its own way to do this.
+
+To put comments inside JSX, you use the syntax `{/* */}` to wrap around the comment text.
+
+# --instructions--
+
+The code editor has a JSX element similar to what you created in the last challenge. Add a comment somewhere within the provided `div` element, without modifying the existing `h1` or `p` elements.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The existing `h1` and `p` elements should not be modified.
+
+```js
+assert(
+  JSX.props.children[0].props.children === 'This is a block of JSX' &&
+    JSX.props.children[1].props.children === "Here's a subtitle"
+);
+```
+
+The `JSX` should use valid comment syntax.
+
+```js
+assert(/<div>[\s\S]*{\s*\/\*[\s\S]*\*\/\s*}[\s\S]*<\/div>/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>This is a block of JSX</h1>
+    <p>Here's a subtitle</p>
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>This is a block of JSX</h1>
+  { /* this is a JSX comment */ }
+  <p>Here's a subtitle</p>
+</div>);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/add-event-listeners.md b/curriculum/challenges/italian/03-front-end-libraries/react/add-event-listeners.md
new file mode 100644
index 0000000000..d49282cfe6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/add-event-listeners.md
@@ -0,0 +1,179 @@
+---
+id: 5a24c314108439a4d403617e
+title: Add Event Listeners
+challengeType: 6
+forumTopicId: 301377
+dashedName: add-event-listeners
+---
+
+# --description--
+
+The `componentDidMount()` method is also the best place to attach any event listeners you need to add for specific functionality. React provides a synthetic event system which wraps the native event system present in browsers. This means that the synthetic event system behaves exactly the same regardless of the user's browser - even if the native events may behave differently between different browsers.
+
+You've already been using some of these synthetic event handlers such as `onClick()`. React's synthetic event system is great to use for most interactions you'll manage on DOM elements. However, if you want to attach an event handler to the document or window objects, you have to do this directly.
+
+# --instructions--
+
+Attach an event listener in the `componentDidMount()` method for `keydown` events and have these events trigger the callback `handleKeyPress()`. You can use `document.addEventListener()` which takes the event (in quotes) as the first argument and the callback as the second argument.
+
+Then, in `componentWillUnmount()`, remove this same event listener. You can pass the same arguments to `document.removeEventListener()`. It's good practice to use this lifecycle method to do any clean up on React components before they are unmounted and destroyed. Removing event listeners is an example of one such clean up action.
+
+# --hints--
+
+`MyComponent` should render a `div` element which wraps an `h1` tag.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').children().find('h1').length === 1;
+  })()
+);
+```
+
+A `keydown` listener should be attached to the document in `componentDidMount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    const didMountString = mockedComponent
+      .instance()
+      .componentDidMount.toString();
+    return new RegExp(
+      'document.addEventListener(.|\n|\r)+keydown(.|\n|\r)+this.handleKeyPress'
+    ).test(didMountString);
+  })()
+);
+```
+
+The `keydown` listener should be removed from the document in `componentWillUnmount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    const willUnmountString = mockedComponent
+      .instance()
+      .componentWillUnmount.toString();
+    return new RegExp(
+      'document.removeEventListener(.|\n|\r)+keydown(.|\n|\r)+this.handleKeyPress'
+    ).test(willUnmountString);
+  })()
+);
+```
+
+Once the component has mounted, pressing `enter` should update its state and the rendered `h1` tag.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const beforeState = mockedComponent.state('message');
+  const beforeText = mockedComponent.find('h1').text();
+  const pressEnterKey = () => {
+    mockedComponent.instance().handleKeyPress({ keyCode: 13 });
+    return waitForIt(() => {
+      mockedComponent.update();
+      return {
+        state: mockedComponent.state('message'),
+        text: mockedComponent.find('h1').text()
+      };
+    });
+  };
+  const afterKeyPress = await pressEnterKey();
+  assert(
+    beforeState !== afterKeyPress.state && beforeText !== afterKeyPress.text
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      message: ''
+    };
+    this.handleEnter = this.handleEnter.bind(this);
+    this.handleKeyPress = this.handleKeyPress.bind(this);
+  }
+  // Change code below this line
+  componentDidMount() {
+
+  }
+  componentWillUnmount() {
+
+  }
+  // Change code above this line
+  handleEnter() {
+    this.setState((state) => ({
+      message: state.message + 'You pressed the enter key! '
+    }));
+  }
+  handleKeyPress(event) {
+    if (event.keyCode === 13) {
+      this.handleEnter();
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.message}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      message: ''
+    };
+    this.handleKeyPress = this.handleKeyPress.bind(this);
+    this.handleEnter = this.handleEnter.bind(this);  }
+  componentDidMount() {
+    // Change code below this line
+    document.addEventListener('keydown', this.handleKeyPress);
+    // Change code above this line
+  }
+  componentWillUnmount() {
+    // Change code below this line
+    document.removeEventListener('keydown', this.handleKeyPress);
+    // Change code above this line
+  }
+  handleEnter() {
+    this.setState((state) => ({
+      message: state.message + 'You pressed the enter key! '
+    }));
+  }
+  handleKeyPress(event) {
+    if (event.keyCode === 13) {
+      this.handleEnter();
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.message}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/add-inline-styles-in-react.md b/curriculum/challenges/italian/03-front-end-libraries/react/add-inline-styles-in-react.md
new file mode 100644
index 0000000000..0ced56da50
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/add-inline-styles-in-react.md
@@ -0,0 +1,112 @@
+---
+id: 5a24c314108439a4d4036182
+title: Add Inline Styles in React
+challengeType: 6
+forumTopicId: 301378
+dashedName: add-inline-styles-in-react
+---
+
+# --description--
+
+You may have noticed in the last challenge that there were several other syntax differences from HTML inline styles in addition to the `style` attribute set to a JavaScript object. First, the names of certain CSS style properties use camel case. For example, the last challenge set the size of the font with `fontSize` instead of `font-size`. Hyphenated words like `font-size` are invalid syntax for JavaScript object properties, so React uses camel case. As a rule, any hyphenated style properties are written using camel case in JSX.
+
+All property value length units (like `height`, `width`, and `fontSize`) are assumed to be in `px` unless otherwise specified. If you want to use `em`, for example, you wrap the value and the units in quotes, like `{fontSize: "4em"}`. Other than the length values that default to `px`, all other property values should be wrapped in quotes.
+
+# --instructions--
+
+If you have a large set of styles, you can assign a style `object` to a constant to keep your code organized. Declare your styles constant as a global variable at the top of the file. Initialize `styles` constant and assign an `object` with three style properties and their values to it. Give the `div` a color of `purple`, a font-size of `40`, and a border of `2px solid purple`. Then set the `style` attribute equal to the `styles` constant.
+
+# --hints--
+
+The `styles` variable should be an `object` with three properties.
+
+```js
+assert(Object.keys(styles).length === 3);
+```
+
+The `styles` variable should have a `color` property set to a value of `purple`.
+
+```js
+assert(styles.color === 'purple');
+```
+
+The `styles` variable should have a `fontSize` property set to a value of `40`.
+
+```js
+assert(styles.fontSize === 40);
+```
+
+The `styles` variable should have a `border` property set to a value of `2px solid purple`.
+
+```js
+assert(styles.border === '2px solid purple');
+```
+
+The component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.shallow(React.createElement(Colorful));
+    return mockedComponent.type() === 'div';
+  })()
+);
+```
+
+The `div` element should have its styles defined by the `styles` object.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.shallow(React.createElement(Colorful));
+    return (
+      mockedComponent.props().style.color === 'purple' &&
+      mockedComponent.props().style.fontSize === 40 &&
+      mockedComponent.props().style.border === '2px solid purple'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Colorful />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Change code above this line
+class Colorful extends React.Component {
+  render() {
+    // Change code below this line
+    return (
+      <div style={{color: "yellow", fontSize: 24}}>Style Me!</div>
+    );
+    // Change code above this line
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const styles = {
+  color: "purple",
+  fontSize: 40,
+  border: "2px solid purple"
+};
+// Change code above this line
+class Colorful extends React.Component {
+  render() {
+    // Change code below this line
+    return (
+      <div style={styles}>Style Me!</div>
+    );
+    // Change code above this line
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/bind-this-to-a-class-method.md b/curriculum/challenges/italian/03-front-end-libraries/react/bind-this-to-a-class-method.md
new file mode 100644
index 0000000000..ed61f77d7f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/bind-this-to-a-class-method.md
@@ -0,0 +1,136 @@
+---
+id: 5a24c314108439a4d4036174
+title: Bind 'this' to a Class Method
+challengeType: 6
+forumTopicId: 301379
+dashedName: bind-this-to-a-class-method
+---
+
+# --description--
+
+In addition to setting and updating `state`, you can also define methods for your component class. A class method typically needs to use the `this` keyword so it can access properties on the class (such as `state` and `props`) inside the scope of the method. There are a few ways to allow your class methods to access `this`.
+
+One common way is to explicitly bind `this` in the constructor so `this` becomes bound to the class methods when the component is initialized. You may have noticed the last challenge used `this.handleClick = this.handleClick.bind(this)` for its `handleClick` method in the constructor. Then, when you call a function like `this.setState()` within your class method, `this` refers to the class and will not be `undefined`.
+
+**Note:** The `this` keyword is one of the most confusing aspects of JavaScript but it plays an important role in React. Although its behavior here is totally normal, these lessons aren't the place for an in-depth review of `this` so please refer to other lessons if the above is confusing!
+
+# --instructions--
+
+The code editor has a component with a `state` that keeps track of the text. It also has a method which allows you to set the text to `You clicked!`. However, the method doesn't work because it's using the `this` keyword that is undefined. Fix it by explicitly binding `this` to the `handleClick()` method in the component's constructor.
+
+Next, add a click handler to the `button` element in the render method. It should trigger the `handleClick()` method when the button receives a click event. Remember that the method you pass to the `onClick` handler needs curly braces because it should be interpreted directly as JavaScript.
+
+Once you complete the above steps you should be able to click the button and see `You clicked!`.
+
+# --hints--
+
+`MyComponent` should return a `div` element which wraps two elements, a button and an `h1` element, in that order.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).find('div').length === 1 &&
+    Enzyme.mount(React.createElement(MyComponent))
+      .find('div')
+      .childAt(0)
+      .type() === 'button' &&
+    Enzyme.mount(React.createElement(MyComponent))
+      .find('div')
+      .childAt(1)
+      .type() === 'h1'
+);
+```
+
+The state of `MyComponent` should initialize with the key value pair `{ text: "Hello" }`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('text') === 'Hello'
+);
+```
+
+Clicking the `button` element should run the `handleClick` method and set the state `text` to `You clicked!`.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ text: 'Hello' });
+    return waitForIt(() => mockedComponent.state('text'));
+  };
+  const second = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent.state('text'));
+  };
+  const firstValue = await first();
+  const secondValue = await second();
+  assert(firstValue === 'Hello' && secondValue === 'You clicked!');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      text: "Hello"
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  handleClick() {
+    this.setState({
+      text: "You clicked!"
+    });
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <button>Click Me</button>
+        { /* Change code above this line */ }
+        <h1>{this.state.text}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      text: "Hello"
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState({
+      text: "You clicked!"
+    });
+  }
+  render() {
+    return (
+      <div>
+        <button onClick = {this.handleClick}>Click Me</button>
+        <h1>{this.state.text}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md b/curriculum/challenges/italian/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
new file mode 100644
index 0000000000..9a08852594
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
@@ -0,0 +1,176 @@
+---
+id: 5a24c314108439a4d4036189
+title: Change Inline CSS Conditionally Based on Component State
+challengeType: 6
+forumTopicId: 301380
+dashedName: change-inline-css-conditionally-based-on-component-state
+---
+
+# --description--
+
+At this point, you've seen several applications of conditional rendering and the use of inline styles. Here's one more example that combines both of these topics. You can also render CSS conditionally based on the state of a React component. To do this, you check for a condition, and if that condition is met, you modify the styles object that's assigned to the JSX elements in the render method.
+
+This paradigm is important to understand because it is a dramatic shift from the more traditional approach of applying styles by modifying DOM elements directly (which is very common with jQuery, for example). In that approach, you must keep track of when elements change and also handle the actual manipulation directly. It can become difficult to keep track of changes, potentially making your UI unpredictable. When you set a style object based on a condition, you describe how the UI should look as a function of the application's state. There is a clear flow of information that only moves in one direction. This is the preferred method when writing applications with React.
+
+# --instructions--
+
+The code editor has a simple controlled input component with a styled border. You want to style this border red if the user types more than 15 characters of text in the input box. Add a condition to check for this and, if the condition is valid, set the input border style to `3px solid red`. You can try it out by entering text in the input.
+
+# --hints--
+
+The `GateKeeper` component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return mockedComponent.find('div').length === 1;
+  })()
+);
+```
+
+The `GateKeeper` component should be initialized with a state key `input` set to an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return mockedComponent.state().input === '';
+  })()
+);
+```
+
+The `GateKeeper` component should render an `h3` tag and an `input` tag.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return (
+      mockedComponent.find('h3').length === 1 &&
+      mockedComponent.find('input').length === 1
+    );
+  })()
+);
+```
+
+The `input` tag should initially have a style of `1px solid black` for the `border` property.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return (
+      mockedComponent.find('input').props().style.border === '1px solid black'
+    );
+  })()
+);
+```
+
+The `input` tag should be styled with a border of `3px solid red` if the input value in state is longer than 15 characters.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+  const simulateChange = (el, value) =>
+    el.simulate('change', { target: { value } });
+  let initialStyle = mockedComponent.find('input').props().style.border;
+  const state_1 = () => {
+    mockedComponent.setState({ input: 'this is 15 char' });
+    return waitForIt(() => mockedComponent.find('input').props().style.border);
+  };
+  const state_2 = () => {
+    mockedComponent.setState({
+      input: 'A very long string longer than 15 characters.'
+    });
+    return waitForIt(() => mockedComponent.find('input').props().style.border);
+  };
+  const style_1 = await state_1();
+  const style_2 = await state_2();
+  assert(
+    initialStyle === '1px solid black' &&
+      style_1 === '1px solid black' &&
+      style_2 === '3px solid red'
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<GateKeeper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class GateKeeper extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({ input: event.target.value })
+  }
+  render() {
+    let inputStyle = {
+      border: '1px solid black'
+    };
+    // Change code below this line
+
+    // Change code above this line
+    return (
+      <div>
+        <h3>Don't Type Too Much:</h3>
+        <input
+          type="text"
+          style={inputStyle}
+          value={this.state.input}
+          onChange={this.handleChange} />
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class GateKeeper extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({ input: event.target.value })
+  }
+  render() {
+    let inputStyle = {
+      border: '1px solid black'
+    };
+    if (this.state.input.length > 15) {
+      inputStyle.border = '3px solid red';
+    };
+    return (
+      <div>
+        <h3>Don't Type Too Much:</h3>
+        <input
+          type="text"
+          style={inputStyle}
+          value={this.state.input}
+          onChange={this.handleChange} />
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/compose-react-components.md b/curriculum/challenges/italian/03-front-end-libraries/react/compose-react-components.md
new file mode 100644
index 0000000000..f39e29008a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/compose-react-components.md
@@ -0,0 +1,199 @@
+---
+id: 5a24c314108439a4d4036166
+title: Compose React Components
+challengeType: 6
+forumTopicId: 301381
+dashedName: compose-react-components
+---
+
+# --description--
+
+As the challenges continue to use more complex compositions with React components and JSX, there is one important point to note. Rendering ES6 style class components within other components is no different than rendering the simple components you used in the last few challenges. You can render JSX elements, stateless functional components, and ES6 class components within other components.
+
+# --instructions--
+
+In the code editor, the `TypesOfFood` component is already rendering a component called `Vegetables`. Also, there is the `Fruits` component from the last challenge.
+
+Nest two components inside of `Fruits` — first `NonCitrus`, and then `Citrus`. Both of these components are provided for you behind the scenes. Next, nest the `Fruits` class component into the `TypesOfFood` component, below the `h1` header and above `Vegetables`. The result should be a series of nested components, which uses two different component types.
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `TypesOfFood` component should return the `Fruits` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(1).name() === 'Fruits';
+  })()
+);
+```
+
+The `Fruits` component should return the `NonCitrus` component and the `Citrus` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return (
+      mockedComponent.find('Fruits').children().find('NonCitrus').length ===
+        1 &&
+      mockedComponent.find('Fruits').children().find('Citrus').length === 1
+    );
+  })()
+);
+```
+
+The `TypesOfFood` component should return the `Vegetables` component below the `Fruits` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(2).name() === 'Vegetables';
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+class NonCitrus extends React.Component {
+  render() {
+    return (
+      <div>
+        <h4>Non-Citrus:</h4>
+        <ul>
+          <li>Apples</li>
+          <li>Blueberries</li>
+          <li>Strawberries</li>
+          <li>Bananas</li>
+        </ul>
+      </div>
+    );
+  }
+};
+class Citrus extends React.Component {
+  render() {
+    return (
+      <div>
+        <h4>Citrus:</h4>
+        <ul>
+          <li>Lemon</li>
+          <li>Lime</li>
+          <li>Orange</li>
+          <li>Grapefruit</li>
+        </ul>
+      </div>
+    );
+  }
+};
+class Vegetables extends React.Component {
+  render() {
+    return (
+      <div>
+        <h2>Vegetables:</h2>
+        <ul>
+          <li>Brussel Sprouts</li>
+          <li>Broccoli</li>
+          <li>Squash</li>
+        </ul>
+      </div>
+    );
+     }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<TypesOfFood />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Fruits extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h2>Fruits:</h2>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+     super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+        <Vegetables />
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Fruits extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h2>Fruits:</h2>
+        { /* Change code below this line */ }
+        <NonCitrus />
+        <Citrus />
+        { /* Change code above this line */ }
+      </div>
+    )
+  }
+}
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+     super(props);
+  }
+    render() {
+      return (
+        <div>
+        <h1>Types of Food:</h1>
+          { /* Change code below this line */ }
+          <Fruits />
+          { /* Change code above this line */ }
+          <Vegetables />
+        </div>
+      );
+    }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-complex-jsx-element.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-complex-jsx-element.md
new file mode 100644
index 0000000000..595047ee70
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-complex-jsx-element.md
@@ -0,0 +1,110 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5d
+title: Create a Complex JSX Element
+challengeType: 6
+forumTopicId: 301382
+dashedName: create-a-complex-jsx-element
+---
+
+# --description--
+
+The last challenge was a simple example of JSX, but JSX can represent more complex HTML as well.
+
+One important thing to know about nested JSX is that it must return a single element.
+
+This one parent element would wrap all of the other levels of nested elements.
+
+For instance, several JSX elements written as siblings with no parent wrapper element will not transpile.
+
+Here's an example:
+
+**Valid JSX:**
+
+```jsx
+<div>
+  <p>Paragraph One</p>
+  <p>Paragraph Two</p>
+  <p>Paragraph Three</p>
+</div>
+```
+
+**Invalid JSX:**
+
+```jsx
+<p>Paragraph One</p>
+<p>Paragraph Two</p>
+<p>Paragraph Three</p>
+```
+
+# --instructions--
+
+Define a new constant `JSX` that renders a `div` which contains the following elements in order:
+
+An `h1`, a `p`, and an unordered list that contains three `li` items. You can include any text you want within each element.
+
+**Note:** When rendering multiple elements like this, you can wrap them all in parentheses, but it's not strictly required. Also notice this challenge uses a `div` tag to wrap all the child elements within a single parent element. If you remove the `div`, the JSX will no longer transpile. Keep this in mind, since it will also apply when you return JSX elements in React components.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The `div` should contain a `ul` tag as the third element.
+
+```js
+assert(JSX.props.children[2].type === 'ul');
+```
+
+The `ul` should contain three `li` elements.
+
+```js
+assert(
+  JSX.props.children
+    .filter((ele) => ele.type === 'ul')[0]
+    .props.children.filter((ele) => ele.type === 'li').length === 3
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>Hello JSX!</h1>
+  <p>Some info</p>
+  <ul>
+    <li>An item</li>
+    <li>Another item</li>
+    <li>A third item</li>
+  </ul>
+</div>);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-component-with-composition.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-component-with-composition.md
new file mode 100644
index 0000000000..956c87a620
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-component-with-composition.md
@@ -0,0 +1,134 @@
+---
+id: 5a24c314108439a4d4036164
+title: Create a Component with Composition
+challengeType: 6
+forumTopicId: 301383
+dashedName: create-a-component-with-composition
+---
+
+# --description--
+
+Now we will look at how we can compose multiple React components together. Imagine you are building an app and have created three components: a `Navbar`, `Dashboard`, and `Footer`.
+
+To compose these components together, you could create an `App` *parent* component which renders each of these three components as *children*. To render a component as a child in a React component, you include the component name written as a custom HTML tag in the JSX. For example, in the `render` method you could write:
+
+```jsx
+return (
+ <App>
+  <Navbar />
+  <Dashboard />
+  <Footer />
+ </App>
+)
+```
+
+When React encounters a custom HTML tag that references another component (a component name wrapped in `< />` like in this example), it renders the markup for that component in the location of the tag. This should illustrate the parent/child relationship between the `App` component and the `Navbar`, `Dashboard`, and `Footer`.
+
+# --instructions--
+
+In the code editor, there is a simple functional component called `ChildComponent` and a class component called `ParentComponent`. Compose the two together by rendering the `ChildComponent` within the `ParentComponent`. Make sure to close the `ChildComponent` tag with a forward slash.
+
+**Note:** `ChildComponent` is defined with an ES6 arrow function because this is a very common practice when using React. However, know that this is just a function. If you aren't familiar with the arrow function syntax, please refer to the JavaScript section.
+
+# --hints--
+
+The React component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    var shallowRender = Enzyme.shallow(React.createElement(ParentComponent));
+    return shallowRender.type() === 'div';
+  })()
+);
+```
+
+The component should return two nested elements.
+
+```js
+assert(
+  (function () {
+    var shallowRender = Enzyme.shallow(React.createElement(ParentComponent));
+    return shallowRender.children().length === 2;
+  })()
+);
+```
+
+The component should return the `ChildComponent` as its second child.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ParentComponent));
+    return (
+      mockedComponent.find('ParentComponent').find('ChildComponent').length ===
+      1
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ParentComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const ChildComponent = () => {
+  return (
+    <div>
+      <p>I am the child</p>
+    </div>
+  );
+};
+
+class ParentComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>I am the parent</h1>
+        { /* Change code below this line */ }
+
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const ChildComponent = () => {
+  return (
+    <div>
+      <p>I am the child</p>
+    </div>
+  );
+};
+
+class ParentComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>I am the parent</h1>
+        { /* Change code below this line */ }
+        <ChildComponent />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-form.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-form.md
new file mode 100644
index 0000000000..1990de794d
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-form.md
@@ -0,0 +1,209 @@
+---
+id: 5a24c314108439a4d4036179
+title: Create a Controlled Form
+challengeType: 6
+forumTopicId: 301384
+dashedName: create-a-controlled-form
+---
+
+# --description--
+
+The last challenge showed that React can control the internal state for certain elements like `input` and `textarea`, which makes them controlled components. This applies to other form elements as well, including the regular HTML `form` element.
+
+# --instructions--
+
+The `MyForm` component is set up with an empty `form` with a submit handler. The submit handler will be called when the form is submitted.
+
+We've added a button which submits the form. You can see it has the `type` set to `submit` indicating it is the button controlling the form. Add the `input` element in the `form` and set its `value` and `onChange()` attributes like the last challenge. You should then complete the `handleSubmit` method so that it sets the component state property `submit` to the current input value in the local `state`.
+
+**Note:** You also must call `event.preventDefault()` in the submit handler, to prevent the default form submit behavior which will refresh the web page.
+
+Finally, create an `h1` tag after the `form` which renders the `submit` value from the component's `state`. You can then type in the form and click the button (or press enter), and you should see your input rendered to the page.
+
+# --hints--
+
+`MyForm` should return a `div` element which contains a `form` and an `h1` tag. The form should include an `input` and a `button`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+    return (
+      mockedComponent.find('div').children().find('form').length === 1 &&
+      mockedComponent.find('div').children().find('h1').length === 1 &&
+      mockedComponent.find('form').children().find('input').length === 1 &&
+      mockedComponent.find('form').children().find('button').length === 1
+    );
+  })()
+);
+```
+
+The state of `MyForm` should initialize with `input` and `submit` properties, both set to empty strings.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyForm)).state('input') === '' &&
+    Enzyme.mount(React.createElement(MyForm)).state('submit') === ''
+);
+```
+
+Typing in the `input` element should update the `input` property of the component's state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    return mockedComponent.state('input');
+  };
+  const _2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return {
+      state: mockedComponent.state('input'),
+      inputVal: mockedComponent.find('input').props().value
+    };
+  };
+  const before = _1();
+  const after = _2();
+  assert(
+    before === '' &&
+      after.state === 'TestInput' &&
+      after.inputVal === 'TestInput'
+  );
+})();
+```
+
+Submitting the form should run `handleSubmit` which should set the `submit` property in state equal to the current input.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    mockedComponent.setState({ submit: '' });
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'SubmitInput' } });
+    return mockedComponent.state('submit');
+  };
+  const _2 = () => {
+    mockedComponent.find('form').simulate('submit');
+    return mockedComponent.state('submit');
+  };
+  const before = _1();
+  const after = _2();
+  assert(before === '' && after === 'SubmitInput');
+})();
+```
+
+The `h1` header should render the value of the `submit` field from the component's state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    mockedComponent.setState({ submit: '' });
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return mockedComponent.find('h1').text();
+  };
+  const _2 = () => {
+    mockedComponent.find('form').simulate('submit');
+    return mockedComponent.find('h1').text();
+  };
+  const before = _1();
+  const after = _2();
+  assert(before === '' && after === 'TestInput');
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyForm />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyForm extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      submit: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+    this.handleSubmit = this.handleSubmit.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  handleSubmit(event) {
+    // Change code below this line
+    
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <form onSubmit={this.handleSubmit}>
+          {/* Change code below this line */}
+
+          {/* Change code above this line */}
+          <button type='submit'>Submit!</button>
+        </form>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyForm extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      submit: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+    this.handleSubmit = this.handleSubmit.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  handleSubmit(event) {
+    event.preventDefault();
+    this.setState(state => ({
+      submit: state.input
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <form onSubmit={this.handleSubmit}>
+          <input value={this.state.input} onChange={this.handleChange} />
+          <button type='submit'>Submit!</button>
+        </form>
+        <h1>{this.state.submit}</h1>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-input.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-input.md
new file mode 100644
index 0000000000..e38cf90ad5
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-controlled-input.md
@@ -0,0 +1,150 @@
+---
+id: 5a24c314108439a4d4036178
+title: Create a Controlled Input
+challengeType: 6
+forumTopicId: 301385
+dashedName: create-a-controlled-input
+---
+
+# --description--
+
+Your application may have more complex interactions between `state` and the rendered UI. For example, form control elements for text input, such as `input` and `textarea`, maintain their own state in the DOM as the user types. With React, you can move this mutable state into a React component's `state`. The user's input becomes part of the application `state`, so React controls the value of that input field. Typically, if you have React components with input fields the user can type into, it will be a controlled input form.
+
+# --instructions--
+
+The code editor has the skeleton of a component called `ControlledInput` to create a controlled `input` element. The component's `state` is already initialized with an `input` property that holds an empty string. This value represents the text a user types into the `input` field.
+
+First, create a method called `handleChange()` that has a parameter called `event`. When the method is called, it receives an `event` object that contains a string of text from the `input` element. You can access this string with `event.target.value` inside the method. Update the `input` property of the component's `state` with this new string.
+
+In the `render` method, create the `input` element above the `h4` tag. Add a `value` attribute which is equal to the `input` property of the component's `state`. Then add an `onChange()` event handler set to the `handleChange()` method.
+
+When you type in the input box, that text is processed by the `handleChange()` method, set as the `input` property in the local `state`, and rendered as the value in the `input` box on the page. The component `state` is the single source of truth regarding the input data.
+
+Last but not least, don't forget to add the necessary bindings in the constructor.
+
+# --hints--
+
+`ControlledInput` should return a `div` element which contains an `input` and a `p` tag.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(ControlledInput))
+    .find('div')
+    .children()
+    .find('input').length === 1 &&
+    Enzyme.mount(React.createElement(ControlledInput))
+      .find('div')
+      .children()
+      .find('p').length === 1
+);
+```
+
+The state of `ControlledInput` should initialize with an `input` property set to an empty string.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(ControlledInput)).state('input'),
+  ''
+);
+```
+
+Typing in the input element should update the state and the value of the input, and the `p` element should render this state as you type.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(ControlledInput));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    return waitForIt(() => mockedComponent.state('input'));
+  };
+  const _2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return waitForIt(() => ({
+      state: mockedComponent.state('input'),
+      text: mockedComponent.find('p').text(),
+      inputVal: mockedComponent.find('input').props().value
+    }));
+  };
+  const before = await _1();
+  const after = await _2();
+  assert(
+    before === '' &&
+      after.state === 'TestInput' &&
+      after.text === 'TestInput' &&
+      after.inputVal === 'TestInput'
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ControlledInput />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class ControlledInput extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */}
+
+        { /* Change code above this line */}
+        <h4>Controlled Input:</h4>
+        <p>{this.state.input}</p>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class ControlledInput extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  render() {
+    return (
+      <div>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange} />
+        <h4>Controlled Input:</h4>
+
+        <p>{this.state.input}</p>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-react-component.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-react-component.md
new file mode 100644
index 0000000000..6a92615c1d
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-react-component.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036163
+title: Create a React Component
+challengeType: 6
+forumTopicId: 301386
+dashedName: create-a-react-component
+---
+
+# --description--
+
+The other way to define a React component is with the ES6 `class` syntax. In the following example, `Kitten` extends `React.Component`:
+
+```jsx
+class Kitten extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <h1>Hi</h1>
+    );
+  }
+}
+```
+
+This creates an ES6 class `Kitten` which extends the `React.Component` class. So the `Kitten` class now has access to many useful React features, such as local state and lifecycle hooks. Don't worry if you aren't familiar with these terms yet, they will be covered in greater detail in later challenges. Also notice the `Kitten` class has a `constructor` defined within it that calls `super()`. It uses `super()` to call the constructor of the parent class, in this case `React.Component`. The constructor is a special method used during the initialization of objects that are created with the `class` keyword. It is best practice to call a component's `constructor` with `super`, and pass `props` to both. This makes sure the component is initialized properly. For now, know that it is standard for this code to be included. Soon you will see other uses for the constructor as well as `props`.
+
+# --instructions--
+
+`MyComponent` is defined in the code editor using class syntax. Finish writing the `render` method so it returns a `div` element that contains an `h1` with the text `Hello React!`.
+
+# --hints--
+
+The React component should return a `div` element.
+
+```js
+assert(Enzyme.shallow(React.createElement(MyComponent)).type() === 'div');
+```
+
+The returned `div` should render an `h1` header within it.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.shallow(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The `h1` header should contain the string `Hello React!`.
+
+```js
+assert(
+  Enzyme.shallow(React.createElement(MyComponent)).html() ===
+    '<div><h1>Hello React!</h1></div>'
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Change code below this line
+
+
+
+    // Change code above this line
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Change code below this line
+    return (
+      <div>
+        <h1>Hello React!</h1>
+      </div>
+    );
+    // Change code above this line
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-simple-jsx-element.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-simple-jsx-element.md
new file mode 100644
index 0000000000..6873473687
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-simple-jsx-element.md
@@ -0,0 +1,57 @@
+---
+id: 587d7dbc367417b2b2512bb1
+title: Create a Simple JSX Element
+challengeType: 6
+forumTopicId: 301390
+dashedName: create-a-simple-jsx-element
+---
+
+# --description--
+
+React is an Open Source view library created and maintained by Facebook. It's a great tool to render the User Interface (UI) of modern web applications.
+
+React uses a syntax extension of JavaScript called JSX that allows you to write HTML directly within JavaScript. This has several benefits. It lets you use the full programmatic power of JavaScript within HTML, and helps to keep your code readable. For the most part, JSX is similar to the HTML that you have already learned, however there are a few key differences that will be covered throughout these challenges.
+
+For instance, because JSX is a syntactic extension of JavaScript, you can actually write JavaScript directly within JSX. To do this, you simply include the code you want to be treated as JavaScript within curly braces: `{ 'this is treated as JavaScript code' }`. Keep this in mind, since it's used in several future challenges.
+
+However, because JSX is not valid JavaScript, JSX code must be compiled into JavaScript. The transpiler Babel is a popular tool for this process. For your convenience, it's already added behind the scenes for these challenges. If you happen to write syntactically invalid JSX, you will see the first test in these challenges fail.
+
+It's worth noting that under the hood the challenges are calling `ReactDOM.render(JSX, document.getElementById('root'))`. This function call is what places your JSX into React's own lightweight representation of the DOM. React then uses snapshots of its own DOM to optimize updating only specific parts of the actual DOM.
+
+# --instructions--
+
+The current code uses JSX to assign a `div` element to the constant `JSX`. Replace the `div` with an `h1` element and add the text `Hello JSX!` inside it.
+
+# --hints--
+
+The constant `JSX` should return an `h1` element.
+
+```js
+assert(JSX.type === 'h1');
+```
+
+The `h1` tag should include the text `Hello JSX!`
+
+```js
+assert(Enzyme.shallow(JSX).contains('Hello JSX!'));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = <div></div>;
+```
+
+# --solutions--
+
+```jsx
+const JSX = <h1>Hello JSX!</h1>;
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateful-component.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateful-component.md
new file mode 100644
index 0000000000..41ebc9c77b
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateful-component.md
@@ -0,0 +1,134 @@
+---
+id: 5a24c314108439a4d4036170
+title: Create a Stateful Component
+challengeType: 6
+forumTopicId: 301391
+dashedName: create-a-stateful-component
+---
+
+# --description--
+
+One of the most important topics in React is `state`. State consists of any data your application needs to know about, that can change over time. You want your apps to respond to state changes and present an updated UI when necessary. React offers a nice solution for the state management of modern web applications.
+
+You create state in a React component by declaring a `state` property on the component class in its `constructor`. This initializes the component with `state` when it is created. The `state` property must be set to a JavaScript `object`. Declaring it looks like this:
+
+```jsx
+this.state = {
+
+}
+```
+
+You have access to the `state` object throughout the life of your component. You can update it, render it in your UI, and pass it as props to child components. The `state` object can be as complex or as simple as you need it to be. Note that you must create a class component by extending `React.Component` in order to create `state` like this.
+
+# --instructions--
+
+There is a component in the code editor that is trying to render a `name` property from its `state`. However, there is no `state` defined. Initialize the component with `state` in the `constructor` and assign your name to a property of `name`.
+
+# --hints--
+
+`StatefulComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    return mockedComponent.find('StatefulComponent').length === 1;
+  })()
+);
+```
+
+`StatefulComponent` should render a `div` and an `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h1').length === 1
+    );
+  })()
+);
+```
+
+The state of `StatefulComponent` should be initialized with a property `name` set to a string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' && typeof initialState.name === 'string'
+    );
+  })()
+);
+```
+
+The property `name` in the state of `StatefulComponent` should render in the `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    const initialState = mockedComponent.state();
+    return mockedComponent.find('h1').text() === initialState.name;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<StatefulComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class StatefulComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    // Only change code below this line
+
+    // Only change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class StatefulComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp!'
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateless-functional-component.md b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateless-functional-component.md
new file mode 100644
index 0000000000..e76b742ada
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/create-a-stateless-functional-component.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036162
+title: Create a Stateless Functional Component
+challengeType: 6
+forumTopicId: 301392
+dashedName: create-a-stateless-functional-component
+---
+
+# --description--
+
+Components are the core of React. Everything in React is a component and here you will learn how to create one.
+
+There are two ways to create a React component. The first way is to use a JavaScript function. Defining a component in this way creates a *stateless functional component*. The concept of state in an application will be covered in later challenges. For now, think of a stateless component as one that can receive data and render it, but does not manage or track changes to that data. (We'll cover the second way to create a React component in the next challenge.)
+
+To create a component with a function, you simply write a JavaScript function that returns either JSX or `null`. One important thing to note is that React requires your function name to begin with a capital letter. Here's an example of a stateless functional component that assigns an HTML class in JSX:
+
+```jsx
+const DemoComponent = function() {
+  return (
+    <div className='customClass' />
+  );
+};
+```
+
+After being transpiled, the `<div>` will have a CSS class of `customClass`.
+
+Because a JSX component represents HTML, you could put several components together to create a more complex HTML page. This is one of the key advantages of the component architecture React provides. It allows you to compose your UI from many separate, isolated components. This makes it easier to build and maintain complex user interfaces.
+
+# --instructions--
+
+The code editor has a function called `MyComponent`. Complete this function so it returns a single `div` element which contains some string of text.
+
+**Note:** The text is considered a child of the `div` element, so you will not be able to use a self-closing tag.
+
+# --hints--
+
+`MyComponent` should return JSX.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.length === 1;
+  })()
+);
+```
+
+`MyComponent` should return a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `div` element should contain a string of text.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').text() !== '';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const MyComponent = function() {
+  // Change code below this line
+
+
+
+  // Change code above this line
+}
+```
+
+# --solutions--
+
+```jsx
+const MyComponent = function() {
+  // Change code below this line
+  return (
+    <div>
+      Demo Solution
+    </div>
+  );
+  // Change code above this line
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/define-an-html-class-in-jsx.md b/curriculum/challenges/italian/03-front-end-libraries/react/define-an-html-class-in-jsx.md
new file mode 100644
index 0000000000..2438f4b291
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/define-an-html-class-in-jsx.md
@@ -0,0 +1,62 @@
+---
+id: 5a24c314108439a4d4036160
+title: Define an HTML Class in JSX
+challengeType: 6
+forumTopicId: 301393
+dashedName: define-an-html-class-in-jsx
+---
+
+# --description--
+
+Now that you're getting comfortable writing JSX, you may be wondering how it differs from HTML.
+
+So far, it may seem that HTML and JSX are exactly the same.
+
+One key difference in JSX is that you can no longer use the word `class` to define HTML classes. This is because `class` is a reserved word in JavaScript. Instead, JSX uses `className`.
+
+In fact, the naming convention for all HTML attributes and event references in JSX become camelCase. For example, a click event in JSX is `onClick`, instead of `onclick`. Likewise, `onchange` becomes `onChange`. While this is a subtle difference, it is an important one to keep in mind moving forward.
+
+# --instructions--
+
+Apply a class of `myDiv` to the `div` provided in the JSX code.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert.strictEqual(JSX.type, 'div');
+```
+
+The `div` should have a class of `myDiv`.
+
+```js
+assert.strictEqual(JSX.props.className, 'myDiv');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>Add a class to this div</h1>
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div className = 'myDiv'>
+  <h1>Add a class to this div</h1>
+</div>);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md b/curriculum/challenges/italian/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
new file mode 100644
index 0000000000..23751b823b
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
@@ -0,0 +1,147 @@
+---
+id: 5a24c314108439a4d403618b
+title: Give Sibling Elements a Unique Key Attribute
+challengeType: 6
+forumTopicId: 301394
+dashedName: give-sibling-elements-a-unique-key-attribute
+---
+
+# --description--
+
+The last challenge showed how the `map` method is used to dynamically render a number of elements based on user input. However, there was an important piece missing from that example. When you create an array of elements, each one needs a `key` attribute set to a unique value. React uses these keys to keep track of which items are added, changed, or removed. This helps make the re-rendering process more efficient when the list is modified in any way.  
+
+**Note:** Keys only need to be unique between sibling elements, they don't need to be globally unique in your application.
+
+# --instructions--
+
+The code editor has an array with some front end frameworks and a stateless functional component named `Frameworks()`. `Frameworks()` needs to map the array to an unordered list, much like in the last challenge. Finish writing the `map` callback to return an `li` element for each framework in the `frontEndFrameworks` array. This time, make sure to give each `li` a `key` attribute, set to a unique value. The `li` elements should also contain text from `frontEndFrameworks`.
+
+Normally, you want to make the key something that uniquely identifies the element being rendered. As a last resort the array index may be used, but typically you should try to use a unique identification.
+
+# --hints--
+
+The `Frameworks` component should exist and render to the page.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(Frameworks)).find('Frameworks').length === 1
+);
+```
+
+`Frameworks` should render an `h1` element.
+
+```js
+assert(Enzyme.mount(React.createElement(Frameworks)).find('h1').length === 1);
+```
+
+`Frameworks` should render a `ul` element.
+
+```js
+assert(Enzyme.mount(React.createElement(Frameworks)).find('ul').length === 1);
+```
+
+The `ul` tag should render 6 child `li` elements.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(Frameworks)).find('ul').children().length ===
+    6 &&
+    Enzyme.mount(React.createElement(Frameworks))
+      .find('ul')
+      .childAt(0)
+      .name() === 'li' &&
+    Enzyme.mount(React.createElement(Frameworks)).find('li').length === 6
+);
+```
+
+Each list item element should have a unique `key` attribute.
+
+```js
+assert(
+  (() => {
+    const ul = Enzyme.mount(React.createElement(Frameworks)).find('ul');
+    const keys = new Set([
+      ul.childAt(0).key(),
+      ul.childAt(1).key(),
+      ul.childAt(2).key(),
+      ul.childAt(3).key(),
+      ul.childAt(4).key(),
+      ul.childAt(5).key()
+    ]);
+    return keys.size === 6;
+  })()
+);
+```
+
+Each list item element should contain text from `frontEndFrameworks`.
+
+```js
+assert(
+  (() => {
+    const li = Enzyme.mount(React.createElement(Frameworks))
+      .find('ul')
+      .children();
+    return [...Array(5)].every((_, i) =>
+      frontEndFrameworks.includes(li.at(i).text())
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Frameworks />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const frontEndFrameworks = [
+  'React',
+  'Angular',
+  'Ember',
+  'Knockout',
+  'Backbone',
+  'Vue'
+];
+
+function Frameworks() {
+  const renderFrameworks = null; // Change this line
+  return (
+    <div>
+      <h1>Popular Front End JavaScript Frameworks</h1>
+      <ul>
+        {renderFrameworks}
+      </ul>
+    </div>
+  );
+};
+```
+
+# --solutions--
+
+```jsx
+const frontEndFrameworks = [
+  'React',
+  'Angular',
+  'Ember',
+  'Knockout',
+  'Backbone',
+  'Vue'
+];
+
+function Frameworks() {
+  const renderFrameworks = frontEndFrameworks.map((fw, i) => <li key={i}>{fw}</li>);
+  return (
+    <div>
+      <h1>Popular Front End JavaScript Frameworks</h1>
+      <ul>
+        {renderFrameworks}
+      </ul>
+    </div>
+  );
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/introducing-inline-styles.md b/curriculum/challenges/italian/03-front-end-libraries/react/introducing-inline-styles.md
new file mode 100644
index 0000000000..1266a6cea2
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/introducing-inline-styles.md
@@ -0,0 +1,104 @@
+---
+id: 5a24c314108439a4d4036181
+title: Introducing Inline Styles
+challengeType: 6
+forumTopicId: 301395
+dashedName: introducing-inline-styles
+---
+
+# --description--
+
+There are other complex concepts that add powerful capabilities to your React code. But you may be wondering about the more simple problem of how to style those JSX elements you create in React. You likely know that it won't be exactly the same as working with HTML because of [the way you apply classes to JSX elements](/learn/front-end-libraries/react/define-an-html-class-in-jsx).
+
+If you import styles from a stylesheet, it isn't much different at all. You apply a class to your JSX element using the `className` attribute, and apply styles to the class in your stylesheet. Another option is to apply inline styles, which are very common in ReactJS development.
+
+You apply inline styles to JSX elements similar to how you do it in HTML, but with a few JSX differences. Here's an example of an inline style in HTML:
+
+```jsx
+<div style="color: yellow; font-size: 16px">Mellow Yellow</div>
+```
+
+JSX elements use the `style` attribute, but because of the way JSX is transpiled, you can't set the value to a `string`. Instead, you set it equal to a JavaScript `object`. Here's an example:
+
+```jsx
+<div style={{color: "yellow", fontSize: 16}}>Mellow Yellow</div>
+```
+
+Notice how we camelCase the `fontSize` property? This is because React will not accept kebab-case keys in the style object. React will apply the correct property name for us in the HTML.
+
+# --instructions--
+
+Add a `style` attribute to the `div` in the code editor to give the text a color of red and font size of `72px`.
+
+Note that you can optionally set the font size to be a number, omitting the units `px`, or write it as `72px`.
+
+# --hints--
+
+The component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `div` element should have a color of `red`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return mockedComponent.children().props().style.color === 'red';
+  })()
+);
+```
+
+The `div` element should have a font size of `72px`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return (
+      mockedComponent.children().props().style.fontSize === 72 ||
+      mockedComponent.children().props().style.fontSize === '72' ||
+      mockedComponent.children().props().style.fontSize === '72px'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Colorful />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Colorful extends React.Component {
+  render() {
+    return (
+      <div>Big Red</div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Colorful extends React.Component {
+  render() {
+    return (
+      <div style={{color: "red", fontSize: 72}}>Big Red</div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md b/curriculum/challenges/italian/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
new file mode 100644
index 0000000000..31edb73183
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
@@ -0,0 +1,75 @@
+---
+id: 5a24c314108439a4d4036161
+title: Learn About Self-Closing JSX Tags
+challengeType: 6
+forumTopicId: 301396
+dashedName: learn-about-self-closing-jsx-tags
+---
+
+# --description--
+
+So far, you’ve seen how JSX differs from HTML in a key way with the use of `className` vs. `class` for defining HTML classes.
+
+Another important way in which JSX differs from HTML is in the idea of the self-closing tag.
+
+In HTML, almost all tags have both an opening and closing tag: `<div></div>`; the closing tag always has a forward slash before the tag name that you are closing. However, there are special instances in HTML called “self-closing tags”, or tags that don’t require both an opening and closing tag before another tag can start.
+
+For example the line-break tag can be written as `<br>` or as `<br />`, but should never be written as `<br></br>`, since it doesn't contain any content.
+
+In JSX, the rules are a little different. Any JSX element can be written with a self-closing tag, and every element must be closed. The line-break tag, for example, must always be written as `<br />` in order to be valid JSX that can be transpiled. A `<div>`, on the other hand, can be written as `<div />` or `<div></div>`. The difference is that in the first syntax version there is no way to include anything in the `<div />`. You will see in later challenges that this syntax is useful when rendering React components.
+
+# --instructions--
+
+Fix the errors in the code editor so that it is valid JSX and successfully transpiles. Make sure you don't change any of the content - you only need to close tags where they are needed.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert.strictEqual(JSX.type, 'div');
+```
+
+The `div` should contain a `br` tag.
+
+```js
+assert(Enzyme.shallow(JSX).find('br').length === 1);
+```
+
+The `div` should contain an `hr` tag.
+
+```js
+assert(Enzyme.shallow(JSX).find('hr').length === 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h2>Welcome to React!</h2> <br >
+    <p>Be sure to close all tags!</p>
+    <hr >
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h2>Welcome to React!</h2> <br />
+  <p>Be sure to close all tags!</p>
+  <hr />
+</div>
+);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md b/curriculum/challenges/italian/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
new file mode 100644
index 0000000000..661ea8e6dd
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
@@ -0,0 +1,187 @@
+---
+id: 5a24c314108439a4d4036180
+title: Optimize Re-Renders with shouldComponentUpdate
+challengeType: 6
+forumTopicId: 301398
+dashedName: optimize-re-renders-with-shouldcomponentupdate
+---
+
+# --description--
+
+So far, if any component receives new `state` or new `props`, it re-renders itself and all its children. This is usually okay. But React provides a lifecycle method you can call when child components receive new `state` or `props`, and declare specifically if the components should update or not. The method is `shouldComponentUpdate()`, and it takes `nextProps` and `nextState` as parameters.
+
+This method is a useful way to optimize performance. For example, the default behavior is that your component re-renders when it receives new `props`, even if the `props` haven't changed. You can use `shouldComponentUpdate()` to prevent this by comparing the `props`. The method must return a `boolean` value that tells React whether or not to update the component. You can compare the current props (`this.props`) to the next props (`nextProps`) to determine if you need to update or not, and return `true` or `false` accordingly.
+
+# --instructions--
+
+The `shouldComponentUpdate()` method is added in a component called `OnlyEvens`. Currently, this method returns `true` so `OnlyEvens` re-renders every time it receives new `props`. Modify the method so `OnlyEvens` updates only if the `value` of its new props is even. Click the `Add` button and watch the order of events in your browser's console as the lifecycle hooks are triggered.
+
+# --hints--
+
+The `Controller` component should render the `OnlyEvens` component as a child.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(Controller));
+    return (
+      mockedComponent.find('Controller').length === 1 &&
+      mockedComponent.find('OnlyEvens').length === 1
+    );
+  })()
+);
+```
+
+The `shouldComponentUpdate` method should be defined on the `OnlyEvens` component.
+
+```js
+assert(
+  (() => {
+    const child = React.createElement(OnlyEvens)
+      .type.prototype.shouldComponentUpdate.toString()
+      .replace(/s/g, '');
+    return child !== 'undefined';
+  })()
+);
+```
+
+The `OnlyEvens` component should return an `h1` tag which renders the value of `this.props.value`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(Controller));
+  const first = () => {
+    mockedComponent.setState({ value: 1000 });
+    return mockedComponent.find('h1').html();
+  };
+  const second = () => {
+    mockedComponent.setState({ value: 10 });
+    return mockedComponent.find('h1').html();
+  };
+  const firstValue = first();
+  const secondValue = second();
+  assert(firstValue === '<h1>1000</h1>' && secondValue === '<h1>10</h1>');
+})();
+```
+
+`OnlyEvens` should re-render only when `nextProps.value` is even.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(Controller));
+  const first = () => {
+    mockedComponent.setState({ value: 8 });
+    return mockedComponent.find('h1').text();
+  };
+  const second = () => {
+    mockedComponent.setState({ value: 7 });
+    return mockedComponent.find('h1').text();
+  };
+  const third = () => {
+    mockedComponent.setState({ value: 42 });
+    return mockedComponent.find('h1').text();
+  };
+  const firstValue = first();
+  const secondValue = second();
+  const thirdValue = third();
+  assert(firstValue === '8' && secondValue === '8' && thirdValue === '42');
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Controller />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class OnlyEvens extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  shouldComponentUpdate(nextProps, nextState) {
+    console.log('Should I update?');
+    // Change code below this line
+    return true;
+    // Change code above this line
+  }
+  componentDidUpdate() {
+    console.log('Component re-rendered.');
+  }
+  render() {
+    return <h1>{this.props.value}</h1>;
+  }
+}
+
+class Controller extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      value: 0
+    };
+    this.addValue = this.addValue.bind(this);
+  }
+  addValue() {
+    this.setState(state => ({
+      value: state.value + 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.addValue}>Add</button>
+        <OnlyEvens value={this.state.value} />
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class OnlyEvens extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  shouldComponentUpdate(nextProps, nextState) {
+    console.log('Should I update?');
+    // Change code below this line
+    return nextProps.value % 2 === 0;
+    // Change code above this line
+  }
+  componentDidUpdate() {
+    console.log('Component re-rendered.');
+  }
+  render() {
+    return <h1>{this.props.value}</h1>;
+  }
+}
+
+class Controller extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      value: 0
+    };
+    this.addValue = this.addValue.bind(this);
+  }
+  addValue() {
+    this.setState(state => ({
+      value: state.value + 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.addValue}>Add</button>
+        <OnlyEvens value={this.state.value} />
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/override-default-props.md b/curriculum/challenges/italian/03-front-end-libraries/react/override-default-props.md
new file mode 100644
index 0000000000..9a6afa9795
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/override-default-props.md
@@ -0,0 +1,112 @@
+---
+id: 5a24c314108439a4d403616c
+title: Override Default Props
+challengeType: 6
+forumTopicId: 301399
+dashedName: override-default-props
+---
+
+# --description--
+
+The ability to set default props is a useful feature in React. The way to override the default props is to explicitly set the prop values for a component.
+
+# --instructions--
+
+The `ShoppingCart` component now renders a child component `Items`. This `Items` component has a default prop `quantity` set to the integer `0`. Override the default prop by passing in a value of `10` for `quantity`.
+
+**Note:** Remember that the syntax to add a prop to a component looks similar to how you add HTML attributes. However, since the value for `quantity` is an integer, it won't go in quotes but it should be wrapped in curly braces. For example, `{100}`. This syntax tells JSX to interpret the value within the braces directly as JavaScript.
+
+# --hints--
+
+The component `ShoppingCart` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The component `Items` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('Items').length === 1;
+  })()
+);
+```
+
+The `Items` component should have a prop of `{ quantity: 10 }` passed from the `ShoppingCart` component.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+      return (
+        mockedComponent.find('Items').props().quantity == 10 &&
+        getUserInput('index')
+          .replace(/ /g, '')
+          .includes('<Itemsquantity={10}/>')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+}
+
+Items.defaultProps = {
+  quantity: 0
+}
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    { /* Change code below this line */ }
+    return <Items />
+    { /* Change code above this line */ }
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+}
+
+Items.defaultProps = {
+  quantity: 0
+}
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    { /* Change code below this line */ }
+    return <Items quantity = {10} />
+    { /* Change code above this line */ }
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/pass-a-callback-as-props.md b/curriculum/challenges/italian/03-front-end-libraries/react/pass-a-callback-as-props.md
new file mode 100644
index 0000000000..e542314e5f
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/pass-a-callback-as-props.md
@@ -0,0 +1,217 @@
+---
+id: 5a24c314108439a4d403617b
+title: Pass a Callback as Props
+challengeType: 6
+forumTopicId: 301400
+dashedName: pass-a-callback-as-props
+---
+
+# --description--
+
+You can pass `state` as props to child components, but you're not limited to passing data. You can also pass handler functions or any method that's defined on a React component to a child component. This is how you allow child components to interact with their parent components. You pass methods to a child just like a regular prop. It's assigned a name and you have access to that method name under `this.props` in the child component.
+
+# --instructions--
+
+There are three components outlined in the code editor. The `MyApp` component is the parent that will render the `GetInput` and `RenderInput` child components. Add the `GetInput` component to the render method in `MyApp`, then pass it a prop called `input` assigned to `inputValue` from `MyApp`'s `state`. Also create a prop called `handleChange` and pass the input handler `handleChange` to it.
+
+Next, add `RenderInput` to the render method in `MyApp`, then create a prop called `input` and pass the `inputValue` from `state` to it. Once you are finished you will be able to type in the `input` field in the `GetInput` component, which then calls the handler method in its parent via props. This updates the input in the `state` of the parent, which is passed as props to both children. Observe how the data flows between the components and how the single source of truth remains the `state` of the parent component. Admittedly, this example is a bit contrived, but should serve to illustrate how data and callbacks can be passed between React components.
+
+# --hints--
+
+The `MyApp` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('MyApp').length === 1;
+  })()
+);
+```
+
+The `GetInput` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('GetInput').length === 1;
+  })()
+);
+```
+
+The `RenderInput` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('RenderInput').length === 1;
+  })()
+);
+```
+
+The `GetInput` component should receive the `MyApp` state property `inputValue` as props and contain an `input` element which modifies `MyApp` state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const state_1 = () => {
+    mockedComponent.setState({ inputValue: '' });
+    return waitForIt(() => mockedComponent.state());
+  };
+  const state_2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return waitForIt(() => mockedComponent.state());
+  };
+  const updated_1 = await state_1();
+  const updated_2 = await state_2();
+  assert(updated_1.inputValue === '' && updated_2.inputValue === 'TestInput');
+};
+```
+
+The `RenderInput` component should receive the `MyApp` state property `inputValue` as props.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const state_1 = () => {
+    mockedComponent.setState({ inputValue: 'TestName' });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated_1 = await state_1();
+  assert(updated_1.find('p').text().includes('TestName'));
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyApp />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      inputValue: ''
+    }
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      inputValue: event.target.value
+    });
+  }
+  render() {
+    return (
+       <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+       </div>
+    );
+  }
+};
+
+class GetInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Get Input:</h3>
+        <input
+          value={this.props.input}
+          onChange={this.props.handleChange}/>
+      </div>
+    );
+  }
+};
+
+class RenderInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Input Render:</h3>
+        <p>{this.props.input}</p>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      inputValue: ''
+    }
+  this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      inputValue: event.target.value
+    });
+  }
+  render() {
+    return (
+       <div>
+         <GetInput
+           input={this.state.inputValue}
+           handleChange={this.handleChange}/>
+         <RenderInput
+           input={this.state.inputValue}/>
+       </div>
+    );
+  }
+};
+
+class GetInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Get Input:</h3>
+        <input
+          value={this.props.input}
+          onChange={this.props.handleChange}/>
+      </div>
+    );
+  }
+};
+
+class RenderInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Input Render:</h3>
+        <p>{this.props.input}</p>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/pass-an-array-as-props.md b/curriculum/challenges/italian/03-front-end-libraries/react/pass-an-array-as-props.md
new file mode 100644
index 0000000000..a5b7170b30
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/pass-an-array-as-props.md
@@ -0,0 +1,186 @@
+---
+id: 5a24c314108439a4d403616a
+title: Pass an Array as Props
+challengeType: 6
+forumTopicId: 301401
+dashedName: pass-an-array-as-props
+---
+
+# --description--
+
+The last challenge demonstrated how to pass information from a parent component to a child component as `props` or properties. This challenge looks at how arrays can be passed as `props`. To pass an array to a JSX element, it must be treated as JavaScript and wrapped in curly braces.
+
+```jsx
+<ParentComponent>
+  <ChildComponent colors={["green", "blue", "red"]} />
+</ParentComponent>
+```
+
+The child component then has access to the array property `colors`. Array methods such as `join()` can be used when accessing the property. `const ChildComponent = (props) => <p>{props.colors.join(', ')}</p>` This will join all `colors` array items into a comma separated string and produce: `<p>green, blue, red</p>` Later, we will learn about other common methods to render arrays of data in React.
+
+# --instructions--
+
+There are `List` and `ToDo` components in the code editor. When rendering each `List` from the `ToDo` component, pass in a `tasks` property assigned to an array of to-do tasks, for example `["walk dog", "workout"]`. Then access this `tasks` array in the `List` component, showing its value within the `p` element. Use `join(", ")` to display the `props.tasks`array in the `p` element as a comma separated list. Today's list should have at least 2 tasks and tomorrow's should have at least 3 tasks.
+
+# --hints--
+
+The `ToDo` component should return a single outer `div`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().type() === 'div';
+  })()
+);
+```
+
+The third child of the `ToDo` component should be an instance of the `List` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().childAt(2).name() === 'List';
+  })()
+);
+```
+
+The fifth child of the `ToDo` component should be an instance of the `List` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().childAt(4).name() === 'List';
+  })()
+);
+```
+
+Both instances of the `List` component should have a property called `tasks` and `tasks` should be of type array.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return (
+      Array.isArray(mockedComponent.find('List').get(0).props.tasks) &&
+      Array.isArray(mockedComponent.find('List').get(1).props.tasks)
+    );
+  })()
+);
+```
+
+The first `List` component representing the tasks for today should have 2 or more items.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.find('List').get(0).props.tasks.length >= 2;
+  })()
+);
+```
+
+The second `List` component representing the tasks for tomorrow should have 3 or more items.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.find('List').get(1).props.tasks.length >= 3;
+  })()
+);
+```
+
+The `List` component should render the value from the `tasks` prop in the `p` tag.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return (
+      mockedComponent
+        .find('p')
+        .get(0)
+        .props.children.replace(/\s*,\s*/g, ',') ===
+        mockedComponent
+          .find('List')
+          .get(0)
+          .props.tasks.join(',')
+          .replace(/\s*,\s*/g, ',') &&
+      mockedComponent
+        .find('p')
+        .get(1)
+        .props.children.replace(/\s*,\s*/g, ',') ===
+        mockedComponent
+          .find('List')
+          .get(1)
+          .props.tasks.join(',')
+          .replace(/\s*,\s*/g, ',')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ToDo />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const List = (props) => {
+  { /* Change code below this line */ }
+  return <p>{}</p>
+  { /* Change code above this line */ }
+};
+
+class ToDo extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>To Do Lists</h1>
+        <h2>Today</h2>
+        { /* Change code below this line */ }
+        <List/>
+        <h2>Tomorrow</h2>
+        <List/>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const List= (props) => {
+  return <p>{props.tasks.join(', ')}</p>
+};
+
+class ToDo extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>To Do Lists</h1>
+        <h2>Today</h2>
+        <List tasks={['study', 'exercise']} />
+        <h2>Tomorrow</h2>
+        <List tasks={['call Sam', 'grocery shopping', 'order tickets']} />
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md b/curriculum/challenges/italian/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
new file mode 100644
index 0000000000..b8f6117708
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
@@ -0,0 +1,164 @@
+---
+id: 5a24c314108439a4d4036169
+title: Pass Props to a Stateless Functional Component
+challengeType: 6
+forumTopicId: 301402
+dashedName: pass-props-to-a-stateless-functional-component
+---
+
+# --description--
+
+The previous challenges covered a lot about creating and composing JSX elements, functional components, and ES6 style class components in React. With this foundation, it's time to look at another feature very common in React: **props**. In React, you can pass props, or properties, to child components. Say you have an `App` component which renders a child component called `Welcome` which is a stateless functional component. You can pass `Welcome` a `user` property by writing:
+
+```jsx
+<App>
+  <Welcome user='Mark' />
+</App>
+```
+
+You use **custom HTML attributes** created by you and supported by React to be passed to the component. In this case, the created property `user` is passed to the component `Welcome`. Since `Welcome` is a stateless functional component, it has access to this value like so:
+
+```jsx
+const Welcome = (props) => <h1>Hello, {props.user}!</h1>
+```
+
+It is standard to call this value `props` and when dealing with stateless functional components, you basically consider it as an argument to a function which returns JSX. You can access the value of the argument in the function body. With class components, you will see this is a little different.
+
+# --instructions--
+
+There are `Calendar` and `CurrentDate` components in the code editor. When rendering `CurrentDate` from the `Calendar` component, pass in a property of `date` assigned to the current date from JavaScript's `Date` object. Then access this `prop` in the `CurrentDate` component, showing its value within the `p` tags. Note that for `prop` values to be evaluated as JavaScript, they must be enclosed in curly brackets, for instance `date={Date()}`.
+
+# --hints--
+
+The `Calendar` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The second child of the `Calendar` component should be the `CurrentDate` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().childAt(1).name() === 'CurrentDate';
+  })()
+);
+```
+
+The `CurrentDate` component should have a prop called `date`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().childAt(1).props().date;
+  })()
+);
+```
+
+The `date` prop of the `CurrentDate` should contain a string of text.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    const prop = mockedComponent.children().childAt(1).props().date;
+    return typeof prop === 'string' && prop.length > 0;
+  })()
+);
+```
+
+The `date` prop should be generated by calling `Date()`
+
+```js
+assert(/<CurrentDatedate={Date\(\)}\/>/.test(__helpers.removeWhiteSpace(code)));
+```
+
+The `CurrentDate` component should render the value from the `date` prop in the `p` tag.
+
+```js
+let date = 'dummy date';
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(CurrentDate, { date })
+    );
+    return mockedComponent.find('p').html().includes(date);
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Calendar />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const CurrentDate = (props) => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+      <p>The current date is: </p>
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class Calendar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>What date is it?</h3>
+        { /* Change code below this line */ }
+        <CurrentDate />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const CurrentDate = (props) => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+      <p>The current date is: {props.date}</p>
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class Calendar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>What date is it?</h3>
+        { /* Change code below this line */ }
+        <CurrentDate date={Date()} />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/pass-state-as-props-to-child-components.md b/curriculum/challenges/italian/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
new file mode 100644
index 0000000000..e0554a5a98
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
@@ -0,0 +1,145 @@
+---
+id: 5a24c314108439a4d403617a
+title: Pass State as Props to Child Components
+challengeType: 6
+forumTopicId: 301403
+dashedName: pass-state-as-props-to-child-components
+---
+
+# --description--
+
+You saw a lot of examples that passed props to child JSX elements and child React components in previous challenges. You may be wondering where those props come from. A common pattern is to have a stateful component containing the `state` important to your app, that then renders child components. You want these components to have access to some pieces of that `state`, which are passed in as props.
+
+For example, maybe you have an `App` component that renders a `Navbar`, among other components. In your `App`, you have `state` that contains a lot of user information, but the `Navbar` only needs access to the user's username so it can display it. You pass that piece of `state` to the `Navbar` component as a prop.
+
+This pattern illustrates some important paradigms in React. The first is *unidirectional data flow*. State flows in one direction down the tree of your application's components, from the stateful parent component to child components. The child components only receive the state data they need. The second is that complex stateful apps can be broken down into just a few, or maybe a single, stateful component. The rest of your components simply receive state from the parent as props, and render a UI from that state. It begins to create a separation where state management is handled in one part of code and UI rendering in another. This principle of separating state logic from UI logic is one of React's key principles. When it's used correctly, it makes the design of complex, stateful applications much easier to manage.
+
+# --instructions--
+
+The `MyApp` component is stateful and renders a `Navbar` component as a child. Pass the `name` property in its `state` down to the child component, then show the `name` in the `h1` tag that's part of the `Navbar` render method. `name` should appear after the text `Hello, my name is:`.
+
+# --hints--
+
+The `MyApp` component should render with a `Navbar` component inside.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return (
+      mockedComponent.find('MyApp').length === 1 &&
+      mockedComponent.find('Navbar').length === 1
+    );
+  })()
+);
+```
+
+The `Navbar` component should receive the `MyApp` state property `name` as props.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const setState = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.find('Navbar').props());
+  };
+  const navProps = await setState();
+  assert(navProps.name === 'TestName');
+};
+```
+
+The `h1` element in `Navbar` should render the `name` prop.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const navH1Before = mockedComponent.find('Navbar').find('h1').text();
+  const setState = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.find('Navbar').find('h1').text());
+  };
+  const navH1After = await setState();
+  assert(new RegExp('TestName').test(navH1After) && navH1After !== navH1Before);
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyApp />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'CamperBot'
+    }
+  }
+  render() {
+    return (
+       <div>
+         {/* Change code below this line */}
+         <Navbar />
+         {/* Change code above this line */}
+       </div>
+    );
+  }
+};
+
+class Navbar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+    <div>
+      {/* Change code below this line */}
+      <h1>Hello, my name is: </h1>
+      {/* Change code above this line */}
+    </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'CamperBot'
+    }
+  }
+  render() {
+    return (
+       <div>
+         <Navbar name={this.state.name}/>
+       </div>
+    );
+  }
+};
+class Navbar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+    <div>
+      <h1>Hello, my name is: {this.props.name}</h1>
+    </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-a-class-component-to-the-dom.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
new file mode 100644
index 0000000000..2e3a9a7a56
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
@@ -0,0 +1,159 @@
+---
+id: 5a24c314108439a4d4036167
+title: Render a Class Component to the DOM
+challengeType: 6
+forumTopicId: 301404
+dashedName: render-a-class-component-to-the-dom
+---
+
+# --description--
+
+You may remember using the ReactDOM API in an earlier challenge to render JSX elements to the DOM. The process for rendering React components will look very similar. The past few challenges focused on components and composition, so the rendering was done for you behind the scenes. However, none of the React code you write will render to the DOM without making a call to the ReactDOM API.
+
+Here's a refresher on the syntax: `ReactDOM.render(componentToRender, targetNode)`. The first argument is the React component that you want to render. The second argument is the DOM node that you want to render that component within.
+
+React components are passed into `ReactDOM.render()` a little differently than JSX elements. For JSX elements, you pass in the name of the element that you want to render. However, for React components, you need to use the same syntax as if you were rendering a nested component, for example `ReactDOM.render(<ComponentToRender />, targetNode)`. You use this syntax for both ES6 class components and functional components.
+
+# --instructions--
+
+Both the `Fruits` and `Vegetables` components are defined for you behind the scenes. Render both components as children of the `TypesOfFood` component, then render `TypesOfFood` to the DOM. There is a `div` with `id='challenge-node'` available for you to use.
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `TypesOfFood` component should render the `Fruits` component after the `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(1).name() === 'Fruits';
+  })()
+);
+```
+
+The `TypesOfFood` component should render the `Vegetables` component after `Fruits`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(2).name() === 'Vegetables';
+  })()
+);
+```
+
+The `TypesOfFood` component should render to the DOM within the `div` with the id `challenge-node`.
+
+```js
+assert(
+  (function () {
+    const html = document.getElementById('challenge-node').childNodes[0]
+      .innerHTML;
+    return (
+      html.includes(
+        '<div><h2>Fruits:</h2><h4>Non-Citrus:</h4><ul><li>Apples</li><li>Blueberries</li><li>Strawberries</li><li>Bananas</li></ul><h4>Citrus:</h4><ul><li>Lemon</li><li>Lime</li><li>Orange</li><li>Grapefruit</li></ul></div>'
+      ) &&
+      html.includes(
+        '<div><h2>Vegetables:</h2><ul><li>Brussel Sprouts</li><li>Broccoli</li><li>Squash</li></ul></div>'
+      )
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+const Fruits = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <h4>Non-Citrus:</h4>
+        <ul>
+          <li>Apples</li>
+          <li>Blueberries</li>
+          <li>Strawberries</li>
+          <li>Bananas</li>
+        </ul>
+      <h4>Citrus:</h4>
+        <ul>
+          <li>Lemon</li>
+          <li>Lime</li>
+          <li>Orange</li>
+          <li>Grapefruit</li>
+        </ul>
+    </div>
+  );
+};
+const Vegetables = () => {
+  return (
+    <div>
+      <h2>Vegetables:</h2>
+      <ul>
+        <li>Brussel Sprouts</li>
+        <li>Broccoli</li>
+        <li>Squash</li>
+      </ul>
+    </div>
+  );
+};
+```
+
+## --seed-contents--
+
+```jsx
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        {/* Change code below this line */}
+          <Fruits />
+           <Vegetables />
+         {/* Change code above this line */}
+      </div>
+    );
+  }
+};
+
+// Change code below this line
+ReactDOM.render(<TypesOfFood />, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-conditionally-from-props.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-conditionally-from-props.md
new file mode 100644
index 0000000000..e69e98305a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-conditionally-from-props.md
@@ -0,0 +1,303 @@
+---
+id: 5a24c314108439a4d4036188
+title: Render Conditionally from Props
+challengeType: 6
+forumTopicId: 301405
+dashedName: render-conditionally-from-props
+---
+
+# --description--
+
+So far, you've seen how to use `if/else`, `&&`, and the ternary operator (`condition ? expressionIfTrue : expressionIfFalse`) to make conditional decisions about what to render and when. However, there's one important topic left to discuss that lets you combine any or all of these concepts with another powerful React feature: props. Using props to conditionally render code is very common with React developers — that is, they use the value of a given prop to automatically make decisions about what to render.
+
+In this challenge, you'll set up a child component to make rendering decisions based on props. You'll also use the ternary operator, but you can see how several of the other concepts that were covered in the last few challenges might be just as useful in this context.
+
+# --instructions--
+
+The code editor has two components that are partially defined for you: a parent called `GameOfChance`, and a child called `Results`. They are used to create a simple game where the user presses a button to see if they win or lose.
+
+First, you'll need a simple expression that randomly returns a different value every time it is run. You can use `Math.random()`. This method returns a value between `0` (inclusive) and `1` (exclusive) each time it is called. So for 50/50 odds, use `Math.random() >= .5` in your expression. Statistically speaking, this expression will return `true` 50% of the time, and `false` the other 50%. In the render method, replace `null` with the above expression to complete the variable declaration.
+
+Now you have an expression that you can use to make a randomized decision in the code. Next you need to implement this. Render the `Results` component as a child of `GameOfChance`, and pass in `expression` as a prop called `fiftyFifty`. In the `Results` component, write a ternary expression to render the `h1` element with the text `You Win!` or `You Lose!` based on the `fiftyFifty` prop that's being passed in from `GameOfChance`. Finally, make sure the `handleClick()` method is correctly counting each turn so the user knows how many times they've played. This also serves to let the user know the component has actually updated in case they win or lose twice in a row.
+
+# --hints--
+
+The `GameOfChance` component should exist and render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('GameOfChance').length,
+  1
+);
+```
+
+`GameOfChance` should return a single `button` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('button').length,
+  1
+);
+```
+
+`GameOfChance` should return a single instance of the `Results` component, which has a prop called `fiftyFifty`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(GameOfChance)).find('Results').length ===
+    1 &&
+    Enzyme.mount(React.createElement(GameOfChance))
+      .find('Results')
+      .props()
+      .hasOwnProperty('fiftyFifty') === true
+);
+```
+
+`GameOfChance` state should be initialized with a property of `counter` set to a value of `1`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).state().counter,
+  1
+);
+```
+
+When the `GameOfChance` component is first rendered to the DOM, a `p` element should be returned with the inner text of `Turn: 1`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('p').text(),
+  'Turn: 1'
+);
+```
+
+Each time the button is clicked, the counter state should be incremented by a value of 1, and a single `p` element should be rendered to the DOM that contains the text `Turn: N`, where `N` is the value of the counter state.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(GameOfChance));
+  const simulate = () => {
+    comp.find('button').simulate('click');
+  };
+  const result = () => ({
+    count: comp.state('counter'),
+    text: comp.find('p').text()
+  });
+  const _1 = () => {
+    simulate();
+    return result();
+  };
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _1_val = _1();
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  assert(
+    _1_val.count === 2 &&
+      _1_val.text === 'Turn: 2' &&
+      _2_val.count === 3 &&
+      _2_val.text === 'Turn: 3' &&
+      _3_val.count === 4 &&
+      _3_val.text === 'Turn: 4' &&
+      _4_val.count === 5 &&
+      _4_val.text === 'Turn: 5' &&
+      _5_val.count === 6 &&
+      _5_val.text === 'Turn: 6'
+  );
+})();
+```
+
+When the `GameOfChance` component is first mounted to the DOM and each time the button is clicked thereafter, a single `h1` element should be returned that randomly renders either `You Win!` or `You Lose!`.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(GameOfChance));
+  const simulate = () => {
+    comp.find('button').simulate('click');
+  };
+  const result = () => ({
+    h1: comp.find('h1').length,
+    text: comp.find('h1').text()
+  });
+  const _1 = result();
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _6 = () => {
+    simulate();
+    return result();
+  };
+  const _7 = () => {
+    simulate();
+    return result();
+  };
+  const _8 = () => {
+    simulate();
+    return result();
+  };
+  const _9 = () => {
+    simulate();
+    return result();
+  };
+  const _10 = () => {
+    simulate();
+    return result();
+  };
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  const _6_val = _6();
+  const _7_val = _7();
+  const _8_val = _8();
+  const _9_val = _9();
+  const _10_val = _10();
+  const __text = new Set([
+    _1.text,
+    _2_val.text,
+    _3_val.text,
+    _4_val.text,
+    _5_val.text,
+    _6_val.text,
+    _7_val.text,
+    _8_val.text,
+    _9_val.text,
+    _10_val.text
+  ]);
+  const __h1 = new Set([
+    _1.h1,
+    _2_val.h1,
+    _3_val.h1,
+    _4_val.h1,
+    _5_val.h1,
+    _6_val.h1,
+    _7_val.h1,
+    _8_val.h1,
+    _9_val.h1,
+    _10_val.h1
+  ]);
+  assert(__text.size === 2 && __h1.size === 1);
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<GameOfChance />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class Results extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    {/* Change code below this line */}
+    return <h1></h1>;
+    {/* Change code above this line */}
+  }
+}
+
+class GameOfChance extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      counter: 1
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState(prevState => {
+      // Complete the return statement:
+      return {
+        counter: prevState
+      }
+    });
+  }
+  render() {
+    const expression = null; // Change this line
+    return (
+      <div>
+        <button onClick={this.handleClick}>Play Again</button>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+        <p>{'Turn: ' + this.state.counter}</p>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class Results extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h1>{this.props.fiftyFifty ? 'You Win!' : 'You Lose!'}</h1>;
+  }
+}
+
+class GameOfChance extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      counter: 1
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState(prevState => {
+      return {
+        counter: prevState.counter + 1
+      }
+    });
+  }
+  render() {
+    const expression = Math.random() >= 0.5;
+    return (
+      <div>
+        <button onClick={this.handleClick}>Play Again</button>
+        <Results fiftyFifty={expression} />
+        <p>{'Turn: ' + this.state.counter}</p>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-html-elements-to-the-dom.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-html-elements-to-the-dom.md
new file mode 100644
index 0000000000..d5167e4e13
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-html-elements-to-the-dom.md
@@ -0,0 +1,75 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5f
+title: Render HTML Elements to the DOM
+challengeType: 6
+forumTopicId: 301406
+dashedName: render-html-elements-to-the-dom
+---
+
+# --description--
+
+So far, you've learned that JSX is a convenient tool to write readable HTML within JavaScript. With React, we can render this JSX directly to the HTML DOM using React's rendering API known as ReactDOM.
+
+ReactDOM offers a simple method to render React elements to the DOM which looks like this: `ReactDOM.render(componentToRender, targetNode)`, where the first argument is the React element or component that you want to render, and the second argument is the DOM node that you want to render the component to.
+
+As you would expect, `ReactDOM.render()` must be called after the JSX element declarations, just like how you must declare variables before using them.
+
+# --instructions--
+
+The code editor has a simple JSX component. Use the `ReactDOM.render()` method to render this component to the page. You can pass defined JSX elements directly in as the first argument and use `document.getElementById()` to select the DOM node to render them to. There is a `div` with `id='challenge-node'` available for you to use. Make sure you don't change the `JSX` constant.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The provided JSX element should render to the DOM node with id `challenge-node`.
+
+```js
+assert(
+  document.getElementById('challenge-node').childNodes[0].innerHTML ===
+    '<h1>Hello World</h1><p>Lets render this to the DOM</p>'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>Hello World</h1>
+    <p>Lets render this to the DOM</p>
+  </div>
+);
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>Hello World</h1>
+  <p>Lets render this to the DOM</p>
+</div>
+);
+// Change code below this line
+ReactDOM.render(JSX, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
new file mode 100644
index 0000000000..bfced52d4b
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
@@ -0,0 +1,76 @@
+---
+id: 5a24c314108439a4d403618d
+title: Render React on the Server with renderToString
+challengeType: 6
+forumTopicId: 301407
+dashedName: render-react-on-the-server-with-rendertostring
+---
+
+# --description--
+
+So far, you have been rendering React components on the client. Normally, this is what you will always do. However, there are some use cases where it makes sense to render a React component on the server. Since React is a JavaScript view library and you can run JavaScript on the server with Node, this is possible. In fact, React provides a `renderToString()` method you can use for this purpose.
+
+There are two key reasons why rendering on the server may be used in a real world app. First, without doing this, your React apps would consist of a relatively empty HTML file and a large bundle of JavaScript when it's initially loaded to the browser. This may not be ideal for search engines that are trying to index the content of your pages so people can find you. If you render the initial HTML markup on the server and send this to the client, the initial page load contains all of the page's markup which can be crawled by search engines. Second, this creates a faster initial page load experience because the rendered HTML is smaller than the JavaScript code of the entire app. React will still be able to recognize your app and manage it after the initial load.
+
+# --instructions--
+
+The `renderToString()` method is provided on `ReactDOMServer`, which is available here as a global object. The method takes one argument which is a React element. Use this to render `App` to a string.
+
+# --hints--
+
+The `App` component should render to a string using `ReactDOMServer.renderToString`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index')
+      .replace(/ /g, '')
+      .includes('ReactDOMServer.renderToString(<App/>)') &&
+      Enzyme.mount(React.createElement(App)).children().name() === 'div'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var ReactDOMServer = { renderToString(x) { return null; } };
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<App />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class App extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <div/>
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class App extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <div/>
+  }
+};
+
+// Change code below this line
+ReactDOMServer.renderToString(<App/>);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
new file mode 100644
index 0000000000..e1dd33ed04
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
@@ -0,0 +1,119 @@
+---
+id: 5a24c314108439a4d4036172
+title: Render State in the User Interface Another Way
+challengeType: 6
+forumTopicId: 301408
+dashedName: render-state-in-the-user-interface-another-way
+---
+
+# --description--
+
+There is another way to access `state` in a component. In the `render()` method, before the `return` statement, you can write JavaScript directly. For example, you could declare functions, access data from `state` or `props`, perform computations on this data, and so on. Then, you can assign any data to variables, which you have access to in the `return` statement.
+
+# --instructions--
+
+In the `MyComponent` render method, define a `const` called `name` and set it equal to the name value in the component's `state`. Because you can write JavaScript directly in this part of the code, you don't have to enclose this reference in curly braces.
+
+Next, in the return statement, render this value in an `h1` tag using the variable `name`. Remember, you need to use the JSX syntax (curly braces for JavaScript) in the return statement.
+
+# --hints--
+
+`MyComponent` should have a key `name` with value `freeCodeCamp` stored in its state.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'freeCodeCamp'
+);
+```
+
+`MyComponent` should render an `h1` header enclosed in a single `div`.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.mount(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The rendered `h1` tag should include a reference to `{name}`.
+
+```js
+(getUserInput) =>
+  assert(/<h1>\n*\s*\{\s*name\s*\}\s*\n*<\/h1>/.test(getUserInput('index')));
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  assert(firstValue === '<div><h1>TestName</h1></div>');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    // Change code below this line
+
+    // Change code above this line
+    return (
+      <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    // Change code below this line
+    const name = this.state.name;
+    // Change code above this line
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <h1>{name}</h1>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface.md
new file mode 100644
index 0000000000..766b22bd9a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-state-in-the-user-interface.md
@@ -0,0 +1,113 @@
+---
+id: 5a24c314108439a4d4036171
+title: Render State in the User Interface
+challengeType: 6
+forumTopicId: 301409
+dashedName: render-state-in-the-user-interface
+---
+
+# --description--
+
+Once you define a component's initial state, you can display any part of it in the UI that is rendered. If a component is stateful, it will always have access to the data in `state` in its `render()` method. You can access the data with `this.state`.
+
+If you want to access a state value within the `return` of the render method, you have to enclose the value in curly braces.
+
+`state` is one of the most powerful features of components in React. It allows you to track important data in your app and render a UI in response to changes in this data. If your data changes, your UI will change. React uses what is called a virtual DOM, to keep track of changes behind the scenes. When state data updates, it triggers a re-render of the components using that data - including child components that received the data as a prop. React updates the actual DOM, but only where necessary. This means you don't have to worry about changing the DOM. You simply declare what the UI should look like.
+
+Note that if you make a component stateful, no other components are aware of its `state`. Its `state` is completely encapsulated, or local to that component, unless you pass state data to a child component as `props`. This notion of encapsulated `state` is very important because it allows you to write certain logic, then have that logic contained and isolated in one place in your code.
+
+# --instructions--
+
+In the code editor, `MyComponent` is already stateful. Define an `h1` tag in the component's render method which renders the value of `name` from the component's state.
+
+**Note:** The `h1` should only render the value from `state` and nothing else. In JSX, any code you write with curly braces `{ }` will be treated as JavaScript. So to access the value from `state` just enclose the reference in curly braces.
+
+# --hints--
+
+`MyComponent` should have a key `name` with value `freeCodeCamp` stored in its state.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'freeCodeCamp'
+);
+```
+
+`MyComponent` should render an `h1` header enclosed in a single `div`.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.mount(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  const getValue = firstValue.replace(/\s/g, '');
+  assert(getValue === '<div><h1>TestName</h1></div>');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <h1>{this.state.name}</h1>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/render-with-an-if-else-condition.md b/curriculum/challenges/italian/03-front-end-libraries/react/render-with-an-if-else-condition.md
new file mode 100644
index 0000000000..b56c814074
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/render-with-an-if-else-condition.md
@@ -0,0 +1,155 @@
+---
+id: 5a24c314108439a4d4036184
+title: Render with an If-Else Condition
+challengeType: 6
+forumTopicId: 301410
+dashedName: render-with-an-if-else-condition
+---
+
+# --description--
+
+Another application of using JavaScript to control your rendered view is to tie the elements that are rendered to a condition. When the condition is true, one view renders. When it's false, it's a different view. You can do this with a standard `if/else` statement in the `render()` method of a React component.
+
+# --instructions--
+
+MyComponent contains a `boolean` in its state which tracks whether you want to display some element in the UI or not. The `button` toggles the state of this value. Currently, it renders the same UI every time. Rewrite the `render()` method with an `if/else` statement so that if `display` is `true`, you return the current markup. Otherwise, return the markup without the `h1` element.
+
+**Note:** You must write an `if/else` to pass the tests. Use of the ternary operator will not pass here.
+
+# --hints--
+
+`MyComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('MyComponent').length === 1;
+  })()
+);
+```
+
+When `display` is set to `true`, a `div`, `button`, and `h1` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: true });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('div').children().length === 2 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('h1').length === 1
+  );
+};
+```
+
+When `display` is set to `false`, only a `div` and `button` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: false });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('div').children().length === 1 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('h1').length === 0
+  );
+};
+```
+
+The render method should use an `if/else` statement to check the condition of `this.state.display`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').includes('if') &&
+      getUserInput('index').includes('else')
+  );
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+    this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState((state) => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         <h1>Displayed!</h1>
+       </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+ this.toggleDisplay = this.toggleDisplay.bind(this);
+ }
+  toggleDisplay() {
+    this.setState((state) => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    if (this.state.display) {
+      return (
+         <div>
+           <button onClick={this.toggleDisplay}>Toggle Display</button>
+           <h1>Displayed!</h1>
+         </div>
+      );
+    } else {
+      return (
+        <div>
+           <button onClick={this.toggleDisplay}>Toggle Display</button>
+         </div>
+      );
+    }
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md b/curriculum/challenges/italian/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
new file mode 100644
index 0000000000..c9d751ce8d
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
@@ -0,0 +1,145 @@
+---
+id: 5a24c314108439a4d403616f
+title: Review Using Props with Stateless Functional Components
+challengeType: 6
+forumTopicId: 301411
+dashedName: review-using-props-with-stateless-functional-components
+---
+
+# --description--
+
+Except for the last challenge, you've been passing props to stateless functional components. These components act like pure functions. They accept props as input and return the same view every time they are passed the same props. You may be wondering what state is, and the next challenge will cover it in more detail. Before that, here's a review of the terminology for components.
+
+A *stateless functional component* is any function you write which accepts props and returns JSX. A *stateless component*, on the other hand, is a class that extends `React.Component`, but does not use internal state (covered in the next challenge). Finally, a *stateful component* is a class component that does maintain its own internal state. You may see stateful components referred to simply as components or React components.
+
+A common pattern is to try to minimize statefulness and to create stateless functional components wherever possible. This helps contain your state management to a specific area of your application. In turn, this improves development and maintenance of your app by making it easier to follow how changes to state affect its behavior.
+
+# --instructions--
+
+The code editor has a `CampSite` component that renders a `Camper` component as a child. Define the `Camper` component and assign it default props of `{ name: 'CamperBot' }`. Inside the `Camper` component, render any code that you want, but make sure to have one `p` element that includes only the `name` value that is passed in as a `prop`. Finally, define `propTypes` on the `Camper` component to require `name` to be provided as a prop and verify that it is of type `string`.
+
+# --hints--
+
+The `CampSite` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return mockedComponent.find('CampSite').length === 1;
+  })()
+);
+```
+
+The `Camper` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return mockedComponent.find('Camper').length === 1;
+  })()
+);
+```
+
+The `Camper` component should include default props which assign the string `CamperBot` to the key `name`.
+
+```js
+assert(
+  /Camper.defaultProps={name:(['"`])CamperBot\1,?}/.test(
+    __helpers.removeWhiteSpace(code)
+  )
+);
+```
+
+The `Camper` component should include prop types which require the `name` prop to be of type `string`.
+
+```js
+assert(
+  /Camper.propTypes={name:PropTypes.string.isRequired,?}/.test(
+    __helpers.removeWhiteSpace(code)
+  )
+);
+```
+
+The `Camper` component should contain a `p` element with only the text from the `name` prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return (
+      mockedComponent.find('p').text() ===
+      mockedComponent.find('Camper').props().name
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var PropTypes = {
+   string: { isRequired: true }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<CampSite />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class CampSite extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <Camper/>
+      </div>
+    );
+  }
+};
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class CampSite extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <Camper/>
+      </div>
+    );
+  }
+};
+// Change code below this line
+
+const Camper = (props) => {
+   return (
+     <div>
+       <p>{props.name}</p>
+     </div>
+   );
+};
+
+Camper.propTypes = {
+  name: PropTypes.string.isRequired
+};
+
+Camper.defaultProps = {
+  name: 'CamperBot'
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/set-state-with-this.setstate.md b/curriculum/challenges/italian/03-front-end-libraries/react/set-state-with-this.setstate.md
new file mode 100644
index 0000000000..93b387efc9
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/set-state-with-this.setstate.md
@@ -0,0 +1,143 @@
+---
+id: 5a24c314108439a4d4036173
+title: Set State with this.setState
+challengeType: 6
+forumTopicId: 301412
+dashedName: set-state-with-this-setstate
+---
+
+# --description--
+
+The previous challenges covered component `state` and how to initialize state in the `constructor`. There is also a way to change the component's `state`. React provides a method for updating component `state` called `setState`. You call the `setState` method within your component class like so: `this.setState()`, passing in an object with key-value pairs. The keys are your state properties and the values are the updated state data. For instance, if we were storing a `username` in state and wanted to update it, it would look like this:
+
+```jsx
+this.setState({
+  username: 'Lewis'
+});
+```
+
+React expects you to never modify `state` directly, instead always use `this.setState()` when state changes occur. Also, you should note that React may batch multiple state updates in order to improve performance. What this means is that state updates through the `setState` method can be asynchronous. There is an alternative syntax for the `setState` method which provides a way around this problem. This is rarely needed but it's good to keep it in mind! Please consult the [React documentation](https://facebook.github.io/react/docs/state-and-lifecycle.html) for further details.
+
+# --instructions--
+
+There is a `button` element in the code editor which has an `onClick()` handler. This handler is triggered when the `button` receives a click event in the browser, and runs the `handleClick` method defined on `MyComponent`. Within the `handleClick` method, update the component `state` using `this.setState()`. Set the `name` property in `state` to equal the string `React Rocks!`.
+
+Click the button and watch the rendered state update. Don't worry if you don't fully understand how the click handler code works at this point. It's covered in upcoming challenges.
+
+# --hints--
+
+The state of `MyComponent` should initialize with the key value pair `{ name: Initial State }`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'Initial State'
+);
+```
+
+`MyComponent` should render an `h1` header.
+
+```js
+assert(Enzyme.mount(React.createElement(MyComponent)).find('h1').length === 1);
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  assert(/<h1>TestName<\/h1>/.test(firstValue));
+};
+```
+
+Calling the `handleClick` method on `MyComponent` should set the name property in state to equal `React Rocks!`.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'Before' });
+    return waitForIt(() => mockedComponent.state('name'));
+  };
+  const second = () => {
+    mockedComponent.instance().handleClick();
+    return waitForIt(() => mockedComponent.state('name'));
+  };
+  const firstValue = await first();
+  const secondValue = await second();
+  assert(firstValue === 'Before' && secondValue === 'React Rocks!');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'Initial State'
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    // Change code below this line
+
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.handleClick}>Click Me</button>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'Initial State'
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+     // Change code below this line
+    this.setState({
+      name: 'React Rocks!'
+    });
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <button onClick = {this.handleClick}>Click Me</button>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use--for-a-more-concise-conditional.md b/curriculum/challenges/italian/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
new file mode 100644
index 0000000000..0f13747bc3
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
@@ -0,0 +1,146 @@
+---
+id: 5a24c314108439a4d4036185
+title: Use && for a More Concise Conditional
+challengeType: 6
+forumTopicId: 301413
+dashedName: use--for-a-more-concise-conditional
+---
+
+# --description--
+
+The `if/else` statements worked in the last challenge, but there's a more concise way to achieve the same result. Imagine that you are tracking several conditions in a component and you want different elements to render depending on each of these conditions. If you write a lot of `else if` statements to return slightly different UIs, you may repeat code which leaves room for error. Instead, you can use the `&&` logical operator to perform conditional logic in a more concise way. This is possible because you want to check if a condition is `true`, and if it is, return some markup. Here's an example:
+
+```jsx
+{condition && <p>markup</p>}
+```
+
+If the `condition` is `true`, the markup will be returned. If the condition is `false`, the operation will immediately return `false` after evaluating the `condition` and return nothing. You can include these statements directly in your JSX and string multiple conditions together by writing `&&` after each one. This allows you to handle more complex conditional logic in your `render()` method without repeating a lot of code.
+
+# --instructions--
+
+Solve the previous example again, so the `h1` only renders if `display` is `true`, but use the `&&` logical operator instead of an `if/else` statement.
+
+# --hints--
+
+`MyComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('MyComponent').length;
+  })()
+);
+```
+
+When `display` is set to `true`, a `div`, `button`, and `h1` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: true });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('div').children().length === 2 &&
+      updated.find('button').length === 1 &&
+      updated.find('h1').length === 1
+  );
+};
+```
+
+When `display` is set to `false`, only a `div` and `button` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: false });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('div').children().length === 1 &&
+      updated.find('button').length === 1 &&
+      updated.find('h1').length === 0
+  );
+};
+```
+
+The render method should use the `&&` logical operator to check the condition of `this.state.display`.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('&&'));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+    this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState(state => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         <h1>Displayed!</h1>
+       </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+ this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState(state => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         {this.state.display && <h1>Displayed!</h1>}
+       </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
new file mode 100644
index 0000000000..3329290523
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
@@ -0,0 +1,280 @@
+---
+id: 5a24c314108439a4d4036187
+title: Use a Ternary Expression for Conditional Rendering
+challengeType: 6
+forumTopicId: 301414
+dashedName: use-a-ternary-expression-for-conditional-rendering
+---
+
+# --description--
+
+Before moving on to dynamic rendering techniques, there's one last way to use built-in JavaScript conditionals to render what you want: the <dfn>ternary operator</dfn>. The ternary operator is often utilized as a shortcut for `if/else` statements in JavaScript. They're not quite as robust as traditional `if/else` statements, but they are very popular among React developers. One reason for this is because of how JSX is compiled, `if/else` statements can't be inserted directly into JSX code. You might have noticed this a couple challenges ago — when an `if/else` statement was required, it was always *outside* the `return` statement. Ternary expressions can be an excellent alternative if you want to implement conditional logic within your JSX. Recall that a ternary operator has three parts, but you can combine several ternary expressions together. Here's the basic syntax:
+
+```jsx
+condition ? expressionIfTrue : expressionIfFalse;
+```
+
+# --instructions--
+
+The code editor has three constants defined within the `CheckUserAge` component's `render()` method. They are called `buttonOne`, `buttonTwo`, and `buttonThree`. Each of these is assigned a simple JSX expression representing a button element. First, initialize the state of `CheckUserAge` with `input` and `userAge` both set to values of an empty string.
+
+Once the component is rendering information to the page, users should have a way to interact with it. Within the component's `return` statement, set up a ternary expression that implements the following logic: when the page first loads, render the submit button, `buttonOne`, to the page. Then, when a user enters their age and clicks the button, render a different button based on the age. If a user enters a number less than `18`, render `buttonThree`. If a user enters a number greater than or equal to `18`, render `buttonTwo`.
+
+# --hints--
+
+The `CheckUserAge` component should render with a single `input` element and a single `button` element.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).find('div').find('input')
+    .length === 1 &&
+    Enzyme.mount(React.createElement(CheckUserAge)).find('div').find('button')
+      .length === 1
+);
+```
+
+The `CheckUserAge` component's state should be initialized with a property of `userAge` and a property of `input`, both set to a value of an empty string.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).state().input === '' &&
+    Enzyme.mount(React.createElement(CheckUserAge)).state().userAge === ''
+);
+```
+
+When the `CheckUserAge` component is first rendered to the DOM, the `button`'s inner text should be Submit.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).find('button').text() ===
+    'Submit'
+);
+```
+
+When a number of less than 18 is entered into the `input` element and the `button` is clicked, the `button`'s inner text should read `You Shall Not Pass`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const initialButton = mockedComponent.find('button').text();
+  const enter3AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '3' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter17AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '17' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge3 = enter3AndClickButton();
+  const userAge17 = enter17AndClickButton();
+  assert(
+    initialButton === 'Submit' &&
+      userAge3 === 'You Shall Not Pass' &&
+      userAge17 === 'You Shall Not Pass'
+  );
+})();
+```
+
+When a number greater than or equal to 18 is entered into the `input` element and the `button` is clicked, the `button`'s inner text should read `You May Enter`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const initialButton = mockedComponent.find('button').text();
+  const enter18AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '18' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter35AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '35' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge18 = enter18AndClickButton();
+  const userAge35 = enter35AndClickButton();
+  assert(
+    initialButton === 'Submit' &&
+      userAge18 === 'You May Enter' &&
+      userAge35 === 'You May Enter'
+  );
+})();
+```
+
+Once a number has been submitted, and the value of the `input` is once again changed, the `button` should return to reading `Submit`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const enter18AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '18' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const changeInputDontClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '5' } });
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter10AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '10' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge18 = enter18AndClickButton();
+  const changeInput1 = changeInputDontClickButton();
+  const userAge10 = enter10AndClickButton();
+  const changeInput2 = changeInputDontClickButton();
+  assert(
+    userAge18 === 'You May Enter' &&
+      changeInput1 === 'Submit' &&
+      userAge10 === 'You Shall Not Pass' &&
+      changeInput2 === 'Submit'
+  );
+})();
+```
+
+Your code should not contain any `if/else` statements.
+
+```js
+assert(
+  new RegExp(/(\s|;)if(\s|\()/).test(
+    Enzyme.mount(React.createElement(CheckUserAge)).instance().render.toString()
+  ) === false
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<CheckUserAge />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class CheckUserAge extends React.Component {
+  constructor(props) {
+    super(props);
+    // Change code below this line
+
+    // Change code above this line
+    this.submit = this.submit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(e) {
+    this.setState({
+      input: e.target.value,
+      userAge: ''
+    });
+  }
+  submit() {
+    this.setState(state => ({
+      userAge: state.input
+    }));
+  }
+  render() {
+    const buttonOne = <button onClick={this.submit}>Submit</button>;
+    const buttonTwo = <button>You May Enter</button>;
+    const buttonThree = <button>You Shall Not Pass</button>;
+    return (
+      <div>
+        <h3>Enter Your Age to Continue</h3>
+        <input
+          style={inputStyle}
+          type='number'
+          value={this.state.input}
+          onChange={this.handleChange}
+        />
+        <br />
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class CheckUserAge extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userAge: '',
+      input: ''
+    };
+    this.submit = this.submit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(e) {
+    this.setState({
+      input: e.target.value,
+      userAge: ''
+    });
+  }
+  submit() {
+    this.setState(state => ({
+      userAge: state.input
+    }));
+  }
+  render() {
+    const buttonOne = <button onClick={this.submit}>Submit</button>;
+    const buttonTwo = <button>You May Enter</button>;
+    const buttonThree = <button>You Shall Not Pass</button>;
+    return (
+      <div>
+        <h3>Enter Your Age to Continue</h3>
+        <input
+          style={inputStyle}
+          type='number'
+          value={this.state.input}
+          onChange={this.handleChange}
+        />
+        <br />
+        {this.state.userAge === ''
+          ? buttonOne
+          : this.state.userAge >= 18
+          ? buttonTwo
+          : buttonThree}
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
new file mode 100644
index 0000000000..d9bccebbf2
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
@@ -0,0 +1,334 @@
+---
+id: 5a24c314108439a4d4036183
+title: Use Advanced JavaScript in React Render Method
+challengeType: 6
+forumTopicId: 301415
+dashedName: use-advanced-javascript-in-react-render-method
+---
+
+# --description--
+
+In previous challenges, you learned how to inject JavaScript code into JSX code using curly braces, `{ }`, for tasks like accessing props, passing props, accessing state, inserting comments into your code, and most recently, styling your components. These are all common use cases to put JavaScript in JSX, but they aren't the only way that you can utilize JavaScript code in your React components.
+
+You can also write JavaScript directly in your `render` methods, before the `return` statement, ***without*** inserting it inside of curly braces. This is because it is not yet within the JSX code. When you want to use a variable later in the JSX code *inside* the `return` statement, you place the variable name inside curly braces.
+
+# --instructions--
+
+In the code provided, the `render` method has an array that contains 20 phrases to represent the answers found in the classic 1980's Magic Eight Ball toy. The button click event is bound to the `ask` method, so each time the button is clicked a random number will be generated and stored as the `randomIndex` in state. On line 52, delete the string `change me!` and reassign the `answer` const so your code randomly accesses a different index of the `possibleAnswers` array each time the component updates. Finally, insert the `answer` const inside the `p` tags.
+
+# --hints--
+
+The `MagicEightBall` component should exist and should render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall)).find('MagicEightBall')
+    .length,
+  1
+);
+```
+
+`MagicEightBall`'s first child should be an `input` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall))
+    .children()
+    .childAt(0)
+    .name(),
+  'input'
+);
+```
+
+`MagicEightBall`'s third child should be a `button` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall))
+    .children()
+    .childAt(2)
+    .name(),
+  'button'
+);
+```
+
+`MagicEightBall`'s state should be initialized with a property of `userInput` and a property of `randomIndex` both set to a value of an empty string.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MagicEightBall)).state('randomIndex') ===
+    '' &&
+    Enzyme.mount(React.createElement(MagicEightBall)).state('userInput') === ''
+);
+```
+
+When `MagicEightBall` is first mounted to the DOM, it should return an empty `p` element.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MagicEightBall)).find('p').length === 1 &&
+    Enzyme.mount(React.createElement(MagicEightBall)).find('p').text() === ''
+);
+```
+
+When text is entered into the `input` element and the button is clicked, the `MagicEightBall` component should return a `p` element that contains a random element from the `possibleAnswers` array.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MagicEightBall));
+  const simulate = () => {
+    comp.find('input').simulate('change', { target: { value: 'test?' } });
+    comp.find('button').simulate('click');
+  };
+  const result = () => comp.find('p').text();
+  const _1 = () => {
+    simulate();
+    return result();
+  };
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _6 = () => {
+    simulate();
+    return result();
+  };
+  const _7 = () => {
+    simulate();
+    return result();
+  };
+  const _8 = () => {
+    simulate();
+    return result();
+  };
+  const _9 = () => {
+    simulate();
+    return result();
+  };
+  const _10 = () => {
+    simulate();
+    return result();
+  };
+  const _1_val = _1();
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  const _6_val = _6();
+  const _7_val = _7();
+  const _8_val = _8();
+  const _9_val = _9();
+  const _10_val = _10();
+  const actualAnswers = [
+    _1_val,
+    _2_val,
+    _3_val,
+    _4_val,
+    _5_val,
+    _6_val,
+    _7_val,
+    _8_val,
+    _9_val,
+    _10_val
+  ];
+  const hasIndex = actualAnswers.filter(
+    (answer, i) => possibleAnswers.indexOf(answer) !== -1
+  );
+  const notAllEqual = new Set(actualAnswers);
+  assert(notAllEqual.size > 1 && hasIndex.length === 10);
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+var possibleAnswers = [
+  'It is certain',
+  'It is decidedly so',
+  'Without a doubt',
+  'Yes, definitely',
+  'You may rely on it',
+  'As I see it, yes',
+  'Outlook good',
+  'Yes',
+  'Signs point to yes',
+  'Reply hazy try again',
+  'Ask again later',
+  'Better not tell you now',
+  'Cannot predict now',
+  'Concentrate and ask again',
+  "Don't count on it",
+  'My reply is no',
+  'My sources say no',
+  'Outlook not so good',
+  'Very doubtful',
+  'Most likely'
+];
+ReactDOM.render(<MagicEightBall />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class MagicEightBall extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userInput: '',
+      randomIndex: ''
+    };
+    this.ask = this.ask.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  ask() {
+    if (this.state.userInput) {
+      this.setState({
+        randomIndex: Math.floor(Math.random() * 20),
+        userInput: ''
+      });
+    }
+  }
+  handleChange(event) {
+    this.setState({
+      userInput: event.target.value
+    });
+  }
+  render() {
+    const possibleAnswers = [
+      'It is certain',
+      'It is decidedly so',
+      'Without a doubt',
+      'Yes, definitely',
+      'You may rely on it',
+      'As I see it, yes',
+      'Outlook good',
+      'Yes',
+      'Signs point to yes',
+      'Reply hazy try again',
+      'Ask again later',
+      'Better not tell you now',
+      'Cannot predict now',
+      'Concentrate and ask again',
+      "Don't count on it",
+      'My reply is no',
+      'My sources say no',
+      'Most likely',
+      'Outlook not so good',
+      'Very doubtful'
+    ];
+    const answer = 'change me!'; // Change this line
+    return (
+      <div>
+        <input
+          type='text'
+          value={this.state.userInput}
+          onChange={this.handleChange}
+          style={inputStyle}
+        />
+        <br />
+        <button onClick={this.ask}>Ask the Magic Eight Ball!</button>
+        <br />
+        <h3>Answer:</h3>
+        <p>
+          {/* Change code below this line */}
+
+          {/* Change code above this line */}
+        </p>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class MagicEightBall extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userInput: '',
+      randomIndex: ''
+    };
+    this.ask = this.ask.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  ask() {
+    if (this.state.userInput) {
+      this.setState({
+        randomIndex: Math.floor(Math.random() * 20),
+        userInput: ''
+      });
+    }
+  }
+  handleChange(event) {
+    this.setState({
+      userInput: event.target.value
+    });
+  }
+  render() {
+    const possibleAnswers = [
+      'It is certain',
+      'It is decidedly so',
+      'Without a doubt',
+      'Yes, definitely',
+      'You may rely on it',
+      'As I see it, yes',
+      'Outlook good',
+      'Yes',
+      'Signs point to yes',
+      'Reply hazy try again',
+      'Ask again later',
+      'Better not tell you now',
+      'Cannot predict now',
+      'Concentrate and ask again',
+      "Don't count on it",
+      'My reply is no',
+      'My sources say no',
+      'Outlook not so good',
+      'Very doubtful',
+      'Most likely'
+    ];
+    const answer = possibleAnswers[this.state.randomIndex];
+    return (
+      <div>
+        <input
+          type='text'
+          value={this.state.userInput}
+          onChange={this.handleChange}
+          style={inputStyle}
+        />
+        <br />
+        <button onClick={this.ask}>Ask the Magic Eight Ball!</button>
+        <br />
+        <h3>Answer:</h3>
+        <p>{answer}</p>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
new file mode 100644
index 0000000000..9aa54c9672
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
@@ -0,0 +1,236 @@
+---
+id: 5a24c314108439a4d403618c
+title: Use Array.filter() to Dynamically Filter an Array
+challengeType: 6
+forumTopicId: 301416
+dashedName: use-array-filter-to-dynamically-filter-an-array
+---
+
+# --description--
+
+The `map` array method is a powerful tool that you will use often when working with React. Another method related to `map` is `filter`, which filters the contents of an array based on a condition, then returns a new array. For example, if you have an array of users that all have a property `online` which can be set to `true` or `false`, you can filter only those users that are online by writing:
+
+```js
+let onlineUsers = users.filter(user => user.online);
+```
+
+# --instructions--
+
+In the code editor, `MyComponent`'s `state` is initialized with an array of users. Some users are online and some aren't. Filter the array so you see only the users who are online. To do this, first use `filter` to return a new array containing only the users whose `online` property is `true`. Then, in the `renderOnline` variable, map over the filtered array, and return a `li` element for each user that contains the text of their `username`. Be sure to include a unique `key` as well, like in the last challenges.
+
+# --hints--
+
+`MyComponent` should exist and render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).find('MyComponent').length,
+  1
+);
+```
+
+`MyComponent`'s state should be initialized to an array of six users.
+
+```js
+assert(
+  Array.isArray(
+    Enzyme.mount(React.createElement(MyComponent)).state('users')
+  ) === true &&
+    Enzyme.mount(React.createElement(MyComponent)).state('users').length === 6
+);
+```
+
+`MyComponent` should return a `div`, an `h1`, and then an unordered list containing `li` elements for every user whose online status is set to `true`.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MyComponent));
+  const users = (bool) => ({
+    users: [
+      { username: 'Jeff', online: bool },
+      { username: 'Alan', online: bool },
+      { username: 'Mary', online: bool },
+      { username: 'Jim', online: bool },
+      { username: 'Laura', online: bool }
+    ]
+  });
+  const result = () => comp.find('li').length;
+  const _1 = result();
+  const _2 = () => {
+    comp.setState(users(true));
+    return result();
+  };
+  const _3 = () => {
+    comp.setState(users(false));
+    return result();
+  };
+  const _4 = () => {
+    comp.setState({ users: [] });
+    return result();
+  };
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  assert(
+    comp.find('div').length === 1 &&
+      comp.find('h1').length === 1 &&
+      comp.find('ul').length === 1 &&
+      _1 === 4 &&
+      _2_val === 5 &&
+      _3_val === 0 &&
+      _4_val === 0
+  );
+})();
+```
+
+`MyComponent` should render `li` elements that contain the `username` of each online user.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MyComponent));
+  const users = (bool) => ({
+    users: [
+      { username: 'Jeff', online: bool },
+      { username: 'Alan', online: bool },
+      { username: 'Mary', online: bool },
+      { username: 'Jim', online: bool },
+      { username: 'Laura', online: bool }
+    ]
+  });
+  const ul = () => {
+    comp.setState(users(true));
+    return comp.find('ul').html();
+  };
+  const html = ul();
+  assert(
+    html ===
+      '<ul><li>Jeff</li><li>Alan</li><li>Mary</li><li>Jim</li><li>Laura</li></ul>'
+  );
+})();
+```
+
+Each list item element should have a unique `key` attribute.
+
+```js
+assert(
+  (() => {
+    const ul = Enzyme.mount(React.createElement(MyComponent)).find('ul');
+    console.log(ul.debug());
+    const keys = new Set([
+      ul.childAt(0).key(),
+      ul.childAt(1).key(),
+      ul.childAt(2).key(),
+      ul.childAt(3).key()
+    ]);
+    return keys.size === 4;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      users: [
+        {
+          username: 'Jeff',
+          online: true
+        },
+        {
+          username: 'Alan',
+          online: false
+        },
+        {
+          username: 'Mary',
+          online: true
+        },
+        {
+          username: 'Jim',
+          online: false
+        },
+        {
+          username: 'Sara',
+          online: true
+        },
+        {
+          username: 'Laura',
+          online: true
+        }
+      ]
+    };
+  }
+  render() {
+    const usersOnline = null; // Change this line
+    const renderOnline = null; // Change this line
+    return (
+      <div>
+        <h1>Current Online Users:</h1>
+        <ul>{renderOnline}</ul>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      users: [
+        {
+          username: 'Jeff',
+          online: true
+        },
+        {
+          username: 'Alan',
+          online: false
+        },
+        {
+          username: 'Mary',
+          online: true
+        },
+        {
+          username: 'Jim',
+          online: false
+        },
+        {
+          username: 'Sara',
+          online: true
+        },
+        {
+          username: 'Laura',
+          online: true
+        }
+      ]
+    };
+  }
+  render() {
+    const usersOnline = this.state.users.filter(user => {
+      return user.online;
+    });
+    const renderOnline = usersOnline.map(user => {
+      return <li key={user.username}>{user.username}</li>;
+    });
+    return (
+      <div>
+        <h1>Current Online Users:</h1>
+        <ul>{renderOnline}</ul>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
new file mode 100644
index 0000000000..0d6cca62f6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
@@ -0,0 +1,265 @@
+---
+id: 5a24c314108439a4d403618a
+title: Use Array.map() to Dynamically Render Elements
+challengeType: 6
+forumTopicId: 301417
+dashedName: use-array-map-to-dynamically-render-elements
+---
+
+# --description--
+
+Conditional rendering is useful, but you may need your components to render an unknown number of elements. Often in reactive programming, a programmer has no way to know what the state of an application is until runtime, because so much depends on a user's interaction with that program. Programmers need to write their code to correctly handle that unknown state ahead of time. Using `Array.map()` in React illustrates this concept.
+
+For example, you create a simple "To Do List" app. As the programmer, you have no way of knowing how many items a user might have on their list. You need to set up your component to dynamically render the correct number of list elements long before someone using the program decides that today is laundry day.
+
+# --instructions--
+
+The code editor has most of the `MyToDoList` component set up. Some of this code should look familiar if you completed the controlled form challenge. You'll notice a `textarea` and a `button`, along with a couple of methods that track their states, but nothing is rendered to the page yet.
+
+Inside the `constructor`, create a `this.state` object and define two states: `userInput` should be initialized as an empty string, and `toDoList` should be initialized as an empty array. Next, delete the comment in the `render()` method next to the `items` variable. In its place, map over the `toDoList` array stored in the component's internal state and dynamically render a `li` for each item. Try entering the string `eat, code, sleep, repeat` into the `textarea`, then click the button and see what happens.
+
+**Note:** You may know that all sibling child elements created by a mapping operation like this do need to be supplied with a unique `key` attribute. Don't worry, this is the topic of the next challenge.
+
+# --hints--
+
+The MyToDoList component should exist and render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return mockedComponent.find('MyToDoList').length === 1;
+  })()
+);
+```
+
+The first child of `MyToDoList` should be a `textarea` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(0).type() ===
+      'textarea'
+    );
+  })()
+);
+```
+
+The second child of `MyToDoList` should be a `br` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(1).type() === 'br'
+    );
+  })()
+);
+```
+
+The third child of `MyToDoList` should be a `button` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(2).type() ===
+      'button'
+    );
+  })()
+);
+```
+
+The state of `MyToDoList` should be initialized with `toDoList` as an empty array.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    const initialState = mockedComponent.state();
+    return (
+      Array.isArray(initialState.toDoList) === true &&
+      initialState.toDoList.length === 0
+    );
+  })()
+);
+```
+
+The state of `MyToDoList` should be initialized with `userInput` as an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState.userInput === 'string' &&
+      initialState.userInput.length === 0
+    );
+  })()
+);
+```
+
+When the `Create List` button is clicked, the `MyToDoList` component should dynamically return an unordered list that contains a list item element for every item of a comma-separated list entered into the `textarea` element.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+  const simulateChange = (el, value) =>
+    el.simulate('change', { target: { value } });
+  const state_1 = () => {
+    return mockedComponent.find('ul').find('li');
+  };
+  const setInput = () => {
+    return simulateChange(
+      mockedComponent.find('textarea'),
+      'testA, testB, testC'
+    );
+  };
+  const click = () => {
+    return mockedComponent.find('button').simulate('click');
+  };
+  const state_2 = () => {
+    const nodes = mockedComponent.find('ul').find('li');
+    return { nodes, text: nodes.reduce((t, n) => t + n.text().trim(), '') };
+  };
+  const setInput_2 = () => {
+    return simulateChange(
+      mockedComponent.find('textarea'),
+      't1, t2, t3, t4, t5, t6'
+    );
+  };
+  const click_1 = () => {
+    return mockedComponent.find('button').simulate('click');
+  };
+  const state_3 = () => {
+    const nodes = mockedComponent.find('ul').find('li');
+    return { nodes, text: nodes.reduce((t, n) => t + n.text().trim(), '') };
+  };
+  const awaited_state_1 = state_1();
+  const awaited_setInput = setInput();
+  const awaited_click = click();
+  const awaited_state_2 = state_2();
+  const awaited_setInput_2 = setInput_2();
+  const awaited_click_1 = click_1();
+  const awaited_state_3 = state_3();
+  assert(
+    awaited_state_1.length === 0 &&
+      awaited_state_2.nodes.length === 3 &&
+      awaited_state_3.nodes.length === 6 &&
+      awaited_state_2.text === 'testAtestBtestC' &&
+      awaited_state_3.text === 't1t2t3t4t5t6'
+  );
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyToDoList />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const textAreaStyles = {
+  width: 235,
+  margin: 5
+};
+
+class MyToDoList extends React.Component {
+  constructor(props) {
+    super(props);
+    // Change code below this line
+
+    // Change code above this line
+    this.handleSubmit = this.handleSubmit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleSubmit() {
+    const itemsArray = this.state.userInput.split(',');
+    this.setState({
+      toDoList: itemsArray
+    });
+  }
+  handleChange(e) {
+    this.setState({
+      userInput: e.target.value
+    });
+  }
+  render() {
+    const items = null; // Change this line
+    return (
+      <div>
+        <textarea
+          onChange={this.handleChange}
+          value={this.state.userInput}
+          style={textAreaStyles}
+          placeholder='Separate Items With Commas'
+        />
+        <br />
+        <button onClick={this.handleSubmit}>Create List</button>
+        <h1>My "To Do" List:</h1>
+        <ul>{items}</ul>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const textAreaStyles = {
+  width: 235,
+  margin: 5
+};
+
+class MyToDoList extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      toDoList: [],
+      userInput: ''
+    };
+    this.handleSubmit = this.handleSubmit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleSubmit() {
+    const itemsArray = this.state.userInput.split(',');
+    this.setState({
+      toDoList: itemsArray
+    });
+  }
+  handleChange(e) {
+    this.setState({
+      userInput: e.target.value
+    });
+  }
+  render() {
+    const items = this.state.toDoList.map((item, i) => {
+      return <li key={i}>{item}</li>;
+    });
+    return (
+      <div>
+        <textarea
+          onChange={this.handleChange}
+          value={this.state.userInput}
+          style={textAreaStyles}
+          placeholder='Separate Items With Commas'
+        />
+        <br />
+        <button onClick={this.handleSubmit}>Create List</button>
+        <h1>My "To Do" List:</h1>
+        <ul>{items}</ul>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-default-props.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-default-props.md
new file mode 100644
index 0000000000..1f048ada95
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-default-props.md
@@ -0,0 +1,78 @@
+---
+id: 5a24c314108439a4d403616b
+title: Use Default Props
+challengeType: 6
+forumTopicId: 301418
+dashedName: use-default-props
+---
+
+# --description--
+
+React also has an option to set default props. You can assign default props to a component as a property on the component itself and React assigns the default prop if necessary. This allows you to specify what a prop value should be if no value is explicitly provided. For example, if you declare `MyComponent.defaultProps = { location: 'San Francisco' }`, you have defined a location prop that's set to the string `San Francisco`, unless you specify otherwise. React assigns default props if props are undefined, but if you pass `null` as the value for a prop, it will remain `null`.
+
+# --instructions--
+
+The code editor shows a `ShoppingCart` component. Define default props on this component which specify a prop `items` with a value of `0`.
+
+# --hints--
+
+The `ShoppingCart` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The `ShoppingCart` component should have a default prop of `{ items: 0 }`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    mockedComponent.setProps({ items: undefined });
+    return mockedComponent.find('ShoppingCart').props().items === 0;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const ShoppingCart = (props) => {
+  return (
+    <div>
+      <h1>Shopping Cart Component</h1>
+    </div>
+  )
+};
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const ShoppingCart = (props) => {
+  return (
+    <div>
+      <h1>Shopping Cart Component</h1>
+    </div>
+  )
+};
+
+// Change code below this line
+ShoppingCart.defaultProps = {
+  items: 0
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
new file mode 100644
index 0000000000..2c6a725994
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
@@ -0,0 +1,132 @@
+---
+id: 5a24c314108439a4d403616d
+title: Use PropTypes to Define the Props You Expect
+challengeType: 6
+forumTopicId: 301419
+dashedName: use-proptypes-to-define-the-props-you-expect
+---
+
+# --description--
+
+React provides useful type-checking features to verify that components receive props of the correct type. For example, your application makes an API call to retrieve data that you expect to be in an array, which is then passed to a component as a prop. You can set `propTypes` on your component to require the data to be of type `array`. This will throw a useful warning when the data is of any other type.
+
+It's considered a best practice to set `propTypes` when you know the type of a prop ahead of time. You can define a `propTypes` property for a component in the same way you defined `defaultProps`. Doing this will check that props of a given key are present with a given type. Here's an example to require the type `function` for a prop called `handleClick`:
+
+```js
+MyComponent.propTypes = { handleClick: PropTypes.func.isRequired }
+```
+
+In the example above, the `PropTypes.func` part checks that `handleClick` is a function. Adding `isRequired` tells React that `handleClick` is a required property for that component. You will see a warning if that prop isn't provided. Also notice that `func` represents `function`. Among the seven JavaScript primitive types, `function` and `boolean` (written as `bool`) are the only two that use unusual spelling. In addition to the primitive types, there are other types available. For example, you can check that a prop is a React element. Please refer to the [documentation](https://reactjs.org/docs/jsx-in-depth.html#specifying-the-react-element-type) for all of the options.
+
+**Note:** As of React v15.5.0, `PropTypes` is imported independently from React, like this: `import PropTypes from 'prop-types';`
+
+# --instructions--
+
+Define `propTypes` for the `Items` component to require `quantity` as a prop and verify that it is of type `number`.
+
+# --hints--
+
+The `ShoppingCart` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The `Items` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('Items').length === 1;
+  })()
+);
+```
+
+The `Items` component should include a `propTypes` check to require a value for `quantity` and ensure that its value is a number.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        noWhiteSpace.includes('quantity:PropTypes.number.isRequired') &&
+        noWhiteSpace.includes('Items.propTypes=')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var PropTypes = {
+  number: { isRequired: true }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+};
+
+// Change code below this line
+
+// Change code above this line
+
+Items.defaultProps = {
+  quantity: 0
+};
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <Items />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+};
+
+// Change code below this line
+Items.propTypes = {
+  quantity: PropTypes.number.isRequired
+};
+// Change code above this line
+
+Items.defaultProps = {
+  quantity: 0
+};
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <Items />
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-react-to-render-nested-components.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-react-to-render-nested-components.md
new file mode 100644
index 0000000000..3f98507054
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-react-to-render-nested-components.md
@@ -0,0 +1,150 @@
+---
+id: 5a24c314108439a4d4036165
+title: Use React to Render Nested Components
+challengeType: 6
+forumTopicId: 301420
+dashedName: use-react-to-render-nested-components
+---
+
+# --description--
+
+The last challenge showed a simple way to compose two components, but there are many different ways you can compose components with React.
+
+Component composition is one of React's powerful features. When you work with React, it is important to start thinking about your user interface in terms of components like the App example in the last challenge. You break down your UI into its basic building blocks, and those pieces become the components. This helps to separate the code responsible for the UI from the code responsible for handling your application logic. It can greatly simplify the development and maintenance of complex projects.
+
+# --instructions--
+
+There are two functional components defined in the code editor, called `TypesOfFruit` and `Fruits`. Take the `TypesOfFruit` component and compose it, or *nest* it, within the `Fruits` component. Then take the `Fruits` component and nest it within the `TypesOfFood` component. The result should be a child component, nested within a parent component, which is nested within a parent component of its own!
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(Enzyme.shallow(React.createElement(TypesOfFood)).type() === 'div');
+```
+
+The `TypesOfFood` component should return the `Fruits` component.
+
+```js
+assert(
+  Enzyme.shallow(React.createElement(TypesOfFood)).props().children[1].type
+    .name === 'Fruits'
+);
+```
+
+The `Fruits` component should return the `TypesOfFruit` component.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(TypesOfFood)).find('h2').html() ===
+    '<h2>Fruits:</h2>'
+);
+```
+
+The `TypesOfFruit` component should return the `h2` and `ul` elements.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(TypesOfFood)).find('ul').text() ===
+    'ApplesBlueberriesStrawberriesBananas'
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<TypesOfFood />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const TypesOfFruit = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <ul>
+        <li>Apples</li>
+        <li>Blueberries</li>
+        <li>Strawberries</li>
+        <li>Bananas</li>
+      </ul>
+    </div>
+  );
+};
+
+const Fruits = () => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const TypesOfFruit = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <ul>
+        <li>Apples</li>
+        <li>Blueberries</li>
+        <li>Strawberries</li>
+        <li>Bananas</li>
+      </ul>
+    </div>
+  );
+};
+
+const Fruits = () => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+        <TypesOfFruit />
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+        <Fruits />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-state-to-toggle-an-element.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-state-to-toggle-an-element.md
new file mode 100644
index 0000000000..d4b7578928
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-state-to-toggle-an-element.md
@@ -0,0 +1,189 @@
+---
+id: 5a24c314108439a4d4036176
+title: Use State to Toggle an Element
+challengeType: 6
+forumTopicId: 301421
+dashedName: use-state-to-toggle-an-element
+---
+
+# --description--
+
+Sometimes you might need to know the previous state when updating the state. However, state updates may be asynchronous - this means React may batch multiple `setState()` calls into a single update. This means you can't rely on the previous value of `this.state` or `this.props` when calculating the next value. So, you should not use code like this:
+
+```jsx
+this.setState({
+  counter: this.state.counter + this.props.increment
+});
+```
+
+Instead, you should pass `setState` a function that allows you to access state and props. Using a function with `setState` guarantees you are working with the most current values of state and props. This means that the above should be rewritten as:
+
+```jsx
+this.setState((state, props) => ({
+  counter: state.counter + props.increment
+}));
+```
+
+You can also use a form without `props` if you need only the `state`:
+
+```jsx
+this.setState(state => ({
+  counter: state.counter + 1
+}));
+```
+
+Note that you have to wrap the object literal in parentheses, otherwise JavaScript thinks it's a block of code.
+
+# --instructions--
+
+`MyComponent` has a `visibility` property which is initialized to `false`. The render method returns one view if the value of `visibility` is true, and a different view if it is false.
+
+Currently, there is no way of updating the `visibility` property in the component's `state`. The value should toggle back and forth between true and false. There is a click handler on the button which triggers a class method called `toggleVisibility()`. Pass a function to `setState` to define this method so that the `state` of `visibility` toggles to the opposite value when the method is called. If `visibility` is `false`, the method sets it to `true`, and vice versa.
+
+Finally, click the button to see the conditional rendering of the component based on its `state`.
+
+**Hint:** Don't forget to bind the `this` keyword to the method in the `constructor`!
+
+# --hints--
+
+`MyComponent` should return a `div` element which contains a `button`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).find('div').find('button')
+    .length,
+  1
+);
+```
+
+The state of `MyComponent` should initialize with a `visibility` property set to `false`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).state('visibility'),
+  false
+);
+```
+
+Clicking the button element should toggle the `visibility` property in state between `true` and `false`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ visibility: false });
+    return mockedComponent.state('visibility');
+  };
+  const second = () => {
+    mockedComponent.find('button').simulate('click');
+    return mockedComponent.state('visibility');
+  };
+  const third = () => {
+    mockedComponent.find('button').simulate('click');
+    return mockedComponent.state('visibility');
+  };
+  const firstValue = first();
+  const secondValue = second();
+  const thirdValue = third();
+  assert(!firstValue && secondValue && !thirdValue);
+})();
+```
+
+An anonymous function should be passed to `setState`.
+
+```js
+const paramRegex = '[a-zA-Z$_]\\w*(,[a-zA-Z$_]\\w*)?';
+assert(
+  new RegExp(
+    'this\\.setState\\((function\\(' +
+      paramRegex +
+      '\\){|([a-zA-Z$_]\\w*|\\(' +
+      paramRegex +
+      '\\))=>)'
+  ).test(__helpers.removeWhiteSpace(code))
+);
+```
+
+`this` should not be used inside `setState`
+
+```js
+assert(!/this\.setState\([^}]*this/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      visibility: false
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    if (this.state.visibility) {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+          <h1>Now you see me!</h1>
+        </div>
+      );
+    } else {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+        </div>
+      );
+    }
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      visibility: false
+    };
+    this.toggleVisibility = this.toggleVisibility.bind(this);
+  }
+  toggleVisibility() {
+    this.setState(state => ({
+      visibility: !state.visibility
+    }));
+  }
+  render() {
+    if (this.state.visibility) {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+          <h1>Now you see me!</h1>
+        </div>
+      );
+    } else {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+        </div>
+      );
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
new file mode 100644
index 0000000000..f20b192ce8
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
@@ -0,0 +1,127 @@
+---
+id: 5a24c314108439a4d403617d
+title: Use the Lifecycle Method componentDidMount
+challengeType: 6
+forumTopicId: 301422
+dashedName: use-the-lifecycle-method-componentdidmount
+---
+
+# --description--
+
+Most web developers, at some point, need to call an API endpoint to retrieve data. If you're working with React, it's important to know where to perform this action.
+
+The best practice with React is to place API calls or any calls to your server in the lifecycle method `componentDidMount()`. This method is called after a component is mounted to the DOM. Any calls to `setState()` here will trigger a re-rendering of your component. When you call an API in this method, and set your state with the data that the API returns, it will automatically trigger an update once you receive the data.
+
+# --instructions--
+
+There is a mock API call in `componentDidMount()`. It sets state after 2.5 seconds to simulate calling a server to retrieve data. This example requests the current total active users for a site. In the render method, render the value of `activeUsers` in the `h1` after the text `Active Users:`. Watch what happens in the preview, and feel free to change the timeout to see the different effects.
+
+# --hints--
+
+`MyComponent` should render a `div` element which wraps an `h1` tag.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h1').length === 1
+    );
+  })()
+);
+```
+
+Component state should be updated with a timeout function in `componentDidMount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return new RegExp('setTimeout(.|\n)+setState(.|\n)+activeUsers').test(
+      String(mockedComponent.instance().componentDidMount)
+    );
+  })()
+);
+```
+
+The `h1` tag should render the `activeUsers` value from `MyComponent`'s state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ activeUsers: 1237 });
+    return mockedComponent.find('h1').text();
+  };
+  const second = () => {
+    mockedComponent.setState({ activeUsers: 1000 });
+    return mockedComponent.find('h1').text();
+  };
+  assert(new RegExp('1237').test(first()) && new RegExp('1000').test(second()));
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      activeUsers: null
+    };
+  }
+  componentDidMount() {
+    setTimeout(() => {
+      this.setState({
+        activeUsers: 1273
+      });
+    }, 2500);
+  }
+  render() {
+    return (
+      <div>
+        {/* Change code below this line */}
+        <h1>Active Users: </h1>
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      activeUsers: null
+    };
+  }
+  componentDidMount() {
+    setTimeout(() => {
+      this.setState({
+        activeUsers: 1273
+      });
+    }, 2500);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Active Users: {this.state.activeUsers}</h1>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md b/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
new file mode 100644
index 0000000000..6095a48eed
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
@@ -0,0 +1,87 @@
+---
+id: 5a24c314108439a4d403617c
+title: Use the Lifecycle Method componentWillMount
+challengeType: 6
+forumTopicId: 301423
+dashedName: use-the-lifecycle-method-componentwillmount
+---
+
+# --description--
+
+React components have several special methods that provide opportunities to perform actions at specific points in the lifecycle of a component. These are called lifecycle methods, or lifecycle hooks, and allow you to catch components at certain points in time. This can be before they are rendered, before they update, before they receive props, before they unmount, and so on. Here is a list of some of the main lifecycle methods: `componentWillMount()` `componentDidMount()` `shouldComponentUpdate()` `componentDidUpdate()` `componentWillUnmount()` The next several lessons will cover some of the basic use cases for these lifecycle methods.
+
+**Note:** The `componentWillMount` Lifecycle method will be deprecated in a future version of 16.X and removed in version 17. [(Source)](https://reactjs.org/blog/2018/03/27/update-on-async-rendering.html)
+
+# --instructions--
+
+The `componentWillMount()` method is called before the `render()` method when a component is being mounted to the DOM. Log something to the console within `componentWillMount()` - you may want to have your browser console open to see the output.
+
+# --hints--
+
+`MyComponent` should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').length === 1;
+  })()
+);
+```
+
+`console.log` should be called in `componentWillMount`.
+
+```js
+assert(
+  (function () {
+    const lifecycle = React.createElement(MyComponent)
+      .type.prototype.componentWillMount.toString()
+      .replace(/ /g, '');
+    return lifecycle.includes('console.log(');
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  componentWillMount() {
+    // Change code below this line
+
+    // Change code above this line
+  }
+  render() {
+    return <div />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  componentWillMount() {
+    // Change code below this line
+    console.log('Component is mounting...');
+    // Change code above this line
+  }
+  render() {
+    return <div />
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/write-a-react-component-from-scratch.md b/curriculum/challenges/italian/03-front-end-libraries/react/write-a-react-component-from-scratch.md
new file mode 100644
index 0000000000..83cf8603ab
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/write-a-react-component-from-scratch.md
@@ -0,0 +1,84 @@
+---
+id: 5a24c314108439a4d4036168
+title: Write a React Component from Scratch
+challengeType: 6
+forumTopicId: 301424
+dashedName: write-a-react-component-from-scratch
+---
+
+# --description--
+
+Now that you've learned the basics of JSX and React components, it's time to write a component on your own. React components are the core building blocks of React applications so it's important to become very familiar with writing them. Remember, a typical React component is an ES6 `class` which extends `React.Component`. It has a render method that returns HTML (from JSX) or `null`. This is the basic form of a React component. Once you understand this well, you will be prepared to start building more complex React projects.
+
+# --instructions--
+
+Define a class `MyComponent` that extends `React.Component`. Its render method should return a `div` that contains an `h1` tag with the text: `My First React Component!` in it. Use this text exactly, the case and punctuation matter. Make sure to call the constructor for your component, too.
+
+Render this component to the DOM using `ReactDOM.render()`. There is a `div` with `id='challenge-node'` available for you to use.
+
+# --hints--
+
+There should be a React component called `MyComponent`.
+
+```js
+(getUserInput) =>
+  assert(
+    __helpers
+      .removeWhiteSpace(getUserInput('index'))
+      .includes('classMyComponentextendsReact.Component{')
+  );
+```
+
+`MyComponent` should contain an `h1` tag with text `My First React Component!` Case and punctuation matter.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('h1').text() === 'My First React Component!';
+  })()
+);
+```
+
+`MyComponent` should render to the DOM.
+
+```js
+assert(document.getElementById('challenge-node').childNodes.length === 1);
+```
+
+`MyComponent` should have a constructor calling `super` with `props`.
+
+```js
+assert(
+  MyComponent.toString().includes('MyComponent(props)') &&
+    MyComponent.toString().includes('_super.call(this, props)')
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+// Change code below this line
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>My First React Component!</h1>
+      </div>
+    );
+  }
+};
+
+ReactDOM.render(<MyComponent />, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/react/write-a-simple-counter.md b/curriculum/challenges/italian/03-front-end-libraries/react/write-a-simple-counter.md
new file mode 100644
index 0000000000..9522c78e54
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/react/write-a-simple-counter.md
@@ -0,0 +1,146 @@
+---
+id: 5a24c314108439a4d4036177
+title: Write a Simple Counter
+challengeType: 6
+forumTopicId: 301425
+dashedName: write-a-simple-counter
+---
+
+# --description--
+
+You can design a more complex stateful component by combining the concepts covered so far. These include initializing `state`, writing methods that set `state`, and assigning click handlers to trigger these methods.
+
+# --instructions--
+
+The `Counter` component keeps track of a `count` value in `state`. There are two buttons which call methods `increment()` and `decrement()`. Write these methods so the counter value is incremented or decremented by 1 when the appropriate button is clicked. Also, create a `reset()` method so when the reset button is clicked, the count is set to 0.
+
+**Note:** Make sure you don't modify the `className`s of the buttons. Also, remember to add the necessary bindings for the newly-created methods in the constructor.
+
+# --hints--
+
+`Counter` should return a `div` element which contains three buttons with text content in this order `Increment!`, `Decrement!`, `Reset`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(Counter));
+    return (
+      mockedComponent.find('.inc').text() === 'Increment!' &&
+      mockedComponent.find('.dec').text() === 'Decrement!' &&
+      mockedComponent.find('.reset').text() === 'Reset'
+    );
+  })()
+);
+```
+
+The state of `Counter` should initialize with a `count` property set to `0`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+assert(mockedComponent.find('h1').text() === 'Current Count: 0');
+```
+
+Clicking the increment button should increment the count by `1`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.find('.inc').simulate('click');
+assert(mockedComponent.find('h1').text() === 'Current Count: 1');
+```
+
+Clicking the decrement button should decrement the count by `1`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.find('.dec').simulate('click');
+assert(mockedComponent.find('h1').text() === 'Current Count: -1');
+```
+
+Clicking the reset button should reset the count to `0`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.setState({ count: 5 });
+const currentCountElement = mockedComponent.find('h1');
+assert(currentCountElement.text() === 'Current Count: 5');
+mockedComponent.find('.reset').simulate('click');
+assert(currentCountElement.text() === 'Current Count: 0');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Counter />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Counter extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      count: 0
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return (
+      <div>
+        <button className='inc' onClick={this.increment}>Increment!</button>
+        <button className='dec' onClick={this.decrement}>Decrement!</button>
+        <button className='reset' onClick={this.reset}>Reset</button>
+        <h1>Current Count: {this.state.count}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Counter extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      count: 0
+    };
+  this.increment = this.increment.bind(this);
+ this.decrement = this.decrement.bind(this);
+ this.reset = this.reset.bind(this);
+ }
+  reset() {
+    this.setState({
+      count: 0
+    });
+  }
+  increment() {
+    this.setState(state => ({
+      count: state.count + 1
+    }));
+  }
+  decrement() {
+    this.setState(state => ({
+      count: state.count - 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button className='inc' onClick={this.increment}>Increment!</button>
+        <button className='dec' onClick={this.decrement}>Decrement!</button>
+        <button className='reset' onClick={this.reset}>Reset</button>
+        <h1>Current Count: {this.state.count}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/combine-multiple-reducers.md b/curriculum/challenges/italian/03-front-end-libraries/redux/combine-multiple-reducers.md
new file mode 100644
index 0000000000..741bfc9c6a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/combine-multiple-reducers.md
@@ -0,0 +1,175 @@
+---
+id: 5a24c314108439a4d4036154
+title: Combine Multiple Reducers
+challengeType: 6
+forumTopicId: 301436
+dashedName: combine-multiple-reducers
+---
+
+# --description--
+
+When the state of your app begins to grow more complex, it may be tempting to divide state into multiple pieces. Instead, remember the first principle of Redux: all app state is held in a single state object in the store. Therefore, Redux provides reducer composition as a solution for a complex state model. You define multiple reducers to handle different pieces of your application's state, then compose these reducers together into one root reducer. The root reducer is then passed into the Redux `createStore()` method.
+
+In order to let us combine multiple reducers together, Redux provides the `combineReducers()` method. This method accepts an object as an argument in which you define properties which associate keys to specific reducer functions. The name you give to the keys will be used by Redux as the name for the associated piece of state.
+
+Typically, it is a good practice to create a reducer for each piece of application state when they are distinct or unique in some way. For example, in a note-taking app with user authentication, one reducer could handle authentication while another handles the text and notes that the user is submitting. For such an application, we might write the `combineReducers()` method like this:
+
+```js
+const rootReducer = Redux.combineReducers({
+  auth: authenticationReducer,
+  notes: notesReducer
+});
+```
+
+Now, the key `notes` will contain all of the state associated with our notes and handled by our `notesReducer`. This is how multiple reducers can be composed to manage more complex application state. In this example, the state held in the Redux store would then be a single object containing `auth` and `notes` properties.
+
+# --instructions--
+
+There are `counterReducer()` and `authReducer()` functions provided in the code editor, along with a Redux store. Finish writing the `rootReducer()` function using the `Redux.combineReducers()` method. Assign `counterReducer` to a key called `count` and `authReducer` to a key called `auth`.
+
+# --hints--
+
+The `counterReducer` should increment and decrement the `state`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState().count;
+    store.dispatch({ type: INCREMENT });
+    store.dispatch({ type: INCREMENT });
+    const firstState = store.getState().count;
+    store.dispatch({ type: DECREMENT });
+    const secondState = store.getState().count;
+    return firstState === initialState + 2 && secondState === firstState - 1;
+  })()
+);
+```
+
+The `authReducer` should toggle the `state` of `authenticated` between `true` and `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch({ type: LOGIN });
+    const loggedIn = store.getState().auth.authenticated;
+    store.dispatch({ type: LOGOUT });
+    const loggedOut = store.getState().auth.authenticated;
+    return loggedIn === true && loggedOut === false;
+  })()
+);
+```
+
+The store `state` should have two keys: `count`, which holds a number, and `auth`, which holds an object. The `auth` object should have a property of `authenticated`, which holds a boolean.
+
+```js
+assert(
+  (function () {
+    const state = store.getState();
+    return (
+      typeof state.auth === 'object' &&
+      typeof state.auth.authenticated === 'boolean' &&
+      typeof state.count === 'number'
+    );
+  })()
+);
+```
+
+The `rootReducer` should be a function that combines the `counterReducer` and the `authReducer`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        typeof rootReducer === 'function' &&
+        noWhiteSpace.includes('Redux.combineReducers')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const authReducer = (state = {authenticated: false}, action) => {
+  switch(action.type) {
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+    default:
+      return state;
+  }
+};
+
+const rootReducer = // Define the root reducer here
+
+const store = Redux.createStore(rootReducer);
+```
+
+# --solutions--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const authReducer = (state = {authenticated: false}, action) => {
+  switch(action.type) {
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+    default:
+      return state;
+  }
+};
+
+const rootReducer = Redux.combineReducers({
+  count: counterReducer,
+  auth: authReducer
+});
+
+const store = Redux.createStore(rootReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/copy-an-object-with-object.assign.md b/curriculum/challenges/italian/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
new file mode 100644
index 0000000000..9c004ef012
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
@@ -0,0 +1,133 @@
+---
+id: 5a24c314108439a4d403615b
+title: Copy an Object with Object.assign
+challengeType: 6
+forumTopicId: 301437
+dashedName: copy-an-object-with-object-assign
+---
+
+# --description--
+
+The last several challenges worked with arrays, but there are ways to help enforce state immutability when state is an `object`, too. A useful tool for handling objects is the `Object.assign()` utility. `Object.assign()` takes a target object and source objects and maps properties from the source objects to the target object. Any matching properties are overwritten by properties in the source objects. This behavior is commonly used to make shallow copies of objects by passing an empty object as the first argument followed by the object(s) you want to copy. Here's an example:
+
+```js
+const newObject = Object.assign({}, obj1, obj2);
+```
+
+This creates `newObject` as a new `object`, which contains the properties that currently exist in `obj1` and `obj2`.
+
+# --instructions--
+
+The Redux state and actions were modified to handle an `object` for the `state`. Edit the code to return a new `state` object for actions with type `ONLINE`, which set the `status` property to the string `online`. Try to use `Object.assign()` to complete the challenge.
+
+# --hints--
+
+The Redux store should exist and initialize with a state that is equivalent to the `defaultState` object declared on line 1.
+
+```js
+assert(
+  (function () {
+    const expectedState = {
+      user: 'CamperBot',
+      status: 'offline',
+      friends: '732,982',
+      community: 'freeCodeCamp'
+    };
+    const initialState = store.getState();
+    return DeepEqual(expectedState, initialState);
+  })()
+);
+```
+
+`wakeUp` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof wakeUp === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ONLINE` should update the property `status` in state to `online` and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch({ type: 'ONLINE' });
+    const finalState = store.getState();
+    const expectedState = {
+      user: 'CamperBot',
+      status: 'online',
+      friends: '732,982',
+      community: 'freeCodeCamp'
+    };
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+`Object.assign` should be used to return new state.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('Object.assign'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  user: 'CamperBot',
+  status: 'offline',
+  friends: '732,982',
+  community: 'freeCodeCamp'
+};
+
+const immutableReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case 'ONLINE':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const wakeUp = () => {
+  return {
+    type: 'ONLINE'
+  }
+};
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  user: 'CamperBot',
+  status: 'offline',
+  friends: '732,982',
+  community: 'freeCodeCamp'
+};
+
+const immutableReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case 'ONLINE':
+      return Object.assign({}, state, {
+        status: 'online'
+      });
+    default:
+      return state;
+  }
+};
+
+const wakeUp = () => {
+  return {
+    type: 'ONLINE'
+  }
+};
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/create-a-redux-store.md b/curriculum/challenges/italian/03-front-end-libraries/redux/create-a-redux-store.md
new file mode 100644
index 0000000000..4eb9227a82
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/create-a-redux-store.md
@@ -0,0 +1,61 @@
+---
+id: 5a24c314108439a4d403614b
+title: Create a Redux Store
+challengeType: 6
+forumTopicId: 301439
+dashedName: create-a-redux-store
+---
+
+# --description--
+
+Redux is a state management framework that can be used with a number of different web technologies, including React.
+
+In Redux, there is a single state object that's responsible for the entire state of your application. This means if you had a React app with ten components, and each component had its own local state, the entire state of your app would be defined by a single state object housed in the Redux `store`. This is the first important principle to understand when learning Redux: the Redux store is the single source of truth when it comes to application state.
+
+This also means that any time any piece of your app wants to update state, it **must** do so through the Redux store. The unidirectional data flow makes it easier to track state management in your app.
+
+# --instructions--
+
+The Redux `store` is an object which holds and manages application `state`. There is a method called `createStore()` on the Redux object, which you use to create the Redux `store`. This method takes a `reducer` function as a required argument. The `reducer` function is covered in a later challenge, and is already defined for you in the code editor. It simply takes `state` as an argument and returns `state`.
+
+Declare a `store` variable and assign it to the `createStore()` method, passing in the `reducer` as an argument.
+
+**Note:** The code in the editor uses ES6 default argument syntax to initialize this state to hold a value of `5`. If you're not familiar with default arguments, you can refer to the [ES6 section in the Curriculum](https://learn.freecodecamp.org/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions) which covers this topic.
+
+# --hints--
+
+The Redux store should exist.
+
+```js
+assert(typeof store.getState === 'function');
+```
+
+The Redux store should have a value of 5 for the state.
+
+```js
+assert(store.getState() === 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const reducer = (state = 5) => {
+  return state;
+}
+
+// Redux methods are available from a Redux object
+// For example: Redux.createStore()
+// Define the store here:
+```
+
+# --solutions--
+
+```js
+const reducer = (state = 5) => {
+  return state;
+}
+
+const store = Redux.createStore(reducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/define-a-redux-action.md b/curriculum/challenges/italian/03-front-end-libraries/redux/define-a-redux-action.md
new file mode 100644
index 0000000000..31f49e2e33
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/define-a-redux-action.md
@@ -0,0 +1,55 @@
+---
+id: 5a24c314108439a4d403614d
+title: Define a Redux Action
+challengeType: 6
+forumTopicId: 301440
+dashedName: define-a-redux-action
+---
+
+# --description--
+
+Since Redux is a state management framework, updating state is one of its core tasks. In Redux, all state updates are triggered by dispatching actions. An action is simply a JavaScript object that contains information about an action event that has occurred. The Redux store receives these action objects, then updates its state accordingly. Sometimes a Redux action also carries some data. For example, the action carries a username after a user logs in. While the data is optional, actions must carry a `type` property that specifies the 'type' of action that occurred.
+
+Think of Redux actions as messengers that deliver information about events happening in your app to the Redux store. The store then conducts the business of updating state based on the action that occurred.
+
+# --instructions--
+
+Writing a Redux action is as simple as declaring an object with a type property. Declare an object `action` and give it a property `type` set to the string `'LOGIN'`.
+
+# --hints--
+
+An `action` object should exist.
+
+```js
+assert(
+  (function () {
+    return typeof action === 'object';
+  })()
+);
+```
+
+The `action` object should have a key property `type` with value `LOGIN`.
+
+```js
+assert(
+  (function () {
+    return action.type === 'LOGIN';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Define an action here:
+```
+
+# --solutions--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/define-an-action-creator.md b/curriculum/challenges/italian/03-front-end-libraries/redux/define-an-action-creator.md
new file mode 100644
index 0000000000..656723c9e1
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/define-an-action-creator.md
@@ -0,0 +1,57 @@
+---
+id: 5a24c314108439a4d403614e
+title: Define an Action Creator
+challengeType: 6
+forumTopicId: 301441
+dashedName: define-an-action-creator
+---
+
+# --description--
+
+After creating an action, the next step is sending the action to the Redux store so it can update its state. In Redux, you define action creators to accomplish this. An action creator is simply a JavaScript function that returns an action. In other words, action creators create objects that represent action events.
+
+# --instructions--
+
+Define a function named `actionCreator()` that returns the `action` object when called.
+
+# --hints--
+
+The function `actionCreator` should exist.
+
+```js
+assert(typeof actionCreator === 'function');
+```
+
+Running the `actionCreator` function should return the `action` object.
+
+```js
+assert(typeof action === 'object');
+```
+
+The returned `action` should have a key property `type` with value `LOGIN`.
+
+```js
+assert(action.type === 'LOGIN');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+// Define an action creator here:
+```
+
+# --solutions--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+const actionCreator = () => {
+  return action;
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/dispatch-an-action-event.md b/curriculum/challenges/italian/03-front-end-libraries/redux/dispatch-an-action-event.md
new file mode 100644
index 0000000000..46bfbbb12e
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/dispatch-an-action-event.md
@@ -0,0 +1,85 @@
+---
+id: 5a24c314108439a4d403614f
+title: Dispatch an Action Event
+challengeType: 6
+forumTopicId: 301442
+dashedName: dispatch-an-action-event
+---
+
+# --description--
+
+`dispatch` method is what you use to dispatch actions to the Redux store. Calling `store.dispatch()` and passing the value returned from an action creator sends an action back to the store.
+
+Recall that action creators return an object with a type property that specifies the action that has occurred. Then the method dispatches an action object to the Redux store. Based on the previous challenge's example, the following lines are equivalent, and both dispatch the action of type `LOGIN`:
+
+```js
+store.dispatch(actionCreator());
+store.dispatch({ type: 'LOGIN' });
+```
+
+# --instructions--
+
+The Redux store in the code editor has an initialized state that's an object containing a `login` property currently set to `false`. There's also an action creator called `loginAction()` which returns an action of type `LOGIN`. Dispatch the `LOGIN` action to the Redux store by calling the `dispatch` method, and pass in the action created by `loginAction()`.
+
+# --hints--
+
+Calling the function `loginAction` should return an object with `type` property set to the string `LOGIN`.
+
+```js
+assert(loginAction().type === 'LOGIN');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().login === false);
+```
+
+The `store.dispatch()` method should be used to dispatch an action of type `LOGIN`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      let noWhiteSpace = getUserInput('index').replace(/\s/g, '');
+      return (
+        noWhiteSpace.includes('store.dispatch(loginAction())') ||
+        noWhiteSpace.includes("store.dispatch({type: 'LOGIN'})") === true
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const store = Redux.createStore(
+  (state = {login: false}) => state
+);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+// Dispatch the action here:
+```
+
+# --solutions--
+
+```js
+const store = Redux.createStore(
+  (state = {login: false}) => state
+);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+store.dispatch(loginAction());
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/get-state-from-the-redux-store.md b/curriculum/challenges/italian/03-front-end-libraries/redux/get-state-from-the-redux-store.md
new file mode 100644
index 0000000000..7c348ad330
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/get-state-from-the-redux-store.md
@@ -0,0 +1,55 @@
+---
+id: 5a24c314108439a4d403614c
+title: Get State from the Redux Store
+challengeType: 6
+forumTopicId: 301443
+dashedName: get-state-from-the-redux-store
+---
+
+# --description--
+
+The Redux store object provides several methods that allow you to interact with it. For example, you can retrieve the current `state` held in the Redux store object with the `getState()` method.
+
+# --instructions--
+
+The code from the previous challenge is re-written more concisely in the code editor. Use `store.getState()` to retrieve the `state` from the `store`, and assign this to a new variable `currentState`.
+
+# --hints--
+
+The Redux store should have a value of 5 for the initial state.
+
+```js
+assert(store.getState() === 5);
+```
+
+A variable `currentState` should exist and should be assigned the current state of the Redux store.
+
+```js
+(getUserInput) =>
+  assert(
+    currentState === 5 && getUserInput('index').includes('store.getState()')
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const store = Redux.createStore(
+  (state = 5) => state
+);
+
+// Change code below this line
+```
+
+# --solutions--
+
+```js
+const store = Redux.createStore(
+  (state = 5) => state
+);
+
+// Change code below this line
+const currentState = store.getState();
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/handle-an-action-in-the-store.md b/curriculum/challenges/italian/03-front-end-libraries/redux/handle-an-action-in-the-store.md
new file mode 100644
index 0000000000..d33750b9c3
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/handle-an-action-in-the-store.md
@@ -0,0 +1,108 @@
+---
+id: 5a24c314108439a4d4036150
+title: Handle an Action in the Store
+challengeType: 6
+forumTopicId: 301444
+dashedName: handle-an-action-in-the-store
+---
+
+# --description--
+
+After an action is created and dispatched, the Redux store needs to know how to respond to that action. This is the job of a `reducer` function. Reducers in Redux are responsible for the state modifications that take place in response to actions. A `reducer` takes `state` and `action` as arguments, and it always returns a new `state`. It is important to see that this is the **only** role of the reducer. It has no side effects — it never calls an API endpoint and it never has any hidden surprises. The reducer is simply a pure function that takes state and action, then returns new state.
+
+Another key principle in Redux is that `state` is read-only. In other words, the `reducer` function must **always** return a new copy of `state` and never modify state directly. Redux does not enforce state immutability, however, you are responsible for enforcing it in the code of your reducer functions. You'll practice this in later challenges.
+
+# --instructions--
+
+The code editor has the previous example as well as the start of a `reducer` function for you. Fill in the body of the `reducer` function so that if it receives an action of type `'LOGIN'` it returns a state object with `login` set to `true`. Otherwise, it returns the current `state`. Note that the current `state` and the dispatched `action` are passed to the reducer, so you can access the action's type directly with `action.type`.
+
+# --hints--
+
+Calling the function `loginAction` should return an object with type property set to the string `LOGIN`.
+
+```js
+assert(loginAction().type === 'LOGIN');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().login === false);
+```
+
+Dispatching `loginAction` should update the `login` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginAction());
+    const afterState = store.getState();
+    return initialState.login === false && afterState.login === true;
+  })()
+);
+```
+
+If the action is not of type `LOGIN`, the store should return the current state.
+
+```js
+assert(
+  (function () {
+    store.dispatch({ type: '__TEST__ACTION__' });
+    let afterTest = store.getState();
+    return typeof afterTest === 'object' && afterTest.hasOwnProperty('login');
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  login: false
+};
+
+const reducer = (state = defaultState, action) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(reducer);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  login: false
+};
+
+const reducer = (state = defaultState, action) => {
+
+  if (action.type === 'LOGIN') {
+    return {login: true}
+  }
+
+  else {
+    return state
+  }
+
+};
+
+const store = Redux.createStore(reducer);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/never-mutate-state.md b/curriculum/challenges/italian/03-front-end-libraries/redux/never-mutate-state.md
new file mode 100644
index 0000000000..002a7c4da2
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/never-mutate-state.md
@@ -0,0 +1,133 @@
+---
+id: 5a24c314108439a4d4036158
+title: Never Mutate State
+challengeType: 6
+forumTopicId: 301445
+dashedName: never-mutate-state
+---
+
+# --description--
+
+These final challenges describe several methods of enforcing the key principle of state immutability in Redux. Immutable state means that you never modify state directly, instead, you return a new copy of state.
+
+If you took a snapshot of the state of a Redux app over time, you would see something like `state 1`, `state 2`, `state 3`,`state 4`, `...` and so on where each state may be similar to the last, but each is a distinct piece of data. This immutability, in fact, is what provides such features as time-travel debugging that you may have heard about.
+
+Redux does not actively enforce state immutability in its store or reducers, that responsibility falls on the programmer. Fortunately, JavaScript (especially ES6) provides several useful tools you can use to enforce the immutability of your state, whether it is a `string`, `number`, `array`, or `object`. Note that strings and numbers are primitive values and are immutable by nature. In other words, 3 is always 3. You cannot change the value of the number 3. An `array` or `object`, however, is mutable. In practice, your state will probably consist of an `array` or `object`, as these are useful data structures for representing many types of information.
+
+# --instructions--
+
+There is a `store` and `reducer` in the code editor for managing to-do items. Finish writing the `ADD_TO_DO` case in the reducer to append a new to-do to the state. There are a few ways to accomplish this with standard JavaScript or ES6. See if you can find a way to return a new array with the item from `action.todo` appended to the end.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to the `todos` array in the code editor.
+
+```js
+assert(
+  (function () {
+    const todos = [
+      'Go to the store',
+      'Clean the house',
+      'Cook dinner',
+      'Learn to code'
+    ];
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) && initialState.join(',') === todos.join(',')
+    );
+  })()
+);
+```
+
+`addToDo` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof addToDo === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ADD_TO_DO` on the Redux store should add a `todo` item and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addToDo('__TEST__TO__DO__'));
+    const finalState = store.getState();
+    const expectedState = [
+      'Go to the store',
+      'Clean the house',
+      'Cook dinner',
+      'Learn to code',
+      '__TEST__TO__DO__'
+    ];
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const ADD_TO_DO = 'ADD_TO_DO';
+
+// A list of strings representing tasks to do:
+const todos = [
+  'Go to the store',
+  'Clean the house',
+  'Cook dinner',
+  'Learn to code',
+];
+
+const immutableReducer = (state = todos, action) => {
+  switch(action.type) {
+    case ADD_TO_DO:
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: ADD_TO_DO,
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const ADD_TO_DO = 'ADD_TO_DO';
+
+const todos = [
+  'Go to the store',
+  'Clean the house',
+  'Cook dinner',
+  'Learn to code',
+];
+
+const immutableReducer = (state = todos, action) => {
+  switch(action.type) {
+    case ADD_TO_DO:
+      return state.concat(action.todo);
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: ADD_TO_DO,
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/register-a-store-listener.md b/curriculum/challenges/italian/03-front-end-libraries/redux/register-a-store-listener.md
new file mode 100644
index 0000000000..d3d43ced41
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/register-a-store-listener.md
@@ -0,0 +1,118 @@
+---
+id: 5a24c314108439a4d4036153
+title: Register a Store Listener
+challengeType: 6
+forumTopicId: 301446
+dashedName: register-a-store-listener
+---
+
+# --description--
+
+Another method you have access to on the Redux `store` object is `store.subscribe()`. This allows you to subscribe listener functions to the store, which are called whenever an action is dispatched against the store. One simple use for this method is to subscribe a function to your store that simply logs a message every time an action is received and the store is updated.
+
+# --instructions--
+
+Write a callback function that increments the global variable `count` every time the store receives an action, and pass this function in to the `store.subscribe()` method. You'll see that `store.dispatch()` is called three times in a row, each time directly passing in an action object. Watch the console output between the action dispatches to see the updates take place.
+
+# --hints--
+
+Dispatching the `ADD` action on the store should increment the state by `1`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch({ type: 'ADD' });
+    const newState = store.getState();
+    return newState === initialState + 1;
+  })()
+);
+```
+
+There should be a listener function subscribed to the store using `store.subscribe`.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/store\s*\.\s*subscribe\(/gm));
+```
+
+The `store.subscribe` should receive a function.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/(\s*function\s*)|(\s*\(\s*\)\s*=>)/gm)) 
+```
+
+The callback to `store.subscribe` should also increment the global `count` variable as the store is updated.
+
+```js
+assert(store.getState() === count);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+count = 0;
+```
+
+## --seed-contents--
+
+```js
+const ADD = 'ADD';
+
+const reducer = (state = 0, action) => {
+  switch(action.type) {
+    case ADD:
+      return state + 1;
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(reducer);
+
+// Global count variable:
+let count = 0;
+
+// Change code below this line
+
+// Change code above this line
+
+store.dispatch({type: ADD});
+console.log(count);
+store.dispatch({type: ADD});
+console.log(count);
+store.dispatch({type: ADD});
+console.log(count);
+```
+
+# --solutions--
+
+```js
+const ADD = 'ADD';
+
+const reducer = (state = 0, action) => {
+  switch(action.type) {
+    case ADD:
+      return state + 1;
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(reducer);
+ let count = 0;
+// Change code below this line
+
+store.subscribe( () =>
+ {
+ count++;
+ }
+);
+
+// Change code above this line
+
+store.dispatch({type: ADD});
+store.dispatch({type: ADD});
+store.dispatch({type: ADD});
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/remove-an-item-from-an-array.md b/curriculum/challenges/italian/03-front-end-libraries/redux/remove-an-item-from-an-array.md
new file mode 100644
index 0000000000..16bd461669
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/remove-an-item-from-an-array.md
@@ -0,0 +1,114 @@
+---
+id: 5a24c314108439a4d403615a
+title: Remove an Item from an Array
+challengeType: 6
+forumTopicId: 301447
+dashedName: remove-an-item-from-an-array
+---
+
+# --description--
+
+Time to practice removing items from an array. The spread operator can be used here as well. Other useful JavaScript methods include `slice()` and `concat()`.
+
+# --instructions--
+
+The reducer and action creator were modified to remove an item from an array based on the index of the item. Finish writing the reducer so a new state array is returned with the item at the specific index removed.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to `[0,1,2,3,4,5]`
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) === true &&
+      DeepEqual(initialState, [0, 1, 2, 3, 4, 5])
+    );
+  })()
+);
+```
+
+`removeItem` and `immutableReducer` both should be functions.
+
+```js
+assert(
+  typeof removeItem === 'function' && typeof immutableReducer === 'function'
+);
+```
+
+Dispatching the `removeItem` action creator should remove items from the state and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(removeItem(3));
+    const state_1 = store.getState();
+    store.dispatch(removeItem(2));
+    const state_2 = store.getState();
+    store.dispatch(removeItem(0));
+    store.dispatch(removeItem(0));
+    store.dispatch(removeItem(0));
+    const state_3 = store.getState();
+    return (
+      isFrozen &&
+      DeepEqual(state_1, [0, 1, 2, 4, 5]) &&
+      DeepEqual(state_2, [0, 1, 4, 5]) &&
+      DeepEqual(state_3, [5])
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const immutableReducer = (state = [0,1,2,3,4,5], action) => {
+  switch(action.type) {
+    case 'REMOVE_ITEM':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const removeItem = (index) => {
+  return {
+    type: 'REMOVE_ITEM',
+    index
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const immutableReducer = (state = [0,1,2,3,4,5], action) => {
+  switch(action.type) {
+    case 'REMOVE_ITEM':
+      return [
+        ...state.slice(0, action.index),
+        ...state.slice(action.index + 1)
+      ];
+    default:
+      return state;
+  }
+};
+
+const removeItem = (index) => {
+  return {
+    type: 'REMOVE_ITEM',
+    index
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/send-action-data-to-the-store.md b/curriculum/challenges/italian/03-front-end-libraries/redux/send-action-data-to-the-store.md
new file mode 100644
index 0000000000..ccfda74b7a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/send-action-data-to-the-store.md
@@ -0,0 +1,107 @@
+---
+id: 5a24c314108439a4d4036155
+title: Send Action Data to the Store
+challengeType: 6
+forumTopicId: 301448
+dashedName: send-action-data-to-the-store
+---
+
+# --description--
+
+By now you've learned how to dispatch actions to the Redux store, but so far these actions have not contained any information other than a `type`. You can also send specific data along with your actions. In fact, this is very common because actions usually originate from some user interaction and tend to carry some data with them. The Redux store often needs to know about this data.
+
+# --instructions--
+
+There's a basic `notesReducer()` and an `addNoteText()` action creator defined in the code editor. Finish the body of the `addNoteText()` function so that it returns an `action` object. The object should include a `type` property with a value of `ADD_NOTE`, and also a `text` property set to the `note` data that's passed into the action creator. When you call the action creator, you'll pass in specific note information that you can access for the object.
+
+Next, finish writing the `switch` statement in the `notesReducer()`. You need to add a case that handles the `addNoteText()` actions. This case should be triggered whenever there is an action of type `ADD_NOTE` and it should return the `text` property on the incoming `action` as the new `state`.
+
+The action is dispatched at the bottom of the code. Once you're finished, run the code and watch the console. That's all it takes to send action-specific data to the store and use it when you update store `state`.
+
+# --hints--
+
+The action creator `addNoteText` should return an object with keys `type` and `text`.
+
+```js
+assert(
+  (function () {
+    const addNoteFn = addNoteText('__TEST__NOTE');
+    return addNoteFn.type === ADD_NOTE && addNoteFn.text === '__TEST__NOTE';
+  })()
+);
+```
+
+Dispatching an action of type `ADD_NOTE` with the `addNoteText` action creator should update the `state` to the string passed to the action creator.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(addNoteText('__TEST__NOTE'));
+    const newState = store.getState();
+    return initialState !== newState && newState === '__TEST__NOTE';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const ADD_NOTE = 'ADD_NOTE';
+
+const notesReducer = (state = 'Initial State', action) => {
+  switch(action.type) {
+    // Change code below this line
+
+    // Change code above this line
+    default:
+      return state;
+  }
+};
+
+const addNoteText = (note) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(notesReducer);
+
+console.log(store.getState());
+store.dispatch(addNoteText('Hello!'));
+console.log(store.getState());
+```
+
+# --solutions--
+
+```js
+const ADD_NOTE = 'ADD_NOTE';
+
+const notesReducer = (state = 'Initial State', action) => {
+  switch(action.type) {
+    // Change code below this line
+    case ADD_NOTE:
+      return action.text;
+    // Change code above this line
+    default:
+      return state;
+  }
+};
+
+const addNoteText = (note) => {
+  // Change code below this line
+  return {
+    type: ADD_NOTE,
+    text: note
+  }
+  // Change code above this line
+};
+
+const store = Redux.createStore(notesReducer);
+
+console.log(store.getState());
+store.dispatch(addNoteText('Hello Redux!'));
+console.log(store.getState());
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md b/curriculum/challenges/italian/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
new file mode 100644
index 0000000000..604bc416f7
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
@@ -0,0 +1,152 @@
+---
+id: 5a24c314108439a4d4036151
+title: Use a Switch Statement to Handle Multiple Actions
+challengeType: 6
+forumTopicId: 301449
+dashedName: use-a-switch-statement-to-handle-multiple-actions
+---
+
+# --description--
+
+You can tell the Redux store how to handle multiple action types. Say you are managing user authentication in your Redux store. You want to have a state representation for when users are logged in and when they are logged out. You represent this with a single state object with the property `authenticated`. You also need action creators that create actions corresponding to user login and user logout, along with the action objects themselves.
+
+# --instructions--
+
+The code editor has a store, actions, and action creators set up for you. Fill in the `reducer` function to handle multiple authentication actions. Use a JavaScript `switch` statement in the `reducer` to respond to different action events. This is a standard pattern in writing Redux reducers. The switch statement should switch over `action.type` and return the appropriate authentication state.
+
+**Note:** At this point, don't worry about state immutability, since it is small and simple in this example. For each action, you can return a new object — for example, `{authenticated: true}`. Also, don't forget to write a `default` case in your switch statement that returns the current `state`. This is important because once your app has multiple reducers, they are all run any time an action dispatch is made, even when the action isn't related to that reducer. In such a case, you want to make sure that you return the current `state`.
+
+# --hints--
+
+Calling the function `loginUser` should return an object with type property set to the string `LOGIN`.
+
+```js
+assert(loginUser().type === 'LOGIN');
+```
+
+Calling the function `logoutUser` should return an object with type property set to the string `LOGOUT`.
+
+```js
+assert(logoutUser().type === 'LOGOUT');
+```
+
+The store should be initialized with an object with an `authenticated` property set to `false`.
+
+```js
+assert(store.getState().authenticated === false);
+```
+
+Dispatching `loginUser` should update the `authenticated` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginUser());
+    const afterLogin = store.getState();
+    return (
+      initialState.authenticated === false && afterLogin.authenticated === true
+    );
+  })()
+);
+```
+
+Dispatching `logoutUser` should update the `authenticated` property in the store state to `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch(loginUser());
+    const loggedIn = store.getState();
+    store.dispatch(logoutUser());
+    const afterLogout = store.getState();
+    return (
+      loggedIn.authenticated === true && afterLogout.authenticated === false
+    );
+  })()
+);
+```
+
+The `authReducer` function should handle multiple action types with a `switch` statement.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').toString().includes('switch') &&
+      getUserInput('index').toString().includes('case') &&
+      getUserInput('index').toString().includes('default')
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+
+    case 'LOGIN':
+      return {
+        authenticated: true
+      }
+
+    case 'LOGOUT':
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/use-const-for-action-types.md b/curriculum/challenges/italian/03-front-end-libraries/redux/use-const-for-action-types.md
new file mode 100644
index 0000000000..5893acce88
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/use-const-for-action-types.md
@@ -0,0 +1,204 @@
+---
+id: 5a24c314108439a4d4036152
+title: Use const for Action Types
+challengeType: 6
+forumTopicId: 301450
+dashedName: use-const-for-action-types
+---
+
+# --description--
+
+A common practice when working with Redux is to assign action types as read-only constants, then reference these constants wherever they are used. You can refactor the code you're working with to write the action types as `const` declarations.
+
+# --instructions--
+
+Declare `LOGIN` and `LOGOUT` as `const` values and assign them to the strings `'LOGIN'` and `'LOGOUT'`, respectively. Then, edit the `authReducer()` and the action creators to reference these constants instead of string values.
+
+**Note:** It's generally a convention to write constants in all uppercase, and this is standard practice in Redux as well.
+
+# --hints--
+
+Calling the function `loginUser` should return an object with `type` property set to the string `LOGIN`.
+
+```js
+assert(loginUser().type === 'LOGIN');
+```
+
+Calling the function `logoutUser` should return an object with `type` property set to the string `LOGOUT`.
+
+```js
+assert(logoutUser().type === 'LOGOUT');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().authenticated === false);
+```
+
+Dispatching `loginUser` should update the `login` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginUser());
+    const afterLogin = store.getState();
+    return (
+      initialState.authenticated === false && afterLogin.authenticated === true
+    );
+  })()
+);
+```
+
+Dispatching `logoutUser` should update the `login` property in the store state to `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch(loginUser());
+    const loggedIn = store.getState();
+    store.dispatch(logoutUser());
+    const afterLogout = store.getState();
+    return (
+      loggedIn.authenticated === true && afterLogout.authenticated === false
+    );
+  })()
+);
+```
+
+The `authReducer` function should handle multiple action types with a switch statement.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      return (
+        typeof authReducer === 'function' &&
+        getUserInput('index').toString().includes('switch') &&
+        getUserInput('index').toString().includes('case') &&
+        getUserInput('index').toString().includes('default')
+      );
+    })()
+  );
+```
+
+`LOGIN` and `LOGOUT` should be declared as `const` values and should be assigned strings of `LOGIN`and `LOGOUT`.
+
+```js
+const noWhiteSpace = __helpers.removeWhiteSpace(code);
+assert(
+  /constLOGIN=(['"`])LOGIN\1/.test(noWhiteSpace) &&
+    /constLOGOUT=(['"`])LOGOUT\1/.test(noWhiteSpace)
+);
+```
+
+The action creators and the reducer should reference the `LOGIN` and `LOGOUT` constants.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(
+        getUserInput('index').toString()
+      );
+      return (
+        noWhiteSpace.includes('caseLOGIN:') &&
+        noWhiteSpace.includes('caseLOGOUT:') &&
+        noWhiteSpace.includes('type:LOGIN') &&
+        noWhiteSpace.includes('type:LOGOUT')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+    case 'LOGIN': 
+      return {
+        authenticated: true
+      }
+    case 'LOGOUT': 
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: LOGIN
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: LOGOUT
+  }
+};
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md b/curriculum/challenges/italian/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
new file mode 100644
index 0000000000..9839855204
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
@@ -0,0 +1,170 @@
+---
+id: 5a24c314108439a4d4036156
+title: Use Middleware to Handle Asynchronous Actions
+challengeType: 6
+forumTopicId: 301451
+dashedName: use-middleware-to-handle-asynchronous-actions
+---
+
+# --description--
+
+So far these challenges have avoided discussing asynchronous actions, but they are an unavoidable part of web development. At some point you'll need to call asynchronous endpoints in your Redux app, so how do you handle these types of requests? Redux provides middleware designed specifically for this purpose, called Redux Thunk middleware. Here's a brief description how to use this with Redux.
+
+To include Redux Thunk middleware, you pass it as an argument to `Redux.applyMiddleware()`. This statement is then provided as a second optional parameter to the `createStore()` function. Take a look at the code at the bottom of the editor to see this. Then, to create an asynchronous action, you return a function in the action creator that takes `dispatch` as an argument. Within this function, you can dispatch actions and perform asynchronous requests.
+
+In this example, an asynchronous request is simulated with a `setTimeout()` call. It's common to dispatch an action before initiating any asynchronous behavior so that your application state knows that some data is being requested (this state could display a loading icon, for instance). Then, once you receive the data, you dispatch another action which carries the data as a payload along with information that the action is completed.
+
+Remember that you're passing `dispatch` as a parameter to this special action creator. This is what you'll use to dispatch your actions, you simply pass the action directly to dispatch and the middleware takes care of the rest.
+
+# --instructions--
+
+Write both dispatches in the `handleAsync()` action creator. Dispatch `requestingData()` before the `setTimeout()` (the simulated API call). Then, after you receive the (pretend) data, dispatch the `receivedData()` action, passing in this data. Now you know how to handle asynchronous actions in Redux. Everything else continues to behave as before.
+
+# --hints--
+
+The `requestingData` action creator should return an object of type equal to the value of `REQUESTING_DATA`.
+
+```js
+assert(requestingData().type === REQUESTING_DATA);
+```
+
+The `receivedData` action creator should return an object of type equal to the value of `RECEIVED_DATA`.
+
+```js
+assert(receivedData('data').type === RECEIVED_DATA);
+```
+
+`asyncDataReducer` should be a function.
+
+```js
+assert(typeof asyncDataReducer === 'function');
+```
+
+Dispatching the `requestingData` action creator should update the store `state` property of fetching to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(requestingData());
+    const reqState = store.getState();
+    return initialState.fetching === false && reqState.fetching === true;
+  })()
+);
+```
+
+Dispatching `handleAsync` should dispatch the data request action and then dispatch the received data action after a delay.
+
+```js
+assert(
+  (function () {
+    const noWhiteSpace = __helpers.removeWhiteSpace(handleAsync.toString());
+    return (
+      noWhiteSpace.includes('dispatch(requestingData())') === true &&
+      noWhiteSpace.includes('dispatch(receivedData(data))') === true
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const REQUESTING_DATA = 'REQUESTING_DATA'
+const RECEIVED_DATA = 'RECEIVED_DATA'
+
+const requestingData = () => { return {type: REQUESTING_DATA} }
+const receivedData = (data) => { return {type: RECEIVED_DATA, users: data.users} }
+
+const handleAsync = () => {
+  return function(dispatch) {
+    // Dispatch request action here
+
+    setTimeout(function() {
+      let data = {
+        users: ['Jeff', 'William', 'Alice']
+      }
+      // Dispatch received data action here
+
+    }, 2500);
+  }
+};
+
+const defaultState = {
+  fetching: false,
+  users: []
+};
+
+const asyncDataReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case REQUESTING_DATA:
+      return {
+        fetching: true,
+        users: []
+      }
+    case RECEIVED_DATA:
+      return {
+        fetching: false,
+        users: action.users
+      }
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(
+  asyncDataReducer,
+  Redux.applyMiddleware(ReduxThunk.default)
+);
+```
+
+# --solutions--
+
+```js
+const REQUESTING_DATA = 'REQUESTING_DATA'
+const RECEIVED_DATA = 'RECEIVED_DATA'
+
+const requestingData = () => { return {type: REQUESTING_DATA} }
+const receivedData = (data) => { return {type: RECEIVED_DATA, users: data.users} }
+
+const handleAsync = () => {
+  return function(dispatch) {
+    dispatch(requestingData());
+    setTimeout(function() {
+      let data = {
+        users: ['Jeff', 'William', 'Alice']
+      }
+      dispatch(receivedData(data));
+    }, 2500);
+  }
+};
+
+const defaultState = {
+  fetching: false,
+  users: []
+};
+
+const asyncDataReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case REQUESTING_DATA:
+      return {
+        fetching: true,
+        users: []
+      }
+    case RECEIVED_DATA:
+      return {
+        fetching: false,
+        users: action.users
+      }
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(
+  asyncDataReducer,
+  Redux.applyMiddleware(ReduxThunk.default)
+);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md b/curriculum/challenges/italian/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
new file mode 100644
index 0000000000..68e6f320ac
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
@@ -0,0 +1,114 @@
+---
+id: 5a24c314108439a4d4036159
+title: Use the Spread Operator on Arrays
+challengeType: 6
+forumTopicId: 301452
+dashedName: use-the-spread-operator-on-arrays
+---
+
+# --description--
+
+One solution from ES6 to help enforce state immutability in Redux is the spread operator: `...`. The spread operator has a variety of applications, one of which is well-suited to the previous challenge of producing a new array from an existing array. This is relatively new, but commonly used syntax. For example, if you have an array `myArray` and write:
+
+```js
+let newArray = [...myArray];
+```
+
+`newArray` is now a clone of `myArray`. Both arrays still exist separately in memory. If you perform a mutation like `newArray.push(5)`, `myArray` doesn't change. The `...` effectively *spreads* out the values in `myArray` into a new array. To clone an array but add additional values in the new array, you could write `[...myArray, 'new value']`. This would return a new array composed of the values in `myArray` and the string `new value` as the last value. The spread syntax can be used multiple times in array composition like this, but it's important to note that it only makes a shallow copy of the array. That is to say, it only provides immutable array operations for one-dimensional arrays.
+
+# --instructions--
+
+Use the spread operator to return a new copy of state when a to-do is added.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to `["Do not mutate state!"]`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) === true &&
+      initialState[0] === 'Do not mutate state!'
+    );
+  })()
+);
+```
+
+`addToDo` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof addToDo === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ADD_TO_DO` on the Redux store should add a `todo` item and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addToDo('__TEST__TO__DO__'));
+    const finalState = store.getState();
+    const expectedState = ['Do not mutate state!', '__TEST__TO__DO__'];
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+The spread operator should be used to return new state.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('...state'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const immutableReducer = (state = ['Do not mutate state!'], action) => {
+  switch(action.type) {
+    case 'ADD_TO_DO':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: 'ADD_TO_DO',
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const immutableReducer = (state = ['Do not mutate state!'], action) => {
+  switch(action.type) {
+    case 'ADD_TO_DO':
+      return [
+        ...state,
+        action.todo
+      ];
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: 'ADD_TO_DO',
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/redux/write-a-counter-with-redux.md b/curriculum/challenges/italian/03-front-end-libraries/redux/write-a-counter-with-redux.md
new file mode 100644
index 0000000000..9bf25454c3
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/redux/write-a-counter-with-redux.md
@@ -0,0 +1,116 @@
+---
+id: 5a24c314108439a4d4036157
+title: Write a Counter with Redux
+challengeType: 6
+forumTopicId: 301453
+dashedName: write-a-counter-with-redux
+---
+
+# --description--
+
+Now you've learned all the core principles of Redux! You've seen how to create actions and action creators, create a Redux store, dispatch your actions against the store, and design state updates with pure reducers. You've even seen how to manage complex state with reducer composition and handle asynchronous actions. These examples are simplistic, but these concepts are the core principles of Redux. If you understand them well, you're ready to start building your own Redux app. The next challenges cover some of the details regarding `state` immutability, but first, here's a review of everything you've learned so far.
+
+# --instructions--
+
+In this lesson, you'll implement a simple counter with Redux from scratch. The basics are provided in the code editor, but you'll have to fill in the details! Use the names that are provided and define `incAction` and `decAction` action creators, the `counterReducer()`, `INCREMENT` and `DECREMENT` action types, and finally the Redux `store`. Once you're finished you should be able to dispatch `INCREMENT` or `DECREMENT` actions to increment or decrement the state held in the `store`. Good luck building your first Redux app!
+
+# --hints--
+
+The action creator `incAction` should return an action object with `type` equal to the value of `INCREMENT`
+
+```js
+assert(incAction().type === INCREMENT);
+```
+
+The action creator `decAction` should return an action object with `type` equal to the value of `DECREMENT`
+
+```js
+assert(decAction().type === DECREMENT);
+```
+
+The Redux store should initialize with a `state` of 0.
+
+```js
+assert(store.getState() === 0);
+```
+
+Dispatching `incAction` on the Redux store should increment the `state` by 1.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(incAction());
+    const incState = store.getState();
+    return initialState + 1 === incState;
+  })()
+);
+```
+
+Dispatching `decAction` on the Redux store should decrement the `state` by 1.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(decAction());
+    const decState = store.getState();
+    return initialState - 1 === decState;
+  })()
+);
+```
+
+`counterReducer` should be a function
+
+```js
+assert(typeof counterReducer === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const INCREMENT = null; // Define a constant for increment action types
+const DECREMENT = null; // Define a constant for decrement action types
+
+const counterReducer = null; // Define the counter reducer which will increment or decrement the state based on the action it receives
+
+const incAction = null; // Define an action creator for incrementing
+
+const decAction = null; // Define an action creator for decrementing
+
+const store = null; // Define the Redux store here, passing in your reducers
+```
+
+# --solutions--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const incAction = () => {
+  return {
+    type: INCREMENT
+  }
+};
+
+const decAction = () => {
+  return {
+    type: DECREMENT
+  }
+};
+
+const store = Redux.createStore(counterReducer);
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md b/curriculum/challenges/italian/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
new file mode 100644
index 0000000000..0e6f582247
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
@@ -0,0 +1,117 @@
+---
+id: 587d7dbf367417b2b2512bbb
+title: Apply a Style Until a Condition is Met with @while
+challengeType: 0
+forumTopicId: 301454
+dashedName: apply-a-style-until-a-condition-is-met-with-while
+---
+
+# --description--
+
+The `@while` directive is an option with similar functionality to the JavaScript `while` loop. It creates CSS rules until a condition is met.
+
+The `@for` challenge gave an example to create a simple grid system. This can also work with `@while`.
+
+```scss
+$x: 1;
+@while $x < 13 {
+  .col-#{$x} { width: 100%/12 * $x;}
+  $x: $x + 1;
+}
+```
+
+First, define a variable `$x` and set it to 1. Next, use the `@while` directive to create the grid system *while* `$x` is less than 13. After setting the CSS rule for `width`, `$x` is incremented by 1 to avoid an infinite loop.
+
+# --instructions--
+
+Use `@while` to create a series of classes with different `font-sizes`.
+
+There should be 5 different classes from `text-1` to `text-5`. Then set `font-size` to `15px` multiplied by the current index number. Make sure to avoid an infinite loop!
+
+# --hints--
+
+Your code should use the `@while` directive.
+
+```js
+assert(code.match(/@while /g));
+```
+
+Your code should use an index variable which starts at an index of 1.
+
+```js
+assert(code.match(/\$.*:\s*?1;/gi));
+```
+
+Your code should increment the counter variable.
+
+```js
+assert(code.match(/\$(.*)\s*?:\s*\$\1\s*\+\s*1\s*;/gi));
+```
+
+Your `.text-1` class should have a `font-size` of `15px`.
+
+```js
+assert($('.text-1').css('font-size') == '15px');
+```
+
+Your `.text-2` class should have a `font-size` of `30px`.
+
+```js
+assert($('.text-2').css('font-size') == '30px');
+```
+
+Your `.text-3` class should have a `font-size` of `45px`.
+
+```js
+assert($('.text-3').css('font-size') == '45px');
+```
+
+Your `.text-4` class should have a `font-size` of `60px`.
+
+```js
+assert($('.text-4').css('font-size') == '60px');
+```
+
+Your `.text-5` class should have a `font-size` of `75px`.
+
+```js
+assert($('.text-5').css('font-size') == '75px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+</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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  $x: 1;
+  @while $x < 6 {
+    .text-#{$x}{
+      font-size: 15px * $x;
+    }
+    $x: $x + 1;
+  }
+</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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/create-reusable-css-with-mixins.md b/curriculum/challenges/italian/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
new file mode 100644
index 0000000000..0d9d13c6f0
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
@@ -0,0 +1,132 @@
+---
+id: 587d7dbd367417b2b2512bb6
+title: Create Reusable CSS with Mixins
+challengeType: 0
+forumTopicId: 301455
+dashedName: create-reusable-css-with-mixins
+---
+
+# --description--
+
+In Sass, a <dfn>mixin</dfn> 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`:
+
+```scss
+div {
+  -webkit-box-shadow: 0px 0px 4px #fff;
+  -moz-box-shadow: 0px 0px 4px #fff;
+  -ms-box-shadow: 0px 0px 4px #fff;
+  box-shadow: 0px 0px 4px #fff;
+}
+```
+
+It's a lot of typing to re-write this rule for all the elements that have a `box-shadow`, or to change each value to test different effects. Mixins are like functions for CSS. Here is how to write one:
+
+```scss
+@mixin box-shadow($x, $y, $blur, $c){ 
+  -webkit-box-shadow: $x $y $blur $c;
+  -moz-box-shadow: $x $y $blur $c;
+  -ms-box-shadow: $x $y $blur $c;
+  box-shadow: $x $y $blur $c;
+}
+```
+
+The definition starts with `@mixin` followed by a custom name. The parameters (the `$x`, `$y`, `$blur`, and `$c` in the example above) are optional. Now any time a `box-shadow` rule is needed, only a single line calling the mixin replaces having to type all the vendor prefixes. A mixin is called with the `@include` directive:
+
+```scss
+div {
+  @include box-shadow(0px, 0px, 4px, #fff);
+}
+```
+
+# --instructions--
+
+Write a mixin for `border-radius` and give it a `$radius` parameter. It should use all the vendor prefixes from the example. Then use the `border-radius` mixin to give the `#awesome` element a border radius of `15px`.
+
+# --hints--
+
+Your code should declare a mixin named `border-radius` which has a parameter named `$radius`.
+
+```js
+assert(code.match(/@mixin\s+?border-radius\s*?\(\s*?\$radius\s*?\)\s*?{/gi));
+```
+
+Your code should include the `-webkit-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/-webkit-border-radius:\$radius;/gi)
+);
+```
+
+Your code should include the `-moz-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/-moz-border-radius:\$radius;/gi)
+);
+```
+
+Your code should include the `-ms-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/-ms-border-radius:\$radius;/gi));
+```
+
+Your code should include the general `border-radius` rule that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/border-radius:\$radius;/gi).length ==
+    4
+);
+```
+
+Your code should call the `border-radius mixin` using the `@include` keyword, setting it to `15px`.
+
+```js
+assert(code.match(/@include\s+?border-radius\(\s*?15px\s*?\)\s*;/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  #awesome {
+    width: 150px;
+    height: 150px;
+    background-color: green;
+
+  }
+</style>
+
+<div id="awesome"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  @mixin border-radius($radius) {
+    -webkit-border-radius: $radius;
+    -moz-border-radius: $radius;
+    -ms-border-radius: $radius;
+    border-radius: $radius;
+  }
+
+  #awesome {
+    width: 150px;
+    height: 150px;
+    background-color: green;
+    @include border-radius(15px);
+  }
+</style>
+
+<div id="awesome"></div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md b/curriculum/challenges/italian/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
new file mode 100644
index 0000000000..c5723d66d1
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
@@ -0,0 +1,116 @@
+---
+id: 587d7fa5367417b2b2512bbd
+title: Extend One Set of CSS Styles to Another Element
+challengeType: 0
+forumTopicId: 301456
+dashedName: extend-one-set-of-css-styles-to-another-element
+---
+
+# --description--
+
+Sass has a feature called `extend` 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 `.panel` class. It has a `background-color`, `height` and `border`.
+
+```scss
+.panel{
+  background-color: red;
+  height: 70px;
+  border: 2px solid green;
+}
+```
+
+Now you want another panel called `.big-panel`. It has the same base properties as `.panel`, but also needs a `width` and `font-size`. It's possible to copy and paste the initial CSS rules from `.panel`, but the code becomes repetitive as you add more types of panels. The `extend` directive is a simple way to reuse the rules written for one element, then add more for another:
+
+```scss
+.big-panel{
+  @extend .panel;
+  width: 150px;
+  font-size: 2em;
+}
+```
+
+The `.big-panel` will have the same properties as `.panel` in addition to the new styles.
+
+# --instructions--
+
+Make a class `.info-important` that extends `.info` and also has a `background-color` set to magenta.
+
+# --hints--
+
+Your `info-important` class should have a `background-color` set to `magenta`.
+
+```js
+assert(
+  code.match(
+    /\.info-important\s*?{[\s\S]*background-color\s*?:\s*?magenta\s*?;[\s\S]*}/gi
+  )
+);
+```
+
+Your `info-important` class should use `@extend` to inherit the styling from the `info` class.
+
+```js
+assert(
+  code.match(/\.info-important\s*?{[\s\S]*@extend\s*?.info\s*?;[\s\S]*/gi)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+  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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  h3{
+    text-align: center;
+  }
+  .info{
+    width: 200px;
+    border: 1px solid black;
+    margin: 0 auto;
+  }
+  .info-important{
+    @extend .info;
+    background-color: magenta;
+  }
+
+
+
+</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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/nest-css-with-sass.md b/curriculum/challenges/italian/03-front-end-libraries/sass/nest-css-with-sass.md
new file mode 100644
index 0000000000..1e7b8493c6
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/nest-css-with-sass.md
@@ -0,0 +1,105 @@
+---
+id: 587d7dbd367417b2b2512bb5
+title: Nest CSS with Sass
+challengeType: 0
+forumTopicId: 301457
+dashedName: nest-css-with-sass
+---
+
+# --description--
+
+Sass allows nesting 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:
+
+```scss
+nav {
+  background-color: red;
+}
+
+nav ul {
+  list-style: none;
+}
+
+nav ul li {
+  display: inline-block;
+}
+```
+
+For a large project, the CSS file will have many lines and rules. This is where nesting can help organize your code by placing child style rules within the respective parent elements:
+
+```scss
+nav {
+  background-color: red;
+
+  ul {
+    list-style: none;
+
+    li {
+      display: inline-block;
+    }
+  }
+}
+
+```
+
+# --instructions--
+
+Use the nesting technique shown above to re-organize the CSS rules for both children of `.blog-post` element. For testing purposes, the `h1` should come before the `p` element.
+
+# --hints--
+
+Your code should re-organize the CSS rules so the `h1` and `p` are nested in the `.blog-post` parent element.
+
+```js
+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
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+  .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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  .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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md b/curriculum/challenges/italian/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
new file mode 100644
index 0000000000..9262041c3a
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
@@ -0,0 +1,47 @@
+---
+id: 587d7dbf367417b2b2512bbc
+title: Split Your Styles into Smaller Chunks with Partials
+challengeType: 0
+forumTopicId: 301459
+dashedName: split-your-styles-into-smaller-chunks-with-partials
+---
+
+# --description--
+
+<dfn>Partials</dfn> 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 partials start with the underscore (`_`) 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 `.scss` file extension. To bring the code in the partial into another Sass file, use the `@import` directive.
+
+For example, if all your mixins are saved in a partial named "\_mixins.scss", and they are needed in the "main.scss" file, this is how to use them in the main file:
+
+```scss
+@import 'mixins'
+```
+
+Note that the underscore and file extension are not needed in the `import` statement - Sass understands it is a partial. Once a partial is imported into a file, all variables, mixins, and other code are available to use.
+
+# --instructions--
+
+Write an `@import` statement to import a partial named `_variables.scss` into the main.scss file.
+
+# --hints--
+
+Your code should use the `@import` directive, and should not include the underscore in the file name.
+
+```js
+assert(code.match(/@import\s+?('|")variables\1/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!-- The main.scss file -->
+```
+
+# --solutions--
+
+```html
+@import 'variables'
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/store-data-with-sass-variables.md b/curriculum/challenges/italian/03-front-end-libraries/sass/store-data-with-sass-variables.md
new file mode 100644
index 0000000000..b106a6fb84
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/store-data-with-sass-variables.md
@@ -0,0 +1,121 @@
+---
+id: 587d7dbd367417b2b2512bb4
+title: Store Data with Sass Variables
+challengeType: 0
+forumTopicId: 301460
+dashedName: store-data-with-sass-variables
+---
+
+# --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 `let` and `const` keywords. In Sass, variables start with a `$` followed by the variable name.
+
+Here are a couple examples:
+
+```scss
+$main-fonts: Arial, sans-serif;
+$headings-color: green;
+```
+
+And to use the variables:
+
+```scss
+h1 {
+  font-family: $main-fonts;
+  color: $headings-color;
+}
+```
+
+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.
+
+# --instructions--
+
+Create a variable `$text-color` and set it to `red`. Then change the value of the `color` property for the `.blog-post` and `h2` to the `$text-color` variable.
+
+# --hints--
+
+Your code should have a Sass variable declared for `$text-color` with a value of `red`.
+
+```js
+assert(code.match(/\$text-color\s*:\s*?red\s*;/g));
+```
+
+Your code should use the `$text-color` variable to change the `color` for the `.blog-post` and `h2` items.
+
+```js
+assert(code.match(/color\s*:\s*\$text-color\s*;?/g));
+```
+
+Your `.blog-post` element should have a `color` of red.
+
+```js
+assert($('.blog-post').css('color') == 'rgb(255, 0, 0)');
+```
+
+Your `h2` elements should have a `color` of red.
+
+```js
+assert($('h2').css('color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+  .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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  $text-color: red;
+
+  .header{
+    text-align: center;
+  }
+  .blog-post, h2 {
+    color: $text-color;
+  }
+</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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md b/curriculum/challenges/italian/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
new file mode 100644
index 0000000000..bfdc68db55
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
@@ -0,0 +1,135 @@
+---
+id: 587d7dbf367417b2b2512bba
+title: Use @each to Map Over Items in a List
+challengeType: 0
+forumTopicId: 301461
+dashedName: use-each-to-map-over-items-in-a-list
+---
+
+# --description--
+
+The last challenge showed how the `@for` directive uses a starting and ending value to loop a certain number of times. Sass also offers the `@each` 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.
+
+```scss
+@each $color in blue, red, green {
+  .#{$color}-text {color: $color;}
+}
+```
+
+A map has slightly different syntax. Here's an example:
+
+```scss
+$colors: (color1: blue, color2: red, color3: green);
+
+@each $key, $color in $colors {
+  .#{$color}-text {color: $color;}
+}
+```
+
+Note that the `$key` variable is needed to reference the keys in the map. Otherwise, the compiled CSS would have `color1`, `color2`... in it. Both of the above code examples are converted into the following CSS:
+
+```scss
+.blue-text {
+  color: blue;
+}
+
+.red-text {
+  color: red;
+}
+
+.green-text {
+  color: green;
+}
+```
+
+# --instructions--
+
+Write an `@each` directive that goes through a list: `blue, black, red` and assigns each variable to a `.color-bg` class, where the `color` part changes for each item. Each class should set the `background-color` the respective color.
+
+# --hints--
+
+Your code should use the `@each` directive.
+
+```js
+assert(code.match(/@each /g));
+```
+
+Your `.blue-bg` class should have a `background-color` of blue.
+
+```js
+assert($('.blue-bg').css('background-color') == 'rgb(0, 0, 255)');
+```
+
+Your `.black-bg` class should have a `background-color` of black.
+
+```js
+assert($('.black-bg').css('background-color') == 'rgb(0, 0, 0)');
+```
+
+Your `.red-bg` class should have a `background-color` of red.
+
+```js
+assert($('.red-bg').css('background-color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+
+  @each $color in blue, black, red {
+    .#{$color}-bg {background-color: $color;}
+  }
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
+
+---
+
+```html
+<style type='text/scss'>
+
+  $colors: (color1: blue, color2: black, color3: red);
+
+  @each $key, $color in $colors {
+    .#{$color}-bg {background-color: $color;}
+  }
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md b/curriculum/challenges/italian/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
new file mode 100644
index 0000000000..f2d8bd73b8
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
@@ -0,0 +1,139 @@
+---
+id: 587d7dbe367417b2b2512bb9
+title: Use @for to Create a Sass Loop
+challengeType: 0
+forumTopicId: 301462
+dashedName: use-for-to-create-a-sass-loop
+---
+
+# --description--
+
+The `@for` directive adds styles in a loop, very similar to a `for` loop in JavaScript.
+
+`@for` is used in two ways: "start through end" or "start to end". The main difference is that the "start **to** end" *excludes* the end number as part of the count, and "start **through** end" *includes* the end number as part of the count.
+
+Here's a start **through** end example:
+
+```scss
+@for $i from 1 through 12 {
+  .col-#{$i} { width: 100%/12 * $i; }
+}
+```
+
+The `#{$i}` part is the syntax to combine a variable (`i`) with text to make a string. When the Sass file is converted to CSS, it looks like this:
+
+```scss
+.col-1 {
+  width: 8.33333%;
+}
+
+.col-2 {
+  width: 16.66667%;
+}
+
+...
+
+.col-12 {
+  width: 100%;
+}
+```
+
+This is a powerful way to create a grid layout. Now you have twelve options for column widths available as CSS classes.
+
+# --instructions--
+
+Write a `@for` directive that takes a variable `$j` that goes from 1 **to** 6.
+
+It should create 5 classes called `.text-1` to `.text-5` where each has a `font-size` set to 15px multiplied by the index.
+
+# --hints--
+
+Your code should use the `@for` directive.
+
+```js
+assert(code.match(/@for /g));
+```
+
+Your `.text-1` class should have a `font-size` of 15px.
+
+```js
+assert($('.text-1').css('font-size') == '15px');
+```
+
+Your `.text-2` class should have a `font-size` of 30px.
+
+```js
+assert($('.text-2').css('font-size') == '30px');
+```
+
+Your `.text-3` class should have a `font-size` of 45px.
+
+```js
+assert($('.text-3').css('font-size') == '45px');
+```
+
+Your `.text-4` class should have a `font-size` of 60px.
+
+```js
+assert($('.text-4').css('font-size') == '60px');
+```
+
+Your `.text-5` class should have a `font-size` of 75px.
+
+```js
+assert($('.text-5').css('font-size') == '75px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+</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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+
+@for $i from 1 through 5 {
+  .text-#{$i} { font-size: 15px * $i; }
+}
+
+</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>
+```
+
+---
+
+```html
+<style type='text/scss'>
+
+@for $i from 1 to 6 {
+  .text-#{$i} { font-size: 15px * $i; }
+}
+
+</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>
+```
diff --git a/curriculum/challenges/italian/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md b/curriculum/challenges/italian/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
new file mode 100644
index 0000000000..e13d113b23
--- /dev/null
+++ b/curriculum/challenges/italian/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
@@ -0,0 +1,145 @@
+---
+id: 587d7dbe367417b2b2512bb8
+title: Use @if and @else to Add Logic To Your Styles
+challengeType: 0
+forumTopicId: 301463
+dashedName: use-if-and-else-to-add-logic-to-your-styles
+---
+
+# --description--
+
+The `@if` directive in Sass is useful to test for a specific case - it works just like the `if` statement in JavaScript.
+
+```scss
+@mixin make-bold($bool) {
+  @if $bool == true {
+    font-weight: bold;
+  }
+}
+```
+
+And just like in JavaScript, `@else if` and `@else` test for more conditions:
+
+```scss
+@mixin text-effect($val) {
+  @if $val == danger {
+    color: red;
+  }
+  @else if $val == alert {
+    color: yellow;
+  }
+  @else if $val == success {
+    color: green;
+  }
+  @else {
+    color: black;
+  }
+}
+```
+
+# --instructions--
+
+Create a mixin called `border-stroke` that takes a parameter `$val`. The mixin should check for the following conditions using `@if`, `@else if`, and `@else`:
+
+```scss
+light - 1px solid black
+medium - 3px solid black
+heavy - 6px solid black
+```
+
+If `$val` is not `light`, `medium`, or `heavy`, the border should be set to `none`.
+
+# --hints--
+
+Your code should declare a mixin named `border-stroke` which has a parameter named `$val`.
+
+```js
+assert(code.match(/@mixin\s+?border-stroke\s*?\(\s*?\$val\s*?\)\s*?{/gi));
+```
+
+Your mixin should have an `@if` statement to check if `$val` is `light`, and to set the `border` to `1px solid black`.
+
+```js
+assert(
+  code.match(
+    /@if\s+?\$val\s*?===?\s*?light\s*?{\s*?border\s*?:\s*?1px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else if` statement to check if `$val` is `medium`, and to set the `border` to `3px solid black`.
+
+```js
+assert(
+  code.match(
+    /@else\s+?if\s+?\$val\s*?===?\s*?medium\s*?{\s*?border\s*?:\s*?3px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else if` statement to check if `$val` is `heavy`, and to set the `border` to `6px solid black`.
+
+```js
+assert(
+  code.match(
+    /@else\s+?if\s+?\$val\s*?===?\s*?heavy\s*?{\s*?border\s*?:\s*?6px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else` statement to set the `border` to `none`.
+
+```js
+assert(code.match(/@else\s*?{\s*?border\s*?:\s*?none\s*?;\s*?}/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  #box {
+    width: 150px;
+    height: 150px;
+    background-color: red;
+    @include border-stroke(medium);
+  }
+</style>
+
+<div id="box"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  @mixin border-stroke($val) {
+    @if $val == light {
+      border: 1px solid black;
+    }
+    @else if $val == medium {
+      border: 3px solid black;
+    }
+    @else if $val == heavy {
+      border: 6px solid black;
+    }
+    @else {
+      border: none;
+    }
+  }
+
+
+  #box {
+    width: 150px;
+    height: 150px;
+    background-color: red;
+    @include border-stroke(medium);
+  }
+</style>
+
+<div id="box"></div>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-001.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-001.md
new file mode 100644
index 0000000000..63cbcbf8a5
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-001.md
@@ -0,0 +1,33 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9de
+title: Part 1
+challengeType: 0
+dashedName: part-1
+---
+
+# --description--
+
+Welcome to the dashboard project! You will be using the JavaScript data visualization library, D3, to build a visualization of your social media followers. It will consist of a line graph, a pie chart, and a legend.
+
+First, you need to create the HTML file. Start by adding the `<!DOCTYPE html>` declaration at the top of the file to tell the browser what type of document it's reading.
+
+# --hints--
+
+test-text
+
+```js
+assert(/<!DOCTYPE\s+html\s*>/gi.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-002.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-002.md
new file mode 100644
index 0000000000..8217f0cb0b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-002.md
@@ -0,0 +1,43 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9df
+title: Part 2
+challengeType: 0
+dashedName: part-2
+---
+
+# --description--
+
+Next, add opening and closing `html`, `head` and `body` tags below the doctype. Be sure to nest them properly.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /<!DOCTYPE\s+html\s*>\s*<html\s*>\s*<head\s*>\s*<\/head\s*>\s*<body\s*>\s*<\/body\s*>\s*<\/html\s*>/gi.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-003.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-003.md
new file mode 100644
index 0000000000..17dd77aaba
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-003.md
@@ -0,0 +1,51 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e0
+title: Part 3
+challengeType: 0
+dashedName: part-3
+---
+
+# --description--
+
+In the head, add a `title` of `D3 Dashboard`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /<head\s*>\s*<title\s*>D3 Dashboard<\/title\s*>\s*<\/head\s*>/g.test(code)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+
+  
+  </head>
+
+  <body>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-004.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-004.md
new file mode 100644
index 0000000000..c4df481a13
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-004.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e1
+title: Part 4
+challengeType: 0
+dashedName: part-4
+---
+
+# --description--
+
+Below the title, link to your external stylesheet by adding a `link` element with a `rel` attribute of `stylesheet` and an `href` attribute of `./dashboard.css`. Remember that link elements do not need a closing tag. You will be adding some styles to this file shortly.
+
+# --hints--
+
+test-text
+
+```js
+const link = code.match(/<link\s+[\s\S]+?[^>]>/gi)[0];
+assert(
+  /rel\s*=\s*('|")\s*stylesheet\s*\1/gi.test(link) &&
+    /href\s*=\s*('|")\s*(.\/)?dashboard\.css\s*\1/gi.test(link)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+
+    
+  </head>
+
+  <body>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-005.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-005.md
new file mode 100644
index 0000000000..cb9d694707
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-005.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e2
+title: Part 5
+challengeType: 0
+dashedName: part-5
+---
+
+# --description--
+
+Next, add a container for the dashboard. Put an empty `div` element in the body with class of `dashboard`. You will be appending all the dashboard elements to this div.
+
+# --hints--
+
+test-text
+
+```js
+assert($('div.dashboard').length === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+  </head>
+
+  <body>
+
+  
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+
+    
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-006.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-006.md
new file mode 100644
index 0000000000..a3528d92d1
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-006.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e3
+title: Part 6
+challengeType: 0
+dashedName: part-6
+---
+
+# --description--
+
+You are now looking at the stylesheet that you linked to earlier. At the top of this file, target the `body` of the HTML document and give it a `background-color` of `#ccc`.
+
+# --hints--
+
+test-text
+
+```js
+const body = code.match(/body\s*{[\s\S]+?[^}]}/g)[0];
+assert(/background-color\s*:\s*#ccc\s*(;|})/gi.test(body));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+
+
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-007.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-007.md
new file mode 100644
index 0000000000..2268fc1bd6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-007.md
@@ -0,0 +1,66 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e4
+title: Part 7
+challengeType: 0
+dashedName: part-7
+---
+
+# --description--
+
+Next, target the `dashboard` class you created and give it a `width` of `980px` and a `height` of `500px`.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('width') === '980px' && dashboard.css('height') === '500px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+
+
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;  
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-008.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-008.md
new file mode 100644
index 0000000000..6b8e174e01
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-008.md
@@ -0,0 +1,73 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e5
+title: Part 8
+challengeType: 0
+dashedName: part-8
+---
+
+# --description--
+
+Give the dashboard a `background-color` of `white` and a `box-shadow` of `5px 5px 5px 5px #888` to give it a little depth.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('background-color') === 'rgb(255, 255, 255)' &&
+    dashboard.css('box-shadow') === 'rgb(136, 136, 136) 5px 5px 5px 5px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+
+  
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-009.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-009.md
new file mode 100644
index 0000000000..210943e452
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-009.md
@@ -0,0 +1,73 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e6
+title: Part 9
+challengeType: 0
+dashedName: part-9
+---
+
+# --description--
+
+Now you can see your dashboard element. Center it by adding a `margin` of `auto` to it.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = code.match(/.dashboard\s*{[\s\S]+?[^}]}/g)[0];
+assert(/margin\s*:\s*auto\s*(;|})/g.test(dashboard));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+
+
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-010.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-010.md
new file mode 100644
index 0000000000..2144211195
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-010.md
@@ -0,0 +1,75 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e7
+title: Part 10
+challengeType: 0
+dashedName: part-10
+---
+
+# --description--
+
+Give the container some space by adding a `padding` of `100px 10px` to the `body` element.
+
+# --hints--
+
+test-text
+
+```js
+const body = code.match(/body\s*{[\s\S]+?[^}]}/g)[0];
+assert(/padding\s*:\s*100px\s*10px\s*(;|})/g.test(body));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+
+  
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-011.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-011.md
new file mode 100644
index 0000000000..511106ee13
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-011.md
@@ -0,0 +1,81 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e8
+title: Part 11
+challengeType: 0
+dashedName: part-11
+---
+
+# --description--
+
+Later on, you will be adding more elements to the dashboard container. Set the `display` to `flex` and the `align-items` to `center` so those items will be vertically centered.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('display') === 'flex' &&
+    dashboard.css('align-items') === 'center'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+
+  
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+  display: flex;
+  align-items: center;  
+}
+</style>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-012.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-012.md
new file mode 100644
index 0000000000..18c1bd58cf
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-012.md
@@ -0,0 +1,79 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e9
+title: Part 12
+challengeType: 0
+dashedName: part-12
+---
+
+# --description--
+
+Back in the HTML file, add a `script` tag at the bottom of the head element and give it a `src` attribute of `./d3-5.9.2.min.js`. Don't forget the closing tag. This will add the D3 library to your project from a downloaded copy.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[0];
+assert(/src\s*=\s*('|")\s*(\.\/)?d3-5.9.2.min.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+
+    
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+
+    
+ </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-013.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-013.md
new file mode 100644
index 0000000000..d37a6a0bd4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-013.md
@@ -0,0 +1,96 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ea
+title: Part 13
+challengeType: 0
+dashedName: part-13
+---
+
+# --description--
+
+Add another `script` below the one you just added. Give it a `src` attribute of `./data.js`.
+
+This adds a `data` variable to your project that contains your number of social media followers, it is an array of objects. Each object has the year and your followers for three different platforms. You will see what it looks like shortly.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[1];
+assert(/src\s*=\s*('|")\s*(\.\/)?data.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+
+    
+ </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-014.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-014.md
new file mode 100644
index 0000000000..97d9c04dfa
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-014.md
@@ -0,0 +1,95 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9eb
+title: Part 14
+challengeType: 0
+dashedName: part-14
+---
+
+# --description--
+
+Add a third script just before the closing body tag. It will be the JavaScript file you will use to create the rest of the dashboard. Give the script a `src` of `./dashboard.js`.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[2];
+assert(/src\s*=\s*('|")\s*(\.\/)?dashboard.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    <script src="dashboard.js"></script>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-015.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-015.md
new file mode 100644
index 0000000000..fe6efc7f29
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-015.md
@@ -0,0 +1,103 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ec
+title: Part 15
+challengeType: 0
+dashedName: part-15
+---
+
+# --description--
+
+The script at the top is the `data.js` file you added. I have placed it here so you can see the data and recommend taking a look at it. The second script is the one you just added and where you will build the rest of the project.
+
+In the second script, create three `const` variables; `svgMargin` with a value of `70`, `svgWidth` with a value of `700`, and `svgHeight` equal to `500`. The first part of the dashboard will be a line graph. It will use these variables as its dimensions.
+
+The line graph will have the years from your data variable across the bottom, and a scale on the left to show the numbers of followers. Each platform will have a line going across the graph that shows how many followers you had for each year.
+
+# --hints--
+
+test-text
+
+```js
+assert(svgMargin === 70 && svgWidth === 700 && svgHeight === 500);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500;
+  
+
+</script>  
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-016.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-016.md
new file mode 100644
index 0000000000..6926b11aee
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-016.md
@@ -0,0 +1,108 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ed
+title: Part 16
+challengeType: 0
+dashedName: part-16
+---
+
+# --description--
+
+Add three more variables; `twitterColor` with a value of `#7cd9d1`, `tumblrColor` equal to `#f6dd71`, and `instagramColor` at `#fd9b98`. Make sure those Hex values are strings. These will be colors used to represent the different platforms throughout the project.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  twitterColor === '#7cd9d1' &&
+    tumblrColor === '#f6dd71' &&
+    instagramColor === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500;
+  
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-017.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-017.md
new file mode 100644
index 0000000000..82a2efd50c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-017.md
@@ -0,0 +1,113 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ee
+title: Part 17
+challengeType: 0
+dashedName: part-17
+---
+
+# --description--
+
+When you added the D3 library earlier, it put an object named `d3` in your project with a bunch of functions. One of them is `select`; you can use dot notation to access this and the other functions from the object. Create a new variable named `lineGraph` and use `d3.select` to select the `.dashboard` element. Here's an example of something similar:
+
+```js
+const variableName = d3.select('.className')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(lineGraph._groups[0][0] === $('.dashboard')[0]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-018.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-018.md
new file mode 100644
index 0000000000..d358d508c9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-018.md
@@ -0,0 +1,117 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ef
+title: Part 18
+challengeType: 0
+dashedName: part-18
+---
+
+# --description--
+
+Your dashboard element is now "selected". D3 has a number of functions for working with a selection; one of them is `append`. It is used to add an element. Chain the `append` function to your selection and use it to add an `svg` element. Here's an example of how that might be done:
+
+```js
+const variableName = d3.select('selectedElement')
+  .append('elementToAdd')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(lineGraph._groups[0][0] === $('svg')[0]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-019.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-019.md
new file mode 100644
index 0000000000..d55cc0b777
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-019.md
@@ -0,0 +1,124 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f0
+title: Part 19
+challengeType: 0
+dashedName: part-19
+---
+
+# --description--
+
+You can't see it, but there is now an `svg` element nested in your dashboard container. When you appended it, it became the "selection" for this area of code. Any functions you chain after it will be used on this selection.
+
+`attr` is a function to set attributes. You need to pass it the attribute you want to set, and the value you want to give it. Here's an example of how to chain `attr` to a selection:
+
+```js
+const variableName = d3.select('element')
+  .append('element')
+  .attr('attribute', 'value')
+```
+
+Chain an `attr` function to the selection that sets the `width` as the `svgWidth` variable you created earlier. When using a variable as a value, you do not need to put it in any kind of quotations.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].attributes.width.value === '700');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-020.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-020.md
new file mode 100644
index 0000000000..73034422e9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-020.md
@@ -0,0 +1,116 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f1
+title: Part 20
+challengeType: 0
+dashedName: part-20
+---
+
+# --description--
+
+Chain another `attr` function that sets the `height` as the `svgHeight` variable you created.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].attributes.height.value === '500');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-021.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-021.md
new file mode 100644
index 0000000000..ad1b8a3e0a
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-021.md
@@ -0,0 +1,123 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f2
+title: Part 21
+challengeType: 0
+dashedName: part-21
+---
+
+# --description--
+
+Your line graph needs some scales so it knows how to translate the data into visual distances. The first one is the scale for the y-axis. It will be to show the number of followers. D3 has many utilities for creating scales. You want to use it's `scaleLinear` method for this scale.
+
+Create a new `const` named `yScale`, and set it equal to `d3.scaleLinear()`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof yScale === 'function' && /yScale\s*=\s*d3\.scaleLinear/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-022.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-022.md
new file mode 100644
index 0000000000..65b5d9a684
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-022.md
@@ -0,0 +1,123 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f3
+title: Part 22
+challengeType: 0
+dashedName: part-22
+---
+
+# --description--
+
+D3 has a bunch of functions for working with scales as well. One of them is `domain`. It takes an array that is used to describe the highest and lowest values of the data for this scale. After a quick look at the data, the values of the "followers" go from about 0 to 5000. Chain the `domain` function to the `yScale` and pass it the array `[0, 5000]`.
+
+# --hints--
+
+test-text
+
+```js
+const domain = yScale.domain();
+assert(domain.length === 2 && domain[0] === 0 && domain[1] === 5000);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-023.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-023.md
new file mode 100644
index 0000000000..fef2d72f1b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-023.md
@@ -0,0 +1,129 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f4
+title: Part 23
+challengeType: 0
+dashedName: part-23
+---
+
+# --description--
+
+The `range` function describes how to map the domain values for display on the graph. For example, a value of 5000 followers can't use 5000 as it y-coordinate on the SVG or it would be off the graph. You need to tell the range where the top and bottom of the graph is so the scale can give appropriate values for the y-coordinate.
+
+Chain the `range` function below the `domain` and pass it an array with `svgHeight - svgMargin` and `svgMargin` as the values. That will translate to `[430, 70]`. This is where the top and bottom of the graph are. So a data point of 5000 followers will map to a value of 430 to use as its y-coordinate and 0 followers will use 70 as its y-coordinate. Any value in between will scale linearly.
+
+Your graph will have a margin around it for things like axes and labels. The actual line data will display on the inside of this margin area, which is why you use those values. This will become more clear as you progress through the project.
+
+# --hints--
+
+test-text
+
+```js
+const range = yScale.range();
+assert(range.length === 2 && range[0] === 430 && range[1] === 70);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+
+</script>  
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-024.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-024.md
new file mode 100644
index 0000000000..1cbbe6313f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-024.md
@@ -0,0 +1,129 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f5
+title: Part 24
+challengeType: 0
+dashedName: part-24
+---
+
+# --description--
+
+Create a new `const` named `xScale`. Use it to create another linear scale like you did for the y-scale. This will be the horizontal or "x" axis.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof xScale === 'function' && /xScale\s*=\s*d3\.scaleLinear/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-025.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-025.md
new file mode 100644
index 0000000000..3d66e7f8c2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-025.md
@@ -0,0 +1,131 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f6
+title: Part 25
+challengeType: 0
+dashedName: part-25
+---
+
+# --description--
+
+The `year` values of your data will be used for the x-scale. Chain the `domain` function to `xScale` and pass it an array with the first and last years of your data.
+
+# --hints--
+
+test-text
+
+```js
+const domain = xScale.domain();
+assert(domain.length === 2 && domain[0] === 2012 && domain[1] === 2020);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-026.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-026.md
new file mode 100644
index 0000000000..339cb6906b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-026.md
@@ -0,0 +1,133 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f7
+title: Part 26
+challengeType: 0
+dashedName: part-26
+---
+
+# --description--
+
+The range for this scale will go from the left of your graph to the right, with 2012 on the left and 2020 on the right. Add the `range` function to the `xScale` and pass it an array with the values: `svgMargin` and `svgWidth - svgMargin`. This will translate to `[70, 630]`. So 2012 will use 70 as is x-coordinate and 2020 will use 630 as its x-coordinate.
+
+# --hints--
+
+test-text
+
+```js
+const range = xScale.range();
+assert(range.length === 2 && range[0] === 70 && range[1] === 630);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+
+</script>  
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-027.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-027.md
new file mode 100644
index 0000000000..022abdca4b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-027.md
@@ -0,0 +1,138 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f8
+title: Part 27
+challengeType: 0
+dashedName: part-27
+---
+
+# --description--
+
+The two scales you defined will be used to create the axes and lines. First is the y-axis, it will be a line with some labels on the left of the graph. Create a new `const` named `yAxis` and set it equal to `d3.axisLeft(yScale)`. This will use the information from the `yScale` variable to build the axis.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof yAxis === 'function' &&
+    /yAxis\s*=\s*d3\.axisLeft\(\s*yScale\)/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-028.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-028.md
new file mode 100644
index 0000000000..4fbb726a6e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-028.md
@@ -0,0 +1,142 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f9
+title: Part 28
+challengeType: 0
+dashedName: part-28
+---
+
+# --description--
+
+Create a new `const` named `xAxis` and set the value equal to `d3.axisBottom(xScale)`. This will create another axis for the bottom of the graph using the information from `xScale`. Although the axes do not display yet, they have the information they need to display correctly.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof xAxis === 'function' &&
+    /xAxis\s*=\s*d3\.axisBottom\(\s*xScale\)/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-029.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-029.md
new file mode 100644
index 0000000000..cf95b345c5
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-029.md
@@ -0,0 +1,143 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fa
+title: Part 29
+challengeType: 0
+dashedName: part-29
+---
+
+# --description--
+
+On a new line, append a new `g` element to your `lineGraph` variable. `lineGraph.append('g')` will do that for you. This will add a `g` to your SVG and be for displaying the y-axis. `g` is an SVG element that stands for "group".
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].children[0] === $('g')[0] && $('g').length === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-030.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-030.md
new file mode 100644
index 0000000000..2ff020ff1a
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-030.md
@@ -0,0 +1,147 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fb
+title: Part 30
+challengeType: 0
+dashedName: part-30
+---
+
+# --description--
+
+`call` is another function to use with selections. Chain a `call` function to the selection and pass your `yAxis` variable to it. This will draw your y-axis on the SVG.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.tick').length === 11 && /\.call\(\s*yAxis\s*\)/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-031.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-031.md
new file mode 100644
index 0000000000..d5d5ea704c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-031.md
@@ -0,0 +1,151 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fc
+title: Part 31
+challengeType: 0
+dashedName: part-31
+---
+
+# --description--
+
+After all that work, something is finally displayed on the graph. It's the y-axis and all the numbers are hidden on the left.
+
+Move the axis your `svgMargin` to the right by chaining an `attr` function to the selection. Use it to set the `transform` to `translate(${svgMargin}, 0)`. Use a template literal (backticks) to set the value so you can put your variable in there.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g')[0].attributes.transform.nodeValue === 'translate(70, 0)');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-032.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-032.md
new file mode 100644
index 0000000000..75ba3f4f93
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-032.md
@@ -0,0 +1,150 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fd
+title: Part 32
+challengeType: 0
+dashedName: part-32
+---
+
+# --description--
+
+`style` is a function similar to `attr`, but is more for manipulating CSS styles rather than element attributes. Add a `style` function to the selection that sets the `font` to `10px verdana`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g')[0].attributes.style.nodeValue === 'font: 10px verdana;');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-033.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-033.md
new file mode 100644
index 0000000000..acb146f6fd
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-033.md
@@ -0,0 +1,153 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fe
+title: Part 33
+challengeType: 0
+dashedName: part-33
+---
+
+# --description--
+
+On a new line, append another `g` element to your `lineGraph` variable like you did before. This one will be for the x-axis.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g').length === 13);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-034.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-034.md
new file mode 100644
index 0000000000..16484edb39
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-034.md
@@ -0,0 +1,156 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ff
+title: Part 34
+challengeType: 0
+dashedName: part-34
+---
+
+# --description--
+
+Use the `call` function to draw the x-axis onto the SVG like you did for the y-axis.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g').length === 22);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+    
+  lineGraph.append('g')
+    .call(xAxis)
+
+  
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-035.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-035.md
new file mode 100644
index 0000000000..9bf085e53a
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-035.md
@@ -0,0 +1,158 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca00
+title: Part 35
+challengeType: 0
+dashedName: part-35
+---
+
+# --description--
+
+The axis has the right size and labels, but needs to be moved down. Use the `attr` function to set the `transform` like you did before. This time move it down your `svgHeight` minus the `svgMargin`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg > g')[1].attributes.transform.nodeValue === 'translate(0, 430)');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+    
+  lineGraph.append('g')
+    .call(xAxis)
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-036.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-036.md
new file mode 100644
index 0000000000..195a51db40
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-036.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca01
+title: Part 36
+challengeType: 0
+dashedName: part-36
+---
+
+# --description--
+
+The axis labels are `text` elements within the `g`, you can use the `selectAll` function to select them. Chain the `selectAll` function to select the `text` elements in this group. You can do that like this:
+
+```js
+.selectAll('element')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.attr\('transform', `translate\(0, \$\{svgHeight - svgMargin\}\)`\)\s*\.selectAll\s*\(\s*('|"|`)text\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-037.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-037.md
new file mode 100644
index 0000000000..0b758f6fc0
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-037.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca02
+title: Part 37
+challengeType: 0
+dashedName: part-37
+---
+
+# --description--
+
+I want the text elements to be rotated slightly. Chain the `style` function to set the `transform` to `translate(-12px, 0) rotate(-50deg)`. This will put them at an angle.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) =>
+      index.style.transform === 'translate(-12px) rotate(-50deg)' ||
+      index.style.transform === 'translate(-12px, 0px) rotate(-50deg)'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+
+  
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-038.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-038.md
new file mode 100644
index 0000000000..5322ee5fe7
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-038.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca03
+title: Part 38
+challengeType: 0
+dashedName: part-38
+---
+
+# --description--
+
+Add another `style` function to set the `text-anchor` to `end`. This will change the spot that each text element rotates around to the `end` of the element so they will align better.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) => index.style['text-anchor'] === 'end'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+
+  
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-039.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-039.md
new file mode 100644
index 0000000000..93a1681382
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-039.md
@@ -0,0 +1,173 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca04
+title: Part 39
+challengeType: 0
+dashedName: part-39
+---
+
+# --description--
+
+Add two more `style` functions; one to set the `cursor` to `pointer`, and another to set the `font` to `10px verdana`.
+
+You will add some hover effects later, so the pointer will make for a better experience.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) =>
+      index.style.cursor === 'pointer' && index.style.font === '10px verdana'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-040.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-040.md
new file mode 100644
index 0000000000..ff7ddccaef
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-040.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca05
+title: Part 40
+challengeType: 0
+dashedName: part-40
+---
+
+# --description--
+
+There are a number of D3 functions to work with how the "ticks" or your axis labels are displayed; one of them is `ticks`. Go back to where you defined the `yAxis` variable and chain a `ticks` function to it and pass it these two arguments: `6, '~s'`.
+
+The `6` will set the number of ticks used to 6, and the `~s` will make the labels display the number of thousands followed by a `k`. For example, `4000` will become `4k`.
+
+# --hints--
+
+test-text
+
+```js
+const ticks = $('.tick > text');
+assert(
+  ticks[0].innerHTML === '0k' &&
+    ticks[1].innerHTML === '1k' &&
+    ticks[2].innerHTML === '2k' &&
+    ticks[3].innerHTML === '3k' &&
+    ticks[4].innerHTML === '4k' &&
+    ticks[5].innerHTML === '5k'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-041.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-041.md
new file mode 100644
index 0000000000..a0d2f25c86
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-041.md
@@ -0,0 +1,171 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca06
+title: Part 41
+challengeType: 0
+dashedName: part-41
+---
+
+# --description--
+
+Go back to where you defined your `xAis` variable and chain the `tickFormat` function to it. Pass it `d3.format('')`. This will remove the commas in the year labels of the x-axis.
+
+# --hints--
+
+test-text
+
+```js
+const ticks = $('.tick > text');
+assert(ticks[6].innerHTML === '2012' && ticks[14].innerHTML === '2020');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-042.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-042.md
new file mode 100644
index 0000000000..0c55ad53c2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-042.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca07
+title: Part 42
+challengeType: 0
+dashedName: part-42
+---
+
+# --description--
+
+In the same spot, chain the `tickPadding` function to the `xAxis` and pass it `10`. This will add a little padding to the ticks so the labels are better aligned.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.tickFormat\(d3\.format\((''\)\)\s*\.tickPadding\s*\(\s*10\s*\))/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-043.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-043.md
new file mode 100644
index 0000000000..383f6dd20f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-043.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca08
+title: Part 43
+challengeType: 0
+dashedName: part-43
+---
+
+# --description--
+
+The axes and labels are looking good. Next, you will start to add some of the lines for the data. First is the line for the Twitter data. On a new line, create a new `const` named `twitterLine` and set it equal to `d3.line()`. `line` is a D3 function for creating a line.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*twitterLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-044.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-044.md
new file mode 100644
index 0000000000..d72f1948ae
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-044.md
@@ -0,0 +1,192 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca09
+title: Part 44
+challengeType: 0
+dashedName: part-44
+---
+
+# --description--
+
+The line needs x and y values for each point of data. Chain `x` to the line and pass it a "d function". Here's how that will look:
+
+```js
+.x(d => d.year)
+```
+
+You will be passing your `data` array to this line function, where it will go through each item in the array(`d`) and create an x value based on the year(`d.year`).
+
+This is the first place you have seen a "d function". These are common in D3 and that is how I will refer to them throughout this project.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const twitterLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*d\.year\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => d.year)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-045.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-045.md
new file mode 100644
index 0000000000..260d37d795
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-045.md
@@ -0,0 +1,183 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0a
+title: Part 45
+challengeType: 0
+dashedName: part-45
+---
+
+# --description--
+
+Instead of simply using the year(`d.year`) for the x-coordinate, you need to pass each year to the `xScale` so it can set the appropriate coordinate based on your scale.
+
+In the "d function" you created, return `xScale(d.year)` instead of `d.year`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.x\s*\(d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => d.year)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-046.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-046.md
new file mode 100644
index 0000000000..89137d7597
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-046.md
@@ -0,0 +1,189 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0b
+title: Part 46
+challengeType: 0
+dashedName: part-46
+---
+
+# --description--
+
+Chain the `y` function to the line and pass it a "d function" that returns your `yScale` with `d.followers.twitter` as its argument.
+
+This is similar to how you set the x values. It will use the values of your Twitter followers and your `yScale` to set the y coordinate for each item.
+
+These "d functions" use implicit returns. But if you add curly brackets and a return statement, you can put any JavaScript in there that you want. Including `console.log` statements that can be useful for debugging.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.twitter\s*\)\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+
+    
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-047.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-047.md
new file mode 100644
index 0000000000..07e8df9e86
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-047.md
@@ -0,0 +1,189 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0c
+title: Part 47
+challengeType: 0
+dashedName: part-47
+---
+
+# --description--
+
+The first line is created and ready to be displayed, which will take a couple steps. On a new line, `append` a `path` element to your `lineGraph` variable. This is similar to how you appended the `g` before.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 3 &&
+    /lineGraph\.append\((`|'|")path\1\)/gi.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+
+    
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-048.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-048.md
new file mode 100644
index 0000000000..ec0cb07a7c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-048.md
@@ -0,0 +1,193 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0d
+title: Part 48
+challengeType: 0
+dashedName: part-48
+---
+
+# --description--
+
+Tell the path what data to use. Add an `attr` function and set the `d` to `twitterLine(data)`. This will the build the path using the `twitterLine` function you created and your data variable.
+
+Note that the `d` in this case is a path attribute for drawing a line and is different from a "d function".
+
+After you have added your code, take a look at the data flow to help understand what is happening. You pass the data array to your `twitterLine` function where it sets the x and y values using your "d functions". The "d functions" go through each item in the array, passing part of the item to each scale to find the appropriate coordinates. When it's done, the value you are setting here is created and sent back. The result ends up being a confusing string of numbers and coordinates to tell the path how to be drawn.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[2].getAttribute('d').length === 151);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-049.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-049.md
new file mode 100644
index 0000000000..780407ba26
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-049.md
@@ -0,0 +1,199 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0e
+title: Part 49
+challengeType: 0
+dashedName: part-49
+---
+
+# --description--
+
+Add three more `attr` functions to the path; one to set the `stroke` to your `twitterColor` variable, another to set the `stroke-width` to `3`, and a third to set the `fill` to `transparent`.
+
+# --hints--
+
+test-text
+
+```js
+const twitterPath = $('svg path')[2];
+assert(
+  twitterPath.getAttribute('stroke') === '#7cd9d1' &&
+    twitterPath.getAttribute('stroke-width') == '3' &&
+    twitterPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-050.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-050.md
new file mode 100644
index 0000000000..48465e56c8
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-050.md
@@ -0,0 +1,198 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0f
+title: Part 50
+challengeType: 0
+dashedName: part-50
+---
+
+# --description--
+
+On a new line, create a new `const` named `tumblrLine` and set it equal to `d3.line()`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*tumblrLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-051.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-051.md
new file mode 100644
index 0000000000..f648e20fdc
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-051.md
@@ -0,0 +1,204 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca10
+title: Part 51
+challengeType: 0
+dashedName: part-51
+---
+
+# --description--
+
+Set the `x` values for `tumblrLine` using another "d function". Use your `xScale` and the `d.year` to calculcate their values just like you did for the Twitter line.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const tumblrLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-052.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-052.md
new file mode 100644
index 0000000000..10547d63c1
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-052.md
@@ -0,0 +1,207 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca11
+title: Part 52
+challengeType: 0
+dashedName: part-52
+---
+
+# --description--
+
+Set the `y` values for `tumblrLine` using a "d function" again. Use your `yScale` and `d.followers.tumblr` to calculcate their values just like you did for the Twitter line.
+
+The x values for each line will be the same, but the y values will use the data from the different platforms.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.tumblr\s*\)\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-053.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-053.md
new file mode 100644
index 0000000000..88f5b9b4ce
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-053.md
@@ -0,0 +1,209 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca12
+title: Part 53
+challengeType: 0
+dashedName: part-53
+---
+
+# --description--
+
+On a new line, `append` a `path` element to the `lineGraph` variable. This one will be for displaying the `tumblrLine`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 4 &&
+    code.match(/lineGraph\.append\((`|'|")path\1\)/gi).length === 2
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-054.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-054.md
new file mode 100644
index 0000000000..5e0ecb4239
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-054.md
@@ -0,0 +1,209 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca13
+title: Part 54
+challengeType: 0
+dashedName: part-54
+---
+
+# --description--
+
+Tell the new path how to be drawn by setting the `d` attribute to `tumblrLine(data)` using the `attr` function.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[3].getAttribute('d').length === 115);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-055.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-055.md
new file mode 100644
index 0000000000..69e492e771
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-055.md
@@ -0,0 +1,218 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca14
+title: Part 55
+challengeType: 0
+dashedName: part-55
+---
+
+# --description--
+
+Add three `attr` functions to the selection; one to set the `stroke` to your `tumblrColor` variable, another to set the `stroke-width` to `3`, and a third to set the `fill` to `transparent`.
+
+# --hints--
+
+test-text
+
+```js
+const tumblrPath = $('svg path')[3];
+assert(
+  tumblrPath.getAttribute('stroke') === '#f6dd71' &&
+    tumblrPath.getAttribute('stroke-width') == '3' &&
+    tumblrPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-056.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-056.md
new file mode 100644
index 0000000000..49da077e90
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-056.md
@@ -0,0 +1,218 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca15
+title: Part 56
+challengeType: 0
+dashedName: part-56
+---
+
+# --description--
+
+Two lines down, only one more to add for the Instagram followers. On a new line, create a new `const` named `instagramLine` and use the D3 `line` function to create another line like you did for the other two.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*instagramLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-057.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-057.md
new file mode 100644
index 0000000000..5a0a51555b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-057.md
@@ -0,0 +1,226 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca16
+title: Part 57
+challengeType: 0
+dashedName: part-57
+---
+
+# --description--
+
+Appropriately set the `x` values for `instagramLine` like you did for the other two lines.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const instagramLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-058.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-058.md
new file mode 100644
index 0000000000..66f4ae49a3
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-058.md
@@ -0,0 +1,229 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca17
+title: Part 58
+challengeType: 0
+dashedName: part-58
+---
+
+# --description--
+
+Appropriately set the `y` values for `instagramLine` like you did for the other two lines. Use the Instagram followers data this time.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.instagram\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-059.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-059.md
new file mode 100644
index 0000000000..b30967efed
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-059.md
@@ -0,0 +1,231 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca18
+title: Part 59
+challengeType: 0
+dashedName: part-59
+---
+
+# --description--
+
+On a new line, `append` a new `path` for the Instagram line like you did for the other two lines.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 5 &&
+    code.match(/lineGraph\.append\((`|'|")path\1\)/gi).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-060.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-060.md
new file mode 100644
index 0000000000..1d1a2461c9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-060.md
@@ -0,0 +1,230 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca19
+title: Part 60
+challengeType: 0
+dashedName: part-60
+---
+
+# --description--
+
+Use your `instagramLine` variable and your data to set the `d` attribute for this path like you did for the other two.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[4].getAttribute('d').length === 171);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-061.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-061.md
new file mode 100644
index 0000000000..78de28a793
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-061.md
@@ -0,0 +1,239 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1a
+title: Part 61
+challengeType: 0
+dashedName: part-61
+---
+
+# --description--
+
+Set the `stroke`, `stroke-width`, and `fill` attributes to their appropriate values for this line. The `stroke-width` and `fill` are the same as the other two.
+
+# --hints--
+
+test-text
+
+```js
+const instagramPath = $('svg path')[4];
+assert(
+  instagramPath.getAttribute('stroke') === '#fd9b98' &&
+    instagramPath.getAttribute('stroke-width') == '3' &&
+    instagramPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+
+  
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-062.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-062.md
new file mode 100644
index 0000000000..72e1323994
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-062.md
@@ -0,0 +1,247 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1b
+title: Part 62
+challengeType: 0
+dashedName: part-62
+---
+
+# --description--
+
+Okay, your graph is coming along. All the lines are drawn, but they look a little plain. The next series of code additions will add circles to each point on each line. First is the Twitter line. On a new line, use the `selectAll` function on your `lineGraph` variable and pass it the string `twitter-circles`. It will look like this:
+
+```js
+lineGraph.selectAll('twitter-circles')
+```
+
+`twitter-circles` don't exist and this selection will be an empty array, but it's needed. For now, you can just think of this string as a reference, similar to a variable name, so you know what elements you are working with.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*twitter-circles\1\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-063.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-063.md
new file mode 100644
index 0000000000..c09620b08b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-063.md
@@ -0,0 +1,246 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1c
+title: Part 63
+challengeType: 0
+dashedName: part-63
+---
+
+# --description--
+
+Add the D3 `data` function to your selection and pass it the data array like this:
+
+```js
+.data(data)
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.data\s*\(\s*data\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+
+
+
+</script> 
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-064.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-064.md
new file mode 100644
index 0000000000..ec2fac2892
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-064.md
@@ -0,0 +1,248 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1d
+title: Part 64
+challengeType: 0
+dashedName: part-64
+---
+
+# --description--
+
+Next, chain the `enter()` function to the selection.
+
+The enter function identifies elements that need to be added when the data array is longer than the selection array. This is why you wanted the `selectAll` to be an empty array before.
+
+In this case, the `twitter-circles` selection has a length of 0, and the data array has a length of 9. So nine elements will be added when you use `append` in the next step.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.data\(data\)\s*\.enter\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+
+
+
+</script> 
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+    .data(data)
+    .enter()
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-065.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-065.md
new file mode 100644
index 0000000000..8edf0ab0b8
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-065.md
@@ -0,0 +1,246 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1e
+title: Part 65
+challengeType: 0
+dashedName: part-65
+---
+
+# --description--
+
+Add the `append` function to the selection, and use it to add `circle` elements. This will add the nine `circle` elements for your Twitter circles. They will be invisible to start, but the elements are there.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 9);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+    .data(data)
+    .enter()
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-066.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-066.md
new file mode 100644
index 0000000000..81dd24789e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-066.md
@@ -0,0 +1,250 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1f
+title: Part 66
+challengeType: 0
+dashedName: part-66
+---
+
+# --description--
+
+Each circle needs a `cx` and `cy` attribute so it knows where to display on the SVG. These are similar to the x and y coordinates for the lines and will be calculated in the same way. The difference is that, for circles, the `cx` and `cy` are attributes, so you need to use the `attr` function.
+
+Use the `attr` function to set the `cx` to `d => xScale(d.year)`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('cx') == '70');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-067.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-067.md
new file mode 100644
index 0000000000..c3828efd81
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-067.md
@@ -0,0 +1,252 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca20
+title: Part 67
+challengeType: 0
+dashedName: part-67
+---
+
+# --description--
+
+Next, set the `cy` attribute to `d => xScale(d.followers.twitter)`.
+
+As a reminder, this will pass each value of your Twitter followers to the `xScale` function where it will determine the y coordinate to use.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('cy') == '243.232');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-068.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-068.md
new file mode 100644
index 0000000000..3d5c6c2bc9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-068.md
@@ -0,0 +1,252 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca21
+title: Part 68
+challengeType: 0
+dashedName: part-68
+---
+
+# --description--
+
+Circles also need an `r` (radius) attribute so they know how big to be. Use the `attr` function to set the `r` to `6`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('r') == '6');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-069.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-069.md
new file mode 100644
index 0000000000..20564296fd
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-069.md
@@ -0,0 +1,258 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca22
+title: Part 69
+challengeType: 0
+dashedName: part-69
+---
+
+# --description--
+
+The circles are now visible, but I don't like the color. Use the appropriate function to set the `fill` to `white` and the `stroke` to your `twitterColor` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[0].getAttribute('fill') === 'white' &&
+    $('svg circle')[0].getAttribute('stroke') === '#7cd9d1'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-070.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-070.md
new file mode 100644
index 0000000000..42f78cc15b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-070.md
@@ -0,0 +1,258 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca23
+title: Part 70
+challengeType: 0
+dashedName: part-70
+---
+
+# --description--
+
+Use the `style` function to set the `cursor` to `pointer`. Like your year labels, this will be an indicator for a hover effect you will add later.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-071.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-071.md
new file mode 100644
index 0000000000..56f09feeba
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-071.md
@@ -0,0 +1,263 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca24
+title: Part 71
+challengeType: 0
+dashedName: part-71
+---
+
+# --description--
+
+On a new line, use the `selectAll` function on your `lineGraph` variable again and pass it the string `tumblr-circles` this time. The next few steps will be for adding circles to the Tumblr line.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*tumblr-circles\1\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-072.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-072.md
new file mode 100644
index 0000000000..3161f8adfb
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-072.md
@@ -0,0 +1,268 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca25
+title: Part 72
+challengeType: 0
+dashedName: part-72
+---
+
+# --description--
+
+Add the same `data`, `enter`, and `append` functions here that you added for the `twitter-circles`, passing in the same arguments. Make sure they are in the same order.
+
+Remember that this will take the difference in length between the `tumblr-circles` selection(0) and the data array(9) and append that many circle elements.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 18);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-073.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-073.md
new file mode 100644
index 0000000000..1f860b9f0f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-073.md
@@ -0,0 +1,274 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca26
+title: Part 73
+challengeType: 0
+dashedName: part-73
+---
+
+# --description--
+
+Set the `cx` and `cy` attributes for the Tumblr circles to their appropriate values.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[9].getAttribute('cx') == '70' &&
+    $('svg circle')[9].getAttribute('cy') == '401.128'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-074.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-074.md
new file mode 100644
index 0000000000..c84eb37bed
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-074.md
@@ -0,0 +1,280 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca27
+title: Part 74
+challengeType: 0
+dashedName: part-74
+---
+
+# --description--
+
+Use the `attr` function to set the `r` to `6`, the `fill` to `white`, and the `stroke` to your `tumblrColor` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[9].getAttribute('r') == '6' &&
+    $('svg circle')[9].getAttribute('fill') === 'white' &&
+    $('svg circle')[9].getAttribute('stroke') === '#f6dd71'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-075.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-075.md
new file mode 100644
index 0000000000..72c22fb688
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-075.md
@@ -0,0 +1,280 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca28
+title: Part 75
+challengeType: 0
+dashedName: part-75
+---
+
+# --description--
+
+Set the `cursor` to `pointer` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[9].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-076.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-076.md
new file mode 100644
index 0000000000..5840013fba
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-076.md
@@ -0,0 +1,287 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca29
+title: Part 76
+challengeType: 0
+dashedName: part-76
+---
+
+# --description--
+
+The circles have been added to two of the lines and look good, on to the last one. On a new line, create another empty selection like you did before. Use the string: `instagram-circles` this time.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*instagram-circles\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-077.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-077.md
new file mode 100644
index 0000000000..038b25fe6f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-077.md
@@ -0,0 +1,288 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2a
+title: Part 77
+challengeType: 0
+dashedName: part-77
+---
+
+# --description--
+
+Add the three functions necessary to append the new circle elements. Remember that they won't actually be visible yet.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 27);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-078.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-078.md
new file mode 100644
index 0000000000..37dfd3a218
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-078.md
@@ -0,0 +1,296 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2b
+title: Part 78
+challengeType: 0
+dashedName: part-78
+---
+
+# --description--
+
+Appropriately set the `cx` and `cy` attributes for the Instagram circles.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[18].getAttribute('cx') == '70' &&
+    $('svg circle')[18].getAttribute('cy') == '424.024'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-079.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-079.md
new file mode 100644
index 0000000000..050c462974
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-079.md
@@ -0,0 +1,302 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2c
+title: Part 79
+challengeType: 0
+dashedName: part-79
+---
+
+# --description--
+
+Appropriately set the radius (`r`), `fill`, and `stroke` for these circles.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[18].getAttribute('r') == '6' &&
+    $('svg circle')[18].getAttribute('fill') === 'white' &&
+    $('svg circle')[18].getAttribute('stroke') === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-080.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-080.md
new file mode 100644
index 0000000000..a5d57e2bdc
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-080.md
@@ -0,0 +1,302 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2d
+title: Part 80
+challengeType: 0
+dashedName: part-80
+---
+
+# --description--
+
+Apply the appropriate `cursor` style for these circles.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[18].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-081.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-081.md
new file mode 100644
index 0000000000..58692f5eb8
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-081.md
@@ -0,0 +1,309 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2e
+title: Part 81
+challengeType: 0
+dashedName: part-81
+---
+
+# --description--
+
+The line graph is looking good. All the empty space to the right will be for the pie graph and legend. Create a new `const` named `rightDashboard` and set equal to `d3.select('.dashboard')`. This will select your dashboard container again which currently only has the SVG element as a child.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*rightDashboard\s*=\s*d3\.select\s*\((`|'|")\.dashboard\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-082.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-082.md
new file mode 100644
index 0000000000..189c7e257e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-082.md
@@ -0,0 +1,312 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2f
+title: Part 82
+challengeType: 0
+dashedName: part-82
+---
+
+# --description--
+
+Use `append` to add a `div` element to the selection. This will put a div as another child of the dashboard container to hold the pie graph and legend.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const rightDashboard = d3\.select\((`|'|")\.dashboard\1\)\s*\.append\s*\(\s*(`|'|")div\2\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-083.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-083.md
new file mode 100644
index 0000000000..06544d55f4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-083.md
@@ -0,0 +1,315 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca30
+title: Part 83
+challengeType: 0
+dashedName: part-83
+---
+
+# --description--
+
+Create a new `const` named `pieGraph` and set it equal to `rightDashboard.append('svg')`. This will add an SVG element for the pie graph as a child of the div you just added. The pie graph will have three slices, one for each platform. It will display a percentage of how many followers each platform has for the displayed year.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*pieGraph\s*=\s*rightDashboard\s*\.\s*append\s*\((`|'|")svg\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-084.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-084.md
new file mode 100644
index 0000000000..ff5d59d875
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-084.md
@@ -0,0 +1,318 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca31
+title: Part 84
+challengeType: 0
+dashedName: part-84
+---
+
+# --description--
+
+Add two `attr` functions that set the `width` and `height` of the new SVG to `200`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg')[1].getAttribute('width') == '200' &&
+    $('svg')[1].getAttribute('height') == '200'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-085.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-085.md
new file mode 100644
index 0000000000..254821537e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-085.md
@@ -0,0 +1,319 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca32
+title: Part 85
+challengeType: 0
+dashedName: part-85
+---
+
+# --description--
+
+Create a new `const` named `pieArc` and set it equal to `d3.arc()`. This will be used to create the angles for the lines of the pie chart using the D3 arc generator.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pieArc\s*=\s*d3\s*\.\s*arc\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-086.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-086.md
new file mode 100644
index 0000000000..24d2528df9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-086.md
@@ -0,0 +1,324 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca33
+title: Part 86
+challengeType: 0
+dashedName: part-86
+---
+
+# --description--
+
+Chain the function `outerRadius(100)` to the arc. This will set the outer radius of the pie chart to 100.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieArc = d3\.arc\(\)\s*\.\s*outerRadius\s*\(\s*100\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-087.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-087.md
new file mode 100644
index 0000000000..158785f17c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-087.md
@@ -0,0 +1,328 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca34
+title: Part 87
+challengeType: 0
+dashedName: part-87
+---
+
+# --description--
+
+Chain `innerRadius` to the arc and pass it `0` (zero). This is set to zero to make a traditional pie chart, you would use a larger inner radius to create a doughnut chart.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieArc = d3\.arc\(\)\s*\.outerRadius\(100\)\s*\.\s*innerRadius\s*\(\s*0\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-088.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-088.md
new file mode 100644
index 0000000000..0374b5d205
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-088.md
@@ -0,0 +1,329 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca35
+title: Part 88
+challengeType: 0
+dashedName: part-88
+---
+
+# --description--
+
+The pie chart needs a new scale to set the colors. Create a new `const` named `pieColors` and set it equal to `d3.scaleOrdinal()`. An ordinal scale is for a set of data that will have exactly one item in the range specifically for it.
+
+In this case, each platform of followers you have will map directly to a single color with nothing in between.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pieColors\s*=\s*d3\s*\.\s*scaleOrdinal\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-089.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-089.md
new file mode 100644
index 0000000000..d370af97db
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-089.md
@@ -0,0 +1,334 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca36
+title: Part 89
+challengeType: 0
+dashedName: part-89
+---
+
+# --description--
+
+Set the `domain` of the scale to `data[8].followers`. This will be three items, one for each platform.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieColors = d3\.scaleOrdinal\(\)\s*\.\s*domain\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-090.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-090.md
new file mode 100644
index 0000000000..2ab27a1292
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-090.md
@@ -0,0 +1,336 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca37
+title: Part 90
+challengeType: 0
+dashedName: part-90
+---
+
+# --description--
+
+Since the domain has three items, the range also needs to have three items. If it had less, the values would repeat, putting the same color on the pie chart multiple times. Add the `range` function to the scale and pass it an array with your three color variables. Put them in the same order in which they are defined.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.domain\(data\[8\]\.followers\)\s*\.\s*range\s*\(\s*\[\s*twitterColor\s*,\s*tumblrColor\s*,\s*instagramColor\s*\]\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-091.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-091.md
new file mode 100644
index 0000000000..ca30c57807
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-091.md
@@ -0,0 +1,335 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca38
+title: Part 91
+challengeType: 0
+dashedName: part-91
+---
+
+# --description--
+
+Create a new `const` named `pie` and set it equal to `d3.pie()`. This is the D3 pie chart generator.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pie\s*=\s*d3\s*\.\s*pie\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-092.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-092.md
new file mode 100644
index 0000000000..78810ee7c2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-092.md
@@ -0,0 +1,344 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca39
+title: Part 92
+challengeType: 0
+dashedName: part-92
+---
+
+# --description--
+
+Chain a `value` function to `pie` and pass it `d => d.value`. Each piece of data(`d`) will have a `key`(platform) and a `value`(number of followers), you want to return the number of followers here. The pie function will create an array of objects from these values that describe the angles and sizes the pie chart needs.
+
+In a few steps, you will make an array out of your data variable that will be passed to this function.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pie = d3\.pie\(\)\s*\.\s*value\s*\(\s*d\s*=>\s*d\.value\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+
+    
+  
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-093.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-093.md
new file mode 100644
index 0000000000..d04e9e9cd4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-093.md
@@ -0,0 +1,345 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3a
+title: Part 93
+challengeType: 0
+dashedName: part-93
+---
+
+# --description--
+
+Create a new `const` named `pieGraphData` and set the value equal to `pieGraph.selectAll('pieSlices')`. This is an empty selection similar circles you created earlier.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*pieGraphData\s*=\s*pieGraph\s*\.\s*selectAll\s*\(\s*(`|'|")pieSlices\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+
+    
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-094.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-094.md
new file mode 100644
index 0000000000..2f7ab8d169
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-094.md
@@ -0,0 +1,348 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3b
+title: Part 94
+challengeType: 0
+dashedName: part-94
+---
+
+# --description--
+
+Add the `data` function to the selection. Pass it your `pie` function with an empty array as its argument for now. The next step will get the correct array to put there.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieGraphData = pieGraph\.selectAll\((`|'|")pieSlices\1\)\s*\.\s*data\s*\(pie\s*\(\s*\[\s*\]\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie([]))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-095.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-095.md
new file mode 100644
index 0000000000..aa0739df56
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-095.md
@@ -0,0 +1,367 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3c
+title: Part 95
+challengeType: 0
+dashedName: part-95
+---
+
+# --description--
+
+You want the array passed to `pie` to be an array of key/value objects for the 2020 followers. `d3.entries` will build that array for you. Here's how that looks:
+
+```js
+d3.entries(data[8].followers))
+```
+
+The array it builds looks like this:
+
+```js
+[
+  { key: 'twitter', value: 2845 },
+  { key: 'tumblr', value: 2040 },
+  { key: 'instagram', value: 4801 }
+]
+```
+
+This is where the `value` comes from in your `pie` variable.
+
+Add the `d3.entries` function as your `pie` argument. Use it to create the above array.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieGraphData = pieGraph\.selectAll\((`|'|")pieSlices\1\)\s*\.\s*data\s*\(pie\s*\(\s*d3\s*\.\s*entries\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie([]))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-096.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-096.md
new file mode 100644
index 0000000000..9360d253ba
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-096.md
@@ -0,0 +1,350 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3d
+title: Part 96
+challengeType: 0
+dashedName: part-96
+---
+
+# --description--
+
+Add the `enter` function to the current selection. Just like before, the initial selection here has a length of zero and the data has a length of three. So when you append elements in the next step, three will be created; one for each slice of the pie.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.data\(pie\(d3\.entries\(data\[8\]\.followers\)\)\)\s*\.\s*enter\s*\(\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-097.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-097.md
new file mode 100644
index 0000000000..951024b7ea
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-097.md
@@ -0,0 +1,348 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3e
+title: Part 97
+challengeType: 0
+dashedName: part-97
+---
+
+# --description--
+
+Use `append` to add three `g` elements for the pie.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg g').length === 20);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-098.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-098.md
new file mode 100644
index 0000000000..50c6cb583e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-098.md
@@ -0,0 +1,351 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3f
+title: Part 98
+challengeType: 0
+dashedName: part-98
+---
+
+# --description--
+
+On a new line, `append` a `path` element to your `pieGraphData` variable. This is where you will start to draw the pie chart.
+
+# --hints--
+
+test-text
+
+```js
+assert(/pieGraphData\s*\.\s*append\s*\((`|'|")path\1\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  pieGraphData.append('path')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-099.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-099.md
new file mode 100644
index 0000000000..8955c72ecd
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-099.md
@@ -0,0 +1,352 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca40
+title: Part 99
+challengeType: 0
+dashedName: part-99
+---
+
+# --description--
+
+Set the `d` attribute to your `pieArc` variable. Just like the `d` in your lines, this is an SVG attribute for path elements that describes how to draw things. Your `pieArc` variable will determine what this value is for you.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div svg path')[0].getAttribute('d').length === 94);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  pieGraphData.append('path')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-100.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-100.md
new file mode 100644
index 0000000000..db5e69b6b2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-100.md
@@ -0,0 +1,372 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca41
+title: Part 100
+challengeType: 0
+dashedName: part-100
+---
+
+# --description--
+
+The pie graph is being drawn at the `0, 0` coordinates of the SVG. Back on your `pieGraphData` variable, add an attribute that changes the `transform` to `translate(100, 100)`.
+
+Since the pie chart has a radius of 100, and the SVG is 200 by 200, this will move it so it is centered.
+
+# --hints--
+
+test-text
+
+```js
+const transform = $('.dashboard div svg g')[0].getAttribute('transform');
+assert(/translate\s*\(\s*100\s*,\s*100\s*\)/g.test(transform));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3
+    .select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3
+    .scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3
+    .scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale).ticks(6, '~s');
+
+  const xAxis = d3
+    .axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph
+    .append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph
+    .append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph
+    .append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph
+    .append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph
+    .append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  lineGraph
+    .selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer');
+
+  const rightDashboard = d3.select('.dashboard').append('div');
+
+  const pieGraph = rightDashboard
+    .append('svg')
+    .attr('width', 200)
+    .attr('height', 200);
+
+  const pieArc = d3
+    .arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3
+    .scaleOrdinal()
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie().value(d => d.value);
+
+  const pieGraphData = pieGraph
+    .selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-101.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-101.md
new file mode 100644
index 0000000000..016740db33
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-101.md
@@ -0,0 +1,377 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca42
+title: Part 101
+challengeType: 0
+dashedName: part-101
+---
+
+# --description--
+
+Back at the bottom, where you draw the chart. Use the `attr` function to set the `fill` to a "d function". In the "d function", use your `pieColors` scale to get the color value for the platform(`d.data.key`). So when each platform is passed to your scale, is will get the appropriate color to use as the fill from the scales range.
+
+# --hints--
+
+test-text
+
+```js
+const pathsArr = $('.dashboard div svg g path');
+assert(
+  pathsArr[0].getAttribute('fill') === '#7cd9d1' &&
+    pathsArr[1].getAttribute('fill') === '#f6dd71' &&
+    pathsArr[2].getAttribute('fill') === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3
+    .select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3
+    .scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3
+    .scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale).ticks(6, '~s');
+
+  const xAxis = d3
+    .axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph
+    .append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph
+    .append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph
+    .append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph
+    .append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph
+    .append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  lineGraph
+    .selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer');
+
+  const rightDashboard = d3.select('.dashboard').append('div');
+
+  const pieGraph = rightDashboard
+    .append('svg')
+    .attr('width', 200)
+    .attr('height', 200);
+
+  const pieArc = d3
+    .arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3
+    .scaleOrdinal()
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie().value(d => d.value);
+
+  const pieGraphData = pieGraph
+    .selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-102.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-102.md
new file mode 100644
index 0000000000..e7d9c7423c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-102.md
@@ -0,0 +1,364 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca43
+title: Part 102
+challengeType: 0
+dashedName: part-102
+---
+
+# --description--
+
+Next, set the `stroke` to `white` and the `stroke-width` to `2`.
+
+# --hints--
+
+test-text
+
+```js
+const pathsArr = $('.dashboard div svg g path');
+assert(
+  pathsArr[0].getAttribute('stroke') === 'white' &&
+    pathsArr[0].getAttribute('stroke-width') == 2
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-103.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-103.md
new file mode 100644
index 0000000000..2e7f2196cf
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-103.md
@@ -0,0 +1,365 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca44
+title: Part 103
+challengeType: 0
+dashedName: part-103
+---
+
+# --description--
+
+Your chart needs some labels in each slice. On a new line, append `text` elements to your `pieGraphData` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(/pieGraphData\s*\.\s*append\s*\((`|'|")text\1\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-104.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-104.md
new file mode 100644
index 0000000000..0cb9c6cda4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-104.md
@@ -0,0 +1,381 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca47
+title: Part 104
+challengeType: 0
+dashedName: part-104
+---
+
+# --description--
+
+Chain a `text` function to set the text of each pie slice to a percentage. Set the value to a "d function" with curly brackets and leave the function empty for now. It should look like this:
+
+```js
+.text(d => {
+
+})
+```
+
+The method for getting the percent of each slice will take a few steps:
+
+1.  Find the total number of followers for the displayed year
+2.  Divide the followers of a single platform by that total
+3.  Turn it into a string to display
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.append\('text'\)\s*\.text\s*\(\s*d\s*=>\s*\{\s*\}\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-105.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-105.md
new file mode 100644
index 0000000000..9fe69b81a2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-105.md
@@ -0,0 +1,383 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca48
+title: Part 105
+challengeType: 0
+dashedName: part-105
+---
+
+# --description--
+
+In the function you just created, create a `const` named `values`. Use the `d3.values` function to get the values of the 2020 followers and set the result to your `values` variable. Here's how to get the values:
+
+```js
+d3.values(data[8].followers)
+```
+
+It will be an array with the values of the followers for the three platforms in 2020.
+
+Note that this "d function" has curly brackets. So you could `console.log(values)` in there to see it's value.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*values\s*=\s*d3\s*\.\s*values\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\);?/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-106.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-106.md
new file mode 100644
index 0000000000..0de087f1cc
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-106.md
@@ -0,0 +1,372 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca49
+title: Part 106
+challengeType: 0
+dashedName: part-106
+---
+
+# --description--
+
+Since you want to find what percent each of those `values` is, you first need to add them all up. `d3.sum` will do that for you. Create a new `const` named `sum` and set it equal to `d3.sum(values)`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*sum\s*=\s*d3\s*\.\s*sum\s*\(\s*values\s*\)\s*;?/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-107.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-107.md
new file mode 100644
index 0000000000..9663f711d9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-107.md
@@ -0,0 +1,376 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4a
+title: Part 107
+challengeType: 0
+dashedName: part-107
+---
+
+# --description--
+
+Create another variable named `percent` and set it equal to `d.data.value` divided by your `sum` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*percent\s*=\s*d\s*\.\s*data\s*\.\s*value\s*\/\s*sum;?/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-108.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-108.md
new file mode 100644
index 0000000000..2997d10be6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-108.md
@@ -0,0 +1,388 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4b
+title: Part 108
+challengeType: 0
+dashedName: part-108
+---
+
+# --description--
+
+Your percent values are numbers less than one. You will need to multiply it by 100, round of the decimals, and add a `%` sign. Use a template literal to return this to the `text` function:
+
+```js
+${Math.round(percent * 100)}%
+```
+
+Don't forget that you need a `return` statement here since you aren't using an implicit return.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /return\s*`\$\{\s*Math\s*\.\s*round\s*\(\s*percent\s*\*\s*100\s*\)\s*\}%`;?\s*\}\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-109.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-109.md
new file mode 100644
index 0000000000..194c4a19ab
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-109.md
@@ -0,0 +1,388 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4c
+title: Part 109
+challengeType: 0
+dashedName: part-109
+---
+
+# --description--
+
+The text elements are at the center of the pie graph, you need to use the `centroid` from the D3 arc API to tell them where to go. Add an `attr` function to set the `transform` to a `d` function that returns this template literal: `translate(${ pieArc.centroid(d) })`
+
+The `centroid` function will find the midpoint of each slice for each text element.
+
+# --hints--
+
+test-text
+
+```js
+const transform = $('.dashboard div svg g text')[0]
+  .getAttribute('transform')
+  .replace('translate(', '')
+  .replace(')', '')
+  .split(',');
+assert(transform[0] < 39 && transform[1] > 31);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-110.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-110.md
new file mode 100644
index 0000000000..731a5184b1
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-110.md
@@ -0,0 +1,389 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4d
+title: Part 110
+challengeType: 0
+dashedName: part-110
+---
+
+# --description--
+
+The function you just added, placed the start of the text at the midpoint of each slice. Change the `style` of the text to give it a `text-anchor` of `middle` so the middle of the text is in the middle of the slice.
+
+After that, set the `font` to `10px verdana`.
+
+# --hints--
+
+test-text
+
+```js
+const text = $('.dashboard div svg g text')[0];
+assert(
+  text.style.textAnchor === 'middle' &&
+    text.style.font.toLowerCase() === '10px verdana'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-111.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-111.md
new file mode 100644
index 0000000000..e191bb7684
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-111.md
@@ -0,0 +1,391 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4e
+title: Part 111
+challengeType: 0
+dashedName: part-111
+---
+
+# --description--
+
+The last component you are going to add is a legend to display the name of each platform and the number of followers for the year. Create a new `const` named `legend` and use it to `append` a `table` to your `rightDashboard` variable. This looks similar to the code where you created your `pieGraph` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legend\s*=\s*rightDashboard\s*\.\s*append\s*\(\s*('|"|`)\s*table\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-112.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-112.md
new file mode 100644
index 0000000000..680c56e08b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-112.md
@@ -0,0 +1,394 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4f
+title: Part 112
+challengeType: 0
+dashedName: part-112
+---
+
+# --description--
+
+Give the table a `width` of `200` and a `height` of `120` using `attr`.
+
+# --hints--
+
+test-text
+
+```js
+const table = $('.dashboard div table')[0];
+assert(
+  table.getAttribute('width') == 200 && table.getAttribute('height') == 120
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-113.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-113.md
new file mode 100644
index 0000000000..c0c7b38cef
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-113.md
@@ -0,0 +1,396 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca50
+title: Part 113
+challengeType: 0
+dashedName: part-113
+---
+
+# --description--
+
+Set the `font` to `12px verdana` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table')[0].style.font.toLowerCase() === '12px verdana'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-114.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-114.md
new file mode 100644
index 0000000000..0492d13020
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-114.md
@@ -0,0 +1,401 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca51
+title: Part 114
+challengeType: 0
+dashedName: part-114
+---
+
+# --description--
+
+Create a new `const` named `legendTitle` and use it to `append` a `thead` to your `legend` variable. `thead` is used with the HTML table element and is for the top row of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legendTitle\s*=\s*legend\s*\.\s*append\s*\(\s*('|"|`)\s*thead\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-115.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-115.md
new file mode 100644
index 0000000000..4d4098f707
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-115.md
@@ -0,0 +1,401 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca52
+title: Part 115
+challengeType: 0
+dashedName: part-115
+---
+
+# --description--
+
+`append` a `tr` element to the selection and then append a `th` element right after it. `tr` is for defining a row of the table, and `th` is for defining the header cells of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th').length === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-116.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-116.md
new file mode 100644
index 0000000000..39ced1543d
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-116.md
@@ -0,0 +1,404 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca53
+title: Part 116
+challengeType: 0
+dashedName: part-116
+---
+
+# --description--
+
+Use the `text` function to set the text of the selection to `2020 followers`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th').text() === '2020 followers');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-117.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-117.md
new file mode 100644
index 0000000000..bf9e34eda4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-117.md
@@ -0,0 +1,406 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca54
+title: Part 117
+challengeType: 0
+dashedName: part-117
+---
+
+# --description--
+
+Your table is going to have three columns, one for the platform name, one for the color it is using on your dashboard, and a third to display the number of followers. So you want the title to take up all three columns. Set the `colspan` attribute of the `th` to `3` so it spans all three of these columns.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th')[0].getAttribute('colspan') == 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-118.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-118.md
new file mode 100644
index 0000000000..0c3e750347
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-118.md
@@ -0,0 +1,412 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca55
+title: Part 118
+challengeType: 0
+dashedName: part-118
+---
+
+# --description--
+
+Create a new `const` named `legendRows` and use it to `append` a `tbody` element to your `legend` variable similar to how you added the `thead`. `tbody` is for the main content of an HTML table.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legendRows\s*=\s*legend\s*\.\s*append\s*\(\s*('|"|`)\s*tbody\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-119.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-119.md
new file mode 100644
index 0000000000..68b03ce851
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-119.md
@@ -0,0 +1,417 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca56
+title: Part 119
+challengeType: 0
+dashedName: part-119
+---
+
+# --description--
+
+Add a `selectAll` function to the selection and pass it the string `tr`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const legendRows = legend\.append\('tbody\s*'\)\s*\.\s*selectAll\s*\(\s*('|"|`)\s*tr\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.selectAll('pieSliceText')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-120.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-120.md
new file mode 100644
index 0000000000..aa30807012
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-120.md
@@ -0,0 +1,417 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca57
+title: Part 120
+challengeType: 0
+dashedName: part-120
+---
+
+# --description--
+
+Use the `data` function to set the data for the rows to an array of your 2020 followers. To get the array use `d3.entries(data[8].followers)`. Remember, this will create an array of key/value pairs of your followers for that year.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.selectAll\('tr'\)\s*\.\s*data\s*\(\s*d3\s*\.\s*entries\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-121.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-121.md
new file mode 100644
index 0000000000..ee08e49dda
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-121.md
@@ -0,0 +1,418 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca58
+title: Part 121
+challengeType: 0
+dashedName: part-121
+---
+
+# --description--
+
+Add the `enter` and `append` functions to the selection. Pass the string `tr` to the append function to add three table row elements. These elements will be for displaying each platform's name.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-122.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-122.md
new file mode 100644
index 0000000000..777a09d553
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-122.md
@@ -0,0 +1,422 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca59
+title: Part 122
+challengeType: 0
+dashedName: part-122
+---
+
+# --description--
+
+On a new line, `append` a `td` to your `legendRows` variable. `td` is for an individual cell in the row of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-123.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-123.md
new file mode 100644
index 0000000000..562a3d4fd0
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-123.md
@@ -0,0 +1,426 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5a
+title: Part 123
+challengeType: 0
+dashedName: part-123
+---
+
+# --description--
+
+Use the `text` function to set the text of each `td` to the `key` of each data point by using a "d function" to return `d.key`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td').text() === 'twittertumblrinstagram'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-124.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-124.md
new file mode 100644
index 0000000000..0e33d97bc6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-124.md
@@ -0,0 +1,431 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5b
+title: Part 124
+challengeType: 0
+dashedName: part-124
+---
+
+# --description--
+
+This is the first column of your table. Set the `align` attribute to `right` to align the text to the right of each cell.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[0]
+    .getAttribute('align')
+    .toLowerCase() === 'right'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-125.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-125.md
new file mode 100644
index 0000000000..915e877e04
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-125.md
@@ -0,0 +1,430 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5c
+title: Part 125
+challengeType: 0
+dashedName: part-125
+---
+
+# --description--
+
+On a new line, append another `td` element to your `legendRows` variable. This will be for colored squares in the center column.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 6);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-126.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-126.md
new file mode 100644
index 0000000000..1acfc7b1f6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-126.md
@@ -0,0 +1,437 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5d
+title: Part 126
+challengeType: 0
+dashedName: part-126
+---
+
+# --description--
+
+Set the `align` attribute to `center`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[1]
+    .getAttribute('align')
+    .toLowerCase() === 'center'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-127.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-127.md
new file mode 100644
index 0000000000..c2d8ad27c4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-127.md
@@ -0,0 +1,435 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5e
+title: Part 127
+challengeType: 0
+dashedName: part-127
+---
+
+# --description--
+
+Append a `div` element to the selection. Each `div` will be a small square for each color.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td div').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-128.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-128.md
new file mode 100644
index 0000000000..7a09ef3ed3
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-128.md
@@ -0,0 +1,438 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5f
+title: Part 128
+challengeType: 0
+dashedName: part-128
+---
+
+# --description--
+
+Set the `width` to `16px` and the `height` to `16px` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+const div = $('.dashboard div table tbody tr td div')[0];
+assert(div.style.width == '16px' && div.style.height === '16px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-129.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-129.md
new file mode 100644
index 0000000000..992537b3e6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-129.md
@@ -0,0 +1,443 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca60
+title: Part 129
+challengeType: 0
+dashedName: part-129
+---
+
+# --description--
+
+Using the `style` function again, set the `background-color` of each div to a "d function". Using the "d function", pass the key(`d.key`) of each data point to your `pieColors` scale so it knows what color to use.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td div')[0].style.backgroundColor ===
+    'rgb(124, 217, 209)'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-130.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-130.md
new file mode 100644
index 0000000000..2cb143184e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-130.md
@@ -0,0 +1,443 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca61
+title: Part 130
+challengeType: 0
+dashedName: part-130
+---
+
+# --description--
+
+On a new line, append another `td` to the `legendRows` variable for the last group of items. It will display the number of followers for each platform.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 9);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-131.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-131.md
new file mode 100644
index 0000000000..470b5a68e2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-131.md
@@ -0,0 +1,446 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca62
+title: Part 131
+challengeType: 0
+dashedName: part-131
+---
+
+# --description--
+
+Set the `text` to a "d function" that returns the value(`d.value`) for each data point.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td')[2].innerHTML === '2845');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-132.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-132.md
new file mode 100644
index 0000000000..cb3e63813d
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-132.md
@@ -0,0 +1,450 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca63
+title: Part 132
+challengeType: 0
+dashedName: part-132
+---
+
+# --description--
+
+Set the `align` attribute to `left` for this selection.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[2]
+    .getAttribute('align')
+    .toLowerCase() === 'left'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-133.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-133.md
new file mode 100644
index 0000000000..0aa86bfb00
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-133.md
@@ -0,0 +1,448 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca64
+title: Part 133
+challengeType: 0
+dashedName: part-133
+---
+
+# --description--
+
+The legend has all the information is needs, but the title looks a little misaligned. Go to where you created your `legendTitle` variable and set the `position` to `relative` and the `left` to `20px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const th = $('.dashboard div table thead tr th')[0];
+assert(th.style.position === 'relative' && th.style.left === '20px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-134.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-134.md
new file mode 100644
index 0000000000..1daa93dc49
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-134.md
@@ -0,0 +1,453 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca65
+title: Part 134
+challengeType: 0
+dashedName: part-134
+---
+
+# --description--
+
+The legend and pie graph look a little off as well. Go to where you created your `legend` variable and add a `position` of `relative` and a `top` of `30px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const table = $('.dashboard div table')[0];
+assert(table.style.position === 'relative' && table.style.top === '30px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>  
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-135.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-135.md
new file mode 100644
index 0000000000..3acf263d2b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-135.md
@@ -0,0 +1,464 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca66
+title: Part 135
+challengeType: 0
+dashedName: part-135
+---
+
+# --description--
+
+Lastly, where you created your `pieGraph` variable, add a `position` of `relative` and a `left` of `20px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const pieGraph = $('.dashboard div svg')[0];
+assert(
+  pieGraph.style.position === 'relative' && pieGraph.style.left === '20px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-136.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-136.md
new file mode 100644
index 0000000000..6ab6c4a6be
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-136.md
@@ -0,0 +1,476 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca67
+title: Part 136
+challengeType: 0
+dashedName: part-136
+---
+
+# --description--
+
+Finally! You have all the elements displayed and they look good. The last thing you will do is make it so you can see the data from whatever year you want.
+
+Wrap all the code in the script you've been working with in a function named `drawDashboard` and give it a parameter named `year`. Then, at the bottom of the script, call the function you created and pass it the number `2020`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof drawDashboard === 'function' &&
+    /<\/script>\s*<script>\s*function\s*drawDashboard\s*\(\s*year\s*\)\s*\{/g.test(
+      code
+    ) &&
+    /\}\s*drawDashboard\s*\(\s*2020\s*\)\s*;?\s*<\/script>\s*$/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-137.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-137.md
new file mode 100644
index 0000000000..736bc47dd7
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-137.md
@@ -0,0 +1,484 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca68
+title: Part 137
+challengeType: 0
+dashedName: part-137
+---
+
+# --description--
+
+At the top of the function create a new `const` named `index`. You are going to use it to find the item in the `data` array with the year that is passed to the function.
+
+Use JavaScript's `findIndex` function to set your `index` variable to the index of the item in the `data` array where the year is the same as the year passed to your `drawDashboard` function. Here's an example:
+
+```js
+array.findIndex(d => 
+  // find the index where the year passed to 
+  // drawDashboard equals the year of the array
+)
+```
+
+After this, you will be able to use `data[index]` to get that item in the array.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /var index = data.findIndex\(function \(d\) \{\s*return (year === d\.year|d.year === year);\s*\}\);/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-138.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-138.md
new file mode 100644
index 0000000000..763f870eeb
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-138.md
@@ -0,0 +1,479 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6a
+title: Part 138
+challengeType: 0
+dashedName: part-138
+---
+
+# --description--
+
+There are four places in the file where you used `data[8]` to set data to the year 2020. Change all five of them to `data[index]` so you can pass in any year to the function to display the data from that year.
+
+The five spots are:
+
+1.  The `domain` for `pieColors`.
+2.  The `data` for `pieGraphData`.
+3.  The `text` for your pie slice text.
+4.  The `data` for your `legendRows`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  !/data\[8\]/g.test(code) && code.match(/data\s*\[\s*index\s*\]/g).length === 4
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-139.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-139.md
new file mode 100644
index 0000000000..fa2774a18d
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-139.md
@@ -0,0 +1,485 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6b
+title: Part 139
+challengeType: 0
+dashedName: part-139
+---
+
+# --description--
+
+Go to where you `call` the `xAxis` and create a `mouseover` event for the labels. Chain the `on` function to them, pass it the string `mouseover`, and give it a value of a "d function" that calls `drawDashboard` with `d` as the argument. It will look like this:
+
+```js
+.on('mouseover', d => drawDashboard(d))
+```
+
+So now, when you hover a label, the function will be called with the year that is being hovered.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\);\s*\}\)/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-140.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-140.md
new file mode 100644
index 0000000000..de5fea91df
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-140.md
@@ -0,0 +1,478 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6c
+title: Part 140
+challengeType: 0
+dashedName: part-140
+---
+
+# --description--
+
+There's a problem, each time you hover a label it adds all the elements to the container again. If you empty the container at the top of the function, it will redraw them where they need to be.
+
+Go back to the top of the function and use `d3.select` to select the `.dashboard` element and chain the `html` function to it with an empty string as it parameter. Empty means no spaces.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(/d3\.select\(('|"|`)\.dashboard\1\)\.html\(('|"|`)\2\)/g.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-141.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-141.md
new file mode 100644
index 0000000000..0e35de8505
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-141.md
@@ -0,0 +1,489 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6d
+title: Part 141
+challengeType: 0
+dashedName: part-141
+---
+
+# --description--
+
+Now when you hover a label, you can see the data for the different years.
+
+Where you created the `text` elements for the x-axis labels, change the `font` to `bold 10px verdana` for the currently displayed year.
+
+To do this, create a "d function" in the `font` value area and return the above sting if `d` equals `year`. Otherwise, return the string that is currently there (`10px verdana`). It's easiest to use a ternary operator for this.
+
+Here's a hint:
+
+```js
+.style('font', d => d === year ? )
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  Object.values($('.dashboard svg g text')).filter(
+    (el) => el.style && el.style.font.toLowerCase() === 'bold 10px verdana'
+  ).length === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+  
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-142.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-142.md
new file mode 100644
index 0000000000..ca70f946f0
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-142.md
@@ -0,0 +1,481 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6e
+title: Part 142
+challengeType: 0
+dashedName: part-142
+---
+
+# --description--
+
+Create another `mouseover` event for when you hover one of the `twitter-circles`. It will look like the other `mouseover` event you created except the `drawDashboard` function will take `d.year` instead of `d`.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\.year\);\s*\}\)/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+  
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-143.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-143.md
new file mode 100644
index 0000000000..adb5ee8ab4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-143.md
@@ -0,0 +1,483 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6f
+title: Part 143
+challengeType: 0
+dashedName: part-143
+---
+
+# --description--
+
+Similar to how you made the text bold for the label of the displayed year; change the `fill` of the `twitter-circles` to your `twitterColor` for the currently displayed year. To do this, use a "d function" that returns the `twitterColor` when `d.year` equals `year`, and leave it `white` if it doesn't.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  Object.values($('.dashboard svg circle')).filter(
+    (el) => el.getAttribute && el.getAttribute('fill') === '#7cd9d1'
+  ).length === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-144.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-144.md
new file mode 100644
index 0000000000..26ea98aa97
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-144.md
@@ -0,0 +1,490 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca70
+title: Part 144
+challengeType: 0
+dashedName: part-144
+---
+
+# --description--
+
+Add a `mouseover` event to the `tumblr-circles` and `instagram-circles` in the same way that you did for the `twitter-circles`.
+
+After that, you will be able hover any of the circles or year labels to get the information for that year.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  script.match(
+    /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\.year\);\s*\}\)/g
+  ).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-145.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-145.md
new file mode 100644
index 0000000000..52d84a5440
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-145.md
@@ -0,0 +1,494 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca71
+title: Part 145
+challengeType: 0
+dashedName: part-145
+---
+
+# --description--
+
+Change the `fill` of the `tumblr-circles` and `instagram-circles` to use a "d function" that returns their respective color variables when `d.year` equals `year`, leave it `white` when they don't. This is similar to how you set the fill of the Twitter circles.
+
+Then, all of the circles will get filled in for the currently displayed year.
+
+# --hints--
+
+test-text
+
+```js
+const circles = Object.values($('.dashboard svg circle'));
+assert(
+  circles.filter(
+    (el) =>
+      el.getAttribute &&
+      (el.getAttribute('fill') === '#7cd9d1' ||
+        el.getAttribute('fill') === '#f6dd71' ||
+        el.getAttribute('fill') === '#fd9b98')
+  ).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-146.md b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-146.md
new file mode 100644
index 0000000000..421629433d
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/d3-dashboard/part-146.md
@@ -0,0 +1,483 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca72
+title: Part 146
+challengeType: 0
+dashedName: part-146
+---
+
+# --description--
+
+The last thing is that the legend title always shows 2020. Change the `text` of the `legendTitle` to a template literal that shows the currently displayed year followed by a space and `followers`.
+
+That's it, your dashboard is finished! Don't forget to admire your hard work.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.text\s*\(\s*`\s*\$\{\s*year\s*\} followers`\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text(`${year} followers`)
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
new file mode 100644
index 0000000000..33794d33d4
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -0,0 +1,53 @@
+---
+id: bd7168d8c242eddfaeb5bd13
+title: Visualize Data with a Bar Chart
+challengeType: 3
+forumTopicId: 301464
+dashedName: visualize-data-with-a-bar-chart
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/GrZVaM>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My chart should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My chart should have a `g` element x-axis with a corresponding `id="x-axis"`.
+
+**User Story #3:** My chart should have a `g` element y-axis with a corresponding `id="y-axis"`.
+
+**User Story #4:** Both axes should contain multiple tick labels, each with a corresponding `class="tick"`.
+
+**User Story #5:** My chart should have a `rect` element for each data point with a corresponding `class="bar"` displaying the data.
+
+**User Story #6:** Each bar should have the properties `data-date` and `data-gdp` containing `date` and `GDP` values.
+
+**User Story #7:** The bar elements' `data-date` properties should match the order of the provided data.
+
+**User Story #8:** The bar elements' `data-gdp` properties should match the order of the provided data.
+
+**User Story #9:** Each bar element's height should accurately represent the data's corresponding `GDP`.
+
+**User Story #10:** The `data-date` attribute and its corresponding bar element should align with the corresponding value on the x-axis.
+
+**User Story #11:** The `data-gdp` attribute and its corresponding bar element should align with the corresponding value on the y-axis.
+
+**User Story #12:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #13:** My tooltip should have a `data-date` property that corresponds to the `data-date` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/GDP-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
new file mode 100644
index 0000000000..65592f0262
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fa6367417b2b2512bbf
+title: Visualize Data with a Choropleth Map
+challengeType: 3
+forumTopicId: 301465
+dashedName: visualize-data-with-a-choropleth-map
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/EZKqza>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My choropleth should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My choropleth should have a description element with a corresponding `id="description"`.
+
+**User Story #3:** My choropleth should have counties with a corresponding `class="county"` that represent the data.
+
+**User Story #4:** There should be at least 4 different fill colors used for the counties.
+
+**User Story #5:** My counties should each have `data-fips` and `data-education` properties containing their corresponding `fips` and `education` values.
+
+**User Story #6:** My choropleth should have a county for each provided data point.
+
+**User Story #7:** The counties should have `data-fips` and `data-education` values that match the sample data.
+
+**User Story #8:** My choropleth should have a legend with a corresponding `id="legend"`.
+
+**User Story #9:** There should be at least 4 different fill colors used for the legend.
+
+**User Story #10:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #11:** My tooltip should have a `data-education` property that corresponds to the `data-education` of the active area.
+
+Here are the datasets you will need to complete this project:  
+
+-   **US Education Data:**`https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/for_user_education.json`
+-   **US County Data:**`https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/counties.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
new file mode 100644
index 0000000000..6a8ea226fb
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -0,0 +1,61 @@
+---
+id: bd7188d8c242eddfaeb5bd13
+title: Visualize Data with a Heat Map
+challengeType: 3
+forumTopicId: 301466
+dashedName: visualize-data-with-a-heat-map
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JEXgeY>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My heat map should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My heat map should have a description with a corresponding `id="description"`.
+
+**User Story #3:** My heat map should have an x-axis with a corresponding `id="x-axis"`.
+
+**User Story #4:** My heat map should have a y-axis with a corresponding `id="y-axis"`.
+
+**User Story #5:** My heat map should have `rect` elements with a `class="cell"` that represent the data.
+
+**User Story #6:** There should be at least 4 different fill colors used for the cells.
+
+**User Story #7:** Each cell will have the properties `data-month`, `data-year`, `data-temp` containing their corresponding `month`, `year`, and `temperature` values.
+
+**User Story #8:** The `data-month`, `data-year` of each cell should be within the range of the data.
+
+**User Story #9:** My heat map should have cells that align with the corresponding month on the y-axis.
+
+**User Story #10:** My heat map should have cells that align with the corresponding year on the x-axis.
+
+**User Story #11:** My heat map should have multiple tick labels on the y-axis with the full month name.
+
+**User Story #12:** My heat map should have multiple tick labels on the x-axis with the years between 1754 and 2015.
+
+**User Story #13:** My heat map should have a legend with a corresponding `id="legend"`.
+
+**User Story #14:** My legend should contain `rect` elements.
+
+**User Story #15:** The `rect` elements in the legend should use at least 4 different fill colors.
+
+**User Story #16:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #17:** My tooltip should have a `data-year` property that corresponds to the `data-year` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/global-temperature.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
new file mode 100644
index 0000000000..03d20ab5d2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -0,0 +1,57 @@
+---
+id: bd7178d8c242eddfaeb5bd13
+title: Visualize Data with a Scatterplot Graph
+challengeType: 3
+forumTopicId: 301467
+dashedName: visualize-data-with-a-scatterplot-graph
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bgpXyK>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** I can see a title element that has a corresponding `id="title"`.
+
+**User Story #2:** I can see an x-axis that has a corresponding `id="x-axis"`.
+
+**User Story #3:** I can see a y-axis that has a corresponding `id="y-axis"`.
+
+**User Story #4:** I can see dots, that each have a class of `dot`, which represent the data being plotted.
+
+**User Story #5:** Each dot should have the properties `data-xvalue` and `data-yvalue` containing their corresponding `x` and `y` values.
+
+**User Story #6:** The `data-xvalue` and `data-yvalue` of each dot should be within the range of the actual data and in the correct data format. For `data-xvalue`, integers (full years) or `Date` objects are acceptable for test evaluation. For `data-yvalue` (minutes), use `Date` objects.
+
+**User Story #7:** The `data-xvalue` and its corresponding dot should align with the corresponding point/value on the x-axis.
+
+**User Story #8:** The `data-yvalue` and its corresponding dot should align with the corresponding point/value on the y-axis.
+
+**User Story #9:** I can see multiple tick labels on the y-axis with `%M:%S` time format.
+
+**User Story #10:** I can see multiple tick labels on the x-axis that show the year.
+
+**User Story #11:** I can see that the range of the x-axis labels are within the range of the actual x-axis data.
+
+**User Story #12:** I can see that the range of the y-axis labels are within the range of the actual y-axis data.
+
+**User Story #13:** I can see a legend containing descriptive text that has `id="legend"`.
+
+**User Story #14:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #15:** My tooltip should have a `data-year` property that corresponds to the `data-xvalue` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/cyclist-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
new file mode 100644
index 0000000000..0409447ea7
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fa6367417b2b2512bc0
+title: Visualize Data with a Treemap Diagram
+challengeType: 3
+forumTopicId: 301468
+dashedName: visualize-data-with-a-treemap-diagram
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KaNGNR>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My tree map should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My tree map should have a description with a corresponding `id="description"`.
+
+**User Story #3:** My tree map should have `rect` elements with a corresponding `class="tile"` that represent the data.
+
+**User Story #4:** There should be at least 2 different fill colors used for the tiles.
+
+**User Story #5:** Each tile should have the properties `data-name`, `data-category`, and `data-value` containing their corresponding `name`, `category`, and `value`.
+
+**User Story #6:** The area of each tile should correspond to the `data-value` amount: tiles with a larger `data-value` should have a bigger area.
+
+**User Story #7:** My tree map should have a legend with corresponding `id="legend"`.
+
+**User Story #8:** My legend should have `rect` elements with a corresponding `class="legend-item"`.
+
+**User Story #9:** The `rect` elements in the legend should use at least 2 different fill colors.
+
+**User Story #10:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #11:** My tooltip should have a `data-value` property that corresponds to the `data-value` of the active area.
+
+For this project you can use any of the following datasets:  
+
+-   **Kickstarter Pledges:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/kickstarter-funding-data.json`
+-   **Movie Sales:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/movie-data.json`
+-   **Video Game Sales:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/video-game-sales-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
new file mode 100644
index 0000000000..beb4f34992
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
@@ -0,0 +1,118 @@
+---
+id: 587d7faa367417b2b2512bd4
+title: Add a Hover Effect to a D3 Element
+challengeType: 6
+forumTopicId: 301469
+dashedName: add-a-hover-effect-to-a-d3-element
+---
+
+# --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 `attr()` method. Then the `:hover` pseudo-class for your new class holds the style rules for any hover effects.
+
+# --instructions--
+
+Use the `attr()` method to add a class of `bar` to all the `rect` elements. This changes the `fill` color of the bar to brown when you mouse over it.
+
+# --hints--
+
+Your `rect` elements should have a class of `bar`.
+
+```js
+assert($('rect').attr('class').trim().split(/\s+/g).includes('bar'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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
+       .attr('class', 'bar')
+       // 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>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
new file mode 100644
index 0000000000..28ee20400f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
@@ -0,0 +1,175 @@
+---
+id: 587d7faa367417b2b2512bd6
+title: Add a Tooltip to a D3 Element
+challengeType: 6
+forumTopicId: 301470
+dashedName: add-a-tooltip-to-a-d3-element
+---
+
+# --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 `title` element.
+
+`title` pairs with the `text()` method to dynamically add data to the bars.
+
+# --instructions--
+
+Append a `title` element under each `rect` node. Then call the `text()` method with a callback function so the text displays the data value.
+
+# --hints--
+
+Your code should have 9 `title` elements.
+
+```js
+assert($('title').length == 9);
+```
+
+The first `title` element should have tooltip text of `12`.
+
+```js
+assert($('title').eq(0).text() == '12');
+```
+
+The second `title` element should have tooltip text of `31`.
+
+```js
+assert($('title').eq(1).text() == '31');
+```
+
+The third `title` element should have tooltip text of `22`.
+
+```js
+assert($('title').eq(2).text() == '22');
+```
+
+The fourth `title` element should have tooltip text of `17`.
+
+```js
+assert($('title').eq(3).text() == '17');
+```
+
+The fifth `title` element should have tooltip text of `25`.
+
+```js
+assert($('title').eq(4).text() == '25');
+```
+
+The sixth `title` element should have tooltip text of `18`.
+
+```js
+assert($('title').eq(5).text() == '18');
+```
+
+The seventh `title` element should have tooltip text of `29`.
+
+```js
+assert($('title').eq(6).text() == '29');
+```
+
+The eighth `title` element should have tooltip text of `14`.
+
+```js
+assert($('title').eq(7).text() == '14');
+```
+
+The ninth `title` element should have tooltip text of `9`.
+
+```js
+assert($('title').eq(8).text() == '9');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+       .append("title")
+       .text((d) => d)
+       
+
+    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>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
new file mode 100644
index 0000000000..f8ad572913
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
@@ -0,0 +1,211 @@
+---
+id: 587d7fab367417b2b2512bd8
+title: Add Attributes to the Circle Elements
+challengeType: 6
+forumTopicId: 301471
+dashedName: add-attributes-to-the-circle-elements
+---
+
+# --description--
+
+The last challenge created the `circle` elements for each point in the `dataset`, and appended them to the SVG canvas. But D3 needs more information about the position and size of each `circle` to display them correctly.
+
+A `circle` in SVG has three main attributes. The `cx` and `cy` attributes are the coordinates. They tell D3 where to position the *center* of the shape on the SVG canvas. The radius (`r` attribute) gives the size of the `circle`.
+
+Just like the `rect` `y` coordinate, the `cy` attribute for a `circle` 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 `data(dataset)` run once per item in `dataset`. The `d` parameter in the callback function refers to the current item in `dataset`, which is an array for each point. You use bracket notation, like `d[0]`, to access the values in that array.
+
+# --instructions--
+
+Add `cx`, `cy`, and `r` attributes to the `circle` elements. The `cx` value should be the first number in the array for each item in `dataset`. The `cy` 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 `r` value should be `5` for all circles.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+The first `circle` element should have a `cx` value of `34`, a `cy` value of `422`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(0).attr('cx') == '34' &&
+    $('circle').eq(0).attr('cy') == '422' &&
+    $('circle').eq(0).attr('r') == '5'
+);
+```
+
+The second `circle` element should have a `cx` value of `109`, a `cy` value of `220`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(1).attr('cx') == '109' &&
+    $('circle').eq(1).attr('cy') == '220' &&
+    $('circle').eq(1).attr('r') == '5'
+);
+```
+
+The third `circle` element should have a `cx` value of `310`, a `cy` value of `380`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(2).attr('cx') == '310' &&
+    $('circle').eq(2).attr('cy') == '380' &&
+    $('circle').eq(2).attr('r') == '5'
+);
+```
+
+The fourth `circle` element should have a `cx` value of `79`, a `cy` value of `89`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(3).attr('cx') == '79' &&
+    $('circle').eq(3).attr('cy') == '89' &&
+    $('circle').eq(3).attr('r') == '5'
+);
+```
+
+The fifth `circle` element should have a `cx` value of `420`, a `cy` value of `280`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(4).attr('cx') == '420' &&
+    $('circle').eq(4).attr('cy') == '280' &&
+    $('circle').eq(4).attr('r') == '5'
+);
+```
+
+The sixth `circle` element should have a `cx` value of `233`, a `cy` value of `355`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(5).attr('cx') == '233' &&
+    $('circle').eq(5).attr('cy') == '355' &&
+    $('circle').eq(5).attr('r') == '5'
+);
+```
+
+The seventh `circle` element should have a `cx` value of `333`, a `cy` value of `404`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(6).attr('cx') == '333' &&
+    $('circle').eq(6).attr('cy') == '404' &&
+    $('circle').eq(6).attr('r') == '5'
+);
+```
+
+The eighth `circle` element should have a `cx` value of `222`, a `cy` value of `167`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(7).attr('cx') == '222' &&
+    $('circle').eq(7).attr('cy') == '167' &&
+    $('circle').eq(7).attr('r') == '5'
+);
+```
+
+The ninth `circle` element should have a `cx` value of `78`, a `cy` value of `180`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(8).attr('cx') == '78' &&
+    $('circle').eq(8).attr('cy') == '180' &&
+    $('circle').eq(8).attr('r') == '5'
+);
+```
+
+The tenth `circle` element should have a `cx` value of `21`, a `cy` value of `377`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(9).attr('cx') == '21' &&
+    $('circle').eq(9).attr('cy') == '377' &&
+    $('circle').eq(9).attr('r') == '5'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => d[0])
+       .attr("cy", (d) => h - d[1])
+       .attr("r", 5)
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
new file mode 100644
index 0000000000..20dcceba1b
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
@@ -0,0 +1,198 @@
+---
+id: 587d7fad367417b2b2512bdf
+title: Add Axes to a Visualization
+challengeType: 6
+forumTopicId: 301472
+dashedName: add-axes-to-a-visualization
+---
+
+# --description--
+
+Another way to improve the scatter plot is to add an x-axis and a y-axis.
+
+D3 has two methods, `axisLeft()` and `axisBottom()`, to render the y-axis and x-axis, respectively. Here's an example to create the x-axis based on the `xScale` in the previous challenges:
+
+```js
+const xAxis = d3.axisBottom(xScale);
+```
+
+The next step is to render the axis on the SVG canvas. To do so, you can use a general SVG component, the `g` element. The `g` stands for group. Unlike `rect`, `circle`, and `text`, an axis is just a straight line when it's rendered. Because it is a simple shape, using `g` works. The last step is to apply a `transform` 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 `transforms`, but positioning an axis needs `translate`. When it's applied to the `g` element, it moves the whole group over and down by the given amounts. Here's an example:
+
+```js
+const xAxis = d3.axisBottom(xScale);
+
+svg.append("g")
+   .attr("transform", "translate(0, " + (h - padding) + ")")
+   .call(xAxis);
+```
+
+The above code places the x-axis at the bottom of the SVG canvas. Then it's passed as an argument to the `call()` method. The y-axis works in the same way, except the `translate` argument is in the form `(x, 0)`. Because `translate` is a string in the `attr()` method above, you can use concatenation to include variable values for its arguments.
+
+# --instructions--
+
+The scatter plot now has an x-axis. Create a y-axis in a variable named `yAxis` using the `axisLeft()` method. Then render the axis using a `g` element. Make sure to use a `transform` attribute to translate the axis by the amount of padding units right, and `0` units down. Remember to `call()` the axis.
+
+# --hints--
+
+Your code should use the `axisLeft()` method with `yScale` passed as the argument.
+
+```js
+assert(code.match(/\.axisLeft\(yScale\)/g));
+```
+
+The y-axis `g` element should have a `transform` attribute to translate the axis by `(60, 0)`.
+
+```js
+assert(
+  $('g')
+    .eq(10)
+    .attr('transform')
+    .match(/translate\(60\s*?,\s*?0\)/g)
+);
+```
+
+Your code should call the `yAxis`.
+
+```js
+assert(code.match(/\.call\(\s*yAxis\s*\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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);
+    // Add your code below this line
+    const yAxis = undefined;
+    // Add your code above this line
+
+    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>
+```
+
+# --solutions--
+
+```html
+<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);
+    
+    const yAxis = d3.axisLeft(yScale);
+    
+
+    svg.append("g")
+       .attr("transform", "translate(0," + (h - padding) + ")")
+       .call(xAxis);
+
+    svg.append("g")
+       .attr("transform", "translate(" + padding + ",0)")
+       .call(yAxis)
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
new file mode 100644
index 0000000000..a2911cf178
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
@@ -0,0 +1,93 @@
+---
+id: 587d7fa7367417b2b2512bc8
+title: Add Classes with D3
+challengeType: 6
+forumTopicId: 301473
+dashedName: add-classes-with-d3
+---
+
+# --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 `attr()` method to add any HTML attribute to an element, including a class name.
+
+The `attr()` method works the same way that `style()` 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:
+
+```js
+selection.attr("class", "container");
+```
+
+Note that the `class` parameter will remain the same whenever you need to add a class and only the `container` parameter will change.
+
+# --instructions--
+
+Add the `attr()` method to the code in the editor and put a class of `bar` on the `div` elements.
+
+# --hints--
+
+Your `div` elements should have a class of `bar`.
+
+```js
+assert($('div').attr('class').trim().split(/\s+/g).includes('bar'));
+```
+
+Your code should use the `attr()` method.
+
+```js
+assert(code.match(/\.attr/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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
+      .attr("class","bar");
+      // Add your code above this line
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
new file mode 100644
index 0000000000..ea44782e9c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
@@ -0,0 +1,105 @@
+---
+id: 587d7fa6367417b2b2512bc2
+title: Add Document Elements with D3
+challengeType: 6
+forumTopicId: 301474
+dashedName: add-document-elements-with-d3
+---
+
+# --description--
+
+D3 has several methods that let you add and change elements in your document.
+
+The `select()` 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:
+
+```js
+const anchor = d3.select("a");
+```
+
+The above example finds the first anchor tag on the page and saves an HTML node for it in the variable `anchor`. 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 `append()` and `text()`.
+
+The `append()` 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 `text()` 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:
+
+```js
+d3.select("ul")
+  .append("li")
+  .text("Very important item");
+```
+
+D3 allows you to chain several methods together with periods to perform a number of actions in a row.
+
+# --instructions--
+
+Use the `select` method to select the `body` tag in the document. Then `append` an `h1` tag to it, and add the text `Learning D3` into the `h1` element.
+
+# --hints--
+
+The `body` should have one `h1` element.
+
+```js
+assert($('body').children('h1').length == 1);
+```
+
+The `h1` element should have the text `Learning D3` in it.
+
+```js
+assert($('h1').text() == 'Learning D3');
+```
+
+Your code should access the `d3` object.
+
+```js
+assert(code.match(/d3/g));
+```
+
+Your code should use the `select` method.
+
+```js
+assert(code.match(/\.select/g));
+```
+
+Your code should use the `append` method.
+
+```js
+assert(code.match(/\.append/g));
+```
+
+Your code should use the `text` method.
+
+```js
+assert(code.match(/\.text/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    // Add your code below this line
+
+
+
+    // Add your code above this line
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    d3.select("body")
+      .append("h1")
+      .text("Learning D3")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
new file mode 100644
index 0000000000..9c538755d7
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
@@ -0,0 +1,76 @@
+---
+id: 587d7fa7367417b2b2512bc6
+title: Add Inline Styling to Elements
+challengeType: 6
+forumTopicId: 301475
+dashedName: add-inline-styling-to-elements
+---
+
+# --description--
+
+D3 lets you add inline CSS styles on dynamic elements with the `style()` method.
+
+The `style()` method takes a comma-separated key-value pair as an argument. Here's an example to set the selection's text color to blue:
+
+```js
+selection.style("color","blue");
+```
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to make all the displayed text have a `font-family` of `verdana`.
+
+# --hints--
+
+Your `h2` elements should have a `font-family` of `verdana`.
+
+```js
+assert($('h2').css('font-family') == 'verdana');
+```
+
+Your code should use the `style()` method.
+
+```js
+assert(code.match(/\.style/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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"))
+      .style("font-family", "verdana")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
new file mode 100644
index 0000000000..d0da292c76
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
@@ -0,0 +1,153 @@
+---
+id: 587d7faa367417b2b2512bd2
+title: Add Labels to D3 Elements
+challengeType: 6
+forumTopicId: 301476
+dashedName: add-labels-to-d3-elements
+---
+
+# --description--
+
+D3 lets you label a graph element, such as a bar, using the SVG `text` element.
+
+Like the `rect` element, a `text` element needs to have `x` and `y` 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.
+
+# --instructions--
+
+The code in the editor already binds the data to each new `text` element. First, append `text` nodes to the `svg`. Next, add attributes for the `x` and `y` coordinates. They should be calculated the same way as the `rect` ones, except the `y` value for the `text` should make the label sit 3 units higher than the bar. Finally, use the D3 `text()` method to set the label equal to the data point value.
+
+**Note:** For the label to sit higher than the bar, decide if the `y` value for the `text` should be 3 greater or 3 less than the `y` value for the bar.
+
+# --hints--
+
+The first `text` element should have a label of `12` and a `y` value of `61`.
+
+```js
+assert($('text').eq(0).text() == '12' && $('text').eq(0).attr('y') == '61');
+```
+
+The second `text` element should have a label of `31` and a `y` value of `4`.
+
+```js
+assert($('text').eq(1).text() == '31' && $('text').eq(1).attr('y') == '4');
+```
+
+The third `text` element should have a label of `22` and a `y` value of `31`.
+
+```js
+assert($('text').eq(2).text() == '22' && $('text').eq(2).attr('y') == '31');
+```
+
+The fourth `text` element should have a label of `17` and a `y` value of `46`.
+
+```js
+assert($('text').eq(3).text() == '17' && $('text').eq(3).attr('y') == '46');
+```
+
+The fifth `text` element should have a label of `25` and a `y` value of `22`.
+
+```js
+assert($('text').eq(4).text() == '25' && $('text').eq(4).attr('y') == '22');
+```
+
+The sixth `text` element should have a label of `18` and a `y` value of `43`.
+
+```js
+assert($('text').eq(5).text() == '18' && $('text').eq(5).attr('y') == '43');
+```
+
+The seventh `text` element should have a label of `29` and a `y` value of `10`.
+
+```js
+assert($('text').eq(6).text() == '29' && $('text').eq(6).attr('y') == '10');
+```
+
+The eighth `text` element should have a label of `14` and a `y` value of `55`.
+
+```js
+assert($('text').eq(7).text() == '14' && $('text').eq(7).attr('y') == '55');
+```
+
+The ninth `text` element should have a label of `9` and a `y` value of `70`.
+
+```js
+assert($('text').eq(8).text() == '9' && $('text').eq(8).attr('y') == '70');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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()
+       .append("text")
+       .attr("x", (d, i) => i * 30)
+       .attr("y", (d, i) => h - (3 * d) - 3)
+       .text((d) => d)
+  </script>
+<body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
new file mode 100644
index 0000000000..0ad9ff3fba
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
@@ -0,0 +1,224 @@
+---
+id: 587d7fab367417b2b2512bd9
+title: Add Labels to Scatter Plot Circles
+challengeType: 6
+forumTopicId: 301477
+dashedName: add-labels-to-scatter-plot-circles
+---
+
+# --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 (`x`) and second (`y`) fields of each item in `dataset`.
+
+The `text` nodes need `x` and `y` attributes to position it on the SVG canvas. In this challenge, the `y` value (which determines height) can use the same value that the `circle` uses for its `cy` attribute. The `x` value can be slightly larger than the `cx` value of the `circle`, so the label is visible. This will push the label to the right of the plotted point.
+
+# --instructions--
+
+Label each point on the scatter plot using the `text` 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 `x` attribute so it's `5` units more than the value you used for the `cx` attribute on the `circle`. Set the `y` attribute the same way that's used for the `cy` value on the `circle`.
+
+# --hints--
+
+Your code should have 10 `text` elements.
+
+```js
+assert($('text').length == 10);
+```
+
+The first label should have text of `34, 78`, an `x` value of `39`, and a `y` value of `422`.
+
+```js
+assert(
+  $('text').eq(0).text() == '34, 78' &&
+    $('text').eq(0).attr('x') == '39' &&
+    $('text').eq(0).attr('y') == '422'
+);
+```
+
+The second label should have text of `109, 280`, an `x` value of `114`, and a `y` value of `220`.
+
+```js
+assert(
+  $('text').eq(1).text() == '109, 280' &&
+    $('text').eq(1).attr('x') == '114' &&
+    $('text').eq(1).attr('y') == '220'
+);
+```
+
+The third label should have text of `310, 120`, an `x` value of `315`, and a `y` value of `380`.
+
+```js
+assert(
+  $('text').eq(2).text() == '310, 120' &&
+    $('text').eq(2).attr('x') == '315' &&
+    $('text').eq(2).attr('y') == '380'
+);
+```
+
+The fourth label should have text of `79, 411`, an `x` value of `84`, and a `y` value of `89`.
+
+```js
+assert(
+  $('text').eq(3).text() == '79, 411' &&
+    $('text').eq(3).attr('x') == '84' &&
+    $('text').eq(3).attr('y') == '89'
+);
+```
+
+The fifth label should have text of `420, 220`, an `x` value of `425`, and a `y` value of `280`.
+
+```js
+assert(
+  $('text').eq(4).text() == '420, 220' &&
+    $('text').eq(4).attr('x') == '425' &&
+    $('text').eq(4).attr('y') == '280'
+);
+```
+
+The sixth label should have text of `233, 145`, an `x` value of `238`, and a `y` value of `355`.
+
+```js
+assert(
+  $('text').eq(5).text() == '233, 145' &&
+    $('text').eq(5).attr('x') == '238' &&
+    $('text').eq(5).attr('y') == '355'
+);
+```
+
+The seventh label should have text of `333, 96`, an `x` value of `338`, and a `y` value of `404`.
+
+```js
+assert(
+  $('text').eq(6).text() == '333, 96' &&
+    $('text').eq(6).attr('x') == '338' &&
+    $('text').eq(6).attr('y') == '404'
+);
+```
+
+The eighth label should have text of `222, 333`, an `x` value of `227`, and a `y` value of `167`.
+
+```js
+assert(
+  $('text').eq(7).text() == '222, 333' &&
+    $('text').eq(7).attr('x') == '227' &&
+    $('text').eq(7).attr('y') == '167'
+);
+```
+
+The ninth label should have text of `78, 320`, an `x` value of `83`, and a `y` value of `180`.
+
+```js
+assert(
+  $('text').eq(8).text() == '78, 320' &&
+    $('text').eq(8).attr('x') == '83' &&
+    $('text').eq(8).attr('y') == '180'
+);
+```
+
+The tenth label should have text of `21, 123`, an `x` value of `26`, and a `y` value of `377`.
+
+```js
+assert(
+  $('text').eq(9).text() == '21, 123' &&
+    $('text').eq(9).attr('x') == '26' &&
+    $('text').eq(9).attr('y') == '377'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+       .attr("x", (d) => d[0] + 5)
+       .attr("y", (d) => h - d[1])
+       .text((d) => (d[0] + ", " + d[1]))
+       
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
new file mode 100644
index 0000000000..1ed6ae7d5e
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
@@ -0,0 +1,123 @@
+---
+id: 587d7fa7367417b2b2512bc7
+title: Change Styles Based on Data
+challengeType: 6
+forumTopicId: 301479
+dashedName: change-styles-based-on-data
+---
+
+# --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 `style()` method to change the styling for different elements.
+
+For example, you may want to color a data point blue if it has a value less than 20, and red otherwise. You can use a callback function in the `style()` method and include the conditional logic. The callback function uses the `d` parameter to represent the data point:
+
+```js
+selection.style("color", (d) => {
+
+});
+```
+
+The `style()` method is not limited to setting the `color` - it can be used with other CSS properties as well.
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to set the `color` of the `h2` elements conditionally. Write the callback function so if the data value is less than 20, it returns red, otherwise it returns green.
+
+**Note:** You can use if-else logic, or the ternary operator.
+
+# --hints--
+
+The first `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(0).css('color') == 'rgb(255, 0, 0)');
+```
+
+The second `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(1).css('color') == 'rgb(0, 128, 0)');
+```
+
+The third `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(2).css('color') == 'rgb(0, 128, 0)');
+```
+
+The fourth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(3).css('color') == 'rgb(255, 0, 0)');
+```
+
+The fifth `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(4).css('color') == 'rgb(0, 128, 0)');
+```
+
+The sixth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(5).css('color') == 'rgb(255, 0, 0)');
+```
+
+The seventh `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(6).css('color') == 'rgb(0, 128, 0)');
+```
+
+The eighth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(7).css('color') == 'rgb(255, 0, 0)');
+```
+
+The ninth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(8).css('color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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"))
+      .style("color", (d) => d < 20 ? "red" : "green")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
new file mode 100644
index 0000000000..4e0d47f93c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fa9367417b2b2512bd1
+title: Change the Color of an SVG Element
+challengeType: 6
+forumTopicId: 301480
+dashedName: change-the-color-of-an-svg-element
+---
+
+# --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 `rect` shape is colored with the `fill` attribute. It supports hex codes, color names, and rgb values, as well as more complex options like gradients and transparency.
+
+# --instructions--
+
+Add an `attr()` method to set the `fill` of all the bars to the color navy.
+
+# --hints--
+
+The bars should all have a `fill` color of navy.
+
+```js
+assert($('rect').css('fill') == 'rgb(0, 0, 128)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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");
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
new file mode 100644
index 0000000000..9112736602
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
@@ -0,0 +1,161 @@
+---
+id: 587d7fa8367417b2b2512bca
+title: Change the Presentation of a Bar Chart
+challengeType: 6
+forumTopicId: 301481
+dashedName: change-the-presentation-of-a-bar-chart
+---
+
+# --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 `bar` 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
+
+# --instructions--
+
+First, add a `margin` of `2px` to the `bar` class in the `style` tag. Next, change the callback function in the `style()` method so it returns a value `10` times the original data value (plus the `px`).
+
+**Note:** Multiplying each data point by the *same* constant only alters the scale. It's like zooming in, and it doesn't change the meaning of the underlying data.
+
+# --hints--
+
+The first `div` should have a `height` of `120` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(0).css('height') == '120px' &&
+    $('div').eq(0).css('margin-right') == '2px'
+);
+```
+
+The second `div` should have a `height` of `310` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(1).css('height') == '310px' &&
+    $('div').eq(1).css('margin-right') == '2px'
+);
+```
+
+The third `div` should have a `height` of `220` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(2).css('height') == '220px' &&
+    $('div').eq(2).css('margin-right') == '2px'
+);
+```
+
+The fourth `div` should have a `height` of `170` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(3).css('height') == '170px' &&
+    $('div').eq(3).css('margin-right') == '2px'
+);
+```
+
+The fifth `div` should have a `height` of `250` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(4).css('height') == '250px' &&
+    $('div').eq(4).css('margin-right') == '2px'
+);
+```
+
+The sixth `div` should have a `height` of `180` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(5).css('height') == '180px' &&
+    $('div').eq(5).css('margin-right') == '2px'
+);
+```
+
+The seventh `div` should have a `height` of `290` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(6).css('height') == '290px' &&
+    $('div').eq(6).css('margin-right') == '2px'
+);
+```
+
+The eighth `div` should have a `height` of `140` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(7).css('height') == '140px' &&
+    $('div').eq(7).css('margin-right') == '2px'
+);
+```
+
+The ninth `div` should have a `height` of `90` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(8).css('height') == '90px' &&
+    $('div').eq(8).css('margin-right') == '2px'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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")
+      .style("height", (d) => (d + "px")) // Change this line
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<style>
+  .bar {
+    width: 25px;
+    height: 100px;
+    margin: 2px;
+    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")
+      .style("height", (d) => (d * 10 + "px"))
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
new file mode 100644
index 0000000000..e988030673
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
@@ -0,0 +1,110 @@
+---
+id: 587d7fa8367417b2b2512bcd
+title: Create a Bar for Each Data Point in the Set
+challengeType: 6
+forumTopicId: 301482
+dashedName: create-a-bar-for-each-data-point-in-the-set
+---
+
+# --description--
+
+The last challenge added only one rectangle to the `svg` element to represent a bar. Here, you'll combine what you've learned so far about `data()`, `enter()`, and SVG shapes to create and append a rectangle for each data point in `dataset`.
+
+A previous challenge showed the format for how to create and append a `div` for each item in `dataset`:
+
+```js
+d3.select("body").selectAll("div")
+  .data(dataset)
+  .enter()
+  .append("div")
+```
+
+There are a few differences working with `rect` elements instead of `div` elements. The `rect` elements must be appended to an `svg` element, not directly to the `body`. Also, you need to tell D3 where to place each `rect` within the `svg` area. The bar placement will be covered in the next challenge.
+
+# --instructions--
+
+Use the `data()`, `enter()`, and `append()` methods to create and append a `rect` for each item in `dataset`. The bars should display all on top of each other; this will be fixed in the next challenge.
+
+# --hints--
+
+Your document should have 9 `rect` elements.
+
+```js
+assert($('rect').length == 9);
+```
+
+Your code should use the `data()` method.
+
+```js
+assert(code.match(/\.data/g));
+```
+
+Your code should use the `enter()` method.
+
+```js
+assert(code.match(/\.enter/g));
+```
+
+Your code should use the `append()` method.
+
+```js
+assert(code.match(/\.append/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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", 0)
+       .attr("y", 0)
+       .attr("width", 25)
+       .attr("height", 100);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
new file mode 100644
index 0000000000..d118740df6
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fab367417b2b2512bda
+title: Create a Linear Scale with D3
+challengeType: 6
+forumTopicId: 301483
+dashedName: create-a-linear-scale-with-d3
+---
+
+# --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. `scales` 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 `x` and `y` 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 `scaleLinear()`:
+
+```js
+const scale = d3.scaleLinear()
+```
+
+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.
+
+# --instructions--
+
+Change the `scale` variable to create a linear scale. Then set the `output` variable to the scale called with an input argument of `50`.
+
+# --hints--
+
+The text in the `h2` should be `50`.
+
+```js
+assert($('h2').text() == '50');
+```
+
+Your code should use the `scaleLinear()` method.
+
+```js
+assert(code.match(/\.scaleLinear/g));
+```
+
+The `output` variable should call `scale` with an argument of `50`.
+
+```js
+assert(output == 50 && code.match(/scale\(\s*?50\s*?\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    // Add your code below this line
+
+    const scale = undefined; // Create the scale here
+    const output = scale(); // Call scale with an argument here
+
+    // Add your code above this line
+
+    d3.select("body")
+      .append("h2")
+      .text(output);
+
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+
+    const scale = d3.scaleLinear();
+    const output = scale(50); 
+
+    d3.select("body")
+      .append("h2")
+      .text(output);
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
new file mode 100644
index 0000000000..5f4bd1e056
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
@@ -0,0 +1,103 @@
+---
+id: 587d7fab367417b2b2512bd7
+title: Create a Scatterplot with SVG Circles
+challengeType: 6
+forumTopicId: 301484
+dashedName: create-a-scatterplot-with-svg-circles
+---
+
+# --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 `x` and `y` axes, and are used to position the circle in the visualization.
+
+SVG has a `circle` tag to create the circle shape. It works a lot like the `rect` elements you used for the bar chart.
+
+# --instructions--
+
+Use the `data()`, `enter()`, and `append()` methods to bind `dataset` to new `circle` elements that are appended to the SVG canvas.
+
+**Note:** The circles won't be visible because we haven't set their attributes yet. We'll do that in the next challenge.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
new file mode 100644
index 0000000000..71a39ddaf1
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
@@ -0,0 +1,103 @@
+---
+id: 587d7fa8367417b2b2512bcc
+title: Display Shapes with SVG
+challengeType: 6
+forumTopicId: 301485
+dashedName: display-shapes-with-svg
+---
+
+# --description--
+
+The last challenge created an `svg` element with a given width and height, which was visible because it had a `background-color` applied to it in the `style` tag. The code made space for the given width and height.
+
+The next step is to create a shape to put in the `svg` 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 (`<rect>`) SVG shape could create a bar in a bar chart.
+
+When you place a shape into the `svg` area, you can specify where it goes with `x` and `y` coordinates. The origin point of (0, 0) is in the upper-left corner. Positive values for `x` push the shape to the right, and positive values for `y` push the shape down from the origin point.
+
+To place a shape in the middle of the 500 (width) x 100 (height) `svg` from last challenge, the `x` coordinate would be 250 and the `y` coordinate would be 50.
+
+An SVG `rect` has four attributes. There are the `x` and `y` coordinates for where it is placed in the `svg` area. It also has a `height` and `width` to specify the size.
+
+# --instructions--
+
+Add a `rect` shape to the `svg` using `append()`, and give it a `width` attribute of `25` and `height` attribute of `100`. Also, give the `rect` `x` and `y` attributes each set to `0`.
+
+# --hints--
+
+Your document should have 1 `rect` element.
+
+```js
+assert($('rect').length == 1);
+```
+
+The `rect` element should have a `width` attribute set to `25`.
+
+```js
+assert($('rect').attr('width') == '25');
+```
+
+The `rect` element should have a `height` attribute set to `100`.
+
+```js
+assert($('rect').attr('height') == '100');
+```
+
+The `rect` element should have an `x` attribute set to `0`.
+
+```js
+assert($('rect').attr('x') == '0');
+```
+
+The `rect` element should have a `y` attribute set to `0`.
+
+```js
+assert($('rect').attr('y') == '0');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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)
+                  .append("rect")
+                  .attr("width", 25)
+                  .attr("height", 100)
+                  .attr("x", 0)
+                  .attr("y", 0);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
new file mode 100644
index 0000000000..33463161a2
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
@@ -0,0 +1,145 @@
+---
+id: 587d7fa9367417b2b2512bcf
+title: Dynamically Change the Height of Each Bar
+challengeType: 6
+forumTopicId: 301486
+dashedName: dynamically-change-the-height-of-each-bar
+---
+
+# --description--
+
+The height of each bar can be set to the value of the data point in the array, similar to how the `x` value was set dynamically.
+
+```js
+selection.attr("property", (d, i) => {
+
+})
+```
+
+Here `d` would be the data point value, and `i` would be the index of the data point in the array.
+
+# --instructions--
+
+Change the callback function for the `height` attribute to return the data value times 3.
+
+**Note:** 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.
+
+# --hints--
+
+The first `rect` should have a `height` of `36`.
+
+```js
+assert($('rect').eq(0).attr('height') == '36');
+```
+
+The second `rect` should have a `height` of `93`.
+
+```js
+assert($('rect').eq(1).attr('height') == '93');
+```
+
+The third `rect` should have a `height` of `66`.
+
+```js
+assert($('rect').eq(2).attr('height') == '66');
+```
+
+The fourth `rect` should have a `height` of `51`.
+
+```js
+assert($('rect').eq(3).attr('height') == '51');
+```
+
+The fifth `rect` should have a `height` of `75`.
+
+```js
+assert($('rect').eq(4).attr('height') == '75');
+```
+
+The sixth `rect` should have a `height` of `54`.
+
+```js
+assert($('rect').eq(5).attr('height') == '54');
+```
+
+The seventh `rect` should have a `height` of `87`.
+
+```js
+assert($('rect').eq(6).attr('height') == '87');
+```
+
+The eighth `rect` should have a `height` of `42`.
+
+```js
+assert($('rect').eq(7).attr('height') == '42');
+```
+
+The ninth `rect` should have a `height` of `27`.
+
+```js
+assert($('rect').eq(8).attr('height') == '27');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => {
+         return d * 3
+       });
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
new file mode 100644
index 0000000000..ad10065163
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
@@ -0,0 +1,151 @@
+---
+id: 587d7fa9367417b2b2512bce
+title: Dynamically Set the Coordinates for Each Bar
+challengeType: 6
+forumTopicId: 301487
+dashedName: dynamically-set-the-coordinates-for-each-bar
+---
+
+# --description--
+
+The last challenge created and appended a rectangle to the `svg` element for each point in `dataset` to represent a bar. Unfortunately, they were all stacked on top of each other.
+
+The placement of a rectangle is handled by the `x` and `y` attributes. They tell D3 where to start drawing the shape in the `svg` 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 `y` value stays the same (at 0) for all bars. The `x` value, however, needs to change as you add new bars. Remember that larger `x` values push items farther to the right. As you go through the array elements in `dataset`, the `x` value should increase.
+
+The `attr()` 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 `d`) and one for the index of the data point in the array. The second argument for the index is optional. Here's the format:
+
+```js
+selection.attr("property", (d, i) => {
+
+})
+```
+
+It's important to note that you do NOT need to write a `for` loop or use `forEach()` to iterate over the items in the data set. Recall that the `data()` method parses the data set, and any method that's chained after `data()` is run once for each item in the data set.
+
+# --instructions--
+
+Change the `x` attribute callback function so it returns the index times 30.
+
+**Note:** Each bar has a width of 25, so increasing each `x` value by 30 adds some space between the bars. Any value greater than 25 would work in this example.
+
+# --hints--
+
+The first `rect` should have an `x` value of `0`.
+
+```js
+assert($('rect').eq(0).attr('x') == '0');
+```
+
+The second `rect` should have an `x` value of `30`.
+
+```js
+assert($('rect').eq(1).attr('x') == '30');
+```
+
+The third `rect` should have an `x` value of `60`.
+
+```js
+assert($('rect').eq(2).attr('x') == '60');
+```
+
+The fourth `rect` should have an `x` value of `90`.
+
+```js
+assert($('rect').eq(3).attr('x') == '90');
+```
+
+The fifth `rect` should have an `x` value of `120`.
+
+```js
+assert($('rect').eq(4).attr('x') == '120');
+```
+
+The sixth `rect` should have an `x` value of `150`.
+
+```js
+assert($('rect').eq(5).attr('x') == '150');
+```
+
+The seventh `rect` should have an `x` value of `180`.
+
+```js
+assert($('rect').eq(6).attr('x') == '180');
+```
+
+The eighth `rect` should have an `x` value of `210`.
+
+```js
+assert($('rect').eq(7).attr('x') == '210');
+```
+
+The ninth `rect` should have an `x` value of `240`.
+
+```js
+assert($('rect').eq(8).attr('x') == '240');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => {
+         return i * 30
+       })
+       .attr("y", 0)
+       .attr("width", 25)
+       .attr("height", 100);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
new file mode 100644
index 0000000000..66156ef887
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
@@ -0,0 +1,143 @@
+---
+id: 587d7fa9367417b2b2512bd0
+title: Invert SVG Elements
+challengeType: 6
+forumTopicId: 301488
+dashedName: invert-svg-elements
+---
+
+# --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 `x` coordinate of 0 places a shape on the left edge of the SVG area. A `y` coordinate of 0 places a shape on the top edge of the SVG area. Higher `x` values push the rectangle to the right. Higher `y` values push the rectangle down.
+
+To make the bars right-side-up, you need to change the way the `y` 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 `y` coordinate needs a value of 100. If the data point value were 1, you would start with a `y` 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 `y` coordinate would be 99.
+
+The `y` coordinate that is `y = heightOfSVG - heightOfBar` would place the bars right-side-up.
+
+# --instructions--
+
+Change the callback function for the `y` attribute to set the bars right-side-up. Remember that the `height` of the bar is 3 times the data value `d`.
+
+**Note:** In general, the relationship is `y = h - m * d`, where `m` is the constant that scales the data points.
+
+# --hints--
+
+The first `rect` should have a `y` value of `64`.
+
+```js
+assert($('rect').eq(0).attr('y') == h - dataset[0] * 3);
+```
+
+The second `rect` should have a `y` value of `7`.
+
+```js
+assert($('rect').eq(1).attr('y') == h - dataset[1] * 3);
+```
+
+The third `rect` should have a `y` value of `34`.
+
+```js
+assert($('rect').eq(2).attr('y') == h - dataset[2] * 3);
+```
+
+The fourth `rect` should have a `y` value of `49`.
+
+```js
+assert($('rect').eq(3).attr('y') == h - dataset[3] * 3);
+```
+
+The fifth `rect` should have a `y` value of `25`.
+
+```js
+assert($('rect').eq(4).attr('y') == h - dataset[4] * 3);
+```
+
+The sixth `rect` should have a `y` value of `46`.
+
+```js
+assert($('rect').eq(5).attr('y') == h - dataset[5] * 3);
+```
+
+The seventh `rect` should have a `y` value of `13`.
+
+```js
+assert($('rect').eq(6).attr('y') == h - dataset[6] * 3);
+```
+
+The eighth `rect` should have a `y` value of `58`.
+
+```js
+assert($('rect').eq(7).attr('y') == h - dataset[7] * 3);
+```
+
+The ninth `rect` should have a `y` value of `73`.
+
+```js
+assert($('rect').eq(8).attr('y') == h - dataset[8] * 3);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
new file mode 100644
index 0000000000..f5fba672e9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
@@ -0,0 +1,93 @@
+---
+id: 587d7fa8367417b2b2512bcb
+title: Learn About SVG in D3
+challengeType: 6
+forumTopicId: 301489
+dashedName: learn-about-svg-in-d3
+---
+
+# --description--
+
+<dfn>SVG</dfn> stands for <dfn>Scalable Vector Graphics</dfn>.
+
+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 `svg` tag.
+
+CSS can be scalable when styles use relative units (such as `vh`, `vw`, or percentages), but using SVG is more flexible to build data visualizations.
+
+# --instructions--
+
+Add an `svg` node to the `body` using `append()`. Give it a `width` attribute set to the provided `w` constant and a `height` attribute set to the provided `h` constant using the `attr()` or `style()` methods for each. You'll see it in the output because there's a `background-color` of pink applied to it in the `style` tag.
+
+**Note:** When using `attr()` 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.
+
+# --hints--
+
+Your document should have 1 `svg` element.
+
+```js
+assert($('svg').length == 1);
+```
+
+The `svg` element should have a `width` attribute set to `500` or styled to have a width of `500px`.
+
+```js
+assert($('svg').attr('width') == '500' || $('svg').css('width') == '500px');
+```
+
+The `svg` element should have a `height` attribute set to `100` or styled to have a height of `100px`.
+
+```js
+assert($('svg').attr('height') == '100' || $('svg').css('height') == '100px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+                  .append("svg")
+                  .attr("width", w)
+                  .attr("height", h)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
new file mode 100644
index 0000000000..bf0acc7b43
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
@@ -0,0 +1,82 @@
+---
+id: 587d7fa6367417b2b2512bc3
+title: Select a Group of Elements with D3
+challengeType: 6
+forumTopicId: 301490
+dashedName: select-a-group-of-elements-with-d3
+---
+
+# --description--
+
+D3 also has the `selectAll()` 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:
+
+```js
+const anchors = d3.selectAll("a");
+```
+
+Like the `select()` method, `selectAll()` supports method chaining, and you can use it with other methods.
+
+# --instructions--
+
+Select all of the `li` tags in the document, and change their text to the string `list item` by chaining the `.text()` method.
+
+# --hints--
+
+There should be 3 `li` elements on the page, and the text in each one should say `list item`. Capitalization and spacing should match exactly.
+
+```js
+assert(
+  $('li')
+    .text()
+    .match(/list item/g).length == 3
+);
+```
+
+Your code should access the `d3` object.
+
+```js
+assert(code.match(/d3/g));
+```
+
+Your code should use the `selectAll` method.
+
+```js
+assert(code.match(/\.selectAll/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <ul>
+    <li>Example</li>
+    <li>Example</li>
+    <li>Example</li>
+  </ul>
+  <script>
+    d3.selectAll("li")
+      .text("list item")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
new file mode 100644
index 0000000000..5a678c5dd0
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
@@ -0,0 +1,106 @@
+---
+id: 587d7fac367417b2b2512bdb
+title: Set a Domain and a Range on a Scale
+challengeType: 6
+forumTopicId: 301491
+dashedName: set-a-domain-and-a-range-on-a-scale
+---
+
+# --description--
+
+By default, scales use the identity relationship. This means the input value maps to the output value. However, scales can be much more flexible and interesting.
+
+Say a dataset has values ranging from 50 to 480. This is the input information for a scale, also known as the <dfn>domain</dfn>.
+
+You want to map those points along the `x` axis on the SVG canvas, between 10 units and 500 units. This is the output information, also known as the <dfn>range</dfn>.
+
+The `domain()` and `range()` methods set these values for the scale. Both methods take an array of at least two elements as an argument. Here's an example:
+
+```js
+scale.domain([50, 480]);
+scale.range([10, 500]);
+scale(50)
+scale(480)
+scale(325)
+scale(750)
+d3.scaleLinear()
+```
+
+In order, the following values would be displayed in the console: `10`, `500`, `323.37`, and `807.67`.
+
+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.
+
+# --instructions--
+
+Create a scale and set its domain to `[250, 500]` and range to `[10, 150]`.
+
+**Note:** You can chain the `domain()` and `range()` methods onto the `scale` variable.
+
+# --hints--
+
+Your code should use the `domain()` method.
+
+```js
+assert(code.match(/\.domain/g));
+```
+
+The `domain()` of the `scale` should be set to `[250, 500]`.
+
+```js
+assert(JSON.stringify(scale.domain()) == JSON.stringify([250, 500]));
+```
+
+Your code should use the `range()` method.
+
+```js
+assert(code.match(/\.range/g));
+```
+
+The `range()` of the `scale` should be set to `[10, 150]`.
+
+```js
+assert(JSON.stringify(scale.range()) == JSON.stringify([10, 150]));
+```
+
+The text in the `h2` should be `-102`.
+
+```js
+assert($('h2').text() == '-102');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const scale = d3.scaleLinear();
+    scale.domain([250, 500])
+    scale.range([10, 150])
+    const output = scale(50);
+    d3.select("body")
+      .append("h2")
+      .text(output);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/style-d3-labels.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
new file mode 100644
index 0000000000..934932f51f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
@@ -0,0 +1,110 @@
+---
+id: 587d7faa367417b2b2512bd3
+title: Style D3 Labels
+challengeType: 6
+forumTopicId: 301492
+dashedName: style-d3-labels
+---
+
+# --description--
+
+D3 methods can add styles to the bar labels. The `fill` attribute sets the color of the text for a `text` node. The `style()` method sets CSS rules for other styles, such as `font-family` or `font-size`.
+
+# --instructions--
+
+Set the `font-size` of the `text` elements to `25px`, and the color of the text to red.
+
+# --hints--
+
+The labels should all have a `fill` color of red.
+
+```js
+assert($('text').css('fill') == 'rgb(255, 0, 0)');
+```
+
+The labels should all have a `font-size` of `25` pixels.
+
+```js
+assert($('text').css('font-size') == '25px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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)
+       .style("font-size", 25)
+       .attr("fill", "red")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
new file mode 100644
index 0000000000..27dd13a1b9
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
@@ -0,0 +1,137 @@
+---
+id: 587d7fa8367417b2b2512bc9
+title: Update the Height of an Element Dynamically
+challengeType: 6
+forumTopicId: 301493
+dashedName: update-the-height-of-an-element-dynamically
+---
+
+# --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 `div` for each data point in the array
+
+2) Give each `div` a dynamic height, using a callback function in the `style()` method that sets height equal to the data value
+
+Recall the format to set a style using a callback function:
+
+```js
+selection.style("cssProperty", (d) => d)
+```
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to set the `height` property for each element. Use a callback function to return the value of the data point with the string `px` added to it.
+
+# --hints--
+
+The first `div` should have a `height` of `12` pixels.
+
+```js
+assert($('div').eq(0)[0].style.height === '12px');
+```
+
+The second `div` should have a `height` of `31` pixels.
+
+```js
+assert($('div').eq(1)[0].style.height === '31px');
+```
+
+The third `div` should have a `height` of `22` pixels.
+
+```js
+assert($('div').eq(2)[0].style.height === '22px');
+```
+
+The fourth `div` should have a `height` of `17` pixels.
+
+```js
+assert($('div').eq(3)[0].style.height === '17px');
+```
+
+The fifth `div` should have a `height` of `25` pixels.
+
+```js
+assert($('div').eq(4)[0].style.height === '25px');
+```
+
+The sixth `div` should have a `height` of `18` pixels.
+
+```js
+assert($('div').eq(5)[0].style.height === '18px');
+```
+
+The seventh `div` should have a `height` of `29` pixels.
+
+```js
+assert($('div').eq(6)[0].style.height === '29px');
+```
+
+The eighth `div` should have a `height` of `14` pixels.
+
+```js
+assert($('div').eq(7)[0].style.height === '14px');
+```
+
+The ninth `div` should have a `height` of `9` pixels.
+
+```js
+assert($('div').eq(8)[0].style.height === '9px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+      .style('height', d => `${d}px`)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
new file mode 100644
index 0000000000..e02248743c
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
@@ -0,0 +1,347 @@
+---
+id: 587d7fac367417b2b2512bde
+title: Use a Pre-Defined Scale to Place Elements
+challengeType: 6
+forumTopicId: 301494
+dashedName: use-a-pre-defined-scale-to-place-elements
+---
+
+# --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 `x` and `y` attributes for `rect` or `text` elements, or `cx` and `cy` for `circles`. Here's an example:
+
+```js
+shape
+  .attr("x", (d) => xScale(d[0]))
+```
+
+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 `text()` method for a tooltip or label.
+
+# --instructions--
+
+Use `xScale` and `yScale` to position both the `circle` and `text` shapes onto the SVG canvas. For the `circles`, apply the scales to set the `cx` and `cy` attributes. Give them a radius of `5` units, too.
+
+For the `text` elements, apply the scales to set the `x` and `y` 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 `xScale`.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+The first `circle` element should have a `cx` value of approximately `91` and a `cy` value of approximately `368` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(0).attr('cx')) == '91' &&
+    Math.round($('circle').eq(0).attr('cy')) == '368' &&
+    $('circle').eq(0).attr('r') == '5'
+);
+```
+
+The second `circle` element should have a `cx` value of approximately `159` and a `cy` value of approximately `181` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(1).attr('cx')) == '159' &&
+    Math.round($('circle').eq(1).attr('cy')) == '181' &&
+    $('circle').eq(1).attr('r') == '5'
+);
+```
+
+The third `circle` element should have a `cx` value of approximately `340` and a `cy` value of approximately `329` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(2).attr('cx')) == '340' &&
+    Math.round($('circle').eq(2).attr('cy')) == '329' &&
+    $('circle').eq(2).attr('r') == '5'
+);
+```
+
+The fourth `circle` element should have a `cx` value of approximately `131` and a `cy` value of approximately `60` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(3).attr('cx')) == '131' &&
+    Math.round($('circle').eq(3).attr('cy')) == '60' &&
+    $('circle').eq(3).attr('r') == '5'
+);
+```
+
+The fifth `circle` element should have a `cx` value of approximately `440` and a `cy` value of approximately `237` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(4).attr('cx')) == '440' &&
+    Math.round($('circle').eq(4).attr('cy')) == '237' &&
+    $('circle').eq(4).attr('r') == '5'
+);
+```
+
+The sixth `circle` element should have a `cx` value of approximately `271` and a `cy` value of approximately `306` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(5).attr('cx')) == '271' &&
+    Math.round($('circle').eq(5).attr('cy')) == '306' &&
+    $('circle').eq(5).attr('r') == '5'
+);
+```
+
+The seventh `circle` element should have a `cx` value of approximately `361` and a `cy` value of approximately `351` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(6).attr('cx')) == '361' &&
+    Math.round($('circle').eq(6).attr('cy')) == '351' &&
+    $('circle').eq(6).attr('r') == '5'
+);
+```
+
+The eighth `circle` element should have a `cx` value of approximately `261` and a `cy` value of approximately `132` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(7).attr('cx')) == '261' &&
+    Math.round($('circle').eq(7).attr('cy')) == '132' &&
+    $('circle').eq(7).attr('r') == '5'
+);
+```
+
+The ninth `circle` element should have a `cx` value of approximately `131` and a `cy` value of approximately `144` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(8).attr('cx')) == '131' &&
+    Math.round($('circle').eq(8).attr('cy')) == '144' &&
+    $('circle').eq(8).attr('r') == '5'
+);
+```
+
+The tenth `circle` element should have a `cx` value of approximately `79` and a `cy` value of approximately `326` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(9).attr('cx')) == '79' &&
+    Math.round($('circle').eq(9).attr('cy')) == '326' &&
+    $('circle').eq(9).attr('r') == '5'
+);
+```
+
+Your code should have 10 `text` elements.
+
+```js
+assert($('text').length == 10);
+```
+
+The first label should have an `x` value of approximately `100` and a `y` value of approximately `368` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(0).attr('x')) == '100' &&
+    Math.round($('text').eq(0).attr('y')) == '368'
+);
+```
+
+The second label should have an `x` value of approximately `168` and a `y` value of approximately `181` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(1).attr('x')) == '168' &&
+    Math.round($('text').eq(1).attr('y')) == '181'
+);
+```
+
+The third label should have an `x` value of approximately `350` and a `y` value of approximately `329` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(2).attr('x')) == '350' &&
+    Math.round($('text').eq(2).attr('y')) == '329'
+);
+```
+
+The fourth label should have an `x` value of approximately `141` and a `y` value of approximately `60` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(3).attr('x')) == '141' &&
+    Math.round($('text').eq(3).attr('y')) == '60'
+);
+```
+
+The fifth label should have an `x` value of approximately `449` and a `y` value of approximately `237` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(4).attr('x')) == '449' &&
+    Math.round($('text').eq(4).attr('y')) == '237'
+);
+```
+
+The sixth label should have an `x` value of approximately `280` and a `y` value of approximately `306` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(5).attr('x')) == '280' &&
+    Math.round($('text').eq(5).attr('y')) == '306'
+);
+```
+
+The seventh label should have an `x` value of approximately `370` and a `y` value of approximately `351` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(6).attr('x')) == '370' &&
+    Math.round($('text').eq(6).attr('y')) == '351'
+);
+```
+
+The eighth label should have an `x` value of approximately `270` and a `y` value of approximately `132` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(7).attr('x')) == '270' &&
+    Math.round($('text').eq(7).attr('y')) == '132'
+);
+```
+
+The ninth label should have an `x` value of approximately `140` and a `y` value of approximately `144` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(8).attr('x')) == '140' &&
+    Math.round($('text').eq(8).attr('y')) == '144'
+);
+```
+
+The tenth label should have an `x` value of approximately `88` and a `y` value of approximately `326` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(9).attr('x')) == '88' &&
+    Math.round($('text').eq(9).attr('y')) == '326'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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", 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]))
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
new file mode 100644
index 0000000000..92889986bd
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
@@ -0,0 +1,156 @@
+---
+id: 587d7fac367417b2b2512bdd
+title: Use Dynamic Scales
+challengeType: 6
+forumTopicId: 301495
+dashedName: use-dynamic-scales
+---
+
+# --description--
+
+The D3 `min()` and `max()` 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 `domain()` method passes information to the scale about the raw data values for the plot. The `range()` 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 `max()` method with a callback function based on the x values in the arrays. The range uses the SVG canvas' width (`w`), but it includes some padding, too. This puts space between the scatter plot dots and the edge of the SVG canvas.
+
+```js
+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 = 30;
+const xScale = d3.scaleLinear()
+  .domain([0, d3.max(dataset, (d) => d[0])])
+  .range([padding, w - padding]);
+```
+
+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 `range()` method forces the plot to start at 30 along that line (instead of 0), and end at 470 (instead of 500).
+
+# --instructions--
+
+Use the `yScale` 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 (`h`) and include padding.
+
+**Note:** 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.
+
+# --hints--
+
+The text in the `h2` should be `30`.
+
+```js
+assert(output == 30 && $('h2').text() == '30');
+```
+
+The `domain()` of yScale should be equivalent to `[0, 411]`.
+
+```js
+assert(JSON.stringify(yScale.domain()) == JSON.stringify([0, 411]));
+```
+
+The `range()` of yScale should be equivalent to `[470, 30]`.
+
+```js
+assert(JSON.stringify(yScale.range()) == JSON.stringify([470, 30]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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 = 30;
+
+    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 output = yScale(411);
+    d3.select("body")
+      .append("h2")
+      .text(output)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
new file mode 100644
index 0000000000..786b313b21
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
@@ -0,0 +1,91 @@
+---
+id: 587d7fac367417b2b2512bdc
+title: >-
+  Use the d3.max and d3.min Functions to Find Minimum and Maximum Values in a
+  Dataset
+challengeType: 6
+forumTopicId: 301496
+dashedName: >-
+  use-the-d3-max-and-d3-min-functions-to-find-minimum-and-maximum-values-in-a-dataset
+---
+
+# --description--
+
+The D3 methods `domain()` and `range()` 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 - `min()` and `max()` to return this information. Here's an example:
+
+```js
+const exampleData = [34, 234, 73, 90, 6, 52];
+d3.min(exampleData)
+d3.max(exampleData)
+```
+
+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 `min()` and `max()` methods take a callback function. In this example, the callback function's argument `d` 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:
+
+```js
+const locationData = [[1, 7],[6, 3],[8, 3]];
+const minX = d3.min(locationData, (d) => d[0]);
+```
+
+`minX` would have the value `1`.
+
+# --instructions--
+
+The `positionData` array holds sub arrays of x, y, and z coordinates. Use a D3 method to find the maximum value of the z coordinate (the third value) from the arrays and save it in the `output` variable.
+
+# --hints--
+
+The text in the `h2` should be `8`.
+
+```js
+assert(output == 8 && $('h2').text() == '8');
+```
+
+Your code should use the `max()` method.
+
+```js
+assert(
+  code.match(/\.max/g),
+  'Your code should use the <code>max()</code> method.'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    const positionData = [[1, 7, -4],[6, 3, 8],[2, 9, 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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const positionData = [[1, 7, -4],[6, 3, 8],[2, 9, 3]]
+
+    const output = d3.max(positionData, (d) => d[2])
+
+    d3.select("body")
+      .append("h2")
+      .text(output)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
new file mode 100644
index 0000000000..bcf31464ca
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
@@ -0,0 +1,105 @@
+---
+id: 587d7fa7367417b2b2512bc4
+title: Work with Data in D3
+challengeType: 6
+forumTopicId: 301497
+dashedName: work-with-data-in-d3
+---
+
+# --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 `data()` 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 `enter()` method for this purpose.
+
+When `enter()` is combined with the `data()` 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 `ul` element and creates a new list item based on the number of entries in the array:
+
+```html
+<body>
+  <ul></ul>
+  <script>
+    const dataset = ["a", "b", "c"];
+    d3.select("ul").selectAll("li")
+      .data(dataset)
+      .enter()
+      .append("li")
+      .text("New item");
+  </script>
+</body>
+```
+
+It may seem confusing to select elements that don't exist yet. This code is telling D3 to first select the `ul` on the page. Next, select all list items, which returns an empty selection. Then the `data()` method reviews the dataset and runs the following code three times, once for each item in the array. The `enter()` method sees there are no `li` elements on the page, but it needs 3 (one for each piece of data in `dataset`). New `li` elements are appended to the `ul` and have the text `New item`.
+
+# --instructions--
+
+Select the `body` node, then select all `h2` elements. Have D3 create and append an `h2` tag for each item in the `dataset` array. The text in the `h2` should say `New Title`. Your code should use the `data()` and `enter()` methods.
+
+# --hints--
+
+Your document should have 9 `h2` elements.
+
+```js
+assert($('h2').length == 9);
+```
+
+The text in the `h2` elements should say `New Title`. The capitalization and spacing should match exactly.
+
+```js
+assert(
+  $('h2')
+    .text()
+    .match(/New Title/g).length == 9
+);
+```
+
+Your code should use the `data()` method.
+
+```js
+assert(code.match(/\.data/g));
+```
+
+Your code should use the `enter()` method.
+
+```js
+assert(code.match(/\.enter/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];
+
+    d3.select("body")
+      .selectAll("h2")
+      .data(dataset)
+      .enter()
+      .append("h2")
+      .text("New Title")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
new file mode 100644
index 0000000000..3b4a59ff1f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
@@ -0,0 +1,122 @@
+---
+id: 587d7fa7367417b2b2512bc5
+title: Work with Dynamic Data in D3
+challengeType: 6
+forumTopicId: 301498
+dashedName: work-with-dynamic-data-in-d3
+---
+
+# --description--
+
+The last two challenges cover the basics of displaying data dynamically with D3 using the `data()` and `enter()` methods. These methods take a data set and, together with the `append()` method, create a new DOM element for each entry in the data set.
+
+In the previous challenge, you created a new `h2` element for each item in the `dataset` array, but they all contained the same text, `New Title`. This is because you have not made use of the data that is bound to each of the `h2` elements.
+
+The D3 `text()` method can take a string or a callback function as an argument:
+
+```js
+selection.text((d) => d)
+```
+
+In the example above, the parameter `d` refers to a single entry in the dataset that a selection is bound to.
+
+Using the current example as context, the first `h2` element is bound to 12, the second `h2` element is bound to 31, the third `h2` element is bound to 22, and so on.
+
+# --instructions--
+
+Change the `text()` method so that each `h2` element displays the corresponding value from the `dataset` array with a single space and the string `USD`. For example, the first heading should be `12 USD`.
+
+# --hints--
+
+The first `h2` should have the text `12 USD`.
+
+```js
+assert($('h2').eq(0).text() == '12 USD');
+```
+
+The second `h2` should have the text `31 USD`.
+
+```js
+assert($('h2').eq(1).text() == '31 USD');
+```
+
+The third `h2` should have the text `22 USD`.
+
+```js
+assert($('h2').eq(2).text() == '22 USD');
+```
+
+The fourth `h2` should have the text `17 USD`.
+
+```js
+assert($('h2').eq(3).text() == '17 USD');
+```
+
+The fifth `h2` should have the text `25 USD`.
+
+```js
+assert($('h2').eq(4).text() == '25 USD');
+```
+
+The sixth `h2` should have the text `18 USD`.
+
+```js
+assert($('h2').eq(5).text() == '18 USD');
+```
+
+The seventh `h2` should have the text `29 USD`.
+
+```js
+assert($('h2').eq(6).text() == '29 USD');
+```
+
+The eighth `h2` should have the text `14 USD`.
+
+```js
+assert($('h2').eq(7).text() == '14 USD');
+```
+
+The ninth `h2` should have the text `9 USD`.
+
+```js
+assert($('h2').eq(8).text() == '9 USD');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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`);
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
new file mode 100644
index 0000000000..50b0ee7a2f
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
@@ -0,0 +1,167 @@
+---
+id: 587d7fae367417b2b2512be4
+title: Access the JSON Data from an API
+challengeType: 6
+forumTopicId: 301499
+dashedName: 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 `[ ]`. This means that the returned data is an array. The second character in the JSON data is a curly `{` 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 `"id":0` 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 `"codeNames":["Juggernaut","Mrs. Wallace","ButterCup"]`. 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` property of the first cat photo - note that the parsed JSON data in the editor is saved in a variable called `json`:
+
+```js
+console.log(json[0].altText);
+```
+
+The console would display the string `A white cat wearing a green helmet shaped melon on its head.`.
+
+# --instructions--
+
+For the cat with the `id` of 2, print to the console the second value in the `codeNames` array. You should use bracket and dot notation on the object (which is saved in the variable `json`) to access the value.
+
+# --hints--
+
+Your code should use bracket and dot notation to access the proper code name, and print `Loki` to the console.
+
+```js
+assert(
+  code.match(
+    /console\s*\.\s*log\s*\(\s*json\s*\[2\]\s*(\.\s*codeNames|\[\s*('|`|")codeNames\2\s*\])\s*\[\s*1\s*\]\s*\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        const 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        const json = JSON.parse(req.responseText);
+        document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+        // Add your code below this line
+        console.log(json[2].codeNames[1]);
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
new file mode 100644
index 0000000000..4550322262
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
@@ -0,0 +1,140 @@
+---
+id: 587d7fad367417b2b2512be2
+title: Change Text with click Events
+challengeType: 6
+forumTopicId: 301500
+dashedName: 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 `message` to say `Here is the message`.
+
+This works by adding the following code within the click event:
+
+```js
+document.getElementsByClassName('message')[0].textContent="Here is the message";
+```
+
+# --instructions--
+
+Add code inside the `onclick` event handler to change the text inside the `message` element to say `Here is the message`.
+
+# --hints--
+
+Your code should use the `document.getElementsByClassName` method to select the element with class `message` and set its `textContent` to the given string.
+
+```js
+assert(
+  code.match(
+    /document\s*\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\s*\.textContent\s*?=\s*?('|")Here is the message\2/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick = function(){
+      // Add your code below this line
+      document.getElementsByClassName('message')[0].textContent = "Here is the message";
+      // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
new file mode 100644
index 0000000000..8678469f29
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
@@ -0,0 +1,199 @@
+---
+id: 587d7fae367417b2b2512be5
+title: Convert JSON Data to HTML
+challengeType: 6
+forumTopicId: 16807
+dashedName: 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 `forEach` 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 `let html = "";`.
+
+Then, loop through the JSON, adding HTML to the variable that wraps the key names in `strong` tags, followed by the value. When the loop is finished, you render it.
+
+Here's the code that does this:
+
+```js
+let html = "";
+json.forEach(function(val) {
+  const keys = Object.keys(val);
+  html += "<div class = 'cat'>";
+  keys.forEach(function(key) {
+    html += "<strong>" + key + "</strong>: " + val[key] + "<br>";
+  });
+  html += "</div><br>";
+});
+```
+
+**Note:** For this challenge, you need to add new HTML elements to the page, so you cannot rely on `textContent`. Instead, you need to use `innerHTML`, which can make a site vulnerable to cross-site scripting attacks.
+
+# --instructions--
+
+Add a `forEach` method to loop over the JSON data and create the HTML elements to display it.
+
+Here is some example JSON:
+
+```json
+[
+  {
+    "id":0,
+      "imageLink":"https://s3.amazonaws.com/freecodecamp/funny-cat.jpg",
+      "altText":"A white cat wearing a green helmet shaped melon on its head. ",
+      "codeNames":[ "Juggernaut", "Mrs. Wallace", "Buttercup"
+    ]
+  }
+]
+```
+
+# --hints--
+
+Your code should store the data in the `html` variable
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/html(\+=|=html\+)/g))
+```
+
+Your code should use a `forEach` method to loop over the JSON data from the API.
+
+```js
+assert(code.match(/json\.forEach/g));
+```
+
+Your code should wrap the key names in `strong` tags.
+
+```js
+assert(code.match(/<strong>.+<\/strong>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let html = "";
+        // Add your code below this line
+        json.forEach(function(val) {
+          var keys = Object.keys(val);
+          html += "<div class = 'cat'>";
+          keys.forEach(function(key) {
+          html += "<strong>" + key + "</strong>: " + val[key] + "<br>";
+        });
+        html += "</div><br>";
+        });
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
new file mode 100644
index 0000000000..bed1c43e98
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
@@ -0,0 +1,98 @@
+---
+id: 587d7faf367417b2b2512be8
+title: Get Geolocation Data to Find A User's GPS Coordinates
+challengeType: 6
+forumTopicId: 18188
+dashedName: get-geolocation-data-to-find-a-users-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:
+
+```js
+if (navigator.geolocation){
+  navigator.geolocation.getCurrentPosition(function(position) {
+    document.getElementById('data').innerHTML="latitude: " + position.coords.latitude + "<br>longitude: " + position.coords.longitude;
+  });
+}
+```
+
+First, it checks if the `navigator.geolocation` object exists. If it does, the `getCurrentPosition` 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 `position` object's values for latitude and longitude using dot notation and updates the HTML.
+
+# --instructions--
+
+Add the example code inside the `script` tags to check a user's current location and insert it into the HTML.
+
+# --hints--
+
+Your code should use `navigator.geolocation` to access the user's current location.
+
+```js
+assert(code.match(/navigator\.geolocation\.getCurrentPosition/g));
+```
+
+Your code should use `position.coords.latitude` to display the user's latitudinal location.
+
+```js
+assert(code.match(/position\.coords\.latitude/g));
+```
+
+Your code should use `position.coords.longitude` to display the user's longitudinal location.
+
+```js
+assert(code.match(/position\.coords\.longitude/g));
+```
+
+You should display the user's position within the `div` element with `id="data"`.
+
+```js
+assert(
+  code.match(/document\.getElementById\(\s*?('|")data\1\s*?\)\.innerHTML/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  // Add your code below this line
+
+
+  // Add your code above this line
+</script>
+<h4>You are here:</h4>
+<div id="data">
+
+</div>
+```
+
+# --solutions--
+
+```html
+<script>
+  // Add your code below this line
+  if (navigator.geolocation) {
+    navigator.geolocation.getCurrentPosition(function(position) {
+      document.getElementById('data').innerHTML = "latitude: " + position.coords.latitude + "<br>longitude: " + position.coords.longitude;
+    });
+  }
+  // Add your code above this line
+</script>
+<h4>You are here:</h4>
+<div id="data">
+
+</div>
+
+</section>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
new file mode 100644
index 0000000000..f1a4c26f29
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
@@ -0,0 +1,174 @@
+---
+id: 5ccfad82bb2dc6c965a848e5
+title: Get JSON with the JavaScript fetch method
+challengeType: 6
+forumTopicId: 301501
+dashedName: get-json-with-the-javascript-fetch-method
+---
+
+# --description--
+
+Another way to request external data is to use the JavaScript `fetch()` method. It is equivalent to `XMLHttpRequest`, but the syntax is considered easier to understand.
+
+Here is the code for making a GET request to `/json/cats.json`
+
+```js
+
+fetch('/json/cats.json')
+	.then(response => response.json())
+	.then(data => {
+		document.getElementById('message').innerHTML = JSON.stringify(data);
+	})
+
+```
+
+Take a look at each piece of this code.
+
+The first line is the one that makes the request. So, `fetch(URL)` makes a `GET` request to the URL specified. The method returns a Promise.
+
+After a Promise is returned, if the request was successful, the `then` method is executed, which takes the response and converts it to JSON format.
+
+The `then` method also returns a Promise, which is handled by the next `then` method. The argument in the second `then` is the JSON object you are looking for!
+
+Now, it selects the element that will receive the data by using `document.getElementById()`. Then it modifies the HTML code of the element by inserting a string created from the JSON object returned from the request.
+
+# --instructions--
+
+Update the code to create and send a `GET` request to the freeCodeCamp Cat Photo API. But this time, using the `fetch` method instead of `XMLHttpRequest`.
+
+# --hints--
+
+Your code should make a `GET` request with `fetch`.
+
+```js
+assert(code.match(/fetch\s*\(\s*('|")\/json\/cats\.json\1\s*\)/g));
+```
+
+Your code should use `then` to convert the response to JSON.
+
+```js
+assert(
+  code.match(
+    /\.then\s*\(\s*\(?(?<var>\w+)\)?\s*=>\s*\k<var>\s*\.json\s*\(\s*\)\s*\)/g
+  )
+);
+```
+
+Your code should use `then` to handle the data converted to JSON by the other `then`.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/\.then\(\(?\w+\)?=>{[^}]*}\)/g));
+```
+
+Your code should get the element with id `message` and change its inner HTML to the string of JSON data.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(
+    /document\.getElementById\(('|")message\1\)\.innerHTML=JSON\.stringify\(?\w+\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick= () => {
+      // 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 id="message" class="box">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick= () => {
+      fetch('/json/cats.json')
+        .then(response => response.json())
+        .then(data => {
+          document.getElementById('message').innerHTML=JSON.stringify(data);
+        })
+    };
+  });
+</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 id="message" class="box">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
new file mode 100644
index 0000000000..0136675396
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
@@ -0,0 +1,196 @@
+---
+id: 587d7fae367417b2b2512be3
+title: Get JSON with the JavaScript XMLHttpRequest Method
+challengeType: 6
+forumTopicId: 301502
+dashedName: 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 `{` and a `}`.
+
+These properties and their values are often referred to as "key-value pairs".
+
+However, JSON transmitted by APIs are sent as `bytes`, and your application receives it as a `string`. These can be converted into JavaScript objects, but they are not JavaScript objects by default. The `JSON.parse` 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:
+
+```js
+const req = new XMLHttpRequest();
+req.open("GET",'/json/cats.json',true);
+req.send();
+req.onload = function(){
+  const json = JSON.parse(req.responseText);
+  document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+};
+```
+
+Here's a review of what each piece is doing. The JavaScript `XMLHttpRequest` object has a number of properties and methods that are used to transfer data. First, an instance of the `XMLHttpRequest` object is created and saved in the `req` variable. Next, the `open` method initializes a request - this example is requesting data from an API, therefore is a `GET` request. The second argument for `open` is the URL of the API you are requesting data from. The third argument is a Boolean value where `true` makes it an asynchronous request. The `send` method sends the request. Finally, the `onload` event handler parses the returned data and applies the `JSON.stringify` method to convert the JavaScript object into a string. This string is then inserted as the message text.
+
+# --instructions--
+
+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.
+
+# --hints--
+
+Your code should create a new `XMLHttpRequest`.
+
+```js
+assert(code.match(/new\s+?XMLHttpRequest\(\s*?\)/g));
+```
+
+Your code should use the `open` method to initialize a `GET` request to the freeCodeCamp Cat Photo API.
+
+```js
+assert(
+  code.match(
+    /\.open\(\s*?('|")GET\1\s*?,\s*?('|")\/json\/cats\.json\2\s*?,\s*?true\s*?\)/g
+  )
+);
+```
+
+Your code should use the `send` method to send the request.
+
+```js
+assert(code.match(/\.send\(\s*\)/g));
+```
+
+Your code should have an `onload` event handler set to a function.
+
+```js
+assert(
+  code.match(/\.onload\s*=\s*(function|\(\s*?\))\s*?(\(\s*?\)|\=\>)\s*?{/g)
+);
+```
+
+Your code should use the `JSON.parse` method to parse the `responseText`.
+
+```js
+assert(code.match(/JSON\s*\.parse\(\s*.*\.responseText\s*\)/g));
+```
+
+Your code should get the element with class `message` and change its inner HTML to the string of JSON data.
+
+```js
+assert(
+  code.match(
+    /document\s*\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\s*\.innerHTML\s*?=\s*?JSON\.stringify\(.+?\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open('GET', '/json/cats.json', true);
+      req.send();
+      req.onload = () => {
+        const json = JSON.parse(req.responseText);
+        document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+      };
+    };
+  });
+</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>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
new file mode 100644
index 0000000000..5d57a07236
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
@@ -0,0 +1,140 @@
+---
+id: 587d7fad367417b2b2512be1
+title: Handle Click Events with JavaScript using the onclick property
+challengeType: 6
+forumTopicId: 301503
+dashedName: 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 `DOMContentLoaded`. Here's the code that does this:
+
+```js
+document.addEventListener('DOMContentLoaded', function() {
+
+});
+```
+
+You can implement event handlers that go inside of the `DOMContentLoaded` function. You can implement an `onclick` event handler which triggers when the user clicks on the element with id `getMessage`, by adding the following code:
+
+```js
+document.getElementById('getMessage').onclick = function(){};
+```
+
+# --instructions--
+
+Add a click event handler inside of the `DOMContentLoaded` function for the element with id of `getMessage`.
+
+# --hints--
+
+Your code should use the `document.getElementById` method to select the `getMessage` element.
+
+```js
+assert(code.match(/document\s*\.getElementById\(\s*?('|")getMessage\1\s*?\)/g));
+```
+
+Your code should add an `onclick` event handler.
+
+```js
+assert(typeof document.getElementById('getMessage').onclick === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    // Add your code below this line
+    document.getElementById('getMessage').onclick = function(){ };
+    // 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>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
new file mode 100644
index 0000000000..059f7dce49
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
@@ -0,0 +1,206 @@
+---
+id: 587d7faf367417b2b2512be9
+title: Post Data with the JavaScript XMLHttpRequest Method
+challengeType: 6
+forumTopicId: 301504
+dashedName: 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 `XMLHttpRequest` method is also used to post data to a server. Here's an example:
+
+```js
+const xhr = new XMLHttpRequest();
+xhr.open('POST', url, true);
+xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8');
+xhr.onreadystatechange = function () {
+  if (xhr.readyState === 4 && xhr.status === 201){
+    const serverResponse = JSON.parse(xhr.response);
+    document.getElementsByClassName('message')[0].textContent = serverResponse.userName + serverResponse.suffix;
+  }
+};
+const body = JSON.stringify({ userName: userName, suffix: ' loves cats!' });
+xhr.send(body);
+```
+
+You've seen several of these methods before. Here the `open` method initializes the request as a `POST` to the given URL of the external resource, and uses the `true` Boolean to make it asynchronous. The `setRequestHeader` method sets the value of an HTTP request header, which contains information about the sender and the request. It must be called after the `open` method, but before the `send` method. The two parameters are the name of the header and the value to set as the body of that header. Next, the `onreadystatechange` event listener handles a change in the state of the request. A `readyState` of `4` means the operation is complete, and a `status` of `201` means it was a successful request. The document's HTML can be updated. Finally, the `send` method sends the request with the `body` value, which the `userName` key was given by the user in the `input` field.
+
+# --instructions--
+
+Update the code so it makes a `POST` request to the API endpoint. Then type your name in the input field and click `Send Message`. Your AJAX function should replace `Reply from Server will be here.` with data from the server. Format the response to display your name appended with the text ` loves cats`.
+
+# --hints--
+
+Your code should create a new `XMLHttpRequest`.
+
+```js
+assert(code.match(/new\s+?XMLHttpRequest\(\s*?\)/g));
+```
+
+Your code should use the `open` method to initialize a `POST` request to the server.
+
+```js
+assert(code.match(/\.open\(\s*?('|")POST\1\s*?,\s*?url\s*?,\s*?true\s*?\)/g));
+```
+
+Your code should use the `setRequestHeader` method.
+
+```js
+assert(
+  code.match(
+    /\.setRequestHeader\(\s*?('|")Content-Type\1\s*?,\s*?('|")application\/json;\s*charset=UTF-8\2\s*?\)/g
+  )
+);
+```
+
+Your code should have an `onreadystatechange` event handler set to a function.
+
+```js
+assert(code.match(/\.onreadystatechange\s*?=/g));
+```
+
+Your code should get the element with class `message` and change its `textContent` to `userName loves cats`
+
+```js
+assert(
+  code.match(
+    /document\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\.textContent\s*?=\s*?.+?\.userName\s*?\+\s*?.+?\.suffix/g
+  )
+);
+```
+
+Your code should use the `send` method.
+
+```js
+assert(code.match(/\.send\(\s*?body\s*?\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('sendMessage').onclick = function(){
+
+      const userName = document.getElementById('name').value;
+      const url = 'https://jsonplaceholder.typicode.com/posts';
+      // 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('sendMessage').onclick = function(){
+
+      const userName = document.getElementById('name').value;
+      const url = 'https://jsonplaceholder.typicode.com/posts';
+      // Add your code below this line
+      const xhr = new XMLHttpRequest();
+      xhr.open('POST', url, true);
+      xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8');
+      xhr.onreadystatechange = function () {
+        if (xhr.readyState === 4 && xhr.status === 201){
+          const serverResponse = JSON.parse(xhr.response);
+          document.getElementsByClassName('message')[0].textContent = serverResponse.userName + serverResponse.suffix;
+       }
+     };
+     const body = JSON.stringify({ userName: userName, suffix: ' loves cats!' });
+     xhr.send(body);
+      // 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">
+  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>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
new file mode 100644
index 0000000000..749e3e3589
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
@@ -0,0 +1,171 @@
+---
+id: 587d7fae367417b2b2512be7
+title: Pre-filter JSON to Get the Data You Need
+challengeType: 6
+forumTopicId: 18257
+dashedName: 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 `filter` method to filter out the cat whose `id` key has a value of `1`.
+
+Here's the code to do this:
+
+```js
+json = json.filter(function(val) {
+  return (val.id !== 1);
+});
+```
+
+# --instructions--
+
+Add code to `filter` the json data to remove the cat with the `id` value of `1`.
+
+# --hints--
+
+Your code should use the `filter` method.
+
+```js
+assert(code.match(/json\.filter/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        let json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload = function(){
+        let json = JSON.parse(req.responseText);
+        let html = "";
+        // Add your code below this line
+        json = json.filter(function(val) {
+          return (val.id !== 1);
+        });
+
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
new file mode 100644
index 0000000000..2091e71567
--- /dev/null
+++ b/curriculum/challenges/italian/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
@@ -0,0 +1,163 @@
+---
+id: 587d7fae367417b2b2512be6
+title: Render Images from Data Sources
+challengeType: 6
+forumTopicId: 18265
+dashedName: render-images-from-data-sources
+---
+
+# --description--
+
+The last few challenges showed that each object in the JSON array contains an `imageLink` key with a value that is the URL of a cat's image.
+
+When you're looping through these objects, you can use this `imageLink` property to display this image in an `img` element.
+
+Here's the code that does this:
+
+```js
+html += "<img src = '" + val.imageLink + "' " + "alt='" + val.altText + "'>";
+```
+
+# --instructions--
+
+Add code to use the `imageLink` and `altText` properties in an `img` tag.
+
+# --hints--
+
+You should use the `imageLink` property to display the images.
+
+```js
+assert(code.match(/val\.imageLink/g));
+```
+
+You should use the `altText` for the `alt` attribute values of the images.
+
+```js
+assert(code.match(/val\.altText/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req=new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let html = "";
+        json.forEach(function(val) {
+          html += "<div class = 'cat'>";
+          // Add your code below this line
+          html += "<img src = '" + val.imageLink + "' " + "alt='" + val.altText + "'>";
+          // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
new file mode 100644
index 0000000000..433855e9c8
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
@@ -0,0 +1,255 @@
+---
+id: 5a8b073d06fa14fcfde687aa
+title: Exercise Tracker
+challengeType: 4
+forumTopicId: 301505
+dashedName: exercise-tracker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://exercise-tracker.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  const url = getUserInput('url');
+  assert(
+    !/.*\/exercise-tracker\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You can `POST` to `/api/users` with form data `username` to create a new user. The returned response will be an object with `username` and `_id` properties.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    assert.exists(_id);
+    assert.exists(username);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can make a `GET` request to `/api/users` to get an array of all users. Each element in the array is an object containing a user's `username` and `_id`.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users');
+  if (res.ok) {
+    const data = await res.json();
+    assert.isArray(data);
+    assert.isString(data[0].username);
+    assert.isString(data[0]._id);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can `POST` to `/api/users/:_id/exercises` with form data `description`, `duration`, and optionally `date`. If no date is supplied, the current date will be used. The response returned will be the user object with the exercise fields added.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: 'Mon Jan 01 1990'
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-01`
+    });
+    if (addRes.ok) {
+      const actual = await addRes.json();
+      assert.deepEqual(actual, expected);
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can make a `GET` request to `/api/users/:_id/logs` to retrieve a full exercise log of any user. The returned response will be the user object with a `log` array of all the exercises added. Each log item has the `description`, `duration`, and `date` properties.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}`
+    });
+    if (addRes.ok) {
+      const logRes = await fetch(url + `/api/users/${_id}/logs`);
+      if (logRes.ok) {
+        const { log } = await logRes.json();
+        assert.isArray(log);
+        assert.equal(1, log.length);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+A request to a user's log (`/api/users/:_id/logs`) returns an object with a `count` property representing the number of exercises returned.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}`
+    });
+    if (addRes.ok) {
+      const logRes = await fetch(url + `/api/users/${_id}/logs`);
+      if (logRes.ok) {
+        const { count } = await logRes.json();
+        assert(count);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can add `from`, `to` and `limit` parameters to a `/api/users/:_id/logs` request to retrieve part of the log of any user. `from` and `to` are dates in `yyyy-mm-dd` format. `limit` is an integer of how many logs to send back.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addExerciseRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-01`
+    });
+    const addExerciseTwoRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-02`
+    });
+    if (addExerciseRes.ok && addExerciseTwoRes.ok) {
+      const logRes = await fetch(
+        url + `/api/users/${_id}/logs?from=1989-12-31&to=1990-01-03`
+      );
+      if (logRes.ok) {
+        const { log } = await logRes.json();
+        assert.isArray(log);
+        assert.equal(2, log.length);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+      const limitRes = await fetch(
+        url + `/api/users/${_id}/logs?limit=1`
+      );
+      if (limitRes.ok) {
+        const { log } = await limitRes.json();
+        assert.isArray(log);
+        assert.equal(1, log.length);
+      } else {
+        throw new Error(`${limitRes.status} ${limitRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${res.status} ${res.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
new file mode 100644
index 0000000000..da459a9f3f
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
@@ -0,0 +1,88 @@
+---
+id: bd7158d8c443edefaeb5bd0f
+title: File Metadata Microservice
+challengeType: 4
+forumTopicId: 301506
+dashedName: file-metadata-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://file-metadata-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-filemetadata/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-filemetadata) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+**HINT:** You can use the `multer` npm package to handle file uploading.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/file-metadata-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can submit a form that includes a file upload.
+
+```js
+async (getUserInput) => {
+  const site = await fetch(getUserInput('url'));
+  const data = await site.text();
+  const doc = new DOMParser().parseFromString(data, 'text/html');
+  assert(doc.querySelector('input[type="file"]'));
+};
+```
+
+The form file input field has the `name` attribute set to `upfile`.
+
+```js
+async (getUserInput) => {
+  const site = await fetch(getUserInput('url'));
+  const data = await site.text();
+  const doc = new DOMParser().parseFromString(data, 'text/html');
+  assert(doc.querySelector('input[name="upfile"]'));
+};
+```
+
+When you submit a file, you receive the file `name`, `type`, and `size` in bytes within the JSON response.
+
+```js
+async (getUserInput) => {
+  const formData = new FormData();
+  const fileData = await fetch(
+    'https://cdn.freecodecamp.org/weather-icons/01d.png'
+  );
+  const file = await fileData.blob();
+  formData.append('upfile', file, 'icon');
+  const data = await fetch(getUserInput('url') + '/api/fileanalyse', {
+    method: 'POST',
+    body: formData
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'size');
+  assert.equal(parsed.name, 'icon');
+  assert.equal(parsed.type, 'image/png');
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
new file mode 100644
index 0000000000..de86d19ddb
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
@@ -0,0 +1,77 @@
+---
+id: bd7158d8c443edefaeb5bdff
+title: Request Header Parser Microservice
+challengeType: 4
+forumTopicId: 301507
+dashedName: request-header-parser-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://request-header-parser-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-headerparser/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-headerparser) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/request-header-parser-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+A request to `/api/whoami` should return a JSON object with your IP address in the `ipaddress` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.ipaddress && data.ipaddress.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/whoami` should return a JSON object with your preferred language in the `language` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.language && data.language.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/whoami` should return a JSON object with your software in the `software` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.software && data.software.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
new file mode 100644
index 0000000000..00cee8bcd6
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
@@ -0,0 +1,154 @@
+---
+id: bd7158d8c443edefaeb5bdef
+title: Timestamp Microservice
+challengeType: 4
+forumTopicId: 301508
+dashedName: timestamp-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://timestamp-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-timestamp/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/timestamp-microservice\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+A request to `/api/:date?` with a valid date should return a JSON object with a `unix` key that is a Unix timestamp of the input date in milliseconds
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/2016-12-25').then(
+    (data) => {
+      assert.equal(
+        data.unix,
+        1482624000000,
+        'Should be a valid unix timestamp'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/:date?` with a valid date should return a JSON object with a `utc` key that is a string of the input date in the format: `Thu, 01 Jan 1970 00:00:00 GMT`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/2016-12-25').then(
+    (data) => {
+      assert.equal(
+        data.utc,
+        'Sun, 25 Dec 2016 00:00:00 GMT',
+        'Should be a valid UTC date string'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/1451001600000` should return `{ unix: 1451001600000, utc: "Fri, 25 Dec 2015 00:00:00 GMT" }`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/1451001600000').then(
+    (data) => {
+      assert(
+        data.unix === 1451001600000 &&
+          data.utc === 'Fri, 25 Dec 2015 00:00:00 GMT'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+Your project can handle dates that can be successfully parsed by `new Date(date_string)`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/05 October 2011').then(
+    (data) => {
+      assert(
+        data.unix === 1317772800000 &&
+          data.utc === 'Wed, 05 Oct 2011 00:00:00 GMT'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+If the input date string is invalid, the api returns an object having the structure `{ error : "Invalid Date" }`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/this-is-not-a-date').then(
+    (data) => {
+      assert.equal(data.error.toLowerCase(), 'invalid date');
+    },
+    (xhr) => {
+      assert(xhr.responseJSON.error.toLowerCase() === 'invalid date');
+    }
+  );
+```
+
+An empty date parameter should return the current time in a JSON object with a `unix` key
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api').then(
+    (data) => {
+      var now = Date.now();
+      assert.approximately(data.unix, now, 20000);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+An empty date parameter should return the current time in a JSON object with a `utc` key
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api').then(
+    (data) => {
+      var now = Date.now();
+      var serverTime = new Date(data.utc).getTime();
+      assert.approximately(serverTime, now, 20000);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
new file mode 100644
index 0000000000..34bf3e3fa6
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
@@ -0,0 +1,119 @@
+---
+id: bd7158d8c443edefaeb5bd0e
+title: URL Shortener Microservice
+challengeType: 4
+forumTopicId: 301509
+dashedName: url-shortener-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://url-shortener-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-urlshortener/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-urlshortener) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+**HINT:** Do not forget to use a body parsing middleware to handle the POST requests. Also, you can use the function `dns.lookup(host, cb)` from the `dns` core module to verify a submitted URL.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/url-shortener-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can POST a URL to `/api/shorturl` and get a JSON response with `original_url` and `short_url` properties. Here's an example: `{ original_url : 'https://freeCodeCamp.org', short_url : 1}`
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const urlVariable = Date.now();
+  const fullUrl = `${url}/?v=${urlVariable}`
+  const res = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=${fullUrl}`
+  });
+  if (res.ok) {
+    const { short_url, original_url } = await res.json();
+    assert.isNotNull(short_url);
+    assert.strictEqual(original_url, `${url}/?v=${urlVariable}`);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+When you visit `/api/shorturl/<short_url>`, you will be redirected to the original URL.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const urlVariable = Date.now();
+  const fullUrl = `${url}/?v=${urlVariable}`
+  let shortenedUrlVariable;
+  const postResponse = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=${fullUrl}`
+  });
+  if (postResponse.ok) {
+    const { short_url } = await postResponse.json();
+    shortenedUrlVariable = short_url;
+  } else {
+    throw new Error(`${postResponse.status} ${postResponse.statusText}`);
+  }
+  const getResponse = await fetch(
+    url + '/api/shorturl/' + shortenedUrlVariable
+  );
+  if (getResponse) {
+    const { redirected, url } = getResponse;
+    assert.isTrue(redirected);
+    assert.strictEqual(url,fullUrl);
+  } else {
+    throw new Error(`${getResponse.status} ${getResponse.statusText}`);
+  }
+};
+```
+
+If you pass an invalid URL that doesn't follow the valid `http://www.example.com` format, the JSON response will contain `{ error: 'invalid url' }`
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=ftp:/john-doe.org`
+  });
+  if (res.ok) {
+    const { error } = await res.json();
+    assert.isNotNull(error);
+    assert.strictEqual(error.toLowerCase(), 'invalid url');
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
new file mode 100644
index 0000000000..d68ab003f3
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
@@ -0,0 +1,79 @@
+---
+id: 587d7fb1367417b2b2512bf4
+title: Chain Middleware to Create a Time Server
+challengeType: 2
+forumTopicId: 301510
+dashedName: chain-middleware-to-create-a-time-server
+---
+
+# --description--
+
+Middleware can be mounted at a specific route using `app.METHOD(path, middlewareFunction)`. Middleware can also be chained inside route definition.
+
+Look at the following example:
+
+```js
+app.get('/user', function(req, res, next) {
+  req.user = getTheUserSync();  // Hypothetical synchronous operation
+  next();
+}, function(req, res) {
+  res.send(req.user);
+});
+```
+
+This approach is useful to split the server operations into smaller units. That leads 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.
+
+# --instructions--
+
+In the route `app.get('/now', ...)` chain a middleware function and the final handler. In the middleware function you should add the current time to the request object in the `req.time` key. You can use `new Date().toString()`. In the handler, respond with a JSON object, taking the structure `{time: req.time}`.
+
+**Note:** 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.
+
+# --hints--
+
+The /now endpoint should have mounted middleware
+
+```js
+(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);
+    }
+  );
+```
+
+The /now endpoint should return a time that is +/- 20 secs from now
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
new file mode 100644
index 0000000000..8398c13973
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
@@ -0,0 +1,78 @@
+---
+id: 587d7fb2367417b2b2512bf8
+title: Get Data from POST Requests
+challengeType: 2
+forumTopicId: 301511
+dashedName: get-data-from-post-requests
+---
+
+# --description--
+
+Mount a POST handler at the path `/name`. 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 `req.body`. Have a look at the usual library example:
+
+<blockquote>route: POST '/library'<br>urlencoded_body: userId=546&#x26;bookId=6754 <br>req.body: {userId: '546', bookId: '6754'}</blockquote>
+
+Respond with the same JSON object as before: `{name: 'firstname lastname'}`. 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 correspondence 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.
+
+# --hints--
+
+Test 1 : Your API endpoint should respond with the correct name
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your API endpoint should respond with the correct name
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
new file mode 100644
index 0000000000..0d301a9f5e
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
@@ -0,0 +1,67 @@
+---
+id: 587d7fb2367417b2b2512bf6
+title: Get Query Parameter Input from the Client
+challengeType: 2
+forumTopicId: 301512
+dashedName: 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 `req.query`. Some characters, like the percent (%), cannot be in URLs and have to be encoded in a different format 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&#x26;bookId=6754' <br>req.query: {userId: '546', bookId: '6754'}</blockquote>
+
+# --instructions--
+
+Build an API endpoint, mounted at `GET /name`. Respond with a JSON document, taking the structure `{ name: 'firstname lastname'}`. The first and last name parameters should be encoded in a query string e.g. `?first=firstname&last=lastname`.
+
+**Note:** In the following exercise you are going to receive data from a POST request, at the same `/name` route path. If you want, you can use the method `app.route(path).get(handler).post(handler)`. 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.
+
+# --hints--
+
+Test 1 : Your API endpoint should respond with the correct name
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your API endpoint should respond with the correct name
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
new file mode 100644
index 0000000000..b0055f569e
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
@@ -0,0 +1,65 @@
+---
+id: 587d7fb2367417b2b2512bf5
+title: Get Route Parameter Input from the Client
+challengeType: 2
+forumTopicId: 301513
+dashedName: get-route-parameter-input-from-the-client
+---
+
+# --description--
+
+When building an API, we have to allow users to communicate to 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 by 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 `req.params` object.
+
+<blockquote>route_path: '/user/:userId/book/:bookId'<br>actual_request_URL: '/user/546/book/6754' <br>req.params: {userId: '546', bookId: '6754'}</blockquote>
+
+# --instructions--
+
+Build an echo server, mounted at the route `GET /:word/echo`. Respond with a JSON object, taking the structure `{echo: word}`. You can find the word to be repeated at `req.params.word`. You can test your route from your browser's address bar, visiting some matching routes, e.g. `your-app-rootpath/freecodecamp/echo`.
+
+# --hints--
+
+Test 1 : Your echo server should repeat words correctly
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your echo server should repeat words correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
new file mode 100644
index 0000000000..2a2faa35c3
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb1367417b2b2512bf3
+title: Implement a Root-Level Request Logger Middleware
+challengeType: 2
+forumTopicId: 301514
+dashedName: implement-a-root-level-request-logger-middleware
+---
+
+# --description--
+
+Earlier, you were introduced to the `express.static()` 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 information to the request or response objects. They can also end the cycle by sending a 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 triggers calling the 3rd argument, `next()`.
+
+Look at the following example:
+
+```js
+function(req, res, next) {
+  console.log("I'm a middleware...");
+  next();
+}
+```
+
+Let’s suppose you 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, you are going to build root-level middleware. As you have seen in challenge 4, to mount a middleware function at root level, you can use the `app.use(<mware-function>)` method. 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 `app.post(<mware-function>)`. Analogous methods exist for all the HTTP verbs (GET, DELETE, PUT, …).
+
+# --instructions--
+
+Build a simple logger. For every request, it should log to the console a string taking the following format: `method path - ip`. An example would look like this: `GET /json - ::ffff:127.0.0.1`. Note that there is a space between `method` and `path` and that the dash separating `path` and `ip` is surrounded by a space on both sides. You can get the request method (http verb), the relative route path, and the caller’s ip from the request object using `req.method`, `req.path` and `req.ip`. Remember to call `next()` 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.
+
+**Note:** 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.
+
+# --hints--
+
+Root level logger middleware should be active
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
new file mode 100644
index 0000000000..5876dde8e5
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb0367417b2b2512bed
+title: Meet the Node console
+challengeType: 2
+forumTopicId: 301515
+dashedName: meet-the-node-console
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-express/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-express) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+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 console output in a terminal. On Replit, a terminal is open in the right pane by default.
+
+We recommend to keep the terminal open while working at these challenges. By reading the output in the terminal, you can see any errors that may occur.
+
+# --instructions--
+
+Modify the `myApp.js` file to log "Hello World" to the console.
+
+# --hints--
+
+`"Hello World"` should be in the console
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
new file mode 100644
index 0000000000..1d61867322
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb0367417b2b2512bef
+title: Serve an HTML File
+challengeType: 2
+forumTopicId: 301516
+dashedName: serve-an-html-file
+---
+
+# --description--
+
+You can respond to requests with a file using the `res.sendFile(path)` method. You can put it inside the `app.get('/', ...)` 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 `__dirname` to calculate the path like this:
+
+```js
+absolutePath = __dirname + relativePath/file.ext
+```
+
+# --instructions--
+
+Send the `/views/index.html` file as a response to GET requests to the `/` path. If you view your live 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 routes from top to bottom, and executes the handler for the first match. You have to comment out the preceding solution, or the server will keep responding with a string.
+
+# --hints--
+
+Your app should serve the file views/index.html
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
new file mode 100644
index 0000000000..1e977061c7
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
@@ -0,0 +1,47 @@
+---
+id: 587d7fb1367417b2b2512bf1
+title: Serve JSON on a Specific Route
+challengeType: 2
+forumTopicId: 301517
+dashedName: serve-json-on-a-specific-route
+---
+
+# --description--
+
+While an HTML server serves 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 `/json`. You can do it as usual, with the `app.get()` method. Inside the route handler, use the method `res.json()`, 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 `{key: data}`. `data` can be 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.
+
+# --instructions--
+
+Serve the object `{"message": "Hello json"}` as a response, in JSON format, to GET requests to the `/json` route. Then point your browser to `your-app-url/json`, you should see the message on the screen.
+
+# --hints--
+
+The endpoint `/json` should serve the json object `{"message": "Hello json"}`
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
new file mode 100644
index 0000000000..f3e2796c54
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb0367417b2b2512bf0
+title: Serve Static Assets
+challengeType: 2
+forumTopicId: 301518
+dashedName: 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 `express.static(path)`, where the `path` parameter is the absolute path of the folder containing the assets.
+
+If you don’t know what middleware is... don’t worry, we will discuss in detail later. Basically, middleware are functions that intercept route handlers, adding some kind of information. A middleware needs to be mounted using the method `app.use(path, middlewareFunction)`. The first `path` argument is optional. If you don’t pass it, the middleware will be executed for all requests.
+
+# --instructions--
+
+Mount the `express.static()` middleware to the path `/public` with `app.use()`. The absolute path to the assets folder is `__dirname + /public`.
+
+Now your app should be able to serve a CSS stylesheet. Note that the `/public/style.css` file is referenced in the `/views/index.html` in the project boilerplate. Your front-page should look a little better now!
+
+# --hints--
+
+Your app should serve asset files from the `/public` directory to the `/public` path
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/style.css').then(
+    (data) => {
+      assert.match(
+        data,
+        /body\s*\{[^\}]*\}/,
+        'Your app does not serve static assets'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
new file mode 100644
index 0000000000..e8e3e82fc5
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb0367417b2b2512bee
+title: Start a Working Express Server
+challengeType: 2
+forumTopicId: 301519
+dashedName: start-a-working-express-server
+---
+
+# --description--
+
+In the first two lines of the file `myApp.js`, you can see how easy it is to create an Express app object. This object has several methods, and you will learn many of them in these challenges. One fundamental method is `app.listen(port)`. It tells your server to listen on a given port, putting it in running state. For testing reasons, we need the app to be running in the background so we added this method in the `server.js` file for you.
+
+Let’s serve our first string! In Express, routes takes the following structure: `app.METHOD(PATH, HANDLER)`. 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 `function(req, res) {...}`, where req is the request object, and res is the response object. For example, the handler
+
+```js
+function(req, res) {
+  res.send('Response String');
+}
+```
+
+will serve the string 'Response String'.
+
+# --instructions--
+
+Use the `app.get()` 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 the preview if you are using Replit.
+
+**Note:** All the code for these lessons should be added in between the few lines of code we have started you off with.
+
+# --hints--
+
+Your app should serve the string 'Hello Express'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
new file mode 100644
index 0000000000..9e0c3a879b
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
@@ -0,0 +1,61 @@
+---
+id: 587d7fb2367417b2b2512bf7
+title: Use body-parser to Parse POST Requests
+challengeType: 2
+forumTopicId: 301520
+dashedName: 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 REST convention, POST is used to send data to create new items in the database (a new user, or a new blog post). You don’t have a database in this project, but you 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. The body is a part of the HTTP request, also called the payload. Even though the data is not visible in the URL, this does not mean that it is private. To see why, look at the raw content of an HTTP POST request:
+
+```http
+POST /path/subpath HTTP/1.0
+From: john@example.com
+User-Agent: someBrowser/1.0
+Content-Type: application/x-www-form-urlencoded
+Content-Length: 20
+
+name=John+Doe&age=25
+```
+
+As you can see, the body is encoded like the query string. This is the default format used by HTML forms. With Ajax, you can also use JSON 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, you will use a urlencoded body. To parse the data coming from POST requests, you have to install the `body-parser` package. This package allows you to use a series of middleware, which can decode data in different formats.
+
+# --instructions--
+
+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 urlencoded data is returned by `bodyParser.urlencoded({extended: false})`. Pass to `app.use()` the function returned by the previous method call. As usual, the middleware must be mounted before all the routes which need it.
+
+**Note:** `extended=false` 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.
+
+# --hints--
+
+The 'body-parser' middleware should be mounted
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
new file mode 100644
index 0000000000..e953553f4b
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb1367417b2b2512bf2
+title: Use the .env File
+challengeType: 2
+forumTopicId: 301521
+dashedName: use-the--env-file
+---
+
+# --description--
+
+The `.env` 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 `process.env.VAR_NAME`. The `process.env` 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 `.env` 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. `VAR_NAME=value`. Usually, you will put each variable definition on a separate line.
+
+# --instructions--
+
+Let's add an environment variable as a configuration option.
+
+Create a `.env` file in the root of your project directory, and store the variable `MESSAGE_STYLE=uppercase` in it.
+
+Then, in the `/json` GET route handler you created in the last challenge, transform the response object's message to uppercase if `process.env.MESSAGE_STYLE` equals `uppercase`. The response object should either be `{"message": "Hello json"}` or `{"message": "HELLO JSON"}`, depending on the `MESSAGE_STYLE` value.
+
+**Note:** If you are using Replit, you cannot create a `.env` file. Instead, use the built-in <dfn>SECRETS</dfn> tab to add the variable.
+
+# --hints--
+
+The response of the endpoint `/json` should change according to the environment variable `MESSAGE_STYLE`
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
new file mode 100644
index 0000000000..d4f4da4d68
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb3367417b2b2512bfc
+title: Add a Description to Your package.json
+challengeType: 2
+forumTopicId: 301522
+dashedName: add-a-description-to-your-package-json
+---
+
+# --description--
+
+The next part of a good package.json file is the `description` field; where a short, but informative description about your project belongs.
+
+If you some day plan to publish a package to npm, 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, it’s a great way to summarize what a project does. It’s just as important in any Node.js project 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. Here's an example:
+
+```json
+"description": "A project that does something awesome",
+```
+
+# --instructions--
+
+Add a `description` to the package.json file of your project.
+
+**Note:** Remember to use double-quotes for field-names (") and commas (,) to separate fields.
+
+# --hints--
+
+package.json should have a valid "description" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
new file mode 100644
index 0000000000..d97b013401
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
@@ -0,0 +1,48 @@
+---
+id: 587d7fb4367417b2b2512bfe
+title: Add a License to Your package.json
+challengeType: 2
+forumTopicId: 301523
+dashedName: add-a-license-to-your-package-json
+---
+
+# --description--
+
+The `license` field is where you inform users of what they are allowed to do with your project.
+
+Some common licenses for open source projects include MIT and BSD. License information is not required, and 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. Here's an example of the license field:
+
+```json
+"license": "MIT",
+```
+
+# --instructions--
+
+Fill the `license` field in the package.json file of your project as you find suitable.
+
+# --hints--
+
+package.json should have a valid "license" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
new file mode 100644
index 0000000000..a5b3b8b245
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
@@ -0,0 +1,46 @@
+---
+id: 587d7fb4367417b2b2512bff
+title: Add a Version to Your package.json
+challengeType: 2
+forumTopicId: 301525
+dashedName: add-a-version-to-your-package-json
+---
+
+# --description--
+
+A `version` is one of the required fields of your package.json file. This field describes the current version of your project. Here's an example:
+
+```json
+"version": "1.2.0",
+```
+
+# --instructions--
+
+Add a `version` to the package.json file of your project.
+
+# --hints--
+
+package.json should have a valid "version" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
new file mode 100644
index 0000000000..33c9742e8b
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
@@ -0,0 +1,84 @@
+---
+id: 587d7fb4367417b2b2512bfd
+title: Add Keywords to Your package.json
+challengeType: 2
+forumTopicId: 301526
+dashedName: add-keywords-to-your-package-json
+---
+
+# --description--
+
+The `keywords` field is where you can describe your project using related keywords. Here's an example:
+
+```json
+"keywords": [ "descriptive", "related", "words" ],
+```
+
+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 file of your project.
+
+One of the keywords should be "freecodecamp".
+
+# --hints--
+
+package.json should have a valid "keywords" key
+
+```js
+(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);
+    }
+  );
+```
+
+"keywords" field should be an Array
+
+```js
+(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);
+    }
+  );
+```
+
+"keywords" should include "freecodecamp"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
new file mode 100644
index 0000000000..18523e17aa
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
@@ -0,0 +1,77 @@
+---
+id: 587d7fb4367417b2b2512c00
+title: Expand Your Project with External Packages from npm
+challengeType: 2
+forumTopicId: 301527
+dashedName: 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 file.
+
+In this section, packages your project requires are stored using the following format:
+
+```json
+"dependencies": {
+  "package-name": "version",
+  "express": "4.14.0"
+}
+
+```
+
+# --instructions--
+
+Add version "2.14.0" of the "moment" package to the `dependencies` field of your package.json file.
+
+**Note:** Moment is a handy library for working with time and dates.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should be "2.14.0"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
new file mode 100644
index 0000000000..7c3ce74460
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
@@ -0,0 +1,60 @@
+---
+id: 587d7fb3367417b2b2512bfb
+title: 'How to Use package.json, the Core of Any Node.js Project or npm Package'
+challengeType: 2
+forumTopicId: 301528
+dashedName: how-to-use-package-json-the-core-of-any-node-js-project-or-npm-package
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-npm/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-npm) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+The `package.json` file is the center of any Node.js project or npm package. It stores information about your project, similar to how the &lt;head> section of an HTML document describes the content of a webpage. It consists of a single JSON object where information is stored in key-value pairs. There are only two required fields; "name" and "version", but it’s good practice to provide additional information about your project that could be useful to future users or maintainers.
+
+If you look at the file tree of your project, you will find the package.json file on the top level of the tree. This is the file that you will be improving in the next couple of challenges.
+
+One of the most common pieces of information in this file is the `author` field. It specifies who created the project, and can consist of a string or an object with contact or other details. An object is recommended for bigger projects, but a simple string like the following example will do for this project.
+
+```json
+"author": "Jane Doe",
+```
+
+# --instructions--
+
+Add your name as the `author` of the project in the package.json file.
+
+**Note:** Remember that you’re writing JSON, so all field names must use double-quotes (") and be separated with a comma (,).
+
+# --hints--
+
+package.json should have a valid "author" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
new file mode 100644
index 0000000000..c1b6abac8a
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
@@ -0,0 +1,73 @@
+---
+id: 587d7fb5367417b2b2512c01
+title: Manage npm Dependencies By Understanding Semantic Versioning
+challengeType: 2
+forumTopicId: 301529
+dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
+---
+
+# --description--
+
+`Versions` of the npm packages in the dependencies section of your package.json file 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 projects can expect if they update.
+
+Knowing SemVer can be useful when you develop software that uses 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 don’t work today. This is how Semantic Versioning works according to the official website:
+
+```json
+"package": "MAJOR.MINOR.PATCH"
+```
+
+The MAJOR version should increment when you make incompatible API changes. The MINOR version should increment when you add functionality in a backwards-compatible manner. The PATCH version should increment 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.
+
+# --instructions--
+
+In the dependencies section of your package.json file, change the `version` of moment to match MAJOR version 2, MINOR version 10 and PATCH version 2
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should be "2.10.2"
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.equal(
+        packJson.dependencies.moment,
+        '2.10.2',
+        'Wrong version of "moment". It should be 2.10.2'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
new file mode 100644
index 0000000000..b1b7b32731
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb5367417b2b2512c04
+title: Remove a Package from Your Dependencies
+challengeType: 2
+forumTopicId: 301530
+dashedName: remove-a-package-from-your-dependencies
+---
+
+# --description--
+
+You have now tested a few ways you can manage dependencies of your project by using the package.json's dependencies section. You have also included external packages by adding them to the file and even told npm what types of versions you want, by using special characters such 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 package from your dependencies.
+
+This same method applies to removing other fields in your package.json as well
+
+# --instructions--
+
+Remove the moment package from your dependencies.
+
+**Note:** Make sure you have the right amount of commas after removing it.
+
+# --hints--
+
+"dependencies" should not include "moment"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
new file mode 100644
index 0000000000..a39adcd533
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
@@ -0,0 +1,75 @@
+---
+id: 587d7fb5367417b2b2512c03
+title: Use the Caret-Character to Use the Latest Minor Version of a Dependency
+challengeType: 2
+forumTopicId: 301531
+dashedName: 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 allows 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.
+
+Your current version of moment should be "~2.10.2" which allows npm to install to the latest 2.10.x version. If you were to use the caret (^) as a version prefix instead, npm would be allowed to update to any 2.x.x version.
+
+```json
+"package": "^1.3.8"
+```
+
+This would allow updates to any 1.x.x version of the package.
+
+# --instructions--
+
+Use the caret (`^`) to prefix the version of moment in your dependencies and allow npm to update it to any new MINOR release.
+
+**Note:** The version numbers themselves should not be changed.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should match "^2.x.x"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
new file mode 100644
index 0000000000..564df74a9d
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
@@ -0,0 +1,75 @@
+---
+id: 587d7fb5367417b2b2512c02
+title: Use the Tilde-Character to Always Use the Latest Patch Version of a Dependency
+challengeType: 2
+forumTopicId: 301532
+dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency
+---
+
+# --description--
+
+In the last challenge, you 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 an npm dependency to update to the latest PATCH version, you can prefix the dependency’s version with the tilde (`~`) character. Here's an example of how to allow updates to any 1.3.x version.
+
+```json
+"package": "~1.3.8"
+```
+
+# --instructions--
+
+In the package.json file, your current rule for how npm may upgrade moment is to use a specific version (2.10.2). But now, you want to allow the latest 2.10.x version.
+
+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:** The version numbers themselves should not be changed.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should match "~2.10.2"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
new file mode 100644
index 0000000000..12be099f8a
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
@@ -0,0 +1,76 @@
+---
+id: 587d7fb9367417b2b2512c12
+title: Chain Search Query Helpers to Narrow Search Results
+challengeType: 2
+forumTopicId: 301533
+dashedName: 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()`. You always need to pass your callback to this last method. There are many query helpers, here we'll use the most commonly used.
+
+# --instructions--
+
+Modify the `queryChain` function to find people who like the food specified by the variable named `foodToSearch`. 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()`.
+
+# --hints--
+
+Chaining query helpers should succeed
+
+```js
+(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: 'Bob', age: 23, favoriteFoods: ['pizza', 'nachos'] },
+      { 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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
new file mode 100644
index 0000000000..1e7e686d23
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fb6367417b2b2512c07
+title: Create a Model
+challengeType: 2
+forumTopicId: 301535
+dashedName: create-a-model
+---
+
+# --description--
+
+**C**RUD Part I - CREATE
+
+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.
+
+Replit is a real server, and in real servers the interactions with the database happen in handler functions. These functions 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!
+
+```js
+/* Example */
+
+const someFunc = function(done) {
+  //... do something (risky) ...
+  if (error) return done(error);
+  done(null, result);
+};
+```
+
+# --instructions--
+
+Create a person schema called `personSchema` having this prototype:
+
+```markup
+- Person Prototype -
+--------------------
+name : string [required]
+age :  number
+favoriteFoods : array of strings (*)
+```
+
+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 [Mongoose docs](http://mongoosejs.com/docs/guide.html).
+
+Now, create a model called `Person` from the `personSchema`.
+
+# --hints--
+
+Creating an instance from a mongoose schema should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
new file mode 100644
index 0000000000..ae385b6b21
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
@@ -0,0 +1,56 @@
+---
+id: 587d7fb6367417b2b2512c09
+title: Create and Save a Record of a Model
+challengeType: 2
+forumTopicId: 301536
+dashedName: create-and-save-a-record-of-a-model
+---
+
+# --description--
+
+In this challenge you will have to create and save a record of a model.
+
+# --instructions--
+
+Within the `createAndSavePerson` function, create a document instance using the `Person` model constructor you built before. Pass to the constructor an object having the fields `name`, `age`, and `favoriteFoods`. Their types must conform to the ones in the `personSchema`. 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.
+
+```js
+/* Example */
+
+// ...
+person.save(function(err, data) {
+  //   ...do your stuff here...
+});
+```
+
+# --hints--
+
+Creating and saving a db item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
new file mode 100644
index 0000000000..08812efbd1
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
@@ -0,0 +1,68 @@
+---
+id: 587d7fb7367417b2b2512c0a
+title: Create Many Records with model.create()
+challengeType: 2
+forumTopicId: 301537
+dashedName: 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.
+
+# --instructions--
+
+Modify the `createManyPeople` function to create many people using `Model.create()` with the argument `arrayOfPeople`.
+
+**Note:** You can reuse the model you instantiated in the previous exercise.
+
+# --hints--
+
+Creating many db items at once should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
new file mode 100644
index 0000000000..7709b5fd5d
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb8367417b2b2512c11
+title: Delete Many Documents with model.remove()
+challengeType: 2
+forumTopicId: 301538
+dashedName: delete-many-documents-with-model-remove
+---
+
+# --description--
+
+`Model.remove()` is useful to delete all the documents matching given criteria.
+
+# --instructions--
+
+Modify the `removeManyPeople` function to delete all the people whose name is within the variable `nameToRemove`, using `Model.remove()`. Pass it to a query document with the `name` field set, and a callback.
+
+**Note:** The `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.
+
+# --hints--
+
+Deleting many items at once should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
new file mode 100644
index 0000000000..f010b51c40
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb8367417b2b2512c10
+title: Delete One Document Using model.findByIdAndRemove
+challengeType: 2
+forumTopicId: 301539
+dashedName: delete-one-document-using-model-findbyidandremove
+---
+
+# --description--
+
+`findByIdAndRemove` and `findOneAndRemove` are like the previous update methods. They pass the removed document to the db. As usual, use the function argument `personId` as the search key.
+
+# --instructions--
+
+Modify the `removeById` function to delete one person by the person's `_id`. You should use one of the methods `findByIdAndRemove()` or `findOneAndRemove()`.
+
+# --hints--
+
+Deleting an item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
new file mode 100644
index 0000000000..88c275d62d
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
@@ -0,0 +1,85 @@
+---
+id: 587d7fb6367417b2b2512c06
+title: Install and Set Up Mongoose
+challengeType: 2
+forumTopicId: 301540
+dashedName: install-and-set-up-mongoose
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-mongomongoose/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-mongomongoose) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+In this challenge, you will set up a MongoDB Atlas database and import the required packages to connect to it.
+
+Follow <a href='https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/' rel='noopener noreferrer' target='_blank'>this tutorial</a> to set up a hosted database on MongoDB Atlas.
+
+# --instructions--
+
+Add `mongodb` and `mongoose` to the project’s `package.json`. Then, require mongoose as `mongoose` in `myApp.js`. Create a `.env` file and add a `MONGO_URI` variable to it. Its value should be your MongoDB Atlas database URI. Be sure to surround the URI with single or double quotes, and remember that you can't use spaces around the `=` in environment variables. For example, `MONGO_URI='VALUE'`. When you are done, connect to the database using the following syntax:
+
+```js
+mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true });
+```
+
+# --hints--
+
+"mongodb" dependency should be in package.json
+
+```js
+(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);
+    }
+  );
+```
+
+"mongoose" dependency should be in package.json
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/file/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(packJson.dependencies, 'mongoose');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+"mongoose" should be connected to a database
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/is-mongoose-ok').then(
+    (data) => {
+      assert.isTrue(data.isMongooseOk, 'mongoose is not connected');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
new file mode 100644
index 0000000000..ecbb514dac
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
@@ -0,0 +1,54 @@
+---
+id: 587d7fb8367417b2b2512c0e
+title: 'Perform Classic Updates by Running Find, Edit, then Save'
+challengeType: 2
+forumTopicId: 301541
+dashedName: 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 bound 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.
+
+# --instructions--
+
+Modify the `findEditThenSave` function to find a person by `_id` (use any of the above methods) with the parameter `personId` as search key. Add `"hamburger"` to the list of the person's `favoriteFoods` (you can use `Array.push()`). Then - inside the find callback - `save()` the updated `Person`.
+
+**Note:** This may be tricky, if in your Schema, you declared `favoriteFoods` as an Array, without specifying the type (i.e. `[String]`). In that case, `favoriteFoods` defaults to Mixed type, and you have to manually mark it as edited using `document.markModified('edited-field')`. See [Mongoose documentation](https://mongoosejs.com/docs/schematypes.html#Mixed)
+
+# --hints--
+
+Find-edit-update an item should succeed
+
+```js
+(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 is 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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
new file mode 100644
index 0000000000..ddd4ecd80a
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
@@ -0,0 +1,58 @@
+---
+id: 587d7fb8367417b2b2512c0f
+title: Perform New Updates on a Document Using model.findOneAndUpdate()
+challengeType: 2
+forumTopicId: 301542
+dashedName: 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.
+
+# --instructions--
+
+Modify the `findAndUpdate` function to find a person by `Name` and set the person's age to `20`. Use the function parameter `personName` as the search key.
+
+**Note:** You should return the updated document. To 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.
+
+# --hints--
+
+findOneAndUpdate an item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
new file mode 100644
index 0000000000..a3e22a5b1e
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb7367417b2b2512c0b
+title: Use model.find() to Search Your Database
+challengeType: 2
+forumTopicId: 301543
+dashedName: use-model-find-to-search-your-database
+---
+
+# --description--
+
+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. Read more in the docs.
+
+# --instructions--
+
+Modify the `findPeopleByName` function to find all the people having a given name, using <code>Model.find() -\> [Person]</code>
+
+Use the function argument `personName` as the search key.
+
+# --hints--
+
+Find all items corresponding to a criteria should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
new file mode 100644
index 0000000000..36c2b551e1
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
@@ -0,0 +1,48 @@
+---
+id: 587d7fb7367417b2b2512c0d
+title: Use model.findById() to Search Your Database By _id
+challengeType: 2
+forumTopicId: 301544
+dashedName: 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 Mongoose provides a dedicated method for it.
+
+# --instructions--
+
+Modify the `findPersonById` to find the only person having a given `_id`, using `Model.findById() -> Person`. Use the function argument `personId` as the search key.
+
+# --hints--
+
+Find an item by Id should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
new file mode 100644
index 0000000000..e7f9c78278
--- /dev/null
+++ b/curriculum/challenges/italian/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb7367417b2b2512c0c
+title: Use model.findOne() to Return a Single Matching Document from Your Database
+challengeType: 2
+forumTopicId: 301545
+dashedName: use-model-findone-to-return-a-single-matching-document-from-your-database
+---
+
+# --description--
+
+`Model.findOne()` behaves like `Model.find()`, but it returns only one document (not an array), even if there are multiple items. It is especially useful when searching by properties that you have declared as unique.
+
+# --instructions--
+
+Modify the `findOneByFood` function to find just one person which has a certain food in the person's favorites, using `Model.findOne() -> Person`. Use the function argument `food` as search key.
+
+# --hints--
+
+Find one item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/announce-new-users.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
new file mode 100644
index 0000000000..fca0105f3d
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/announce-new-users.md
@@ -0,0 +1,90 @@
+---
+id: 589fc832f9fc0f352b528e78
+title: Announce New Users
+challengeType: 2
+forumTopicId: 301546
+dashedName: announce-new-users
+---
+
+# --description--
+
+Many chat rooms are able to announce 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 a feature. The most logical way of doing so is sending 3 pieces of data with the event: the name of the user who connected/disconnected, the current user count, and if that name connected or disconnected.
+
+Change the event name to `'user'`, and pass an object along containing the fields 'name', 'currentUsers', and 'connected' (to be `true` in case of connection, or `false` for disconnection of the user sent). Be sure to change both 'user count' events and set the disconnect one to send `false` for the field 'connected' instead of `true` like the event emitted on connect.
+
+```js
+io.emit('user', {
+  name: socket.request.user.name,
+  currentUsers,
+  connected: true
+});
+```
+
+Now your client will have all the necessary information to correctly display the current user count and announce when a user connects or disconnects! To handle this event on the client side we should listen for `'user'`, then update the current user count by using jQuery to change the text of `#num-users` to `'{NUMBER} users online'`, as well as append a `<li>` to the unordered list with id `messages` with `'{NAME} has {joined/left} the chat.'`.
+
+An implementation of this could look like the following:
+
+```js
+socket.on('user', data => {
+  $('#num-users').text(data.currentUsers + ' users online');
+  let message =
+    data.name +
+    (data.connected ? ' has joined the chat.' : ' has left the chat.');
+  $('#messages').append($('<li>').html('<b>' + message + '</b>'));
+});
+```
+
+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 [here](https://gist.github.com/camperbot/bf95a0f74b756cf0771cd62c087b8286).
+
+# --hints--
+
+Event `'user'` should be emitted with name, currentUsers, and connected.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.emit.*('|")user\1.*name.*currentUsers.*connected/gis,
+        'You should have an event emitted named user sending name, currentUsers, and connected'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Client should properly handle and display the new data from event `'user'`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/client.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")user\1[^]*num-users/gi,
+        'You should change the text of "#num-users" within on your client within the "user" event listener to show the current users connected'
+      );
+      assert.match(
+        data,
+        /socket.on.*('|")user\1[^]*messages.*li/gi,
+        'You should append a list item to "#messages" on your client within the "user" event listener to announce a user came or went'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
new file mode 100644
index 0000000000..0d29b5c99a
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
@@ -0,0 +1,96 @@
+---
+id: 5895f70df9fc0f352b528e68
+title: Authentication Strategies
+challengeType: 2
+forumTopicId: 301547
+dashedName: authentication-strategies
+---
+
+# --description--
+
+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 hundreds of strategies, visit Passport's site [here](http://passportjs.org/).
+
+Add `passport-local@~1.0.0` as a dependency and add it to your server as follows: `const LocalStrategy = require('passport-local');`
+
+Now you will have to tell passport to **use** an instantiated LocalStrategy 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!
+
+```js
+passport.use(new LocalStrategy(
+  function(username, password, done) {
+    myDataBase.findOne({ username: username }, function (err, user) {
+      console.log('User '+ username +' attempted to log in.');
+      if (err) { return done(err); }
+      if (!user) { return done(null, false); }
+      if (password !== user.password) { return done(null, false); }
+      return done(null, user);
+    });
+  }
+));
+```
+
+This is defining the process to use 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 `user`'s object is returned and they are authenticated.
+
+Many strategies are set up using different settings, but generally it is easy to set it up based on the README in that strategy's repository. 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. 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b).
+
+# --hints--
+
+Passport-local should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+Passport-local should be correctly required and setup.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
new file mode 100644
index 0000000000..ce5af55213
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -0,0 +1,150 @@
+---
+id: 589fc831f9fc0f352b528e77
+title: Authentication with Socket.IO
+challengeType: 2
+forumTopicId: 301548
+dashedName: authentication-with-socket-io
+---
+
+# --description--
+
+Currently, you cannot determine who is connected to your web socket. While `req.user` contains the user object, that's only when your user interacts with the web server, and with web sockets you have no `req` (request) and therefore 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!
+
+Add `passport.socketio@~3.7.0`, `connect-mongo@~3.2.0`, and `cookie-parser@~1.4.5` as dependencies and require them as `passportSocketIo`, `MongoStore`, and `cookieParser` respectively. Also, we need to initialize a new memory store, from `express-session` which we previously required. It should look like this:
+
+```js
+const MongoStore = require('connect-mongo')(session);
+const URI = process.env.MONGO_URI;
+const store = new MongoStore({ url: URI });
+```
+
+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 like this:
+
+```js
+io.use(
+  passportSocketIo.authorize({
+    cookieParser: cookieParser,
+    key: 'express.sid',
+    secret: process.env.SESSION_SECRET,
+    store: store,
+    success: onAuthorizeSuccess,
+    fail: onAuthorizeFail
+  })
+);
+```
+
+Be sure to add the `key` and `store` to the `session` middleware mounted on the app. This is necessary to tell *SocketIO* which session to relate to.
+
+<hr>
+
+Now, define the `success`, and `fail` callback functions:
+
+```js
+function onAuthorizeSuccess(data, accept) {
+  console.log('successful connection to socket.io');
+
+  accept(null, true);
+}
+
+function onAuthorizeFail(data, message, error, accept) {
+  if (error) throw new Error(message);
+  console.log('failed connection to socket.io:', message);
+  accept(null, false);
+}
+```
+
+The user object is now accessible on your socket object as `socket.request.user`. For example, now you can add the following:
+
+```js
+console.log('user ' + socket.request.user.name + ' connected');
+```
+
+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 [here](https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254).
+
+# --hints--
+
+`passport.socketio` should be a dependency.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(
+        packJson.dependencies,
+        'passport.socketio',
+        'Your project should list "passport.socketio" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+`cookie-parser` should be a dependency.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(
+        packJson.dependencies,
+        'cookie-parser',
+        'Your project should list "cookie-parser" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+passportSocketIo should be properly required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require\((['"])passport\.socketio\1\)/gi,
+        'You should correctly require and instantiate "passport.socketio"'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+passportSocketIo should be properly setup.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io\.use\(\s*\w+\.authorize\(/,
+        'You should register "passport.socketio" as socket.io middleware and provide it correct options'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
new file mode 100644
index 0000000000..f6cf40e834
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
@@ -0,0 +1,64 @@
+---
+id: 589690e6f9fc0f352b528e6e
+title: Clean Up Your Project with Modules
+challengeType: 2
+forumTopicId: 301549
+dashedName: clean-up-your-project-with-modules
+---
+
+# --description--
+
+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:
+
+```js
+module.exports = function (app, myDataBase) {
+
+}
+```
+
+Now, in the top of your server file, require these files like so: `const routes = require('./routes.js');` Right after you establish a successful connection with the database, instantiate each of them like so: `routes(app, myDataBase)`
+
+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` function, since it was specifically created for routing. Now, you will have to correctly add the dependencies in which are used, such as `const passport = require('passport');`, 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 (**except for the route in the catch block**)!
+
+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 `auth(app, myDataBase)` in the server in the same spot.
+
+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 [here](https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92).
+
+# --hints--
+
+Modules should be present.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require\s*\(('|")\.\/routes(\.js)?\1\)/gi,
+        'You should have required your new files'
+      );
+      assert.match(
+        data,
+        /client\s*\.db[^]*routes/gi,
+        'Your new modules should be called after your connection to the database'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
new file mode 100644
index 0000000000..1b9e03a3b5
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
@@ -0,0 +1,107 @@
+---
+id: 589fc831f9fc0f352b528e75
+title: Communicate by Emitting
+challengeType: 2
+forumTopicId: 301550
+dashedName: communicate-by-emitting
+---
+
+# --description--
+
+<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 emitting the current count of connected users each time a new user connects!
+
+Start by adding a variable to keep track of the users, just before where you are currently listening for connections.
+
+```js
+let currentUsers = 0;
+```
+
+Now, when someone connects, you should increment the count before emitting the count. So, you will want to add the incrementer within the connection listener.
+
+```js
+++currentUsers;
+```
+
+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`.
+
+```js
+io.emit('user count', currentUsers);
+```
+
+Now, you can implement a way for your client to listen for this event! Similar to listening for a connection on the server, you will use the `on` keyword.
+
+```js
+socket.on('user count', function(data) {
+  console.log(data);
+});
+```
+
+Now, try loading up your app, 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5).
+
+# --hints--
+
+currentUsers should be defined.
+
+```js
+(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);
+    }
+  );
+```
+
+Server should emit the current user count at each new connection.
+
+```js
+(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);
+    }
+  );
+```
+
+Your client should be listening for 'user count' event.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
new file mode 100644
index 0000000000..e34d3a458a
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -0,0 +1,87 @@
+---
+id: 5895f70df9fc0f352b528e6a
+title: Create New Middleware
+challengeType: 2
+forumTopicId: 301551
+dashedName: create-new-middleware
+---
+
+# --description--
+
+As is, any user can just go to `/profile` whether they have 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 `ensureAuthenticated(req, res, next)`, which will check if a user is authenticated by calling passport's `isAuthenticated` method on the `request` which, in turn, checks if `req.user` is defined. If it is, then `next()` 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:
+
+```js
+function ensureAuthenticated(req, res, next) {
+  if (req.isAuthenticated()) {
+    return next();
+  }
+  res.redirect('/');
+};
+```
+
+Now add *ensureAuthenticated* as a middleware to the request for the profile page before the argument to the get request containing the function that renders the page.
+
+```js
+app
+ .route('/profile')
+ .get(ensureAuthenticated, (req,res) => {
+    res.render(process.cwd() + '/views/pug/profile');
+ });
+```
+
+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 [here](https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959).
+
+# --hints--
+
+Middleware ensureAuthenticated should be implemented and on our /profile route.
+
+```js
+(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);
+    }
+  );
+```
+
+A Get request to /profile should correctly redirect to / since we are not authenticated.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
new file mode 100644
index 0000000000..2873c18ff2
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
@@ -0,0 +1,69 @@
+---
+id: 589fc831f9fc0f352b528e76
+title: Handle a Disconnect
+challengeType: 2
+forumTopicId: 301552
+dashedName: handle-a-disconnect
+---
+
+# --description--
+
+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 you have to listen for it on each socket instead of on the whole server.
+
+To do this, add another listener inside the existing `'connect'` listener that listens for `'disconnect'` on the socket with no data passed through. You can test this functionality by just logging that a user has disconnected to the console.
+
+```js
+socket.on('disconnect', () => {
+  /*anything you want to do on disconnect*/
+});
+```
+
+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!
+
+**Note:** 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa).
+
+# --hints--
+
+Server should handle the event disconnect from a socket.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(data, /socket.on.*('|")disconnect('|")/gi, '');
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Your client should be listening for 'user count' event.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
new file mode 100644
index 0000000000..43459f9438
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
@@ -0,0 +1,86 @@
+---
+id: 58a25c98f9fc0f352b528e7f
+title: Hashing Your Passwords
+challengeType: 2
+forumTopicId: 301553
+dashedName: hashing-your-passwords
+---
+
+# --description--
+
+Going back to the information security section, you may remember that storing plaintext passwords is *never* okay. Now it is time to implement BCrypt to solve this issue.
+
+Add `bcrypt@~5.0.0` 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 registration route, you insert a user's password into the database like so: `password: req.body.password`. An easy way to implement saving a hash instead is to add the following before your database logic `const hash = bcrypt.hashSync(req.body.password, 12);`, and replacing the `req.body.password` in the database saving with just `password: hash`.
+
+Finally, on our authentication strategy, we check for the following in our code before completing the process: `if (password !== user.password) { return done(null, false); }`. After making the previous changes, now `user.password` 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:
+
+```js
+if (!bcrypt.compareSync(password, user.password)) { 
+  return done(null, false);
+}
+```
+
+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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564).
+
+# --hints--
+
+BCrypt should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+BCrypt should be correctly required and implemented.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')bcrypt\1/gi,
+        'You should have required bcrypt'
+      );
+      assert.match(
+        data,
+        /bcrypt.hashSync/gi,
+        'You should use hash the password in the registration'
+      );
+      assert.match(
+        data,
+        /bcrypt.compareSync/gi,
+        'You should compare the password to the hash in your strategy'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
new file mode 100644
index 0000000000..bd17bbb9a6
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
@@ -0,0 +1,57 @@
+---
+id: 5895f70ef9fc0f352b528e6b
+title: How to Put a Profile Together
+challengeType: 2
+forumTopicId: 301554
+dashedName: how-to-put-a-profile-together
+---
+
+# --description--
+
+Now that we can ensure the user accessing the `/profile` is authenticated, we can use the information contained in `req.user` on our page!
+
+Pass an object containing the property `username` and value of `req.user.username` as the second argument for the render method of the profile view. Then, go to your `profile.pug` view, and add the following line below the existing `h1` element, and at the same level of indentation:
+
+```pug
+h2.center#welcome Welcome, #{username}!
+```
+
+This creates an `h2` element with the class '`center`' and id '`welcome`' containing the text '`Welcome,`' followed by the username.
+
+Also, in `profile.pug`, add a link referring to the `/logout` route, which will host the logic to unauthenticate a user.
+
+```pug
+a(href='/logout') Logout
+```
+
+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 [here](https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a).
+
+# --hints--
+
+You should correctly add a Pug render variable to /profile.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
new file mode 100644
index 0000000000..ba78302a8c
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
@@ -0,0 +1,79 @@
+---
+id: 5895f70df9fc0f352b528e69
+title: How to Use Passport Strategies
+challengeType: 2
+forumTopicId: 301555
+dashedName: how-to-use-passport-strategies
+---
+
+# --description--
+
+In the `index.pug` file supplied, there is actually a login form. It has previously been hidden because of the inline JavaScript `if showLogin` with the form indented after it. Before `showLogin` as a variable was never defined, so 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 `showLogin: true`. When you refresh your page, you should then see the form! This form is set up to **POST** on `/login`, 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 `function(req,res)` with your response! The middleware to use is `passport.authenticate('local')`.
+
+`passport.authenticate` can also take some options as an argument such as: `{ failureRedirect: '/' }` which is incredibly useful, so be sure to add that in as well. The response after using the middleware (which will only be called if the authentication middleware passes) should be to redirect the user to `/profile` and that route should render the view `profile.pug`.
+
+If the authentication was successful, the user object will be saved in `req.user`.
+
+At this point, if you enter a username and password in the form, it should redirect to the home page `/`, and the console of your server should display `'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 [here](https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9).
+
+# --hints--
+
+All steps should be correctly implemented in the server.js.
+
+```js
+(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);
+    }
+  );
+```
+
+A POST request to /login should correctly redirect to /.
+
+```js
+(getUserInput) =>
+  $.post(getUserInput('url') + '/login').then(
+    (data) => {
+      assert.match(
+        data,
+        /Looks like this page is being rendered from Pug into HTML!/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
new file mode 100644
index 0000000000..03d737f4aa
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
@@ -0,0 +1,91 @@
+---
+id: 5895f70cf9fc0f352b528e67
+title: Implement the Serialization of a Passport User
+challengeType: 2
+forumTopicId: 301556
+dashedName: implement-the-serialization-of-a-passport-user
+---
+
+# --description--
+
+Right now, we're not loading an actual user 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 your database's connection string (for example: `mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`) to the environment variable `MONGO_URI`. This is used in the `connection.js` file.
+
+*You can set up a free database on [MongoDB Atlas](https://www.mongodb.com/cloud/atlas).*
+
+Now we want to 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 this, you will want to encompass your serialization and your app routes in the following code:
+
+```js
+myDB(async client => {
+  const myDataBase = await client.db('database').collection('users');
+
+  // Be sure to change the title
+  app.route('/').get((req, res) => {
+    //Change the response to render the Pug template
+    res.render('pug', {
+      title: 'Connected to Database',
+      message: 'Please login'
+    });
+  });
+
+  // Serialization and deserialization here...
+
+  // Be sure to add this...
+}).catch(e => {
+  app.route('/').get((req, res) => {
+    res.render('pug', { title: e, message: 'Unable to login' });
+  });
+});
+// app.listen out here...
+```
+
+Be sure to uncomment the `myDataBase` code in `deserializeUser`, and edit your `done(null, null)` to include the `doc`.
+
+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 [here](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7).
+
+# --hints--
+
+Database connection should be present.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/').then(
+    (data) => {
+      assert.match(
+        data,
+        /Connected to Database/gi,
+        'You successfully connected to the database!'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Deserialization should now be correctly using the DB and `done(null, null)` should be called with the `doc`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /null,\s*doc/gi,
+        'The callback in deserializeUser of (null, null) should be altered to (null, doc)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
new file mode 100644
index 0000000000..43740bdac5
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
@@ -0,0 +1,114 @@
+---
+id: 589a69f5f9fc0f352b528e71
+title: Implementation of Social Authentication II
+challengeType: 2
+forumTopicId: 301557
+dashedName: implementation-of-social-authentication-ii
+---
+
+# --description--
+
+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@~1.1.0` to your project and require it in your `auth.js` as `GithubStrategy` like this: `const GitHubStrategy = require('passport-github').Strategy;`. Do not forget to require and configure `dotenv` to use your environment variables.
+
+To set up the GitHub strategy, you have to tell Passport to use an instantiated `GitHubStrategy`, which accepts 2 arguments: an object (containing `clientID`, `clientSecret`, and `callbackURL`) and a function to be called when a user is successfully authenticated, which 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 *scope* as well which determines what kind of information your request is asking to be returned and asks the user to approve such access. The current strategy we are implementing has its usage outlined [here](https://github.com/jaredhanson/passport-github/), but we're going through it all right here on freeCodeCamp!
+
+Here's how your new strategy should look at this point:
+
+```js
+passport.use(new GitHubStrategy({
+  clientID: process.env.GITHUB_CLIENT_ID,
+  clientSecret: process.env.GITHUB_CLIENT_SECRET,
+  callbackURL: /*INSERT CALLBACK URL ENTERED INTO GITHUB HERE*/
+},
+  function(accessToken, refreshToken, profile, cb) {
+    console.log(profile);
+    //Database logic here with callback containing our user object
+  }
+));
+```
+
+Your authentication won't be successful yet, and it will actually throw an error without the database logic and callback, but it should log your GitHub profile to your console if you try it!
+
+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 [here](https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6).
+
+# --hints--
+
+passport-github dependency should be added.
+
+```js
+(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);
+    }
+  );
+```
+
+passport-github should be required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')passport-github("|')/gi,
+        'You should have required passport-github'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+GitHub strategy should be setup correctly thus far.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /passport\.use.*new GitHubStrategy/gi,
+        'Passport should use a new GitHubStrategy'
+      );
+      assert.match(
+        data,
+        /callbackURL:\s*("|').*("|')/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
new file mode 100644
index 0000000000..6e6b65cf56
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
@@ -0,0 +1,80 @@
+---
+id: 589a8eb3f9fc0f352b528e72
+title: Implementation of Social Authentication III
+challengeType: 2
+forumTopicId: 301558
+dashedName: implementation-of-social-authentication-iii
+---
+
+# --description--
+
+The final part of the strategy is handling the profile returned from GitHub. We need to load the user's 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 *id* 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 where `console.log(profile);` currently is:
+
+```js
+myDataBase.findOneAndUpdate(
+  { id: profile.id },
+  {
+    $setOnInsert: {
+      id: profile.id,
+      name: profile.displayName || 'John Doe',
+      photo: profile.photos[0].value || '',
+      email: Array.isArray(profile.emails)
+        ? profile.emails[0].value
+        : 'No public email',
+      created_on: new Date(),
+      provider: profile.provider || ''
+    },
+    $set: {
+      last_login: new Date()
+    },
+    $inc: {
+      login_count: 1
+    }
+  },
+  { upsert: true, new: true },
+  (err, doc) => {
+    return cb(null, doc.value);
+  }
+);
+```
+
+`findOneAndUpdate` allows you to search for an object and update it. If the object doesn't exist, it will be inserted and made available to the callback function. In this example, we always set `last_login`, increment the `login_count` by `1`, and only populate the majority of the fields when a new object (new user) is inserted. Notice the use of default values. Sometimes a profile returned won't have all the information filled out or the user will keep it private. In this case, you 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 the project completed up to this point [here](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745).
+
+# --hints--
+
+GitHub strategy setup should be complete.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /GitHubStrategy[^]*myDataBase/gi,
+        'Strategy should use now use the database to search for the user'
+      );
+      assert.match(
+        data,
+        /GitHubStrategy[^]*return cb/gi,
+        'Strategy should return the callback function "cb"'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
new file mode 100644
index 0000000000..2912bbed16
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
@@ -0,0 +1,82 @@
+---
+id: 589a69f5f9fc0f352b528e70
+title: Implementation of Social Authentication
+challengeType: 2
+forumTopicId: 301559
+dashedName: implementation-of-social-authentication
+---
+
+# --description--
+
+The basic path this kind of authentication will follow in your app is:
+
+1.  User clicks a button or link sending them to our route to authenticate using a specific strategy (e.g. GitHub).
+2.  Your route calls `passport.authenticate('github')` which redirects them to GitHub.
+3.  The page the user lands on, on GitHub, allows them to login if they aren't already. It then asks them to approve access to their profile from our app.
+4.  The user is then returned to our app at a specific callback url with their profile if they are approved.
+5.  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.
+
+Strategies with OAuth require you to have at least a *Client ID* and a *Client Secret* which is a way for the service 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--**THEY ARE NOT TO BE SHARED** and should never be uploaded to a public repository or written directly in your code. A common practice is to put them in your `.env` file and reference them like so: `process.env.GITHUB_CLIENT_ID`. For this challenge we're going to use the GitHub strategy.
+
+Obtaining your *Client ID and Secret* from GitHub is done in your account profile settings under 'developer settings', then '[OAuth applications](https://github.com/settings/developers)'. Click 'Register a new application', name your app, paste in the url to your Replit homepage (**Not the project code's url**), 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 for us to handle after authenticating on GitHub. Save the returned information as `'GITHUB_CLIENT_ID'` and `'GITHUB_CLIENT_SECRET'` in your `.env` file.
+
+In your `routes.js` file, add `showSocialAuth: true` to the homepage route, after `showRegistration: true`. Now, create 2 routes accepting GET requests: `/auth/github` and `/auth/github/callback`. The first should only call passport to authenticate `'github'`. 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:
+
+```js
+app.route('/login')
+  .post(passport.authenticate('local', { failureRedirect: '/' }), (req,res) => {
+    res.redirect('/profile');
+  });
+```
+
+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 [here](https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e).
+
+# --hints--
+
+Route /auth/github should be correct.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/routes.js').then(
+    (data) => {
+      assert.match(
+        data.replace(/\s/g, ''),
+        /('|")\/auth\/github\/?\1[^]*?get.*?passport.authenticate.*?github/gi,
+        'Route auth/github should only call passport.authenticate with github'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Route /auth/github/callback should be correct.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/routes.js').then(
+    (data) => {
+      assert.match(
+        data.replace(/\s/g, ''),
+        /('|")\/auth\/github\/callback\/?\1[^]*?get.*?passport.authenticate.*?github.*?failureRedirect:("|')\/\2/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
new file mode 100644
index 0000000000..ba023ef1b8
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
@@ -0,0 +1,81 @@
+---
+id: 58965611f9fc0f352b528e6c
+title: Logging a User Out
+challengeType: 2
+forumTopicId: 301560
+dashedName: logging-a-user-out
+---
+
+# --description--
+
+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 `req.logout();` before redirecting.
+
+```js
+app.route('/logout')
+  .get((req, res) => {
+    req.logout();
+    res.redirect('/');
+});
+```
+
+You may have noticed that 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:
+
+```js
+app.use((req, res, next) => {
+  res.status(404)
+    .type('text')
+    .send('Not Found');
+});
+```
+
+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 [here](https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b).
+
+# --hints--
+
+`req.Logout` should be called in your `/logout` route.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /req.logout/gi,
+        'You should be calling req.logout() in your /logout route'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Logout should redirect to the home page.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
new file mode 100644
index 0000000000..a18599d868
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -0,0 +1,205 @@
+---
+id: 58966a17f9fc0f352b528e6d
+title: Registration of New Users
+challengeType: 2
+forumTopicId: 301561
+dashedName: registration-of-new-users
+---
+
+# --description--
+
+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--`showRegistration: true`. 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 **POST** on `/register`, 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 *OR* 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, call *next* to go to step 2, authenticating the new user, which we've already written the logic for in our POST */login* route.
+
+```js
+app.route('/register')
+  .post((req, res, next) => {
+    myDataBase.findOne({ username: req.body.username }, function(err, user) {
+      if (err) {
+        next(err);
+      } else if (user) {
+        res.redirect('/');
+      } else {
+        myDataBase.insertOne({
+          username: req.body.username,
+          password: req.body.password
+        },
+          (err, doc) => {
+            if (err) {
+              res.redirect('/');
+            } else {
+              // The inserted document is held within
+              // the ops property of the doc
+              next(null, doc.ops[0]);
+            }
+          }
+        )
+      }
+    })
+  },
+    passport.authenticate('local', { failureRedirect: '/' }),
+    (req, res, next) => {
+      res.redirect('/profile');
+    }
+  );
+```
+
+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 [here](https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e).
+
+**NOTE:** From this point onwards, issues can arise relating to the use of the *picture-in-picture* browser. If you are using an online IDE which offers a preview of the app within the editor, it is recommended to open this preview in a new tab.
+
+# --hints--
+
+You should register route and display on home.
+
+```js
+(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);
+    }
+  );
+```
+
+Registering should work.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const user = `freeCodeCampTester${Date.now()}`;
+  const xhttp = new XMLHttpRequest();
+  xhttp.onreadystatechange = function () {
+    if (this.readyState == 4 && this.status == 200) {
+      test(this);
+    } else {
+      throw new Error(`${this.status} ${this.statusText}`);
+    }
+  };
+  xhttp.open('POST', url + '/register', true);
+  xhttp.setRequestHeader('Content-type', 'application/x-www-form-urlencoded');
+  xhttp.send(`username=${user}&password=${user}`);
+  function test(xhttpRes) {
+    const data = xhttpRes.responseText;
+    assert.match(
+      data,
+      /Profile/gi,
+      'Register should work, and redirect successfully to the profile.'
+    );
+  }
+};
+```
+
+Login should work.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const user = `freeCodeCampTester${Date.now()}`;
+  const xhttpReg = new XMLHttpRequest();
+  xhttpReg.onreadystatechange = function () {
+    if (this.readyState == 4 && this.status == 200) {
+      login();
+    } else {
+      throw new Error(`${this.status} ${this.statusText}`);
+    }
+  };
+  xhttpReg.open('POST', url + '/register', true);
+  xhttpReg.setRequestHeader(
+    'Content-type',
+    'application/x-www-form-urlencoded'
+  );
+  xhttpReg.send(`username=${user}&password=${user}`);
+  function login() {
+    const xhttp = new XMLHttpRequest();
+    xhttp.onreadystatechange = function () {
+      if (this.readyState == 4 && this.status == 200) {
+        test(this);
+      } else {
+        throw new Error(`${this.status} ${this.statusText}`);
+      }
+    };
+    xhttp.open('POST', url + '/login', true);
+    xhttp.setRequestHeader('Content-type', 'application/x-www-form-urlencoded');
+    xhttp.send(`username=${user}&password=${user}`);
+  }
+  function test(xhttpRes) {
+    const data = xhttpRes.responseText;
+    assert.match(
+      data,
+      /Profile/gi,
+      'Login should work if previous test was done successfully and redirect successfully to the profile.'
+    );
+    assert.match(
+      data,
+      new RegExp(user, 'g'),
+      'The profile should properly display the welcome to the user logged in'
+    );
+  }
+};
+```
+
+Logout should work.
+
+```js
+(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);
+    }
+  );
+```
+
+Profile should no longer work after logout.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
new file mode 100644
index 0000000000..e74551d1f9
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -0,0 +1,79 @@
+---
+id: 589fc832f9fc0f352b528e79
+title: Send and Display Chat Messages
+challengeType: 2
+forumTopicId: 301562
+dashedName: send-and-display-chat-messages
+---
+
+# --description--
+
+It's time you start allowing clients to send a chat message to the server to emit to all the clients! In your `client.js` file, you should see there is already a block of code handling when the message form is submitted.
+
+```js
+$('form').submit(function() {
+  /*logic*/
+});
+```
+
+Within the form submit code, you should emit an event after you define `messageToSend` but before you clear the text box `#m`. The event should be named `'chat message'` and the data should just be `messageToSend`.
+
+```js
+socket.emit('chat message', messageToSend);
+```
+
+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 received, it should emit the event `'chat message'` to all sockets `io.emit` with the data being an object containing `name` and `message`.
+
+In `client.js`, you should now listen for event `'chat message'` and, when received, append a list item to `#messages` 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 completed up to this point [here](https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016).
+
+# --hints--
+
+Server should listen for `'chat message'` and then emit it properly.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")chat message('|")[^]*io.emit.*('|")chat message('|").*name.*message/gis,
+        '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);
+    }
+  );
+```
+
+Client should properly handle and display the new data from event `'chat message'`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/client.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")chat message('|")[^]*messages.*li/gis,
+        '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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
new file mode 100644
index 0000000000..32b3ab7963
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
@@ -0,0 +1,131 @@
+---
+id: 5895f70cf9fc0f352b528e66
+title: Serialization of a User Object
+challengeType: 2
+forumTopicId: 301563
+dashedName: serialization-of-a-user-object
+---
+
+# --description--
+
+Serialization and deserialization are important concepts in regards to authentication. To serialize an object means to convert its contents into a small *key* that can then be deserialized into the original object. This is what allows us to know who has communicated with the server without having to send the authentication data, like the 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 `passport.serializeUser( OURFUNCTION )` and `passport.deserializeUser( OURFUNCTION )`
+
+The `serializeUser` is called with 2 arguments, the full user object and a callback used by passport. A unique key to identify that user should be returned in the callback, the easiest one to use being the user's `_id` in the object. It should be unique as it is 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 full user object to the callback. To make a query search for a Mongo `_id`, you will have to create `const ObjectID = require('mongodb').ObjectID;`, and then to use it you call `new ObjectID(THE_ID)`. Be sure to add `mongodb@~3.6.0` as a dependency. You can see this in the examples below:
+
+```js
+passport.serializeUser((user, done) => {
+  done(null, user._id);
+});
+
+passport.deserializeUser((id, done) => {
+  myDataBase.findOne({ _id: new ObjectID(id) }, (err, doc) => {
+    done(null, null);
+  });
+});
+```
+
+NOTE: This `deserializeUser` will throw an error until we set up the DB in the next step, so for now comment out the whole block and just call `done(null, null)` in the function `deserializeUser`.
+
+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 [here](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048).
+
+# --hints--
+
+You should serialize user function correctly.
+
+```js
+(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,\s*user._id/gi,
+        'There should be a callback in your serializeUser with (null, user._id)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+You should deserialize user function correctly.
+
+```js
+(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,\s*null/gi,
+        'There should be a callback in your deserializeUser with (null, null) for now'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+MongoDB should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+Mongodb should be properly required including the ObjectId.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')mongodb\1/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
new file mode 100644
index 0000000000..0a89bd5293
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -0,0 +1,116 @@
+---
+id: 5895f700f9fc0f352b528e63
+title: Set up a Template Engine
+challengeType: 2
+forumTopicId: 301564
+dashedName: set-up-a-template-engine
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-advancednode/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-advancednode) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+A template engine enables you to use static template files (such as those written in *Pug*) in your app. At runtime, the template engine replaces variables in a template file with actual values which can be supplied by your server. Then it transforms the template into a static HTML file that is sent to the client. This approach makes it easier to design an HTML page and allows for displaying variables on the page without needing to make an API call from the client.
+
+Add `pug@~3.0.0` as a dependency in your `package.json` file.
+
+Express needs to know which template engine you are using. We will use the `set` method to assign `pug` as the `view engine` property's value: `app.set('view engine', 'pug')`
+
+Your page will not load until you correctly render the index file in the `views/pug` directory.
+
+Change the argument of the `res.render()` declaration in the `/` route to be the file path to the `views/pug` directory. The path can be a relative path (relative to views), or an absolute path, and does not require a file extension.
+
+If all went as planned, your app home page will stop showing the message "`Pug template is not defined.`" and will now display a message indicating you've successfully rendered the Pug template!
+
+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 [here](https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791).
+
+# --hints--
+
+Pug should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+View engine should be Pug.
+
+```js
+(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);
+    }
+  );
+```
+
+Use the correct ExpressJS method to render the index page from the response.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/').then(
+    (data) => {
+      assert.match(
+        data,
+        /FCC Advanced Node and Express/gi,
+        'You successfully rendered the Pug template!'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Pug should be working.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
new file mode 100644
index 0000000000..98c406d1d2
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -0,0 +1,132 @@
+---
+id: 5895f70cf9fc0f352b528e65
+title: Set up Passport
+challengeType: 2
+forumTopicId: 301565
+dashedName: set-up-passport
+---
+
+# --description--
+
+It's time to set up *Passport* 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 *key* 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. `passport@~0.4.1`
+
+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! `express-session@~1.17.1`
+
+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 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!
+
+```js
+app.use(session({
+  secret: process.env.SESSION_SECRET,
+  resave: true,
+  saveUninitialized: true,
+  cookie: { secure: false }
+}));
+```
+
+As well you can go ahead and tell your express app to **use** 'passport.initialize()' and 'passport.session()'. (For example, `app.use(passport.initialize());`)
+
+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 [here](https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c).
+
+# --hints--
+
+Passport and Express-session should be dependencies.
+
+```js
+(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);
+    }
+  );
+```
+
+Dependencies should be correctly required.
+
+```js
+(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);
+    }
+  );
+```
+
+Express app should use new dependencies.
+
+```js
+(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);
+    }
+  );
+```
+
+Session and session secret should be correctly set up.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
new file mode 100644
index 0000000000..9da23f8cac
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -0,0 +1,148 @@
+---
+id: 589fc830f9fc0f352b528e74
+title: Set up the Environment
+challengeType: 2
+forumTopicId: 301566
+dashedName: set-up-the-environment
+---
+
+# --description--
+
+The following challenges will make use of the `chat.pug` file. So, in your `routes.js` file, add a GET route pointing to `/chat` which makes use of `ensureAuthenticated`, and renders `chat.pug`, with `{ user: req.user }` passed as an argument to the response. Now, alter your existing `/auth/github/callback` route to set the `req.session.user_id = req.user.id`, and redirect to `/chat`.
+
+Add `socket.io@~2.3.0` as a dependency and require/instantiate it in your server defined as follows, with `http` (comes built-in with Nodejs):
+
+```javascript
+const http = require('http').createServer(app);
+const io = require('socket.io')(http);
+```
+
+Now that the *http* server is mounted on the *express app*, you need to listen from the *http* server. Change the line with `app.listen` to `http.listen`.
+
+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 that's emitted, and a function with which the data is passed though. In the case of our connection listener, we use *socket* to define the data in the second argument. A socket is an individual client who is connected.
+
+To listen for connections to your server, add the following within your database connection:
+
+```javascript
+io.on('connection', socket => {
+  console.log('A user has connected');
+});
+```
+
+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:
+
+```js
+/*global io*/
+let socket = io();
+```
+
+The comment suppresses 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'!
+
+**Note:**`io()` works only when connecting to a socket hosted on the same url/server. For connecting to an external socket hosted elsewhere, you would use `io.connect('URL');`.
+
+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 [here](https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1).
+
+# --hints--
+
+`socket.io` should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+You should correctly require and instantiate `http` as `http`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /http.*=.*require.*('|")http\1/gi,
+        'Your project should list "http" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+You should correctly require and instantiate `socket.io` as `io`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.*=.*require.*('|")socket.io\1.*http/gi,
+        'You should correctly require and instantiate socket.io as io.'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Socket.IO should be listening for connections.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.on.*('|")connection\1.*socket/gi,
+        'io should listen for "connection" and socket should be the 2nd arguments variable'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Your client should connect to your server.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
new file mode 100644
index 0000000000..3f605fa3ab
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -0,0 +1,53 @@
+---
+id: 5895f70bf9fc0f352b528e64
+title: Use a Template Engine's Powers
+challengeType: 2
+forumTopicId: 301567
+dashedName: use-a-template-engines-powers
+---
+
+# --description--
+
+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 able to use a variable by referencing the variable name as `#{variable_name}` inline with other text on an element or by using an equal sign on the element without a space such as `p=variable_name` which assigns the variable's value to the p element's text.
+
+We strongly recommend looking at the syntax and structure of Pug [here](https://github.com/pugjs/pug) on GitHub's 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 *title* and *message*.
+
+To pass those along from our server, you will need to add an object as a second argument to your *res.render* with the variables and their values. For example, pass this object along setting the variables for your index view: `{title: 'Hello', message: 'Please login'}`
+
+It should look like: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Now refresh your page and you should see those values rendered in your view in the correct spot as laid out in your index.pug file!
+
+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 [here](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871).
+
+# --hints--
+
+Pug should correctly render variables.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
new file mode 100644
index 0000000000..df609ee419
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -0,0 +1,79 @@
+---
+id: 587d824c367417b2b2512c4c
+title: Assert Deep Equality with .deepEqual and .notDeepEqual
+challengeType: 2
+forumTopicId: 301587
+dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`deepEqual()` asserts that two objects are deep equal.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#7` in the `Equality` suite, change each `assert` to either `assert.deepEqual` or `assert.notDeepEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=6').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `deepEqual` vs. `notDeepEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `deepEqual` vs. `notDeepEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
new file mode 100644
index 0000000000..30f1e51eee
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
@@ -0,0 +1,109 @@
+---
+id: 587d824c367417b2b2512c4d
+title: Compare the Properties of Two Elements
+challengeType: 2
+forumTopicId: 301588
+dashedName: compare-the-properties-of-two-elements
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#8` in the `Comparisons` suite, change each `assert` to either `assert.isAbove` or `assert.isAtMost` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
new file mode 100644
index 0000000000..9f855975a0
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
@@ -0,0 +1,75 @@
+---
+id: 587d824a367417b2b2512c46
+title: Learn How JavaScript Assertions Work
+challengeType: 2
+forumTopicId: 301589
+dashedName: learn-how-javascript-assertions-work
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-mochachai/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#1` in the `Basic Assertions` suite, change each `assert` to either `assert.isNull` or `assert.isNotNull` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=0').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isNull` vs. `isNotNull`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isNull` vs. `isNotNull`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
new file mode 100644
index 0000000000..f9ca69d575
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
@@ -0,0 +1,140 @@
+---
+id: 587d824f367417b2b2512c5a
+title: Run Functional Tests on an API Response using Chai-HTTP III - PUT method
+challengeType: 2
+forumTopicId: 301590
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+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:
+
+```json
+{
+  "surname": [last name of a traveller of the past]
+}
+```
+
+The route responds with :
+
+```json
+{
+  "name": [first name], "surname": [last name], "dates": [birth - death years]
+}
+```
+
+See the server code for more details.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'send {surname: "Colombo"}'` test (`// #3`):
+
+Send the following JSON response as a payload:
+
+```json
+{
+  "surname": "Colombo"
+}
+```
+
+Check for the following, within the `request.end` callback:
+
+1.  `status`
+2.  `type`
+3.  `body.name`
+4.  `body.surname`
+
+Follow the assertion order above - we rely on it. Be sure to remove `assert.fail()`, once complete.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' to be 200.
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.type' to be 'application/json'.
+
+```js
+(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.match(data.assertions[1].args[1], /('|")application\/json\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.name' to be 'Cristoforo'.
+
+```js
+(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.match(data.assertions[2].args[1], /('|")Cristoforo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.surname' to be 'Colombo'.
+
+```js
+(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.match(data.assertions[3].args[1], /('|")Colombo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
new file mode 100644
index 0000000000..c4644a785f
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
@@ -0,0 +1,124 @@
+---
+id: 587d824f367417b2b2512c5b
+title: Run Functional Tests on an API Response using Chai-HTTP IV - PUT method
+challengeType: 2
+forumTopicId: 301591
+dashedName: run-functional-tests-on-an-api-response-using-chai-http-iv---put-method
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/). This exercise is similar to the preceding one. Look at it for the details.
+
+Now that you have seen how it is done, it is your turn to do it from scratch.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'send {surname: "da Verrazzano"}'` test (`// #4`):
+
+Send the following JSON response as a payload to the `/travellers` route:
+
+```json
+{
+  "surname": "da Verrazzano"
+}
+```
+
+Check for the following, within a `request.end` callback:
+
+1.  `status`
+2.  `type`
+3.  `body.name`
+4.  `body.surname`
+
+Follow the assertion order above - we rely on it. Be sure to remove `assert.fail()`, once complete.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' to be 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.type' to be 'application/json'
+
+```js
+(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.match(data.assertions[1].args[1], /('|")application\/json\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.name' to be 'Giovanni'
+
+```js
+(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.match(data.assertions[2].args[1], /('|")Giovanni\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.surname' to be 'da Verrazzano'
+
+```js
+(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.match(data.assertions[3].args[1], /('|")da Verrazzano\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
new file mode 100644
index 0000000000..53d2c7459e
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
@@ -0,0 +1,75 @@
+---
+id: 587d824f367417b2b2512c59
+title: Run Functional Tests on API Endpoints using Chai-HTTP II
+challengeType: 2
+forumTopicId: 301592
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'Test GET /hello with your name'` test (`// #2`) to assert the `status` and the `text` response to make the test pass.
+
+Send your name in the query, appending `?name=<your_name>` to the route. The endpoint responds with `'hello <your_name>'`.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=1').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' == 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.text' == 'hello Guest'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
new file mode 100644
index 0000000000..dc99b2d46a
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
@@ -0,0 +1,101 @@
+---
+id: 587d824e367417b2b2512c58
+title: Run Functional Tests on API Endpoints using Chai-HTTP
+challengeType: 2
+forumTopicId: 301593
+dashedName: run-functional-tests-on-api-endpoints-using-chai-http
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+Mocha allows testing asyncronous operations. There is a small (BIG) difference. Can you spot it?
+
+We can test our API endpoints using a plugin, called `chai-http`. Let's see how it works. And remember, API calls are asynchronous.
+
+The following is an example of a test using `chai-http` for the `'GET /hello?name=[name] => "hello [name]"'` suite. The test sends a name string in a url query string (`?name=John`) using a `GET`request to the `server`. In the `end` method's callback function, the response object (`res`) is received and contains the `status` property. The first `assert.equal` checks if the status is equal to `200`. The second `assert.equal` checks that the response string (`res.text`) is equal to `"hello John"`.
+
+```js
+suite('GET /hello?name=[name] => "hello [name]"', function () {
+  test("?name=John", function (done) {
+    chai
+      .request(server)
+      .get("/hello?name=John")
+      .end(function (err, res) {
+        assert.equal(res.status, 200, "response status should be 200");
+        assert.equal(
+          res.text,
+          "hello John",
+          'response should be "hello John"'
+        );
+        done();
+      });
+  });
+```
+
+Notice the `done` parameter in the test's callback function. Calling it at the end without an argument is necessary to signal successful asynchronous completion.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'Test GET /hello with no name'` test (`// #1`) to assert the `status` and the `text` response to make the test pass. Do not alter the arguments passed to the asserts.
+
+There should be no name in the query; the endpoint responds with `hello Guest`.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=0').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' == 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.text' == 'hello Guest'
+
+```js
+(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.match(data.assertions[1].args[1], /('|")hello Guest\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
new file mode 100644
index 0000000000..d34360de18
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
@@ -0,0 +1,115 @@
+---
+id: 5f8884f4c46685731aabfc41
+title: Run Functional Tests Using a Headless Browser II
+challengeType: 2
+forumTopicId: 301594
+dashedName: run-functional-tests-using-a-headless-browser-ii
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, in the `'submit "surname" : "Vespucci" - write your e2e test...'` test (`// #6`), automate filling-in and submitting the form from scratch:
+
+1.  Fill in the form with the `surname` of `Vespucci`
+2.  Submit it pressing `'submit'` button
+
+Within the callback:
+
+1.  assert that status is `200`
+2.  assert that the text inside the element `span#name` is `'Amerigo'`
+3.  assert that the text inside the element `span#surname` is `'Vespucci'`
+4.  assert that the element(s) `span#dates` exist and their count is `1`
+
+Do not forget to to remove the `assert.fail()` call.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the headless browser request succeeded.
+
+```js
+(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);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#name' is 'Amerigo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'browser.text');
+      assert.match(data.assertions[1].args[0], /('|")span#name\1/);
+      assert.match(data.assertions[1].args[1], /('|")Amerigo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#surname' is 'Vespucci'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'browser.text');
+      assert.match(data.assertions[2].args[0], /('|")span#surname\1/);
+      assert.match(data.assertions[2].args[1], /('|")Vespucci\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the element 'span#dates' exist and its count is 1.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[3].method, 'browser.elements');
+      assert.match(data.assertions[3].args[0], /('|")span#dates\1/);
+      assert.equal(data.assertions[3].args[1], 1);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
new file mode 100644
index 0000000000..3da3211b67
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
@@ -0,0 +1,140 @@
+---
+id: 587d8250367417b2b2512c5d
+title: Run Functional Tests using a Headless Browser
+challengeType: 2
+forumTopicId: 301595
+dashedName: run-functional-tests-using-a-headless-browser
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+In the HTML main view we provided a input form. It sends data to the `PUT /travellers` endpoint that we used above with an Ajax request. When the request successfully completes, the client code appends a `<div>` containing the info returned by the call to the DOM. Here is an example of how to interact with this form:
+
+```js
+test('#test - submit the input "surname" : "Polo"', function (done) {
+  browser.fill('surname', 'Polo').pressButton('submit', function () {
+    browser.assert.success();
+    browser.assert.text('span#name', 'Marco');
+    browser.assert.text('span#surname', 'Polo');
+    browser.assert.elements('span#dates', 1);
+    done();
+  });
+}
+```
+
+First, the `fill` method of the `browser` object fills the `surname` field of the form with the value `'Polo'`. Immediately after, the `pressButton` method invokes the `submit` event listener of the form. The `pressButton` method is asynchronous.
+
+Then, once a response is received from the AJAX request, a few assertions are made confirming:
+
+1.  The status of the response is `200`
+2.  The text within the `<span id='name'></span>` element matches `'Marco'`
+3.  The text within the `<span id='surname'></span>` element matches `'Polo'`
+4.  There is `1` `<span id='dates'></span>` element.
+
+Finally, the `done` callback is invoked, which is needed due to the asynchronous test.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, in the `'submit "surname" : "Colombo" - write your e2e test...'` test (`// #5`), automate filling-in and submitting the form:
+
+1.  Fill in the form
+2.  Submit it pressing `'submit'` button.
+
+Within the callback:
+
+1.  assert that status is OK `200`
+2.  assert that the text inside the element `span#name` is `'Cristoforo'`
+3.  assert that the text inside the element `span#surname` is `'Colombo'`
+4.  assert that the element(s) `span#dates` exist and their count is `1`
+
+Do not forget to remove the `assert.fail()` call.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the headless browser request succeeded.
+
+```js
+(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);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#name' is 'Cristoforo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'browser.text');
+      assert.match(data.assertions[1].args[0], /('|")span#name\1/);
+      assert.match(data.assertions[1].args[1], /('|")Cristoforo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#surname' is 'Colombo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'browser.text');
+      assert.match(data.assertions[2].args[0], /('|")span#surname\1/);
+      assert.match(data.assertions[2].args[1], /('|")Colombo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the element 'span#dates' exist and its count is 1.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[3].method, 'browser.elements');
+      assert.match(data.assertions[3].args[0], /('|")span#dates\1/);
+      assert.equal(data.assertions[3].args[1], 1);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
new file mode 100644
index 0000000000..7bf0765de5
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
@@ -0,0 +1,76 @@
+---
+id: 587d824f367417b2b2512c5c
+title: Simulate Actions Using a Headless Browser
+challengeType: 2
+dashedName: simulate-actions-using-a-headless-browser
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+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. This kind of tool is particularly useful for testing web pages, as it is 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 Replit. There are many other (more powerful) options.
+
+Mocha allows you to prepare the ground running some code before the actual tests. This can be useful for example to create items in the database, which will be used in the successive tests.
+
+With a headless browser, before the actual testing, we need to **visit** the page we are going to inspect. The `suiteSetup` 'hook' is executed only once at the suite startup. Other different hook types can be executed before each test, after each test, or at the end of a suite. See the Mocha docs for more information.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, immediately after the `Browser` declaration, add your project URL to the `site` property of the variable:
+
+```js
+Browser.site = 'https://sincere-cone.gomix.me'; // Your URL here
+```
+
+If you are testing on a local environment replace the line above with
+
+```js
+Browser.localhost('example.com', process.env.PORT || 3000);
+```
+
+Within `tests/2_functional-tests.js`, at the root level of the `'Functional Tests with Zombie.js'` suite, instantiate a new instance of the `Browser` object with the following code:
+
+```js
+const browser = new Browser();
+```
+
+Then, use the `suiteSetup` hook to direct the `browser` to the `/` route with the following code:
+
+```js
+suiteSetup(function(done) {
+  return browser.visit('/', done);
+});
+```
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional').then(
+    (data) => {
+      data.slice(0, 4).forEach((test) => {
+        assert.equal(test.state, 'passed');
+      })
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
new file mode 100644
index 0000000000..a12fe6397b
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
@@ -0,0 +1,101 @@
+---
+id: 587d824b367417b2b2512c49
+title: Test for Truthiness
+challengeType: 2
+forumTopicId: 301596
+dashedName: test-for-truthiness
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isTrue()` will test for the boolean value `true` and `isNotTrue()` will pass when given anything but the boolean value of `true`.
+
+```js
+assert.isTrue(true, 'this will pass with the boolean value true');
+assert.isTrue('true', 'this will NOT pass with the string value "true"');
+assert.isTrue(1, 'this will NOT pass with the number value 1');
+```
+
+`isFalse()` and `isNotFalse()` also exist, and behave similarly to their true counterparts except they look for the boolean value of `false`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#4` in the `Basic Assertions` suite, change each `assert` to either `assert.isTrue` or `assert.isNotTrue` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
new file mode 100644
index 0000000000..60bf0f0bd1
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
@@ -0,0 +1,79 @@
+---
+id: 587d824d367417b2b2512c53
+title: Test if a String Contains a Substring
+challengeType: 2
+forumTopicId: 301597
+dashedName: test-if-a-string-contains-a-substring
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`include()` and `notInclude()` work for strings too! `include()` asserts that the actual string contains the expected substring.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#14` in the `Strings` suite, change each `assert` to either `assert.include` or `assert.notInclude` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=13').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `include` vs. `notInclude`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `include` vs. `notInclude`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
new file mode 100644
index 0000000000..7cddc15804
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
@@ -0,0 +1,87 @@
+---
+id: 587d824c367417b2b2512c4f
+title: Test if a Value Falls within a Specific Range
+challengeType: 2
+forumTopicId: 301598
+dashedName: test-if-a-value-falls-within-a-specific-range
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+```javascript
+.approximately(actual, expected, delta, [message])
+```
+
+Asserts that the `actual` is equal to `expected`, to within a +/- `delta` range.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#10` in the `Comparisons` suite, change each `assert` to `assert.approximately` to make the test pass (should evaluate to `true`).
+
+Choose the minimum range (3rd parameter) to make the test always pass. It should be less than 1.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct range for the first assertion - `approximately(actual, expected, range)`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.assertions[0].method, 'approximately');
+      assert.equal(
+        data.assertions[0].args[2],
+        0.5,
+        "weirdNumbers(0.5) is in the range (0.5, 1.5]. It's within 1 +/- 0.5"
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct range for the second assertion - `approximately(actual, expected, range)`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'approximately');
+      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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
new file mode 100644
index 0000000000..9fa5b147ec
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
@@ -0,0 +1,93 @@
+---
+id: 587d824d367417b2b2512c52
+title: Test if a Value is a String
+challengeType: 2
+forumTopicId: 301599
+dashedName: test-if-a-value-is-a-string
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isString` or `isNotString` asserts that the actual value is a string.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#13` in the `Strings` suite, change each `assert` to either `assert.isString` or `assert.isNotString` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isString` vs. `isNotString`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isString` vs. `isNotString`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isString` vs. `isNotString`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
new file mode 100644
index 0000000000..3ed6428022
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
@@ -0,0 +1,77 @@
+---
+id: 587d824d367417b2b2512c50
+title: Test if a Value is an Array
+challengeType: 2
+forumTopicId: 301600
+dashedName: test-if-a-value-is-an-array
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#11` in the `Arrays` suite, change each `assert` to either `assert.isArray` or `assert.isNotArray` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isArray` vs. `isNotArray`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isArray` vs. `isNotArray`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
new file mode 100644
index 0000000000..55b278c0df
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
@@ -0,0 +1,133 @@
+---
+id: 587d824e367417b2b2512c56
+title: Test if a Value is of a Specific Data Structure Type
+challengeType: 2
+forumTopicId: 301601
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`#typeOf` asserts that value's type is the given string, as determined by `Object.prototype.toString`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#17` in the `Objects` suite, change each `assert` to either `assert.typeOf` or `assert.notTypeOf` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(
+    (data) => {
+      assert.equal(
+        data.assertions[2].method,
+        'notTypeOf',
+        'Plane.wings is a Number (not a String)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fifth assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
new file mode 100644
index 0000000000..426165f522
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
@@ -0,0 +1,95 @@
+---
+id: 587d824b367417b2b2512c47
+title: Test if a Variable or Function is Defined
+challengeType: 2
+forumTopicId: 301602
+dashedName: test-if-a-variable-or-function-is-defined
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#2` in the `Basic Assertions` suite, change each `assert` to either `assert.isDefined()` or `assert.isUndefined()` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
new file mode 100644
index 0000000000..0938de8bfc
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
@@ -0,0 +1,77 @@
+---
+id: 587d824d367417b2b2512c51
+title: Test if an Array Contains an Item
+challengeType: 2
+forumTopicId: 301603
+dashedName: test-if-an-array-contains-an-item
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#12` in the `Arrays` suite, change each `assert` to either `assert.include` or `assert.notInclude` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=11').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `include` vs. `notInclude`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `include` vs. `notInclude`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
new file mode 100644
index 0000000000..54540528da
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
@@ -0,0 +1,93 @@
+---
+id: 587d824e367417b2b2512c55
+title: Test if an Object has a Property
+challengeType: 2
+forumTopicId: 301604
+dashedName: test-if-an-object-has-a-property
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`property` asserts that the actual object has a given property.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#16` in the `Objects` suite, change each `assert` to either `assert.property` or `assert.notProperty` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `property` vs. `notProperty`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `property` vs. `notProperty`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `property` vs. `notProperty`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
new file mode 100644
index 0000000000..6855c8a644
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
@@ -0,0 +1,115 @@
+---
+id: 587d824e367417b2b2512c57
+title: Test if an Object is an Instance of a Constructor
+challengeType: 2
+forumTopicId: 301605
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`#instanceOf` asserts that an object is an instance of a constructor.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#18` in the `Objects` suite, change each `assert` to either `assert.instanceOf` or `assert.notInstanceOf` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
new file mode 100644
index 0000000000..66f6d98b9d
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
@@ -0,0 +1,109 @@
+---
+id: 587d824c367417b2b2512c4e
+title: Test if One Value is Below or At Least as Large as Another
+challengeType: 2
+forumTopicId: 301606
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#9` in the `Comparisons` suite, change each `assert` to either `assert.isBelow` or `assert.isAtLeast` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(
+        data.assertions[1].method,
+        'isAtLeast',
+        '2 * Math.random() is at least 0'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'isBelow', '1 is smaller than 2');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(
+        data.assertions[3].method,
+        'isBelow',
+        '2/3 (0.6666) is smaller than 1'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
new file mode 100644
index 0000000000..cf5da7e951
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
@@ -0,0 +1,87 @@
+---
+id: 587d824b367417b2b2512c48
+title: Use Assert.isOK and Assert.isNotOK
+challengeType: 2
+forumTopicId: 301607
+dashedName: use-assert-isok-and-assert-isnotok
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isOk()` will test for a truthy value, and `isNotOk()` will test for a falsy value.
+
+To learn more about truthy and falsy values, try our [Falsy Bouncer](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer) challenge.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#3` in the `Basic Assertions` suite, change each `assert` to either `assert.isOk()` or `assert.isNotOk()` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isOk` vs. `isNotOk`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(
+    (data) => {
+      assert.equal(data.assertions[0].method, 'isNotOk', 'Null is falsy');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isOk` vs. `isNotOk`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isOk` vs. `isNotOk`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
new file mode 100644
index 0000000000..676b8b07b8
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
@@ -0,0 +1,79 @@
+---
+id: 587d824d367417b2b2512c54
+title: Use Regular Expressions to Test a String
+challengeType: 2
+forumTopicId: 301608
+dashedName: use-regular-expressions-to-test-a-string
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`match()` asserts that the actual value matches the second argument regular expression.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#15` in the `Strings` suite, change each `assert` to either `assert.match` or `assert.notMatch` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=14').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `match` vs. `notMatch`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `match` vs. `notMatch`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
new file mode 100644
index 0000000000..2878f794bd
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
@@ -0,0 +1,111 @@
+---
+id: 587d824b367417b2b2512c4a
+title: Use the Double Equals to Assert Equality
+challengeType: 2
+forumTopicId: 301609
+dashedName: use-the-double-equals-to-assert-equality
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`equal()` compares objects using `==`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#5` in the `Equality` suite, change each `assert` to either `assert.equal` or `assert.notEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `equal` vs. `notEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
new file mode 100644
index 0000000000..b8e6aeedd2
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
@@ -0,0 +1,111 @@
+---
+id: 587d824b367417b2b2512c4b
+title: Use the Triple Equals to Assert Strict Equality
+challengeType: 2
+forumTopicId: 301610
+dashedName: use-the-triple-equals-to-assert-strict-equality
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`strictEqual()` compares objects using `===`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#6` in the `Equality` suite, change each `assert` to either `assert.strictEqual` or `assert.notStrictEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/american-british-translator.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/american-british-translator.md
new file mode 100644
index 0000000000..0f778edc57
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/american-british-translator.md
@@ -0,0 +1,337 @@
+---
+id: 5e601c0d5ac9d0ecd8b94afe
+title: American British Translator
+challengeType: 4
+forumTopicId: 462358
+dashedName: american-british-translator
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://american-british-translator.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+-   All logic can go into `/components/translator.js`
+-   Complete the `/api/translate` route in `/routes/api.js`
+-   Create all of the unit/functional tests in `tests/1_unit-tests.js` and `tests/2_functional-tests.js`
+-   See the JavaScript files in `/components` for the different spelling and terms your application should translate
+-   To run the tests on Replit, set `NODE_ENV` to `test` without quotes in the `.env` file
+-   To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+-   Translate `Mangoes are my favorite fruit.` to British English
+-   Translate `I ate yogurt for breakfast.` to British English
+-   Translate `We had a party at my friend's condo.` to British English
+-   Translate `Can you toss this in the trashcan for me?` to British English
+-   Translate `The parking lot was full.` to British English
+-   Translate `Like a high tech Rube Goldberg machine.` to British English
+-   Translate `To play hooky means to skip class or work.` to British English
+-   Translate `No Mr. Bond, I expect you to die.` to British English
+-   Translate `Dr. Grosh will see you now.` to British English
+-   Translate `Lunch is at 12:15 today.` to British English
+-   Translate `We watched the footie match for a while.` to American English
+-   Translate `Paracetamol takes up to an hour to work.` to American English
+-   Translate `First, caramelise the onions.` to American English
+-   Translate `I spent the bank holiday at the funfair.` to American English
+-   Translate `I had a bicky then went to the chippy.` to American English
+-   Translate `I've just got bits and bobs in my bum bag.` to American English
+-   Translate `The car boot sale at Boxted Airfield was called off.` to American English
+-   Translate `Have you met Mrs Kalyani?` to American English
+-   Translate `Prof Joyner of King's College, London.` to American English
+-   Translate `Tea time is usually around 4 or 4.30.` to American English
+-   Highlight translation in `Mangoes are my favorite fruit.`
+-   Highlight translation in `I ate yogurt for breakfast.`
+-   Highlight translation in `We watched the footie match for a while.`
+-   Highlight translation in `Paracetamol takes up to an hour to work.`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Translation with text and locale fields: POST request to `/api/translate`
+-   Translation with text and invalid locale field: POST request to `/api/translate`
+-   Translation with missing text field: POST request to `/api/translate`
+-   Translation with missing locale field: POST request to `/api/translate`
+-   Translation with empty text: POST request to `/api/translate`
+-   Translation with text that needs no translation: POST request to `/api/translate`
+
+# --hints--
+
+I can provide my own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/american-british-translator\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can `POST` to `/api/translate` with a body containing `text` with the text to translate and `locale` with either `american-to-british` or `british-to-american`. The returned object should contain the submitted `text` and `translation` with the translated text.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Mangoes are my favorite fruit.';
+    const locale = 'american-to-british';
+    const output = {
+      text: 'Mangoes are my favorite fruit.',
+      translation:
+        'Mangoes are my <span class="highlight">favourite</span> fruit.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `/api/translate` route should handle the way time is written in American and British English. For example, ten thirty is written as "10.30" in British English and "10:30" in American English. The `span` element should wrap the entire time string, i.e. `<span class="highlight">10:30</span>`.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Lunch is at 12:15 today.';
+    const locale = 'american-to-british';
+    const output = {
+      text: text,
+      translation: 'Lunch is at <span class="highlight">12.15</span> today.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `/api/translate` route should also handle the way titles/honorifics are abbreviated in American and British English. For example, Doctor Wright is abbreviated as "Dr Wright" in British English and "Dr. Wright" in American English. See `/public/american-to-british-titles.js` for the different titles your application should handle.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Dr. Grosh will see you now.';
+    const locale = 'american-to-british';
+    const output = {
+      text: text,
+      translation: '<span class="highlight">Dr</span> Grosh will see you now.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+Wrap any translated spelling or terms with `<span class="highlight">...</span>` tags so they appear in green.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Mangoes are my favorite fruit.';
+    const locale = 'american-to-british';
+    const output = {
+      text: 'Mangoes are my favorite fruit.',
+      translation:
+        'Mangoes are my <span class="highlight">favourite</span> fruit.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If one or more of the required fields is missing, return `{ error: 'Required field(s) missing' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'american-to-british';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'Required field(s) missing');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `text` is empty, return `{ error: 'No text to translate' }`
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'american-to-british';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text: '', locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'No text to translate');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `locale` does not match one of the two specified locales, return `{ error: 'Invalid value for locale field' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = "Ceci n'est pas une pipe";
+    const locale = 'french-to-american';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'Invalid value for locale field');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `text` requires no translation, return `"Everything looks good to me!"` for the `translation` value.
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'british-to-american';
+    const output = {
+      text: 'SaintPeter and nhcarrigan give their regards!',
+      translation: 'Everything looks good to me!'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text: output.text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 24 unit tests are complete and passing. See `/tests/1_unit-tests.js` for the expected behavior you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const unitTests = getTests.filter((test) => {
+      return !!test.context.match(/Unit Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 24, 'At least 24 tests passed');
+    unitTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 6 functional tests are complete and passing. See `/tests/2_functional-tests.js` for the functionality you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const functTests = getTests.filter((test) => {
+      return !!test.context.match(/Functional Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 6, 'At least 6 tests passed');
+    functTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/issue-tracker.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/issue-tracker.md
new file mode 100644
index 0000000000..a2fce8e7c3
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/issue-tracker.md
@@ -0,0 +1,369 @@
+---
+id: 587d8249367417b2b2512c42
+title: Issue Tracker
+challengeType: 4
+forumTopicId: 301569
+dashedName: issue-tracker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://issue-tracker.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-issuetracker/) and complete your project locally.
+-   Use [this Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+-   Complete the necessary routes in `/routes/api.js`
+-   Create all of the functional tests in `tests/2_functional-tests.js`
+-   Copy the `sample.env` file to `.env` and set the variables appropriately
+-   To run the tests uncomment `NODE_ENV=test` in your `.env` file
+-   To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Create an issue with every field: POST request to `/api/issues/{project}`
+-   Create an issue with only required fields: POST request to `/api/issues/{project}`
+-   Create an issue with missing required fields: POST request to `/api/issues/{project}`
+-   View issues on a project: GET request to `/api/issues/{project}`
+-   View issues on a project with one filter: GET request to `/api/issues/{project}`
+-   View issues on a project with multiple filters: GET request to `/api/issues/{project}`
+-   Update one field on an issue: PUT request to `/api/issues/{project}`
+-   Update multiple fields on an issue: PUT request to `/api/issues/{project}`
+-   Update an issue with missing `_id`: PUT request to `/api/issues/{project}`
+-   Update an issue with no fields to update: PUT request to `/api/issues/{project}`
+-   Update an issue with an invalid `_id`: PUT request to `/api/issues/{project}`
+-   Delete an issue: DELETE request to `/api/issues/{project}`
+-   Delete an issue with an invalid `_id`: DELETE request to `/api/issues/{project}`
+-   Delete an issue with missing `_id`: DELETE request to `/api/issues/{project}`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(!/.*\/issue-tracker\.freecodecamp\.rocks/.test(getUserInput('url')));
+};
+```
+
+You can send a `POST` request to `/api/issues/{projectname}` with form data containing the required fields `issue_title`, `issue_text`, `created_by`, and optionally `assigned_to` and `status_text`.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'Faux Issue Title',
+      issue_text: 'Functional Test - Required Fields Only',
+      created_by: 'fCC'
+    };
+    const data = await $.post(
+      getUserInput('url') + '/api/issues/fcc-project',
+      test_data
+    );
+    assert.isObject(data);
+    assert.nestedInclude(data, test_data);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `POST` request to `/api/issues/{projectname}` will return the created object, and must include all of the submitted fields. Excluded optional fields will be returned as empty strings. Additionally, include `created_on` (date/time), `updated_on` (date/time), `open` (boolean, `true` for open - default value, `false` for closed), and `_id`.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'Faux Issue Title 2',
+      issue_text: 'Functional Test - Every field filled in',
+      created_by: 'fCC',
+      assigned_to: 'Chai and Mocha'
+    };
+    const data = await $.post(
+      getUserInput('url') + '/api/issues/fcc-project',
+      test_data
+    );
+    assert.isObject(data);
+    assert.nestedInclude(data, test_data);
+    assert.property(data, 'created_on');
+    assert.isNumber(Date.parse(data.created_on));
+    assert.property(data, 'updated_on');
+    assert.isNumber(Date.parse(data.updated_on));
+    assert.property(data, 'open');
+    assert.isBoolean(data.open);
+    assert.isTrue(data.open);
+    assert.property(data, '_id');
+    assert.isNotEmpty(data._id);
+    assert.property(data, 'status_text');
+    assert.isEmpty(data.status_text);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If you send a `POST` request to `/api/issues/{projectname}` without the required fields, returned will be the error `{ error: 'required field(s) missing' }`
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = { created_by: 'fCC' };
+    const data = await $.post(getUserInput('url') + '/api/issues/fcc-project', {
+      created_by: 'fCC'
+    });
+    assert.isObject(data);
+    assert.property(data, 'error');
+    assert.equal(data.error, 'required field(s) missing');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `GET` request to `/api/issues/{projectname}` for an array of all issues for that specific `projectname`, with all the fields present for each issue.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = { issue_text: 'Get Issues Test', created_by: 'fCC' };
+    const url =
+      getUserInput('url') +
+      '/api/issues/get_issues_test_' +
+      Date.now().toString().substring(7);
+    const data1 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 1' })
+    );
+    assert.isObject(data1);
+    const data2 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 2' })
+    );
+    assert.isObject(data2);
+    const data3 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 3' })
+    );
+    assert.isObject(data3);
+    const getIssues = await $.get(url);
+    assert.isArray(getIssues);
+    assert.lengthOf(getIssues, 3);
+    let re = new RegExp('Faux Issue \\d');
+    getIssues.forEach((issue) => {
+      assert.property(issue, 'issue_title');
+      assert.match(issue.issue_title, re);
+      assert.property(issue, 'issue_text');
+      assert.property(issue, 'created_by');
+      assert.property(issue, 'assigned_to');
+      assert.property(issue, 'status_text');
+      assert.property(issue, 'open');
+      assert.property(issue, 'created_on');
+      assert.property(issue, 'updated_on');
+      assert.property(issue, '_id');
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `GET` request to `/api/issues/{projectname}` and filter the request by also passing along any field and value as a URL query (ie. `/api/issues/{project}?open=false`). You can pass one or more field/value pairs at once.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'To be Filtered',
+      issue_text: 'Filter Issues Test'
+    };
+    const url =
+      getUserInput('url') +
+      '/api/issues/get_issues_test_' +
+      Date.now().toString().substring(7);
+    const data1 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Bob' })
+    );
+    const data2 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Bob' })
+    );
+    const data3 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Eric' })
+    );
+    const data4 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Carol', assigned_to: 'Eric' })
+    );
+    const getSingle = await $.get(url + '?created_by=Alice');
+    assert.isArray(getSingle);
+    assert.lengthOf(getSingle, 3);
+    const getMultiple = await $.get(url + '?created_by=Alice&assigned_to=Bob');
+    assert.isArray(getMultiple);
+    assert.lengthOf(getMultiple, 2);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `PUT` request to `/api/issues/{projectname}` with an `_id` and one or more fields to update. On success, the `updated_on` field should be updated, and returned should be `{  result: 'successfully updated', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    let initialData = {
+      issue_title: 'Issue to be Updated',
+      issue_text: 'Functional Test - Put target',
+      created_by: 'fCC'
+    };
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const itemToUpdate = await $.post(url, initialData);
+    const updateSucccess = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: itemToUpdate._id, issue_text: 'New Issue Text' }
+    });
+    assert.isObject(updateSucccess);
+    assert.deepEqual(updateSucccess, {
+      result: 'successfully updated',
+      _id: itemToUpdate._id
+    });
+    const getUpdatedId = await $.get(url + '?_id=' + itemToUpdate._id);
+    assert.isArray(getUpdatedId);
+    assert.isObject(getUpdatedId[0]);
+    assert.isAbove(
+      Date.parse(getUpdatedId[0].updated_on),
+      Date.parse(getUpdatedId[0].created_on)
+    );
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+When the `PUT` request sent to `/api/issues/{projectname}` does not include an `_id`, the return value is `{ error: 'missing _id' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const badUpdate = await $.ajax({ url: url, type: 'PUT' });
+    assert.isObject(badUpdate);
+    assert.property(badUpdate, 'error');
+    assert.equal(badUpdate.error, 'missing _id');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+When the `PUT` request sent to `/api/issues/{projectname}` does not include update fields, the return value is `{ error: 'no update field(s) sent', '_id': _id }`. On any other error, the return value is `{ error: 'could not update', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const badUpdate = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: '5f665eb46e296f6b9b6a504d' }
+    });
+    assert.deepEqual(badUpdate, {
+      error: 'no update field(s) sent',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+    const badIdUpdate = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: '5f665eb46e296f6b9b6a504d', issue_text: 'New Issue Text' }
+    });
+    assert.deepEqual(badIdUpdate, {
+      error: 'could not update',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `DELETE` request to `/api/issues/{projectname}` with an `_id` to delete an issue. If no `_id` is sent, the return value is `{ error: 'missing _id' }`. On success, the return value is `{ result: 'successfully deleted', '_id': _id }`. On failure, the return value is `{ error: 'could not delete', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    let initialData = {
+      issue_title: 'Issue to be Deleted',
+      issue_text: 'Functional Test - Delete target',
+      created_by: 'fCC'
+    };
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const itemToDelete = await $.post(url, initialData);
+    assert.isObject(itemToDelete);
+    const deleteSuccess = await $.ajax({
+      url: url,
+      type: 'DELETE',
+      data: { _id: itemToDelete._id }
+    });
+    assert.isObject(deleteSuccess);
+    assert.deepEqual(deleteSuccess, {
+      result: 'successfully deleted',
+      _id: itemToDelete._id
+    });
+    const noId = await $.ajax({ url: url, type: 'DELETE' });
+    assert.isObject(noId);
+    assert.deepEqual(noId, { error: 'missing _id' });
+    const badIdDelete = await $.ajax({
+      url: url,
+      type: 'DELETE',
+      data: { _id: '5f665eb46e296f6b9b6a504d', issue_text: 'New Issue Text' }
+    });
+    assert.isObject(badIdDelete);
+    assert.deepEqual(badIdDelete, {
+      error: 'could not delete',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 14 functional tests are complete and passing.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    assert.isAtLeast(getTests.length, 14, 'At least 14 tests passed');
+    getTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
new file mode 100644
index 0000000000..e99c8953c0
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
@@ -0,0 +1,318 @@
+---
+id: 587d8249367417b2b2512c41
+title: Metric-Imperial Converter
+challengeType: 4
+forumTopicId: 301570
+dashedName: metric-imperial-converter
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://metric-imperial-converter.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/) and complete your project locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter) to complete your project.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+- Complete the necessary conversion logic in `/controllers/convertHandler.js`
+- Complete the necessary routes in `/routes/api.js`
+- Copy the `sample.env` file to `.env` and set the variables appropriately
+- To run the tests uncomment `NODE_ENV=test` in your `.env` file
+- To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+- `convertHandler` should correctly read a whole number input.
+- `convertHandler` should correctly read a decimal number input.
+- `convertHandler` should correctly read a fractional input.
+- `convertHandler` should correctly read a fractional input with a decimal.
+- `convertHandler` should correctly return an error on a double-fraction (i.e. `3/2/3`).
+- `convertHandler` should correctly default to a numerical input of `1` when no numerical input is provided.
+- `convertHandler` should correctly read each valid input unit.
+- `convertHandler` should correctly return an error for an invalid input unit.
+- `convertHandler` should return the correct return unit for each valid input unit.
+- `convertHandler` should correctly return the spelled-out string unit for each valid input unit.
+- `convertHandler` should correctly convert `gal` to `L`.
+- `convertHandler` should correctly convert `L` to `gal`.
+- `convertHandler` should correctly convert `mi` to `km`.
+- `convertHandler` should correctly convert `km` to `mi`.
+- `convertHandler` should correctly convert `lbs` to `kg`.
+- `convertHandler` should correctly convert `kg` to `lbs`.
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+- Convert a valid input such as `10L`: `GET` request to `/api/convert`.
+- Convert an invalid input such as `32g`: `GET` request to `/api/convert`.
+- Convert an invalid number such as `3/7.2/4kg`: `GET` request to `/api/convert`.
+- Convert an invalid number AND unit such as `3/7.2/4kilomegagram`: `GET` request to `/api/convert`.
+- Convert with no number such as `kg`: `GET` request to `/api/convert`.
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+getUserInput => {
+  assert(
+    !/.*\/metric-imperial-converter\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You 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)
+
+```js
+
+```
+
+You can convert `'gal'` to `'L'` and vice versa. (1 gal to 3.78541 L)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1gal');
+    assert.equal(data1.returnNum, 3.78541);
+    assert.equal(data1.returnUnit, 'L');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10gal');
+    assert.equal(data2.returnNum, 37.8541);
+    assert.equal(data2.returnUnit, 'L');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1l');
+    assert.equal(data3.returnNum, 0.26417);
+    assert.equal(data3.returnUnit, 'gal');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10l');
+    assert.equal(data4.returnNum, 2.64172);
+    assert.equal(data4.returnUnit, 'gal');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can convert `'lbs'` to `'kg'` and vice versa. (1 lbs to 0.453592 kg)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1lbs');
+    assert.equal(data1.returnNum, 0.45359);
+    assert.equal(data1.returnUnit, 'kg');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10lbs');
+    assert.equal(data2.returnNum, 4.53592);
+    assert.equal(data2.returnUnit, 'kg');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1kg');
+    assert.equal(data3.returnNum, 2.20462);
+    assert.equal(data3.returnUnit, 'lbs');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10kg');
+    assert.equal(data4.returnNum, 22.04624);
+    assert.equal(data4.returnUnit, 'lbs');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can convert `'mi'` to `'km'` and vice versa. (1 mi to 1.60934 km)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1mi');
+    assert.equal(data1.returnNum, 1.60934);
+    assert.equal(data1.returnUnit, 'km');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10mi');
+    assert.equal(data2.returnNum, 16.0934);
+    assert.equal(data2.returnUnit, 'km');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1km');
+    assert.equal(data3.returnNum, 0.62137);
+    assert.equal(data3.returnUnit, 'mi');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10km');
+    assert.equal(data4.returnNum, 6.21373);
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+All incoming units should be accepted in both upper and lower case, but should be returned in both the `initUnit` and `returnUnit` in lower case, except for liter, which should be represented as an uppercase `'L'`.
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1gal');
+    assert.equal(data1.initUnit, 'gal');
+    assert.equal(data1.returnUnit, 'L');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10L');
+    assert.equal(data2.initUnit, 'L');
+    assert.equal(data2.returnUnit, 'gal');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1l');
+    assert.equal(data3.initUnit, 'L');
+    assert.equal(data3.returnUnit, 'gal');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10KM');
+    assert.equal(data4.initUnit, 'km');
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If the unit of measurement is invalid, returned will be `'invalid unit'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(getUserInput('url') + '/api/convert?input=1min');
+    assert(data.error === 'invalid unit' || data === 'invalid unit');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If the number is invalid, returned will be `'invalid number'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(
+      getUserInput('url') + '/api/convert?input=1//2gal'
+    );
+    assert(data.error === 'invalid number' || data === 'invalid number');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If both the unit and number are invalid, returned will be `'invalid number and unit'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(
+      getUserInput('url') + '/api/convert?input=1//2min'
+    );
+    assert(
+      data.error === 'invalid number and unit' ||
+        data === 'invalid number and unit'
+    );
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can use fractions, decimals or both in the parameter (ie. 5, 1/2, 2.5/6), but if nothing is provided it will default to 1.
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=mi');
+    assert.approximately(data1.initNum, 1, 0.001);
+    assert.approximately(data1.returnNum, 1.60934, 0.001);
+    assert.equal(data1.returnUnit, 'km');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=1/5mi');
+    assert.approximately(data2.initNum, 1 / 5, 0.1);
+    assert.approximately(data2.returnNum, 0.32187, 0.001);
+    assert.equal(data2.returnUnit, 'km');
+    const data3 = await $.get(
+      getUserInput('url') + '/api/convert?input=1.5/7km'
+    );
+    assert.approximately(data3.initNum, 1.5 / 7, 0.001);
+    assert.approximately(data3.returnNum, 0.13315, 0.001);
+    assert.equal(data3.returnUnit, 'mi');
+    const data4 = await $.get(
+      getUserInput('url') + '/api/convert?input=3/2.7km'
+    );
+    assert.approximately(data4.initNum, 3 / 2.7, 0.001);
+    assert.approximately(data4.returnNum, 0.69041, 0.001);
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+Your return will consist of the `initNum`, `initUnit`, `returnNum`, `returnUnit`, and `string` spelling out units in the format `'{initNum} {initUnitString} converts to {returnNum} {returnUnitString}'` with the result rounded to 5 decimals.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(getUserInput('url') + '/api/convert?input=2mi');
+    assert.equal(data.initNum, 2);
+    assert.equal(data.initUnit, 'mi');
+    assert.approximately(data.returnNum, 3.21868, 0.001);
+    assert.equal(data.returnUnit, 'km', 'returnUnit did not match');
+    assert.equal(data.string, '2 miles converts to 3.21868 kilometers');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+All 16 unit tests are complete and passing.
+
+```js
+async getUserInput => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const unitTests = getTests.filter(test => {
+      return !!test.context.match(/Unit Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 16, 'At least 16 tests passed');
+    unitTests.forEach(test => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 5 functional tests are complete and passing.
+
+```js
+async getUserInput => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const functTests = getTests.filter(test => {
+      return !!test.context.match(/Functional Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 5, 'At least 5 tests passed');
+    functTests.forEach(test => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/personal-library.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/personal-library.md
new file mode 100644
index 0000000000..f0bec1330e
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/personal-library.md
@@ -0,0 +1,221 @@
+---
+id: 587d824a367417b2b2512c43
+title: Personal Library
+challengeType: 4
+forumTopicId: 301571
+dashedName: personal-library
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://personal-library.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-library) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-library) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  Add your MongoDB connection string to `.env` without quotes as `DB`
+    Example: `DB=mongodb://admin:pass@1234.mlab.com:1234/fccpersonallib`
+2.  In your `.env` file set `NODE_ENV` to `test`, without quotes
+3.  You need to create all routes within `routes/api.js`
+4.  You will create all functional tests in `tests/2_functional-tests.js`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/personal-library\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You can send a <b>POST</b> request to `/api/books` with `title` as part of the form data to add a book.  The returned response will be an object with the `title` and a unique `_id` as keys.  If `title` is not included in the request, the returned response should be the string `missing required field title`.
+
+```js
+async (getUserInput) => {
+  try {
+    let data1 = await $.post(getUserInput('url') + '/api/books', {
+      title: 'Faux Book 1'
+    });
+    assert.isObject(data1);
+    assert.property(data1, 'title');
+    assert.equal(data1.title, 'Faux Book 1');
+    assert.property(data1, '_id');
+    let data2 = await $.post(getUserInput('url') + '/api/books');
+    assert.isString(data2);
+    assert.equal(data2, 'missing required field title');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>GET</b> request to `/api/books` and receive a JSON response representing all the books. The JSON response will be an array of objects with each object (book) containing `title`, `_id`, and `commentcount` properties.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let a = $.post(url, { title: 'Faux Book A' });
+    let b = $.post(url, { title: 'Faux Book B' });
+    let c = $.post(url, { title: 'Faux Book C' });
+    await Promise.all([a, b, c]).then(async () => {
+      let data = await $.get(url);
+      assert.isArray(data);
+      assert.isAtLeast(data.length, 3);
+      data.forEach((book) => {
+        assert.isObject(book);
+        assert.property(book, 'title');
+        assert.isString(book.title);
+        assert.property(book, '_id');
+        assert.property(book, 'commentcount');
+        assert.isNumber(book.commentcount);
+      });
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>GET</b> request to `/api/books/{_id}` to retrieve a single object of a book containing the properties `title`, `_id`, and a `comments` array (empty array if no comments present). If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let noBook = await $.get(url + '/5f665eb46e296f6b9b6a504d');
+    assert.isString(noBook);
+    assert.equal(noBook, 'no book exists');
+    let sampleBook = await $.post(url, { title: 'Faux Book Alpha' });
+    assert.isObject(sampleBook);
+    let bookId = sampleBook._id;
+    let bookQuery = await $.get(url + '/' + bookId);
+    assert.isObject(bookQuery);
+    assert.property(bookQuery, 'title');
+    assert.equal(bookQuery.title, 'Faux Book Alpha');
+    assert.property(bookQuery, 'comments');
+    assert.isArray(bookQuery.comments);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>POST</b> request containing `comment` as the form body data to `/api/books/{_id}` to add a comment to a book. The returned response will be the books object similar to <b>GET</b> `/api/books/{_id}` request in an earlier test. If `comment` is not included in the request, return the string `missing required field comment`. If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let commentTarget = await $.post(url, { title: 'Notable Book' });
+    assert.isObject(commentTarget);
+    let bookId = commentTarget._id;
+    let bookCom1 = await $.post(url + '/' + bookId, {
+      comment: 'This book is fab!'
+    });
+    let bookCom2 = await $.post(url + '/' + bookId, {
+      comment: 'I did not care for it'
+    });
+    assert.isObject(bookCom2);
+    assert.property(bookCom2, '_id');
+    assert.property(bookCom2, 'title');
+    assert.property(bookCom2, 'comments');
+    assert.lengthOf(bookCom2.comments, 2);
+    bookCom2.comments.forEach((comment) => {
+      assert.isString(comment);
+      assert.oneOf(comment, ['This book is fab!', 'I did not care for it']);
+    });
+    let commentErr = await $.post(url + '/' + bookId);
+    assert.isString(commentErr);
+    assert.equal(commentErr, 'missing required field comment');
+    let failingComment = await $.post(url + '/5f665eb46e296f6b9b6a504d', {
+      comment: 'Never Seen Comment'
+    });
+    assert.isString(failingComment);
+    assert.equal(failingComment, 'no book exists');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>DELETE</b> request to `/api/books/{_id}` to delete a book from the collection. The returned response will be the string `delete successful` if successful. If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let deleteTarget = await $.post(url, { title: 'Deletable Book' });
+    assert.isObject(deleteTarget);
+    let bookId = deleteTarget._id;
+    let doDelete = await $.ajax({ url: url + '/' + bookId, type: 'DELETE' });
+    assert.isString(doDelete);
+    assert.equal(doDelete, 'delete successful');
+    let failingDelete = await $.ajax({
+      url: url + '/5f665eb46e296f6b9b6a504d',
+      type: 'DELETE'
+    });
+    assert.isString(failingDelete);
+    assert.equal(failingDelete, 'no book exists');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>DELETE</b> request to `/api/books` to delete all books in the database. The returned response will be the string `'complete delete successful` if successful.
+
+```js
+async (getUserInput) => {
+  try {
+    const deleteAll = await $.ajax({
+      url: getUserInput('url') + '/api/books',
+      type: 'DELETE'
+    });
+    assert.isString(deleteAll);
+    assert.equal(deleteAll, 'complete delete successful');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 10 functional tests required are complete and passing.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    assert.isAtLeast(getTests.length, 10, 'At least 10 tests passed');
+    getTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
new file mode 100644
index 0000000000..79f9512fc1
--- /dev/null
+++ b/curriculum/challenges/italian/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -0,0 +1,379 @@
+---
+id: 5e601bf95ac9d0ecd8b94afd
+title: Sudoku Solver
+challengeType: 4
+forumTopicId: 462357
+dashedName: sudoku-solver
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://sudoku-solver.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freecodecamp/boilerplate-project-sudoku-solver) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+- All puzzle logic can go into `/controllers/sudoku-solver.js`
+  - The `validate` function should take a given puzzle string and check it to see if it has 81 valid characters for the input.
+  - The `check` functions should be validating against the *current* state of the board.
+  - The `solve` function should handle solving any given valid puzzle string, not just the test inputs and solutions. You are expected to write out the logic to solve this.
+- All routing logic can go into `/routes/api.js`
+- See the `puzzle-strings.js` file in `/controllers` for some sample puzzles your application should solve
+- To run the challenge tests on this page, set `NODE_ENV` to `test` without quotes in the `.env` file
+- To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+-   Logic handles a valid puzzle string of 81 characters
+-   Logic handles a puzzle string with invalid characters (not 1-9 or `.`)
+-   Logic handles a puzzle string that is not 81 characters in length
+-   Logic handles a valid row placement
+-   Logic handles an invalid row placement
+-   Logic handles a valid column placement
+-   Logic handles an invalid column placement
+-   Logic handles a valid region (3x3 grid) placement
+-   Logic handles an invalid region (3x3 grid) placement
+-   Valid puzzle strings pass the solver
+-   Invalid puzzle strings fail the solver
+-   Solver returns the the expected solution for an incomplete puzzle
+
+Write the following tests in `tests/2_functional-tests.js`
+
+-   Solve a puzzle with valid puzzle string: POST request to `/api/solve`
+-   Solve a puzzle with missing puzzle string: POST request to `/api/solve`
+-   Solve a puzzle with invalid characters: POST request to `/api/solve`
+-   Solve a puzzle with incorrect length: POST request to `/api/solve`
+-   Solve a puzzle that cannot be solved: POST request to `/api/solve`
+-   Check a puzzle placement with all fields: POST request to `/api/check`
+-   Check a puzzle placement with single placement conflict: POST request to `/api/check`
+-   Check a puzzle placement with multiple placement conflicts: POST request to `/api/check`
+-   Check a puzzle placement with all placement conflicts: POST request to `/api/check`
+-   Check a puzzle placement with missing required fields: POST request to `/api/check`
+-   Check a puzzle placement with invalid characters: POST request to `/api/check`
+-   Check a puzzle placement with incorrect length: POST request to `/api/check`
+-   Check a puzzle placement with invalid placement coordinate: POST request to `/api/check`
+-   Check a puzzle placement with invalid placement value: POST request to `/api/check`
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  const url = getUserInput('url');
+  assert(!/.*\/sudoku-solver\.freecodecamp\.rocks/.test(getUserInput('url')));
+};
+```
+
+You can `POST` `/api/solve` with form data containing `puzzle` which will be a string containing a combination of numbers (1-9) and periods `.` to represent empty spaces. The returned object will contain a `solution` property with the solved puzzle.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output =
+    '769235418851496372432178956174569283395842761628713549283657194516924837947381625';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'solution');
+  assert.equal(parsed.solution, output);
+};
+```
+
+If the object submitted to `/api/solve` is missing `puzzle`, the returned value will be `{ error: 'Required field missing' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Required field missing';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ notpuzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` contains values which are not numbers or periods, the returned value will be `{ error: 'Invalid characters in puzzle' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    'AA9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid characters in puzzle';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` is greater or less than 81 characters, the returned value will be `{ error: 'Expected puzzle to be 81 characters long' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Expected puzzle to be 81 characters long';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` is invalid or cannot be solved, the returned value will be `{ error: 'Puzzle cannot be solved' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9.9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Puzzle cannot be solved';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+You can `POST` to `/api/check` an object containing `puzzle`, `coordinate`, and `value` where the `coordinate` is the letter A-I indicating the row, followed by a number 1-9 indicating the column, and `value` is a number from 1-9.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '7';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isTrue(parsed.valid);
+};
+```
+
+The return value from the `POST` to `/api/check` will be an object containing a `valid` property, which is `true` if the number may be placed at the provided coordinate and `false` if the number may not. If false, the returned object will also contain a `conflict` property which is an array containing the strings `"row"`, `"column"`, and/or `"region"` depending on which makes the placement invalid.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const conflict = ['row', 'column'];
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isFalse(parsed.valid);
+  assert.property(parsed, 'conflict');
+  assert.include(parsed.conflict, 'row');
+  assert.include(parsed.conflict, 'column');
+};
+```
+
+If `value` submitted to `/api/check` is already placed in `puzzle` on that `coordinate`, the returned value will be an object containing a `valid` property with `true` if `value` is not conflicting.
+
+```js
+async (getUserInput) => {
+  const input =
+  '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'C3';
+  const value = '2';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isTrue(parsed.valid);
+};
+```
+
+If the puzzle submitted to `/api/check` contains values which are not numbers or periods, the returned value will be `{ error: 'Invalid characters in puzzle' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    'AA9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const output = 'Invalid characters in puzzle';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/check` is greater or less than 81 characters, the returned value will be `{ error: 'Expected puzzle to be 81 characters long' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const output = 'Expected puzzle to be 81 characters long';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the object submitted to `/api/check` is missing `puzzle`, `coordinate` or `value`, the returned value will be `{ error: Required field(s) missing }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Required field(s) missing';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the coordinate submitted to `api/check` does not point to an existing grid cell, the returned value will be `{ error: 'Invalid coordinate'}`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid coordinate';
+  const coordinate = 'XZ18';
+  const value = '7';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the `value` submitted to `/api/check` is not a number between 1 and 9, the returned values will be `{ error: 'Invalid value' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid value';
+  const coordinate = 'A1';
+  const value = 'X';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+All 12 unit tests are complete and passing. See `/tests/1_unit-tests.js` for the expected behavior you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const units = getTests.filter((el) => el.context.includes('UnitTests'));
+    assert.isAtLeast(units.length, 12, 'At least 12 tests passed');
+    units.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 14 functional tests are complete and passing. See `/tests/2_functional-tests.js` for the functionality you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const funcs = getTests.filter((el) =>
+      el.context.includes('Functional Tests')
+    );
+    assert.isAtLeast(funcs.length, 14, 'At least 14 tests passed');
+    funcs.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
new file mode 100644
index 0000000000..a1797e50eb
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -0,0 +1,67 @@
+---
+id: 5e7b9f060b6c005b0e76f05b
+title: Build your own Functions
+challengeType: 11
+videoId: nLDychdBwUg
+dashedName: build-your-own-functions
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+
+# --question--
+
+## --text--
+
+What will the following Python program print out?:
+
+```python
+def fred():
+    print("Zap")
+def jane():
+    print("ABC")
+
+jane()
+fred()
+jane()
+```
+
+## --answers--
+
+<pre>Zap
+ABC
+jane
+fred
+jane</pre>
+
+---
+
+<pre>Zap
+ABC
+Zap</pre>
+
+---
+
+<pre>ABC
+Zap
+jane</pre>
+
+---
+
+<pre>ABC
+Zap
+ABC</pre>
+
+---
+
+<pre>Zap
+Zap
+Zap</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
new file mode 100644
index 0000000000..011f26213e
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -0,0 +1,57 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06d
+title: Comparing and Sorting Tuples
+challengeType: 11
+videoId: dZXzBXUxxCs
+dashedName: comparing-and-sorting-tuples
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=EhQxwzyT16E)
+
+# --question--
+
+## --text--
+
+Which does the same thing as the following code?:
+
+```python
+lst = []
+for key, val in counts.items():
+    newtup = (val, key)
+    lst.append(newtup)
+lst = sorted(lst, reverse=True)
+print(lst)
+```
+
+## --answers--
+
+```python
+print( sorted( [ (v,k) for k,v in counts.items() ], reverse=True ) )
+```
+
+---
+
+```python
+print( [ (k,v) for k,v in counts.items().sorted() ] )
+```
+
+---
+
+```python
+print( sorted( [ (v,k) for k,v in counts.keys() ] ) )
+```
+
+---
+
+```python
+print( [ (k,v) for k,v in counts.values().sort() ] )
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
new file mode 100644
index 0000000000..2e973cd5f6
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
@@ -0,0 +1,50 @@
+---
+id: 5e7b9f050b6c005b0e76f058
+title: Conditional Execution
+challengeType: 11
+videoId: gz_IfIsZQtc
+dashedName: conditional-execution
+---
+
+# --question--
+
+## --text--
+
+Which code is indented correctly to print "Yes" if x = 0 and y = 10?
+
+## --answers--
+
+```python
+if 0 == x:
+if y == 10:
+print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+    if y == 10:
+    print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+if y == 10:
+    print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+    if y == 10:
+        print("Yes")
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
new file mode 100644
index 0000000000..b4030f10ff
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
@@ -0,0 +1,52 @@
+---
+id: 5e7b9f6a0b6c005b0e76f097
+title: 'Data Visualization: Mailing Lists'
+challengeType: 11
+videoId: RYdW660KkaQ
+dashedName: data-visualization-mailing-lists
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: Geodata](https://www.youtube.com/watch?v=KfhslNzopxo)
+
+\- [Exercise: Gmane Model](https://www.youtube.com/watch?v=wSpl1-7afAk)
+
+\- [Exercise: Gmane Spider](https://www.youtube.com/watch?v=H3w4lOFBUOI)
+
+\- [Exercise: Gmane Viz](https://www.youtube.com/watch?v=LRqVPMEXByw)
+
+\- [Exercise: Page Rank](https://www.youtube.com/watch?v=yFRAZBkBDBs)
+
+\- [Exercise: Page Spider](https://www.youtube.com/watch?v=sXedPQ_AnWA)
+
+\- [Exercise: Page Viz](https://www.youtube.com/watch?v=Fm0hpkxsZoo)
+
+# --question--
+
+## --text--
+
+Which is a common JavaScript visualization library?
+
+## --answers--
+
+DataViz.js
+
+---
+
+D3
+
+---
+
+Lowcharts
+
+---
+
+DATA6
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
new file mode 100644
index 0000000000..fd0b04359a
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f6a0b6c005b0e76f096
+title: 'Data Visualization: Page Rank'
+challengeType: 11
+videoId: 6-w_qIUwaxU
+dashedName: data-visualization-page-rank
+---
+
+# --question--
+
+## --text--
+
+How does the PageRank algorithm work?
+
+## --answers--
+
+It determines which pages are most highly connected.
+
+---
+
+It ranks pages based on view counts.
+
+---
+
+It figures out which pages contain the most important content.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
new file mode 100644
index 0000000000..e11c4968a0
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
@@ -0,0 +1,49 @@
+---
+id: 5e7b9f0a0b6c005b0e76f069
+title: Dictionaries and Loops
+challengeType: 11
+videoId: EEmekKiKG70
+dashedName: dictionaries-and-loops
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=PrhZ9qwBDD8)
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+counts = { 'chuck' : 1 , 'annie' : 42, 'jan': 100}
+for key in counts:
+    if counts[key] > 10:
+        print(key, counts[key])
+```
+
+## --answers--
+
+<pre>annie 42
+jan 100</pre>
+
+---
+
+<pre>chuck 1
+annie 42
+jan 100</pre>
+
+---
+
+<pre>chuck 1</pre>
+
+---
+
+<pre>[Error]</pre>
+
+## --video-solution--
+
+1
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
new file mode 100644
index 0000000000..f1f0855d93
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
@@ -0,0 +1,43 @@
+---
+id: 5e7b9f090b6c005b0e76f068
+title: 'Dictionaries: Common Applications'
+challengeType: 11
+videoId: f17xPfIXct0
+dashedName: dictionaries-common-applications
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```python
+counts = { 'quincy' : 1 , 'mrugesh' : 42, 'beau': 100, '0': 10}
+print(counts.get('kris', 0))
+```
+
+## --answers--
+
+2
+
+---
+
+quincy
+
+---
+
+0
+
+---
+
+10
+
+---
+
+[will return error]
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
new file mode 100644
index 0000000000..dff23f6561
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -0,0 +1,40 @@
+---
+id: 5e7b9f080b6c005b0e76f063
+title: Files as a Sequence
+challengeType: 11
+videoId: cIA0EokbaHE
+dashedName: files-as-a-sequence
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=il1j4wkte2E)
+
+# --question--
+
+## --text--
+
+What does the word 'continue' do in the middle of a loop?
+
+## --answers--
+
+Skips to the code directly after the loop.
+
+---
+
+Skips to the next line in the code.
+
+---
+
+Skips to the next iteration of the loop.
+
+---
+
+Skips the next block of code.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
new file mode 100644
index 0000000000..06951beb68
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -0,0 +1,52 @@
+---
+id: 5e7b9f050b6c005b0e76f057
+title: Intermediate Expressions
+challengeType: 11
+videoId: dKgUaIa5ATg
+dashedName: intermediate-expressions
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise 1](https://youtu.be/t_4DPwsaGDY)
+
+\- [Exercise 2](https://youtu.be/wgkC8SxraAQ)
+
+# --question--
+
+## --text--
+
+What will print out after running this code:
+
+```python
+width = 15
+height = 12.0
+print(height/3)
+```
+
+## --answers--
+
+39
+
+---
+
+4
+
+---
+
+4.0
+
+---
+
+5.0
+
+---
+
+5
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
new file mode 100644
index 0000000000..216b951cc5
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
@@ -0,0 +1,49 @@
+---
+id: 5e7b9f070b6c005b0e76f061
+title: Intermediate Strings
+challengeType: 11
+videoId: KgT_fYLXnyk
+dashedName: intermediate-strings
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=1bSqHot-KwE)
+
+# --question--
+
+## --text--
+
+What is the value of i in the following code?
+
+```python
+word = "bananana"
+i = word.find("na")
+```
+
+## --answers--
+
+nanana
+
+---
+
+2
+
+---
+
+3
+
+---
+
+True
+
+---
+
+na
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
new file mode 100644
index 0000000000..04796a35f1
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
@@ -0,0 +1,36 @@
+---
+id: 5e6a54c358d3af90110a60a3
+title: 'Introduction: Elements of Python'
+challengeType: 11
+videoId: aRY_xjL35v0
+dashedName: introduction-elements-of-python
+---
+
+# --question--
+
+## --text--
+
+What will the following program print out:
+
+```python
+x = 43
+x = x + 1
+print(x)
+```
+
+## --answers--
+
+x
+
+---
+
+x + 1
+
+---
+
+44
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
new file mode 100644
index 0000000000..02afa120f1
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
@@ -0,0 +1,30 @@
+---
+id: 5e6a54af58d3af90110a60a1
+title: 'Introduction: Hardware Architecture'
+challengeType: 11
+videoId: H6qtjRTfSog
+dashedName: introduction-hardware-architecture
+---
+
+# --question--
+
+## --text--
+
+Where are your programs stored when they are running?
+
+## --answers--
+
+Hard Drive.
+
+---
+
+Memory.
+
+---
+
+Central Processing Unit.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
new file mode 100644
index 0000000000..a9ad7a9e2b
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
@@ -0,0 +1,39 @@
+---
+id: 5e6a54ba58d3af90110a60a2
+title: 'Introduction: Python as a Language'
+challengeType: 11
+videoId: 0QeGbZNS_bY
+dashedName: introduction-python-as-a-language
+---
+
+# --question--
+
+## --text--
+
+What will print out after running these two lines of code:
+
+```python
+x = 6
+print(x)
+```
+
+## --answers--
+
+x
+
+---
+
+6
+
+---
+
+x = 6
+
+---
+
+(x)
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
new file mode 100644
index 0000000000..f1549dbb07
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -0,0 +1,38 @@
+---
+id: 5e6a54a558d3af90110a60a0
+title: 'Introduction: Why Program?'
+challengeType: 11
+videoId: 3muQV-Im3Z0
+dashedName: introduction-why-program
+---
+
+# --description--
+
+More resources:
+
+\- [Install Python on Windows](https://youtu.be/F7mtLrYzZP8)
+
+\- [Install Python on MacOS](https://youtu.be/wfLnZP-4sZw)
+
+# --question--
+
+## --text--
+
+Who should learn to program?
+
+## --answers--
+
+College students.
+
+---
+
+People who want to become software developers.
+
+---
+
+Everyone.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
new file mode 100644
index 0000000000..6438238f03
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
@@ -0,0 +1,39 @@
+---
+id: 5e7b9f070b6c005b0e76f05d
+title: 'Iterations: Definite Loops'
+challengeType: 11
+videoId: hiRTRAqNlpE
+dashedName: iterations-definite-loops
+---
+
+# --question--
+
+## --text--
+
+How many lines will the following code print?:
+
+```python
+for i in [2,1,5]:
+    print(i)
+```
+
+## --answers--
+
+1
+
+---
+
+2
+
+---
+
+3
+
+---
+
+5
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
new file mode 100644
index 0000000000..d0f5059a2f
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
@@ -0,0 +1,45 @@
+---
+id: 5e7b9f070b6c005b0e76f05e
+title: 'Iterations: Loop Idioms'
+challengeType: 11
+videoId: AelGAcoMXbI
+dashedName: iterations-loop-idioms
+---
+
+# --question--
+
+## --text--
+
+Below is code to find the smallest value from a list of values. One line has an error that will cause the code to not work as expected. Which line is it?:
+
+```python
+smallest = None
+print("Before:", smallest)
+for itervar in [3, 41, 12, 9, 74, 15]:
+    if smallest is None or itervar < smallest:
+        smallest = itervar
+        break
+    print("Loop:", itervar, smallest)
+print("Smallest:", smallest)
+```
+
+## --answers--
+
+3
+
+---
+
+4
+
+---
+
+6
+
+---
+
+7
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
new file mode 100644
index 0000000000..829fe70011
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f070b6c005b0e76f05f
+title: 'Iterations: More Patterns'
+challengeType: 11
+videoId: 9Wtqo6vha1M
+dashedName: iterations-more-patterns
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+
+# --question--
+
+## --text--
+
+Which of these evaluates to False?
+
+## --answers--
+
+```python
+0 == 0.0
+```
+
+---
+
+```python
+0 is 0.0
+```
+
+---
+
+```python
+0 is not 0.0
+```
+
+---
+
+```python
+0 = 0.0
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
new file mode 100644
index 0000000000..5bf4c6df17
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
@@ -0,0 +1,51 @@
+---
+id: 5e7b9f060b6c005b0e76f05c
+title: Loops and Iterations
+challengeType: 11
+videoId: dLA-szNRnUY
+dashedName: loops-and-iterations
+---
+
+# --question--
+
+## --text--
+
+What will the following code print out?:
+
+```python
+n = 0
+while True:
+    if n == 3:
+        break
+    print(n)
+    n = n + 1
+```
+
+## --answers--
+
+<pre>0
+1
+2</pre>
+
+---
+
+<pre>0
+1
+2
+3</pre>
+
+---
+
+<pre>1
+2</pre>
+
+---
+
+<pre>1
+2
+3</pre>
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
new file mode 100644
index 0000000000..36e76238d4
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f170b6c005b0e76f08b
+title: Make a Relational Database
+challengeType: 11
+videoId: MQ5z4bdF92U
+dashedName: make-a-relational-database
+---
+
+# --question--
+
+## --text--
+
+What SQL command would you use to retrieve all users that have the email address `quincy@freecodecamp.org`?
+
+## --answers--
+
+```sql
+SELECT Users WHERE email="quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT Users WHERE email IS "quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT ALL Users WHERE email="quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT * FROM Users WHERE email IS "quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT * FROM Users WHERE email="quincy@freecodecamp.org"
+```
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
new file mode 100644
index 0000000000..135632d2b7
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f060b6c005b0e76f059
+title: More Conditional Structures
+challengeType: 11
+videoId: HdL82tAZR20
+dashedName: more-conditional-structures
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+
+\- [Exercise 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+
+# --question--
+
+## --text--
+
+Given the following code:
+
+```python
+temp = "5 degrees"
+cel = 0
+fahr = float(temp)
+cel = (fahr - 32.0) * 5.0 / 9.0
+print(cel)
+```
+
+Which line/lines should be surrounded by `try` block?
+
+## --answers--
+
+1
+
+---
+
+3
+
+---
+
+3,4
+
+---
+
+4
+
+---
+
+None
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
new file mode 100644
index 0000000000..7196aa02da
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0c0b6c005b0e76f072
+title: Networking Protocol
+challengeType: 11
+videoId: c6vZGescaSc
+dashedName: networking-protocol
+---
+
+# --question--
+
+## --text--
+
+What type of HTTP request is usually used to access a website?
+
+## --answers--
+
+POST
+
+---
+
+GET
+
+---
+
+WEB
+
+---
+
+ACCESS
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
new file mode 100644
index 0000000000..bf0c895949
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f0c0b6c005b0e76f074
+title: 'Networking: Text Processing'
+challengeType: 11
+videoId: Pv_pJgVu8WI
+dashedName: networking-text-processing
+---
+
+# --question--
+
+## --text--
+
+Which type of encoding do most websites use?
+
+## --answers--
+
+UTF-8
+
+---
+
+UTF-16
+
+---
+
+UTF-32
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
new file mode 100644
index 0000000000..a8f26e7a47
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
@@ -0,0 +1,37 @@
+---
+id: 5e7b9f0d0b6c005b0e76f075
+title: 'Networking: Using urllib in Python'
+challengeType: 11
+videoId: 7lFM1T_CxBs
+dashedName: networking-using-urllib-in-python
+---
+
+# --question--
+
+## --text--
+
+What will the output of the following code be like?:
+
+```python
+import urllib.request
+fhand = urllib.request.urlopen('http://data.pr4e.org/romeo.txt')
+for line in fhand:
+    print(line.decode().strip())
+```
+
+## --answers--
+
+Just contents of "romeo.txt".
+
+---
+
+A header and the contents of "romeo.txt".
+
+---
+
+A header, a footer, and the contents of "romeo.txt".
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
new file mode 100644
index 0000000000..ed31a3848a
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f0d0b6c005b0e76f076
+title: 'Networking: Web Scraping with Python'
+challengeType: 11
+videoId: Uyioq2q4cEg
+dashedName: networking-web-scraping-with-python
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: socket1](https://www.youtube.com/watch?v=dWLdI143W-g)
+
+\- [Exercise: urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+
+\- [Exercise: urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+
+# --question--
+
+## --text--
+
+What Python library is used for parsing HTML documents and extracting data from HTML documents?
+
+## --answers--
+
+socket
+
+---
+
+http
+
+---
+
+BeautifulSoup
+
+---
+
+PrettyBiscuit
+
+---
+
+WonderfulSalad
+
+---
+
+HttpParser
+
+---
+
+GrunkleStan
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
new file mode 100644
index 0000000000..b90462a16d
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0c0b6c005b0e76f071
+title: Networking with Python
+challengeType: 11
+videoId: _kJvneKVdNM
+dashedName: networking-with-python
+---
+
+# --question--
+
+## --text--
+
+What Python library gives access to TCP Sockets?
+
+## --answers--
+
+tcp
+
+---
+
+socket
+
+---
+
+http
+
+---
+
+port
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
new file mode 100644
index 0000000000..41fc6959e0
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
@@ -0,0 +1,50 @@
+---
+id: 5e7b9f0c0b6c005b0e76f073
+title: 'Networking: Write a Web Browser'
+challengeType: 11
+videoId: zjyT9DaAjx4
+dashedName: networking-write-a-web-browser
+---
+
+# --question--
+
+## --text--
+
+What does the following code create?:
+
+```py
+import socket
+
+mysock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+mysock.connect(('data.pr4e.org', 80))
+cmd = 'GET http://data.pr4e.org/romeo.txt HTTP/1.0\r\n\r\n'.encode()
+mysock.send(cmd)
+
+while True:
+    data = mysock.recv(512)
+    if len(data) < 1:
+        break
+    print(data.decode(),end='')
+mysock.close()
+```
+
+## --answers--
+
+A simple web server.
+
+---
+
+A simple email client.
+
+---
+
+A simple todo list.
+
+---
+
+A simple web browser.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
new file mode 100644
index 0000000000..c85eabd257
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
@@ -0,0 +1,67 @@
+---
+id: 5e7b9f170b6c005b0e76f087
+title: Object Lifecycle
+challengeType: 11
+videoId: p1r3h_AMMIM
+dashedName: object-lifecycle
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+class PartyAnimal:
+    x = 0
+    name = ''
+    def __init__(self, nam):
+        self.name = nam
+        print(self.name,'constructed')
+    def party(self):
+        self.x = self.x + 1
+        print(self.name,'party count',self.x)
+
+q = PartyAnimal('Quincy')
+m = PartyAnimal('Miya')
+
+q.party()
+m.party()
+q.party()
+```
+
+## --answers--
+
+<pre>
+Quincy constructed
+Miya constructed
+Quincy party count 1
+Miya party count 2
+Quincy party count 3
+</pre>
+
+---
+
+<pre>
+Quincy constructed
+Miya constructed
+Quincy party count 1
+Miya party count 1
+Quincy party count 2
+</pre>
+
+---
+
+<pre>
+Quincy constructed
+Quincy party count 1
+Quincy party count 2
+Miya constructed
+Miya party count 1
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
new file mode 100644
index 0000000000..41d127dc0f
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
@@ -0,0 +1,58 @@
+---
+id: 5e7b9f160b6c005b0e76f086
+title: 'Objects: A Sample Class'
+challengeType: 11
+videoId: FiABKEuaSJ8
+dashedName: objects-a-sample-class
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+class PartyAnimal:
+    x = 0
+    def party(self):
+        self.x = self.x + 2
+        print(self.x)
+
+an = PartyAnimal()
+an.party()
+an.party()
+```
+
+## --answers--
+
+<pre>
+So far 1
+So far 2
+</pre>
+
+---
+
+<pre>
+0
+0
+</pre>
+
+---
+
+<pre>
+2
+2
+</pre>
+
+---
+
+<pre>
+2
+4
+</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
new file mode 100644
index 0000000000..1de3c04012
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f170b6c005b0e76f088
+title: 'Objects: Inheritance'
+challengeType: 11
+videoId: FBL3alYrxRM
+dashedName: objects-inheritance
+---
+
+# --question--
+
+## --text--
+
+What is inheritance in object-oriented programming?
+
+## --answers--
+
+A new class created when a parent class is extended.
+
+---
+
+A constructed instance of a class.
+
+---
+
+The ability to create a new class by extending an existing class.
+
+---
+
+A method that is called at the moment when a class is being used to construct an object.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
new file mode 100644
index 0000000000..0c86c3bd09
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
@@ -0,0 +1,55 @@
+---
+id: 5e7b9f090b6c005b0e76f067
+title: Python Dictionaries
+challengeType: 11
+videoId: dnzvfimrRMg
+dashedName: python-dictionaries
+---
+
+# --question--
+
+## --text--
+
+What does dict equal after running this code?:
+
+```python
+dict = {"Fri": 20, "Thu": 6, "Sat": 1}
+dict["Thu"] = 13
+dict["Sat"] = 2
+dict["Sun"] = 9
+```
+
+## --answers--
+
+```python
+{'Fri': 20, 'Thu': 6, 'Sat': 1}
+```
+
+---
+
+```python
+{'Fri': 20, 'Thu': 6, 'Sat': 1, 'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+---
+
+```python
+{'Sun': 9}
+```
+
+---
+
+```python
+{'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+---
+
+```python
+{'Fri': 20, 'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-functions.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-functions.md
new file mode 100644
index 0000000000..2f4bb2bbd0
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-functions.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f060b6c005b0e76f05a
+title: Python Functions
+challengeType: 11
+videoId: 3JGF-n3tDPU
+dashedName: python-functions
+---
+
+# --question--
+
+## --text--
+
+What is the purpose of the "def" keyword in Python?
+
+## --answers--
+
+It is slang that means "The following code is really cool."
+
+---
+
+It indicates the start of a function.
+
+---
+
+It indicates that the following indented section of code is to be stored for later.
+
+---
+
+It indicates the start of a function, and the following indented section of code is to be stored for later.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-lists.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-lists.md
new file mode 100644
index 0000000000..be78cd10c7
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-lists.md
@@ -0,0 +1,39 @@
+---
+id: 5e7b9f080b6c005b0e76f064
+title: Python Lists
+challengeType: 11
+videoId: Y0cvfDpYC_c
+dashedName: python-lists
+---
+
+# --question--
+
+## --text--
+
+What is the value of x after running this code:
+
+```python
+fruit = "banana"
+x = fruit[1]
+```
+
+## --answers--
+
+banana
+
+---
+
+a
+
+---
+
+b
+
+---
+
+True
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-objects.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-objects.md
new file mode 100644
index 0000000000..6082df58eb
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/python-objects.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f160b6c005b0e76f085
+title: Python Objects
+challengeType: 11
+videoId: uJxGeTYy0us
+dashedName: python-objects
+---
+
+# --question--
+
+## --text--
+
+Which is NOT true about objects in Python?
+
+## --answers--
+
+Objects get created and used.
+
+---
+
+Objects are bits of code and data.
+
+---
+
+Objects hide detail.
+
+---
+
+Objects are one of the five standard data types.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/reading-files.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/reading-files.md
new file mode 100644
index 0000000000..9be11dc4f3
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/reading-files.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f080b6c005b0e76f062
+title: Reading Files
+challengeType: 11
+videoId: Fo1tW09KIwo
+dashedName: reading-files
+---
+
+# --question--
+
+## --text--
+
+What is used to indicate a new line in a string?
+
+## --answers--
+
+\\n
+
+---
+
+{new_line}
+
+---
+
+{n}
+
+---
+
+/n
+
+---
+
+/new
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
new file mode 100644
index 0000000000..87a9824144
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
@@ -0,0 +1,41 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06f
+title: 'Regular Expressions: Matching and Extracting Data'
+challengeType: 11
+videoId: LaCZnTbQGkE
+dashedName: regular-expressions-matching-and-extracting-data
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+import re
+s = 'A message from csev@umich.edu to cwen@iupui.edu about meeting @2PM'
+lst = re.findall('\\S+@\\S+', s)
+print(lst)
+```
+
+## --answers--
+
+['csev@umich.edu', 'cwen@iupui.edu']
+
+---
+
+['csev@umich.edu']
+
+---
+
+['umich.edu', 'iupui.edu']
+
+---
+
+['csev@', 'cwen@']
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
new file mode 100644
index 0000000000..cf1d7b3825
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0b0b6c005b0e76f070
+title: 'Regular Expressions: Practical Applications'
+challengeType: 11
+videoId: xCjFU9G6x48
+dashedName: regular-expressions-practical-applications
+---
+
+# --question--
+
+## --text--
+
+What will search for a "$" in a regular expression?
+
+## --answers--
+
+$
+
+---
+
+\\dollar\\
+
+---
+
+\\$
+
+---
+
+!$
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
new file mode 100644
index 0000000000..0bff237a4a
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06e
+title: Regular Expressions
+challengeType: 11
+videoId: Yud_COr6pZo
+dashedName: regular-expressions
+---
+
+# --question--
+
+## --text--
+
+Which regex matches only a white space character?
+
+## --answers--
+
+\\S
+
+---
+
+\\s
+
+---
+
+.
+
+---
+
+\_
+
+---
+
+\\.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
new file mode 100644
index 0000000000..21f07615fc
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f180b6c005b0e76f08c
+title: Relational Database Design
+challengeType: 11
+videoId: AqdfbrpkbHk
+dashedName: relational-database-design
+---
+
+# --question--
+
+## --text--
+
+What is the best practice for how many times a piece of string data should be stored in a database?
+
+## --answers--
+
+0
+
+---
+
+1
+
+---
+
+2
+
+---
+
+3
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
new file mode 100644
index 0000000000..26732397d0
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f170b6c005b0e76f08a
+title: Relational Databases and SQLite
+challengeType: 11
+videoId: QlNod5-kFpA
+dashedName: relational-databases-and-sqlite
+---
+
+# --question--
+
+## --text--
+
+Which is NOT a primary data structure in a database?
+
+## --answers--
+
+index
+
+---
+
+table
+
+---
+
+row
+
+---
+
+column
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
new file mode 100644
index 0000000000..451e8b5107
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f180b6c005b0e76f08f
+title: 'Relational Databases: Join Operation'
+challengeType: 11
+videoId: jvDw3D9GKac
+dashedName: relational-databases-join-operation
+---
+
+# --question--
+
+## --text--
+
+When using a JOIN clause in an SQL statement, what does ON do?
+
+## --answers--
+
+It indicates what tables to perform the JOIN on.
+
+---
+
+It specifies the fields to use for the JOIN.
+
+---
+
+It indicates how the two tables are to be joined.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
new file mode 100644
index 0000000000..252eca3a88
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f190b6c005b0e76f090
+title: 'Relational Databases: Many-to-many Relationships'
+challengeType: 11
+videoId: z-SBYcvEQOc
+dashedName: relational-databases-many-to-many-relationships
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: Email](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+
+\- [Exercise: Roster](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+
+\- [Exercise: Tracks](https://www.youtube.com/watch?v=I-E7avcPeSE)
+
+\- [Exercise: Twfriends](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+
+\- [Exercise: Twspider](https://www.youtube.com/watch?v=xBaJddvJL4A)
+
+# --question--
+
+## --text--
+
+Which is an example of a many-to-many relationship?
+
+## --answers--
+
+teacher to student
+
+---
+
+customer to order
+
+---
+
+book to pages
+
+---
+
+city to country
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
new file mode 100644
index 0000000000..87e0754a62
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f180b6c005b0e76f08e
+title: 'Relational Databases: Relationship Building'
+challengeType: 11
+videoId: CSbqczsHVnc
+dashedName: relational-databases-relationship-building
+---
+
+# --question--
+
+## --text--
+
+What does the INSERT command do in SQL?
+
+## --answers--
+
+It defines a new row by listing the fields we want to include followed by the values we want placed in the new row.
+
+---
+
+It defines a new column by listing the rows we want to include followed by the values we want placed in the new column.
+
+---
+
+It defines a new table by listing the rows and fields we want to include followed by the values that we want placed in the table.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
new file mode 100644
index 0000000000..03b88fb678
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f180b6c005b0e76f08d
+title: Representing Relationships in a Relational Database
+challengeType: 11
+videoId: '-orenCNdC2Q'
+dashedName: representing-relationships-in-a-relational-database
+---
+
+# --question--
+
+## --text--
+
+What is a foreign key?
+
+## --answers--
+
+A key that is not supposed to be there.
+
+---
+
+A key that uses non-latin characters.
+
+---
+
+A number that points to the primary key of an associated row in a different table.
+
+---
+
+A key that the "real world" might use to look up a row.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
new file mode 100644
index 0000000000..51ab3b952b
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -0,0 +1,47 @@
+---
+id: 5e7b9f090b6c005b0e76f066
+title: Strings and Lists
+challengeType: 11
+videoId: lxcFa7ldCi0
+dashedName: strings-and-lists
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+
+# --question--
+
+## --text--
+
+What does n equal in this code?
+
+```python
+words = 'His e-mail is q-lar@freecodecamp.org'
+pieces = words.split()
+parts = pieces[3].split('-')
+n = parts[1]
+```
+
+## --answers--
+
+mail
+
+---
+
+q
+
+---
+
+lar
+
+---
+
+`lar@freecodecamp.org`
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
new file mode 100644
index 0000000000..2136025df6
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
@@ -0,0 +1,59 @@
+---
+id: 5e7b9f070b6c005b0e76f060
+title: Strings in Python
+challengeType: 11
+videoId: LYZj207fKpQ
+dashedName: strings-in-python
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+for n in "banana":
+    print(n)
+```
+
+## --answers--
+
+<pre>
+n
+n
+</pre>
+
+---
+
+<pre>
+0
+1
+</pre>
+
+---
+
+<pre>
+0
+1
+2
+3
+4
+5
+</pre>
+
+---
+
+<pre>
+b
+a
+n
+a
+n
+a
+</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
new file mode 100644
index 0000000000..e11e5398ab
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
@@ -0,0 +1,59 @@
+---
+id: 5e7b9f0a0b6c005b0e76f06c
+title: The Tuples Collection
+challengeType: 11
+videoId: 3Lxpladfh2k
+dashedName: the-tuples-collection
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+d = dict()
+d['quincy'] = 1
+d['beau'] = 5
+d['kris'] = 9
+for (k,i) in d.items():
+    print(k, i)
+```
+
+## --answers--
+
+<pre>
+k i
+k i
+k i
+</pre>
+
+---
+
+<pre>
+quincy 0
+beau 1
+kris 2
+</pre>
+
+---
+
+<pre>
+quincy 1
+beau 5
+kris 9
+</pre>
+
+---
+
+<pre>
+1 quincy
+5 beau
+9 kris
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/using-web-services.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
new file mode 100644
index 0000000000..5c2f7814c1
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07a
+title: Using Web Services
+challengeType: 11
+videoId: oNl1OVDPGKE
+dashedName: using-web-services
+---
+
+# --question--
+
+## --text--
+
+What are the two most common ways to send data over the internet?
+
+## --answers--
+
+JSON and TXT
+
+---
+
+JSON and XML
+
+---
+
+XML and TXT
+
+---
+
+XML and PHP
+
+---
+
+PHP and TXT
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
new file mode 100644
index 0000000000..50b6caa84b
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f050b6c005b0e76f056
+title: 'Variables, Expressions, and Statements'
+challengeType: 11
+videoId: nELR-uyyrok
+dashedName: variables-expressions-and-statements
+---
+
+# --question--
+
+## --text--
+
+What is the symbol used in an assignment statement?
+
+## --answers--
+
+~
+
+---
+
+&
+
+---
+
+=
+
+---
+
+\|
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
new file mode 100644
index 0000000000..c258b56bce
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f690b6c005b0e76f095
+title: Visualizing Data with Python
+challengeType: 11
+videoId: e3lydkH0prw
+dashedName: visualizing-data-with-python
+---
+
+# --question--
+
+## --text--
+
+Most data needs to be \_\_\_\_\_\_ before using it.
+
+## --answers--
+
+converted to JSON format
+
+---
+
+graphed
+
+---
+
+cleaned
+
+---
+
+memorized
+
+---
+
+turned into song
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
new file mode 100644
index 0000000000..992602d0c6
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
@@ -0,0 +1,46 @@
+---
+id: 5e7b9f150b6c005b0e76f080
+title: 'Web Services: API Rate Limiting and Security'
+challengeType: 11
+videoId: pI-g0lI8ngs
+dashedName: web-services-api-rate-limiting-and-security
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: GeoJSON](https://www.youtube.com/watch?v=TJGJN0T8tak)
+
+\- [Exercise: JSON](https://www.youtube.com/watch?v=vTmw5RtfGMY)
+
+\- [Exercise: Twitter](https://www.youtube.com/watch?v=2c7YwhvpCro)
+
+\- [Exercise: XML](https://www.youtube.com/watch?v=AopYOlDa-vY)
+
+# --question--
+
+## --text--
+
+When making a request from the Twitter API, what information must always be sent with the request?
+
+## --answers--
+
+Twitter username
+
+---
+
+date range
+
+---
+
+search term
+
+---
+
+key
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
new file mode 100644
index 0000000000..285380bd7b
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f150b6c005b0e76f07f
+title: 'Web Services: APIs'
+challengeType: 11
+videoId: oUNn1psfBJg
+dashedName: web-services-apis
+---
+
+# --question--
+
+## --text--
+
+What does API stand for?
+
+## --answers--
+
+Application Portable Intelligence
+
+---
+
+Associate Programming International
+
+---
+
+Application Program Interface
+
+---
+
+Action Portable Interface
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-json.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
new file mode 100644
index 0000000000..336373054c
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f140b6c005b0e76f07d
+title: 'Web Services: JSON'
+challengeType: 11
+videoId: ZJE-U56BppM
+dashedName: web-services-json
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+import json
+data = '''
+  [
+    { "id" : "001",
+      "x" : "2",
+     "name" : "Quincy"
+    } ,
+    { "id" : "009",
+      "x" : "7",
+      "name" : "Mrugesh"
+    }
+  ]
+'''
+info = json.loads(data)
+print(info[1]['name'])
+```
+
+## --answers--
+
+Quincy
+
+---
+
+Mrugesh
+
+---
+
+001
+
+---
+
+009
+
+---
+
+[Error]
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
new file mode 100644
index 0000000000..614f5336a3
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f140b6c005b0e76f07e
+title: 'Web Services: Service Oriented Approach'
+challengeType: 11
+videoId: muerlsCHExI
+dashedName: web-services-service-oriented-approach
+---
+
+# --question--
+
+## --text--
+
+With a services oriented approach to developing web apps, where is the data located?
+
+## --answers--
+
+Spread across many computer systems connected via the internet or internal network.
+
+---
+
+Within different services on the main web server.
+
+---
+
+On a separate database server.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
new file mode 100644
index 0000000000..8ccc87accb
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07c
+title: 'Web Services: XML Schema'
+challengeType: 11
+videoId: yWU9kTxW-nc
+dashedName: web-services-xml-schema
+---
+
+# --question--
+
+## --text--
+
+What is XSD?
+
+## --answers--
+
+The W3C Schema specification for XML.
+
+---
+
+The standard JSON schema from MOZ.
+
+---
+
+Extensible Situational Driver
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
new file mode 100644
index 0000000000..efda106867
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
@@ -0,0 +1,43 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07b
+title: 'Web Services: XML'
+challengeType: 11
+videoId: _pZ0srbg7So
+dashedName: web-services-xml
+---
+
+# --question--
+
+## --text--
+
+What is wrong with the following XML?:
+
+```xml
+<person>
+  <name>Chuck</name>
+  <phone type="intl">
+    +1 734 303 4456
+  <email hide="yes" />
+</person>
+```
+
+## --answers--
+
+Email tag is missing closing tag.
+
+---
+
+Spacing will cause XML to be invalid.
+
+---
+
+Phone tag is missing closing tag.
+
+---
+
+Plain text should be encoded using UTF-8.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
new file mode 100644
index 0000000000..dbeda928ee
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f090b6c005b0e76f065
+title: Working with Lists
+challengeType: 11
+videoId: lCnHfTHkhbE
+dashedName: working-with-lists
+---
+
+# --question--
+
+## --text--
+
+Which method is used to add an item at the end of a list?
+
+## --answers--
+
+insert
+
+---
+
+push
+
+---
+
+append
+
+---
+
+new
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
new file mode 100644
index 0000000000..adf4f36e7c
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -0,0 +1,44 @@
+---
+id: 5e44412c903586ffb414c94c
+title: Arithmetic Formatter
+challengeType: 10
+forumTopicId: 462359
+dashedName: arithmetic-formatter
+---
+
+# --description--
+
+Create a function that receives a list of strings that are arithmetic problems and returns the problems arranged vertically and side-by-side.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+<ul>
+
+# --hints--
+
+It should correctly format an arithmetic problem and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
new file mode 100644
index 0000000000..de8c1f893b
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -0,0 +1,44 @@
+---
+id: 5e44413e903586ffb414c94e
+title: Budget App
+challengeType: 10
+forumTopicId: 462361
+dashedName: budget-app
+---
+
+# --description--
+
+Create a "Category" class that can be used to create different budget categories.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-budget-app).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should create a Category class and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
new file mode 100644
index 0000000000..8c7067f044
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -0,0 +1,44 @@
+---
+id: 5e444147903586ffb414c94f
+title: Polygon Area Calculator
+challengeType: 10
+forumTopicId: 462363
+dashedName: polygon-area-calculator
+---
+
+# --description--
+
+In this project you will use object oriented programming to create a Rectangle class and a Square class. The Square class should be a subclass of Rectangle and inherit methods and attributes.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should create a Rectangle class and Square class and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
new file mode 100644
index 0000000000..b89b308ffd
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -0,0 +1,42 @@
+---
+id: 5e44414f903586ffb414c950
+title: Probability Calculator
+challengeType: 10
+forumTopicId: 462364
+dashedName: probability-calculator
+---
+
+# --description--
+
+Write a program to determine the approximate probability of drawing certain balls randomly from a hat.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator). After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should correctly calculate probabilities and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
new file mode 100644
index 0000000000..1f6e988b81
--- /dev/null
+++ b/curriculum/challenges/italian/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -0,0 +1,42 @@
+---
+id: 5e444136903586ffb414c94d
+title: Time Calculator
+challengeType: 10
+forumTopicId: 462360
+dashedName: time-calculator
+---
+
+# --description--
+
+Write a function named "add_time" that can add a duration to a start time and return the result.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator). After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should correctly add times and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
new file mode 100644
index 0000000000..9a24560aa9
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c14d
+title: Data Analysis Example A
+challengeType: 11
+videoId: nVAaxZ34khk
+dashedName: data-analysis-example-a
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/FreeCodeCamp-Pandas-Real-Life-Example)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What does the shape of our dataframe tell us?
+
+## --answers--
+
+The size in gigabytes the dataframe we loaded into memory is.
+
+---
+
+How many rows and columns our dataframe has.
+
+---
+
+How many rows the source data had before loading.
+
+---
+
+How many columns the source data had before loading.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
new file mode 100644
index 0000000000..67f603c129
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14e
+title: Data Analysis Example B
+challengeType: 11
+videoId: 0kJz0q0pvgQ
+dashedName: data-analysis-example-b
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/FreeCodeCamp-Pandas-Real-Life-Example)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What does the `loc` method allow you to do?
+
+## --answers--
+
+Retrieve a subset of rows and columns by supplying integer-location arguments.
+
+---
+
+Access a group of rows and columns by supplying label(s) arguments.
+
+---
+
+Returns the first `n` rows based on the integer argument supplied.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
new file mode 100644
index 0000000000..13cd90fb08
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c160
+title: Data Cleaning and Visualizations
+challengeType: 11
+videoId: mHjxzFS5_Z0
+dashedName: data-cleaning-and-visualizations
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+When using Matplotlib's global API, what does the order of numbers mean here?
+
+```py
+plt.subplot(1, 2, 1)
+```
+
+## --answers--
+
+My figure will have one column, two rows, and I am going to start drawing in the first (left) plot.
+
+---
+
+I am going to start drawing in the first (left) plot, my figure will have two rows, and my figure will have one column.
+
+---
+
+My figure will have one row, two columns, and I am going to start drawing in the first (left) plot.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
new file mode 100644
index 0000000000..cf159cead1
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c15f
+title: Data Cleaning Duplicates
+challengeType: 11
+videoId: kj7QqjXhH6A
+dashedName: data-cleaning-duplicates
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+The Python method `.duplicated()` returns a boolean Series for your DataFrame. `True` is the return value for rows that:
+
+## --answers--
+
+contain a duplicate, where the value for the row contains the first occurrence of that value.
+
+---
+
+contain a duplicate, where the value for the row is at least the second occurrence of that value.
+
+---
+
+contain a duplicate, where the value for the row contains either the first or second occurrence.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
new file mode 100644
index 0000000000..575be65eef
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
@@ -0,0 +1,58 @@
+---
+id: 5e9a093a74c4063ca6f7c15d
+title: Data Cleaning Introduction
+challengeType: 11
+videoId: ovYNhnltVxY
+dashedName: data-cleaning-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+import numpy as np
+
+s = pd.Series(['a', 3, np.nan, 1, np.nan])
+
+print(s.notnull().sum())
+```
+
+## --answers--
+
+3
+
+---
+
+<pre>0     True
+1     True
+2    False
+3     True
+4    False
+dtype: bool</pre>
+
+---
+
+<pre>0    False
+1    False
+2     True
+3    False
+4     True
+dtype: bool</pre>
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
new file mode 100644
index 0000000000..887af41702
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
@@ -0,0 +1,70 @@
+---
+id: 5e9a093a74c4063ca6f7c15e
+title: Data Cleaning with DataFrames
+challengeType: 11
+videoId: sTMN_pdI6S0
+dashedName: data-cleaning-with-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+import numpy as np
+
+s = pd.Series([np.nan, 1, 2, np.nan, 3])
+s = s.fillna(method='ffill')
+
+print(s)
+```
+
+## --answers--
+
+<pre>
+0    1.0
+1    1.0
+2    2.0
+3    3.0
+4    3.0
+dtype: float64
+</pre>
+
+---
+
+<pre>
+0    NaN
+1    1.0
+2    2.0
+3    2.0
+4    3.0
+dtype: float64
+</pre>
+
+---
+
+<pre>
+0    NaN
+1    1.0
+2    2.0
+3    NaN
+4    3.0
+dtype: float64
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
new file mode 100644
index 0000000000..1dd69ee8d9
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14f
+title: How to use Jupyter Notebooks Intro
+challengeType: 11
+videoId: h8caJq2Bb9w
+dashedName: how-to-use-jupyter-notebooks-intro
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is **not** allowed in a Jupyter Notebook's cell?
+
+## --answers--
+
+Markdown
+
+---
+
+Python code
+
+---
+
+An Excel sheet
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
new file mode 100644
index 0000000000..a907b1568d
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14c
+title: Introduction to Data Analysis
+challengeType: 11
+videoId: VJrP2FUzKP0
+dashedName: introduction-to-data-analysis
+---
+
+# --description--
+
+More resources:
+
+\- [Slides](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+
+# --question--
+
+## --text--
+
+Which of the following is **not** part of Data Analysis?
+
+## --answers--
+
+Building statistical models and data visualizations.
+
+---
+
+Picking a desired conclusion for the analysis.
+
+---
+
+Fixing incorrect values and removing invalid data.
+
+---
+
+Transforming data into an appropriate data structure.
+
+## --video-solution--
+
+2
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
new file mode 100644
index 0000000000..b886303b16
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
@@ -0,0 +1,38 @@
+---
+id: 5e9a093a74c4063ca6f7c150
+title: Jupyter Notebooks Cells
+challengeType: 11
+videoId: 5PPegAs9aLA
+dashedName: jupyter-notebooks-cells
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What are the three main types of Jupyter Notebook Cell?
+
+## --answers--
+
+Code, Markdown, and Python
+
+---
+
+Code, Markdown, and Raw
+
+---
+
+Markdown, Python, and Raw
+
+## --video-solution--
+
+2
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
new file mode 100644
index 0000000000..7bc910fcc4
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
@@ -0,0 +1,47 @@
+---
+id: 5e9a093a74c4063ca6f7c151
+title: Jupyter Notebooks Importing and Exporting Data
+challengeType: 11
+videoId: k1msxD3JIxE
+dashedName: jupyter-notebooks-importing-and-exporting-data
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What kind of data can you import and work with in a Jupyter Notebook?
+
+## --answers--
+
+Excel files.
+
+---
+
+CSV files.
+
+---
+
+XML files.
+
+---
+
+Data from an API.
+
+---
+
+All of the above.
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
new file mode 100644
index 0000000000..454f7c5646
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c157
+title: Numpy Algebra and Size
+challengeType: 11
+videoId: XAT97YLOKD8
+dashedName: numpy-algebra-and-size
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the relationship between size of objects (such as lists and datatypes) in memory in Python's standard library and the NumPy library? Knowing this, what are the implications for performance?
+
+## --answers--
+
+Standard Python objects take up much more memory to store than NumPy objects; operations on comparable standard Python and NumPy objects complete in roughly the same time.
+
+---
+
+NumPy objects take up much more memory than standard Python objects; operations on NumPy objects complete very quickly compared to comparable objects in standard Python.
+
+---
+
+NumPy objects take up much less memory than Standard Python objects; operations on Standard Python objects complete very quickly compared to comparable objects on NumPy Object.
+
+---
+
+Standard Python objects take up more memory than NumPy objects; operations on NumPy objects complete very quickly compared to comparable objects in standard Python.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
new file mode 100644
index 0000000000..b5504e836e
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
@@ -0,0 +1,59 @@
+---
+id: 5e9a093a74c4063ca6f7c154
+title: Numpy Arrays
+challengeType: 11
+videoId: VDYVFHBL1AM
+dashedName: numpy-arrays
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+A = np.array([
+    ['a', 'b', 'c'],
+    ['d', 'e', 'f'],
+    ['g', 'h', 'i']
+])
+
+print(A[:, :2])
+```
+
+## --answers--
+
+```py
+[['a' 'b']]
+```
+
+---
+
+```py
+[['b' 'c']
+['e' 'f']
+['h' 'i']]
+```
+
+---
+
+```py
+[['a' 'b']
+['d' 'e']
+['g' 'h']]
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
new file mode 100644
index 0000000000..f271dff4b0
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
@@ -0,0 +1,57 @@
+---
+id: 5e9a093a74c4063ca6f7c156
+title: Numpy Boolean Arrays
+challengeType: 11
+videoId: N1ttsMmcVMM
+dashedName: numpy-boolean-arrays
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+a = np.arange(5)
+
+print(a <= 3)
+```
+
+## --answers--
+
+```python
+[False, False, False, False, True]
+```
+
+---
+
+```python
+[5]
+```
+
+---
+
+```python
+[0, 1, 2, 3]
+```
+
+---
+
+```python
+[True, True, True, True, False]
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
new file mode 100644
index 0000000000..fc38697f40
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c152
+title: Numpy Introduction A
+challengeType: 11
+videoId: P-JjV6GBCmk
+dashedName: numpy-introduction-a
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+Why is Numpy an important, but unpopular Python library?
+
+## --answers--
+
+Often you won't work directly with Numpy.
+
+---
+
+It is extremely slow.
+
+---
+
+Working with Numpy is difficult.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
new file mode 100644
index 0000000000..a863e42074
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c153
+title: Numpy Introduction B
+challengeType: 11
+videoId: YIqgrNLAZkA
+dashedName: numpy-introduction-b
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+About how much memory does the integer `5` consume in plain Python?
+
+## --answers--
+
+32 bits
+
+---
+
+20 bytes
+
+---
+
+16 bytes
+
+---
+
+8 bits
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
new file mode 100644
index 0000000000..0072c84019
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
@@ -0,0 +1,50 @@
+---
+id: 5e9a093a74c4063ca6f7c155
+title: Numpy Operations
+challengeType: 11
+videoId: eqSVcJbaPdk
+dashedName: numpy-operations
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the value of `a` after you run the following code?
+
+```py
+a = np.arange(5)
+a + 20
+```
+
+## --answers--
+
+```python
+[20, 21, 22, 24, 24]
+```
+
+---
+
+```python
+[0, 1, 2, 3, 4]
+```
+
+---
+
+```python
+[25, 26, 27, 28, 29]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
new file mode 100644
index 0000000000..3d17a73a55
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
@@ -0,0 +1,73 @@
+---
+id: 5e9a093a74c4063ca6f7c15b
+title: Pandas Conditional Selection and Modifying DataFrames
+challengeType: 11
+videoId: BFlH0fN5xRQ
+dashedName: pandas-conditional-selection-and-modifying-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.DataFrame({
+    'Certificates': [8, 2, 5, 6],
+    'Time (in months)': [16, 5, 9, 12]
+})
+names = ['Tom', 'Kris', 'Ahmad', 'Beau']
+
+certificates_earned.index = names
+longest_streak = pd.Series([13, 11, 9, 7], index=names)
+certificates_earned['Longest streak'] = longest_streak
+
+print(certificates_earned)
+```
+
+## --answers--
+
+<pre>
+Tom      13
+Kris     11
+Ahmad     9
+Beau      7
+Name: Longest streak, dtype: int64
+</pre>
+
+---
+
+<pre>
+      Certificates  Time (in months)  Longest streak
+Tom               8                16              13
+Kris              2                 5              11
+Ahmad             5                 9               9
+Beau              6                12               7
+</pre>
+
+---
+
+<pre>
+      Certificates   Longest streak
+Tom               8               13
+Kris              2               11
+Ahmad             5                9
+Beau              6                7
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
new file mode 100644
index 0000000000..7d20f76c4a
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
@@ -0,0 +1,58 @@
+---
+id: 5e9a093a74c4063ca6f7c15c
+title: Pandas Creating Columns
+challengeType: 11
+videoId: _sSo2XZoB3E
+dashedName: pandas-creating-columns
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What code would add a "Certificates per month" column to the `certificates_earned` DataFrame like the one below?
+
+<pre>      Certificates  Time (in months)  Certificates per month
+Tom               8                16                    0.50
+Kris              2                 5                    0.40
+Ahmad             5                 9                    0.56
+Beau              6                12                    0.50</pre>
+
+## --answers--
+
+```py
+certificates_earned['Certificates'] /
+certificates_earned['Time (in months)']
+```
+
+---
+
+```py
+certificates_earned['Certificates per month'] = round(
+    certificates_earned['Certificates'] /
+    certificates_earned['Time (in months)']
+)
+```
+
+---
+
+```py
+certificates_earned['Certificates per month'] = round(
+    certificates_earned['Certificates'] /
+    certificates_earned['Time (in months)'], 2
+)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
new file mode 100644
index 0000000000..fd5eedb176
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
@@ -0,0 +1,66 @@
+---
+id: 5e9a093a74c4063ca6f7c15a
+title: Pandas DataFrames
+challengeType: 11
+videoId: 7SgFBYXaiH0
+dashedName: pandas-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.DataFrame({
+    'Certificates': [8, 2, 5, 6],
+    'Time (in months)': [16, 5, 9, 12]
+})
+
+certificates_earned.index = ['Tom', 'Kris', 'Ahmad', 'Beau']
+
+print(certificates_earned.iloc[2])
+```
+
+## --answers--
+
+<pre>
+Tom      16
+Kris      5
+Ahmad     9
+Beau     12
+Name: Time (in months), dtype: int64
+</pre>
+
+---
+
+<pre>
+Certificates         6
+Time (in months)    12
+Name: Beau, dtype: int64
+</pre>
+
+---
+
+<pre>
+Certificates        5
+Time (in months)    9
+Name: Ahmad, dtype: int64
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
new file mode 100644
index 0000000000..1107f217f4
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
@@ -0,0 +1,65 @@
+---
+id: 5e9a093a74c4063ca6f7c159
+title: Pandas Indexing and Conditional Selection
+challengeType: 11
+videoId: '-ZOrgV_aA9A'
+dashedName: pandas-indexing-and-conditional-selection
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.Series(
+    [8, 2, 5, 6],
+    index=['Tom', 'Kris', 'Ahmad', 'Beau']
+)
+
+print(certificates_earned[certificates_earned > 5])
+```
+
+## --answers--
+
+<pre>
+Tom      True
+Kris     False
+Ahmad    False
+Beau     True
+dtype: int64
+</pre>
+
+---
+
+<pre>
+Tom      8
+Ahmad    5
+Beau     6
+dtype: int64
+</pre>
+
+---
+
+<pre>
+Tom      8
+Beau     6
+dtype: int64
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
new file mode 100644
index 0000000000..45a30bc050
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
@@ -0,0 +1,68 @@
+---
+id: 5e9a093a74c4063ca6f7c158
+title: Pandas Introduction
+challengeType: 11
+videoId: 0xACW-8cZU0
+dashedName: pandas-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.Series(
+    [8, 2, 5, 6],
+    index=['Tom', 'Kris', 'Ahmad', 'Beau']
+)
+
+print(certificates_earned)
+```
+
+## --answers--
+
+```
+Tom      8
+Kris     2
+Ahmad    5
+Beau     6
+dtype: int64
+```
+
+---
+
+```
+Kris     2
+Ahmad    5
+Beau     6
+Tom      8
+dtype: int64
+```
+
+---
+
+```
+Tom      8
+Kris     2
+Ahmad    5
+Beau     6
+Name: certificates_earned dtype: int64
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
new file mode 100644
index 0000000000..284a5eabab
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c164
+title: Parsing HTML and Saving Data
+challengeType: 11
+videoId: bJaqnTWQmb0
+dashedName: parsing-html-and-saving-data
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What Python library has the `.read_html()` method we can we use for parsing HTML documents and extracting tables?
+
+## --answers--
+
+BeautifierSoupy
+
+---
+
+WebReader
+
+---
+
+HTTP-master
+
+---
+
+Pandas
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
new file mode 100644
index 0000000000..75a9a71e77
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c166
+title: Python Functions and Collections
+challengeType: 11
+videoId: NzpU17ZVlUw
+dashedName: python-functions-and-collections
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the main difference between lists and tuples in Python?
+
+## --answers--
+
+Tuples are immutable.
+
+---
+
+Lists are ordered.
+
+---
+
+Tuples are unordered.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
new file mode 100644
index 0000000000..f67c83c389
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c165
+title: Python Introduction
+challengeType: 11
+videoId: PrQV9JkLhb4
+dashedName: python-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How do we define blocks of code in the body of functions in Python?
+
+## --answers--
+
+We use a set of curly braces, one on either side of each new block of our code.
+
+---
+
+We use indentation, usually right-aligned 4 spaces.
+
+---
+
+We do not denote blocks of code.
+
+---
+
+We could use curly braces or indentation to denote blocks of code.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
new file mode 100644
index 0000000000..4d4350768f
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
@@ -0,0 +1,56 @@
+---
+id: 5e9a093a74c4063ca6f7c167
+title: Python Iteration and Modules
+challengeType: 11
+videoId: XzosGWLafrY
+dashedName: python-iteration-and-modules
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How would you iterate over and print the keys and values of a dictionary named `user`?
+
+## --answers--
+
+```python
+for key in user.items():
+    print(key)
+```
+
+---
+
+```python
+for key, value in user.all():
+    print(key, value)
+    print(value)
+```
+
+---
+
+```python
+for key, value in user.items():
+    print(key, value)
+```
+
+---
+
+```python
+for key, value in user
+    print(key, value)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
new file mode 100644
index 0000000000..18d6487a0a
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
@@ -0,0 +1,55 @@
+---
+id: 5e9a093a74c4063ca6f7c162
+title: Reading Data CSV and TXT
+challengeType: 11
+videoId: ViGEv0zOzUk
+dashedName: reading-data-csv-and-txt
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How would you import the CSV file `data.csv` and store it in a DataFrame using the Pandas module?
+
+## --answers--
+
+```python
+import pandas as pd
+df = pd.csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+df = pd.read_csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+pd.read_csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+df = pd.csv_reader("data.csv")
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
new file mode 100644
index 0000000000..5502a07e7a
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c163
+title: Reading Data from Databases
+challengeType: 11
+videoId: MtgXS1MofRw
+dashedName: reading-data-from-databases
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What method does a `Cursor` instance have and what does it allow?
+
+## --answers--
+
+The `Cursor` instance has a `.run()` method which allows you to run SQL queries.
+
+---
+
+The `Cursor` instance has a `.select()` method which allows you to select records.
+
+---
+
+The `Cursor` instance has an `.execute()` method which will receive SQL parameters to run against the database.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
new file mode 100644
index 0000000000..a16b2d0176
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
@@ -0,0 +1,72 @@
+---
+id: 5e9a093a74c4063ca6f7c161
+title: Reading Data Introduction
+challengeType: 11
+videoId: cDnt02BcHng
+dashedName: reading-data-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+Given a file named `certificates.csv` with these contents:
+
+<pre>
+Name$Certificates$Time (in months)
+Tom$8$16
+Kris$2$5
+Ahmad$5$9
+Beau$6$12
+</pre>
+
+Fill in the blanks for the missing arguments below:
+
+```py
+import csv
+
+with open(__A__, 'r') as fp:
+    reader = csv.reader(fp, delimiter=__B__)
+    next(reader)
+    for index, values in enumerate(reader):
+        name, certs_num, months_num = values
+        print(f"{name} earned {__C__} certificates in {months_num} months")
+```
+
+## --answers--
+
+A: `'certificates.csv'`
+
+B: `'-'`
+
+C: `values`
+
+---
+
+A: `'certificates.csv'`
+
+B: `'$'`
+
+C: `certs_num`
+
+---
+
+A: `'certificates'`
+
+B: `'$'`
+
+C: `certs_num`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
new file mode 100644
index 0000000000..135049889c
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7e5ac417301a38fb929
+title: Demographic Data Analyzer
+challengeType: 10
+forumTopicId: 462367
+dashedName: demographic-data-analyzer
+---
+
+# --description--
+
+In this challenge you must analyze demographic data using Pandas. You are given a dataset of demographic data that was extracted from the 1994 Census database.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
new file mode 100644
index 0000000000..c1e596625d
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7e5ac417301a38fb928
+title: Mean-Variance-Standard Deviation Calculator
+challengeType: 10
+forumTopicId: 462366
+dashedName: mean-variance-standard-deviation-calculator
+---
+
+# --description--
+
+Create a function that uses Numpy to output the mean, variance, and standard deviation of the rows, columns, and elements in a 3 x 3 matrix.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
new file mode 100644
index 0000000000..d8ef3d60c9
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7f8ac417301a38fb92a
+title: Medical Data Visualizer
+challengeType: 10
+forumTopicId: 462368
+dashedName: medical-data-visualizer
+---
+
+# --description--
+
+In this project, you will visualize and make calculations from medical examination data using matplotlib, seaborn, and pandas.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
new file mode 100644
index 0000000000..f0501c882b
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f802ac417301a38fb92b
+title: Page View Time Series Visualizer
+challengeType: 10
+forumTopicId: 462369
+dashedName: page-view-time-series-visualizer
+---
+
+# --description--
+
+For this project you will visualize time series data using a line chart, bar chart, and box plots. You will use Pandas, matplotlib, and seaborn to visualize a dataset containing the number of page views each day on the freeCodeCamp.org forum from 2016-05-09 to 2019-12-03. The data visualizations will help you understand the patterns in visits and identify yearly and monthly growth.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
new file mode 100644
index 0000000000..a708eedae1
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -0,0 +1,33 @@
+---
+id: 5e4f5c4b570f7e3a4949899f
+title: Sea Level Predictor
+challengeType: 10
+forumTopicId: 462370
+dashedName: sea-level-predictor
+---
+
+# --description--
+
+In this project, you will analyze a dataset of the global average sea level change since 1880. You will use the data to predict the sea level change through year 2050.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
new file mode 100644
index 0000000000..3c833be5ad
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
@@ -0,0 +1,50 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed4
+title: 'Accessing and Changing Elements, Rows, Columns'
+challengeType: 11
+videoId: v-7Y7koJ_N0
+dashedName: accessing-and-changing-elements-rows-columns
+---
+
+# --question--
+
+## --text--
+
+What code would change the values in the 3rd column of both of the following Numpy arrays to 20?
+
+```py
+a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
+
+# Output:
+# [[ 1  2  20  4  5]
+# [ 6  7 20  9 10]]
+```
+
+## --answers--
+
+```python
+a[:, 3] = 20
+```
+
+---
+
+```python
+a[2, :] = 20
+```
+
+---
+
+```python
+a[:, 2] = 20
+```
+
+---
+
+```python
+a[1, 2] = 20
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/basics-of-numpy.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/basics-of-numpy.md
new file mode 100644
index 0000000000..57b1924af7
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/basics-of-numpy.md
@@ -0,0 +1,45 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed3
+title: Basics of Numpy
+challengeType: 11
+videoId: f9QrZrKQMLI
+dashedName: basics-of-numpy
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```python
+b = np.array([[1.0,2.0,3.0],[3.0,4.0,5.0]])
+print(b)
+```
+
+## --answers--
+
+```python
+[[1.0 2.0 3.0]
+[3.0 4.0 5.0]]
+```
+
+---
+
+```python
+[[1. 2. 3.]
+[3. 4. 5.]]
+```
+
+---
+
+```python
+[[1. 3.]
+[2. 4.]
+[3. 5.]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/copying-arrays-warning.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/copying-arrays-warning.md
new file mode 100644
index 0000000000..afe7b8d83e
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/copying-arrays-warning.md
@@ -0,0 +1,44 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed7
+title: Copying Arrays Warning
+challengeType: 11
+videoId: iIoQ0_L0GvA
+dashedName: copying-arrays-warning
+---
+
+# --question--
+
+## --text--
+
+What is the value of `a` after running the following code?
+
+```py
+import numpy as np
+
+a = np.array([1, 2, 3, 4, 5])
+b = a
+b[2] = 20
+```
+
+## --answers--
+
+```python
+[1 2 3 4 5]
+```
+
+---
+
+```python
+[1 2 20 4 5]
+```
+
+---
+
+```python
+[1 20 3 4 5]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initialize-array-problem.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initialize-array-problem.md
new file mode 100644
index 0000000000..34e8f27604
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initialize-array-problem.md
@@ -0,0 +1,61 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed6
+title: Initialize Array Problem
+challengeType: 11
+videoId: 0jGfH8BPfOk
+dashedName: initialize-array-problem
+---
+
+# --question--
+
+## --text--
+
+What is another way to produce the following array?
+
+```py
+[[0. 0. 0. 0. 0. 0. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 5. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 0. 0. 0. 0. 0. 0.]]
+```
+
+## --answers--
+
+```py
+output = np.ones((7, 7))
+
+z = np.zeros((5, 5))
+z[2, 2] = 5
+
+output[1:1, -1:-1] = z
+```
+
+---
+
+```py
+output = np.zeros((7,7))
+
+z = np.ones((5, 5))
+z[2, 2] = 5
+
+output[1:-1, 1:-1] = z
+```
+
+---
+
+```py
+output = np.ones((7, 7))
+
+z = np.zeros((5, 5))
+z[3, 3] = 5
+
+output[1:-1, 1:-1] = z
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initializing-different-arrays.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initializing-different-arrays.md
new file mode 100644
index 0000000000..a6957cc7e4
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/initializing-different-arrays.md
@@ -0,0 +1,44 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed5
+title: Initializing Different Arrays
+challengeType: 11
+videoId: CEykdsKT4U4
+dashedName: initializing-different-arrays
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```py
+a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
+
+print(np.full_like(a, 100))
+```
+
+## --answers--
+
+```py
+[[100 100 100 100 100]]
+```
+
+---
+
+```py
+[[100 100 100 100 100]
+[100 100 100 100 100]]
+```
+
+---
+
+```py
+[[ 1  2  3  4  5]
+[ 6  7 20  9 10]]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
new file mode 100644
index 0000000000..5afa96f450
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
@@ -0,0 +1,56 @@
+---
+id: 5e9a0a8e09c5df3cc3600eda
+title: Loading Data and Advanced Indexing
+challengeType: 11
+videoId: tUdBZ7pF8Jg
+dashedName: loading-data-and-advanced-indexing
+---
+
+# --question--
+
+## --text--
+
+Given a file named `data.txt` with these contents:
+
+<pre>
+29,97,32,100,45
+15,88,5,75,22
+</pre>
+
+What code would produce the following array?
+
+```py
+[29. 32. 45. 15.  5. 22.]
+```
+
+## --answers--
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = np.any(filedata < 50)
+
+print(output)
+```
+
+---
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = np.all(filedata < 50, axis=1)
+
+print(output)
+```
+
+---
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = filedata[filedata < 50]
+
+print(output)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/mathematics.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/mathematics.md
new file mode 100644
index 0000000000..f3b1a3c111
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/mathematics.md
@@ -0,0 +1,49 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed8
+title: Mathematics
+challengeType: 11
+videoId: 7txegvyhtVk
+dashedName: mathematics
+---
+
+# --question--
+
+## --text--
+
+What is the value of `b` after running the following code?
+
+```py
+import numpy as np
+
+a = np.array(([1, 2, 3, 4, 5], [6, 7, 8, 9, 10]))
+b = np.max(a, axis=1).sum()
+```
+
+## --answers--
+
+```py
+10
+```
+
+---
+
+```py
+7
+```
+
+---
+
+```py
+5
+```
+
+---
+
+```py
+15
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/reorganizing-arrays.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/reorganizing-arrays.md
new file mode 100644
index 0000000000..7e4903c864
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/reorganizing-arrays.md
@@ -0,0 +1,49 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed9
+title: Reorganizing Arrays
+challengeType: 11
+videoId: VNWAQbEM-C8
+dashedName: reorganizing-arrays
+---
+
+# --question--
+
+## --text--
+
+What code would produce the following array?
+
+```py
+[[1. 1.]
+[1. 1.]
+[1. 1.]
+[1. 1.]]
+```
+
+## --answers--
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((4, 2))
+print(b)
+```
+
+---
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((2, 4))
+print(b)
+```
+
+---
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((8, 1))
+print(b)
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/08-data-analysis-with-python/numpy/what-is-numpy.md b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/what-is-numpy.md
new file mode 100644
index 0000000000..03b2f65fc7
--- /dev/null
+++ b/curriculum/challenges/italian/08-data-analysis-with-python/numpy/what-is-numpy.md
@@ -0,0 +1,34 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed2
+title: What is NumPy
+challengeType: 11
+videoId: 5Nwfs5Ej85Q
+dashedName: what-is-numpy
+---
+
+# --question--
+
+## --text--
+
+Why are Numpy arrays faster than regular Python lists?
+
+## --answers--
+
+Numpy does not perform type checking while iterating through objects.
+
+---
+
+Numpy uses fixed types.
+
+---
+
+Numpy uses contiguous memory.
+
+---
+
+All of the above.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/italian/09-information-security/information-security-projects/anonymous-message-board.md
new file mode 100644
index 0000000000..10b7e3ad58
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-projects/anonymous-message-board.md
@@ -0,0 +1,172 @@
+---
+id: 587d824a367417b2b2512c45
+title: Anonymous Message Board
+challengeType: 4
+forumTopicId: 301568
+dashedName: anonymous-message-board
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://anonymous-message-board.freecodecamp.rocks/>.
+
+Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-messageboard/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  Set `NODE_ENV` to test without quotes when ready to write tests and DB to your databases connection string (in `.env`)
+2.  Recommended to create controllers/handlers and handle routing in `routes/api.js`
+3.  You will add any security features to `server.js`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Creating a new thread: POST request to `/api/threads/{board}`
+-   Viewing the 10 most recent threads with 3 replies each: GET request to `/api/threads/{board}`
+-   Deleting a thread with the incorrect password: DELETE request to `/api/threads/{board}` with an invalid `delete_password`
+-   Deleting a thread with the correct password: DELETE request to `/api/threads/{board}` with a valid `delete_password`
+-   Reporting a thread: PUT request to `/api/threads/{board}`
+-   Creating a new reply: POST request to `/api/replies/{board}`
+-   Viewing a single thread with all replies: GET request to `/api/replies/{board}`
+-   Deleting a reply with the incorrect password: DELETE request to `/api/replies/{board}` with an invalid `delete_password`
+-   Deleting a reply with the correct password: DELETE request to `/api/replies/{board}` with a valid `delete_password`
+-   Reporting a reply: PUT request to `/api/replies/{board}`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/anonymous-message-board\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+Only allow your site to be loaded in an iFrame on your own pages.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['x-frame-options']?.includes('SAMEORIGIN'));
+};
+```
+
+Do not allow DNS prefetching.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['x-dns-prefetch-control']?.includes('off'));
+};
+```
+
+Only allow your site to send the referrer for your own pages.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['referrer-policy']?.includes('same-origin'));
+};
+```
+
+You can send a POST request to `/api/threads/{board}` with form data including `text` and `delete_password`. The saved database record will have at least the fields `_id`, `text`, `created_on`(date & time), `bumped_on`(date & time, starts same as `created_on`), `reported` (boolean), `delete_password`, & `replies` (array).
+
+```js
+async (getUserInput) => {
+  const date = new Date();
+  const text = `fcc_test_${date}`;
+  const deletePassword = 'delete_me';
+  const data = { text, delete_password: deletePassword };
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/threads/fcc_test', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify(data)
+  });
+  if (res.ok) {
+    const checkData = await fetch(url + '/api/threads/fcc_test');
+    const parsed = await checkData.json();
+    try {
+      assert.equal(parsed[0].text, text);
+      assert.isNotNull(parsed[0]._id);
+      assert.equal(new Date(parsed[0].created_on).toDateString(), date.toDateString());
+      assert.equal(parsed[0].bumped_on, parsed[0].created_on);
+      assert.isArray(parsed[0].replies);
+    } catch (err) {
+      throw new Error(err.responseText || err.message);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can send a POST request to `/api/replies/{board}` with form data including `text`, `delete_password`, & `thread_id`. This will update the `bumped_on` date to the comment's date. In the thread's `replies` array, an object will be saved with at least the properties `_id`, `text`, `created_on`, `delete_password`, & `reported`.
+
+```js
+
+```
+
+You can send a GET request to `/api/threads/{board}`. Returned will be an array of the most recent 10 bumped threads on the board with only the most recent 3 replies for each. The `reported` and `delete_password` fields will not be sent to the client.
+
+```js
+
+```
+
+You can send a GET request to `/api/replies/{board}?thread_id={thread_id}`. Returned will be the entire thread with all its replies, also excluding the same fields from the client as the previous test.
+
+```js
+
+```
+
+You can send a DELETE request to `/api/threads/{board}` and pass along the `thread_id` & `delete_password` to delete the thread. Returned will be the string `incorrect password` or `success`.
+
+```js
+
+```
+
+You can send a DELETE request to `/api/replies/{board}` and pass along the `thread_id`, `reply_id`, & `delete_password`. Returned will be the string `incorrect password` or `success`. On success, the text of the `reply_id` will be changed to `[deleted]`.
+
+```js
+
+```
+
+You can send a PUT request to `/api/threads/{board}` and pass along the `thread_id`. Returned will be the string `success`. The `reported` value of the `thread_id` will be changed to `true`.
+
+```js
+
+```
+
+You can send a PUT request to `/api/replies/{board}` and pass along the `thread_id` & `reply_id`. Returned will be the string `success`. The `reported` value of the `reply_id` will be changed to `true`.
+
+```js
+
+```
+
+All 10 functional tests are complete and passing.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/italian/09-information-security/information-security-projects/port-scanner.md
new file mode 100644
index 0000000000..d4b4d6cb89
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-projects/port-scanner.md
@@ -0,0 +1,43 @@
+---
+id: 5e46f979ac417301a38fb932
+title: Port Scanner
+challengeType: 10
+forumTopicId: 462372
+helpCategory: Python
+dashedName: port-scanner
+---
+
+# --description--
+
+Create a port scanner using Python.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you some of the Python skills required for this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/italian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
new file mode 100644
index 0000000000..99f371813e
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -0,0 +1,175 @@
+---
+id: 5e601c775ac9d0ecd8b94aff
+title: Secure Real Time Multiplayer Game
+challengeType: 4
+forumTopicId: 462375
+dashedName: secure-real-time-multiplayer-game
+---
+
+# --description--
+
+Develop a 2D real time multiplayer game using the HTML Canvas API and [Socket.io](https://socket.io/) that is functionally similar to this: <https://secure-real-time-multiplayer-game.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+**Note**: `helmet@^3.21.3` is needed for the user stories. This means you will need to use the previous version of Helmet's docs, for information on how to achieve the user stories.
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/secure-real-time-multiplayer-game\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+Multiple players can connect to a server and play.
+
+```js
+
+```
+
+Each player has an avatar.
+
+```js
+
+```
+
+Each player is represented by an object created by the `Player` class in `Player.mjs`.
+
+```js
+
+```
+
+At a minimum, each player object should contain a unique `id`, a `score`, and `x` and `y` coordinates representing the player's current position.
+
+```js
+
+```
+
+The game has at least one type of collectible item. Complete the `Collectible` class in `Collectible.mjs` to implement this.
+
+```js
+
+```
+
+At a minimum, each collectible item object created by the `Collectible` class should contain a unique `id`, a `value`, and `x` and `y` coordinates representing the item's current position.
+
+```js
+
+```
+
+Players can use the WASD and/or arrow keys to move their avatar. Complete the `movePlayer` method in `Player.mjs` to implement this.
+
+```js
+
+```
+
+The `movePlayer` method should accept two arguments: a string of "up", "down", "left", or "right", and a number for the amount of pixels the player's position should change. `movePlayer` should adjust the `x` and `y` coordinates of the player object it's called from.
+
+```js
+
+```
+
+The player's score should be used to calculate their rank among the other players. Complete the `calculateRank` method in the `Player` class to implement this.
+
+```js
+
+```
+
+The `calculateRank` method should accept an array of objects representing all connected players and return the string `Rank: currentRanking/totalPlayers`. For example, in a game with two players, if Player A has a score of 3 and Player B has a score of 5, `calculateRank` for Player A should return `Rank: 2/2`.
+
+```js
+
+```
+
+Players can collide with a collectible item. Complete the `collision` method in `Player.mjs` to implement this.
+
+```js
+
+```
+
+The `collision` method should accept a collectible item's object as an argument. If the player's avatar intersects with the item, the `collision` method should return `true`.
+
+```js
+
+```
+
+All players are kept in sync.
+
+```js
+
+```
+
+Players can disconnect from the game at any time.
+
+```js
+
+```
+
+Prevent the client from trying to guess / sniff the MIME type.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-content-type-options'], 'nosniff');
+};
+```
+
+Prevent cross-site scripting (XSS) attacks.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-xss-protection'], '1; mode=block');
+};
+```
+
+Nothing from the website is cached in the client.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['surrogate-control'], 'no-store');
+  assert.equal(
+    parsed.headers['cache-control'],
+    'no-store, no-cache, must-revalidate, proxy-revalidate'
+  );
+  assert.equal(parsed.headers['pragma'], 'no-cache');
+  assert.equal(parsed.headers['expires'], '0');
+};
+```
+
+The headers say that the site is powered by "PHP 7.4.3" even though it isn't (as a security measure).
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-powered-by'], 'PHP 7.4.3');
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/italian/09-information-security/information-security-projects/sha-1-password-cracker.md
new file mode 100644
index 0000000000..50bb715271
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -0,0 +1,43 @@
+---
+id: 5e46f983ac417301a38fb933
+title: SHA-1 Password Cracker
+challengeType: 10
+forumTopicId: 462374
+helpCategory: Python
+dashedName: sha-1-password-cracker
+---
+
+# --description--
+
+For this project you will learn about the importance of good security by creating a password cracker to figure out passwords that were hashed using SHA-1.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you some of the Python skills required for this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/italian/09-information-security/information-security-projects/stock-price-checker.md
new file mode 100644
index 0000000000..2a0a1ea2fd
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-projects/stock-price-checker.md
@@ -0,0 +1,134 @@
+---
+id: 587d824a367417b2b2512c44
+title: Stock Price Checker
+challengeType: 4
+forumTopicId: 301572
+dashedName: stock-price-checker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://stock-price-checker.freecodecamp.rocks/>.
+
+Since all reliable stock price APIs require an API key, we've built a workaround. Use <https://stock-price-checker-proxy.freecodecamp.rocks/> to get up-to-date stock price information without needing to sign up for your own key.
+
+Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  SET `NODE_ENV` to `test` without quotes and set `DB` to your MongoDB connection string
+2.  Complete the project in `routes/api.js` or by creating a handler/controller
+3.  You will add any security features to `server.js`
+4.  You will create all of the functional tests in `tests/2_functional-tests.js`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Viewing one stock: GET request to `/api/stock-prices/`
+-   Viewing one stock and liking it: GET request to `/api/stock-prices/`
+-   Viewing the same stock and liking it again: GET request to `/api/stock-prices/`
+-   Viewing two stocks: GET request to `/api/stock-prices/`
+-   Viewing two stocks and liking them: GET request to `/api/stock-prices/`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/stock-price-checker\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You should set the content security policies to only allow loading of scripts and CSS from your server.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(
+    parsed.headers['content-security-policy'].includes("script-src 'self'")
+  );
+  assert.isTrue(
+    parsed.headers['content-security-policy'].includes("style-src 'self'")
+  );
+};
+```
+
+You can send a `GET` request to `/api/stock-prices`, passing a NASDAQ stock symbol to a `stock` query parameter. The returned object will contain a property named `stockData`.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG'
+  );
+  const parsed = await data.json();
+  assert.property(parsed, 'stockData');
+};
+```
+
+The `stockData` property includes the `stock` symbol as a string, the `price` as a number, and `likes` as a number.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG'
+  );
+  const parsed = await data.json();
+  const ticker = parsed.stockData;
+  assert.typeOf(ticker.price, 'number');
+  assert.typeOf(ticker.likes, 'number');
+  assert.typeOf(ticker.stock, 'string');
+};
+```
+
+You can also pass along a `like` field as `true` (boolean) to have your like added to the stock(s). Only 1 like per IP should be accepted.
+
+```js
+
+```
+
+If you pass along 2 stocks, the returned value will be an array with information about both stocks. Instead of `likes`, it will display `rel_likes` (the difference between the likes on both stocks) for both `stockData` objects.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG&stock=MSFT'
+  );
+  const parsed = await data.json();
+  const ticker = parsed.stockData;
+  assert.typeOf(ticker, 'array');
+  assert.property(ticker[0], 'rel_likes');
+  assert.property(ticker[1], 'rel_likes');
+};
+```
+
+All 5 functional tests are complete and passing.
+
+```js
+async (getUserInput) => {
+  const tests = await fetch(getUserInput('url') + '/_api/get-tests');
+  const parsed = await tests.json();
+  assert.isTrue(parsed.length >= 5);
+  parsed.forEach((test) => {
+    assert.equal(test.state, 'passed');
+  });
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
new file mode 100644
index 0000000000..9d5cba3e75
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
@@ -0,0 +1,63 @@
+---
+id: 587d8248367417b2b2512c3c
+title: Ask Browsers to Access Your Site via HTTPS Only with helmet.hsts()
+challengeType: 2
+forumTopicId: 301573
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Configure `helmet.hsts()` to use HTTPS for the next 90 days. Pass the config object `{maxAge: timeInSeconds, force: true}`. You can create a variable `ninetyDaysInSeconds = 90*24*60*60;` to use for the `timeInSeconds`. Replit 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 Replit header, after inspecting it for testing.
+
+Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate.
+
+# --hints--
+
+helmet.hsts() middleware should be mounted correctly
+
+```js
+(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);
+    }
+  );
+```
+
+maxAge should be equal to 7776000 s (90 days)
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/app-info').then(
+    (data) => {
+      assert.match(
+        data.headers['strict-transport-security'],
+        /^max-age=7776000;?/
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
new file mode 100644
index 0000000000..1ea172a936
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -0,0 +1,42 @@
+---
+id: 587d8248367417b2b2512c3a
+title: Avoid Inferring the Response MIME Type with helmet.noSniff()
+challengeType: 2
+forumTopicId: 301574
+dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/). Browsers can use content or MIME sniffing to override response `Content-Type` headers to guess and process the data using an implicit content type. 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`, instructing the browser to not bypass the provided `Content-Type`.
+
+# --instructions--
+
+Use the `helmet.noSniff()` method on your server.
+
+# --hints--
+
+helmet.noSniff() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
new file mode 100644
index 0000000000..8f96da298a
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -0,0 +1,50 @@
+---
+id: 587d8249367417b2b2512c40
+title: Configure Helmet Using the ‘parent’ helmet() Middleware
+challengeType: 2
+forumTopicId: 301575
+dashedName: configure-helmet-using-the-parent-helmet-middleware
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+`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:**
+
+```js
+app.use(helmet({
+  frameguard: {         // configure
+    action: 'deny'
+  },
+  contentSecurityPolicy: {    // enable and configure
+    directives: {
+      defaultSrc: ["'self'"],
+      styleSrc: ['style.com'],
+    }
+  },
+  dnsPrefetchControl: false     // disable
+}))
+```
+
+We introduced each middleware separately for teaching purposes and for ease of testing. Using the ‘parent’ `helmet()` middleware is easy to implement in a real project.
+
+# --hints--
+
+no tests - it's a descriptive challenge
+
+```js
+assert(true);
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
new file mode 100644
index 0000000000..b12dedf8de
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -0,0 +1,47 @@
+---
+id: 587d8249367417b2b2512c3e
+title: Disable Client-Side Caching with helmet.noCache()
+challengeType: 2
+forumTopicId: 301576
+dashedName: disable-client-side-caching-with-helmet-nocache
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.noCache()` method on your server.
+
+# --hints--
+
+helmet.noCache() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
new file mode 100644
index 0000000000..3a855aebb7
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
@@ -0,0 +1,44 @@
+---
+id: 587d8248367417b2b2512c3d
+title: Disable DNS Prefetching with helmet.dnsPrefetchControl()
+challengeType: 2
+forumTopicId: 301577
+dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.dnsPrefetchControl()` method on your server.
+
+# --hints--
+
+helmet.dnsPrefetchControl() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
new file mode 100644
index 0000000000..0165afc950
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -0,0 +1,81 @@
+---
+id: 58a25bcff9fc0f352b528e7d
+title: Hash and Compare Passwords Asynchronously
+challengeType: 2
+forumTopicId: 301578
+dashedName: hash-and-compare-passwords-asynchronously
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+As hashing is designed to be computationally intensive, it is recommended to do so asynchronously on your server as to avoid blocking incoming connections while you hash. All you have to do to hash a password asynchronous is call
+
+```js
+bcrypt.hash(myPlaintextPassword, saltRounds, (err, hash) => {
+  /*Store hash in your db*/
+});
+```
+
+# --instructions--
+
+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.
+
+```js
+bcrypt.compare(myPlaintextPassword, hash, (err, res) => {
+  /*res == true or false*/
+});
+```
+
+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.
+
+```js
+bcrypt.hash('passw0rd!', 13, (err, hash) => {
+  console.log(hash);
+  //$2a$12$Y.PHPE15wR25qrrtgGkiYe2sXo98cjuMCG1YwSI5rJW1DSJp0gEYS
+  bcrypt.compare('passw0rd!', hash, (err, res) => {
+    console.log(res); //true
+  });
+});
+
+```
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+Async hash should be generated and correctly compared.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
new file mode 100644
index 0000000000..f7efd69368
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -0,0 +1,66 @@
+---
+id: 58a25bcff9fc0f352b528e7e
+title: Hash and Compare Passwords Synchronously
+challengeType: 2
+forumTopicId: 301579
+dashedName: hash-and-compare-passwords-synchronously
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+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
+
+```js
+var hash = bcrypt.hashSync(myPlaintextPassword, saltRounds);
+```
+
+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 won't 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:
+
+```js
+var result = bcrypt.compareSync(myPlaintextPassword, hash);
+```
+
+with the result being a boolean true or false.
+
+# --instructions--
+
+Add the function in and log the result to the console to see it working.
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+Sync hash should be generated and correctly compared.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
new file mode 100644
index 0000000000..fbf4faceb1
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -0,0 +1,40 @@
+---
+id: 587d8247367417b2b2512c37
+title: Hide Potentially Dangerous Information Using helmet.hidePoweredBy()
+challengeType: 2
+forumTopicId: 301580
+dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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. Use the `helmet.hidePoweredBy()` middleware to remove the X-Powered-By header.
+
+# --hints--
+
+helmet.hidePoweredBy() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
new file mode 100644
index 0000000000..2e89c44399
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -0,0 +1,53 @@
+---
+id: 587d8247367417b2b2512c36
+title: Install and Require Helmet
+challengeType: 2
+forumTopicId: 301581
+dashedName: install-and-require-helmet
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-infosec/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-infosec) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+Helmet helps you secure your Express apps by setting various HTTP headers.
+
+# --instructions--
+
+All your code for these lessons goes in the `myApp.js` file between the lines of code we have started you off with. Do not change or delete the code we have added for you.
+
+Install Helmet version `3.21.3`, then require it. You can install a specific version of a package with `npm install --save-exact package@version`, or by adding it to your `package.json` directly.
+
+# --hints--
+
+`helmet` version `3.21.3` should be in `package.json`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      const packJson = JSON.parse(data);
+      const helmet = packJson.dependencies.helmet;
+      assert(helmet === '3.21.3' || helmet === '^3.21.3');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
new file mode 100644
index 0000000000..33b43cd3be
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -0,0 +1,64 @@
+---
+id: 587d8247367417b2b2512c38
+title: Mitigate the Risk of Clickjacking with helmet.frameguard()
+challengeType: 2
+forumTopicId: 301582
+dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use `helmet.frameguard()` passing with the configuration object `{action: 'deny'}`.
+
+# --hints--
+
+helmet.frameguard() middleware should be mounted correctly
+
+```js
+(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);
+    }
+  );
+```
+
+helmet.frameguard() 'action' should be set to 'DENY'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
new file mode 100644
index 0000000000..82389f8d83
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -0,0 +1,52 @@
+---
+id: 587d8247367417b2b2512c39
+title: >-
+  Mitigate the Risk of Cross Site Scripting (XSS) Attacks with
+  helmet.xssFilter()
+challengeType: 2
+forumTopicId: 301583
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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. &lt;, >.
+
+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.
+
+# --instructions--
+
+Use `helmet.xssFilter()` to sanitize input sent to your server.
+
+# --hints--
+
+helmet.xssFilter() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
new file mode 100644
index 0000000000..995e6f8fc5
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -0,0 +1,44 @@
+---
+id: 587d8248367417b2b2512c3b
+title: Prevent IE from Opening Untrusted HTML with helmet.ieNoOpen()
+challengeType: 2
+forumTopicId: 301584
+dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.ieNoOpen()` method on your server.
+
+# --hints--
+
+helmet.ieNoOpen() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
new file mode 100644
index 0000000000..8c75941837
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -0,0 +1,71 @@
+---
+id: 587d8249367417b2b2512c3f
+title: Set a Content Security Policy with helmet.contentSecurityPolicy()
+challengeType: 2
+forumTopicId: 301585
+dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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 an allowed list 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 is 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.
+
+# --instructions--
+
+In this exercise, use `helmet.contentSecurityPolicy()`. Configure it by adding a `directives` object. In the object, set the `defaultSrc` to `["'self'"]` (the list of allowed sources must be in an array), in order to trust only your website address by default. Also set the `scriptSrc` directive so that you only allow scripts to be downloaded from your website (`'self'`), 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.
+
+# --hints--
+
+helmet.contentSecurityPolicy() middleware should be mounted correctly
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/app-info').then(
+    (data) => {
+      assert.include(data.appStack, 'csp');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+Your csp config is not correct. defaultSrc should be ["'self'"] and scriptSrc should be ["'self'", 'trusted-cdn.com']
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
new file mode 100644
index 0000000000..673ecb35c8
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -0,0 +1,72 @@
+---
+id: 58a25bcef9fc0f352b528e7c
+title: Understand BCrypt Hashes
+challengeType: 2
+forumTopicId: 301586
+dashedName: understand-bcrypt-hashes
+---
+
+# --description--
+
+For the following challenges, you will be working with a new starter project that is different from the previous one. You can find the new starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or clone it from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+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 an algorithm and returning a fixed length result. To further complicate this process and make it more secure, you can also *salt* 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 `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. The first small bit of data `$2a` is defining what kind of hash algorithm was used. The next portion `$13` defines the *cost*. 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 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm`, looks like one large string of numbers, periods, and letters but it is actually two separate pieces of information. The first 22 characters is the salt in plain text, and the rest is the hashed password!
+
+# --instructions--
+
+To begin using BCrypt, add it as a dependency in your project and require it as 'bcrypt' in your server.
+
+Add all your code for these lessons in the `server.js` file between the code we have started you off with. Do not change or delete the code we have added for you.
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+BCrypt should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+BCrypt should be properly required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /bcrypt.*=.*require.*('|")bcrypt('|")/gi,
+        'You should correctly require and instantiate socket.io as io.'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
new file mode 100644
index 0000000000..a808410376
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db0
+title: Creating a TCP Client
+challengeType: 11
+videoId: ugYfJNTawks
+dashedName: creating-a-tcp-client
+---
+
+# --question--
+
+## --text--
+
+Which socket object method lets you set the maximum amount of data your client accepts at once?
+
+## --answers--
+
+`.recv(1024)`
+
+---
+
+`.decode('ascii')`
+
+---
+
+`.connect(host, port)`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
new file mode 100644
index 0000000000..88f5f3fcfe
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
@@ -0,0 +1,43 @@
+---
+id: 5ea9997bbec2e9bc47e94db3
+title: Developing a Banner Grabber
+challengeType: 11
+videoId: CeGW761BIsA
+dashedName: developing-a-banner-grabber
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks to complete the `banner` function below:
+
+```py
+def banner(ip, port):
+    s = socket.socket()
+    s.__A__((ip, __B__))
+    print(s.recv(1024))
+```
+
+## --answers--
+
+A: `connect`
+
+B: `port`
+
+---
+
+A: `getsockname`
+
+B: `'1-1024'`
+
+---
+
+A: `connect`
+
+B: `int(port)`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
new file mode 100644
index 0000000000..a35002583e
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db4
+title: Developing a Port Scanner
+challengeType: 11
+videoId: z_qkqZS7KZ4
+dashedName: developing-a-port-scanner
+---
+
+# --question--
+
+## --text--
+
+What is the main difference between the `.connect()` and `.connect_ex()` methods?
+
+## --answers--
+
+There is no difference between the two methods.
+
+---
+
+If there is an error or if no host is found, `.connect()` returns an error code while `.connect_ex()` raises an exception.
+
+---
+
+If there is an error or if no host is found, `.connect()` raises an exception while `.connect_ex()` returns an error code.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
new file mode 100644
index 0000000000..8f26492699
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db1
+title: Developing an Nmap Scanner part 1
+challengeType: 11
+videoId: jYk9XaGoAnk
+dashedName: developing-an-nmap-scanner-part-1
+---
+
+# --question--
+
+## --text--
+
+What is the correct command to install the Python 3 version of the `python-nmap` library?
+
+## --answers--
+
+`sudo apt install python-nmap`
+
+---
+
+`pip install python-nmap`
+
+---
+
+`pip3 install python-nmap`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
new file mode 100644
index 0000000000..ab3a65968f
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db2
+title: Developing an Nmap Scanner part 2
+challengeType: 11
+videoId: a98PscnUsTg
+dashedName: developing-an-nmap-scanner-part-2
+---
+
+# --question--
+
+## --text--
+
+Which of the following allows you to scan for UDP ports between 21 to 443?
+
+## --answers--
+
+`.scan(ip_addr, '21-443', '-v -sU')`
+
+---
+
+`.scan(ip_addr, '1-1024', '-v -sS')`
+
+---
+
+`.scan(ip_addr, '21-443', '-v -sS')`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/introduction-and-setup.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/introduction-and-setup.md
new file mode 100644
index 0000000000..c243ea2954
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/introduction-and-setup.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94dae
+title: Introduction and Setup
+challengeType: 11
+videoId: XeQ7ZKtb998
+dashedName: introduction-and-setup
+---
+
+# --question--
+
+## --text--
+
+What code editor and extension does the instructor recommend for developing penetration testing tools in Python?
+
+## --answers--
+
+Atom and the atom-python-run extension.
+
+---
+
+VSCode and Microsoft's Python extension.
+
+---
+
+Sublime Text and the Anaconda package.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
new file mode 100644
index 0000000000..7a0f528118
--- /dev/null
+++ b/curriculum/challenges/italian/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94daf
+title: Understanding Sockets and Creating a TCP Server
+challengeType: 11
+videoId: F1QI9tNuDQg
+dashedName: understanding-sockets-and-creating-a-tcp-server
+---
+
+# --question--
+
+## --text--
+
+Which of the following functions creates a socket object?
+
+## --answers--
+
+`socket.bind((host, port))`
+
+---
+
+`socket.gethostbyname()`
+
+---
+
+`socket.socket(socket.AF_INET, socket.SOCK_STREAM)`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
new file mode 100644
index 0000000000..f5fa4e3e8c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -0,0 +1,150 @@
+---
+id: a3f503de51cf954ede28891d
+title: Find the Symmetric Difference
+challengeType: 5
+forumTopicId: 301611
+dashedName: find-the-symmetric-difference
+---
+
+# --description--
+
+The mathematical term <dfn>symmetric difference</dfn> (`△` or `⊕`) of two sets is the set of elements which are in either of the two sets but not in both. For example, for sets `A = {1, 2, 3}` and `B = {2, 3, 4}`, `A △ B = {1, 4}`.
+
+Symmetric difference is a binary operation, which means it operates on only two elements. So to evaluate an expression involving symmetric differences among *three* elements (`A △ B △ C`), you must complete one operation at a time. Thus, for sets `A` and `B` above, and `C = {2, 3}`, `A △ B △ C = (A △ B) △ C = {1, 4} △ {2, 3} = {1, 2, 3, 4}`.
+
+# --instructions--
+
+Create a function that takes two or more arrays and returns an array of their symmetric difference. The returned array must contain only unique values (*no duplicates*).
+
+# --hints--
+
+`sym([1, 2, 3], [5, 2, 1, 4])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3], [5, 2, 1, 4]).length, 3);
+```
+
+`sym([1, 2, 3, 3], [5, 2, 1, 4])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3, 3], [5, 2, 1, 4]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3, 3], [5, 2, 1, 4])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3, 3], [5, 2, 1, 4]).length, 3);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4, 5])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
+```
+
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`
+
+```js
+assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
+```
+
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]).length, 3);
+```
+
+`sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])` should return `[1, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]), [1, 4, 5]);
+```
+
+`sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]).length, 3);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])` should return `[2, 3, 4, 6, 7]`.
+
+```js
+assert.sameMembers(
+  sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]),
+  [2, 3, 4, 6, 7]
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])` should contain only five elements.
+
+```js
+assert.equal(
+  sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]).length,
+  5
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])` should return `[1, 2, 4, 5, 6, 7, 8, 9]`.
+
+```js
+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]
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])` should contain only eight elements.
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sym(args) {
+  return args;
+}
+
+sym([1, 2, 3], [5, 2, 1, 4]);
+```
+
+# --solutions--
+
+```js
+function sym() {
+  var arrays = [].slice.call(arguments);
+  return arrays.reduce(function (symDiff, arr) {
+    return symDiff.concat(arr).filter(function (val, idx, theArr) {
+      return theArr.indexOf(val) === idx
+        && (symDiff.indexOf(val) === -1 || arr.indexOf(val) === -1);
+    });
+  });
+}
+sym([1, 2, 3], [5, 2, 1, 4]);
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-bubble-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-bubble-sort.md
new file mode 100644
index 0000000000..6cf8150f25
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-bubble-sort.md
@@ -0,0 +1,140 @@
+---
+id: 8d5123c8c441eddfaeb5bdef
+title: Implement Bubble Sort
+challengeType: 1
+forumTopicId: 301612
+dashedName: 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.
+
+**Instructions:** Write a function `bubbleSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`bubbleSort` should be a function.
+
+```js
+assert(typeof bubbleSort == 'function');
+```
+
+`bubbleSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    bubbleSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`bubbleSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`bubbleSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  bubbleSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function bubbleSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+bubbleSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function bubbleSort(array) {
+  for (let i = 0; i < array.length; i++) {
+    let swapped = false;
+    for (let j = 1; j < array.length; j++) {
+      if (array[j - 1] > array[j]) {
+        let temp = array[j-1];
+        array[j-1] =  array[j];
+        array[j] = temp;
+        swapped = true;
+      }
+    }
+    if (swapped === false) {
+      break;
+    }
+  }
+  return array;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-insertion-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-insertion-sort.md
new file mode 100644
index 0000000000..ce4a857bea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-insertion-sort.md
@@ -0,0 +1,131 @@
+---
+id: 587d8259367417b2b2512c86
+title: Implement Insertion Sort
+challengeType: 1
+forumTopicId: 301613
+dashedName: 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.
+
+**Instructions:** Write a function `insertionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`insertionSort` should be a function.
+
+```js
+assert(typeof insertionSort == 'function');
+```
+
+`insertionSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    insertionSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`insertionSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`insertionSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  insertionSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function insertionSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+insertionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function insertionSort (array) {
+  for (let currentIndex = 0; currentIndex < array.length; currentIndex++) {
+    let current = array[currentIndex];
+    let j = currentIndex - 1;
+    while (j > -1 && array[j] > current) {
+      array[j + 1] = array[j];
+      j--;
+    }
+    array[j + 1] = current;
+  }
+  return array;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-merge-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-merge-sort.md
new file mode 100644
index 0000000000..ab1dca4381
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-merge-sort.md
@@ -0,0 +1,158 @@
+---
+id: 587d825c367417b2b2512c8f
+title: Implement Merge Sort
+challengeType: 1
+forumTopicId: 301614
+dashedName: implement-merge-sort
+---
+
+# --description--
+
+Another common intermediate sorting algorithm 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:
+
+**1)** Recursively split the input array in half until a sub-array with only one element is produced.
+
+**2)** Merge each sorted sub-array together to produce the final sorted array.
+
+Merge sort is an efficient sorting method, with time complexity of *O(nlog(n))*. 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.
+
+**Instructions:** Write a function `mergeSort` 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 `merge`, which is responsible for merging two sorted arrays, and another function, for instance `mergeSort`, which is responsible for the recursion that produces single-item arrays to feed into merge. Good luck!
+
+# --hints--
+
+`mergeSort` should be a function.
+
+```js
+assert(typeof mergeSort == 'function');
+```
+
+`mergeSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    mergeSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`mergeSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`mergeSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  mergeSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function mergeSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function mergeSort(array) {
+  if (array.length === 1) {
+    return array;
+  } else {
+    const splitIndex = Math.floor(array.length / 2);
+    return merge(
+      mergeSort(array.slice(0, splitIndex)),
+      mergeSort(array.slice(splitIndex))
+    );
+  }
+
+  // Merge two sorted arrays
+  function merge(array1, array2) {
+    let merged = [];
+    while (array1.length && array2.length) {
+      if (array1[0] < array2[0]) {
+        merged.push(array1.shift());
+      } else if (array1[0] > array2[0]) {
+        merged.push(array2.shift());
+      } else {
+        merged.push(array1.shift(), array2.shift());
+      }
+    }
+
+    // After looping ends, one array is empty, and other array contains only
+    // values greater than all values in `merged`
+    return [...merged, ...array1, ...array2];
+  }
+}
+
+mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-quick-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-quick-sort.md
new file mode 100644
index 0000000000..53ac770885
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-quick-sort.md
@@ -0,0 +1,142 @@
+---
+id: 587d825a367417b2b2512c89
+title: Implement Quick Sort
+challengeType: 1
+forumTopicId: 301615
+dashedName: 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 *O(nlog(n))* performance on average. It is also relatively easy to implement. These attributes make it a popular and useful sorting method.
+
+**Instructions:** Write a function `quickSort` 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.
+
+# --hints--
+
+`quickSort` should be a function.
+
+```js
+assert(typeof quickSort == 'function');
+```
+
+`quickSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    quickSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`quickSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  quickSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function quickSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function quickSort(array) {
+  if (array.length === 0) {
+    return [];
+  } else {
+    const pivotValue = array[0];
+
+    // Sort elements into three piles
+    let lesser = [];
+    let equal = [];
+    let greater = [];
+    for (let e of array) {
+      if (e < pivotValue) {
+        lesser.push(e);
+      } else if (e > pivotValue) {
+        greater.push(e);
+      } else {
+        equal.push(e);
+      }
+    }
+
+    return [...quickSort(lesser), ...equal, ...quickSort(greater)];
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-selection-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-selection-sort.md
new file mode 100644
index 0000000000..1a1b082090
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/implement-selection-sort.md
@@ -0,0 +1,134 @@
+---
+id: 587d8259367417b2b2512c85
+title: Implement Selection Sort
+challengeType: 1
+forumTopicId: 301616
+dashedName: 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.
+
+**Instructions**: Write a function `selectionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`selectionSort` should be a function.
+
+```js
+assert(typeof selectionSort == 'function');
+```
+
+`selectionSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    selectionSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`selectionSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`selectionSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  selectionSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function selectionSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+
+selectionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function selectionSort(array) {
+  for (let i = 0; i < array.length-1; i++) {
+    let minimumIndex = i;
+    for (let j = i+1; j < array.length; j++){
+      if (array[j] < array[minimumIndex]) {
+        minimumIndex = j;
+      }
+    }
+    let value = array[minimumIndex];
+    array[minimumIndex] = array[i];
+    array[i] = value;
+  }
+    return array;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/inventory-update.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/inventory-update.md
new file mode 100644
index 0000000000..e21c765a5f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/inventory-update.md
@@ -0,0 +1,228 @@
+---
+id: a56138aff60341a09ed6c480
+title: Inventory Update
+challengeType: 5
+forumTopicId: 16019
+dashedName: inventory-update
+---
+
+# --description--
+
+Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. Update the current existing inventory item quantities (in `arr1`). If an item cannot be found, add the new item and quantity into the inventory array. The returned inventory array should be in alphabetical order by item.
+
+# --hints--
+
+The function `updateInventory` should return an array.
+
+```js
+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']
+    ]
+  )
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return an array with a length of 6.
+
+```js
+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
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return `[[88, "Bowling Ball"], [2, "Dirty Sock"], [3, "Hair Pin"], [3, "Half-Eaten Apple"], [5, "Microphone"], [7, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [])` should return `[[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return `[[67, "Bowling Ball"], [2, "Hair Pin"], [3, "Half-Eaten Apple"], [7, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([[0, "Bowling Ball"], [0, "Dirty Sock"], [0, "Hair Pin"], [0, "Microphone"]], [[1, "Hair Pin"], [1, "Half-Eaten Apple"], [1, "Bowling Ball"], [1, "Toothpaste"]])` should return `[[1, "Bowling Ball"], [0, "Dirty Sock"], [1, "Hair Pin"], [1, "Half-Eaten Apple"], [0, "Microphone"], [1, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function updateInventory(arr1, arr2) {
+    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--
+
+```js
+function updateInventory(arr1, arr2) {
+  arr2.forEach(function(item) {
+    createOrUpdate(arr1, item);
+  });
+  // All inventory must be accounted for or you're fired!
+  return arr1;
+}
+
+function createOrUpdate(arr1, item) {
+  var index = -1;
+  while (++index < arr1.length) {
+    if (arr1[index][1] === item[1]) {
+      arr1[index][0] += item[0];
+      return;
+    }
+    if (arr1[index][1] > item[1]) {
+      break;
+    }
+  }
+  arr1.splice(index, 0, item);
+}
+
+// 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);
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/no-repeats-please.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/no-repeats-please.md
new file mode 100644
index 0000000000..7fc964e03f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/no-repeats-please.md
@@ -0,0 +1,126 @@
+---
+id: a7bf700cd123b9a54eef01d5
+title: No Repeats Please
+challengeType: 5
+forumTopicId: 16037
+dashedName: 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, `aab` should return 2 because it has 6 total permutations (`aab`, `aab`, `aba`, `aba`, `baa`, `baa`), but only 2 of them (`aba` and `aba`) don't have the same letter (in this case `a`) repeating.
+
+# --hints--
+
+`permAlone("aab")` should return a number.
+
+```js
+assert.isNumber(permAlone('aab'));
+```
+
+`permAlone("aab")` should return 2.
+
+```js
+assert.strictEqual(permAlone('aab'), 2);
+```
+
+`permAlone("aaa")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaa'), 0);
+```
+
+`permAlone("aabb")` should return 8.
+
+```js
+assert.strictEqual(permAlone('aabb'), 8);
+```
+
+`permAlone("abcdefa")` should return 3600.
+
+```js
+assert.strictEqual(permAlone('abcdefa'), 3600);
+```
+
+`permAlone("abfdefa")` should return 2640.
+
+```js
+assert.strictEqual(permAlone('abfdefa'), 2640);
+```
+
+`permAlone("zzzzzzzz")` should return 0.
+
+```js
+assert.strictEqual(permAlone('zzzzzzzz'), 0);
+```
+
+`permAlone("a")` should return 1.
+
+```js
+assert.strictEqual(permAlone('a'), 1);
+```
+
+`permAlone("aaab")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaab'), 0);
+```
+
+`permAlone("aaabb")` should return 12.
+
+```js
+assert.strictEqual(permAlone('aaabb'), 12);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permAlone(str) {
+  return str;
+}
+
+permAlone('aab');
+```
+
+# --solutions--
+
+```js
+function permAlone(str) {
+  return permuter(str).filter(function(perm) {
+    return !perm.match(/(.)\1/g);
+  }).length;
+}
+
+function permuter(str) {
+  // http://staff.roguecc.edu/JMiller/JavaScript/permute.html
+  //permArr: Global array which holds the list of permutations
+  //usedChars: Global utility array which holds a list of "currently-in-use" characters
+  var permArr = [], usedChars = [];
+  function permute(input) {
+    //convert input into a char array (one element for each character)
+    var i, ch, chars = input.split("");
+    for (i = 0; i < chars.length; i++) {
+      //get and remove character at index "i" from char array
+      ch = chars.splice(i, 1);
+      //add removed character to the end of used characters
+      usedChars.push(ch);
+      //when there are no more characters left in char array to add, add used chars to list of permutations
+      if (chars.length === 0) permArr[permArr.length] = usedChars.join("");
+      //send characters (minus the removed one from above) from char array to be permuted
+      permute(chars.join(""));
+      //add removed character back into char array in original position
+      chars.splice(i, 0, ch);
+      //remove the last character used off the end of used characters array
+      usedChars.pop();
+    }
+  }
+  permute(str);
+  return permArr;
+}
+
+permAlone('aab');
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/algorithms/pairwise.md b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/pairwise.md
new file mode 100644
index 0000000000..215b2fda0a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/algorithms/pairwise.md
@@ -0,0 +1,100 @@
+---
+id: a3f503de51cfab748ff001aa
+title: Pairwise
+challengeType: 5
+forumTopicId: 301617
+dashedName: pairwise
+---
+
+# --description--
+
+Given an array `arr`, find element pairs whose sum equal the second argument `arg` 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 instance, `pairwise([1, 1, 2], 3)` creates a pair `[2, 1]` using the 1 at index 0 rather than the 1 at index 1, because 0+2 &lt; 1+2.
+
+For example `pairwise([7, 9, 11, 13, 15], 20)` returns `6`. The pairs that sum to 20 are `[7, 13]` and `[9, 11]`. We can then write out the array with their indices and values.
+
+<div style='margin-left: 2em;'>
+
+| Index | 0 | 1 | 2  | 3  | 4  |
+| ----- | - | - | -- | -- | -- |
+| Value | 7 | 9 | 11 | 13 | 15 |
+
+</div>
+
+Below we'll take their corresponding indices and add them.
+
+<div style='margin-left: 2em;'>
+
+7 + 13 = 20 → Indices 0 + 3 = 3  
+9 + 11 = 20 → Indices 1 + 2 = 3  
+3 + 3 = 6 → Return `6`
+
+</div>
+
+# --hints--
+
+`pairwise([1, 4, 2, 3, 0, 5], 7)` should return 11.
+
+```js
+assert.deepEqual(pairwise([1, 4, 2, 3, 0, 5], 7), 11);
+```
+
+`pairwise([1, 3, 2, 4], 4)` should return 1.
+
+```js
+assert.deepEqual(pairwise([1, 3, 2, 4], 4), 1);
+```
+
+`pairwise([1, 1, 1], 2)` should return 1.
+
+```js
+assert.deepEqual(pairwise([1, 1, 1], 2), 1);
+```
+
+`pairwise([0, 0, 0, 0, 1, 1], 1)` should return 10.
+
+```js
+assert.deepEqual(pairwise([0, 0, 0, 0, 1, 1], 1), 10);
+```
+
+`pairwise([], 100)` should return 0.
+
+```js
+assert.deepEqual(pairwise([], 100), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pairwise(arr, arg) {
+  return arg;
+}
+
+pairwise([1,4,2,3,0,5], 7);
+```
+
+# --solutions--
+
+```js
+function pairwise(arr, arg) {
+  var sum = 0;
+  arr.forEach(function(e, i, a) {
+    if (e != null) {
+      var diff = arg-e;
+      a[i] = null;
+      var dix = a.indexOf(diff);
+      if (dix !== -1) {
+        sum += dix;
+        sum += i;
+        a[dix] = null;
+      }
+    }
+  });
+  return sum;
+}
+
+pairwise([1,4,2,3,0,5], 7);
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
new file mode 100644
index 0000000000..35a51fab5f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -0,0 +1,191 @@
+---
+id: 587d8257367417b2b2512c7b
+title: Add a New Element to a Binary Search Tree
+challengeType: 1
+forumTopicId: 301618
+dashedName: add-a-new-element-to-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 respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better:
+
+<div style='width: 100%; display: flex; justify-content: center; align-items: center;'><img style='width: 100%; max-width: 350px; background-color: var(--gray-05);' src='https://user-images.githubusercontent.com/18563015/32136009-1e665d98-bbd6-11e7-9133-63184f9f9182.png'></div>
+
+Now this ordered relationship is very easy to see. Note that every value to the left of 8, the root node, is less than 8, and every value to the right is greater than 8. Also notice that this relationship applies to each of the subtrees as well. For example, the first left child is a subtree. 3 is the parent node, and it has exactly two child nodes — by the rules governing binary search trees, we know without even looking that the left child of this node (and any of its children) will be less than 3, and the right child (and any of its children) will be greater than 3 (but also less than the structure's root value), and so on.
+
+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, you 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `add`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The add method should add elements according to the binary search tree rules.
+
+```js
+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);
+    const expectedResult = [1, 4, 7, 8, 34, 45, 73, 87];
+    const result = test.inOrder();
+    return expectedResult.toString() === result.toString();
+  })()
+);
+```
+
+Adding an element that already exists should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    inOrder() {
+      if (!this.root) {
+        return null;
+      }
+      var result = new Array();
+      function traverseInOrder(node) {
+        node.left && traverseInOrder(node.left);
+        result.push(node.value);
+        node.right && traverseInOrder(node.right);
+      }
+      traverseInOrder(this.root);
+      return result;
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function Node(value) {
+  this.value = value;
+  this.left = null;
+  this.right = null;
+}
+function BinarySearchTree() {
+  this.root = null;
+  this.add = function(element) {
+    let current = this.root;
+    if (!current) {
+      this.root = new Node(element);
+      return;
+    } else {
+      const searchTree = function(current) {
+        if (current.value > element) {
+          if (current.left) {
+            return searchTree(current.left);
+          } else {
+            current.left = new Node(element);
+            return;
+          }
+        } else if (current.value < element) {
+          if (current.right) {
+            return searchTree(current.right);
+          } else {
+            current.right = new Node(element);
+            return;
+          }
+        } else {
+          return null;
+        }
+      };
+      return searchTree(current);
+    }
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
new file mode 100644
index 0000000000..3ca9c8c0f4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
@@ -0,0 +1,161 @@
+---
+id: 587d8252367417b2b2512c67
+title: Add Elements at a Specific Index in a Linked List
+challengeType: 1
+forumTopicId: 301619
+dashedName: 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 could not be added. **Note:** Remember to check if the given index is a negative or is longer than the length of the linked list.
+
+# --hints--
+
+Your `addAt` method should reassign `head` to the new node when the given index is 0.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.addAt(0, 'cat');
+    return test.head().element === 'cat';
+  })()
+);
+```
+
+Your `addAt` method should increase the length of the linked list by one for each new node added to the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.addAt(0, 'cat');
+    return test.size() === 3;
+  })()
+);
+```
+
+Your `addAt` method should return `false` if a node was unable to be added.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.addAt(4, 'cat') === false;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+    length++;
+  };
+
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+    length++;
+  };
+  this.addAt = function (index, element) {
+    if (index > length || index < 0) {
+      return false;
+    }
+    var newNode = new Node(element);
+    var currentNode = head;
+    if (index === 0) {
+      head = newNode;
+    } else {
+      var previousNode = null;
+      var i = 0;
+      while (currentNode && i < index) {
+        previousNode = currentNode;
+        currentNode = currentNode.next;
+        i++;
+      }
+      previousNode.next = newNode;
+    }
+    newNode.next = currentNode;
+    length++;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-list.md
new file mode 100644
index 0000000000..72868a02d7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-list.md
@@ -0,0 +1,91 @@
+---
+id: 587d8256367417b2b2512c77
+title: Adjacency List
+challengeType: 1
+forumTopicId: 301620
+dashedName: 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 `Node1` is connected to `Node2` and `Node3`, and that information is consistent with the connections `Node2` and `Node3` show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then `Node2: Node1` would mean there the directed edge is pointing from `Node2` towards `Node1`. We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.
+
+```js
+var undirectedG = {
+  Node1: ["Node2", "Node3"],
+  Node2: ["Node1"],
+  Node3: ["Node1"]
+};
+```
+
+This can also be more simply represented as an array where the nodes just have numbers rather than string labels.
+
+```js
+var undirectedGArr = [
+  [1, 2], // Node1
+  [0],    // Node2
+  [0]     // Node3
+];
+```
+
+# --instructions--
+
+Create a social network as an undirected graph with 4 nodes/people named `James`, `Jill`, `Jenny`, and `Jeff`. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny.
+
+# --hints--
+
+`undirectedAdjList` should only contain four nodes.
+
+```js
+assert(Object.keys(undirectedAdjList).length === 4);
+```
+
+There should be an edge between `Jeff` and `James`.
+
+```js
+assert(
+  undirectedAdjList.James.indexOf('Jeff') !== -1 &&
+    undirectedAdjList.Jeff.indexOf('James') !== -1
+);
+```
+
+There should be an edge between `Jill` and `Jenny`.
+
+```js
+assert(
+  undirectedAdjList.Jill.indexOf('Jenny') !== -1 &&
+    undirectedAdjList.Jill.indexOf('Jenny') !== -1
+);
+```
+
+There should be an edge between `Jeff` and `Jenny`.
+
+```js
+assert(
+  undirectedAdjList.Jeff.indexOf('Jenny') !== -1 &&
+    undirectedAdjList.Jenny.indexOf('Jeff') !== -1
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var undirectedAdjList = {};
+```
+
+# --solutions--
+
+```js
+var undirectedAdjList = {
+  James: ['Jeff'],
+  Jill: ['Jenny'],
+  Jenny: ['Jill', 'Jeff'],
+  Jeff: ['James', 'Jenny']
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-matrix.md
new file mode 100644
index 0000000000..a852fb9b08
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/adjacency-matrix.md
@@ -0,0 +1,108 @@
+---
+id: 587d8256367417b2b2512c78
+title: Adjacency Matrix
+challengeType: 1
+forumTopicId: 301621
+dashedName: 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.
+
+**Note**: The numbers to the top and left of the matrix are just labels for the nodes. Inside the matrix, ones mean there exists an edge between the vertices (nodes) representing the row and column. Finally, zeros mean there is no edge or relationship.
+
+<pre>
+    1 2 3
+  \------
+1 | 0 1 1
+2 | 1 0 0
+3 | 1 0 0
+</pre>
+
+Above is a very simple, undirected graph where you have three nodes, where the first node is connected to the second and third node. Below is a JavaScript implementation of the same thing.
+
+```js
+var adjMat = [
+  [0, 1, 1],
+  [1, 0, 0],
+  [1, 0, 0]
+];
+```
+
+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.
+
+```js
+var adjMatDirected = [
+  [0, 1, 0],
+  [0, 0, 1],
+  [0, 0, 0]
+];
+```
+
+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 (`0` or `1`). You can have different weights depending on your application.
+
+# --instructions--
+
+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.
+
+# --hints--
+
+`undirectedAdjList` should only contain five nodes.
+
+```js
+assert(
+  adjMatUndirected.length === 5 &&
+    adjMatUndirected
+      .map(function (x) {
+        return x.length === 5;
+      })
+      .reduce(function (a, b) {
+        return a && b;
+      })
+);
+```
+
+There should be an edge between the first and fourth node.
+
+```js
+assert(adjMatUndirected[0][3] === 1 && adjMatUndirected[3][0] === 1);
+```
+
+There should be an edge between the first and third node.
+
+```js
+assert(adjMatUndirected[0][2] === 1 && adjMatUndirected[2][0] === 1);
+```
+
+There should be an edge between the third and fifth node.
+
+```js
+assert(adjMatUndirected[2][4] === 1 && adjMatUndirected[4][2] === 1);
+```
+
+There should be an edge between the fourth and fifth node.
+
+```js
+assert(adjMatUndirected[3][4] === 1 && adjMatUndirected[4][3] === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var adjMatUndirected = [];
+```
+
+# --solutions--
+
+```js
+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]
+];
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/breadth-first-search.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/breadth-first-search.md
new file mode 100644
index 0000000000..1207024135
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/breadth-first-search.md
@@ -0,0 +1,182 @@
+---
+id: 587d825c367417b2b2512c90
+title: Breadth-First Search
+challengeType: 1
+forumTopicId: 301622
+dashedName: 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 and visits all its neighbors that are one edge away. It then goes on to visit each of their neighbors and so on until all nodes have been reached.
+
+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.
+
+Visually, this is what the algorithm is doing. ![Breadth first search algorithm moving through a tree](https://camo.githubusercontent.com/2f57e6239884a1a03402912f13c49555dec76d06/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f342f34362f416e696d617465645f4246532e676966)
+
+The grey shading represents a node getting added into the queue and the black shading represents a node getting removed from the queue. See how every time a node gets removed from the queue (node turns black), all their neighbors get added into the queue (node turns grey).
+
+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, or number of edges away from, the start node. You'll want to start all your distances with some large number, like `Infinity`. This prevents counting issues for when 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.
+
+# --instructions--
+
+Write a function `bfs()` 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 `0` and `n - 1`, where `n` 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 `Infinity`.
+
+# --hints--
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return `{0: 1, 1: 0, 2: 1, 3: 2}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `1` should return `{0: 1, 1: 0, 2: 1, 3: Infinity}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return `{0: 0, 1: 1, 2: 2, 3: 3}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1], [1, 0]]` with a start node of `0` should return `{0: 0, 1: 1}`
+
+```js
+assert(
+  (function () {
+    var graph = [
+      [0, 1],
+      [1, 0]
+    ];
+    var results = bfs(graph, 0);
+    return isEquivalent(results, { 0: 0, 1: 1 });
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+// 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;
+}
+```
+
+## --seed-contents--
+
+```js
+function bfs(graph, root) {
+  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));
+```
+
+# --solutions--
+
+```js
+function bfs(graph, root) {
+  var nodesLen = {};
+  // Set all distances to infinity
+  for (var i = 0; i < graph.length; i++) {
+    nodesLen[i] = Infinity;
+  }
+  nodesLen[root] = 0; // ...except root node
+  var queue = [root]; // Keep track of nodes to visit
+  var current; // Current node traversing
+  // Keep on going until no more nodes to traverse
+  while (queue.length !== 0) {
+    current = queue.shift();
+    // Get adjacent nodes from current node
+    var curConnected = graph[current]; // Get layer of edges from current
+    var neighborIdx = []; // List of nodes with edges
+    var idx = curConnected.indexOf(1); // Get first edge connection
+    while (idx !== -1) {
+      neighborIdx.push(idx); // Add to list of neighbors
+      idx = curConnected.indexOf(1, idx + 1); // Keep on searching
+    }
+    // Loop through neighbors and get lengths
+    for (var j = 0; j < neighborIdx.length; j++) {
+      // Increment distance for nodes traversed
+      if (nodesLen[neighborIdx[j]] === Infinity) {
+        nodesLen[neighborIdx[j]] = nodesLen[current] + 1;
+        queue.push(neighborIdx[j]); // Add new neighbors to queue
+      }
+    }
+  }
+  return nodesLen;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..e45bd5a51a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
@@ -0,0 +1,175 @@
+---
+id: 587d8257367417b2b2512c7c
+title: Check if an Element is Present in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301623
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `isPresent`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.isPresent == 'function';
+  })()
+);
+```
+
+The `isPresent` method should correctly check for the presence or absence of elements added to the tree.
+
+```js
+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)
+    );
+  })()
+);
+```
+
+`isPresent` should handle cases where the tree is empty.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.isPresent = function (value) {
+    var current = this.root
+    while (current) {
+      if (value === current.value) {
+        return true;
+      }
+      current = value < current.value ? current.left : current.right;
+    }
+    return false;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
new file mode 100644
index 0000000000..ddaf38f231
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -0,0 +1,136 @@
+---
+id: 5cc0c1b32479e176caf3b422
+title: Check if Tree is Binary Search Tree
+challengeType: 1
+forumTopicId: 301624
+dashedName: check-if-tree-is-binary-search-tree
+---
+
+# --description--
+
+Since you already know what a binary search tree is, this challenge will establish how it is you can tell that a tree is a binary search tree or not.
+
+The main distinction of a binary search tree is that the nodes are ordered in an organized fashion. Nodes have at most 2 child nodes (placed to the right and/or left) based on if the child node's value is greater than or equal to (right) or less than (left) the parent node.
+
+# --instructions--
+
+In this challenge, you will create a utility for your tree. Write a JavaScript method `isBinarySearchTree` which takes a tree as an input and returns a boolean value for whether the tree is a binary search tree or not. Use recursion whenever possible.
+
+# --hints--
+
+Your Binary Search Tree should return true when checked with `isBinarySearchTree()`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    test.push(1);
+    test.push(5);
+    test.push(3);
+    test.push(2);
+    test.push(4);
+    return isBinarySearchTree(test) == true;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype.push = function(val) {
+  var root = this.root;
+
+  if (!root) {
+    this.root = new Node(val);
+    return;
+  }
+
+  var currentNode = root;
+  var newNode = new Node(val);
+
+  while (currentNode) {
+    if (val < currentNode.value) {
+      if (!currentNode.left) {
+        currentNode.left = newNode;
+        break;
+      } else {
+        currentNode = currentNode.left;
+      }
+    } else {
+      if (!currentNode.right) {
+        currentNode.right = newNode;
+        break;
+      } else {
+        currentNode = currentNode.right;
+      }
+    }
+  }
+};
+```
+
+## --seed-contents--
+
+```js
+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;
+}
+function isBinarySearchTree(tree) {
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+}
+function isBinarySearchTree(tree) {
+  if (tree.root == null) {
+    return null;
+  } else {
+    let isBST = true;
+    function checkTree(node) {
+      if (node.left != null) {
+        const left = node.left;
+        if (left.value > node.value) {
+          isBST = false;
+        } else {
+          checkTree(left);
+        }
+      }
+      if (node.right != null) {
+        const right = node.right;
+        if (right.value < node.value) {
+          isBST = false;
+        } else {
+          checkTree(right);
+        }
+      }
+    }
+    checkTree(tree.root);
+    return isBST;
+  }
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-circular-queue.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-circular-queue.md
new file mode 100644
index 0000000000..16ff688fab
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-circular-queue.md
@@ -0,0 +1,235 @@
+---
+id: 587d8255367417b2b2512c75
+title: Create a Circular Queue
+challengeType: 1
+forumTopicId: 301625
+dashedName: create-a-circular-queue
+---
+
+# --description--
+
+In this challenge you will be creating a Circular Queue. A circular queue is a queue that writes to the end of a collection then begins overwriting itself at the beginning of the collection. This type of data structure is useful in certain situations. For example, a circular queue can be used for streaming media. Once the queue is full, new media data will overwrite old data.
+
+A good way to illustrate this concept is with an array of length `5`:
+
+```js
+[null, null, null, null, null]
+ ^Read @ 0
+ ^Write @ 0
+```
+
+Here the read and write are both at position `0`. Now the queue gets 3 new records `a`, `b`, and `c`. Our queue now looks like:
+
+```js
+[a, b, c, null, null]
+ ^Read @ 0
+          ^Write @ 3
+```
+
+As the read head reads, it can remove values or keep them:
+
+```js
+[null, null, null, null, null]
+                   ^Read @ 3
+                   ^Write @ 3
+```
+
+Now we write the values `d`, `e`, and `f` to the queue. Once the write reaches the end of the array it loops back to the beginning:
+
+```js
+[f, null, null, d, e]
+                ^Read @ 3
+    ^Write @ 1
+```
+
+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 `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. 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. The `enqueue` method should return the item you enqueued if it is successful; otherwise it will return `null`.
+
+Likewise, the read pointer should advance forward as you dequeue items. When you dequeue an item, that item should be returned. If you cannot dequeue an item, you should return `null`.
+
+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.
+
+# --hints--
+
+The `enqueue` method should add items to the circular queue.
+
+```js
+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;
+  })()
+);
+```
+
+You should not enqueue items past the read pointer.
+
+```js
+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;
+  })()
+);
+```
+
+The `dequeue` method should dequeue items from the queue.
+
+```js
+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
+    );
+  })()
+);
+```
+
+After an item is dequeued, its position in the queue should be reset to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+Trying to dequeue past the write pointer should return `null` and does not advance the write pointer.
+
+```js
+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
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+  }
+}
+```
+
+# --solutions--
+
+```js
+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
+    console.log(this.write, this.max);
+    if (this.queue[this.write] === null) {
+      this.queue[this.write++] = item;
+
+      if (this.write > this.max) {
+        this.write = 0;
+      }
+      return item;
+    }
+    return null;
+    // Only change code above this line
+  }
+
+  dequeue() {
+    // Only change code below this line
+    if (this.queue[this.read] !== null) {
+      let item = this.queue[this.read];
+      this.queue[this.read++] = null;
+      if (this.read > this.max) {
+        this.read = 0;
+      }
+      return item;
+    }
+    return null;
+    // Only change code above this line
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
new file mode 100644
index 0000000000..8e727deba5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -0,0 +1,216 @@
+---
+id: 587d825a367417b2b2512c87
+title: Create a Doubly Linked List
+challengeType: 1
+forumTopicId: 301626
+dashedName: 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.
+
+# --instructions--
+
+We've provided a `Node` object and started our `DoublyLinkedList`. Let's add two methods to our doubly linked list called `add` and `remove`. The `add` method should add the given element to the list while the `remove` 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 `null`.
+
+# --hints--
+
+The DoublyLinkedList data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called add.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.add == undefined) {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.remove == undefined) {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Removing an item from an empty list should return null.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return test.remove(100) == null;
+  })()
+);
+```
+
+The add method should add items to the list.
+
+```js
+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';
+  })()
+);
+```
+
+Each node should keep track of the previous node.
+
+```js
+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';
+  })()
+);
+```
+
+The first item should be removable from the list.
+
+```js
+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';
+  })()
+);
+```
+
+The last item should be removable from the list.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+DoublyLinkedList.prototype = Object.assign(
+  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;
+    };
+  }
+});
+```
+
+## --seed-contents--
+
+```js
+var Node = function(data, prev) {
+  this.data = data;
+  this.prev = prev;
+  this.next = null;
+};
+var DoublyLinkedList = function() {
+  this.head = null;
+  this.tail = null;
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-hash-table.md
new file mode 100644
index 0000000000..05f5c099bb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -0,0 +1,260 @@
+---
+id: 587d825b367417b2b2512c8e
+title: Create a Hash Table
+challengeType: 1
+forumTopicId: 301627
+dashedName: 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(1) 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!
+
+**Note:** The `remove` method tests won't pass until the `add` and `lookup` methods are correctly implemented.
+
+# --hints--
+
+The HashTable data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test === 'object';
+  })()
+);
+```
+
+The HashTable should have an add method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+The HashTable should have a lookup method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.lookup === 'function';
+  })()
+);
+```
+
+The HashTable should have a remove method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+The add method should add key value pairs and the lookup method should return the values associated with a given key.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+    return test.lookup('key') === 'value';
+  })()
+);
+```
+
+The remove method should accept a key as input and should remove the associated key value pair.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    var hashValue = hash('key');
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+
+    test.remove('key');
+    return !test.collection.hasOwnProperty(hashValue);
+  })()
+);
+```
+
+The remove method should only remove the correct key value pair.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    var hashValue = hash('key');
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+    test.add('yek', 'value');
+    test.add('altKey', 'value');
+
+    test.remove('yek');
+    if (test.lookup('yek') || !test.lookup('key') || !test.lookup('altKey')) {
+      return false;
+    }
+
+    test.remove('key');
+
+    return !test.collection.hasOwnProperty(hashValue) && test.lookup('altKey');
+  })()
+);
+```
+
+Items should be added using the hash function.
+
+```js
+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 && called % 3 === 0;
+  })()
+);
+```
+
+The hash table should handle collisions.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+var called = 0;
+var hash = string => {
+  called++;
+  var hash = 0;
+  for (var i = 0; i < string.length; i++) {
+    hash += string.charCodeAt(i);
+  }
+  return hash;
+};
+```
+
+## --seed-contents--
+
+```js
+var called = 0;
+var hash = string => {
+  called++;
+  var hashed = 0;
+  for (var i = 0; i < string.length; i++) {
+    hashed += string.charCodeAt(i);
+  }
+  return hashed;
+};
+var HashTable = function() {
+  this.collection = {};
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+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 = {};
+  // Only change code below this line
+
+  this.add = function(key, val) {
+    var theHash = hash(key);
+    if (!this.collection.hasOwnProperty(theHash)) {
+      this.collection[theHash] = {};
+    }
+    this.collection[theHash][key] = val;
+  }
+
+  this.remove = function(key) {
+    var theHash = hash(key);
+    var hashedObj = this.collection[theHash];
+    if (hashedObj.hasOwnProperty(key)) {
+      delete hashedObj[key];
+    }
+    if (!Object.keys(hashedObj).length) {
+      delete this.collection[theHash];
+    }
+  }
+
+  this.lookup = function(key) {
+    var theHash = hash(key);
+    if (this.collection.hasOwnProperty(theHash)) {
+      return this.collection[theHash][key];
+    }
+    return null
+  }
+  // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-linked-list-class.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
new file mode 100644
index 0000000000..0c768cf0a2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
@@ -0,0 +1,145 @@
+---
+id: 587d8251367417b2b2512c62
+title: Create a Linked List Class
+challengeType: 1
+forumTopicId: 301628
+dashedName: create-a-linked-list-class
+---
+
+# --description--
+
+Let's create a `linked list` class. Every linked list should start out with a few basic properties: a `head` (the first item in your list) and a `length` (number of items in your list). Sometimes you'll see implementations of linked lists that incorporate a `tail` 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 `length` 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 `add` method.
+
+If our list is empty, adding an element to our linked list is straightforward enough: we just wrap that element in a `Node` class, and we assign that node to the `head` 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 `next` property. To add a node to the list, find the last node in the list, and point that last node's `next` property at our new node. (Hint: you know you've reached the end of a linked list when a node's `next` property is `null`.)
+
+# --instructions--
+
+Write an add method that assigns the first node you push to the linked list to the `head`; after that, whenever adding a node, every node should be referenced by the previous node's `next` property.
+
+Note
+
+Your list's `length` should increase by one every time an element is added to the linked list.
+
+# --hints--
+
+Your `LinkedList` class should have a `add` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+Your `LinkedList` class should assign `head` to the first node added.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    return test.head().element === 'cat';
+  })()
+);
+```
+
+The previous `node` in your `LinkedList` class should have reference to the newest node created.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.head().next.element === 'dog';
+  })()
+);
+```
+
+The  `size` of your `LinkedList` class should equal the amount of nodes in the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.size() === 2;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+  };
+}
+```
+
+# --solutions--
+
+```js
+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
+    if (head == null) {
+      head = new Node(element);
+    } 
+    else {
+      let currentNode = head;
+      while (currentNode.next != null) {
+        // currentNode.next will be last node of linked list after loop
+        currentNode = currentNode.next;
+      }
+      currentNode.next = new Node(element);
+    }
+    length++;
+    // Only change code above this line
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
new file mode 100644
index 0000000000..ac3d5754d0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -0,0 +1,204 @@
+---
+id: 8d5823c8c441eddfaeb5bdef
+title: Create a Map Data Structure
+challengeType: 1
+forumTopicId: 301629
+dashedName: create-a-map-data-structure
+---
+
+# --description--
+
+The next few challenges will cover maps and hash tables. Maps are data structures 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 `Map` object provided here as a wrapper around a JavaScript `object`. Create the following methods and operations on the Map object:
+
+<ul>
+<li><code>add</code> accepts a <code>key, value</code> pair to add to the map.</li>
+<li><code>remove</code> accepts a key and removes the associated <code>key, value</code> pair</li>
+<li><code>get</code> accepts a <code>key</code> and returns the stored <code>value</code></li>
+<li><code>has</code> accepts a <code>key</code> and returns <dfn>true</dfn> if the key exists or <dfn>false</dfn> if it doesn't.</li>
+<li><code>values</code> returns an array of all the values in the map</li>
+<li><code>size</code> returns the number of items in the map</li>
+<li><code>clear</code> empties the map</li>
+</ul>
+
+# --hints--
+
+The Map data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The Map object should have the following methods: add, remove, get, has, values, clear, and size.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+The add method should add items to the map.
+
+```js
+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() == 2;
+  })()
+);
+```
+
+The has method should return true for added items and false for absent items.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    test.add('test', 'value');
+    return test.has('test') && !test.has('false');
+  })()
+);
+```
+
+The get method should accept keys as input and should return the associated values.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    test.add('abc', 'def');
+    return test.get('abc') == 'def';
+  })()
+);
+```
+
+The values method should return all the values stored in the map as strings in an array.
+
+```js
+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
+    );
+  })()
+);
+```
+
+The clear method should empty the map and the size method should return the number of items present in the map.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var Map = function() {
+  this.collection = {};
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+var Map = function() {
+    this.collection = {};
+    // Only change code below this line
+
+    this.add = function(key,value) {
+      this.collection[key] = value;
+    }
+
+    this.remove = function(key) {
+      delete this.collection[key];
+    }
+
+    this.get = function(key) {
+      return this.collection[key];
+    }
+
+    this.has = function(key) {
+      return this.collection.hasOwnProperty(key)
+    }
+
+    this.values = function() {
+      return Object.values(this.collection);
+    }
+
+    this.size = function() {
+      return Object.keys(this.collection).length;
+    }
+
+    this.clear = function() {
+      for(let item of Object.keys(this.collection)) {
+        delete this.collection[item];
+      }
+    }
+    // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
new file mode 100644
index 0000000000..c381e3940b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
@@ -0,0 +1,231 @@
+---
+id: 587d8255367417b2b2512c74
+title: Create a Priority Queue Class
+challengeType: 1
+forumTopicId: 301630
+dashedName: 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:
+
+```js
+[['kitten', 2], ['dog', 2], ['rabbit', 2]]
+```
+
+Here the second value (an integer) represents item priority. If we enqueue `['human', 1]` with a priority of `1` (assuming lower priorities are given precedence) it would then be the first item to be dequeued. The collection would look like this:
+
+```js
+[['human', 1], ['kitten', 2], ['dog', 2], ['rabbit', 2]]
+```
+
+We’ve started writing a `PriorityQueue` in the code editor. You will need to add an `enqueue` method for adding items with a priority, a `dequeue` method for removing and returning items, a `size` method to return the number of items in the queue, a `front` method to return the element at the front of the queue, and finally an `isEmpty` method that will return `true` if the queue is empty or `false` if it is not.
+
+The `enqueue` should accept items with the format shown above (`['human', 1]`) where `1` represents the priority. `dequeue` and `front` should return only the item's name, not its priority.
+
+# --hints--
+
+Your `PriorityQueue` class should have a `enqueue` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.enqueue === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `dequeue` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.dequeue === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `front` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.front === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should correctly keep track of the current number of items using the `size` method as items are enqueued and dequeued.
+
+```js
+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;
+  })()
+);
+```
+
+The `front` method should return the correct item at the front of the queue as items are enqueued and dequeued.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    test.enqueue(['David Brown', 2]);
+    var front1 = test.front();
+    test.enqueue(['Jon Snow', 1]);
+    var front2 = test.front();
+    test.dequeue();
+    test.enqueue(['A', 3]);
+    var front3 = test.front();
+    test.enqueue(['B', 3]);
+    test.enqueue(['C', 3]);
+    test.dequeue();
+    var front4 = test.front();
+    return (
+      front1 === 'David Brown' &&
+      front2 === 'Jon Snow' &&
+      front3 === 'David Brown' &&
+      front4 === 'A'
+    );
+  })()
+);
+```
+
+The `isEmpty` method should return `true` when the queue is empty.
+
+```js
+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();
+  })()
+);
+```
+
+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.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function PriorityQueue () {
+  this.collection = [];
+  this.printCollection = function() {
+    console.log(this.collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function PriorityQueue() {
+  this.collection = [];
+  this.printCollection = function () {
+    console.log(this.collection);
+  };
+  // Only change code below this line
+  this.enqueue = function (newitem) {
+    if (this.isEmpty()) {
+      return this.collection.push(newitem);
+    }
+
+    this.collection = this.collection.reverse();
+    var found_index = this.collection.findIndex(function (item) {
+      return newitem[1] >= item[1];
+    });
+    if (found_index === -1) {
+      this.collection.push(newitem);
+    } else {
+      this.collection.splice(found_index, 0, newitem);
+    }
+    this.collection = this.collection.reverse();
+  };
+  this.dequeue = function () {
+    if (!this.isEmpty()) {
+      return this.collection.shift()[0];
+    } else {
+      return "The queue is empty.";
+    }
+  };
+  this.size = function () {
+    return this.collection.length;
+  };
+  this.front = function () {
+    return this.collection[0][0];
+  };
+  this.isEmpty = function () {
+    return this.size() > 0 ? false : true;
+  };
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-queue-class.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-queue-class.md
new file mode 100644
index 0000000000..306b90e0c0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-queue-class.md
@@ -0,0 +1,174 @@
+---
+id: 587d8250367417b2b2512c60
+title: Create a Queue Class
+challengeType: 1
+forumTopicId: 301631
+dashedName: 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.
+
+# --hints--
+
+Your `Queue` class should have a `enqueue` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.enqueue === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `dequeue` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.dequeue === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `front` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.front === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+The `dequeue` method should remove and return the front element of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    test.enqueue('John');
+    return test.dequeue() === 'Smith';
+  })()
+);
+```
+
+The `front` method should return value of the front element of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    test.enqueue('John');
+    return test.front() === 'Smith';
+  })()
+);
+```
+
+The `size` method should return the length of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    return test.size() === 1;
+  })()
+);
+```
+
+The `isEmpty` method should return `false` if there are elements in the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    return !test.isEmpty();
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Queue() {
+  var collection = [];
+  this.print = function() {
+    console.log(collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function Queue () { 
+    var collection = [];
+    this.print = function() {
+        console.log(collection);
+    };
+    // Only change code below this line
+    this.enqueue = function(item) {
+        collection.push(item);
+    }
+
+    this.dequeue = function() {
+        return collection.shift();
+    }
+
+    this.front = function() {
+        return collection[0];
+    }
+
+    this.size = function(){
+        return collection.length;
+    }
+
+    this.isEmpty = function() {
+        return collection.length === 0 ? true : false;
+    }
+    // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-set-class.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-set-class.md
new file mode 100644
index 0000000000..8dae14f764
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-set-class.md
@@ -0,0 +1,219 @@
+---
+id: 8d1323c8c441eddfaeb5bdef
+title: Create a Set Class
+challengeType: 1
+forumTopicId: 301632
+dashedName: create-a-set-class
+---
+
+# --description--
+
+In this exercise we are going to create a class named `Set` to emulate an abstract data structure called "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. We can see how the ES6 `Set` object works in the example below:
+
+```js
+const set1 = new Set([1, 2, 3, 5, 5, 2, 0]);
+console.log(set1);
+// output: {1, 2, 3, 5, 0}
+console.log(set1.has(1));
+// output: true
+console.log(set1.has(6));
+// output: false
+```
+
+First, we will create an add method that adds a value to our set collection as long as the value does not already exist in the set. Then we will create a remove method that removes a value from the set collection if it already exists. And finally, we will create a size method that returns the number of elements inside the set collection.
+
+# --instructions--
+
+Create an `add` method that adds a unique value to the set collection and returns `true` if the value was successfully added and `false` otherwise.
+
+Create a `remove` method that accepts a value and checks if it exists in the set. If it does, then this method should remove it from the set collection, and return `true`. Otherwise, it should return `false`. Create a `size` method that returns the size of the set collection.
+
+# --hints--
+
+Your `Set` class should have an `add` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+Your `add` method should not add duplicate values.
+
+```js
+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;
+  })()
+);
+```
+
+Your `add` method should return `true` when a value has been successfully added.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    var result = test.add('a');
+    return result != undefined && result === true;
+  })()
+);
+```
+
+Your `add` method should return `false` when a duplicate value is added.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    var result = test.add('a');
+    return result != undefined && result === false;
+  })()
+);
+```
+
+Your `Set` class should have a `remove` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+Your `remove` method should only remove items that are present in the set.
+
+```js
+assert.deepEqual(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    test.add('b');
+    test.remove('c');
+    return test.values();
+  })(),
+  ['a', 'b']
+);
+```
+
+Your `remove` method should remove the given item from the set.
+
+```js
+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;
+  })()
+);
+```
+
+Your `Set` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+The `size` method should return the number of elements in the collection.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    test.add('b');
+    test.remove('a');
+    return test.size() === 1;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // Dictionary will hold the items of our set
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  // This method will return all the values in the set
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-stack-class.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-stack-class.md
new file mode 100644
index 0000000000..c4a493c439
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-stack-class.md
@@ -0,0 +1,167 @@
+---
+id: 587d8250367417b2b2512c5f
+title: Create a Stack Class
+challengeType: 1
+forumTopicId: 301633
+dashedName: 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 `push` and `pop` method, stacks have other useful methods. Let's add a `peek`, `isEmpty`, and `clear` method to our stack class.
+
+# --instructions--
+
+Write a `push` method that pushes an element to the top of the stack, a `pop` method that removes and returns the element on the top of the stack, a `peek` method that looks at the top element in the stack, an `isEmpty` method that checks if the stack is empty, and a `clear` method that removes all elements from the stack. Normally stacks don't have this, but we've added a `print` helper method that console logs the collection.
+
+# --hints--
+
+Your `Stack` class should have a `push` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.push === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `pop` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.pop === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `peek` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.peek === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `clear` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.clear === 'function';
+  })()
+);
+```
+
+The `peek` method should return the top element of the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    return test.peek() === 'CS50' && test.peek() === 'CS50';
+  })()
+);
+```
+
+The `pop` method should remove and return the top element of the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    return test.pop() === 'CS50' && test.pop() === 'CS61';
+  })()
+);
+```
+
+The `isEmpty` method should return true if a stack does not contain any elements
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return test.isEmpty();
+  })()
+);
+```
+
+The `clear` method should remove all element from the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    test.clear();
+    return test.isEmpty();
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Stack() {
+  var collection = [];
+  this.print = function() {
+    console.log(collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Stack {
+  constructor() {
+    this.collection = [];
+  }
+  print() {
+    console.log(this.collection);
+  }
+  push(val) {
+    this.collection.push(val);
+  }
+  pop() {
+    return this.collection.pop();
+  }
+  peek() {
+    return this.collection[this.collection.length - 1];
+  }
+  isEmpty() {
+    return this.collection.length === 0;
+  }
+  clear() {
+    return (this.collection.length = 0);
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
new file mode 100644
index 0000000000..1586e0b2e8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -0,0 +1,151 @@
+---
+id: 587d8259367417b2b2512c84
+title: Create a Trie Search Tree
+challengeType: 1
+forumTopicId: 301634
+dashedName: 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.
+
+# --hints--
+
+The Trie should have an add method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The Trie should have a print method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+The Trie should have an isWord method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.isWord == 'function';
+  })()
+);
+```
+
+The print method should return all items added to the trie as strings in an array.
+
+```js
+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
+    );
+  })()
+);
+```
+
+The isWord method should return true only for words added to the trie and false for all other words.
+
+```js
+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')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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() {
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
new file mode 100644
index 0000000000..7e6822ef67
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -0,0 +1,43 @@
+---
+id: 587d825b367417b2b2512c8d
+title: Create an ES6 JavaScript Map
+challengeType: 1
+forumTopicId: 301635
+dashedName: 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: `.has(key)` returns true or false based on the presence of a key `.get(key)` returns the value associated with a key `.set(key, value)` sets a new key, value pair `.delete(key)` removes a key, value pair `.clear()` removes all key, value pairs `.entries()` returns an array of all the keys in insertion order `.values()` 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 `freeCodeCamp`, `Awesome!` to it.
+
+# --hints--
+
+The myMap object should exist.
+
+```js
+assert(typeof myMap === 'object');
+```
+
+myMap should contain the key value pair `freeCodeCamp`, `Awesome!`.
+
+```js
+assert(myMap.get('freeCodeCamp') === 'Awesome!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
new file mode 100644
index 0000000000..1727a24ed0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
@@ -0,0 +1,92 @@
+---
+id: 587d8254367417b2b2512c70
+title: Create and Add to Sets in ES6
+challengeType: 1
+forumTopicId: 301636
+dashedName: 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 `Set` 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:
+
+```js
+var set = new Set();
+```
+
+You can create a set with a value:
+
+```js
+var set = new Set(1);
+```
+
+You can create a set with an array:
+
+```js
+var set = new Set([1, 2, 3]);
+```
+
+Once you have created a set, you can add the values you wish using the `add` method:
+
+```js
+var set = new Set([1, 2, 3]);
+set.add([4, 5, 6]);
+```
+
+As a reminder, a set is a data structure that cannot contain duplicate values:
+
+```js
+var set = new Set([1, 2, 3, 1, 2, 3]);
+// set contains [1, 2, 3] only
+```
+
+# --instructions--
+
+For this exercise, return a set with the following values: `1, 2, 3, 'Taco', 'Cat', 'Awesome'`
+
+# --hints--
+
+Your `Set` should only contain the values `1, 2, 3, Taco, Cat, Awesome`.
+
+```js
+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')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet() {
+  var set = new Set([1, 2, 3, 3, 2, 1, 2, 3, 1]);
+  // Only change code below this line
+
+  // Only change code above this line
+  console.log(Array.from(set));
+  return set;
+}
+
+checkSet();
+```
+
+# --solutions--
+
+```js
+function checkSet(){var set = new Set([1,2,3,'Taco','Cat','Awesome']);
+return set;}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..43d58845d2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
@@ -0,0 +1,195 @@
+---
+id: 587d8258367417b2b2512c80
+title: Delete a Leaf Node in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301637
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..db24b0b29e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
@@ -0,0 +1,285 @@
+---
+id: 587d8258367417b2b2512c81
+title: Delete a Node with One Child in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301638
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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';
+  })()
+);
+```
+
+The `remove` method should remove nodes with one child.
+
+```js
+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';
+  })()
+);
+```
+
+Removing the root in a tree with two nodes should set the second to be the root.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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
+    // Only change code below this line
+  };
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..aab61e9c37
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
@@ -0,0 +1,399 @@
+---
+id: 587d8258367417b2b2512c82
+title: Delete a Node with Two Children in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301639
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove nodes with one child.
+
+```js
+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';
+  })()
+);
+```
+
+Removing the root in a tree with two nodes should set the second to be the root.
+
+```js
+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';
+  })()
+);
+```
+
+The `remove` method should remove nodes with two children while maintaining the binary search tree structure.
+
+```js
+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';
+  })()
+);
+```
+
+The root should be removable on a tree of three nodes.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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
+    // Only change code below this line
+  };
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/depth-first-search.md
new file mode 100644
index 0000000000..7d86343817
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -0,0 +1,208 @@
+---
+id: 587d825d367417b2b2512c96
+title: Depth-First Search
+challengeType: 1
+forumTopicId: 301640
+dashedName: 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.
+
+The animation below shows how the algorithm works. The algorithm starts with the top node and visits the nodes in the numbered order.
+
+<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966'>
+
+Notice how, unlike breadth-first search, every time a node is visited, it doesn't visit all of its neighbors. Instead, it first visits one of its neighbors and continues down that path until there are no more nodes to be visited on that path.
+
+To implement this algorithm, you'll want to use a stack. A stack is an array where the last element added is the first to be removed. This is also known as a <dfn>Last-In-First-Out</dfn> data structure. A stack is helpful in depth-first search algorithms because, as we add neighbors to the stack, we want to visit the most recently added neighbors first and remove them from the stack.
+
+A simple output of this algorithm is a list of nodes which are reachable from a given node. Therefore, you'll also want to keep track of the nodes you visit.
+
+# --instructions--
+
+Write a function `dfs()` that takes an undirected, adjacency matrix `graph` and a node label `root` as parameters. The node label will just be the numeric value of the node between `0` and `n - 1`, where `n` is the total number of nodes in the graph.
+
+Your function should output an array of all nodes reachable from `root`.
+
+# --hints--
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with `0`, `1`, `2`, and `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with four elements.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with one element.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `2` and `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with two elements.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with `0` and `1`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with two elements.
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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));
+```
+
+# --solutions--
+
+```js
+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;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
new file mode 100644
index 0000000000..b049822d4a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
@@ -0,0 +1,346 @@
+---
+id: 587d8257367417b2b2512c7d
+title: Find the Minimum and Maximum Height of a Binary Search Tree
+challengeType: 1
+forumTopicId: 301641
+dashedName: 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 `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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMinHeight`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMinHeight == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMaxHeight`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMaxHeight == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `isBalanced`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.isBalanced == 'function';
+  })()
+);
+```
+
+The `findMinHeight` method should return the minimum height of the tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMaxHeight` method should return the maximum height of the tree.
+
+```js
+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;
+  })()
+);
+```
+
+An empty tree should return a height of `-1`.
+
+```js
+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;
+  })()
+);
+```
+
+The `isBalanced` method should return `false` if the tree is an unbalanced binary search tree.
+
+```js
+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() === false;
+  })()
+);
+```
+
+The `isBalanced` method should return `true` if the tree is a balanced binary search tree.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    if (typeof test.isBalanced !== 'function') {
+      return false;
+    }
+    test.add(10);
+    test.add(3);
+    test.add(22);
+    test.add(1);
+    test.add(4);
+    test.add(17);
+    test.add(32);
+    return test.isBalanced() === true;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+  this.findMinHeight = function(root = this.root) {
+    // empty tree.
+    if (root === null) {
+      return -1;
+    }
+    // leaf node.
+    if (root.left === null && root.right === null) {
+      return 0;
+    }
+    if (root.left === null) {
+      return this.findMinHeight(root.right) + 1;
+    }
+    if (root.right === null) {
+      return this.findMinHeight(root.left) + 1;
+    }
+    const lHeight = this.findMinHeight(root.left);
+    const rHeight = this.findMinHeight(root.right);
+    return Math.min(lHeight, rHeight) + 1;
+  };
+  this.findMaxHeight = function(root = this.root) {
+    // empty tree.
+    if (root === null) {
+      return -1;
+    }
+    // leaf node.
+    if (root.left === null && root.right === null) {
+      return 0;
+    }
+    if (root.left === null) {
+      return this.findMaxHeight(root.right) + 1;
+    }
+    if (root.right === null) {
+      return this.findMaxHeight(root.left) + 1;
+    }
+    const lHeight = this.findMaxHeight(root.left);
+    const rHeight = this.findMaxHeight(root.right);
+    return Math.max(lHeight, rHeight) + 1;
+  };
+  this.isBalanced = function(root = this.root) {
+    if (root === null) {
+      return true;
+    }
+
+    if (root.left === null && root.right === null) {
+      return true;
+    }
+
+    if (root.left === null) {
+      return this.findMaxHeight(root.right) <= 0;
+    }
+
+    if (root.right === null) {
+      return this.findMaxHeight(root.left) <= 0;
+    }
+
+    const lHeight = this.findMaxHeight(root.left);
+    const rHeight = this.findMaxHeight(root.right);
+    if (Math.abs(lHeight - rHeight) > 1) {
+      return false;
+    }
+    return this.isBalanced(root.left) && this.isBalanced(root.right);
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..590820dd49
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
@@ -0,0 +1,369 @@
+---
+id: 587d8256367417b2b2512c7a
+title: Find the Minimum and Maximum Value in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301642
+dashedName: find-the-minimum-and-maximum-value-in-a-binary-search-tree
+---
+
+# --description--
+
+In this challenge you will define two methods, `findMin` and `findMax`. These methods should return the minimum and maximum value held in the binary search tree (don't worry about adding values to the tree for now, we have added some in the background). 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`.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMin`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMin == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMax`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMax == 'function';
+  })()
+);
+```
+
+The `findMin` method should return the minimum value in the binary search tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMax` method should return the maximum value in the binary search tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMin` and `findMax` methods should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.findMin = function() {
+    // Empty tree.
+    if (!this.root) {
+      return null;
+    }
+    let currentNode = this.root;
+    while (currentNode.left) {
+      currentNode = currentNode.left;
+    }
+    return currentNode.value;
+  };
+  this.findMax = function() {
+    // Empty tree.
+    if (!this.root) {
+      return null;
+    }
+    let currentNode = this.root;
+    while (currentNode.right) {
+      currentNode = currentNode.right;
+    }
+    return currentNode.value;
+  };
+  this.add = function(value) {
+    // Empty tree.
+    if (!this.root) {
+      this.root = new Node(value);
+      return undefined;
+    }
+    return this.addNode(this.root, value);
+  };
+  this.addNode = function(node, value) {
+    // Check if value already exists.
+    if (node.value === value) return null;
+    if (value < node.value) {
+      if (node.left) {
+        return this.addNode(node.left, value);
+      } else {
+        node.left = new Node(value);
+        return undefined;
+      }
+    } else {
+      if (node.right) {
+        return this.addNode(node.right, value);
+      } else {
+        node.right = new Node(value);
+        return undefined;
+      }
+    }
+  };
+  this.isPresent = function(value) {
+    if (!this.root) {
+      return null;
+    }
+    return this.isNodePresent(this.root, value);
+  };
+  this.isNodePresent = function(node, value) {
+    if (node.value === value) return true;
+    if (value < node.value) {
+      return node.left ? this.isNodePresent(node.left, value) : false;
+    } else {
+      return node.right ? this.isNodePresent(node.right, value) : false;
+    }
+    return false;
+  };
+  this.findMinHeight = function() {
+    if (!this.root) {
+      return -1;
+    }
+    let heights = {};
+    let height = 0;
+    this.traverseTree(this.root, height, heights);
+    return Math.min(...Object.keys(heights));
+  };
+  this.findMaxHeight = function() {
+    if (!this.root) {
+      return -1;
+    }
+    let heights = {};
+    let height = 0;
+    this.traverseTree(this.root, height, heights);
+    return Math.max(...Object.keys(heights));
+  };
+  this.traverseTree = function(node, height, heights) {
+    if (node.left === null && node.right === null) {
+      return (heights[height] = true);
+    }
+    if (node.left) {
+      this.traverseTree(node.left, height + 1, heights);
+    }
+    if (node.right) {
+      this.traverseTree(node.right, height + 1, heights);
+    }
+  };
+  this.isBalanced = function() {
+    return this.findMaxHeight() > this.findMinHeight() + 1;
+  };
+  // DFS tree traversal.
+  this.inorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      if (node.left) traverseInOrder(node.left);
+      result.push(node.value);
+      if (node.right) traverseInOrder(node.right);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  this.preorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      result.push(node.value);
+      if (node.left) traverseInOrder(node.left);
+      if (node.right) traverseInOrder(node.right);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  this.postorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      if (node.left) traverseInOrder(node.left);
+      if (node.right) traverseInOrder(node.right);
+      result.push(node.value);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  // BFS tree traversal.
+  this.levelOrder = function() {
+    if (!this.root) return null;
+    let queue = [this.root];
+    let result = [];
+    while (queue.length) {
+      let node = queue.shift();
+      result.push(node.value);
+      if (node.left) queue.push(node.left);
+      if (node.right) queue.push(node.right);
+    }
+    return result;
+  };
+  this.reverseLevelOrder = function() {
+    if (!this.root) return null;
+    let queue = [this.root];
+    let result = [];
+    while (queue.length) {
+      let node = queue.shift();
+      result.push(node.value);
+      if (node.right) queue.push(node.right);
+      if (node.left) queue.push(node.left);
+    }
+    return result;
+  };
+  // Delete a leaf node.
+}
+let bst = new BinarySearchTree();
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
new file mode 100644
index 0000000000..d3b5a44d78
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -0,0 +1,144 @@
+---
+id: 587d825b367417b2b2512c8c
+title: Implement Heap Sort with a Min Heap
+challengeType: 1
+forumTopicId: 301643
+dashedName: 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.
+
+# --hints--
+
+The MinHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MinHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MinHeap should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+MinHeap should have a method called sort.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.sort == 'function';
+  })()
+);
+```
+
+The sort method should return an array containing all items added to the min heap in sorted order.
+
+```js
+assert(
+  (() => {
+    if (typeof MinHeap === 'undefined') {
+      return false;
+    }
+
+    const heap = new MinHeap();
+    const arr = createRandomArray(25);
+
+    for (let i of arr) {
+      heap.insert(i);
+    }
+
+    const result = heap.sort();
+    arr.sort((a, b) => a - b);
+
+    for (let i = 0; i < arr.length; i++) {
+      if (arr[i] !== result[i]) {
+        return false;
+      }
+    }
+    return true;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+// Generate a randomly filled array
+function createRandomArray(size = 5){
+  let a = new Array(size);
+  for(let i = 0; i < size; i++)
+    a[i] = Math.floor(Math.random() * 100);
+  
+  return a;
+}
+const array = createRandomArray(25);
+
+var MinHeap = function() {
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/incidence-matrix.md
new file mode 100644
index 0000000000..068b629cdd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -0,0 +1,110 @@
+---
+id: 587d8256367417b2b2512c79
+title: Incidence Matrix
+challengeType: 1
+forumTopicId: 301644
+dashedName: 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 `incidence matrix` 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.
+
+```js
+var incMat = [
+  [0, 1, 1, 1],
+  [1, 1, 0, 0],
+  [1, 0, 0, 1],
+  [0, 0, 1, 0]
+];
+```
+
+To make a directed graph, use `-1` for an edge leaving a particular node and `1` for an edge entering a node.
+
+```js
+var incMatDirected = [
+  [ 0, -1,  1, -1],
+  [-1,  1,  0,  0],
+  [ 1,  0,  0,  1],
+  [ 0,  0, -1,  0]
+];
+```
+
+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 (`0` or `1`). You can have different weights depending on your application. A different weight is represented as numbers greater than 1.
+
+# --instructions--
+
+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 the 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. The fourth edge is between the fourth and second node. All edge weights are one and the edge order matters.
+
+# --hints--
+
+`incMatUndirected` should only contain five nodes.
+
+```js
+assert(
+  incMatUndirected.length === 5 &&
+    incMatUndirected
+      .map(function (x) {
+        return x.length === 4;
+      })
+      .reduce(function (a, b) {
+        return a && b;
+      })
+);
+```
+
+There should be a first edge between the first and second node.
+
+```js
+assert(incMatUndirected[0][0] === 1 && incMatUndirected[1][0] === 1);
+```
+
+There should be a second edge between the second and third node.
+
+```js
+assert(incMatUndirected[1][1] === 1 && incMatUndirected[2][1] === 1);
+```
+
+There should be a third edge between the third and fifth node.
+
+```js
+assert(incMatUndirected[2][2] === 1 && incMatUndirected[4][2] === 1);
+```
+
+There should be a fourth edge between the second and fourth node.
+
+```js
+assert(incMatUndirected[1][3] === 1 && incMatUndirected[3][3] === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var incMatUndirected = [
+
+];
+```
+
+# --solutions--
+
+```js
+var incMatUndirected = [[1, 0, 0, 0],[1, 1, 0, 1],[0, 1, 1, 0],[0, 0, 0, 1],[0, 0, 1, 0]];
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
new file mode 100644
index 0000000000..74e6b693f7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -0,0 +1,153 @@
+---
+id: 587d825a367417b2b2512c8a
+title: Insert an Element into a Max Heap
+challengeType: 1
+forumTopicId: 301703
+dashedName: 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 min heap:
+
+```js
+[ 6, 22, 30, 37, 63, 48, 42, 76 ]
+```
+
+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: `Math.floor((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:
+
+```js
+[ null, 6, 22, 30, 37, 63, 48, 42, 76 ]
+```
+
+An element's left child: `i * 2`
+
+An element's right child: `i * 2 + 1`
+
+An element's parent: `Math.floor(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--
+
+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:
+
+<ol>
+  <li>Add the new element to the end of the array.</li>
+  <li>If the element is larger than its parent, switch them.</li>
+  <li>Continue switching until the new element is either smaller than its parent or you reach the root of the tree.</li>
+</ol>
+
+Finally, add a `print` method which returns an array of all the items that have been added to the heap.
+
+# --hints--
+
+The MaxHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MaxHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called print.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+The insert method should add elements according to the max heap property.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var MaxHeap = function() {
+  // Only change code below this line
+    
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+var MaxHeap = function() {
+    // Only change code below this line
+    this.heap = [null];
+    this.insert = (ele) => {
+        var index = this.heap.length;
+        var arr = [...this.heap];
+        arr.push(ele);
+        while (ele > arr[Math.floor(index / 2)] && index > 1) {
+            arr[index] = arr[Math.floor(index / 2)];
+            arr[Math.floor(index / 2)] = ele;
+            index = arr[Math.floor(index / 2)];
+        }
+        this.heap = arr;
+    }
+    this.print = () => {
+        return this.heap.slice(1);
+    }
+    // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/invert-a-binary-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
new file mode 100644
index 0000000000..bb2226fac8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
@@ -0,0 +1,192 @@
+---
+id: 587d8259367417b2b2512c83
+title: Invert a Binary Tree
+challengeType: 1
+forumTopicId: 301704
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `invert`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.invert == 'function';
+  })()
+);
+```
+
+The `invert` method should correctly invert the tree structure.
+
+```js
+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';
+  })()
+);
+```
+
+Inverting an empty tree should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        };
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        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;
+      };
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  this.invert = function(node = this.root) {
+    if (node) {
+      const temp = node.left;
+      node.left = node.right;
+      node.right = temp;
+      this.invert(node.left);
+      this.invert(node.right);
+    }
+    return node;
+  }
+    // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
new file mode 100644
index 0000000000..19ea0d3c26
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
@@ -0,0 +1,71 @@
+---
+id: 587d8250367417b2b2512c5e
+title: Learn how a Stack Works
+challengeType: 1
+forumTopicId: 301705
+dashedName: 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 `push()` method that pushes JavaScript objects at the top of the stack; and `pop()` method, that removes the JavaScript object that's at the top of the stack at the current moment.
+
+# --instructions--
+
+Here we have a stack of homework assignments represented as an array: `"BIO12"` is at the base, and `"PSY44"` is at the top of the stack.
+
+Modify the given array and treat it like a `stack` using the JavaScript methods mentioned above. Remove the top element `"PSY44"` from the stack. Then add `"CS50"` to be the new top element of the stack.
+
+# --hints--
+
+`homeworkStack` should only contain 4 elements.
+
+```js
+assert(homeworkStack.length === 4);
+```
+
+The last element in `homeworkStack` should be `"CS50"`.
+
+```js
+assert(homeworkStack[3] === 'CS50');
+```
+
+`homeworkStack` should not contain `"PSY44"`.
+
+```js
+assert(homeworkStack.indexOf('PSY44') === -1);
+```
+
+The initial declaration of the `homeworkStack` should not be changed.
+
+```js
+assert(
+  code.match(/=/g).length === 1 &&
+    /homeworkStack\s*=\s*\["BIO12"\s*,\s*"HIS80"\s*,\s*"MAT122"\s*,\s*"PSY44"\]/.test(
+      code
+    )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var homeworkStack = ["BIO12","HIS80","MAT122","PSY44"];
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
new file mode 100644
index 0000000000..8c40ae5161
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
@@ -0,0 +1,219 @@
+---
+id: 587d8254367417b2b2512c6e
+title: Perform a Difference on Two Sets of Data
+challengeType: 1
+forumTopicId: 301706
+dashedName: 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 `Set` data structure called `difference`. 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 `Set` as an argument and return the `difference` of the two sets.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the difference of setA and setB is: `setA.difference(setB) = ['c']`.
+
+# --hints--
+
+Your `Set` class should have a `difference` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.difference === 'function';
+  })()
+);
+```
+
+Your `difference` method should return the proper collection.
+
+```js
+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 &&
+      DeepEqual(differenceSetAB.values(), ['a', 'b'])
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // This is our intersection method
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
new file mode 100644
index 0000000000..71d0bc063e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -0,0 +1,302 @@
+---
+id: 587d8254367417b2b2512c6f
+title: Perform a Subset Check on Two Sets of Data
+challengeType: 1
+forumTopicId: 301707
+dashedName: 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 `Set` data structure called `isSubsetOf`. This will compare the first set against the second, and if the first set is fully contained within the second, it will return `true`.
+
+For example, if `setA = ['a','b']` and `setB = ['a','b','c','d']`, then `setA` is a subset of `setB`, so `setA.isSubsetOf(setB)` should return `true`.
+
+# --hints--
+
+Your `Set` class should have a `isSubsetOf` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.isSubsetOf === 'function';
+  })()
+);
+```
+
+The first Set() should be contained in the second Set
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === false;
+  })()
+);
+```
+
+`[].isSubsetOf([])` should return `true`
+
+```js
+assert(
+  (function () {
+    var setA = new Set();
+    var setB = new Set();
+    var aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`
+
+```js
+assert(
+  (function () {
+    var setA = new Set();
+    var setB = new Set();
+    setA.add('a');
+    setA.add('b');
+    setB.add('c');
+    setB.add('d');
+    var aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === false;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // This is our intersection method
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }  
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  isSubsetOf(set) {
+    for(const value of this.values()){
+      if(!set.dictionary[value]) return false;
+    }
+    return true
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
new file mode 100644
index 0000000000..04ecfb767f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -0,0 +1,155 @@
+---
+id: 587d8253367417b2b2512c6c
+title: Perform a Union on Two Sets
+challengeType: 1
+forumTopicId: 301708
+dashedName: 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 `Set` data structure called `union`. This method should take another `Set` as an argument and return the `union` of the two sets, excluding any duplicate values.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the union of setA and setB is: `setA.union(setB) = ['a', 'b', 'c', 'd', 'e']`.
+
+# --hints--
+
+Your `Set` class should have a `union` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.union === 'function';
+  })()
+);
+```
+
+The union of a Set containing values ["a", "b", "c"] and a Set containing values ["c", "d"] should return a new Set containing values ["a", "b", "c", "d"].
+
+```js
+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
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.values(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
new file mode 100644
index 0000000000..e2bef36377
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
@@ -0,0 +1,184 @@
+---
+id: 587d8253367417b2b2512c6d
+title: Perform an Intersection on Two Sets of Data
+challengeType: 1
+forumTopicId: 301709
+dashedName: 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 `Set` data structure called `intersection`. An intersection of sets represents all values that are common to two or more sets. This method should take another `Set` as an argument and return the `intersection` of the two sets.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the intersection of setA and setB is: `setA.intersection(setB) = ['a', 'b']`.
+
+# --hints--
+
+Your `Set` class should have a `intersection` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.intersection === 'function';
+  })()
+);
+```
+
+The proper collection should be returned.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
new file mode 100644
index 0000000000..858073f211
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -0,0 +1,143 @@
+---
+id: 587d825b367417b2b2512c8b
+title: Remove an Element from a Max Heap
+challengeType: 1
+forumTopicId: 301710
+dashedName: 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:
+
+<ol>
+  <li>Move the last element in the heap into the root position.</li>
+  <li>If either child of the root is greater than it, swap the root with the child of greater value.</li>
+  <li>Continue swapping until the parent is greater than both children or you reach the last level in the tree.</li>
+</ol>
+
+# --instructions--
+
+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.
+
+# --hints--
+
+The MaxHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MaxHeap should have a method called print.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+The remove method should remove the greatest element from the max heap while maintaining the max heap property.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var MaxHeap = function() {
+  this.heap = [null];
+  this.insert = (ele) => {
+    var index = this.heap.length;
+    var arr = [...this.heap];
+    arr.push(ele);
+    while (ele > arr[Math.floor(index / 2)] && index > 1) {
+      arr[index] = arr[Math.floor(index / 2)];
+      arr[Math.floor(index / 2)] = ele;
+      index = arr[Math.floor(index / 2)];
+    }
+    this.heap = arr;
+  }
+  this.print = () => {
+    return this.heap.slice(1);
+  }
+  // Only change code below this line
+
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
new file mode 100644
index 0000000000..9a8e59f77f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
@@ -0,0 +1,242 @@
+---
+id: 587d8251367417b2b2512c65
+title: Remove Elements from a Linked List by Index
+challengeType: 1
+forumTopicId: 301711
+dashedName: 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 `removeAt` method that removes the `element` at a given `index`. The method should be called `removeAt(index)`. To remove an `element` at a certain `index`, 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 `head` of our list, we start with a `currentIndex` variable that starts at `0`. The `currentIndex` should increment by one for each node we pass.
+
+Just like our `remove(element)` method, which [we covered in a previous lesson](/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list), 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.
+
+# --instructions--
+
+Write a `removeAt(index)` method that removes and returns a node at a given `index`. The method should return `null` if the given `index` is either negative, or greater than or equal to the `length` of the linked list.
+
+**Note:** Remember to keep count of the `currentIndex`.
+
+# --hints--
+
+Your `LinkedList` class should have a `removeAt` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.removeAt === 'function';
+  })()
+);
+```
+
+Your `removeAt` method should reduce the `length` of the linked list by one.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.removeAt(1);
+    return test.size() === 2;
+  })()
+);
+```
+
+Your `removeAt` method should remove the element at the specified index from the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.add('bird');
+    test.removeAt(1);
+    return (
+      JSON.stringify(test.head()) ===
+      '{"element":"cat","next":{"element":"kitten","next":{"element":"bird","next":null}}}'
+    );
+  })()
+);
+```
+
+When only one element is present in the linked list, your `removeAt` method should remove and return the element at specified index, and reduce the length of the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    var removedItem = test.removeAt(0);
+    return test.head() === null && test.size() === 0 && removedItem === 'cat';
+  })()
+);
+```
+
+Your `removeAt` method should return the element of the removed node.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.removeAt(1) === 'dog';
+  })()
+);
+```
+
+Your `removeAt` method should return `null` and the linked list should not change if the given index is less than `0`.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    var removedItem = test.removeAt(-1);
+    return (
+      removedItem === null &&
+      JSON.stringify(test.head()) ===
+        '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+Your `removeAt` method should return `null` and the linked list should not change if the given index is greater than or equal to the `length` of the list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    var removedItem = test.removeAt(3);
+    return (
+      removedItem === null &&
+      JSON.stringify(test.head()) ===
+        '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var currentNode = head;
+
+      while(currentNode.next){
+        currentNode  = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  this.removeAt = function (index) {
+    var currentNode = head;
+    var previous = head;
+    var count = 0;
+    if (index >= length || index < 0) {
+      return null;
+    }
+    if (index === 0) {
+      var removed = head.element;
+      head = currentNode.next;
+    } else {
+      while (count < index) {
+        previous = currentNode;
+        currentNode = currentNode.next;
+        count++;
+      }
+      var removed = previous.next.element;
+      previous.next = currentNode.next;
+    }
+    length--;
+    return removed;
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
new file mode 100644
index 0000000000..871cf51e9d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
@@ -0,0 +1,210 @@
+---
+id: 587d8251367417b2b2512c63
+title: Remove Elements from a Linked List
+challengeType: 1
+forumTopicId: 301712
+dashedName: remove-elements-from-a-linked-list
+---
+
+# --description--
+
+The next important method that any implementation of a linked list will need is a `remove` 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 `next` 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 `next` property to the middle element's `next` 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 `head` element, we reassign the `head` to the second node of the linked list.
+
+# --instructions--
+
+Write a `remove` method that takes an element and removes it from the linked list.
+
+**Note:** The `length` of the list should decrease by one every time an element is removed from the linked list.
+
+# --hints--
+
+Your `LinkedList` class should have a `remove` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+Your `remove` method should reassign `head` to the second node when the first node is removed.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.remove('cat');
+    return test.head().element === 'dog';
+  })()
+);
+```
+
+Your `remove` method should decrease the `length` of the linked list by one for every node removed.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('hamster');
+    test.remove('cat');
+    test.remove('fish');
+    return test.size() === 2;
+  })()
+);
+```
+
+Your `remove` method should reassign the reference of the previous node of the removed node to the removed node's `next` reference.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('snake');
+    test.add('kitten');
+    test.remove('snake');
+    return test.head().next.next.element === 'kitten';
+  })()
+);
+```
+
+Your `remove` method should not change the linked list if the element does not exist in the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.remove('elephant');
+    return (
+      JSON.stringify(test.head()) ===
+      '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var 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
+  };
+}
+```
+
+# --solutions--
+
+```js
+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 {
+        var currentNode = head;
+
+        while(currentNode.next){
+            currentNode  = currentNode.next;
+        }
+
+        currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  this.remove = function(element){
+    if (head === null) {
+      return;
+    }
+    var previous;
+    var currentNode = head;
+
+    while (currentNode.next !== null && currentNode.element !== element) {
+      previous = currentNode;
+      currentNode = currentNode.next;
+    }
+    
+    if (currentNode.next === null && currentNode.element !== element) {
+      return;
+    }
+    else if (previous) {
+      previous.next = currentNode.next;
+    } else {
+      head = currentNode.next;
+    }
+
+    length--;
+  };
+} 
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
new file mode 100644
index 0000000000..b676bb7eeb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
@@ -0,0 +1,64 @@
+---
+id: 587d8254367417b2b2512c71
+title: Remove items from a set in ES6
+challengeType: 1
+forumTopicId: 301713
+dashedName: remove-items-from-a-set-in-es6
+---
+
+# --description--
+
+Let's practice removing items from an ES6 Set using the `delete` method.
+
+First, create an ES6 Set:
+
+```js
+var set = new Set([1,2,3]);
+```
+
+Now remove an item from your Set with the `delete` method.
+
+```js
+set.delete(1);
+console.log([...set]) // should return [ 2, 3 ]
+```
+
+# --instructions--
+
+Now, create a set with the integers 1, 2, 3, 4, & 5.
+
+Remove the values 2 and 5, and then return the set.
+
+# --hints--
+
+Your Set should contain the values 1, 3, & 4
+
+```js
+assert(
+  (function () {
+    var test = checkSet();
+    return test.has(1) && test.has(3) && test.has(4) && test.size === 3;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(){
+   var set = null;
+   return set;
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(){
+var set = new Set([1,2,3,4,5]);
+set.delete(2);
+set.delete(5);
+return set;}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
new file mode 100644
index 0000000000..18293576f2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -0,0 +1,205 @@
+---
+id: 587d825a367417b2b2512c88
+title: Reverse a Doubly Linked List
+challengeType: 1
+forumTopicId: 301714
+dashedName: 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.
+
+# --hints--
+
+The DoublyLinkedList data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called reverse.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.reverse == undefined) {
+      return false;
+    }
+    return typeof test.reverse == 'function';
+  })()
+);
+```
+
+Reversing an empty list should return null.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return test.reverse() == null;
+  })()
+);
+```
+
+The reverse method should reverse the list.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    test.add(58);
+    test.add(61);
+    test.add(32);
+    test.add(95);
+    test.add(41);
+    test.reverse();
+    return test.print().join('') == '4195326158';
+  })()
+);
+```
+
+The next and previous references should be correctly maintained when a list is reversed.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    test.add(11);
+    test.add(22);
+    test.add(33);
+    test.add(44);
+    test.add(55);
+    test.reverse();
+    return test.printReverse().join('') == '1122334455';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+DoublyLinkedList.prototype = Object.assign(
+  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;
+      };
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+var Node = function(data, prev) {
+  this.data = data;
+  this.prev = prev;
+  this.next = null;
+};
+var DoublyLinkedList = function() {
+  this.head = null;
+  this.tail = null;
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+  var Node = function(data, prev) {
+    this.data = data;
+    this.prev = prev;
+    this.next = null;
+  };
+  var DoublyLinkedList = function() {
+    this.head = null;
+    this.tail = null;
+
+    this.reverse = function() {
+      if (!this.head || !this.head.next) {
+        return this.head
+      }
+
+      let tail;
+      let temp;
+      let current = this.head;
+      while(current !== null) {
+        if(!tail) tail = current;
+        temp = current.prev;
+        current.prev = current.next;
+        current.next = temp;
+        current = current.prev;
+      }
+
+      this.head = temp.prev;
+      this.tail = tail
+    }
+  };
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
new file mode 100644
index 0000000000..03361689fe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -0,0 +1,293 @@
+---
+id: 587d8251367417b2b2512c64
+title: Search within a Linked List
+challengeType: 1
+forumTopicId: 301715
+dashedName: 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 `Stack` and `Queue` 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 `indexOf` method that takes an `element` as an argument, and returns that element's `index` in the linked list. If the element is not found in the linked list, return `-1`.
+
+Let's also implement a method that does the opposite: an `elementAt` method that takes an `index` as an argument and returns the `element` at the given `index`. If no `element` is found, return `undefined`.
+
+# --instructions--
+
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index.`
+
+# --hints--
+
+Your `LinkedList` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `isEmpty` method should return `false` when there is at least one element in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.isEmpty() === false;
+  })()
+);
+```
+
+Your `isEmpty` method should return `true` when there are no elements in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return test.isEmpty() === true;
+  })()
+);
+```
+
+Your `LinkedList` class should have an `indexOf` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.indexOf === 'function';
+  })()
+);
+```
+
+Your `indexOf` method should return the index of a given element found in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.indexOf('cat') === 0;
+  })()
+);
+```
+
+Your `indexOf` method should return `-1` if the given element is not found in linked list
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.indexOf('pony') === -1;
+  })()
+);
+```
+
+Your `LinkedList` class should have an `elementAt` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.elementAt === 'function';
+  })()
+);
+```
+
+Your `elementAt` method should return the element found at a given index in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.elementAt(1) === 'dog';
+  })()
+);
+```
+
+Your `elementAt` method should return `undefined` if the given element is not found at a given index in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.elementAt(5) === undefined;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var 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
+}
+```
+
+# --solutions--
+
+```js
+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 {
+        var 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 --;
+  };
+
+  this.indexOf = function(element) {
+    if (head === null) return -1
+
+    let current = head;
+    let index = 0;
+
+    while (current.element !== element && current.next !== null) {
+      current = current.next;
+      index++
+    }
+
+    if (current.element !== element && current.next === null) {
+      return -1
+    }
+
+    return index;
+  }
+
+  this.elementAt = function(index) {
+    if (head === null) return undefined;
+
+    let current = head;
+    let currentIndex = 0;
+
+    while (currentIndex !== index && current.next !== null) {
+      current = current.next;
+      currentIndex++
+    }
+
+    if (currentIndex !== index && current.next === null) {
+      return undefined;
+    }
+
+    return current.element;
+  }
+
+  this.isEmpty = function() {
+    return length === 0;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/typed-arrays.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/typed-arrays.md
new file mode 100644
index 0000000000..b992af729a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/typed-arrays.md
@@ -0,0 +1,94 @@
+---
+id: 587d8253367417b2b2512c6a
+title: Typed Arrays
+challengeType: 1
+forumTopicId: 301716
+dashedName: typed-arrays
+---
+
+# --description--
+
+Arrays are JavaScript objects that can hold a lot of different elements.
+
+```js
+var complexArr = [1, 5, "2", "Word", {"name": "James"}];
+```
+
+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'><tbody><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></tbody></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 `Int16Array`.
+
+```js
+var i8 = new Int16Array(3);
+console.log(i8);
+// Returns [0, 0, 0]
+```
+
+You can also create a <dfn>buffer</dfn> to assign how much data (in bytes) you want the array to take up. **Note**  
+To create typed arrays using buffers, you need to assign the number of bytes to be a multiple of the bytes listed above.
+
+```js
+// Create same Int16Array array differently
+var byteSize = 6; // Needs to be multiple of 2
+var buffer = new ArrayBuffer(byteSize);
+var i8View = new Int16Array(buffer);
+buffer.byteLength; // Returns 6
+i8View.byteLength; // Returns 6
+console.log(i8View); // Returns [0, 0, 0]
+```
+
+<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>.
+
+```js
+i8View[0] = 42;
+console.log(i8View); // Returns [42, 0, 0]
+```
+
+**Note**  
+Typed arrays do not have some of the methods traditional arrays have such as `.pop()` or `.push()`. Typed arrays also fail `Array.isArray()` that checks if something is an array. Although simpler, this can be an advantage for less-sophisticated JavaScript engines to implement them.
+
+# --instructions--
+
+First create a `buffer` that is 64-bytes. Then create a `Int32Array` typed array with a view of it called `i32View`.
+
+# --hints--
+
+Your `buffer` should be 64 bytes large.
+
+```js
+assert(buffer.byteLength === 64);
+```
+
+Your `i32View` view of your buffer should be 64 bytes large.
+
+```js
+assert(i32View.byteLength === 64);
+```
+
+Your `i32View` view of your buffer should be 16 elements long.
+
+```js
+assert(i32View.length === 16);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var buffer;
+var i32View;
+```
+
+# --solutions--
+
+```js
+var buffer = new ArrayBuffer(64);
+var i32View = new Int32Array(buffer);
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
new file mode 100644
index 0000000000..55d4ac67de
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
@@ -0,0 +1,73 @@
+---
+id: 587d8255367417b2b2512c72
+title: Use .has and .size on an ES6 Set
+challengeType: 1
+forumTopicId: 301717
+dashedName: 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
+
+```js
+var set = new Set([1,2,3]);
+```
+
+The .has method will check if the value is contained within the set.
+
+```js
+var hasTwo = set.has(2);
+```
+
+The .size method will return an integer representing the size of the Set
+
+```js
+var howBig = set.size;
+```
+
+# --instructions--
+
+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.
+
+# --hints--
+
+`checkSet([4, 5, 6], 3)` should return [ false, 3 ]
+
+```js
+assert(
+  (function () {
+    var test = checkSet([4, 5, 6], 3);
+    return DeepEqual(test, [false, 3]);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(arrToBeSet, checkValue){
+
+   // Only change code below this line
+
+   // Only change code above this line
+
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(arrToBeSet, checkValue){
+var set = new Set(arrToBeSet);
+var result = [
+set.has(checkValue),
+set.size
+];
+return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..d048a3a43c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -0,0 +1,261 @@
+---
+id: 587d8258367417b2b2512c7f
+title: Use Breadth First Search in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301718
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `levelOrder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.levelOrder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `reverseLevelOrder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.reverseLevelOrder == 'function';
+  })()
+);
+```
+
+The `levelOrder` method should return an array of the tree node values explored in level order.
+
+```js
+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';
+  })()
+);
+```
+
+The `reverseLevelOrder` method should return an array of the tree node values explored in reverse level order.
+
+```js
+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';
+  })()
+);
+```
+
+The `levelOrder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `reverseLevelOrder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  this.levelOrder = (root = this.root) => {
+    if(!root) return null;
+    let queue = [root];
+    let results = [];
+    while(queue.length > 0) {
+      let node = queue.shift();
+      results.push(node.value);
+      if(node.left) queue.push(node.left);
+      if(node.right) queue.push(node.right);
+    }
+    return results;
+  }
+
+  this.reverseLevelOrder = (root = this.root) => {
+    if(!root) return null;
+    let queue = [root];
+    let results = [] ;
+    while ( queue.length > 0) {
+      let node = queue.shift();
+      results.push(node.value);
+      if(node.right) queue.push(node.right);
+      if(node.left ) queue.push(node.left);
+    }
+    return results;
+  }
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..8dc78340bf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
@@ -0,0 +1,328 @@
+---
+id: 587d8257367417b2b2512c7e
+title: Use Depth First Search in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301719
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `inorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.inorder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `preorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.preorder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `postorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.postorder == 'function';
+  })()
+);
+```
+
+The `inorder` method should return an array of the node values that result from an inorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `preorder` method should return an array of the node values that result from a preorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `postorder` method should return an array of the node values that result from a postorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `inorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `preorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `postorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.result = [];
+
+  this.inorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    if (node.left) this.inorder(node.left);
+    this.result.push(node.value);
+    if (node.right) this.inorder(node.right);
+    return this.result;
+  };
+  this.preorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    this.result.push(node.value);
+    if (node.left) this.preorder(node.left);
+    if (node.right) this.preorder(node.right);
+    return this.result;
+  };
+  this.postorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    if (node.left) this.postorder(node.left);
+    if (node.right) this.postorder(node.right);
+    this.result.push(node.value);
+
+    return this.result;
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
new file mode 100644
index 0000000000..79ba7313b8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
@@ -0,0 +1,59 @@
+---
+id: 587d8255367417b2b2512c73
+title: Use Spread and Notes for ES5 Set() Integration
+challengeType: 1
+forumTopicId: 301720
+dashedName: use-spread-and-notes-for-es5-set-integration
+---
+
+# --description--
+
+Do you remember the ES6 spread operator `...`?
+
+`...` can take iterable objects in ES6 and turn them into arrays.
+
+Let's create a Set, and check out the spread function.
+
+```js
+var set = new Set([1,2,3]);
+var setToArr = [...set]
+console.log(setToArr) // returns [ 1, 2, 3 ]
+```
+
+# --instructions--
+
+In this exercise we will pass a set object to the `checkSet` function. It should return an array containing the values of the Set.
+
+Now you've successfully learned how to use the ES6 `Set()` object, good job!
+
+# --hints--
+
+`checkSet(new Set([1,2,3,4,5,6,7])` should return `[1, 2, 3, 4, 5, 6, 7]`.
+
+```js
+assert(
+  (function () {
+    var test = checkSet(new Set([1, 2, 3, 4, 5, 6, 7]));
+    return DeepEqual(test, [1, 2, 3, 4, 5, 6, 7]);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(set){
+   // Only change code below this line
+
+   // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(set){
+return [...set];}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
new file mode 100644
index 0000000000..c746995d5d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
@@ -0,0 +1,55 @@
+---
+id: 587d8251367417b2b2512c61
+title: Work with Nodes in a Linked List
+challengeType: 1
+forumTopicId: 301721
+dashedName: 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 `element` itself, and a reference to the next `node`.
+
+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.
+
+# --instructions--
+
+In our code editor, we've created two nodes, `Kitten` and `Puppy`, and we've manually connected the `Kitten` node to the `Puppy` node.
+
+Create a `Cat` and `Dog` node and manually add them to the line.
+
+# --hints--
+
+Your `Puppy` node should have a reference to a `Cat` node.
+
+```js
+assert(Puppy.next.element === 'Cat');
+```
+
+Your `Cat` node should have a reference to a `Dog` node.
+
+```js
+assert(Cat.next.element === 'Dog');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var Node = function(element) {
+  this.element = element;
+  this.next = null;
+};
+var Kitten = new Node('Kitten');
+var Puppy = new Node('Puppy');
+
+Kitten.next = Puppy;
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
new file mode 100644
index 0000000000..ff256d48a4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
@@ -0,0 +1,73 @@
+---
+id: 5900f36e1000cf542c50fe80
+title: 'Problem 1: Multiples of 3 and 5'
+challengeType: 5
+forumTopicId: 301722
+dashedName: problem-1-multiples-of-3-and-5
+---
+
+# --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 `number`.
+
+# --hints--
+
+`multiplesOf3and5(10)` should return a number.
+
+```js
+assert(typeof multiplesOf3and5(10) === 'number');
+```
+
+`multiplesOf3and5(49)` should return 543.
+
+```js
+assert.strictEqual(multiplesOf3and5(49), 543);
+```
+
+`multiplesOf3and5(1000)` should return 233168.
+
+```js
+assert.strictEqual(multiplesOf3and5(1000), 233168);
+```
+
+`multiplesOf3and5(8456)` should return 16687353.
+
+```js
+assert.strictEqual(multiplesOf3and5(8456), 16687353);
+```
+
+`multiplesOf3and5(19564)` should return 89301183.
+
+```js
+assert.strictEqual(multiplesOf3and5(19564), 89301183);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function multiplesOf3and5(number) {
+
+  return true;
+}
+
+multiplesOf3and5(1000);
+```
+
+# --solutions--
+
+```js
+const multiplesOf3and5 = (number) => {
+  var total = 0;
+
+  for(var i = 0; i < number; i++) {
+    if(i % 3 == 0 || i % 5 == 0) {
+      total += i;
+    }
+  }
+  return total;
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
new file mode 100644
index 0000000000..d1194e13f3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -0,0 +1,81 @@
+---
+id: 5900f3761000cf542c50fe89
+title: 'Problem 10: Summation of primes'
+challengeType: 5
+forumTopicId: 301723
+dashedName: problem-10-summation-of-primes
+---
+
+# --description--
+
+The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
+
+Find the sum of all the primes below `n`.
+
+# --hints--
+
+`primeSummation(17)` should return a number.
+
+```js
+assert(typeof primeSummation(17) === 'number');
+```
+
+`primeSummation(17)` should return 41.
+
+```js
+assert.strictEqual(primeSummation(17), 41);
+```
+
+`primeSummation(2001)` should return 277050.
+
+```js
+assert.strictEqual(primeSummation(2001), 277050);
+```
+
+`primeSummation(140759)` should return 873608362.
+
+```js
+assert.strictEqual(primeSummation(140759), 873608362);
+```
+
+`primeSummation(2000000)` should return 142913828922.
+
+```js
+assert.strictEqual(primeSummation(2000000), 142913828922);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeSummation(n) {
+
+  return true;
+}
+
+primeSummation(2000000);
+```
+
+# --solutions--
+
+```js
+function primeSummation(n) {
+  if (n < 3) { return 0 };
+  let nums = [0, 0, 2];
+  for (let i = 3; i < n; i += 2){
+    nums.push(i);
+    nums.push(0);
+  }
+  let sum = 2;
+  for (let i = 3; i < n; i += 2){
+    if (nums[i] !== 0){
+      sum += nums[i];
+      for (let j = i*i; j < n; j += i){
+        nums[j] = 0;
+      }
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
new file mode 100644
index 0000000000..1d44675e28
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
@@ -0,0 +1,87 @@
+---
+id: 5900f3d01000cf542c50fee3
+title: 'Problem 100: Arranged probability'
+challengeType: 5
+forumTopicId: 301724
+dashedName: problem-100-arranged-probability
+---
+
+# --description--
+
+If a box contains twenty-one colored 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)} = \frac{15}{21}×\frac{14}{20} = \frac{1}{2}$$
+
+The next such arrangement, for which there is exactly a 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 `limit` discs in total, determine the number of blue discs that the box would contain.
+
+# --hints--
+
+`arrangedProbability(20)` should return a number.
+
+```js
+assert(typeof arrangedProbability(10) === 'number');
+```
+
+`arrangedProbability(20)` should return `15`.
+
+```js
+assert.strictEqual(arrangedProbability(20), 15);
+```
+
+`arrangedProbability(100)` should return `85`.
+
+```js
+assert.strictEqual(arrangedProbability(100), 85);
+```
+
+`arrangedProbability(100000)` should return `97513`.
+
+```js
+assert.strictEqual(arrangedProbability(100000), 97513);
+```
+
+`arrangedProbability(1000000000)` should return `3822685023`.
+
+```js
+assert.strictEqual(arrangedProbability(1000000000), 3822685023);
+```
+
+`arrangedProbability(1000000000000)` should return `756872327473`.
+
+```js
+assert.strictEqual(arrangedProbability(1000000000000), 756872327473);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function arrangedProbability(limit) {
+
+  return true;
+}
+
+arrangedProbability(20);
+```
+
+# --solutions--
+
+```js
+function arrangedProbability(limit) {
+  // Based on https://www.mathblog.dk/project-euler-100-blue-discs-two-blue/
+  let blue = 15;
+  let discs = 21;
+
+  while (discs < limit) {
+    const nextBlue = 3 * blue + 2 * discs - 2;
+    const nextDiscs = 4 * blue + 3 * discs - 3;
+
+    blue = nextBlue;
+    discs = nextDiscs;
+  }
+  return blue;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
new file mode 100644
index 0000000000..7573114475
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -0,0 +1,52 @@
+---
+id: 5900f3d21000cf542c50fee4
+title: 'Problem 101: Optimum polynomial'
+challengeType: 5
+forumTopicId: 301725
+dashedName: problem-101-optimum-polynomial
+---
+
+# --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.
+
+# --hints--
+
+`euler101()` should return 37076114526.
+
+```js
+assert.strictEqual(euler101(), 37076114526);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler101() {
+
+  return true;
+}
+
+euler101();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
new file mode 100644
index 0000000000..9705afbc6f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
@@ -0,0 +1,156 @@
+---
+id: 5900f3d21000cf542c50fee5
+title: 'Problem 102: Triangle containment'
+challengeType: 5
+forumTopicId: 301726
+dashedName: problem-102-triangle-containment
+---
+
+# --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:
+
+```js
+const exampleTriangles = [
+  [[-340, 495], [-153, -910], [835, -947]],
+  [[-175, 41], [-421, -714], [574, -645]]
+];
+```
+
+It can be verified that first triangle contains the origin, whereas second triangle does not.
+
+Using the `triangles` array containing coordinates of triangles, find the number of triangles for which the interior contains the origin.
+
+# --hints--
+
+`triangleContainment(exampleTriangles)` should return a number.
+
+```js
+assert(typeof triangleContainment(_exampleTriangles) === 'number');
+```
+
+`triangleContainment(exampleTriangles)` should return `1`.
+
+```js
+assert.strictEqual(triangleContainment(_exampleTriangles), 1);
+```
+
+`triangleContainment(testTriangles1)` should return `19`.
+
+```js
+assert.strictEqual(triangleContainment(_testTriangles1), 19);
+```
+
+`triangleContainment(testTriangles2)` should return `228`.
+
+```js
+assert.strictEqual(triangleContainment(_testTriangles2), 228);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _exampleTriangles = [
+  [[-340, 495], [-153, -910], [835, -947]],
+  [[-175, 41], [-421, -714], [574, -645]]
+];
+const _testTriangles1 = [
+  [[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]]
+];
+const _testTriangles2 = [
+  [[-340,495],[-153,-910],[835,-947]],[[-175,41],[-421,-714],[574,-645]],[[-547,712],[-352,579],[951,-786]],[[419,-864],[-83,650],[-399,171]],[[-429,-89],[-357,-930],[296,-29]],[[-734,-702],[823,-745],[-684,-62]],[[-971,762],[925,-776],[-663,-157]],[[162,570],[628,485],[-807,-896]],[[641,91],[-65,700],[887,759]],[[215,-496],[46,-931],[422,-30]],[[-119,359],[668,-609],[-358,-494]],[[440,929],[968,214],[760,-857]],[[-700,785],[838,29],[-216,411]],[[-770,-458],[-325,-53],[-505,633]],[[-752,-805],[349,776],[-799,687]],[[323,5],[561,-36],[919,-560]],[[-907,358],[264,320],[204,274]],[[-728,-466],[350,969],[292,-345]],[[940,836],[272,-533],[748,185]],[[411,998],[813,520],[316,-949]],[[-152,326],[658,-762],[148,-651]],[[330,507],[-9,-628],[101,174]],[[551,-496],[772,-541],[-702,-45]],[[-164,-489],[-90,322],[631,-59]],[[673,366],[-4,-143],[-606,-704]],[[428,-609],[801,-449],[740,-269]],[[453,-924],[-785,-346],[-853,111]],[[-738,555],[-181,467],[-426,-20]],[[958,-692],[784,-343],[505,-569]],[[620,27],[263,54],[-439,-726]],[[804,87],[998,859],[871,-78]],[[-119,-453],[-709,-292],[-115,-56]],[[-626,138],[-940,-476],[-177,-274]],[[-11,160],[142,588],[446,158]],[[538,727],[550,787],[330,810]],[[420,-689],[854,-546],[337,516]],[[872,-998],[-607,748],[473,-192]],[[653,440],[-516,-985],[808,-857]],[[374,-158],[331,-940],[-338,-641]],[[137,-925],[-179,771],[734,-715]],[[-314,198],[-115,29],[-641,-39]],[[759,-574],[-385,355],[590,-603]],[[-189,-63],[-168,204],[289,305]],[[-182,-524],[-715,-621],[911,-255]],[[331,-816],[-833,471],[168,126]],[[-514,581],[-855,-220],[-731,-507]],[[129,169],[576,651],[-87,-458]],[[783,-444],[-881,658],[-266,298]],[[603,-430],[-598,585],[368,899]],[[43,-724],[962,-376],[851,409]],[[-610,-646],[-883,-261],[-482,-881]],[[-117,-237],[978,641],[101,-747]],[[579,125],[-715,-712],[208,534]],[[672,-214],[-762,372],[874,533]],[[-564,965],[38,715],[367,242]],[[500,951],[-700,-981],[-61,-178]],[[-382,-224],[-959,903],[-282,-60]],[[-355,295],[426,-331],[-591,655]],[[892,128],[958,-271],[-993,274]],[[-454,-619],[302,138],[-790,-874]],[[-642,601],[-574,159],[-290,-318]],[[266,-109],[257,-686],[54,975]],[[162,628],[-478,840],[264,-266]],[[466,-280],[982,1],[904,-810]],[[721,839],[730,-807],[777,981]],[[-129,-430],[748,263],[943,96]],[[434,-94],[410,-990],[249,-704]],[[237,42],[122,-732],[44,-51]],[[909,-116],[-229,545],[292,717]],[[824,-768],[-807,-370],[-262,30]],[[675,58],[332,-890],[-651,791]],[[363,825],[-717,254],[684,240]],[[405,-715],[900,166],[-589,422]],[[-476,686],[-830,-319],[634,-807]],[[633,837],[-971,917],[-764,207]],[[-116,-44],[-193,-70],[908,809]],[[-26,-252],[998,408],[70,-713]],[[-601,645],[-462,842],[-644,-591]],[[-160,653],[274,113],[-138,687]],[[369,-273],[-181,925],[-167,-693]],[[-338,135],[480,-967],[-13,-840]],[[-90,-270],[-564,695],[161,907]],[[607,-430],[869,-713],[461,-469]],[[919,-165],[-776,522],[606,-708]],[[-203,465],[288,207],[-339,-458]],[[-453,-534],[-715,975],[838,-677]],[[-973,310],[-350,934],[546,-805]],[[-835,385],[708,-337],[-594,-772]],[[-14,914],[900,-495],[-627,594]],[[833,-713],[-213,578],[-296,699]],[[-27,-748],[484,455],[915,291]],[[270,889],[739,-57],[442,-516]],[[119,811],[-679,905],[184,130]],[[-678,-469],[925,553],[612,482]],[[101,-571],[-732,-842],[644,588]],[[-71,-737],[566,616],[957,-663]],[[-634,-356],[90,-207],[936,622]],[[598,443],[964,-895],[-58,529]],[[847,-467],[929,-742],[91,10]],[[-633,829],[-780,-408],[222,-30]],[[-818,57],[275,-38],[-746,198]],[[-722,-825],[-549,597],[-391,99]],[[-570,908],[430,873],[-103,-360]],[[342,-681],[512,434],[542,-528]],[[297,850],[479,609],[543,-357]],[[9,784],[212,548],[56,859]],[[-152,560],[-240,-969],[-18,713]],[[140,-133],[34,-635],[250,-163]],[[-272,-22],[-169,-662],[989,-604]],[[471,-765],[355,633],[-742,-118]],[[-118,146],[942,663],[547,-376]],[[583,16],[162,264],[715,-33]],[[-230,-446],[997,-838],[561,555]],[[372,397],[-729,-318],[-276,649]],[[92,982],[-970,-390],[-922,922]],[[-981,713],[-951,-337],[-669,670]],[[-999,846],[-831,-504],[7,-128]],[[455,-954],[-370,682],[-510,45]],[[822,-960],[-892,-385],[-662,314]],[[-668,-686],[-367,-246],[530,-341]],[[-723,-720],[-926,-836],[-142,757]],[[-509,-134],[384,-221],[-873,-639]],[[-803,-52],[-706,-669],[373,-339]],[[933,578],[631,-616],[770,555]],[[741,-564],[-33,-605],[-576,275]],[[-715,445],[-233,-730],[734,-704]],[[120,-10],[-266,-685],[-490,-17]],[[-232,-326],[-457,-946],[-457,-116]],[[811,52],[639,826],[-200,147]],[[-329,279],[293,612],[943,955]],[[-721,-894],[-393,-969],[-642,453]],[[-688,-826],[-352,-75],[371,79]],[[-809,-979],[407,497],[858,-248]],[[-485,-232],[-242,-582],[-81,849]],[[141,-106],[123,-152],[806,-596]],[[-428,57],[-992,811],[-192,478]],[[864,393],[122,858],[255,-876]],[[-284,-780],[240,457],[354,-107]],[[956,605],[-477,44],[26,-678]],[[86,710],[-533,-815],[439,327]],[[-906,-626],[-834,763],[426,-48]],[[201,-150],[-904,652],[475,412]],[[-247,149],[81,-199],[-531,-148]],[[923,-76],[-353,175],[-121,-223]],[[427,-674],[453,472],[-410,585]],[[931,776],[-33,85],[-962,-865]],[[-655,-908],[-902,208],[869,792]],[[-316,-102],[-45,-436],[-222,885]],[[-309,768],[-574,653],[745,-975]],[[896,27],[-226,993],[332,198]],[[323,655],[-89,260],[240,-902]],[[501,-763],[-424,793],[813,616]],[[993,375],[-938,-621],[672,-70]],[[-880,-466],[-283,770],[-824,143]],[[63,-283],[886,-142],[879,-116]],[[-964,-50],[-521,-42],[-306,-161]],[[724,-22],[866,-871],[933,-383]],[[-344,135],[282,966],[-80,917]],[[-281,-189],[420,810],[362,-582]],[[-515,455],[-588,814],[162,332]],[[555,-436],[-123,-210],[869,-943]],[[589,577],[232,286],[-554,876]],[[-773,127],[-58,-171],[-452,125]],[[-428,575],[906,-232],[-10,-224]],[[437,276],[-335,-348],[605,878]],[[-964,511],[-386,-407],[168,-220]],[[307,513],[912,-463],[-423,-416]],[[-445,539],[273,886],[-18,760]],[[-396,-585],[-670,414],[47,364]],[[143,-506],[754,906],[-971,-203]],[[-544,472],[-180,-541],[869,-465]],[[-779,-15],[-396,890],[972,-220]],[[-430,-564],[503,182],[-119,456]],[[89,-10],[-739,399],[506,499]],[[954,162],[-810,-973],[127,870]],[[890,952],[-225,158],[828,237]],[[-868,952],[349,465],[574,750]],[[-915,369],[-975,-596],[-395,-134]],[[-135,-601],[575,582],[-667,640]],[[413,890],[-560,-276],[-555,-562]],[[-633,-269],[561,-820],[-624,499]],[[371,-92],[-784,-593],[864,-717]],[[-971,655],[-439,367],[754,-951]],[[172,-347],[36,279],[-247,-402]],[[633,-301],[364,-349],[-683,-387]],[[-780,-211],[-713,-948],[-648,543]],[[72,58],[762,-465],[-66,462]],[[78,502],[781,-832],[713,836]],[[-431,-64],[-484,-392],[208,-343]],[[-64,101],[-29,-860],[-329,844]],[[398,391],[828,-858],[700,395]],[[578,-896],[-326,-604],[314,180]],[[97,-321],[-695,185],[-357,852]],[[854,839],[283,-375],[951,-209]],[[194,96],[-564,-847],[162,524]],[[-354,532],[494,621],[580,560]],[[419,-678],[-450,926],[-5,-924]],[[-661,905],[519,621],[-143,394]],[[-573,268],[296,-562],[-291,-319]],[[-211,266],[-196,158],[564,-183]],[[18,-585],[-398,777],[-581,864]],[[790,-894],[-745,-604],[-418,70]],[[848,-339],[150,773],[11,851]],[[-954,-809],[-53,-20],[-648,-304]],[[658,-336],[-658,-905],[853,407]],[[-365,-844],[350,-625],[852,-358]],[[986,-315],[-230,-159],[21,180]],[[-15,599],[45,-286],[-941,847]],[[-613,-68],[184,639],[-987,550]],[[334,675],[-56,-861],[923,340]],[[-848,-596],[960,231],[-28,-34]],[[707,-811],[-994,-356],[-167,-171]],[[-470,-764],[72,576],[-600,-204]],[[379,189],[-542,-576],[585,800]],[[440,540],[-445,-563],[379,-334]],[[-155,64],[514,-288],[853,106]],[[-304,751],[481,-520],[-708,-694]],[[-709,132],[594,126],[-844,63]],[[723,471],[421,-138],[-962,892]],[[-440,-263],[39,513],[-672,-954]],[[775,809],[-581,330],[752,-107]],[[-376,-158],[335,-708],[-514,578]],[[-343,-769],[456,-187],[25,413]],[[548,-877],[-172,300],[-500,928]],[[938,-102],[423,-488],[-378,-969]],[[-36,564],[-55,131],[958,-800]],[[-322,511],[-413,503],[700,-847]],[[-966,547],[-88,-17],[-359,-67]],[[637,-341],[-437,-181],[527,-153]],[[-74,449],[-28,3],[485,189]],[[-997,658],[-224,-948],[702,-807]],[[-224,736],[-896,127],[-945,-850]],[[-395,-106],[439,-553],[-128,124]],[[-841,-445],[-758,-572],[-489,212]],[[633,-327],[13,-512],[952,771]],[[-940,-171],[-6,-46],[-923,-425]],[[-142,-442],[-817,-998],[843,-695]],[[340,847],[-137,-920],[-988,-658]],[[-653,217],[-679,-257],[651,-719]],[[-294,365],[-41,342],[74,-892]],[[690,-236],[-541,494],[408,-516]],[[180,-807],[225,790],[494,59]],[[707,605],[-246,656],[284,271]],[[65,294],[152,824],[442,-442]],[[-321,781],[-540,341],[316,415]],[[420,371],[-2,545],[995,248]],[[56,-191],[-604,971],[615,449]],[[-981,-31],[510,592],[-390,-362]],[[-317,-968],[913,365],[97,508]],[[832,63],[-864,-510],[86,202]],[[-483,456],[-636,340],[-310,676]],[[981,-847],[751,-508],[-962,-31]],[[-157,99],[73,797],[63,-172]],[[220,858],[872,924],[866,-381]],[[996,-169],[805,321],[-164,971]],[[896,11],[-625,-973],[-782,76]],[[578,-280],[730,-729],[307,-905]],[[-580,-749],[719,-698],[967,603]],[[-821,874],[-103,-623],[662,-491]],[[-763,117],[661,-644],[672,-607]],[[592,787],[-798,-169],[-298,690]],[[296,644],[-526,-762],[-447,665]],[[534,-818],[852,-120],[57,-379]],[[-986,-549],[-329,294],[954,258]],[[-133,352],[-660,-77],[904,-356]],[[748,343],[215,500],[317,-277]],[[311,7],[910,-896],[-809,795]],[[763,-602],[-753,313],[-352,917]],[[668,619],[-474,-597],[-650,650]],[[-297,563],[-701,-987],[486,-902]],[[-461,-740],[-657,233],[-482,-328]],[[-446,-250],[-986,-458],[-629,520]],[[542,-49],[-327,-469],[257,-947]],[[121,-575],[-634,-143],[-184,521]],[[30,504],[455,-645],[-229,-945]],[[-12,-295],[377,764],[771,125]],[[-686,-133],[225,-25],[-376,-143]],[[-6,-46],[338,270],[-405,-872]],[[-623,-37],[582,467],[963,898]],[[-804,869],[-477,420],[-475,-303]],[[94,41],[-842,-193],[-768,720]],[[-656,-918],[415,645],[-357,460]],[[-47,-486],[-911,468],[-608,-686]],[[-158,251],[419,-394],[-655,-895]],[[272,-695],[979,508],[-358,959]],[[-776,650],[-918,-467],[-690,-534]],[[-85,-309],[-626,167],[-366,-429]],[[-880,-732],[-186,-924],[970,-875]],[[517,645],[-274,962],[-804,544]],[[721,402],[104,640],[478,-499]],[[198,684],[-134,-723],[-452,-905]],[[-245,745],[239,238],[-826,441]],[[-217,206],[-32,462],[-981,-895]],[[-51,989],[526,-173],[560,-676]],[[-480,-659],[-976,-580],[-727,466]],[[-996,-90],[-995,158],[-239,642]],[[302,288],[-194,-294],[17,924]],[[-943,969],[-326,114],[-500,103]],[[-619,163],[339,-880],[230,421]],[[-344,-601],[-795,557],[565,-779]],[[590,345],[-129,-202],[-125,-58]],[[-777,-195],[159,674],[775,411]],[[-939,312],[-665,810],[121,855]],[[-971,254],[712,815],[452,581]],[[442,-9],[327,-750],[61,757]],[[-342,869],[869,-160],[390,-772]],[[620,601],[565,-169],[-69,-183]],[[-25,924],[-817,964],[321,-970]],[[-64,-6],[-133,978],[825,-379]],[[601,436],[-24,98],[-115,940]],[[-97,502],[614,-574],[922,513]],[[-125,262],[-946,695],[99,-220]],[[429,-721],[719,-694],[197,-558]],[[326,689],[-70,-908],[-673,338]],[[-468,-856],[-902,-254],[-358,305]],[[-358,530],[542,355],[-253,-47]],[[-438,-74],[-362,963],[988,788]],[[137,717],[467,622],[319,-380]],[[-86,310],[-336,851],[918,-288]],[[721,395],[646,-53],[255,-425]],[[255,175],[912,84],[-209,878]],[[-632,-485],[-400,-357],[991,-608]],[[235,-559],[992,-297],[857,-591]],[[87,-71],[148,130],[647,578]],[[-290,-584],[-639,-788],[-21,592]],[[386,984],[625,-731],[-993,-336]],[[-538,634],[-209,-828],[-150,-774]],[[-754,-387],[607,-781],[976,-199]],[[412,-798],[-664,295],[709,-537]],[[-412,932],[-880,-232],[561,852]],[[-656,-358],[-198,-964],[-433,-848]],[[-762,-668],[-632,186],[-673,-11]],[[-876,237],[-282,-312],[-83,682]],[[403,73],[-57,-436],[-622,781]],[[-587,873],[798,976],[-39,329]],[[-369,-622],[553,-341],[817,794]],[[-108,-616],[920,-849],[-679,96]],[[290,-974],[234,239],[-284,-321]],[[-22,394],[-417,-419],[264,58]],[[-473,-551],[69,923],[591,-228]],[[-956,662],[-113,851],[-581,-794]],[[-258,-681],[413,-471],[-637,-817]],[[-866,926],[992,-653],[-7,794]],[[556,-350],[602,917],[831,-610]],[[188,245],[-906,361],[492,174]],[[-720,384],[-818,329],[638,-666]],[[-246,846],[890,-325],[-59,-850]],[[-118,-509],[620,-762],[-256,15]],[[-787,-536],[-452,-338],[-399,813]],[[458,560],[525,-311],[-608,-419]],[[494,-811],[-825,-127],[-812,894]],[[-801,890],[-629,-860],[574,925]],[[-709,-193],[-213,138],[-410,-403]],[[861,91],[708,-187],[5,-222]],[[789,646],[777,154],[90,-49]],[[-267,-830],[-114,531],[591,-698]],[[-126,-82],[881,-418],[82,652]],[[-894,130],[-726,-935],[393,-815]],[[-142,563],[654,638],[-712,-597]],[[-759,60],[-23,977],[100,-765]],[[-305,595],[-570,-809],[482,762]],[[-161,-267],[53,963],[998,-529]],[[-300,-57],[798,353],[703,486]],[[-990,696],[-764,699],[-565,719]],[[-232,-205],[566,571],[977,369]],[[740,865],[151,-817],[-204,-293]],[[94,445],[-768,229],[537,-406]],[[861,620],[37,-424],[-36,656]],[[390,-369],[952,733],[-464,569]],[[-482,-604],[959,554],[-705,-626]],[[-396,-615],[-991,108],[272,-723]],[[143,780],[535,142],[-917,-147]],[[138,-629],[-217,-908],[905,115]],[[915,103],[-852,64],[-468,-642]],[[570,734],[-785,-268],[-326,-759]],[[738,531],[-332,586],[-779,24]],[[870,440],[-217,473],[-383,415]],[[-296,-333],[-330,-142],[-924,950]],[[118,120],[-35,-245],[-211,-652]],[[61,634],[153,-243],[838,789]],[[726,-582],[210,105],[983,537]],[[-313,-323],[758,234],[29,848]],[[-847,-172],[-593,733],[-56,617]],[[54,255],[-512,156],[-575,675]],[[-873,-956],[-148,623],[95,200]],[[700,-370],[926,649],[-978,157]],[[-639,-202],[719,130],[747,222]],[[194,-33],[955,943],[505,114]],[[-226,-790],[28,-930],[827,783]],[[-392,-74],[-28,714],[218,-612]],[[209,626],[-888,-683],[-912,495]],[[487,751],[614,933],[631,445]],[[-348,-34],[-411,-106],[835,321]],[[-689,872],[-29,-800],[312,-542]],[[-52,566],[827,570],[-862,-77]],[[471,992],[309,-402],[389,912]],[[24,520],[-83,-51],[555,503]],[[-265,-317],[283,-970],[-472,690]],[[606,526],[137,71],[-651,150]],[[217,-518],[663,66],[-605,-331]],[[-562,232],[-76,-503],[205,-323]],[[842,-521],[546,285],[625,-186]],[[997,-927],[344,909],[-546,974]],[[-677,419],[81,121],[-705,771]],[[719,-379],[-944,-797],[784,-155]],[[-378,286],[-317,-797],[-111,964]],[[-288,-573],[784,80],[-532,-646]],[[-77,407],[-248,-797],[769,-816]],[[-24,-637],[287,-858],[-927,-333]],[[-902,37],[894,-823],[141,684]],[[125,467],[-177,-516],[686,399]],[[-321,-542],[641,-590],[527,-224]],[[-400,-712],[-876,-208],[632,-543]],[[-676,-429],[664,-242],[-269,922]],[[-608,-273],[-141,930],[687,380]],[[786,-12],[498,494],[310,326]],[[-739,-617],[606,-960],[804,188]],[[384,-368],[-243,-350],[-459,31]],[[-550,397],[320,-868],[328,-279]],[[969,-179],[853,864],[-110,514]],[[910,793],[302,-822],[-285,488]],[[-605,-128],[218,-283],[-17,-227]],[[16,324],[667,708],[750,3]],[[485,-813],[19,585],[71,930]],[[-218,816],[-687,-97],[-732,-360]],[[-497,-151],[376,-23],[3,315]],[[-412,-989],[-610,-813],[372,964]],[[-878,-280],[87,381],[-311,69]],[[-609,-90],[-731,-679],[150,585]],[[889,27],[-162,605],[75,-770]],[[448,617],[-988,0],[-103,-504]],[[-800,-537],[-69,627],[608,-668]],[[534,686],[-664,942],[830,920]],[[-238,775],[495,932],[-793,497]],[[-343,958],[-914,-514],[-691,651]],[[568,-136],[208,359],[728,28]],[[286,912],[-794,683],[556,-102]],[[-638,-629],[-484,445],[-64,-497]],[[58,505],[-801,-110],[872,632]],[[-390,777],[353,267],[976,369]],[[-993,515],[105,-133],[358,-572]],[[964,996],[355,-212],[-667,38]],[[-725,-614],[-35,365],[132,-196]],[[237,-536],[-416,-302],[312,477]],[[-664,574],[-210,224],[48,-925]],[[869,-261],[-256,-240],[-3,-698]],[[712,385],[32,-34],[916,-315]],[[895,-409],[-100,-346],[728,-624]],[[-806,327],[-450,889],[-781,-939]],[[-586,-403],[698,318],[-939,899]],[[557,-57],[-920,659],[333,-51]],[[-441,232],[-918,-205],[246,1]],[[783,167],[-797,-595],[245,-736]],[[-36,-531],[-486,-426],[-813,-160]],[[777,-843],[817,313],[-228,-572]],[[735,866],[-309,-564],[-81,190]],[[-413,645],[101,719],[-719,218]],[[-83,164],[767,796],[-430,-459]],[[122,779],[-15,-295],[-96,-892]],[[462,379],[70,548],[834,-312]],[[-630,-534],[124,187],[-737,114]],[[-299,-604],[318,-591],[936,826]],[[-879,218],[-642,-483],[-318,-866]],[[-691,62],[-658,761],[-895,-854]],[[-822,493],[687,569],[910,-202]],[[-223,784],[304,-5],[541,925]],[[-914,541],[737,-662],[-662,-195]],[[-622,615],[414,358],[881,-878]],[[339,745],[-268,-968],[-280,-227]],[[-364,855],[148,-709],[-827,472]],[[-890,-532],[-41,664],[-612,577]],[[-702,-859],[971,-722],[-660,-920]],[[-539,-605],[737,149],[973,-802]],[[800,42],[-448,-811],[152,511]],[[-933,377],[-110,-105],[-374,-937]],[[-766,152],[482,120],[-308,390]],[[-568,775],[-292,899],[732,890]],[[-177,-317],[-502,-259],[328,-511]],[[612,-696],[-574,-660],[132,31]],[[-119,563],[-805,-864],[179,-672]],[[425,-627],[183,-331],[839,318]],[[-711,-976],[-749,152],[-916,261]],[[181,-63],[497,211],[262,406]],[[-537,700],[-859,-765],[-928,77]],[[892,832],[231,-749],[-82,613]],[[816,216],[-642,-216],[-669,-912]],[[-6,624],[-937,-370],[-344,268]],[[737,-710],[-869,983],[-324,-274]],[[565,952],[-547,-158],[374,-444]],[[51,-683],[645,-845],[515,636]],[[-953,-631],[114,-377],[-764,-144]],[[-8,470],[-242,-399],[-675,-730]],[[-540,689],[-20,47],[-607,590]],[[-329,-710],[-779,942],[-388,979]],[[123,829],[674,122],[203,563]],[[46,782],[396,-33],[386,610]],[[872,-846],[-523,-122],[-55,-190]],[[388,-994],[-525,974],[127,596]],[[781,-680],[796,-34],[-959,-62]],[[-749,173],[200,-384],[-745,-446]],[[379,618],[136,-250],[-224,970]],[[-58,240],[-921,-760],[-901,-626]],[[366,-185],[565,-100],[515,688]],[[489,999],[-893,-263],[-637,816]],[[838,-496],[-316,-513],[419,479]],[[107,676],[-15,882],[98,-397]],[[-999,941],[-903,-424],[670,-325]],[[171,-979],[835,178],[169,-984]],[[-609,-607],[378,-681],[184,402]],[[-316,903],[-575,-800],[224,983]],[[591,-18],[-460,551],[-167,918]],[[-756,405],[-117,441],[163,-320]],[[456,24],[6,881],[-836,-539]],[[-489,-585],[915,651],[-892,-382]],[[-177,-122],[73,-711],[-386,591]],[[181,724],[530,686],[-131,241]],[[737,288],[886,216],[233,33]],[[-548,-386],[-749,-153],[-85,-982]],[[-835,227],[904,160],[-99,25]],[[-9,-42],[-162,728],[840,-963]],[[217,-763],[870,771],[47,-846]],[[-595,808],[-491,556],[337,-900]],[[-134,281],[-724,441],[-134,708]],[[-789,-508],[651,-962],[661,315]],[[-839,-923],[339,402],[41,-487]],[[300,-790],[48,703],[-398,-811]],[[955,-51],[462,-685],[960,-717]],[[910,-880],[592,-255],[-51,-776]],[[-885,169],[-793,368],[-565,458]],[[-905,940],[-492,-630],[-535,-988]],[[245,797],[763,869],[-82,550]],[[-310,38],[-933,-367],[-650,824]],[[-95,32],[-83,337],[226,990]],[[-218,-975],[-191,-208],[-785,-293]],[[-672,-953],[517,-901],[-247,465]],[[681,-148],[261,-857],[544,-923]],[[640,341],[446,-618],[195,769]],[[384,398],[-846,365],[671,815]],[[578,576],[-911,907],[762,-859]],[[548,-428],[144,-630],[-759,-146]],[[710,-73],[-700,983],[-97,-889]],[[-46,898],[-973,-362],[-817,-717]],[[151,-81],[-125,-900],[-478,-154]],[[483,615],[-537,-932],[181,-68]],[[786,-223],[518,25],[-306,-12]],[[-422,268],[-809,-683],[635,468]],[[983,-734],[-694,-608],[-110,4]],[[-786,-196],[749,-354],[137,-8]],[[-181,36],[668,-200],[691,-973]],[[-629,-838],[692,-736],[437,-871]],[[-208,-536],[-159,-596],[8,197]],[[-3,370],[-686,170],[913,-376]],[[44,-998],[-149,-993],[-200,512]],[[-519,136],[859,497],[536,434]],[[77,-985],[972,-340],[-705,-837]],[[-381,947],[250,360],[344,322]],[[-26,131],[699,750],[707,384]],[[-914,655],[299,193],[406,955]],[[-883,-921],[220,595],[-546,794]],[[-599,577],[-569,-404],[-704,489]],[[-594,-963],[-624,-460],[880,-760]],[[-603,88],[-99,681],[55,-328]],[[976,472],[139,-453],[-531,-860]],[[192,-290],[513,-89],[666,432]],[[417,487],[575,293],[567,-668]],[[655,711],[-162,449],[-980,972]],[[-505,664],[-685,-239],[603,-592]],[[-625,-802],[-67,996],[384,-636]],[[365,-593],[522,-666],[-200,-431]],[[-868,708],[560,-860],[-630,-355]],[[-702,785],[-637,-611],[-597,960]],[[-137,-696],[-93,-803],[408,406]],[[891,-123],[-26,-609],[-610,518]],[[133,-832],[-198,555],[708,-110]],[[791,617],[-69,487],[696,315]],[[-900,694],[-565,517],[-269,-416]],[[914,135],[-781,600],[-71,-600]],[[991,-915],[-422,-351],[-837,313]],[[-840,-398],[-302,21],[590,146]],[[62,-558],[-702,-384],[-625,831]],[[-363,-426],[-924,-496],[792,-908]],[[73,361],[-817,-466],[400,922]],[[-626,-164],[-626,860],[-524,286]],[[255,26],[-944,809],[-606,986]],[[-457,-256],[-103,50],[-867,-871]],[[-223,803],[196,480],[612,136]],[[-820,-928],[700,780],[-977,721]],[[717,332],[53,-933],[-128,793]],[[-602,-648],[562,593],[890,702]],[[-469,-875],[-527,911],[-475,-222]],[[110,-281],[-552,-536],[-816,596]],[[-981,654],[413,-981],[-75,-95]],[[-754,-742],[-515,894],[-220,-344]],[[795,-52],[156,408],[-603,76]],[[474,-157],[423,-499],[-807,-791]],[[260,688],[40,-52],[702,-122]],[[-584,-517],[-390,-881],[302,-504]],[[61,797],[665,708],[14,668]],[[366,166],[458,-614],[564,-983]],[[72,539],[-378,796],[381,-824]],[[-485,201],[-588,842],[736,379]],[[-149,-894],[-298,705],[-303,-406]],[[660,-935],[-580,521],[93,633]],[[-382,-282],[-375,-841],[-828,171]],[[-567,743],[-100,43],[144,122]],[[-281,-786],[-749,-551],[296,304]],[[11,-426],[-792,212],[857,-175]],[[594,143],[-699,289],[315,137]],[[341,596],[-390,107],[-631,-804]],[[-751,-636],[-424,-854],[193,651]],[[-145,384],[749,675],[-786,517]],[[224,-865],[-323,96],[-916,258]],[[-309,403],[-388,826],[35,-270]],[[-942,709],[222,158],[-699,-103]],[[-589,842],[-997,29],[-195,-210]],[[264,426],[566,145],[-217,623]],[[217,965],[507,-601],[-453,507]],[[-206,307],[-982,4],[64,-292]],[[676,-49],[-38,-701],[550,883]],[[5,-850],[-438,659],[745,-773]],[[933,238],[-574,-570],[91,-33]],[[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]],[[848,462],[100,-381],[135,242]],[[330,718],[-24,-190],[860,-78]],[[479,458],[941,108],[-866,-653]],[[212,980],[962,-962],[115,841]],[[-827,-474],[-206,881],[323,765]],[[506,-45],[-30,-293],[524,-133]],[[832,-173],[547,-852],[-561,-842]],[[-397,-661],[-708,819],[-545,-228]],[[521,51],[-489,852],[36,-258]],[[227,-164],[189,465],[-987,-882]],[[-73,-997],[641,-995],[449,-615]],[[151,-995],[-638,415],[257,-400]],[[-663,-297],[-748,537],[-734,198]],[[-585,-401],[-81,-782],[-80,-105]],[[99,-21],[238,-365],[-704,-368]],[[45,416],[849,-211],[-371,-1]],[[-404,-443],[795,-406],[36,-933]],[[272,-363],[981,-491],[-380,77]],[[713,-342],[-366,-849],[643,911]],[[-748,671],[-537,813],[961,-200]],[[-194,-909],[703,-662],[-601,188]],[[281,500],[724,286],[267,197]],[[-832,847],[-595,820],[-316,637]],[[520,521],[-54,261],[923,-10]],[[4,-808],[-682,-258],[441,-695]],[[-793,-107],[-969,905],[798,446]],[[-108,-739],[-590,69],[-855,-365]],[[380,-623],[-930,817],[468,713]],[[759,-849],[-236,433],[-723,-931]],[[95,-320],[-686,124],[-69,-329]],[[-655,518],[-210,-523],[284,-866]],[[144,303],[639,70],[-171,269]],[[173,-333],[947,-304],[55,40]],[[274,878],[-482,-888],[-835,375]],[[-982,-854],[-36,-218],[-114,-230]],[[905,-979],[488,-485],[-479,114]],[[877,-157],[553,-530],[-47,-321]],[[350,664],[-881,442],[-220,-284]],[[434,-423],[-365,878],[-726,584]],[[535,909],[-517,-447],[-660,-141]],[[-966,191],[50,353],[182,-642]],[[-785,-634],[123,-907],[-162,511]],[[146,-850],[-214,814],[-704,25]],[[692,1],[521,492],[-637,274]],[[-662,-372],[-313,597],[983,-647]],[[-962,-526],[68,-549],[-819,231]],[[740,-890],[-318,797],[-666,948]],[[-190,-12],[-468,-455],[948,284]],[[16,478],[-506,-888],[628,-154]],[[272,630],[-976,308],[433,3]],[[-169,-391],[-132,189],[302,-388]],[[109,-784],[474,-167],[-265,-31]],[[-177,-532],[283,464],[421,-73]],[[650,635],[592,-138],[1,-387]],[[-932,703],[-827,-492],[-355,686]],[[586,-311],[340,-618],[645,-434]],[[-951,736],[647,-127],[-303,590]],[[188,444],[903,718],[-931,500]],[[-872,-642],[-296,-571],[337,241]],[[23,65],[152,125],[880,470]],[[512,823],[-42,217],[823,-263]],[[180,-831],[-380,886],[607,762]],[[722,443],[-149,-216],[-115,759]],[[-19,660],[-36,901],[923,231]],[[562,-322],[-626,-968],[194,-825]],[[204,-920],[938,784],[362,150]],[[-410,-266],[-715,559],[-672,124]],[[-198,446],[-140,454],[-461,-447]],[[83,-346],[830,-493],[-759,-382]],[[-881,601],[581,234],[-134,-925]],[[-494,914],[-42,899],[235,629]],[[-390,50],[956,437],[774,-700]],[[-514,514],[44,-512],[-576,-313]],[[63,-688],[808,-534],[-570,-399]],[[-726,572],[-896,102],[-294,-28]],[[-688,757],[401,406],[955,-511]],[[-283,423],[-485,480],[-767,908]],[[-541,952],[-594,116],[-854,451]],[[-273,-796],[236,625],[-626,257]],[[-407,-493],[373,826],[-309,297]],[[-750,955],[-476,641],[-809,713]],[[8,415],[695,226],[-111,2]],[[733,209],[152,-920],[401,995]],[[921,-103],[-919,66],[871,-947]],[[-907,89],[-869,-214],[851,-559]],[[-307,748],[524,-755],[314,-711]],[[188,897],[-72,-763],[482,103]],[[545,-821],[-232,-596],[-334,-754]],[[-217,-788],[-820,388],[-200,-662]],[[779,160],[-723,-975],[-142,-998]],[[-978,-519],[-78,-981],[842,904]],[[-504,-736],[-295,21],[-472,-482]],[[391,115],[-705,574],[652,-446]],[[813,-988],[865,830],[-263,487]],[[194,80],[774,-493],[-761,-872]],[[-415,-284],[-803,7],[-810,670]],[[-484,-4],[881,-872],[55,-852]],[[-379,822],[-266,324],[-48,748]],[[-304,-278],[406,-60],[959,-89]],[[404,756],[577,-643],[-332,658]],[[291,460],[125,491],[-312,83]],[[311,-734],[-141,582],[282,-557]],[[-450,-661],[-981,710],[-177,794]],[[328,264],[-787,971],[-743,-407]],[[-622,518],[993,-241],[-738,229]],[[273,-826],[-254,-917],[-710,-111]],[[809,770],[96,368],[-818,725]],[[-488,773],[502,-342],[534,745]],[[-28,-414],[236,-315],[-484,363]],[[179,-466],[-566,713],[-683,56]],[[560,-240],[-597,619],[916,-940]],[[893,473],[872,-868],[-642,-461]],[[799,489],[383,-321],[-776,-833]],[[980,490],[-508,764],[-512,-426]],[[917,961],[-16,-675],[440,559]],[[-812,212],[784,-987],[-132,554]],[[-886,454],[747,806],[190,231]],[[910,341],[21,-66],[708,725]],[[29,929],[-831,-494],[-303,389]],[[-103,492],[-271,-174],[-515,529]],[[-292,119],[419,788],[247,-951]],[[483,543],[-347,-673],[664,-549]],[[-926,-871],[-437,337],[162,-877]],[[299,472],[-771,5],[-88,-643]],[[-103,525],[-725,-998],[264,22]],[[-505,708],[550,-545],[823,347]],[[-738,931],[59,147],[-156,-259]],[[456,968],[-162,889],[132,-911]],[[535,120],[968,-517],[-864,-541]],[[24,-395],[-593,-766],[-565,-332]],[[834,611],[825,-576],[280,629]],[[211,-548],[140,-278],[-592,929]],[[-999,-240],[-63,-78],[793,573]],[[-573,160],[450,987],[529,322]],[[63,353],[315,-187],[-461,577]],[[189,-950],[-247,656],[289,241]],[[209,-297],[397,664],[-805,484]],[[-655,452],[435,-556],[917,874]],[[253,-756],[262,-888],[-778,-214]],[[793,-451],[323,-251],[-401,-458]],[[-396,619],[-651,-287],[-668,-781]],[[698,720],[-349,742],[-807,546]],[[738,280],[680,279],[-540,858]],[[-789,387],[530,-36],[-551,-491]],[[162,579],[-427,-272],[228,710]],[[689,356],[917,-580],[729,217]],[[-115,-638],[866,424],[-82,-194]],[[411,-338],[-917,172],[227,-29]],[[-612,63],[630,-976],[-64,-204]],[[-200,911],[583,-571],[682,-579]],[[91,298],[396,-183],[788,-955]],[[141,-873],[-277,149],[-396,916]],[[321,958],[-136,573],[541,-777]],[[797,-909],[-469,-877],[988,-653]],[[784,-198],[129,883],[-203,399]],[[-68,-810],[223,-423],[-467,-512]],[[531,-445],[-603,-997],[-841,641]],[[-274,-242],[174,261],[-636,-158]],[[-574,494],[-796,-798],[-798,99]],[[95,-82],[-613,-954],[-753,986]],[[-883,-448],[-864,-401],[938,-392]],[[913,930],[-542,-988],[310,410]],[[506,-99],[43,512],[790,-222]],[[724,31],[49,-950],[260,-134]],[[-287,-947],[-234,-700],[56,588]],[[-33,782],[-144,948],[105,-791]],[[548,-546],[-652,-293],[881,-520]],[[691,-91],[76,991],[-631,742]],[[-520,-429],[-244,-296],[724,-48]],[[778,646],[377,50],[-188,56]],[[-895,-507],[-898,-165],[-674,652]],[[654,584],[-634,177],[-349,-620]],[[114,-980],[355,62],[182,975]],[[516,9],[-442,-298],[274,-579]],[[-238,262],[-431,-896],[506,-850]],[[47,748],[846,821],[-537,-293]],[[839,726],[593,285],[-297,840]],[[634,-486],[468,-304],[-887,-567]],[[-864,914],[296,-124],[335,233]],[[88,-253],[-523,-956],[-554,803]],[[-587,417],[281,-62],[-409,-363]],[[-136,-39],[-292,-768],[-264,876]],[[-127,506],[-891,-331],[-744,-430]],[[778,584],[-750,-129],[-479,-94]],[[-876,-771],[-987,-757],[180,-641]],[[-777,-694],[411,-87],[329,190]],[[-347,-999],[-882,158],[-754,232]],[[-105,918],[188,237],[-110,-591]],[[-209,703],[-838,77],[838,909]],[[-995,-339],[-762,750],[860,472]],[[185,271],[-289,173],[811,-300]],[[2,65],[-656,-22],[36,-139]],[[765,-210],[883,974],[961,-905]],[[-212,295],[-615,-840],[77,474]],[[211,-910],[-440,703],[-11,859]],[[-559,-4],[-196,841],[-277,969]],[[-73,-159],[-887,126],[978,-371]],[[-569,633],[-423,-33],[512,-393]],[[503,143],[-383,-109],[-649,-998]],[[-663,339],[-317,-523],[-2,596]],[[690,-380],[570,378],[-652,132]],[[72,-744],[-930,399],[-525,935]],[[865,-983],[115,37],[995,826]],[[594,-621],[-872,443],[188,-241]],[[-1000,291],[754,234],[-435,-869]],[[-868,901],[654,-907],[59,181]],[[-868,-793],[-431,596],[-446,-564]],[[900,-944],[-680,-796],[902,-366]],[[331,430],[943,853],[-851,-942]],[[315,-538],[-354,-909],[139,721]],[[170,-884],[-225,-818],[-808,-657]],[[-279,-34],[-533,-871],[-972,552]],[[691,-986],[-800,-950],[654,-747]],[[603,988],[899,841],[-630,591]],[[876,-949],[809,562],[602,-536]],[[-693,363],[-189,495],[738,-1000]],[[-383,431],[-633,297],[665,959]],[[-740,686],[-207,-803],[188,-520]],[[-820,226],[31,-339],[10,121]],[[-312,-844],[624,-516],[483,621]],[[-822,-529],[69,-278],[800,328]],[[834,-82],[-759,420],[811,-264]],[[-960,-240],[-921,561],[173,46]],[[-324,909],[-790,-814],[-2,-785]],[[976,334],[-290,-891],[704,-581]],[[150,-798],[689,-823],[237,-639]],[[-551,-320],[876,-502],[-622,-628]],[[-136,845],[904,595],[-702,-261]],[[-857,-377],[-522,-101],[-943,-805]],[[-682,-787],[-888,-459],[-752,-985]],[[-571,-81],[623,-133],[447,643]],[[-375,-158],[72,-387],[-324,-696]],[[-660,-650],[340,188],[569,526]],[[727,-218],[16,-7],[-595,-988]],[[-966,-684],[802,-783],[-272,-194]],[[115,-566],[-888,47],[712,180]],[[-237,-69],[45,-272],[981,-812]],[[48,897],[439,417],[50,325]],[[348,616],[180,254],[104,-784]],[[-730,811],[-548,612],[-736,790]],[[138,-810],[123,930],[65,865]],[[-768,-299],[-49,-895],[-692,-418]],[[487,-531],[802,-159],[-12,634]],[[808,-179],[552,-73],[470,717]],[[720,-644],[886,-141],[625,144]],[[-485,-505],[-347,-244],[-916,66]],[[600,-565],[995,-5],[324,227]],[[-771,-35],[904,-482],[753,-303]],[[-701,65],[426,-763],[-504,-479]],[[409,733],[-823,475],[64,718]],[[865,975],[368,893],[-413,-433]],[[812,-597],[-970,819],[813,624]],[[193,-642],[-381,-560],[545,398]],[[711,28],[-316,771],[717,-865]],[[-509,462],[809,-136],[786,635]],[[618,-49],[484,169],[635,547]],[[-747,685],[-882,-496],[-332,82]],[[-501,-851],[870,563],[290,570]],[[-279,-829],[-509,397],[457,816]],[[-508,80],[850,-188],[483,-326]],[[860,-100],[360,119],[-205,787]],[[-870,21],[-39,-827],[-185,932]],[[826,284],[-136,-866],[-330,-97]],[[-944,-82],[745,899],[-97,365]],[[929,262],[564,632],[-115,632]],[[244,-276],[713,330],[-897,-214]],[[-890,-109],[664,876],[-974,-907]],[[716,249],[816,489],[723,141]],[[-96,-560],[-272,45],[-70,645]],[[762,-503],[414,-828],[-254,-646]],[[909,-13],[903,-422],[-344,-10]],[[658,-486],[743,545],[50,674]],[[-241,507],[-367,18],[-48,-241]],[[886,-268],[884,-762],[120,-486]],[[-412,-528],[879,-647],[223,-393]],[[851,810],[234,937],[-726,797]],[[-999,942],[839,-134],[-996,-189]],[[100,979],[-527,-521],[378,800]],[[544,-844],[-832,-530],[-77,-641]],[[43,889],[31,442],[-934,-503]],[[-330,-370],[-309,-439],[173,547]],[[169,945],[62,-753],[-542,-597]],[[208,751],[-372,-647],[-520,70]],[[765,-840],[907,-257],[379,918]],[[334,-135],[-689,730],[-427,618]],[[137,-508],[66,-695],[78,169]],[[-962,-123],[400,-417],[151,969]],[[328,689],[666,427],[-555,-642]],[[-907,343],[605,-341],[-647,582]],[[-667,-363],[-571,818],[-265,-399]],[[525,-938],[904,898],[725,692]],[[-176,-802],[-858,-9],[780,275]],[[580,170],[-740,287],[691,-97]],[[365,557],[-375,361],[-288,859]],[[193,737],[842,-808],[520,282]],[[-871,65],[-799,836],[179,-720]],[[958,-144],[744,-789],[797,-48]],[[122,582],[662,912],[68,757]],[[595,241],[-801,513],[388,186]],[[-103,-677],[-259,-731],[-281,-857]],[[921,319],[-696,683],[-88,-997]],[[775,200],[78,858],[648,768]],[[316,821],[-763,68],[-290,-741]],[[564,664],[691,504],[760,787]],[[694,-119],[973,-385],[309,-760]],[[777,-947],[-57,990],[74,19]],[[971,626],[-496,-781],[-602,-239]],[[-651,433],[11,-339],[939,294]],[[-965,-728],[560,569],[-708,-247]]
+];
+```
+
+## --seed-contents--
+
+```js
+function triangleContainment(triangles) {
+
+  return true;
+}
+
+const testTriangles1 = [
+  [[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]]
+];
+
+triangleContainment(testTriangles1);
+```
+
+# --solutions--
+
+```js
+function triangleContainment(triangles) {
+  function isInTriangle(triangle, point) {
+    // Based on https://stackoverflow.com/a/14382692
+    const area = triangleArea(triangle);
+    const s = getS(area, point, triangle);
+    const t = getT(area, point, triangle);
+
+    if (s > 0 && t > 0 && 1 - s - t > 0) {
+      return true;
+    }
+    return false;
+  }
+
+  function getS(area, point, triangle) {
+    return (
+      (1 / (2 * area)) *
+      (triangle.A.y * triangle.C.x -
+        triangle.A.x * triangle.C.y +
+        point.x * (triangle.C.y - triangle.A.y) +
+        point.y * (triangle.A.x - triangle.C.x))
+    );
+  }
+
+  function getT(area, point, triangle) {
+    return (
+      (1 / (2 * area)) *
+      (triangle.A.x * triangle.B.y -
+        triangle.A.y * triangle.B.x +
+        point.x * (triangle.A.y - triangle.B.y) +
+        point.y * (triangle.B.x - triangle.A.x))
+    );
+  }
+
+  function triangleArea(triangle) {
+    return (
+      0.5 *
+      (-triangle.B.y * triangle.C.x +
+        triangle.A.y * (-triangle.B.x + triangle.C.x) +
+        triangle.A.x * (triangle.B.y - triangle.C.y) +
+        triangle.B.x * triangle.C.y)
+    );
+  }
+
+  function parseTriangle(triangle) {
+    const points = [];
+    for (let i = 0; i < triangle.length; i++) {
+      const [coordinateX, coordinateY] = triangle[i];
+      points.push({ x: coordinateX, y: coordinateY });
+    }
+    const [pointA, pointB, pointC] = points;
+    return {
+      A: pointA,
+      B: pointB,
+      C: pointC
+    };
+  }
+
+  const origin = { x: 0, y: 0 };
+
+  let trianglesInside = 0;
+  for (let i = 0; i < triangles.length; i++) {
+    const triangle = parseTriangle(triangles[i]);
+
+    if (isInTriangle(triangle, origin)) {
+      trianglesInside++;
+    }
+  }
+  return trianglesInside;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
new file mode 100644
index 0000000000..1ba5808084
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3d61000cf542c50fee7
+title: 'Problem 103: Special subset sums: optimum'
+challengeType: 5
+forumTopicId: 301727
+dashedName: problem-103-special-subset-sums-optimum
+---
+
+# --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.
+
+# --hints--
+
+`euler103()` should return 20313839404245.
+
+```js
+assert.strictEqual(euler103(), 20313839404245);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler103() {
+
+  return true;
+}
+
+euler103();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
new file mode 100644
index 0000000000..625840f94a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3d51000cf542c50fee6
+title: 'Problem 104: Pandigital Fibonacci ends'
+challengeType: 5
+forumTopicId: 301728
+dashedName: problem-104-pandigital-fibonacci-ends
+---
+
+# --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.
+
+# --hints--
+
+`euler104()` should return 329468.
+
+```js
+assert.strictEqual(euler104(), 329468);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler104() {
+
+  return true;
+}
+
+euler104();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
new file mode 100644
index 0000000000..28d4d6ac86
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3d61000cf542c50fee8
+title: 'Problem 105: Special subset sums: testing'
+challengeType: 5
+forumTopicId: 301729
+dashedName: problem-105-special-subset-sums-testing
+---
+
+# --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.
+
+# --hints--
+
+`euler105()` should return 73702.
+
+```js
+assert.strictEqual(euler105(), 73702);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler105() {
+
+  return true;
+}
+
+euler105();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
new file mode 100644
index 0000000000..bb1db2e260
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3d71000cf542c50fee9
+title: 'Problem 106: Special subset sums: meta-testing'
+challengeType: 5
+forumTopicId: 301730
+dashedName: problem-106-special-subset-sums-meta-testing
+---
+
+# --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.
+
+# --hints--
+
+`euler106()` should return 21384.
+
+```js
+assert.strictEqual(euler106(), 21384);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler106() {
+
+  return true;
+}
+
+euler106();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
new file mode 100644
index 0000000000..f51dfe801d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3d91000cf542c50feea
+title: 'Problem 107: Minimal network'
+challengeType: 5
+forumTopicId: 301731
+dashedName: problem-107-minimal-network
+---
+
+# --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.
+
+# --hints--
+
+`euler107()` should return 259679.
+
+```js
+assert.strictEqual(euler107(), 259679);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler107() {
+
+  return true;
+}
+
+euler107();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
new file mode 100644
index 0000000000..d216cfa9fd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3d91000cf542c50feeb
+title: 'Problem 108: Diophantine Reciprocals I'
+challengeType: 5
+forumTopicId: 301732
+dashedName: problem-108-diophantine-reciprocals-i
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers.
+
+1/`x` + 1/`y` = 1/`n`
+
+For `n` = 4 there are exactly three distinct solutions:
+
+1/5 + 1/20 = 1/4  
+1/6 + 1/12 = 1/4  
+1/8 + 1/8 = 1/4
+
+What is the least value of `n` for which the number of distinct solutions exceeds one-thousand?
+
+# --hints--
+
+`diophantineOne()` should return 180180.
+
+```js
+assert.strictEqual(diophantineOne(), 180180);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineOne() {
+
+  return true;
+}
+
+diophantineOne();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-109-darts.md
new file mode 100644
index 0000000000..e7a580b45b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3db1000cf542c50feec
+title: 'Problem 109: Darts'
+challengeType: 5
+forumTopicId: 301733
+dashedName: problem-109-darts
+---
+
+# --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?
+
+# --hints--
+
+`euler109()` should return 38182.
+
+```js
+assert.strictEqual(euler109(), 38182);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler109() {
+
+  return true;
+}
+
+euler109();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
new file mode 100644
index 0000000000..d7610e3ac3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
@@ -0,0 +1,182 @@
+---
+id: 5900f3781000cf542c50fe8a
+title: 'Problem 11: Largest product in a grid'
+challengeType: 5
+forumTopicId: 301734
+dashedName: problem-11-largest-product-in-a-grid
+---
+
+# --description--
+
+In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
+
+<div style='text-align: center;'>
+  08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08<br>
+  49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00<br>
+  81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65<br>
+  52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91<br>
+  22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80<br>
+  24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50<br>
+  32 98 81 28 64 23 67 10 <span style='color: red'><b>26</b></span> 38 40 67 59 54 70 66 18 38 64 70<br>
+  67 26 20 68 02 62 12 20 95 <span style='color: red'><b>63</b></span> 94 39 63 08 40 91 66 49 94 21<br>
+  24 55 58 05 66 73 99 26 97 17 <span style='color: red'><b>78</b></span> 78 96 83 14 88 34 89 63 72<br>
+  21 36 23 09 75 00 76 44 20 45 35 <span style='color: red'><b>14</b></span> 00 61 33 97 34 31 33 95<br>
+  78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92<br>
+  16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57<br>
+  86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58<br>
+  19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40<br>
+  04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66<br>
+  88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69<br>
+  04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36<br>
+  20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16<br>
+  20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54<br>
+  01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48<br>
+</div>
+
+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 a given `arr` grid?
+
+# --hints--
+
+`largestGridProduct(testGrid)` should return a number.
+
+```js
+assert(typeof largestGridProduct(testGrid) === 'number');
+```
+
+`largestGridProduct(testGrid)` should return 14169081.
+
+```js
+assert.strictEqual(largestGridProduct(testGrid), 14169081);
+```
+
+`largestGridProduct(grid)` should return 70600674.
+
+```js
+assert.strictEqual(largestGridProduct(grid), 70600674);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestGridProduct(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+const grid = [
+  [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
+  [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
+  [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
+  [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 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, 3, 45, 2, 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, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
+  [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
+  [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
+  [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
+  [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
+  [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
+  [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
+  [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
+  [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
+  [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
+  [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
+  [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
+  [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
+];
+
+const testGrid = [
+  [40, 17, 81, 18, 57],
+  [74, 4, 36, 16, 29],
+  [36, 42, 69, 73, 45],
+  [51, 54, 69, 16, 92],
+  [7, 97, 57, 32, 16]
+];
+
+largestGridProduct(testGrid);
+```
+
+# --solutions--
+
+```js
+function largestGridProduct(arr) {
+  let maxProduct = 0;
+  let currProduct = 0;
+
+  function maxProductChecker(n) {
+    if (n > maxProduct) {
+      return maxProduct = n;
+    }
+  }
+
+  // loop rows
+  for (let r = 0; r < arr.length; r++) {
+    // loop columns
+    for (let c = 0; c < arr[r].length; c++) {
+      const limit = arr[r].length - 3;
+
+      // check horizontal
+      if (c < limit) {
+        currProduct = arr[r][c] * arr[r][c + 1] * arr[r][c + 2] * arr[r][c + 3];
+        maxProductChecker(currProduct);
+      }
+
+      // check vertical
+      if (r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c] * arr[r + 2][c] * arr[r + 3][c];
+        maxProductChecker(currProduct);
+      }
+
+      // check diagonal [\]
+      if (c < limit && r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c + 1] * arr[r + 2][c + 2] * arr[r + 3][c + 3];
+        maxProductChecker(currProduct);
+      }
+
+      // check diagonal [/]
+      if (c > 3 && r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c - 1] * arr[r + 2][c - 2] * arr[r + 3][c - 3];
+        maxProductChecker(currProduct);
+      }
+    }
+  }
+
+  return maxProduct;
+}
+
+ const grid = [  [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
+  [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
+  [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
+  [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 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, 3, 45, 2, 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, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
+  [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
+  [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
+  [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
+  [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
+  [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
+  [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
+  [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
+  [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
+  [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
+  [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
+  [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
+  [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
+];
+
+const testGrid = [
+  [40, 17, 81, 18, 57],
+  [74, 4, 36, 16, 29],
+  [36, 42, 69, 73, 45],
+  [51, 54, 69, 16, 92],
+  [7, 97, 57, 32, 16]
+];
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
new file mode 100644
index 0000000000..c50c81a164
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3db1000cf542c50feed
+title: 'Problem 110: Diophantine Reciprocals II'
+challengeType: 5
+forumTopicId: 301735
+dashedName: problem-110-diophantine-reciprocals-ii
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers.
+
+1/`x` + 1/`y` = 1/`n`
+
+It can be verified that when `n` = 1260 there are 113 distinct solutions and this is the least value of `n` for which the total number of distinct solutions exceeds one hundred.
+
+What is the least value of `n` for which the number of distinct solutions exceeds four million?
+
+# --hints--
+
+`diophantineTwo()` should return 9350130049860600.
+
+```js
+assert.strictEqual(diophantineTwo(), 9350130049860600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineTwo() {
+
+  return true;
+}
+
+diophantineTwo();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
new file mode 100644
index 0000000000..920085b1f3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3db1000cf542c50feee
+title: 'Problem 111: Primes with runs'
+challengeType: 5
+forumTopicId: 301736
+dashedName: problem-111-primes-with-runs
+---
+
+# --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).
+
+# --hints--
+
+`euler111()` should return 612407567715.
+
+```js
+assert.strictEqual(euler111(), 612407567715);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler111() {
+
+  return true;
+}
+
+euler111();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
new file mode 100644
index 0000000000..cd998d5bde
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3dd1000cf542c50feef
+title: 'Problem 112: Bouncy numbers'
+challengeType: 5
+forumTopicId: 301738
+dashedName: problem-112-bouncy-numbers
+---
+
+# --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%.
+
+# --hints--
+
+`euler112()` should return 1587000.
+
+```js
+assert.strictEqual(euler112(), 1587000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler112() {
+
+  return true;
+}
+
+euler112();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
new file mode 100644
index 0000000000..bc28697a24
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3dd1000cf542c50fef0
+title: 'Problem 113: Non-bouncy numbers'
+challengeType: 5
+forumTopicId: 301739
+dashedName: problem-113-non-bouncy-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler113()` should return 51161058134250.
+
+```js
+assert.strictEqual(euler113(), 51161058134250);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler113() {
+
+  return true;
+}
+
+euler113();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
new file mode 100644
index 0000000000..c9ec66c9aa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e01000cf542c50fef2
+title: 'Problem 114: Counting block combinations I'
+challengeType: 5
+forumTopicId: 301740
+dashedName: problem-114-counting-block-combinations-i
+---
+
+# --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).
+
+# --hints--
+
+`euler114()` should return 16475640049.
+
+```js
+assert.strictEqual(euler114(), 16475640049);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler114() {
+
+  return true;
+}
+
+euler114();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
new file mode 100644
index 0000000000..069a8a2c38
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3df1000cf542c50fef1
+title: 'Problem 115: Counting block combinations II'
+challengeType: 5
+forumTopicId: 301741
+dashedName: problem-115-counting-block-combinations-ii
+---
+
+# --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.
+
+# --hints--
+
+`euler115()` should return 168.
+
+```js
+assert.strictEqual(euler115(), 168);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler115() {
+
+  return true;
+}
+
+euler115();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
new file mode 100644
index 0000000000..1f61195dea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3e01000cf542c50fef3
+title: 'Problem 116: Red, green or blue tiles'
+challengeType: 5
+forumTopicId: 301742
+dashedName: problem-116-red-green-or-blue-tiles
+---
+
+# --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.
+
+# --hints--
+
+`euler116()` should return 20492570929.
+
+```js
+assert.strictEqual(euler116(), 20492570929);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler116() {
+
+  return true;
+}
+
+euler116();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
new file mode 100644
index 0000000000..80f46d1201
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e21000cf542c50fef4
+title: 'Problem 117: Red, green, and blue tiles'
+challengeType: 5
+forumTopicId: 301743
+dashedName: problem-117-red-green-and-blue-tiles
+---
+
+# --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.
+
+# --hints--
+
+`euler117()` should return 100808458960497.
+
+```js
+assert.strictEqual(euler117(), 100808458960497);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler117() {
+
+  return true;
+}
+
+euler117();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
new file mode 100644
index 0000000000..8bcd4b5dcd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e21000cf542c50fef5
+title: 'Problem 118: Pandigital prime sets'
+challengeType: 5
+forumTopicId: 301744
+dashedName: problem-118-pandigital-prime-sets
+---
+
+# --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?
+
+# --hints--
+
+`euler118()` should return 44680.
+
+```js
+assert.strictEqual(euler118(), 44680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler118() {
+
+  return true;
+}
+
+euler118();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
new file mode 100644
index 0000000000..40853a1314
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e41000cf542c50fef6
+title: 'Problem 119: Digit power sum'
+challengeType: 5
+forumTopicId: 301745
+dashedName: problem-119-digit-power-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler119()` should return 248155780267521.
+
+```js
+assert.strictEqual(euler119(), 248155780267521);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler119() {
+
+  return true;
+}
+
+euler119();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
new file mode 100644
index 0000000000..b14276a81e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
@@ -0,0 +1,139 @@
+---
+id: 5900f3781000cf542c50fe8b
+title: 'Problem 12: Highly divisible triangular number'
+challengeType: 5
+forumTopicId: 301746
+dashedName: problem-12-highly-divisible-triangular-number
+---
+
+# --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:
+
+<div style='text-align: center;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
+
+Let us list the factors of the first seven triangle numbers:
+
+<div style='padding-left: 4em;'><b>1:</b> 1</div>
+<div style='padding-left: 4em;'><b>3:</b> 1, 3</div>
+<div style='padding-left: 4em;'><b>6:</b> 1, 2, 3, 6</div>
+<div style='padding-left: 4em;'><b>10:</b> 1, 2, 5, 10</div>
+<div style='padding-left: 4em;'><b>15:</b> 1, 3, 5, 15</div>
+<div style='padding-left: 4em;'><b>21:</b> 1, 3, 7, 21</div>
+<div style='padding-left: 4em;'><b>28:</b> 1, 2, 4, 7, 14, 28</div>
+
+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 `n` divisors?
+
+# --hints--
+
+`divisibleTriangleNumber(5)` should return a number.
+
+```js
+assert(typeof divisibleTriangleNumber(5) === 'number');
+```
+
+`divisibleTriangleNumber(5)` should return 28.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(5), 28);
+```
+
+`divisibleTriangleNumber(23)` should return 630.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(23), 630);
+```
+
+`divisibleTriangleNumber(167)` should return 1385280.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(167), 1385280);
+```
+
+`divisibleTriangleNumber(374)` should return 17907120.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(374), 17907120);
+```
+
+`divisibleTriangleNumber(500)` should return 76576500.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(500), 76576500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function divisibleTriangleNumber(n) {
+
+  return true;
+}
+
+divisibleTriangleNumber(500);
+```
+
+# --solutions--
+
+```js
+function divisibleTriangleNumber(n) {
+  if (n === 1) return 3;
+  let counter = 1;
+  let triangleNumber = counter++;
+
+
+ while (noOfFactors(triangleNumber) < n) {
+   triangleNumber += counter++;
+ }
+return triangleNumber;
+}
+
+function noOfFactors(num) {
+  const primeFactors = getPrimeFactors(num);
+  let prod = 1;
+  for(let p in primeFactors) {
+    prod *= (primeFactors[p] + 1)
+  }
+  return prod;
+}
+
+function getPrimeFactors(num) {
+  let n = num;
+  let primes = {};
+
+  let p = 2;
+  let sqrt = Math.sqrt(num);
+
+  function checkAndUpdate(inc) {
+    if (n % p === 0) {
+      const curr = primes[p];
+      if (curr) {
+        primes[p]++
+      } else {
+        primes[p] = 1;
+      }
+      n /= p;
+    } else {
+      p += inc;
+    }
+  }
+
+  while(p === 2 && p <= n) {
+    checkAndUpdate(1);
+  }
+
+  while (p <= n && p <= sqrt) {
+    checkAndUpdate(2);
+  }
+  if(Object.keys(primes).length === 0) {
+    primes[num] = 1;
+  } else if(n !== 1) {
+    primes[n] = 1;
+  }
+  return primes;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-120-square-remainders.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
new file mode 100644
index 0000000000..6bcf398e78
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3e41000cf542c50fef7
+title: 'Problem 120: Square remainders'
+challengeType: 5
+forumTopicId: 301747
+dashedName: problem-120-square-remainders
+---
+
+# --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.
+
+# --hints--
+
+`euler120()` should return 333082500.
+
+```js
+assert.strictEqual(euler120(), 333082500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler120() {
+
+  return true;
+}
+
+euler120();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
new file mode 100644
index 0000000000..1cc716c41c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e51000cf542c50fef8
+title: 'Problem 121: Disc game prize fund'
+challengeType: 5
+forumTopicId: 301748
+dashedName: problem-121-disc-game-prize-fund
+---
+
+# --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.
+
+# --hints--
+
+`euler121()` should return 2269.
+
+```js
+assert.strictEqual(euler121(), 2269);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler121() {
+
+  return true;
+}
+
+euler121();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
new file mode 100644
index 0000000000..7da1b4274e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -0,0 +1,52 @@
+---
+id: 5900f3e61000cf542c50fef9
+title: 'Problem 122: Efficient exponentiation'
+challengeType: 5
+forumTopicId: 301749
+dashedName: problem-122-efficient-exponentiation
+---
+
+# --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).
+
+# --hints--
+
+`euler122()` should return 1582.
+
+```js
+assert.strictEqual(euler122(), 1582);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler122() {
+
+  return true;
+}
+
+euler122();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
new file mode 100644
index 0000000000..cb7b7afda1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e71000cf542c50fefa
+title: 'Problem 123: Prime square remainders'
+challengeType: 5
+forumTopicId: 301750
+dashedName: problem-123-prime-square-remainders
+---
+
+# --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.
+
+# --hints--
+
+`euler123()` should return 21035.
+
+```js
+assert.strictEqual(euler123(), 21035);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler123() {
+
+  return true;
+}
+
+euler123();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
new file mode 100644
index 0000000000..1dfc34dc9b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3e81000cf542c50fefb
+title: 'Problem 124: Ordered radicals'
+challengeType: 5
+forumTopicId: 301751
+dashedName: problem-124-ordered-radicals
+---
+
+# --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).
+
+# --hints--
+
+`euler124()` should return 21417.
+
+```js
+assert.strictEqual(euler124(), 21417);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler124() {
+
+  return true;
+}
+
+euler124();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
new file mode 100644
index 0000000000..460f5e2a23
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3e91000cf542c50fefc
+title: 'Problem 125: Palindromic sums'
+challengeType: 5
+forumTopicId: 301752
+dashedName: problem-125-palindromic-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler125()` should return 2906969179.
+
+```js
+assert.strictEqual(euler125(), 2906969179);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler125() {
+
+  return true;
+}
+
+euler125();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
new file mode 100644
index 0000000000..fe9b4a6aa8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3ea1000cf542c50fefd
+title: 'Problem 126: Cuboid layers'
+challengeType: 5
+forumTopicId: 301753
+dashedName: problem-126-cuboid-layers
+---
+
+# --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.
+
+# --hints--
+
+`euler126()` should return 18522.
+
+```js
+assert.strictEqual(euler126(), 18522);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler126() {
+
+  return true;
+}
+
+euler126();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-127-abc-hits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
new file mode 100644
index 0000000000..665e17c0a7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
@@ -0,0 +1,62 @@
+---
+id: 5900f3ec1000cf542c50fefe
+title: 'Problem 127: abc-hits'
+challengeType: 5
+forumTopicId: 301754
+dashedName: problem-127-abc-hits
+---
+
+# --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 &lt; b
+
+a + b = c
+
+rad(abc) &lt; c
+
+For example, (5, 27, 32) is an abc-hit, because:
+
+GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
+
+5 &lt; 27
+
+5 + 27 = 32
+
+rad(4320) = 30 &lt; 32
+
+It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c &lt; 1000, with ∑c = 12523.
+
+Find ∑c for c &lt; 120000.
+
+# --hints--
+
+`euler127()` should return 18407904.
+
+```js
+assert.strictEqual(euler127(), 18407904);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler127() {
+
+  return true;
+}
+
+euler127();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
new file mode 100644
index 0000000000..7bdd624234
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3ec1000cf542c50feff
+title: 'Problem 128: Hexagonal tile differences'
+challengeType: 5
+forumTopicId: 301755
+dashedName: problem-128-hexagonal-tile-differences
+---
+
+# --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.
+
+# --hints--
+
+`euler128()` should return 14516824220.
+
+```js
+assert.strictEqual(euler128(), 14516824220);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler128() {
+
+  return true;
+}
+
+euler128();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
new file mode 100644
index 0000000000..0d8f6c2916
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ef1000cf542c50ff01
+title: 'Problem 129: Repunit divisibility'
+challengeType: 5
+forumTopicId: 301756
+dashedName: problem-129-repunit-divisibility
+---
+
+# --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.
+
+# --hints--
+
+`euler129()` should return 1000023.
+
+```js
+assert.strictEqual(euler129(), 1000023);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler129() {
+
+  return true;
+}
+
+euler129();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-13-large-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-13-large-sum.md
new file mode 100644
index 0000000000..05775850cf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-13-large-sum.md
@@ -0,0 +1,286 @@
+---
+id: 5900f37a1000cf542c50fe8c
+title: 'Problem 13: Large sum'
+challengeType: 5
+forumTopicId: 301757
+dashedName: problem-13-large-sum
+---
+
+# --description--
+
+Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
+
+<div style='padding-left: 4em;'>
+  37107287533902102798797998220837590246510135740250<br>
+  46376937677490009712648124896970078050417018260538<br>
+  74324986199524741059474233309513058123726617309629<br>
+  91942213363574161572522430563301811072406154908250<br>
+  23067588207539346171171980310421047513778063246676<br>
+  89261670696623633820136378418383684178734361726757<br>
+  28112879812849979408065481931592621691275889832738<br>
+  44274228917432520321923589422876796487670272189318<br>
+  47451445736001306439091167216856844588711603153276<br>
+  70386486105843025439939619828917593665686757934951<br>
+  62176457141856560629502157223196586755079324193331<br>
+  64906352462741904929101432445813822663347944758178<br>
+  92575867718337217661963751590579239728245598838407<br>
+  58203565325359399008402633568948830189458628227828<br>
+  80181199384826282014278194139940567587151170094390<br>
+  35398664372827112653829987240784473053190104293586<br>
+  86515506006295864861532075273371959191420517255829<br>
+  71693888707715466499115593487603532921714970056938<br>
+  54370070576826684624621495650076471787294438377604<br>
+  53282654108756828443191190634694037855217779295145<br>
+  36123272525000296071075082563815656710885258350721<br>
+  45876576172410976447339110607218265236877223636045<br>
+  17423706905851860660448207621209813287860733969412<br>
+  81142660418086830619328460811191061556940512689692<br>
+  51934325451728388641918047049293215058642563049483<br>
+  62467221648435076201727918039944693004732956340691<br>
+  15732444386908125794514089057706229429197107928209<br>
+  55037687525678773091862540744969844508330393682126<br>
+  18336384825330154686196124348767681297534375946515<br>
+  80386287592878490201521685554828717201219257766954<br>
+  78182833757993103614740356856449095527097864797581<br>
+  16726320100436897842553539920931837441497806860984<br>
+  48403098129077791799088218795327364475675590848030<br>
+  87086987551392711854517078544161852424320693150332<br>
+  59959406895756536782107074926966537676326235447210<br>
+  69793950679652694742597709739166693763042633987085<br>
+  41052684708299085211399427365734116182760315001271<br>
+  65378607361501080857009149939512557028198746004375<br>
+  35829035317434717326932123578154982629742552737307<br>
+  94953759765105305946966067683156574377167401875275<br>
+  88902802571733229619176668713819931811048770190271<br>
+  25267680276078003013678680992525463401061632866526<br>
+  36270218540497705585629946580636237993140746255962<br>
+  24074486908231174977792365466257246923322810917141<br>
+  91430288197103288597806669760892938638285025333403<br>
+  34413065578016127815921815005561868836468420090470<br>
+  23053081172816430487623791969842487255036638784583<br>
+  11487696932154902810424020138335124462181441773470<br>
+  63783299490636259666498587618221225225512486764533<br>
+  67720186971698544312419572409913959008952310058822<br>
+  95548255300263520781532296796249481641953868218774<br>
+  76085327132285723110424803456124867697064507995236<br>
+  37774242535411291684276865538926205024910326572967<br>
+  23701913275725675285653248258265463092207058596522<br>
+  29798860272258331913126375147341994889534765745501<br>
+  18495701454879288984856827726077713721403798879715<br>
+  38298203783031473527721580348144513491373226651381<br>
+  34829543829199918180278916522431027392251122869539<br>
+  40957953066405232632538044100059654939159879593635<br>
+  29746152185502371307642255121183693803580388584903<br>
+  41698116222072977186158236678424689157993532961922<br>
+  62467957194401269043877107275048102390895523597457<br>
+  23189706772547915061505504953922979530901129967519<br>
+  86188088225875314529584099251203829009407770775672<br>
+  11306739708304724483816533873502340845647058077308<br>
+  82959174767140363198008187129011875491310547126581<br>
+  97623331044818386269515456334926366572897563400500<br>
+  42846280183517070527831839425882145521227251250327<br>
+  55121603546981200581762165212827652751691296897789<br>
+  32238195734329339946437501907836945765883352399886<br>
+  75506164965184775180738168837861091527357929701337<br>
+  62177842752192623401942399639168044983993173312731<br>
+  32924185707147349566916674687634660915035914677504<br>
+  99518671430235219628894890102423325116913619626622<br>
+  73267460800591547471830798392868535206946944540724<br>
+  76841822524674417161514036427982273348055556214818<br>
+  97142617910342598647204516893989422179826088076852<br>
+  87783646182799346313767754307809363333018982642090<br>
+  10848802521674670883215120185883543223812876952786<br>
+  71329612474782464538636993009049310363619763878039<br>
+  62184073572399794223406235393808339651327408011116<br>
+  66627891981488087797941876876144230030984490851411<br>
+  60661826293682836764744779239180335110989069790714<br>
+  85786944089552990653640447425576083659976645795096<br>
+  66024396409905389607120198219976047599490197230297<br>
+  64913982680032973156037120041377903785566085089252<br>
+  16730939319872750275468906903707539413042652315011<br>
+  94809377245048795150954100921645863754710598436791<br>
+  78639167021187492431995700641917969777599028300699<br>
+  15368713711936614952811305876380278410754449733078<br>
+  40789923115535562561142322423255033685442488917353<br>
+  44889911501440648020369068063960672322193204149535<br>
+  41503128880339536053299340368006977710650566631954<br>
+  81234880673210146739058568557934581403627822703280<br>
+  82616570773948327592232845941706525094512325230608<br>
+  22918802058777319719839450180888072429661980811197<br>
+  77158542502016545090413245809786882778948721859617<br>
+  72107838435069186155435662884062257473692284509516<br>
+  20849603980134001723930671666823555245252804609722<br>
+  53503534226472524250874054075591789781264330331690<br>
+</div>
+
+# --hints--
+
+`largeSum(testNums)` should return a number.
+
+```js
+assert(typeof largeSum(testNums) === 'number');
+```
+
+`largeSum(testNums)` should return 8348422521.
+
+```js
+assert.strictEqual(largeSum(testNums), 8348422521);
+```
+
+`largeSum(fiftyDigitNums)` should return 5537376230.
+
+```js
+assert.strictEqual(largeSum(fiftyDigitNums), 5537376230);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const fiftyDigitNums = [
+  '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'
+];
+
+const testNums = [
+  '37107287533902102798797998220837590246510135740250',
+  '46376937677490009712648124896970078050417018260538'
+];
+```
+
+## --seed-contents--
+
+```js
+function largeSum(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testNums = [
+  '37107287533902102798797998220837590246510135740250',
+  '46376937677490009712648124896970078050417018260538'
+];
+
+largeSum(testNums);
+```
+
+# --solutions--
+
+```js
+function largeSum(arr) {
+
+  let sum = 0;
+
+  arr.forEach(function(num) {
+    sum += parseInt(num, 10);
+  });
+
+  sum = sum.toString(10);
+
+  sum = sum.substr(0, 1) + sum.substr(2);
+
+  let firstTen = sum.slice(0, 10);
+  return parseInt(firstTen, 10);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
new file mode 100644
index 0000000000..0f3c2c7a3c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3ee1000cf542c50ff00
+title: 'Problem 130: Composites with prime repunit property'
+challengeType: 5
+forumTopicId: 301758
+dashedName: problem-130-composites-with-prime-repunit-property
+---
+
+# --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).
+
+# --hints--
+
+`euler130()` should return 149253.
+
+```js
+assert.strictEqual(euler130(), 149253);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler130() {
+
+  return true;
+}
+
+euler130();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
new file mode 100644
index 0000000000..729f8689fb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ef1000cf542c50ff02
+title: 'Problem 131: Prime cube partnership'
+challengeType: 5
+forumTopicId: 301759
+dashedName: problem-131-prime-cube-partnership
+---
+
+# --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?
+
+# --hints--
+
+`euler131()` should return 173.
+
+```js
+assert.strictEqual(euler131(), 173);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler131() {
+
+  return true;
+}
+
+euler131();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
new file mode 100644
index 0000000000..d71927659b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f11000cf542c50ff03
+title: 'Problem 132: Large repunit factors'
+challengeType: 5
+forumTopicId: 301760
+dashedName: problem-132-large-repunit-factors
+---
+
+# --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).
+
+# --hints--
+
+`euler132()` should return 843296.
+
+```js
+assert.strictEqual(euler132(), 843296);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler132() {
+
+  return true;
+}
+
+euler132();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
new file mode 100644
index 0000000000..649dd7f1f3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f21000cf542c50ff04
+title: 'Problem 133: Repunit nonfactors'
+challengeType: 5
+forumTopicId: 301761
+dashedName: problem-133-repunit-nonfactors
+---
+
+# --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).
+
+# --hints--
+
+`euler133()` should return 453647705.
+
+```js
+assert.strictEqual(euler133(), 453647705);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler133() {
+
+  return true;
+}
+
+euler133();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
new file mode 100644
index 0000000000..a21b71ea01
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f21000cf542c50ff05
+title: 'Problem 134: Prime pair connection'
+challengeType: 5
+forumTopicId: 301762
+dashedName: problem-134-prime-pair-connection
+---
+
+# --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.
+
+# --hints--
+
+`euler134()` should return 18613426663617120.
+
+```js
+assert.strictEqual(euler134(), 18613426663617120);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler134() {
+
+  return true;
+}
+
+euler134();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-135-same-differences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-135-same-differences.md
new file mode 100644
index 0000000000..f0de3b5c58
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-135-same-differences.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f31000cf542c50ff06
+title: 'Problem 135: Same differences'
+challengeType: 5
+forumTopicId: 301763
+dashedName: problem-135-same-differences
+---
+
+# --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?
+
+# --hints--
+
+`euler135()` should return 4989.
+
+```js
+assert.strictEqual(euler135(), 4989);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler135() {
+
+  return true;
+}
+
+euler135();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
new file mode 100644
index 0000000000..34fda8a4ee
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f51000cf542c50ff07
+title: 'Problem 136: Singleton difference'
+challengeType: 5
+forumTopicId: 301764
+dashedName: problem-136-singleton-difference
+---
+
+# --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?
+
+# --hints--
+
+`euler136()` should return 2544559.
+
+```js
+assert.strictEqual(euler136(), 2544559);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler136() {
+
+  return true;
+}
+
+euler136();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
new file mode 100644
index 0000000000..2863f66aa1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3f51000cf542c50ff08
+title: 'Problem 137: Fibonacci golden nuggets'
+challengeType: 5
+forumTopicId: 301765
+dashedName: problem-137-fibonacci-golden-nuggets
+---
+
+# --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.
+
+# --hints--
+
+`euler137()` should return 1120149658760.
+
+```js
+assert.strictEqual(euler137(), 1120149658760);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler137() {
+
+  return true;
+}
+
+euler137();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
new file mode 100644
index 0000000000..5675e1f938
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3f61000cf542c50ff09
+title: 'Problem 138: Special isosceles triangles'
+challengeType: 5
+forumTopicId: 301766
+dashedName: problem-138-special-isosceles-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler138()` should return 1118049290473932.
+
+```js
+assert.strictEqual(euler138(), 1118049290473932);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler138() {
+
+  return true;
+}
+
+euler138();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
new file mode 100644
index 0000000000..800c0ccbab
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f71000cf542c50ff0a
+title: 'Problem 139: Pythagorean tiles'
+challengeType: 5
+forumTopicId: 301767
+dashedName: problem-139-pythagorean-tiles
+---
+
+# --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?
+
+# --hints--
+
+`euler139()` should return 10057761.
+
+```js
+assert.strictEqual(euler139(), 10057761);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler139() {
+
+  return true;
+}
+
+euler139();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
new file mode 100644
index 0000000000..807f362857
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
@@ -0,0 +1,111 @@
+---
+id: 5900f37a1000cf542c50fe8d
+title: 'Problem 14: Longest Collatz sequence'
+challengeType: 5
+forumTopicId: 301768
+dashedName: problem-14-longest-collatz-sequence
+---
+
+# --description--
+
+The following iterative sequence is defined for the set of positive integers:
+
+<div style='padding-left: 4em;'><var>n</var> → <var>n</var>/2 (<var>n</var> is even)</div>
+
+<div style='padding-left: 4em;'><var>n</var> → 3<var>n</var> + 1 (<var>n</var> is odd)</div>
+
+Using the rule above and starting with 13, we generate the following sequence:
+
+<div style='text-align: center;'>13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1</div>
+
+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 the given `limit`, produces the longest chain?
+
+**Note:** Once the chain starts the terms are allowed to go above one million.
+
+# --hints--
+
+`longestCollatzSequence(14)` should return a number.
+
+```js
+assert(typeof longestCollatzSequence(14) === 'number');
+```
+
+`longestCollatzSequence(14)` should return 9.
+
+```js
+assert.strictEqual(longestCollatzSequence(14), 9);
+```
+
+`longestCollatzSequence(5847)` should return 3711.
+
+```js
+assert.strictEqual(longestCollatzSequence(5847), 3711);
+```
+
+`longestCollatzSequence(46500)` should return 35655.
+
+```js
+assert.strictEqual(longestCollatzSequence(46500), 35655);
+```
+
+`longestCollatzSequence(54512)` should return 52527.
+
+```js
+assert.strictEqual(longestCollatzSequence(54512), 52527);
+```
+
+`longestCollatzSequence(100000)` should return 77031.
+
+```js
+assert.strictEqual(longestCollatzSequence(100000), 77031);
+```
+
+`longestCollatzSequence(1000000)` should return 837799.
+
+```js
+assert.strictEqual(longestCollatzSequence(1000000), 837799);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function longestCollatzSequence(limit) {
+
+  return true;
+}
+
+longestCollatzSequence(14);
+```
+
+# --solutions--
+
+```js
+function longestCollatzSequence(limit) {
+  let longest = 1;
+  let maxLength = 1;
+  for (let i = Math.floor(limit / 2); i < limit; i++) {
+    let len = colLen(i);
+    if (len > maxLength) {
+      longest = i;
+      maxLength = len;
+    }
+  }
+  return longest;
+}
+
+const knownSequence = { '1': 1 };
+
+function colLen(n) {
+  if (knownSequence[n]) {
+    return knownSequence[n];
+  } else {
+    const len = n % 2 === 0 ? colLen(n / 2) + 1 : colLen((3 * n + 1) / 2) + 2;
+    knownSequence[n] = len;
+    return len;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
new file mode 100644
index 0000000000..01664be7ae
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3fa1000cf542c50ff0c
+title: 'Problem 140: Modified Fibonacci golden nuggets'
+challengeType: 5
+forumTopicId: 301769
+dashedName: problem-140-modified-fibonacci-golden-nuggets
+---
+
+# --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.
+
+# --hints--
+
+`euler140()` should return 5673835352990.
+
+```js
+assert.strictEqual(euler140(), 5673835352990);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler140() {
+
+  return true;
+}
+
+euler140();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
new file mode 100644
index 0000000000..4bcd7e069a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3f91000cf542c50ff0b
+title: 'Problem 141: Investigating progressive numbers, n, which are also square'
+challengeType: 5
+forumTopicId: 301770
+dashedName: problem-141-investigating-progressive-numbers-n-which-are-also-square
+---
+
+# --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).
+
+# --hints--
+
+`euler141()` should return 878454337159.
+
+```js
+assert.strictEqual(euler141(), 878454337159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler141() {
+
+  return true;
+}
+
+euler141();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
new file mode 100644
index 0000000000..03d921eac9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
@@ -0,0 +1,38 @@
+---
+id: 5900f3fa1000cf542c50ff0d
+title: 'Problem 142: Perfect Square Collection'
+challengeType: 5
+forumTopicId: 301771
+dashedName: problem-142-perfect-square-collection
+---
+
+# --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.
+
+# --hints--
+
+`euler142()` should return 1006193.
+
+```js
+assert.strictEqual(euler142(), 1006193);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler142() {
+
+  return true;
+}
+
+euler142();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
new file mode 100644
index 0000000000..fd11d827b7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3fc1000cf542c50ff0e
+title: 'Problem 143: Investigating the Torricelli point of a triangle'
+challengeType: 5
+forumTopicId: 301772
+dashedName: problem-143-investigating-the-torricelli-point-of-a-triangle
+---
+
+# --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.
+
+# --hints--
+
+`euler143()` should return 30758397.
+
+```js
+assert.strictEqual(euler143(), 30758397);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler143() {
+
+  return true;
+}
+
+euler143();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
new file mode 100644
index 0000000000..88d8b1e5a8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3fc1000cf542c50ff0f
+title: 'Problem 144: Investigating multiple reflections of a laser beam'
+challengeType: 5
+forumTopicId: 301773
+dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
+---
+
+# --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?
+
+# --hints--
+
+`euler144()` should return 354.
+
+```js
+assert.strictEqual(euler144(), 354);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler144() {
+
+  return true;
+}
+
+euler144();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
new file mode 100644
index 0000000000..0ec3679a6f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3fd1000cf542c50ff10
+title: 'Problem 145: How many reversible numbers are there below one-billion?'
+challengeType: 5
+forumTopicId: 301774
+dashedName: problem-145-how-many-reversible-numbers-are-there-below-one-billion
+---
+
+# --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)?
+
+# --hints--
+
+`euler145()` should return 608720.
+
+```js
+assert.strictEqual(euler145(), 608720);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler145() {
+
+  return true;
+}
+
+euler145();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
new file mode 100644
index 0000000000..ddfec6766b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3fe1000cf542c50ff11
+title: 'Problem 146: Investigating a Prime Pattern'
+challengeType: 5
+forumTopicId: 301775
+dashedName: problem-146-investigating-a-prime-pattern
+---
+
+# --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?
+
+# --hints--
+
+`euler146()` should return 676333270.
+
+```js
+assert.strictEqual(euler146(), 676333270);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler146() {
+
+  return true;
+}
+
+euler146();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
new file mode 100644
index 0000000000..3b422811f6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ff1000cf542c50ff12
+title: 'Problem 147: Rectangles in cross-hatched grids'
+challengeType: 5
+forumTopicId: 301776
+dashedName: problem-147-rectangles-in-cross-hatched-grids
+---
+
+# --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?
+
+# --hints--
+
+`euler147()` should return 846910284.
+
+```js
+assert.strictEqual(euler147(), 846910284);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler147() {
+
+  return true;
+}
+
+euler147();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
new file mode 100644
index 0000000000..13babe893b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4021000cf542c50ff14
+title: 'Problem 148: Exploring Pascal''s triangle'
+challengeType: 5
+forumTopicId: 301777
+dashedName: problem-148-exploring-pascals-triangle
+---
+
+# --description--
+
+We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
+
+<pre>
+            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
+</pre>
+
+However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7.
+
+# --instructions--
+
+Find the number of entries which are not divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.
+
+# --hints--
+
+`euler148()` should return 2129970655314432.
+
+```js
+assert.strictEqual(euler148(), 2129970655314432);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler148() {
+
+  return true;
+}
+
+euler148();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
new file mode 100644
index 0000000000..c76d5370c2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4021000cf542c50ff13
+title: 'Problem 149: Searching for a maximum-sum subsequence'
+challengeType: 5
+forumTopicId: 301778
+dashedName: problem-149-searching-for-a-maximum-sum-subsequence
+---
+
+# --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).
+
+# --hints--
+
+`euler149()` should return 52852124.
+
+```js
+assert.strictEqual(euler149(), 52852124);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler149() {
+
+  return true;
+}
+
+euler149();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
new file mode 100644
index 0000000000..b3b0a499c3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
@@ -0,0 +1,68 @@
+---
+id: 5900f37b1000cf542c50fe8e
+title: 'Problem 15: Lattice paths'
+challengeType: 5
+forumTopicId: 301780
+dashedName: problem-15-lattice-paths
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;">
+
+How many such routes are there through a given `gridSize`?
+
+# --hints--
+
+`latticePaths(4)` should return a number.
+
+```js
+assert(typeof latticePaths(4) === 'number');
+```
+
+`latticePaths(4)` should return 70.
+
+```js
+assert.strictEqual(latticePaths(4), 70);
+```
+
+`latticePaths(9)` should return 48620.
+
+```js
+assert.strictEqual(latticePaths(9), 48620);
+```
+
+`latticePaths(20)` should return 137846528820.
+
+```js
+assert.strictEqual(latticePaths(20), 137846528820);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function latticePaths(gridSize) {
+
+  return true;
+}
+
+latticePaths(4);
+```
+
+# --solutions--
+
+```js
+function latticePaths(gridSize) {
+  let paths = 1;
+
+  for (let i = 0; i < gridSize; i++) {
+    paths *= (2 * gridSize) - i;
+    paths /= i + 1;
+  }
+  return paths;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
new file mode 100644
index 0000000000..b632361a8b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4031000cf542c50ff15
+title: >-
+  Problem 150: Searching a triangular array for a sub-triangle having
+  minimum-sum
+challengeType: 5
+forumTopicId: 301781
+dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler150()` should return -271248680.
+
+```js
+assert.strictEqual(euler150(), -271248680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler150() {
+
+  return true;
+}
+
+euler150();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
new file mode 100644
index 0000000000..e75e5a0fdf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4031000cf542c50ff16
+title: 'Problem 151: Paper sheets of standard sizes: an expected-value problem'
+challengeType: 5
+forumTopicId: 301782
+dashedName: problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem
+---
+
+# --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 .
+
+# --hints--
+
+`euler151()` should return 0.464399.
+
+```js
+assert.strictEqual(euler151(), 0.464399);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler151() {
+
+  return true;
+}
+
+euler151();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
new file mode 100644
index 0000000000..1acd9f0652
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4041000cf542c50ff17
+title: 'Problem 152: Writing one half as a sum of inverse squares'
+challengeType: 5
+forumTopicId: 301783
+dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares
+---
+
+# --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?
+
+# --hints--
+
+`euler152()` should return 301.
+
+```js
+assert.strictEqual(euler152(), 301);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler152() {
+
+  return true;
+}
+
+euler152();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
new file mode 100644
index 0000000000..b1eaa92c44
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -0,0 +1,70 @@
+---
+id: 5900f4051000cf542c50ff18
+title: 'Problem 153: Investigating Gaussian Integers'
+challengeType: 5
+forumTopicId: 301784
+dashedName: problem-153-investigating-gaussian-integers
+---
+
+# --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?
+
+# --hints--
+
+`euler153()` should return 17971254122360636.
+
+```js
+assert.strictEqual(euler153(), 17971254122360636);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler153() {
+
+  return true;
+}
+
+euler153();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
new file mode 100644
index 0000000000..8d8abe0dfc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4071000cf542c50ff19
+title: 'Problem 154: Exploring Pascal''s pyramid'
+challengeType: 5
+forumTopicId: 301785
+dashedName: problem-154-exploring-pascals-pyramid
+---
+
+# --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?
+
+# --hints--
+
+`euler154()` should return 479742450.
+
+```js
+assert.strictEqual(euler154(), 479742450);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler154() {
+
+  return true;
+}
+
+euler154();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
new file mode 100644
index 0000000000..404c223c6a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4081000cf542c50ff1a
+title: 'Problem 155: Counting Capacitor Circuits'
+challengeType: 5
+forumTopicId: 301786
+dashedName: problem-155-counting-capacitor-circuits
+---
+
+# --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:
+
+# --hints--
+
+`euler155()` should return 3857447.
+
+```js
+assert.strictEqual(euler155(), 3857447);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler155() {
+
+  return true;
+}
+
+euler155();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
new file mode 100644
index 0000000000..3ab75c957b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4091000cf542c50ff1b
+title: 'Problem 156: Counting Digits'
+challengeType: 5
+forumTopicId: 301787
+dashedName: problem-156-counting-digits
+---
+
+# --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.
+
+# --hints--
+
+`euler156()` should return 21295121502550.
+
+```js
+assert.strictEqual(euler156(), 21295121502550);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler156() {
+
+  return true;
+}
+
+euler156();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
new file mode 100644
index 0000000000..fa1e327051
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -0,0 +1,82 @@
+---
+id: 5900f4091000cf542c50ff1c
+title: 'Problem 157: Solving the diophantine equation'
+challengeType: 5
+forumTopicId: 301788
+dashedName: problem-157-solving-the-diophantine-equation
+---
+
+# --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?
+
+# --hints--
+
+`euler157()` should return 53490.
+
+```js
+assert.strictEqual(euler157(), 53490);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler157() {
+
+  return true;
+}
+
+euler157();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
new file mode 100644
index 0000000000..c447c7ce9f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -0,0 +1,55 @@
+---
+id: 5900f40a1000cf542c50ff1d
+title: >-
+  Problem 158: Exploring strings for which only one character comes
+  lexicographically after its neighbour to the left
+challengeType: 5
+forumTopicId: 301789
+dashedName: >-
+  problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left
+---
+
+# --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)?
+
+# --hints--
+
+`euler158()` should return 409511334375.
+
+```js
+assert.strictEqual(euler158(), 409511334375);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler158() {
+
+  return true;
+}
+
+euler158();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
new file mode 100644
index 0000000000..b5e3b4945b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -0,0 +1,44 @@
+---
+id: 5900f40c1000cf542c50ff1e
+title: 'Problem 159: Digital root sums of factorisations'
+challengeType: 5
+forumTopicId: 301790
+dashedName: problem-159-digital-root-sums-of-factorisations
+---
+
+# --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 &lt; n &lt; 1,000,000.
+
+# --hints--
+
+`euler159()` should return 14489159.
+
+```js
+assert.strictEqual(euler159(), 14489159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler159() {
+
+  return true;
+}
+
+euler159();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
new file mode 100644
index 0000000000..b71b480082
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
@@ -0,0 +1,85 @@
+---
+id: 5900f37d1000cf542c50fe8f
+title: 'Problem 16: Power digit sum'
+challengeType: 5
+forumTopicId: 301791
+dashedName: problem-16-power-digit-sum
+---
+
+# --description--
+
+2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+
+What is the sum of the digits of the number 2<sup><code>exponent</code></sup>?
+
+# --hints--
+
+`powerDigitSum(15)` should return a number.
+
+```js
+assert(typeof powerDigitSum(15) === 'number');
+```
+
+`powerDigitSum(15)` should return 26.
+
+```js
+assert.strictEqual(powerDigitSum(15), 26);
+```
+
+`powerDigitSum(128)` should return 166.
+
+```js
+assert.strictEqual(powerDigitSum(128), 166);
+```
+
+`powerDigitSum(1000)` should return 1366.
+
+```js
+assert.strictEqual(powerDigitSum(1000), 1366);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerDigitSum(exponent) {
+
+  return true;
+}
+
+powerDigitSum(15);
+```
+
+# --solutions--
+
+```js
+function powerDigitSum(exponent) {
+  const bigNum = [1];
+  let sum = 0;
+
+  for (let i = 1; i <= exponent; i++) {
+    let count = bigNum.length + 1;
+    let overflow = 0;
+    for (let j = 0; j < count; j++) {
+      let digit = bigNum[j] || 0;
+      digit = 2 * digit + overflow;
+
+      if (digit > 9) {
+        digit -= 10;
+        overflow = 1;
+      } else {
+        overflow = 0;
+      }
+
+      bigNum[j] = digit;
+    }
+  }
+
+  bigNum.forEach(function(num) {
+    return sum += num;
+  });
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
new file mode 100644
index 0000000000..c7319ba84c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -0,0 +1,48 @@
+---
+id: 5900f40d1000cf542c50ff1f
+title: 'Problem 160: Factorial trailing digits'
+challengeType: 5
+forumTopicId: 301794
+dashedName: problem-160-factorial-trailing-digits
+---
+
+# --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)
+
+# --hints--
+
+`euler160()` should return 16576.
+
+```js
+assert.strictEqual(euler160(), 16576);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler160() {
+
+  return true;
+}
+
+euler160();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-161-triominoes.md
new file mode 100644
index 0000000000..ea369bae60
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -0,0 +1,46 @@
+---
+id: 5900f40d1000cf542c50ff20
+title: 'Problem 161: Triominoes'
+challengeType: 5
+forumTopicId: 301795
+dashedName: problem-161-triominoes
+---
+
+# --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?
+
+# --hints--
+
+`euler161()` should return 20574308184277972.
+
+```js
+assert.strictEqual(euler161(), 20574308184277972);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler161() {
+
+  return true;
+}
+
+euler161();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
new file mode 100644
index 0000000000..53a6bcd772
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
@@ -0,0 +1,52 @@
+---
+id: 5900f40e1000cf542c50ff21
+title: 'Problem 162: Hexadecimal numbers'
+challengeType: 5
+forumTopicId: 301796
+dashedName: problem-162-hexadecimal-numbers
+---
+
+# --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)
+
+# --hints--
+
+`euler162()` should return 3D58725572C62302.
+
+```js
+assert.strictEqual(euler162(), '3D58725572C62302');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler162() {
+
+  return true;
+}
+
+euler162();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
new file mode 100644
index 0000000000..72ed1158b1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f40f1000cf542c50ff22
+title: 'Problem 163: Cross-hatched triangles'
+challengeType: 5
+forumTopicId: 301797
+dashedName: problem-163-cross-hatched-triangles
+---
+
+# --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).
+
+# --hints--
+
+`euler163()` should return 343047.
+
+```js
+assert.strictEqual(euler163(), 343047);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler163() {
+
+  return true;
+}
+
+euler163();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
new file mode 100644
index 0000000000..e511646823
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -0,0 +1,41 @@
+---
+id: 5900f4111000cf542c50ff23
+title: >-
+  Problem 164: Numbers for which no three consecutive digits have a sum greater
+  than a given value
+challengeType: 5
+forumTopicId: 301798
+dashedName: >-
+  problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value
+---
+
+# --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?
+
+# --hints--
+
+`euler164()` should return 378158756814587.
+
+```js
+assert.strictEqual(euler164(), 378158756814587);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler164() {
+
+  return true;
+}
+
+euler164();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-165-intersections.md
new file mode 100644
index 0000000000..a98373c338
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4111000cf542c50ff24
+title: 'Problem 165: Intersections'
+challengeType: 5
+forumTopicId: 301799
+dashedName: problem-165-intersections
+---
+
+# --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?
+
+# --hints--
+
+`euler165()` should return 2868868.
+
+```js
+assert.strictEqual(euler165(), 2868868);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler165() {
+
+  return true;
+}
+
+euler165();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
new file mode 100644
index 0000000000..9f1db5cea4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4131000cf542c50ff25
+title: 'Problem 166: Criss Cross'
+challengeType: 5
+forumTopicId: 301800
+dashedName: problem-166-criss-cross
+---
+
+# --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?
+
+# --hints--
+
+`euler166()` should return 7130034.
+
+```js
+assert.strictEqual(euler166(), 7130034);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler166() {
+
+  return true;
+}
+
+euler166();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
new file mode 100644
index 0000000000..6f30b4b272
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4141000cf542c50ff26
+title: 'Problem 167: Investigating Ulam sequences'
+challengeType: 5
+forumTopicId: 301801
+dashedName: problem-167-investigating-ulam-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler167()` should return 3916160068885.
+
+```js
+assert.strictEqual(euler167(), 3916160068885);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler167() {
+
+  return true;
+}
+
+euler167();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
new file mode 100644
index 0000000000..9ad5f78e64
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4151000cf542c50ff27
+title: 'Problem 168: Number Rotations'
+challengeType: 5
+forumTopicId: 301802
+dashedName: problem-168-number-rotations
+---
+
+# --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 &lt; n &lt; 10100, that have this property.
+
+# --hints--
+
+`euler168()` should return 59206.
+
+```js
+assert.strictEqual(euler168(), 59206);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler168() {
+
+  return true;
+}
+
+euler168();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
new file mode 100644
index 0000000000..0cfb0034f4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4151000cf542c50ff28
+title: >-
+  Problem 169: Exploring the number of different ways a number can be expressed
+  as a sum of powers of 2
+challengeType: 5
+forumTopicId: 301803
+dashedName: >-
+  problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
+---
+
+# --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)?
+
+# --hints--
+
+`euler169()` should return 178653872807.
+
+```js
+assert.strictEqual(euler169(), 178653872807);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler169() {
+
+  return true;
+}
+
+euler169();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
new file mode 100644
index 0000000000..2b096d1d78
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
@@ -0,0 +1,130 @@
+---
+id: 5900f37d1000cf542c50fe90
+title: 'Problem 17: Number letter counts'
+challengeType: 5
+forumTopicId: 301804
+dashedName: problem-17-number-letter-counts
+---
+
+# --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 given `limit` 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.
+
+# --hints--
+
+`numberLetterCounts(5)` should return a number.
+
+```js
+assert(typeof numberLetterCounts(5) === 'number');
+```
+
+`numberLetterCounts(5)` should return 19.
+
+```js
+assert.strictEqual(numberLetterCounts(5), 19);
+```
+
+`numberLetterCounts(150)` should return 1903.
+
+```js
+assert.strictEqual(numberLetterCounts(150), 1903);
+```
+
+`numberLetterCounts(1000)` should return 21124.
+
+```js
+assert.strictEqual(numberLetterCounts(1000), 21124);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function numberLetterCounts(limit) {
+
+  return true;
+}
+
+numberLetterCounts(5);
+```
+
+# --solutions--
+
+```js
+function numberLetterCounts(limit) {
+  const dictionary = {
+    0: '',
+    1: 'one',
+    2: 'two',
+    3: 'three',
+    4: 'four',
+    5: 'five',
+    6: 'six',
+    7: 'seven',
+    8: 'eight',
+    9: 'nine',
+    10: 'ten',
+    11: 'eleven',
+    12: 'twelve',
+    13: 'thirteen',
+    14: 'fourteen',
+    15: 'fifteen',
+    16: 'sixteen',
+    17: 'seventeen',
+    18: 'eighteen',
+    19: 'nineteen',
+    20: 'twenty',
+    30: 'thirty',
+    40: 'forty',
+    50: 'fifty',
+    60: 'sixty',
+    70: 'seventy',
+    80: 'eighty',
+    90: 'ninety',
+    1000: 'onethousand'
+  };
+
+  let numString = '';
+
+  function convertToString(num) {
+    // check dictionary for number
+    if (dictionary[num]) {
+      return dictionary[num];
+    } else {
+      const hundreds = Math.floor(num / 100);
+      const tens =  Math.floor((num / 10) % 10) * 10;
+      const remainder = num % 10;
+
+      let tempStr = '';
+
+      if (hundreds === 0) {
+        tempStr += dictionary[tens] + dictionary[remainder];
+      } else {
+        tempStr += dictionary[hundreds] + 'hundred';
+
+        if (tens !== 0 || remainder !== 0) {
+          tempStr += 'and';
+        }
+
+        if (tens < 20) {
+          const lessThanTwenty = tens + remainder;
+          tempStr += dictionary[lessThanTwenty];
+        } else {
+          tempStr += dictionary[tens] + dictionary[remainder];
+        }
+      }
+      return tempStr;
+    }
+  }
+
+  for (let i = 1; i <= limit; i++) {
+    numString += convertToString(i);
+  }
+  return numString.length;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
new file mode 100644
index 0000000000..f12d0490f2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4161000cf542c50ff29
+title: >-
+  Problem 170: Find the largest 0 to 9 pandigital that can be formed by
+  concatenating products
+challengeType: 5
+forumTopicId: 301805
+dashedName: >-
+  problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products
+---
+
+# --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?
+
+# --hints--
+
+`euler170()` should return 9857164023.
+
+```js
+assert.strictEqual(euler170(), 9857164023);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler170() {
+
+  return true;
+}
+
+euler170();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
new file mode 100644
index 0000000000..d03ddf909b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4181000cf542c50ff2a
+title: >-
+  Problem 171: Finding numbers for which the sum of the squares of the digits is
+  a square
+challengeType: 5
+forumTopicId: 301806
+dashedName: >-
+  problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
+---
+
+# --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 &lt; n &lt; 1020, such that f(n) is a perfect square.
+
+# --hints--
+
+`euler171()` should return 142989277.
+
+```js
+assert.strictEqual(euler171(), 142989277);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler171() {
+
+  return true;
+}
+
+euler171();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
new file mode 100644
index 0000000000..a25ab3224f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4181000cf542c50ff2b
+title: 'Problem 172: Investigating numbers with few repeated digits'
+challengeType: 5
+forumTopicId: 301807
+dashedName: problem-172-investigating-numbers-with-few-repeated-digits
+---
+
+# --description--
+
+How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
+
+# --hints--
+
+`euler172()` should return 227485267000992000.
+
+```js
+assert.strictEqual(euler172(), 227485267000992000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler172() {
+
+  return true;
+}
+
+euler172();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
new file mode 100644
index 0000000000..a07789fd1d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
@@ -0,0 +1,43 @@
+---
+id: 5900f41a1000cf542c50ff2c
+title: >-
+  Problem 173: Using up to one million tiles how many different "hollow" square
+  laminae can be formed?
+challengeType: 5
+forumTopicId: 301808
+dashedName: >-
+  problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed
+---
+
+# --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?
+
+# --hints--
+
+`euler173()` should return 1572729.
+
+```js
+assert.strictEqual(euler173(), 1572729);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler173() {
+
+  return true;
+}
+
+euler173();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
new file mode 100644
index 0000000000..e7183612d5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -0,0 +1,45 @@
+---
+id: 5900f41a1000cf542c50ff2d
+title: >-
+  Problem 174: Counting the number of "hollow" square laminae that can form one,
+  two, three, ... distinct arrangements
+challengeType: 5
+forumTopicId: 301809
+dashedName: >-
+  problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements
+---
+
+# --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?
+
+# --hints--
+
+`euler174()` should return 209566.
+
+```js
+assert.strictEqual(euler174(), 209566);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler174() {
+
+  return true;
+}
+
+euler174();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
new file mode 100644
index 0000000000..8f32fcb4bd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -0,0 +1,45 @@
+---
+id: 5900f41c1000cf542c50ff2e
+title: >-
+  Problem 175: Fractions involving the number of different ways a number can be
+  expressed as a sum of powers of 2
+challengeType: 5
+forumTopicId: 301810
+dashedName: >-
+  problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
+---
+
+# --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.
+
+# --hints--
+
+`euler175()` should return 1, 13717420, 8.
+
+```js
+assert.strictEqual(euler175(), 1, 13717420, 8);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler175() {
+
+  return true;
+}
+
+euler175();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
new file mode 100644
index 0000000000..c3b6c090fe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
@@ -0,0 +1,40 @@
+---
+id: 5900f41c1000cf542c50ff2f
+title: 'Problem 176: Right-angled triangles that share a cathetus'
+challengeType: 5
+forumTopicId: 301811
+dashedName: problem-176-right-angled-triangles-that-share-a-cathetus
+---
+
+# --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.
+
+# --hints--
+
+`euler176()` should return 96818198400000.
+
+```js
+assert.strictEqual(euler176(), 96818198400000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler176() {
+
+  return true;
+}
+
+euler176();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
new file mode 100644
index 0000000000..2e39114654
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -0,0 +1,40 @@
+---
+id: 5900f41e1000cf542c50ff30
+title: 'Problem 177: Integer angled Quadrilaterals'
+challengeType: 5
+forumTopicId: 301812
+dashedName: problem-177-integer-angled-quadrilaterals
+---
+
+# --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.
+
+# --hints--
+
+`euler177()` should return 129325.
+
+```js
+assert.strictEqual(euler177(), 129325);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler177() {
+
+  return true;
+}
+
+euler177();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-178-step-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
new file mode 100644
index 0000000000..12bad9c5ad
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f41e1000cf542c50ff31
+title: 'Problem 178: Step Numbers'
+challengeType: 5
+forumTopicId: 301813
+dashedName: problem-178-step-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler178()` should return 126461847755.
+
+```js
+assert.strictEqual(euler178(), 126461847755);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler178() {
+
+  return true;
+}
+
+euler178();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
new file mode 100644
index 0000000000..1811def962
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
@@ -0,0 +1,38 @@
+---
+id: 5900f41f1000cf542c50ff32
+title: 'Problem 179: Consecutive positive divisors'
+challengeType: 5
+forumTopicId: 301814
+dashedName: problem-179-consecutive-positive-divisors
+---
+
+# --description--
+
+Find the number of integers 1 &lt; n &lt; 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.
+
+# --hints--
+
+`euler179()` should return 986262.
+
+```js
+assert.strictEqual(euler179(), 986262);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler179() {
+
+  return true;
+}
+
+euler179();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
new file mode 100644
index 0000000000..2ad9a7a7a6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
@@ -0,0 +1,109 @@
+---
+id: 5900f37e1000cf542c50fe91
+title: 'Problem 18: Maximum path sum I'
+challengeType: 5
+forumTopicId: 301815
+dashedName: problem-18-maximum-path-sum-i
+---
+
+# --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.
+
+<span style='display: block; text-align: center;'>
+  <strong style='color: red;'>3</strong><br>
+  <strong style='color: red;'>7</strong> 4<br>
+  2 <strong style='color: red;'>4</strong> 6<br>
+  8 5 <strong style='color: red;'>9</strong> 3
+</span>
+
+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)
+
+# --hints--
+
+`maximumPathSumI(testTriangle)` should return a number.
+
+```js
+assert(typeof maximumPathSumI(testTriangle) === 'number');
+```
+
+`maximumPathSumI(testTriangle)` should return 23.
+
+```js
+assert.strictEqual(maximumPathSumI(testTriangle), 23);
+```
+
+`maximumPathSumI(numTriangle)` should return 1074.
+
+```js
+assert.strictEqual(maximumPathSumI(numTriangle), 1074);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const numTriangle = [[75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [95, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [17, 47, 82, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [18, 35, 87, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [20, 4, 82, 47, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [19, 1, 23, 75, 3, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0], [88, 2, 77, 73, 7, 63, 67, 0, 0, 0, 0, 0, 0, 0, 0], [99, 65, 4, 28, 6, 16, 70, 92, 0, 0, 0, 0, 0, 0, 0], [41, 41, 26, 56, 83, 40, 80, 70, 33, 0, 0, 0, 0, 0, 0], [41, 48, 72, 33, 47, 32, 37, 16, 94, 29, 0, 0, 0, 0, 0], [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14, 0, 0, 0, 0], [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57, 0, 0, 0], [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48, 0, 0], [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31, 0], [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23]];
+```
+
+## --seed-contents--
+
+```js
+function maximumPathSumI(triangle) {
+
+  return true;
+}
+
+const testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+
+maximumPathSumI(testTriangle);
+```
+
+# --solutions--
+
+```js
+const testTriangle = [[3, 0, 0, 0],
+  [7, 4, 0, 0],
+  [2, 4, 6, 0],
+  [8, 5, 9, 3]];
+
+function maximumPathSumI(triangle) {
+  let maxSum = triangle.slice();
+
+  for (let i = triangle.length - 1; i > 0; i--) {
+    let currentRow = maxSum[i];
+    let previousRow = maxSum[i - 1];
+    const temp = [];
+    for (let j = 0; j < i; j++) {
+      temp.push(Math.max((currentRow[j] + previousRow[j]), (currentRow[j + 1] + previousRow[j])));
+    }
+    maxSum[i - 1] = temp;
+    maxSum.pop();
+  }
+  return maxSum[0][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
new file mode 100644
index 0000000000..3b46677319
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4201000cf542c50ff33
+title: 'Problem 180: Rational zeros of a function of three variables'
+challengeType: 5
+forumTopicId: 301816
+dashedName: problem-180-rational-zeros-of-a-function-of-three-variables
+---
+
+# --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 &lt; a &lt; 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.
+
+# --hints--
+
+`euler180()` should return 285196020571078980.
+
+```js
+assert.strictEqual(euler180(), 285196020571078980);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler180() {
+
+  return true;
+}
+
+euler180();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
new file mode 100644
index 0000000000..01c3730a1a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -0,0 +1,47 @@
+---
+id: 5900f4231000cf542c50ff34
+title: >-
+  Problem 181: Investigating in how many ways objects of two different colours
+  can be grouped
+challengeType: 5
+forumTopicId: 301817
+dashedName: >-
+  problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
+---
+
+# --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?
+
+# --hints--
+
+`euler181()` should return 83735848679360670.
+
+```js
+assert.strictEqual(euler181(), 83735848679360670);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler181() {
+
+  return true;
+}
+
+euler181();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
new file mode 100644
index 0000000000..7ffc6ae376
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -0,0 +1,113 @@
+---
+id: 5900f4231000cf542c50ff35
+title: 'Problem 182: RSA encryption'
+challengeType: 5
+forumTopicId: 301818
+dashedName: problem-182-rsa-encryption
+---
+
+# --description--
+
+The RSA encryption is based on the following procedure:
+
+Generate two distinct primes `p` and `q`.
+Compute `n=p*q` 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=m<sup>e</sup> 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=c<sup>d</sup> mod n.
+
+There exist values of `e` and `m` such that m<sup>e</sup> mod n = m.
+We call messages `m` for which m<sup>e</sup> 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 messages
+m `(0≤m≤n-1)` are unconcealed when calculating m<sup>e</sup> 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.
+
+For any given `p` and `q`, find the sum of all values of `e`, `1 < e < φ(p,q)` and `gcd(e,φ)=1`, so that the number of unconcealed messages for this value of `e` is at a minimum.
+
+# --hints--
+
+`RSAEncryption` should be a function.
+
+```js
+assert(typeof RSAEncryption === 'function')
+```
+
+`RSAEncryption` should return a number.
+
+```js
+assert.strictEqual(typeof RSAEncryption(19, 37), 'number');
+```
+
+`RSAEncryption(19, 37)` should return `17766`.
+
+```js
+assert.strictEqual(RSAEncryption(19, 37), 17766);
+```
+
+`RSAEncryption(283, 409)` should return `466196580`.
+
+```js
+assert.strictEqual(RSAEncryption(283, 409), 466196580);
+```
+
+`RSAEncryption(1009, 3643)` should return `399788195976`.
+
+```js
+assert.strictEqual(RSAEncryption(19, 37), 17766);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function RSAEncryption(p, q) {
+
+  return true;
+}
+
+RSAEncryption(19, 37);
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+    if (b)
+        return gcd(b, a % b);
+    else
+        return a;
+}
+
+function RSAEncryption(p, q) {
+    let phi = (p - 1) * (q - 1);
+
+    let best = Number.MAX_SAFE_INTEGER;
+    let sum = 0;
+
+    for (let e = 0; e < phi; ++e) {
+        if (!(gcd(e, phi) == 1))
+            continue;
+
+        let msg = (gcd(p - 1, e - 1) + 1) * (gcd(q - 1, e - 1) + 1);
+
+        if (best == msg) {
+            sum += e;
+        } else if (best > msg) {
+            best = msg;
+            sum = e;
+        }
+    }
+
+    return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
new file mode 100644
index 0000000000..0dcbca86fd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4231000cf542c50ff36
+title: 'Problem 183: Maximum product of parts'
+challengeType: 5
+forumTopicId: 301819
+dashedName: problem-183-maximum-product-of-parts
+---
+
+# --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.
+
+# --hints--
+
+`euler183()` should return 48861552.
+
+```js
+assert.strictEqual(euler183(), 48861552);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler183() {
+
+  return true;
+}
+
+euler183();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
new file mode 100644
index 0000000000..dd5855935b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4241000cf542c50ff37
+title: 'Problem 184: Triangles containing the origin'
+challengeType: 5
+forumTopicId: 301820
+dashedName: problem-184-triangles-containing-the-origin
+---
+
+# --description--
+
+Consider the set Ir of points (x,y) with integer coordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 &lt; 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?
+
+# --hints--
+
+`euler184()` should return 1725323624056.
+
+```js
+assert.strictEqual(euler184(), 1725323624056);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler184() {
+
+  return true;
+}
+
+euler184();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-185-number-mind.md
new file mode 100644
index 0000000000..bd8a853937
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4251000cf542c50ff38
+title: 'Problem 185: Number Mind'
+challengeType: 5
+forumTopicId: 301821
+dashedName: problem-185-number-mind
+---
+
+# --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.
+
+# --hints--
+
+`euler185()` should return 4640261571849533.
+
+```js
+assert.strictEqual(euler185(), 4640261571849533);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler185() {
+
+  return true;
+}
+
+euler185();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
new file mode 100644
index 0000000000..119501f833
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4281000cf542c50ff39
+title: 'Problem 186: Connectedness of a network'
+challengeType: 5
+forumTopicId: 301822
+dashedName: problem-186-connectedness-of-a-network
+---
+
+# --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?
+
+# --hints--
+
+`euler186()` should return 2325629.
+
+```js
+assert.strictEqual(euler186(), 2325629);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler186() {
+
+  return true;
+}
+
+euler186();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-187-semiprimes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
new file mode 100644
index 0000000000..043684a9d7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4291000cf542c50ff3a
+title: 'Problem 187: Semiprimes'
+challengeType: 5
+forumTopicId: 301823
+dashedName: problem-187-semiprimes
+---
+
+# --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 &lt; 108, have precisely two, not necessarily distinct, prime factors?
+
+# --hints--
+
+`euler187()` should return 17427258.
+
+```js
+assert.strictEqual(euler187(), 17427258);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler187() {
+
+  return true;
+}
+
+euler187();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
new file mode 100644
index 0000000000..8c24a2f8e9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4291000cf542c50ff3b
+title: 'Problem 188: The hyperexponentiation of a number'
+challengeType: 5
+forumTopicId: 301824
+dashedName: problem-188-the-hyperexponentiation-of-a-number
+---
+
+# --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.
+
+# --hints--
+
+`euler188()` should return 95962097.
+
+```js
+assert.strictEqual(euler188(), 95962097);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler188() {
+
+  return true;
+}
+
+euler188();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
new file mode 100644
index 0000000000..4153d58442
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4291000cf542c50ff3c
+title: 'Problem 189: Tri-colouring a triangular grid'
+challengeType: 5
+forumTopicId: 301825
+dashedName: problem-189-tri-colouring-a-triangular-grid
+---
+
+# --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?
+
+# --hints--
+
+`euler189()` should return 10834893628237824.
+
+```js
+assert.strictEqual(euler189(), 10834893628237824);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler189() {
+
+  return true;
+}
+
+euler189();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
new file mode 100644
index 0000000000..c12d6d1c6b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
@@ -0,0 +1,76 @@
+---
+id: 5900f37f1000cf542c50fe92
+title: 'Problem 19: Counting Sundays'
+challengeType: 5
+forumTopicId: 301827
+dashedName: problem-19-counting-sundays
+---
+
+# --description--
+
+You are given the following information, but you may prefer to do some research for yourself.
+
+<ul>
+  <li>1 Jan 1900 was a Monday.</li>
+  <li>Thirty days has September,<br>April, June and November.<br>All the rest have thirty-one,<br>Saving February alone,<br>Which has twenty-eight, rain or shine.<br>And on leap years, twenty-nine.</li>
+  <li>A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.</li>
+</ul>
+
+How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
+
+# --hints--
+
+`countingSundays(1943, 1946)` should return a number.
+
+```js
+assert(typeof countingSundays(1943, 1946) === 'number');
+```
+
+`countingSundays(1943, 1946)` should return 6.
+
+```js
+assert.strictEqual(countingSundays(1943, 1946), 6);
+```
+
+`countingSundays(1995, 2000)` should return 10.
+
+```js
+assert.strictEqual(countingSundays(1995, 2000), 10);
+```
+
+`countingSundays(1901, 2000)` should return 171.
+
+```js
+assert.strictEqual(countingSundays(1901, 2000), 171);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingSundays(firstYear, lastYear) {
+
+  return true;
+}
+
+countingSundays(1943, 1946);
+```
+
+# --solutions--
+
+```js
+function countingSundays(firstYear, lastYear) {
+  let sundays = 0;
+
+  for (let year = firstYear; year <= lastYear; year++) {
+    for (let month = 0; month <= 11; month++) {
+      const thisDate = new Date(year, month, 1);
+      if (thisDate.getDay() === 0) {
+        sundays++;
+      }
+    }
+  }
+  return sundays;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
new file mode 100644
index 0000000000..143247df80
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
@@ -0,0 +1,42 @@
+---
+id: 5900f42b1000cf542c50ff3d
+title: 'Problem 190: Maximising a weighted product'
+challengeType: 5
+forumTopicId: 301828
+dashedName: problem-190-maximising-a-weighted-product
+---
+
+# --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.
+
+# --hints--
+
+`euler190()` should return 371048281.
+
+```js
+assert.strictEqual(euler190(), 371048281);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler190() {
+
+  return true;
+}
+
+euler190();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-191-prize-strings.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
new file mode 100644
index 0000000000..bd93cdca4c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
@@ -0,0 +1,46 @@
+---
+id: 5900f42b1000cf542c50ff3e
+title: 'Problem 191: Prize Strings'
+challengeType: 5
+forumTopicId: 301829
+dashedName: problem-191-prize-strings
+---
+
+# --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?
+
+# --hints--
+
+`euler191()` should return 1918080160.
+
+```js
+assert.strictEqual(euler191(), 1918080160);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler191() {
+
+  return true;
+}
+
+euler191();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-192-best-approximations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
new file mode 100644
index 0000000000..6751cbffaf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
@@ -0,0 +1,46 @@
+---
+id: 5900f42c1000cf542c50ff3f
+title: 'Problem 192: Best Approximations'
+challengeType: 5
+forumTopicId: 301830
+dashedName: problem-192-best-approximations
+---
+
+# --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| &lt; |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 &lt; n ≤ 100000.
+
+# --hints--
+
+`euler192()` should return 57060635927998344.
+
+```js
+assert.strictEqual(euler192(), 57060635927998344);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler192() {
+
+  return true;
+}
+
+euler192();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
new file mode 100644
index 0000000000..1b9cc8d490
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
@@ -0,0 +1,40 @@
+---
+id: 5900f42f1000cf542c50ff41
+title: 'Problem 193: Squarefree Numbers'
+challengeType: 5
+forumTopicId: 301831
+dashedName: problem-193-squarefree-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler193()` should return 684465067343069.
+
+```js
+assert.strictEqual(euler193(), 684465067343069);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler193() {
+
+  return true;
+}
+
+euler193();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
new file mode 100644
index 0000000000..947d65c787
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f42f1000cf542c50ff40
+title: 'Problem 194: Coloured Configurations'
+challengeType: 5
+forumTopicId: 301832
+dashedName: problem-194-coloured-configurations
+---
+
+# --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).
+
+# --hints--
+
+`euler194()` should return 61190912.
+
+```js
+assert.strictEqual(euler194(), 61190912);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler194() {
+
+  return true;
+}
+
+euler194();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
new file mode 100644
index 0000000000..cd52202435
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4311000cf542c50ff43
+title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees'
+challengeType: 5
+forumTopicId: 301833
+dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees
+---
+
+# --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).
+
+# --hints--
+
+`euler195()` should return 75085391.
+
+```js
+assert.strictEqual(euler195(), 75085391);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler195() {
+
+  return true;
+}
+
+euler195();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
new file mode 100644
index 0000000000..4ead4631dd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4301000cf542c50ff42
+title: 'Problem 196: Prime triplets'
+challengeType: 5
+forumTopicId: 301834
+dashedName: problem-196-prime-triplets
+---
+
+# --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).
+
+# --hints--
+
+`euler196()` should return 322303240771079940.
+
+```js
+assert.strictEqual(euler196(), 322303240771079940);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler196() {
+
+  return true;
+}
+
+euler196();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
new file mode 100644
index 0000000000..1e2f3fe30d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4311000cf542c50ff44
+title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
+challengeType: 5
+forumTopicId: 301835
+dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler197()` should return 1.710637717.
+
+```js
+assert.strictEqual(euler197(), 1.710637717);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler197() {
+
+  return true;
+}
+
+euler197();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
new file mode 100644
index 0000000000..a955aa7c37
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4331000cf542c50ff45
+title: 'Problem 198: Ambiguous Numbers'
+challengeType: 5
+forumTopicId: 301836
+dashedName: problem-198-ambiguous-numbers
+---
+
+# --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 &lt; x &lt; 1/100, are there whose denominator q does not exceed 108?
+
+# --hints--
+
+`euler198()` should return 52374425.
+
+```js
+assert.strictEqual(euler198(), 52374425);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler198() {
+
+  return true;
+}
+
+euler198();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
new file mode 100644
index 0000000000..28479e80b7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -0,0 +1,75 @@
+---
+id: 5900f4341000cf542c50ff46
+title: 'Problem 199: Iterative Circle Packing'
+challengeType: 5
+forumTopicId: 301837
+dashedName: problem-199-iterative-circle-packing
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of non-overlapping concentric circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;">
+
+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 `n` iterations? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+
+# --hints--
+
+`iterativeCirclePacking(10)` should return a number.
+
+```js
+assert(typeof iterativeCirclePacking(10) === 'number');
+```
+
+`iterativeCirclePacking(10)` should return 0.00396087.
+
+```js
+assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
+```
+
+`iterativeCirclePacking(3)` should return 0.06790342.
+
+```js
+assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function iterativeCirclePacking(n) {
+
+  return true;
+}
+
+iterativeCirclePacking(10);
+```
+
+# --solutions--
+
+```js
+function iterativeCirclePacking(n) {
+  let k1 = 1;
+  let k0 = k1 * (3 - 2 * Math.sqrt(3));
+  let a0 = 1 / (k0 * k0);
+  let a1 = 3 / (k1 * k1);
+  a1 += 3 * getArea(k0, k1, k1, n);
+  a1 += getArea(k1, k1, k1, n);
+  let final = ((a0 - a1) / a0).toFixed(8);
+  
+  return parseFloat(final);
+  function getArea(k1, k2, k3, depth) {
+      if (depth == 0) return 0.0;
+      let k4 = k1 + k2 + k3 + 2 * Math.sqrt(k1 * k2 + k2 * k3 + k3 * k1);
+      let a = 1 / (k4 * k4);
+      a += getArea(k1, k2, k4, depth - 1);
+      a += getArea(k2, k3, k4, depth - 1);
+      a += getArea(k3, k1, k4, depth - 1);
+      return a;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
new file mode 100644
index 0000000000..ecf2a8aa73
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -0,0 +1,103 @@
+---
+id: 5900f36e1000cf542c50fe81
+title: 'Problem 2: Even Fibonacci Numbers'
+challengeType: 5
+forumTopicId: 301838
+dashedName: problem-2-even-fibonacci-numbers
+---
+
+# --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:
+
+<div style='text-align: center;'>1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</div>
+
+By considering the terms in the Fibonacci sequence whose values do not exceed `n`, find the sum of the even-valued terms.
+
+# --hints--
+
+`fiboEvenSum(10)` should return a number.
+
+```js
+assert(typeof fiboEvenSum(10) === 'number');
+```
+
+Your function should return an `even` value.
+
+```js
+assert.equal(fiboEvenSum(10) % 2 === 0, true);
+```
+
+Your function should sum the even-valued Fibonacci numbers: `fiboEvenSum(8)` should return 10.
+
+```js
+assert.strictEqual(fiboEvenSum(8), 10);
+```
+
+`fiboEvenSum(10)` should return 10.
+
+```js
+assert.strictEqual(fiboEvenSum(10), 10);
+```
+
+`fiboEvenSum(34)` should return 44.
+
+```js
+assert.strictEqual(fiboEvenSum(34), 44);
+```
+
+`fiboEvenSum(60)` should return 44.
+
+```js
+assert.strictEqual(fiboEvenSum(60), 44);
+```
+
+`fiboEvenSum(1000)` should return 798.
+
+```js
+assert.strictEqual(fiboEvenSum(1000), 798);
+```
+
+`fiboEvenSum(100000)` should return 60696.
+
+```js
+assert.strictEqual(fiboEvenSum(100000), 60696);
+```
+
+`fiboEvenSum(4000000)` should return 4613732.
+
+```js
+assert.strictEqual(fiboEvenSum(4000000), 4613732);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fiboEvenSum(n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const fiboEvenSum = (number) => {
+  if (number <= 1) {
+    return 0;
+  } else {
+    let evenSum = 0,
+      prevFibNum = 1,
+      fibNum = 2; // According to problem description our Fibonacci series starts with 1, 2
+    for (let i = 2; fibNum <= number; i++) {
+      if (fibNum % 2 == 0) {
+        evenSum += fibNum;
+      }
+      [prevFibNum, fibNum] = [fibNum, prevFibNum + fibNum];
+    }
+    return evenSum;
+  }
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
new file mode 100644
index 0000000000..579ac97f6f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
@@ -0,0 +1,79 @@
+---
+id: 5900f3801000cf542c50fe93
+title: 'Problem 20: Factorial digit sum'
+challengeType: 5
+forumTopicId: 301839
+dashedName: problem-20-factorial-digit-sum
+---
+
+# --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`!
+
+# --hints--
+
+`sumFactorialDigits(10)` should return a number.
+
+```js
+assert(typeof sumFactorialDigits(10) === 'number');
+```
+
+`sumFactorialDigits(10)` should return 27.
+
+```js
+assert.strictEqual(sumFactorialDigits(10), 27);
+```
+
+`sumFactorialDigits(25)` should return 72.
+
+```js
+assert.strictEqual(sumFactorialDigits(25), 72);
+```
+
+`sumFactorialDigits(50)` should return 216.
+
+```js
+assert.strictEqual(sumFactorialDigits(50), 216);
+```
+
+`sumFactorialDigits(75)` should return 432.
+
+```js
+assert.strictEqual(sumFactorialDigits(75), 432);
+```
+
+`sumFactorialDigits(100)` should return 648.
+
+```js
+assert.strictEqual(sumFactorialDigits(100), 648);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumFactorialDigits(n) {
+
+  return n;
+}
+
+sumFactorialDigits(100);
+```
+
+# --solutions--
+
+```js
+let factorial = (n) => n <= 1 ? BigInt(n) : BigInt(n) * BigInt(factorial(--n));
+
+let sumDigits = n => n.toString().split('').map(x => parseInt(x)).reduce((a,b) => a + b);
+
+function sumFactorialDigits(n) {
+  return sumDigits(factorial(n));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
new file mode 100644
index 0000000000..bacbb306a1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4351000cf542c50ff47
+title: >-
+  Problem 200: Find the 200th prime-proof sqube containing the contiguous
+  sub-string "200"
+challengeType: 5
+forumTopicId: 301840
+dashedName: >-
+  problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
+---
+
+# --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".
+
+# --hints--
+
+`euler200()` should return 229161792008.
+
+```js
+assert.strictEqual(euler200(), 229161792008);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler200() {
+
+  return true;
+}
+
+euler200();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
new file mode 100644
index 0000000000..045fd9b2b8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4361000cf542c50ff48
+title: 'Problem 201: Subsets with a unique sum'
+challengeType: 5
+forumTopicId: 301841
+dashedName: problem-201-subsets-with-a-unique-sum
+---
+
+# --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)).
+
+# --hints--
+
+`euler201()` should return 115039000.
+
+```js
+assert.strictEqual(euler201(), 115039000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler201() {
+
+  return true;
+}
+
+euler201();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-202-laserbeam.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
new file mode 100644
index 0000000000..c42f68e414
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4371000cf542c50ff49
+title: 'Problem 202: Laserbeam'
+challengeType: 5
+forumTopicId: 301843
+dashedName: problem-202-laserbeam
+---
+
+# --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?
+
+# --hints--
+
+`euler202()` should return 1209002624.
+
+```js
+assert.strictEqual(euler202(), 1209002624);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler202() {
+
+  return true;
+}
+
+euler202();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
new file mode 100644
index 0000000000..4ecf609e4b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4381000cf542c50ff4a
+title: 'Problem 203: Squarefree Binomial Coefficients'
+challengeType: 5
+forumTopicId: 301844
+dashedName: problem-203-squarefree-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler203()` should return 34029210557338.
+
+```js
+assert.strictEqual(euler203(), 34029210557338);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler203() {
+
+  return true;
+}
+
+euler203();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
new file mode 100644
index 0000000000..4d81e08eea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4381000cf542c50ff4b
+title: 'Problem 204: Generalised Hamming Numbers'
+challengeType: 5
+forumTopicId: 301845
+dashedName: problem-204-generalised-hamming-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler204()` should return 2944730.
+
+```js
+assert.strictEqual(euler204(), 2944730);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler204() {
+
+  return true;
+}
+
+euler204();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-205-dice-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-205-dice-game.md
new file mode 100644
index 0000000000..41bf903b6d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-205-dice-game.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4391000cf542c50ff4c
+title: 'Problem 205: Dice Game'
+challengeType: 5
+forumTopicId: 301846
+dashedName: problem-205-dice-game
+---
+
+# --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
+
+# --hints--
+
+`euler205()` should return 0.5731441.
+
+```js
+assert.strictEqual(euler205(), 0.5731441);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler205() {
+
+  return true;
+}
+
+euler205();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
new file mode 100644
index 0000000000..eaedced890
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -0,0 +1,38 @@
+---
+id: 5900f43a1000cf542c50ff4d
+title: 'Problem 206: Concealed Square'
+challengeType: 5
+forumTopicId: 301847
+dashedName: problem-206-concealed-square
+---
+
+# --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.
+
+# --hints--
+
+`euler206()` should return 1389019170.
+
+```js
+assert.strictEqual(euler206(), 1389019170);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler206() {
+
+  return true;
+}
+
+euler206();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
new file mode 100644
index 0000000000..19f1d12c8d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f43c1000cf542c50ff4e
+title: 'Problem 207: Integer partition equations'
+challengeType: 5
+forumTopicId: 301848
+dashedName: problem-207-integer-partition-equations
+---
+
+# --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) &lt; 1/12345
+
+# --hints--
+
+`euler207()` should return 44043947822.
+
+```js
+assert.strictEqual(euler207(), 44043947822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler207() {
+
+  return true;
+}
+
+euler207();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
new file mode 100644
index 0000000000..36d5a8fff5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -0,0 +1,42 @@
+---
+id: 5900f43f1000cf542c50ff51
+title: 'Problem 208: Robot Walks'
+challengeType: 5
+forumTopicId: 301849
+dashedName: problem-208-robot-walks
+---
+
+# --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.)
+
+# --hints--
+
+`euler208()` should return 331951449665644800.
+
+```js
+assert.strictEqual(euler208(), 331951449665644800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler208() {
+
+  return true;
+}
+
+euler208();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
new file mode 100644
index 0000000000..f743744736
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -0,0 +1,44 @@
+---
+id: 5900f43e1000cf542c50ff4f
+title: 'Problem 209: Circular Logic'
+challengeType: 5
+forumTopicId: 301850
+dashedName: problem-209-circular-logic
+---
+
+# --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)?
+
+# --hints--
+
+`euler209()` should return 15964587728784.
+
+```js
+assert.strictEqual(euler209(), 15964587728784);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler209() {
+
+  return true;
+}
+
+euler209();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
new file mode 100644
index 0000000000..58acfba70e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
@@ -0,0 +1,84 @@
+---
+id: 5900f3811000cf542c50fe94
+title: 'Problem 21: Amicable numbers'
+challengeType: 5
+forumTopicId: 301851
+dashedName: problem-21-amicable-numbers
+---
+
+# --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 `n`.
+
+# --hints--
+
+`sumAmicableNum(1000)` should return a number.
+
+```js
+assert(typeof sumAmicableNum(1000) === 'number');
+```
+
+`sumAmicableNum(1000)` should return 504.
+
+```js
+assert.strictEqual(sumAmicableNum(1000), 504);
+```
+
+`sumAmicableNum(2000)` should return 2898.
+
+```js
+assert.strictEqual(sumAmicableNum(2000), 2898);
+```
+
+`sumAmicableNum(5000)` should return 8442.
+
+```js
+assert.strictEqual(sumAmicableNum(5000), 8442);
+```
+
+`sumAmicableNum(10000)` should return 31626.
+
+```js
+assert.strictEqual(sumAmicableNum(10000), 31626);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumAmicableNum(n) {
+
+  return n;
+}
+
+sumAmicableNum(10000);
+```
+
+# --solutions--
+
+```js
+const sumAmicableNum = (n) => {
+  const fsum = (n) => {
+    let sum = 1;
+    for (let i = 2; i <= Math.floor(Math.sqrt(n)); i++)
+      if (Math.floor(n % i) === 0)
+        sum += i + Math.floor(n / i);
+    return sum;
+  };
+  let d = [];
+  let amicableSum = 0;
+  for (let i=2; i<n; i++) d[i] = fsum(i);
+  for (let i=2; i<n; i++) {
+    let dsum = d[i];
+    if (d[dsum]===i && i!==dsum) amicableSum += i+dsum;
+  }
+  return amicableSum/2;
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
new file mode 100644
index 0000000000..1fc7d98033
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f43e1000cf542c50ff50
+title: 'Problem 210: Obtuse Angled Triangles'
+challengeType: 5
+forumTopicId: 301852
+dashedName: problem-210-obtuse-angled-triangles
+---
+
+# --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°&lt;α&lt;180°.
+
+So, for example, N(4)=24 and N(8)=100.
+
+What is N(1,000,000,000)?
+
+# --hints--
+
+`euler210()` should return 1598174770174689500.
+
+```js
+assert.strictEqual(euler210(), 1598174770174689500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler210() {
+
+  return true;
+}
+
+euler210();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
new file mode 100644
index 0000000000..bde41e4a79
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -0,0 +1,42 @@
+---
+id: 5900f43f1000cf542c50ff52
+title: 'Problem 211: Divisor Square Sum'
+challengeType: 5
+forumTopicId: 301853
+dashedName: problem-211-divisor-square-sum
+---
+
+# --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 &lt; n &lt; 64,000,000 such that σ2(n) is a perfect square.
+
+# --hints--
+
+`euler211()` should return 1922364685.
+
+```js
+assert.strictEqual(euler211(), 1922364685);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler211() {
+
+  return true;
+}
+
+euler211();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
new file mode 100644
index 0000000000..901bbbc3d1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4411000cf542c50ff53
+title: 'Problem 212: Combined Volume of Cuboids'
+challengeType: 5
+forumTopicId: 301854
+dashedName: problem-212-combined-volume-of-cuboids
+---
+
+# --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 ?
+
+# --hints--
+
+`euler212()` should return 328968937309.
+
+```js
+assert.strictEqual(euler212(), 328968937309);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler212() {
+
+  return true;
+}
+
+euler212();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-213-flea-circus.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
new file mode 100644
index 0000000000..2fbc23393c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4411000cf542c50ff54
+title: 'Problem 213: Flea Circus'
+challengeType: 5
+forumTopicId: 301855
+dashedName: problem-213-flea-circus
+---
+
+# --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.
+
+# --hints--
+
+`euler213()` should return 330.721154.
+
+```js
+assert.strictEqual(euler213(), 330.721154);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler213() {
+
+  return true;
+}
+
+euler213();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
new file mode 100644
index 0000000000..754596cef6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4421000cf542c50ff55
+title: 'Problem 214: Totient Chains'
+challengeType: 5
+forumTopicId: 301856
+dashedName: problem-214-totient-chains
+---
+
+# --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?
+
+# --hints--
+
+`euler214()` should return 1677366278943.
+
+```js
+assert.strictEqual(euler214(), 1677366278943);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler214() {
+
+  return true;
+}
+
+euler214();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
new file mode 100644
index 0000000000..45f7f563e7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4431000cf542c50ff56
+title: 'Problem 215: Crack-free Walls'
+challengeType: 5
+forumTopicId: 301857
+dashedName: problem-215-crack-free-walls
+---
+
+# --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).
+
+# --hints--
+
+`euler215()` should return 806844323190414.
+
+```js
+assert.strictEqual(euler215(), 806844323190414);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler215() {
+
+  return true;
+}
+
+euler215();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
new file mode 100644
index 0000000000..e7591cd46f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4451000cf542c50ff57
+title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
+challengeType: 5
+forumTopicId: 301858
+dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1
+---
+
+# --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 ?
+
+# --hints--
+
+`euler216()` should return 5437849.
+
+```js
+assert.strictEqual(euler216(), 5437849);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler216() {
+
+  return true;
+}
+
+euler216();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
new file mode 100644
index 0000000000..625b4a6c6d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4461000cf542c50ff58
+title: 'Problem 217: Balanced Numbers'
+challengeType: 5
+forumTopicId: 301859
+dashedName: problem-217-balanced-numbers
+---
+
+# --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
+
+# --hints--
+
+`euler217()` should return 6273134.
+
+```js
+assert.strictEqual(euler217(), 6273134);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler217() {
+
+  return true;
+}
+
+euler217();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
new file mode 100644
index 0000000000..db91d74874
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4461000cf542c50ff59
+title: 'Problem 218: Perfect right-angled triangles'
+challengeType: 5
+forumTopicId: 301860
+dashedName: problem-218-perfect-right-angled-triangles
+---
+
+# --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?
+
+# --hints--
+
+`euler218()` should return 0.
+
+```js
+assert.strictEqual(euler218(), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler218() {
+
+  return true;
+}
+
+euler218();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
new file mode 100644
index 0000000000..38d16eba87
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4481000cf542c50ff5a
+title: 'Problem 219: Skew-cost coding'
+challengeType: 5
+forumTopicId: 301861
+dashedName: problem-219-skew-cost-coding
+---
+
+# --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) ?
+
+# --hints--
+
+`euler219()` should return 64564225042.
+
+```js
+assert.strictEqual(euler219(), 64564225042);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler219() {
+
+  return true;
+}
+
+euler219();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-22-names-scores.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-22-names-scores.md
new file mode 100644
index 0000000000..e93e40d6ef
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-22-names-scores.md
@@ -0,0 +1,90 @@
+---
+id: 5a51eabcad78bf416f316e2a
+title: 'Problem 22: Names scores'
+challengeType: 5
+forumTopicId: 301862
+dashedName: problem-22-names-scores
+---
+
+# --description--
+
+Using `names`, an array defined in the background 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 array?
+
+# --hints--
+
+`namesScores(test1)` should return a number.
+
+```js
+assert(typeof namesScores(test1) === 'number');
+```
+
+`namesScores(test1)` should return 791.
+
+```js
+assert.strictEqual(namesScores(test1), 791);
+```
+
+`namesScores(test2)` should return 1468.
+
+```js
+assert.strictEqual(namesScores(test2), 1468);
+```
+
+`namesScores(names)` should return 871198282.
+
+```js
+assert.strictEqual(namesScores(names), 871198282);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const names = ['MARY','PATRICIA','LINDA','BARBARA','ELIZABETH','JENNIFER','MARIA','SUSAN','MARGARET','DOROTHY','LISA','NANCY','KAREN','BETTY','HELEN','SANDRA','DONNA','CAROL','RUTH','SHARON','MICHELLE','LAURA','SARAH','KIMBERLY','DEBORAH','JESSICA','SHIRLEY','CYNTHIA','ANGELA','MELISSA','BRENDA','AMY','ANNA','REBECCA','VIRGINIA','KATHLEEN','PAMELA','MARTHA','DEBRA','AMANDA','STEPHANIE','CAROLYN','CHRISTINE','MARIE','JANET','CATHERINE','FRANCES','ANN','JOYCE','DIANE','ALICE','JULIE','HEATHER','TERESA','DORIS','GLORIA','EVELYN','JEAN','CHERYL','MILDRED','KATHERINE','JOAN','ASHLEY','JUDITH','ROSE','JANICE','KELLY','NICOLE','JUDY','CHRISTINA','KATHY','THERESA','BEVERLY','DENISE','TAMMY','IRENE','JANE','LORI','RACHEL','MARILYN','ANDREA','KATHRYN','LOUISE','SARA','ANNE','JACQUELINE','WANDA','BONNIE','JULIA','RUBY','LOIS','TINA','PHYLLIS','NORMA','PAULA','DIANA','ANNIE','LILLIAN','EMILY','ROBIN','PEGGY','CRYSTAL','GLADYS','RITA','DAWN','CONNIE','FLORENCE','TRACY','EDNA','TIFFANY','CARMEN','ROSA','CINDY','GRACE','WENDY','VICTORIA','EDITH','KIM','SHERRY','SYLVIA','JOSEPHINE','THELMA','SHANNON','SHEILA','ETHEL','ELLEN','ELAINE','MARJORIE','CARRIE','CHARLOTTE','MONICA','ESTHER','PAULINE','EMMA','JUANITA','ANITA','RHONDA','HAZEL','AMBER','EVA','DEBBIE','APRIL','LESLIE','CLARA','LUCILLE','JAMIE','JOANNE','ELEANOR','VALERIE','DANIELLE','MEGAN','ALICIA','SUZANNE','MICHELE','GAIL','BERTHA','DARLENE','VERONICA','JILL','ERIN','GERALDINE','LAUREN','CATHY','JOANN','LORRAINE','LYNN','SALLY','REGINA','ERICA','BEATRICE','DOLORES','BERNICE','AUDREY','YVONNE','ANNETTE','JUNE','SAMANTHA','MARION','DANA','STACY','ANA','RENEE','IDA','VIVIAN','ROBERTA','HOLLY','BRITTANY','MELANIE','LORETTA','YOLANDA','JEANETTE','LAURIE','KATIE','KRISTEN','VANESSA','ALMA','SUE','ELSIE','BETH','JEANNE','VICKI','CARLA','TARA','ROSEMARY','EILEEN','TERRI','GERTRUDE','LUCY','TONYA','ELLA','STACEY','WILMA','GINA','KRISTIN','JESSIE','NATALIE','AGNES','VERA','WILLIE','CHARLENE','BESSIE','DELORES','MELINDA','PEARL','ARLENE','MAUREEN','COLLEEN','ALLISON','TAMARA','JOY','GEORGIA','CONSTANCE','LILLIE','CLAUDIA','JACKIE','MARCIA','TANYA','NELLIE','MINNIE','MARLENE','HEIDI','GLENDA','LYDIA','VIOLA','COURTNEY','MARIAN','STELLA','CAROLINE','DORA','JO','VICKIE','MATTIE','TERRY','MAXINE','IRMA','MABEL','MARSHA','MYRTLE','LENA','CHRISTY','DEANNA','PATSY','HILDA','GWENDOLYN','JENNIE','NORA','MARGIE','NINA','CASSANDRA','LEAH','PENNY','KAY','PRISCILLA','NAOMI','CAROLE','BRANDY','OLGA','BILLIE','DIANNE','TRACEY','LEONA','JENNY','FELICIA','SONIA','MIRIAM','VELMA','BECKY','BOBBIE','VIOLET','KRISTINA','TONI','MISTY','MAE','SHELLY','DAISY','RAMONA','SHERRI','ERIKA','KATRINA','CLAIRE','LINDSEY','LINDSAY','GENEVA','GUADALUPE','BELINDA','MARGARITA','SHERYL','CORA','FAYE','ADA','NATASHA','SABRINA','ISABEL','MARGUERITE','HATTIE','HARRIET','MOLLY','CECILIA','KRISTI','BRANDI','BLANCHE','SANDY','ROSIE','JOANNA','IRIS','EUNICE','ANGIE','INEZ','LYNDA','MADELINE','AMELIA','ALBERTA','GENEVIEVE','MONIQUE','JODI','JANIE','MAGGIE','KAYLA','SONYA','JAN','LEE','KRISTINE','CANDACE','FANNIE','MARYANN','OPAL','ALISON','YVETTE','MELODY','LUZ','SUSIE','OLIVIA','FLORA','SHELLEY','KRISTY','MAMIE','LULA','LOLA','VERNA','BEULAH','ANTOINETTE','CANDICE','JUANA','JEANNETTE','PAM','KELLI','HANNAH','WHITNEY','BRIDGET','KARLA','CELIA','LATOYA','PATTY','SHELIA','GAYLE','DELLA','VICKY','LYNNE','SHERI','MARIANNE','KARA','JACQUELYN','ERMA','BLANCA','MYRA','LETICIA','PAT','KRISTA','ROXANNE','ANGELICA','JOHNNIE','ROBYN','FRANCIS','ADRIENNE','ROSALIE','ALEXANDRA','BROOKE','BETHANY','SADIE','BERNADETTE','TRACI','JODY','KENDRA','JASMINE','NICHOLE','RACHAEL','CHELSEA','MABLE','ERNESTINE','MURIEL','MARCELLA','ELENA','KRYSTAL','ANGELINA','NADINE','KARI','ESTELLE','DIANNA','PAULETTE','LORA','MONA','DOREEN','ROSEMARIE','ANGEL','DESIREE','ANTONIA','HOPE','GINGER','JANIS','BETSY','CHRISTIE','FREDA','MERCEDES','MEREDITH','LYNETTE','TERI','CRISTINA','EULA','LEIGH','MEGHAN','SOPHIA','ELOISE','ROCHELLE','GRETCHEN','CECELIA','RAQUEL','HENRIETTA','ALYSSA','JANA','KELLEY','GWEN','KERRY','JENNA','TRICIA','LAVERNE','OLIVE','ALEXIS','TASHA','SILVIA','ELVIRA','CASEY','DELIA','SOPHIE','KATE','PATTI','LORENA','KELLIE','SONJA','LILA','LANA','DARLA','MAY','MINDY','ESSIE','MANDY','LORENE','ELSA','JOSEFINA','JEANNIE','MIRANDA','DIXIE','LUCIA','MARTA','FAITH','LELA','JOHANNA','SHARI','CAMILLE','TAMI','SHAWNA','ELISA','EBONY','MELBA','ORA','NETTIE','TABITHA','OLLIE','JAIME','WINIFRED','KRISTIE','MARINA','ALISHA','AIMEE','RENA','MYRNA','MARLA','TAMMIE','LATASHA','BONITA','PATRICE','RONDA','SHERRIE','ADDIE','FRANCINE','DELORIS','STACIE','ADRIANA','CHERI','SHELBY','ABIGAIL','CELESTE','JEWEL','CARA','ADELE','REBEKAH','LUCINDA','DORTHY','CHRIS','EFFIE','TRINA','REBA','SHAWN','SALLIE','AURORA','LENORA','ETTA','LOTTIE','KERRI','TRISHA','NIKKI','ESTELLA','FRANCISCA','JOSIE','TRACIE','MARISSA','KARIN','BRITTNEY','JANELLE','LOURDES','LAUREL','HELENE','FERN','ELVA','CORINNE','KELSEY','INA','BETTIE','ELISABETH','AIDA','CAITLIN','INGRID','IVA','EUGENIA','CHRISTA','GOLDIE','CASSIE','MAUDE','JENIFER','THERESE','FRANKIE','DENA','LORNA','JANETTE','LATONYA','CANDY','MORGAN','CONSUELO','TAMIKA','ROSETTA','DEBORA','CHERIE','POLLY','DINA','JEWELL','FAY','JILLIAN','DOROTHEA','NELL','TRUDY','ESPERANZA','PATRICA','KIMBERLEY','SHANNA','HELENA','CAROLINA','CLEO','STEFANIE','ROSARIO','OLA','JANINE','MOLLIE','LUPE','ALISA','LOU','MARIBEL','SUSANNE','BETTE','SUSANA','ELISE','CECILE','ISABELLE','LESLEY','JOCELYN','PAIGE','JONI','RACHELLE','LEOLA','DAPHNE','ALTA','ESTER','PETRA','GRACIELA','IMOGENE','JOLENE','KEISHA','LACEY','GLENNA','GABRIELA','KERI','URSULA','LIZZIE','KIRSTEN','SHANA','ADELINE','MAYRA','JAYNE','JACLYN','GRACIE','SONDRA','CARMELA','MARISA','ROSALIND','CHARITY','TONIA','BEATRIZ','MARISOL','CLARICE','JEANINE','SHEENA','ANGELINE','FRIEDA','LILY','ROBBIE','SHAUNA','MILLIE','CLAUDETTE','CATHLEEN','ANGELIA','GABRIELLE','AUTUMN','KATHARINE','SUMMER','JODIE','STACI','LEA','CHRISTI','JIMMIE','JUSTINE','ELMA','LUELLA','MARGRET','DOMINIQUE','SOCORRO','RENE','MARTINA','MARGO','MAVIS','CALLIE','BOBBI','MARITZA','LUCILE','LEANNE','JEANNINE','DEANA','AILEEN','LORIE','LADONNA','WILLA','MANUELA','GALE','SELMA','DOLLY','SYBIL','ABBY','LARA','DALE','IVY','DEE','WINNIE','MARCY','LUISA','JERI','MAGDALENA','OFELIA','MEAGAN','AUDRA','MATILDA','LEILA','CORNELIA','BIANCA','SIMONE','BETTYE','RANDI','VIRGIE','LATISHA','BARBRA','GEORGINA','ELIZA','LEANN','BRIDGETTE','RHODA','HALEY','ADELA','NOLA','BERNADINE','FLOSSIE','ILA','GRETA','RUTHIE','NELDA','MINERVA','LILLY','TERRIE','LETHA','HILARY','ESTELA','VALARIE','BRIANNA','ROSALYN','EARLINE','CATALINA','AVA','MIA','CLARISSA','LIDIA','CORRINE','ALEXANDRIA','CONCEPCION','TIA','SHARRON','RAE','DONA','ERICKA','JAMI','ELNORA','CHANDRA','LENORE','NEVA','MARYLOU','MELISA','TABATHA','SERENA','AVIS','ALLIE','SOFIA','JEANIE','ODESSA','NANNIE','HARRIETT','LORAINE','PENELOPE','MILAGROS','EMILIA','BENITA','ALLYSON','ASHLEE','TANIA','TOMMIE','ESMERALDA','KARINA','EVE','PEARLIE','ZELMA','MALINDA','NOREEN','TAMEKA','SAUNDRA','HILLARY','AMIE','ALTHEA','ROSALINDA','JORDAN','LILIA','ALANA','GAY','CLARE','ALEJANDRA','ELINOR','MICHAEL','LORRIE','JERRI','DARCY','EARNESTINE','CARMELLA','TAYLOR','NOEMI','MARCIE','LIZA','ANNABELLE','LOUISA','EARLENE','MALLORY','CARLENE','NITA','SELENA','TANISHA','KATY','JULIANNE','JOHN','LAKISHA','EDWINA','MARICELA','MARGERY','KENYA','DOLLIE','ROXIE','ROSLYN','KATHRINE','NANETTE','CHARMAINE','LAVONNE','ILENE','KRIS','TAMMI','SUZETTE','CORINE','KAYE','JERRY','MERLE','CHRYSTAL','LINA','DEANNE','LILIAN','JULIANA','ALINE','LUANN','KASEY','MARYANNE','EVANGELINE','COLETTE','MELVA','LAWANDA','YESENIA','NADIA','MADGE','KATHIE','EDDIE','OPHELIA','VALERIA','NONA','MITZI','MARI','GEORGETTE','CLAUDINE','FRAN','ALISSA','ROSEANN','LAKEISHA','SUSANNA','REVA','DEIDRE','CHASITY','SHEREE','CARLY','JAMES','ELVIA','ALYCE','DEIRDRE','GENA','BRIANA','ARACELI','KATELYN','ROSANNE','WENDI','TESSA','BERTA','MARVA','IMELDA','MARIETTA','MARCI','LEONOR','ARLINE','SASHA','MADELYN','JANNA','JULIETTE','DEENA','AURELIA','JOSEFA','AUGUSTA','LILIANA','YOUNG','CHRISTIAN','LESSIE','AMALIA','SAVANNAH','ANASTASIA','VILMA','NATALIA','ROSELLA','LYNNETTE','CORINA','ALFREDA','LEANNA','CAREY','AMPARO','COLEEN','TAMRA','AISHA','WILDA','KARYN','CHERRY','QUEEN','MAURA','MAI','EVANGELINA','ROSANNA','HALLIE','ERNA','ENID','MARIANA','LACY','JULIET','JACKLYN','FREIDA','MADELEINE','MARA','HESTER','CATHRYN','LELIA','CASANDRA','BRIDGETT','ANGELITA','JANNIE','DIONNE','ANNMARIE','KATINA','BERYL','PHOEBE','MILLICENT','KATHERYN','DIANN','CARISSA','MARYELLEN','LIZ','LAURI','HELGA','GILDA','ADRIAN','RHEA','MARQUITA','HOLLIE','TISHA','TAMERA','ANGELIQUE','FRANCESCA','BRITNEY','KAITLIN','LOLITA','FLORINE','ROWENA','REYNA','TWILA','FANNY','JANELL','INES','CONCETTA','BERTIE','ALBA','BRIGITTE','ALYSON','VONDA','PANSY','ELBA','NOELLE','LETITIA','KITTY','DEANN','BRANDIE','LOUELLA','LETA','FELECIA','SHARLENE','LESA','BEVERLEY','ROBERT','ISABELLA','HERMINIA','TERRA','CELINA','TORI','OCTAVIA','JADE','DENICE','GERMAINE','SIERRA','MICHELL','CORTNEY','NELLY','DORETHA','SYDNEY','DEIDRA','MONIKA','LASHONDA','JUDI','CHELSEY','ANTIONETTE','MARGOT','BOBBY','ADELAIDE','NAN','LEEANN','ELISHA','DESSIE','LIBBY','KATHI','GAYLA','LATANYA','MINA','MELLISA','KIMBERLEE','JASMIN','RENAE','ZELDA','ELDA','MA','JUSTINA','GUSSIE','EMILIE','CAMILLA','ABBIE','ROCIO','KAITLYN','JESSE','EDYTHE','ASHLEIGH','SELINA','LAKESHA','GERI','ALLENE','PAMALA','MICHAELA','DAYNA','CARYN','ROSALIA','SUN','JACQULINE','REBECA','MARYBETH','KRYSTLE','IOLA','DOTTIE','BENNIE','BELLE','AUBREY','GRISELDA','ERNESTINA','ELIDA','ADRIANNE','DEMETRIA','DELMA','CHONG','JAQUELINE','DESTINY','ARLEEN','VIRGINA','RETHA','FATIMA','TILLIE','ELEANORE','CARI','TREVA','BIRDIE','WILHELMINA','ROSALEE','MAURINE','LATRICE','YONG','JENA','TARYN','ELIA','DEBBY','MAUDIE','JEANNA','DELILAH','CATRINA','SHONDA','HORTENCIA','THEODORA','TERESITA','ROBBIN','DANETTE','MARYJANE','FREDDIE','DELPHINE','BRIANNE','NILDA','DANNA','CINDI','BESS','IONA','HANNA','ARIEL','WINONA','VIDA','ROSITA','MARIANNA','WILLIAM','RACHEAL','GUILLERMINA','ELOISA','CELESTINE','CAREN','MALISSA','LONA','CHANTEL','SHELLIE','MARISELA','LEORA','AGATHA','SOLEDAD','MIGDALIA','IVETTE','CHRISTEN','ATHENA','JANEL','CHLOE','VEDA','PATTIE','TESSIE','TERA','MARILYNN','LUCRETIA','KARRIE','DINAH','DANIELA','ALECIA','ADELINA','VERNICE','SHIELA','PORTIA','MERRY','LASHAWN','DEVON','DARA','TAWANA','OMA','VERDA','CHRISTIN','ALENE','ZELLA','SANDI','RAFAELA','MAYA','KIRA','CANDIDA','ALVINA','SUZAN','SHAYLA','LYN','LETTIE','ALVA','SAMATHA','ORALIA','MATILDE','MADONNA','LARISSA','VESTA','RENITA','INDIA','DELOIS','SHANDA','PHILLIS','LORRI','ERLINDA','CRUZ','CATHRINE','BARB','ZOE','ISABELL','IONE','GISELA','CHARLIE','VALENCIA','ROXANNA','MAYME','KISHA','ELLIE','MELLISSA','DORRIS','DALIA','BELLA','ANNETTA','ZOILA','RETA','REINA','LAURETTA','KYLIE','CHRISTAL','PILAR','CHARLA','ELISSA','TIFFANI','TANA','PAULINA','LEOTA','BREANNA','JAYME','CARMEL','VERNELL','TOMASA','MANDI','DOMINGA','SANTA','MELODIE','LURA','ALEXA','TAMELA','RYAN','MIRNA','KERRIE','VENUS','NOEL','FELICITA','CRISTY','CARMELITA','BERNIECE','ANNEMARIE','TIARA','ROSEANNE','MISSY','CORI','ROXANA','PRICILLA','KRISTAL','JUNG','ELYSE','HAYDEE','ALETHA','BETTINA','MARGE','GILLIAN','FILOMENA','CHARLES','ZENAIDA','HARRIETTE','CARIDAD','VADA','UNA','ARETHA','PEARLINE','MARJORY','MARCELA','FLOR','EVETTE','ELOUISE','ALINA','TRINIDAD','DAVID','DAMARIS','CATHARINE','CARROLL','BELVA','NAKIA','MARLENA','LUANNE','LORINE','KARON','DORENE','DANITA','BRENNA','TATIANA','SAMMIE','LOUANN','LOREN','JULIANNA','ANDRIA','PHILOMENA','LUCILA','LEONORA','DOVIE','ROMONA','MIMI','JACQUELIN','GAYE','TONJA','MISTI','JOE','GENE','CHASTITY','STACIA','ROXANN','MICAELA','NIKITA','MEI','VELDA','MARLYS','JOHNNA','AURA','LAVERN','IVONNE','HAYLEY','NICKI','MAJORIE','HERLINDA','GEORGE','ALPHA','YADIRA','PERLA','GREGORIA','DANIEL','ANTONETTE','SHELLI','MOZELLE','MARIAH','JOELLE','CORDELIA','JOSETTE','CHIQUITA','TRISTA','LOUIS','LAQUITA','GEORGIANA','CANDI','SHANON','LONNIE','HILDEGARD','CECIL','VALENTINA','STEPHANY','MAGDA','KAROL','GERRY','GABRIELLA','TIANA','ROMA','RICHELLE','RAY','PRINCESS','OLETA','JACQUE','IDELLA','ALAINA','SUZANNA','JOVITA','BLAIR','TOSHA','RAVEN','NEREIDA','MARLYN','KYLA','JOSEPH','DELFINA','TENA','STEPHENIE','SABINA','NATHALIE','MARCELLE','GERTIE','DARLEEN','THEA','SHARONDA','SHANTEL','BELEN','VENESSA','ROSALINA','ONA','GENOVEVA','COREY','CLEMENTINE','ROSALBA','RENATE','RENATA','MI','IVORY','GEORGIANNA','FLOY','DORCAS','ARIANA','TYRA','THEDA','MARIAM','JULI','JESICA','DONNIE','VIKKI','VERLA','ROSELYN','MELVINA','JANNETTE','GINNY','DEBRAH','CORRIE','ASIA','VIOLETA','MYRTIS','LATRICIA','COLLETTE','CHARLEEN','ANISSA','VIVIANA','TWYLA','PRECIOUS','NEDRA','LATONIA','LAN','HELLEN','FABIOLA','ANNAMARIE','ADELL','SHARYN','CHANTAL','NIKI','MAUD','LIZETTE','LINDY','KIA','KESHA','JEANA','DANELLE','CHARLINE','CHANEL','CARROL','VALORIE','LIA','DORTHA','CRISTAL','SUNNY','LEONE','LEILANI','GERRI','DEBI','ANDRA','KESHIA','IMA','EULALIA','EASTER','DULCE','NATIVIDAD','LINNIE','KAMI','GEORGIE','CATINA','BROOK','ALDA','WINNIFRED','SHARLA','RUTHANN','MEAGHAN','MAGDALENE','LISSETTE','ADELAIDA','VENITA','TRENA','SHIRLENE','SHAMEKA','ELIZEBETH','DIAN','SHANTA','MICKEY','LATOSHA','CARLOTTA','WINDY','SOON','ROSINA','MARIANN','LEISA','JONNIE','DAWNA','CATHIE','BILLY','ASTRID','SIDNEY','LAUREEN','JANEEN','HOLLI','FAWN','VICKEY','TERESSA','SHANTE','RUBYE','MARCELINA','CHANDA','CARY','TERESE','SCARLETT','MARTY','MARNIE','LULU','LISETTE','JENIFFER','ELENOR','DORINDA','DONITA','CARMAN','BERNITA','ALTAGRACIA','ALETA','ADRIANNA','ZORAIDA','RONNIE','NICOLA','LYNDSEY','KENDALL','JANINA','CHRISSY','AMI','STARLA','PHYLIS','PHUONG','KYRA','CHARISSE','BLANCH','SANJUANITA','RONA','NANCI','MARILEE','MARANDA','CORY','BRIGETTE','SANJUANA','MARITA','KASSANDRA','JOYCELYN','IRA','FELIPA','CHELSIE','BONNY','MIREYA','LORENZA','KYONG','ILEANA','CANDELARIA','TONY','TOBY','SHERIE','OK','MARK','LUCIE','LEATRICE','LAKESHIA','GERDA','EDIE','BAMBI','MARYLIN','LAVON','HORTENSE','GARNET','EVIE','TRESSA','SHAYNA','LAVINA','KYUNG','JEANETTA','SHERRILL','SHARA','PHYLISS','MITTIE','ANABEL','ALESIA','THUY','TAWANDA','RICHARD','JOANIE','TIFFANIE','LASHANDA','KARISSA','ENRIQUETA','DARIA','DANIELLA','CORINNA','ALANNA','ABBEY','ROXANE','ROSEANNA','MAGNOLIA','LIDA','KYLE','JOELLEN','ERA','CORAL','CARLEEN','TRESA','PEGGIE','NOVELLA','NILA','MAYBELLE','JENELLE','CARINA','NOVA','MELINA','MARQUERITE','MARGARETTE','JOSEPHINA','EVONNE','DEVIN','CINTHIA','ALBINA','TOYA','TAWNYA','SHERITA','SANTOS','MYRIAM','LIZABETH','LISE','KEELY','JENNI','GISELLE','CHERYLE','ARDITH','ARDIS','ALESHA','ADRIANE','SHAINA','LINNEA','KAROLYN','HONG','FLORIDA','FELISHA','DORI','DARCI','ARTIE','ARMIDA','ZOLA','XIOMARA','VERGIE','SHAMIKA','NENA','NANNETTE','MAXIE','LOVIE','JEANE','JAIMIE','INGE','FARRAH','ELAINA','CAITLYN','STARR','FELICITAS','CHERLY','CARYL','YOLONDA','YASMIN','TEENA','PRUDENCE','PENNIE','NYDIA','MACKENZIE','ORPHA','MARVEL','LIZBETH','LAURETTE','JERRIE','HERMELINDA','CAROLEE','TIERRA','MIRIAN','META','MELONY','KORI','JENNETTE','JAMILA','ENA','ANH','YOSHIKO','SUSANNAH','SALINA','RHIANNON','JOLEEN','CRISTINE','ASHTON','ARACELY','TOMEKA','SHALONDA','MARTI','LACIE','KALA','JADA','ILSE','HAILEY','BRITTANI','ZONA','SYBLE','SHERRYL','RANDY','NIDIA','MARLO','KANDICE','KANDI','DEB','DEAN','AMERICA','ALYCIA','TOMMY','RONNA','NORENE','MERCY','JOSE','INGEBORG','GIOVANNA','GEMMA','CHRISTEL','AUDRY','ZORA','VITA','VAN','TRISH','STEPHAINE','SHIRLEE','SHANIKA','MELONIE','MAZIE','JAZMIN','INGA','HOA','HETTIE','GERALYN','FONDA','ESTRELLA','ADELLA','SU','SARITA','RINA','MILISSA','MARIBETH','GOLDA','EVON','ETHELYN','ENEDINA','CHERISE','CHANA','VELVA','TAWANNA','SADE','MIRTA','LI','KARIE','JACINTA','ELNA','DAVINA','CIERRA','ASHLIE','ALBERTHA','TANESHA','STEPHANI','NELLE','MINDI','LU','LORINDA','LARUE','FLORENE','DEMETRA','DEDRA','CIARA','CHANTELLE','ASHLY','SUZY','ROSALVA','NOELIA','LYDA','LEATHA','KRYSTYNA','KRISTAN','KARRI','DARLINE','DARCIE','CINDA','CHEYENNE','CHERRIE','AWILDA','ALMEDA','ROLANDA','LANETTE','JERILYN','GISELE','EVALYN','CYNDI','CLETA','CARIN','ZINA','ZENA','VELIA','TANIKA','PAUL','CHARISSA','THOMAS','TALIA','MARGARETE','LAVONDA','KAYLEE','KATHLENE','JONNA','IRENA','ILONA','IDALIA','CANDIS','CANDANCE','BRANDEE','ANITRA','ALIDA','SIGRID','NICOLETTE','MARYJO','LINETTE','HEDWIG','CHRISTIANA','CASSIDY','ALEXIA','TRESSIE','MODESTA','LUPITA','LITA','GLADIS','EVELIA','DAVIDA','CHERRI','CECILY','ASHELY','ANNABEL','AGUSTINA','WANITA','SHIRLY','ROSAURA','HULDA','EUN','BAILEY','YETTA','VERONA','THOMASINA','SIBYL','SHANNAN','MECHELLE','LUE','LEANDRA','LANI','KYLEE','KANDY','JOLYNN','FERNE','EBONI','CORENE','ALYSIA','ZULA','NADA','MOIRA','LYNDSAY','LORRETTA','JUAN','JAMMIE','HORTENSIA','GAYNELL','CAMERON','ADRIA','VINA','VICENTA','TANGELA','STEPHINE','NORINE','NELLA','LIANA','LESLEE','KIMBERELY','ILIANA','GLORY','FELICA','EMOGENE','ELFRIEDE','EDEN','EARTHA','CARMA','BEA','OCIE','MARRY','LENNIE','KIARA','JACALYN','CARLOTA','ARIELLE','YU','STAR','OTILIA','KIRSTIN','KACEY','JOHNETTA','JOEY','JOETTA','JERALDINE','JAUNITA','ELANA','DORTHEA','CAMI','AMADA','ADELIA','VERNITA','TAMAR','SIOBHAN','RENEA','RASHIDA','OUIDA','ODELL','NILSA','MERYL','KRISTYN','JULIETA','DANICA','BREANNE','AUREA','ANGLEA','SHERRON','ODETTE','MALIA','LORELEI','LIN','LEESA','KENNA','KATHLYN','FIONA','CHARLETTE','SUZIE','SHANTELL','SABRA','RACQUEL','MYONG','MIRA','MARTINE','LUCIENNE','LAVADA','JULIANN','JOHNIE','ELVERA','DELPHIA','CLAIR','CHRISTIANE','CHAROLETTE','CARRI','AUGUSTINE','ASHA','ANGELLA','PAOLA','NINFA','LEDA','LAI','EDA','SUNSHINE','STEFANI','SHANELL','PALMA','MACHELLE','LISSA','KECIA','KATHRYNE','KARLENE','JULISSA','JETTIE','JENNIFFER','HUI','CORRINA','CHRISTOPHER','CAROLANN','ALENA','TESS','ROSARIA','MYRTICE','MARYLEE','LIANE','KENYATTA','JUDIE','JANEY','IN','ELMIRA','ELDORA','DENNA','CRISTI','CATHI','ZAIDA','VONNIE','VIVA','VERNIE','ROSALINE','MARIELA','LUCIANA','LESLI','KARAN','FELICE','DENEEN','ADINA','WYNONA','TARSHA','SHERON','SHASTA','SHANITA','SHANI','SHANDRA','RANDA','PINKIE','PARIS','NELIDA','MARILOU','LYLA','LAURENE','LACI','JOI','JANENE','DOROTHA','DANIELE','DANI','CAROLYNN','CARLYN','BERENICE','AYESHA','ANNELIESE','ALETHEA','THERSA','TAMIKO','RUFINA','OLIVA','MOZELL','MARYLYN','MADISON','KRISTIAN','KATHYRN','KASANDRA','KANDACE','JANAE','GABRIEL','DOMENICA','DEBBRA','DANNIELLE','CHUN','BUFFY','BARBIE','ARCELIA','AJA','ZENOBIA','SHAREN','SHAREE','PATRICK','PAGE','MY','LAVINIA','KUM','KACIE','JACKELINE','HUONG','FELISA','EMELIA','ELEANORA','CYTHIA','CRISTIN','CLYDE','CLARIBEL','CARON','ANASTACIA','ZULMA','ZANDRA','YOKO','TENISHA','SUSANN','SHERILYN','SHAY','SHAWANDA','SABINE','ROMANA','MATHILDA','LINSEY','KEIKO','JOANA','ISELA','GRETTA','GEORGETTA','EUGENIE','DUSTY','DESIRAE','DELORA','CORAZON','ANTONINA','ANIKA','WILLENE','TRACEE','TAMATHA','REGAN','NICHELLE','MICKIE','MAEGAN','LUANA','LANITA','KELSIE','EDELMIRA','BREE','AFTON','TEODORA','TAMIE','SHENA','MEG','LINH','KELI','KACI','DANYELLE','BRITT','ARLETTE','ALBERTINE','ADELLE','TIFFINY','STORMY','SIMONA','NUMBERS','NICOLASA','NICHOL','NIA','NAKISHA','MEE','MAIRA','LOREEN','KIZZY','JOHNNY','JAY','FALLON','CHRISTENE','BOBBYE','ANTHONY','YING','VINCENZA','TANJA','RUBIE','RONI','QUEENIE','MARGARETT','KIMBERLI','IRMGARD','IDELL','HILMA','EVELINA','ESTA','EMILEE','DENNISE','DANIA','CARL','CARIE','ANTONIO','WAI','SANG','RISA','RIKKI','PARTICIA','MUI','MASAKO','MARIO','LUVENIA','LOREE','LONI','LIEN','KEVIN','GIGI','FLORENCIA','DORIAN','DENITA','DALLAS','CHI','BILLYE','ALEXANDER','TOMIKA','SHARITA','RANA','NIKOLE','NEOMA','MARGARITE','MADALYN','LUCINA','LAILA','KALI','JENETTE','GABRIELE','EVELYNE','ELENORA','CLEMENTINA','ALEJANDRINA','ZULEMA','VIOLETTE','VANNESSA','THRESA','RETTA','PIA','PATIENCE','NOELLA','NICKIE','JONELL','DELTA','CHUNG','CHAYA','CAMELIA','BETHEL','ANYA','ANDREW','THANH','SUZANN','SPRING','SHU','MILA','LILLA','LAVERNA','KEESHA','KATTIE','GIA','GEORGENE','EVELINE','ESTELL','ELIZBETH','VIVIENNE','VALLIE','TRUDIE','STEPHANE','MICHEL','MAGALY','MADIE','KENYETTA','KARREN','JANETTA','HERMINE','HARMONY','DRUCILLA','DEBBI','CELESTINA','CANDIE','BRITNI','BECKIE','AMINA','ZITA','YUN','YOLANDE','VIVIEN','VERNETTA','TRUDI','SOMMER','PEARLE','PATRINA','OSSIE','NICOLLE','LOYCE','LETTY','LARISA','KATHARINA','JOSELYN','JONELLE','JENELL','IESHA','HEIDE','FLORINDA','FLORENTINA','FLO','ELODIA','DORINE','BRUNILDA','BRIGID','ASHLI','ARDELLA','TWANA','THU','TARAH','SUNG','SHEA','SHAVON','SHANE','SERINA','RAYNA','RAMONITA','NGA','MARGURITE','LUCRECIA','KOURTNEY','KATI','JESUS','JESENIA','DIAMOND','CRISTA','AYANA','ALICA','ALIA','VINNIE','SUELLEN','ROMELIA','RACHELL','PIPER','OLYMPIA','MICHIKO','KATHALEEN','JOLIE','JESSI','JANESSA','HANA','HA','ELEASE','CARLETTA','BRITANY','SHONA','SALOME','ROSAMOND','REGENA','RAINA','NGOC','NELIA','LOUVENIA','LESIA','LATRINA','LATICIA','LARHONDA','JINA','JACKI','HOLLIS','HOLLEY','EMMY','DEEANN','CORETTA','ARNETTA','VELVET','THALIA','SHANICE','NETA','MIKKI','MICKI','LONNA','LEANA','LASHUNDA','KILEY','JOYE','JACQULYN','IGNACIA','HYUN','HIROKO','HENRY','HENRIETTE','ELAYNE','DELINDA','DARNELL','DAHLIA','COREEN','CONSUELA','CONCHITA','CELINE','BABETTE','AYANNA','ANETTE','ALBERTINA','SKYE','SHAWNEE','SHANEKA','QUIANA','PAMELIA','MIN','MERRI','MERLENE','MARGIT','KIESHA','KIERA','KAYLENE','JODEE','JENISE','ERLENE','EMMIE','ELSE','DARYL','DALILA','DAISEY','CODY','CASIE','BELIA','BABARA','VERSIE','VANESA','SHELBA','SHAWNDA','SAM','NORMAN','NIKIA','NAOMA','MARNA','MARGERET','MADALINE','LAWANA','KINDRA','JUTTA','JAZMINE','JANETT','HANNELORE','GLENDORA','GERTRUD','GARNETT','FREEDA','FREDERICA','FLORANCE','FLAVIA','DENNIS','CARLINE','BEVERLEE','ANJANETTE','VALDA','TRINITY','TAMALA','STEVIE','SHONNA','SHA','SARINA','ONEIDA','MICAH','MERILYN','MARLEEN','LURLINE','LENNA','KATHERIN','JIN','JENI','HAE','GRACIA','GLADY','FARAH','ERIC','ENOLA','EMA','DOMINQUE','DEVONA','DELANA','CECILA','CAPRICE','ALYSHA','ALI','ALETHIA','VENA','THERESIA','TAWNY','SONG','SHAKIRA','SAMARA','SACHIKO','RACHELE','PAMELLA','NICKY','MARNI','MARIEL','MAREN','MALISA','LIGIA','LERA','LATORIA','LARAE','KIMBER','KATHERN','KAREY','JENNEFER','JANETH','HALINA','FREDIA','DELISA','DEBROAH','CIERA','CHIN','ANGELIKA','ANDREE','ALTHA','YEN','VIVAN','TERRESA','TANNA','SUK','SUDIE','SOO','SIGNE','SALENA','RONNI','REBBECCA','MYRTIE','MCKENZIE','MALIKA','MAIDA','LOAN','LEONARDA','KAYLEIGH','FRANCE','ETHYL','ELLYN','DAYLE','CAMMIE','BRITTNI','BIRGIT','AVELINA','ASUNCION','ARIANNA','AKIKO','VENICE','TYESHA','TONIE','TIESHA','TAKISHA','STEFFANIE','SINDY','SANTANA','MEGHANN','MANDA','MACIE','LADY','KELLYE','KELLEE','JOSLYN','JASON','INGER','INDIRA','GLINDA','GLENNIS','FERNANDA','FAUSTINA','ENEIDA','ELICIA','DOT','DIGNA','DELL','ARLETTA','ANDRE','WILLIA','TAMMARA','TABETHA','SHERRELL','SARI','REFUGIO','REBBECA','PAULETTA','NIEVES','NATOSHA','NAKITA','MAMMIE','KENISHA','KAZUKO','KASSIE','GARY','EARLEAN','DAPHINE','CORLISS','CLOTILDE','CAROLYNE','BERNETTA','AUGUSTINA','AUDREA','ANNIS','ANNABELL','YAN','TENNILLE','TAMICA','SELENE','SEAN','ROSANA','REGENIA','QIANA','MARKITA','MACY','LEEANNE','LAURINE','KYM','JESSENIA','JANITA','GEORGINE','GENIE','EMIKO','ELVIE','DEANDRA','DAGMAR','CORIE','COLLEN','CHERISH','ROMAINE','PORSHA','PEARLENE','MICHELINE','MERNA','MARGORIE','MARGARETTA','LORE','KENNETH','JENINE','HERMINA','FREDERICKA','ELKE','DRUSILLA','DORATHY','DIONE','DESIRE','CELENA','BRIGIDA','ANGELES','ALLEGRA','THEO','TAMEKIA','SYNTHIA','STEPHEN','SOOK','SLYVIA','ROSANN','REATHA','RAYE','MARQUETTA','MARGART','LING','LAYLA','KYMBERLY','KIANA','KAYLEEN','KATLYN','KARMEN','JOELLA','IRINA','EMELDA','ELENI','DETRA','CLEMMIE','CHERYLL','CHANTELL','CATHEY','ARNITA','ARLA','ANGLE','ANGELIC','ALYSE','ZOFIA','THOMASINE','TENNIE','SON','SHERLY','SHERLEY','SHARYL','REMEDIOS','PETRINA','NICKOLE','MYUNG','MYRLE','MOZELLA','LOUANNE','LISHA','LATIA','LANE','KRYSTA','JULIENNE','JOEL','JEANENE','JACQUALINE','ISAURA','GWENDA','EARLEEN','DONALD','CLEOPATRA','CARLIE','AUDIE','ANTONIETTA','ALISE','ALEX','VERDELL','VAL','TYLER','TOMOKO','THAO','TALISHA','STEVEN','SO','SHEMIKA','SHAUN','SCARLET','SAVANNA','SANTINA','ROSIA','RAEANN','ODILIA','NANA','MINNA','MAGAN','LYNELLE','LE','KARMA','JOEANN','IVANA','INELL','ILANA','HYE','HONEY','HEE','GUDRUN','FRANK','DREAMA','CRISSY','CHANTE','CARMELINA','ARVILLA','ARTHUR','ANNAMAE','ALVERA','ALEIDA','AARON','YEE','YANIRA','VANDA','TIANNA','TAM','STEFANIA','SHIRA','PERRY','NICOL','NANCIE','MONSERRATE','MINH','MELYNDA','MELANY','MATTHEW','LOVELLA','LAURE','KIRBY','KACY','JACQUELYNN','HYON','GERTHA','FRANCISCO','ELIANA','CHRISTENA','CHRISTEEN','CHARISE','CATERINA','CARLEY','CANDYCE','ARLENA','AMMIE','YANG','WILLETTE','VANITA','TUYET','TINY','SYREETA','SILVA','SCOTT','RONALD','PENNEY','NYLA','MICHAL','MAURICE','MARYAM','MARYA','MAGEN','LUDIE','LOMA','LIVIA','LANELL','KIMBERLIE','JULEE','DONETTA','DIEDRA','DENISHA','DEANE','DAWNE','CLARINE','CHERRYL','BRONWYN','BRANDON','ALLA','VALERY','TONDA','SUEANN','SORAYA','SHOSHANA','SHELA','SHARLEEN','SHANELLE','NERISSA','MICHEAL','MERIDITH','MELLIE','MAYE','MAPLE','MAGARET','LUIS','LILI','LEONILA','LEONIE','LEEANNA','LAVONIA','LAVERA','KRISTEL','KATHEY','KATHE','JUSTIN','JULIAN','JIMMY','JANN','ILDA','HILDRED','HILDEGARDE','GENIA','FUMIKO','EVELIN','ERMELINDA','ELLY','DUNG','DOLORIS','DIONNA','DANAE','BERNEICE','ANNICE','ALIX','VERENA','VERDIE','TRISTAN','SHAWNNA','SHAWANA','SHAUNNA','ROZELLA','RANDEE','RANAE','MILAGRO','LYNELL','LUISE','LOUIE','LOIDA','LISBETH','KARLEEN','JUNITA','JONA','ISIS','HYACINTH','HEDY','GWENN','ETHELENE','ERLINE','EDWARD','DONYA','DOMONIQUE','DELICIA','DANNETTE','CICELY','BRANDA','BLYTHE','BETHANN','ASHLYN','ANNALEE','ALLINE','YUKO','VELLA','TRANG','TOWANDA','TESHA','SHERLYN','NARCISA','MIGUELINA','MERI','MAYBELL','MARLANA','MARGUERITA','MADLYN','LUNA','LORY','LORIANN','LIBERTY','LEONORE','LEIGHANN','LAURICE','LATESHA','LARONDA','KATRICE','KASIE','KARL','KALEY','JADWIGA','GLENNIE','GEARLDINE','FRANCINA','EPIFANIA','DYAN','DORIE','DIEDRE','DENESE','DEMETRICE','DELENA','DARBY','CRISTIE','CLEORA','CATARINA','CARISA','BERNIE','BARBERA','ALMETA','TRULA','TEREASA','SOLANGE','SHEILAH','SHAVONNE','SANORA','ROCHELL','MATHILDE','MARGARETA','MAIA','LYNSEY','LAWANNA','LAUNA','KENA','KEENA','KATIA','JAMEY','GLYNDA','GAYLENE','ELVINA','ELANOR','DANUTA','DANIKA','CRISTEN','CORDIE','COLETTA','CLARITA','CARMON','BRYNN','AZUCENA','AUNDREA','ANGELE','YI','WALTER','VERLIE','VERLENE','TAMESHA','SILVANA','SEBRINA','SAMIRA','REDA','RAYLENE','PENNI','PANDORA','NORAH','NOMA','MIREILLE','MELISSIA','MARYALICE','LARAINE','KIMBERY','KARYL','KARINE','KAM','JOLANDA','JOHANA','JESUSA','JALEESA','JAE','JACQUELYNE','IRISH','ILUMINADA','HILARIA','HANH','GENNIE','FRANCIE','FLORETTA','EXIE','EDDA','DREMA','DELPHA','BEV','BARBAR','ASSUNTA','ARDELL','ANNALISA','ALISIA','YUKIKO','YOLANDO','WONDA','WEI','WALTRAUD','VETA','TEQUILA','TEMEKA','TAMEIKA','SHIRLEEN','SHENITA','PIEDAD','OZELLA','MIRTHA','MARILU','KIMIKO','JULIANE','JENICE','JEN','JANAY','JACQUILINE','HILDE','FE','FAE','EVAN','EUGENE','ELOIS','ECHO','DEVORAH','CHAU','BRINDA','BETSEY','ARMINDA','ARACELIS','APRYL','ANNETT','ALISHIA','VEOLA','USHA','TOSHIKO','THEOLA','TASHIA','TALITHA','SHERY','RUDY','RENETTA','REIKO','RASHEEDA','OMEGA','OBDULIA','MIKA','MELAINE','MEGGAN','MARTIN','MARLEN','MARGET','MARCELINE','MANA','MAGDALEN','LIBRADA','LEZLIE','LEXIE','LATASHIA','LASANDRA','KELLE','ISIDRA','ISA','INOCENCIA','GWYN','FRANCOISE','ERMINIA','ERINN','DIMPLE','DEVORA','CRISELDA','ARMANDA','ARIE','ARIANE','ANGELO','ANGELENA','ALLEN','ALIZA','ADRIENE','ADALINE','XOCHITL','TWANNA','TRAN','TOMIKO','TAMISHA','TAISHA','SUSY','SIU','RUTHA','ROXY','RHONA','RAYMOND','OTHA','NORIKO','NATASHIA','MERRIE','MELVIN','MARINDA','MARIKO','MARGERT','LORIS','LIZZETTE','LEISHA','KAILA','KA','JOANNIE','JERRICA','JENE','JANNET','JANEE','JACINDA','HERTA','ELENORE','DORETTA','DELAINE','DANIELL','CLAUDIE','CHINA','BRITTA','APOLONIA','AMBERLY','ALEASE','YURI','YUK','WEN','WANETA','UTE','TOMI','SHARRI','SANDIE','ROSELLE','REYNALDA','RAGUEL','PHYLICIA','PATRIA','OLIMPIA','ODELIA','MITZIE','MITCHELL','MISS','MINDA','MIGNON','MICA','MENDY','MARIVEL','MAILE','LYNETTA','LAVETTE','LAURYN','LATRISHA','LAKIESHA','KIERSTEN','KARY','JOSPHINE','JOLYN','JETTA','JANISE','JACQUIE','IVELISSE','GLYNIS','GIANNA','GAYNELLE','EMERALD','DEMETRIUS','DANYELL','DANILLE','DACIA','CORALEE','CHER','CEOLA','BRETT','BELL','ARIANNE','ALESHIA','YUNG','WILLIEMAE','TROY','TRINH','THORA','TAI','SVETLANA','SHERIKA','SHEMEKA','SHAUNDA','ROSELINE','RICKI','MELDA','MALLIE','LAVONNA','LATINA','LARRY','LAQUANDA','LALA','LACHELLE','KLARA','KANDIS','JOHNA','JEANMARIE','JAYE','HANG','GRAYCE','GERTUDE','EMERITA','EBONIE','CLORINDA','CHING','CHERY','CAROLA','BREANN','BLOSSOM','BERNARDINE','BECKI','ARLETHA','ARGELIA','ARA','ALITA','YULANDA','YON','YESSENIA','TOBI','TASIA','SYLVIE','SHIRL','SHIRELY','SHERIDAN','SHELLA','SHANTELLE','SACHA','ROYCE','REBECKA','REAGAN','PROVIDENCIA','PAULENE','MISHA','MIKI','MARLINE','MARICA','LORITA','LATOYIA','LASONYA','KERSTIN','KENDA','KEITHA','KATHRIN','JAYMIE','JACK','GRICELDA','GINETTE','ERYN','ELINA','ELFRIEDA','DANYEL','CHEREE','CHANELLE','BARRIE','AVERY','AURORE','ANNAMARIA','ALLEEN','AILENE','AIDE','YASMINE','VASHTI','VALENTINE','TREASA','TORY','TIFFANEY','SHERYLL','SHARIE','SHANAE','SAU','RAISA','PA','NEDA','MITSUKO','MIRELLA','MILDA','MARYANNA','MARAGRET','MABELLE','LUETTA','LORINA','LETISHA','LATARSHA','LANELLE','LAJUANA','KRISSY','KARLY','KARENA','JON','JESSIKA','JERICA','JEANELLE','JANUARY','JALISA','JACELYN','IZOLA','IVEY','GREGORY','EUNA','ETHA','DREW','DOMITILA','DOMINICA','DAINA','CREOLA','CARLI','CAMIE','BUNNY','BRITTNY','ASHANTI','ANISHA','ALEEN','ADAH','YASUKO','WINTER','VIKI','VALRIE','TONA','TINISHA','THI','TERISA','TATUM','TANEKA','SIMONNE','SHALANDA','SERITA','RESSIE','REFUGIA','PAZ','OLENE','NA','MERRILL','MARGHERITA','MANDIE','MAN','MAIRE','LYNDIA','LUCI','LORRIANE','LORETA','LEONIA','LAVONA','LASHAWNDA','LAKIA','KYOKO','KRYSTINA','KRYSTEN','KENIA','KELSI','JUDE','JEANICE','ISOBEL','GEORGIANN','GENNY','FELICIDAD','EILENE','DEON','DELOISE','DEEDEE','DANNIE','CONCEPTION','CLORA','CHERILYN','CHANG','CALANDRA','BERRY','ARMANDINA','ANISA','ULA','TIMOTHY','TIERA','THERESSA','STEPHANIA','SIMA','SHYLA','SHONTA','SHERA','SHAQUITA','SHALA','SAMMY','ROSSANA','NOHEMI','NERY','MORIAH','MELITA','MELIDA','MELANI','MARYLYNN','MARISHA','MARIETTE','MALORIE','MADELENE','LUDIVINA','LORIA','LORETTE','LORALEE','LIANNE','LEON','LAVENIA','LAURINDA','LASHON','KIT','KIMI','KEILA','KATELYNN','KAI','JONE','JOANE','JI','JAYNA','JANELLA','JA','HUE','HERTHA','FRANCENE','ELINORE','DESPINA','DELSIE','DEEDRA','CLEMENCIA','CARRY','CAROLIN','CARLOS','BULAH','BRITTANIE','BOK','BLONDELL','BIBI','BEAULAH','BEATA','ANNITA','AGRIPINA','VIRGEN','VALENE','UN','TWANDA','TOMMYE','TOI','TARRA','TARI','TAMMERA','SHAKIA','SADYE','RUTHANNE','ROCHEL','RIVKA','PURA','NENITA','NATISHA','MING','MERRILEE','MELODEE','MARVIS','LUCILLA','LEENA','LAVETA','LARITA','LANIE','KEREN','ILEEN','GEORGEANN','GENNA','GENESIS','FRIDA','EWA','EUFEMIA','EMELY','ELA','EDYTH','DEONNA','DEADRA','DARLENA','CHANELL','CHAN','CATHERN','CASSONDRA','CASSAUNDRA','BERNARDA','BERNA','ARLINDA','ANAMARIA','ALBERT','WESLEY','VERTIE','VALERI','TORRI','TATYANA','STASIA','SHERISE','SHERILL','SEASON','SCOTTIE','SANDA','RUTHE','ROSY','ROBERTO','ROBBI','RANEE','QUYEN','PEARLY','PALMIRA','ONITA','NISHA','NIESHA','NIDA','NEVADA','NAM','MERLYN','MAYOLA','MARYLOUISE','MARYLAND','MARX','MARTH','MARGENE','MADELAINE','LONDA','LEONTINE','LEOMA','LEIA','LAWRENCE','LAURALEE','LANORA','LAKITA','KIYOKO','KETURAH','KATELIN','KAREEN','JONIE','JOHNETTE','JENEE','JEANETT','IZETTA','HIEDI','HEIKE','HASSIE','HAROLD','GIUSEPPINA','GEORGANN','FIDELA','FERNANDE','ELWANDA','ELLAMAE','ELIZ','DUSTI','DOTTY','CYNDY','CORALIE','CELESTA','ARGENTINA','ALVERTA','XENIA','WAVA','VANETTA','TORRIE','TASHINA','TANDY','TAMBRA','TAMA','STEPANIE','SHILA','SHAUNTA','SHARAN','SHANIQUA','SHAE','SETSUKO','SERAFINA','SANDEE','ROSAMARIA','PRISCILA','OLINDA','NADENE','MUOI','MICHELINA','MERCEDEZ','MARYROSE','MARIN','MARCENE','MAO','MAGALI','MAFALDA','LOGAN','LINN','LANNIE','KAYCE','KAROLINE','KAMILAH','KAMALA','JUSTA','JOLINE','JENNINE','JACQUETTA','IRAIDA','GERALD','GEORGEANNA','FRANCHESCA','FAIRY','EMELINE','ELANE','EHTEL','EARLIE','DULCIE','DALENE','CRIS','CLASSIE','CHERE','CHARIS','CAROYLN','CARMINA','CARITA','BRIAN','BETHANIE','AYAKO','ARICA','AN','ALYSA','ALESSANDRA','AKILAH','ADRIEN','ZETTA','YOULANDA','YELENA','YAHAIRA','XUAN','WENDOLYN','VICTOR','TIJUANA','TERRELL','TERINA','TERESIA','SUZI','SUNDAY','SHERELL','SHAVONDA','SHAUNTE','SHARDA','SHAKITA','SENA','RYANN','RUBI','RIVA','REGINIA','REA','RACHAL','PARTHENIA','PAMULA','MONNIE','MONET','MICHAELE','MELIA','MARINE','MALKA','MAISHA','LISANDRA','LEO','LEKISHA','LEAN','LAURENCE','LAKENDRA','KRYSTIN','KORTNEY','KIZZIE','KITTIE','KERA','KENDAL','KEMBERLY','KANISHA','JULENE','JULE','JOSHUA','JOHANNE','JEFFREY','JAMEE','HAN','HALLEY','GIDGET','GALINA','FREDRICKA','FLETA','FATIMAH','EUSEBIA','ELZA','ELEONORE','DORTHEY','DORIA','DONELLA','DINORAH','DELORSE','CLARETHA','CHRISTINIA','CHARLYN','BONG','BELKIS','AZZIE','ANDERA','AIKO','ADENA','YER','YAJAIRA','WAN','VANIA','ULRIKE','TOSHIA','TIFANY','STEFANY','SHIZUE','SHENIKA','SHAWANNA','SHAROLYN','SHARILYN','SHAQUANA','SHANTAY','SEE','ROZANNE','ROSELEE','RICKIE','REMONA','REANNA','RAELENE','QUINN','PHUNG','PETRONILA','NATACHA','NANCEY','MYRL','MIYOKO','MIESHA','MERIDETH','MARVELLA','MARQUITTA','MARHTA','MARCHELLE','LIZETH','LIBBIE','LAHOMA','LADAWN','KINA','KATHELEEN','KATHARYN','KARISA','KALEIGH','JUNIE','JULIEANN','JOHNSIE','JANEAN','JAIMEE','JACKQUELINE','HISAKO','HERMA','HELAINE','GWYNETH','GLENN','GITA','EUSTOLIA','EMELINA','ELIN','EDRIS','DONNETTE','DONNETTA','DIERDRE','DENAE','DARCEL','CLAUDE','CLARISA','CINDERELLA','CHIA','CHARLESETTA','CHARITA','CELSA','CASSY','CASSI','CARLEE','BRUNA','BRITTANEY','BRANDE','BILLI','BAO','ANTONETTA','ANGLA','ANGELYN','ANALISA','ALANE','WENONA','WENDIE','VERONIQUE','VANNESA','TOBIE','TEMPIE','SUMIKO','SULEMA','SPARKLE','SOMER','SHEBA','SHAYNE','SHARICE','SHANEL','SHALON','SAGE','ROY','ROSIO','ROSELIA','RENAY','REMA','REENA','PORSCHE','PING','PEG','OZIE','ORETHA','ORALEE','ODA','NU','NGAN','NAKESHA','MILLY','MARYBELLE','MARLIN','MARIS','MARGRETT','MARAGARET','MANIE','LURLENE','LILLIA','LIESELOTTE','LAVELLE','LASHAUNDA','LAKEESHA','KEITH','KAYCEE','KALYN','JOYA','JOETTE','JENAE','JANIECE','ILLA','GRISEL','GLAYDS','GENEVIE','GALA','FREDDA','FRED','ELMER','ELEONOR','DEBERA','DEANDREA','DAN','CORRINNE','CORDIA','CONTESSA','COLENE','CLEOTILDE','CHARLOTT','CHANTAY','CECILLE','BEATRIS','AZALEE','ARLEAN','ARDATH','ANJELICA','ANJA','ALFREDIA','ALEISHA','ADAM','ZADA','YUONNE','XIAO','WILLODEAN','WHITLEY','VENNIE','VANNA','TYISHA','TOVA','TORIE','TONISHA','TILDA','TIEN','TEMPLE','SIRENA','SHERRIL','SHANTI','SHAN','SENAIDA','SAMELLA','ROBBYN','RENDA','REITA','PHEBE','PAULITA','NOBUKO','NGUYET','NEOMI','MOON','MIKAELA','MELANIA','MAXIMINA','MARG','MAISIE','LYNNA','LILLI','LAYNE','LASHAUN','LAKENYA','LAEL','KIRSTIE','KATHLINE','KASHA','KARLYN','KARIMA','JOVAN','JOSEFINE','JENNELL','JACQUI','JACKELYN','HYO','HIEN','GRAZYNA','FLORRIE','FLORIA','ELEONORA','DWANA','DORLA','DONG','DELMY','DEJA','DEDE','DANN','CRYSTA','CLELIA','CLARIS','CLARENCE','CHIEKO','CHERLYN','CHERELLE','CHARMAIN','CHARA','CAMMY','BEE','ARNETTE','ARDELLE','ANNIKA','AMIEE','AMEE','ALLENA','YVONE','YUKI','YOSHIE','YEVETTE','YAEL','WILLETTA','VONCILE','VENETTA','TULA','TONETTE','TIMIKA','TEMIKA','TELMA','TEISHA','TAREN','TA','STACEE','SHIN','SHAWNTA','SATURNINA','RICARDA','POK','PASTY','ONIE','NUBIA','MORA','MIKE','MARIELLE','MARIELLA','MARIANELA','MARDELL','MANY','LUANNA','LOISE','LISABETH','LINDSY','LILLIANA','LILLIAM','LELAH','LEIGHA','LEANORA','LANG','KRISTEEN','KHALILAH','KEELEY','KANDRA','JUNKO','JOAQUINA','JERLENE','JANI','JAMIKA','JAME','HSIU','HERMILA','GOLDEN','GENEVIVE','EVIA','EUGENA','EMMALINE','ELFREDA','ELENE','DONETTE','DELCIE','DEEANNA','DARCEY','CUC','CLARINDA','CIRA','CHAE','CELINDA','CATHERYN','CATHERIN','CASIMIRA','CARMELIA','CAMELLIA','BREANA','BOBETTE','BERNARDINA','BEBE','BASILIA','ARLYNE','AMAL','ALAYNA','ZONIA','ZENIA','YURIKO','YAEKO','WYNELL','WILLOW','WILLENA','VERNIA','TU','TRAVIS','TORA','TERRILYN','TERICA','TENESHA','TAWNA','TAJUANA','TAINA','STEPHNIE','SONA','SOL','SINA','SHONDRA','SHIZUKO','SHERLENE','SHERICE','SHARIKA','ROSSIE','ROSENA','RORY','RIMA','RIA','RHEBA','RENNA','PETER','NATALYA','NANCEE','MELODI','MEDA','MAXIMA','MATHA','MARKETTA','MARICRUZ','MARCELENE','MALVINA','LUBA','LOUETTA','LEIDA','LECIA','LAURAN','LASHAWNA','LAINE','KHADIJAH','KATERINE','KASI','KALLIE','JULIETTA','JESUSITA','JESTINE','JESSIA','JEREMY','JEFFIE','JANYCE','ISADORA','GEORGIANNE','FIDELIA','EVITA','EURA','EULAH','ESTEFANA','ELSY','ELIZABET','ELADIA','DODIE','DION','DIA','DENISSE','DELORAS','DELILA','DAYSI','DAKOTA','CURTIS','CRYSTLE','CONCHA','COLBY','CLARETTA','CHU','CHRISTIA','CHARLSIE','CHARLENA','CARYLON','BETTYANN','ASLEY','ASHLEA','AMIRA','AI','AGUEDA','AGNUS','YUETTE','VINITA','VICTORINA','TYNISHA','TREENA','TOCCARA','TISH','THOMASENA','TEGAN','SOILA','SHILOH','SHENNA','SHARMAINE','SHANTAE','SHANDI','SEPTEMBER','SARAN','SARAI','SANA','SAMUEL','SALLEY','ROSETTE','ROLANDE','REGINE','OTELIA','OSCAR','OLEVIA','NICHOLLE','NECOLE','NAIDA','MYRTA','MYESHA','MITSUE','MINTA','MERTIE','MARGY','MAHALIA','MADALENE','LOVE','LOURA','LOREAN','LEWIS','LESHA','LEONIDA','LENITA','LAVONE','LASHELL','LASHANDRA','LAMONICA','KIMBRA','KATHERINA','KARRY','KANESHA','JULIO','JONG','JENEVA','JAQUELYN','HWA','GILMA','GHISLAINE','GERTRUDIS','FRANSISCA','FERMINA','ETTIE','ETSUKO','ELLIS','ELLAN','ELIDIA','EDRA','DORETHEA','DOREATHA','DENYSE','DENNY','DEETTA','DAINE','CYRSTAL','CORRIN','CAYLA','CARLITA','CAMILA','BURMA','BULA','BUENA','BLAKE','BARABARA','AVRIL','AUSTIN','ALAINE','ZANA','WILHEMINA','WANETTA','VIRGIL','VI','VERONIKA','VERNON','VERLINE','VASILIKI','TONITA','TISA','TEOFILA','TAYNA','TAUNYA','TANDRA','TAKAKO','SUNNI','SUANNE','SIXTA','SHARELL','SEEMA','RUSSELL','ROSENDA','ROBENA','RAYMONDE','PEI','PAMILA','OZELL','NEIDA','NEELY','MISTIE','MICHA','MERISSA','MAURITA','MARYLN','MARYETTA','MARSHALL','MARCELL','MALENA','MAKEDA','MADDIE','LOVETTA','LOURIE','LORRINE','LORILEE','LESTER','LAURENA','LASHAY','LARRAINE','LAREE','LACRESHA','KRISTLE','KRISHNA','KEVA','KEIRA','KAROLE','JOIE','JINNY','JEANNETTA','JAMA','HEIDY','GILBERTE','GEMA','FAVIOLA','EVELYNN','ENDA','ELLI','ELLENA','DIVINA','DAGNY','COLLENE','CODI','CINDIE','CHASSIDY','CHASIDY','CATRICE','CATHERINA','CASSEY','CAROLL','CARLENA','CANDRA','CALISTA','BRYANNA','BRITTENY','BEULA','BARI','AUDRIE','AUDRIA','ARDELIA','ANNELLE','ANGILA','ALONA','ALLYN','DOUGLAS','ROGER','JONATHAN','RALPH','NICHOLAS','BENJAMIN','BRUCE','HARRY','WAYNE','STEVE','HOWARD','ERNEST','PHILLIP','TODD','CRAIG','ALAN','PHILIP','EARL','DANNY','BRYAN','STANLEY','LEONARD','NATHAN','MANUEL','RODNEY','MARVIN','VINCENT','JEFFERY','JEFF','CHAD','JACOB','ALFRED','BRADLEY','HERBERT','FREDERICK','EDWIN','DON','RICKY','RANDALL','BARRY','BERNARD','LEROY','MARCUS','THEODORE','CLIFFORD','MIGUEL','JIM','TOM','CALVIN','BILL','LLOYD','DEREK','WARREN','DARRELL','JEROME','FLOYD','ALVIN','TIM','GORDON','GREG','JORGE','DUSTIN','PEDRO','DERRICK','ZACHARY','HERMAN','GLEN','HECTOR','RICARDO','RICK','BRENT','RAMON','GILBERT','MARC','REGINALD','RUBEN','NATHANIEL','RAFAEL','EDGAR','MILTON','RAUL','BEN','CHESTER','DUANE','FRANKLIN','BRAD','RON','ROLAND','ARNOLD','HARVEY','JARED','ERIK','DARRYL','NEIL','JAVIER','FERNANDO','CLINTON','TED','MATHEW','TYRONE','DARREN','LANCE','KURT','ALLAN','NELSON','GUY','CLAYTON','HUGH','MAX','DWAYNE','DWIGHT','ARMANDO','FELIX','EVERETT','IAN','WALLACE','KEN','BOB','ALFREDO','ALBERTO','DAVE','IVAN','BYRON','ISAAC','MORRIS','CLIFTON','WILLARD','ROSS','ANDY','SALVADOR','KIRK','SERGIO','SETH','KENT','TERRANCE','EDUARDO','TERRENCE','ENRIQUE','WADE','STUART','FREDRICK','ARTURO','ALEJANDRO','NICK','LUTHER','WENDELL','JEREMIAH','JULIUS','OTIS','TREVOR','OLIVER','LUKE','HOMER','GERARD','DOUG','KENNY','HUBERT','LYLE','MATT','ALFONSO','ORLANDO','REX','CARLTON','ERNESTO','NEAL','PABLO','LORENZO','OMAR','WILBUR','GRANT','HORACE','RODERICK','ABRAHAM','WILLIS','RICKEY','ANDRES','CESAR','JOHNATHAN','MALCOLM','RUDOLPH','DAMON','KELVIN','PRESTON','ALTON','ARCHIE','MARCO','WM','PETE','RANDOLPH','GARRY','GEOFFREY','JONATHON','FELIPE','GERARDO','ED','DOMINIC','DELBERT','COLIN','GUILLERMO','EARNEST','LUCAS','BENNY','SPENCER','RODOLFO','MYRON','EDMUND','GARRETT','SALVATORE','CEDRIC','LOWELL','GREGG','SHERMAN','WILSON','SYLVESTER','ROOSEVELT','ISRAEL','JERMAINE','FORREST','WILBERT','LELAND','SIMON','CLARK','IRVING','BRYANT','OWEN','RUFUS','WOODROW','KRISTOPHER','MACK','LEVI','MARCOS','GUSTAVO','JAKE','LIONEL','GILBERTO','CLINT','NICOLAS','ISMAEL','ORVILLE','ERVIN','DEWEY','AL','WILFRED','JOSH','HUGO','IGNACIO','CALEB','TOMAS','SHELDON','ERICK','STEWART','DOYLE','DARREL','ROGELIO','TERENCE','SANTIAGO','ALONZO','ELIAS','BERT','ELBERT','RAMIRO','CONRAD','NOAH','GRADY','PHIL','CORNELIUS','LAMAR','ROLANDO','CLAY','PERCY','DEXTER','BRADFORD','DARIN','AMOS','MOSES','IRVIN','SAUL','ROMAN','RANDAL','TIMMY','DARRIN','WINSTON','BRENDAN','ABEL','DOMINICK','BOYD','EMILIO','ELIJAH','DOMINGO','EMMETT','MARLON','EMANUEL','JERALD','EDMOND','EMIL','DEWAYNE','WILL','OTTO','TEDDY','REYNALDO','BRET','JESS','TRENT','HUMBERTO','EMMANUEL','STEPHAN','VICENTE','LAMONT','GARLAND','MILES','EFRAIN','HEATH','RODGER','HARLEY','ETHAN','ELDON','ROCKY','PIERRE','JUNIOR','FREDDY','ELI','BRYCE','ANTOINE','STERLING','CHASE','GROVER','ELTON','CLEVELAND','DYLAN','CHUCK','DAMIAN','REUBEN','STAN','AUGUST','LEONARDO','JASPER','RUSSEL','ERWIN','BENITO','HANS','MONTE','BLAINE','ERNIE','CURT','QUENTIN','AGUSTIN','MURRAY','JAMAL','ADOLFO','HARRISON','TYSON','BURTON','BRADY','ELLIOTT','WILFREDO','BART','JARROD','VANCE','DENIS','DAMIEN','JOAQUIN','HARLAN','DESMOND','ELLIOT','DARWIN','GREGORIO','BUDDY','XAVIER','KERMIT','ROSCOE','ESTEBAN','ANTON','SOLOMON','SCOTTY','NORBERT','ELVIN','WILLIAMS','NOLAN','ROD','QUINTON','HAL','BRAIN','ROB','ELWOOD','KENDRICK','DARIUS','MOISES','FIDEL','THADDEUS','CLIFF','MARCEL','JACKSON','RAPHAEL','BRYON','ARMAND','ALVARO','JEFFRY','DANE','JOESPH','THURMAN','NED','RUSTY','MONTY','FABIAN','REGGIE','MASON','GRAHAM','ISAIAH','VAUGHN','GUS','LOYD','DIEGO','ADOLPH','NORRIS','MILLARD','ROCCO','GONZALO','DERICK','RODRIGO','WILEY','RIGOBERTO','ALPHONSO','TY','NOE','VERN','REED','JEFFERSON','ELVIS','BERNARDO','MAURICIO','HIRAM','DONOVAN','BASIL','RILEY','NICKOLAS','MAYNARD','SCOT','VINCE','QUINCY','EDDY','SEBASTIAN','FEDERICO','ULYSSES','HERIBERTO','DONNELL','COLE','DAVIS','GAVIN','EMERY','WARD','ROMEO','JAYSON','DANTE','CLEMENT','COY','MAXWELL','JARVIS','BRUNO','ISSAC','DUDLEY','BROCK','SANFORD','CARMELO','BARNEY','NESTOR','STEFAN','DONNY','ART','LINWOOD','BEAU','WELDON','GALEN','ISIDRO','TRUMAN','DELMAR','JOHNATHON','SILAS','FREDERIC','DICK','IRWIN','MERLIN','CHARLEY','MARCELINO','HARRIS','CARLO','TRENTON','KURTIS','HUNTER','AURELIO','WINFRED','VITO','COLLIN','DENVER','CARTER','LEONEL','EMORY','PASQUALE','MOHAMMAD','MARIANO','DANIAL','LANDON','DIRK','BRANDEN','ADAN','BUFORD','GERMAN','WILMER','EMERSON','ZACHERY','FLETCHER','JACQUES','ERROL','DALTON','MONROE','JOSUE','EDWARDO','BOOKER','WILFORD','SONNY','SHELTON','CARSON','THERON','RAYMUNDO','DAREN','HOUSTON','ROBBY','LINCOLN','GENARO','BENNETT','OCTAVIO','CORNELL','HUNG','ARRON','ANTONY','HERSCHEL','GIOVANNI','GARTH','CYRUS','CYRIL','RONNY','LON','FREEMAN','DUNCAN','KENNITH','CARMINE','ERICH','CHADWICK','WILBURN','RUSS','REID','MYLES','ANDERSON','MORTON','JONAS','FOREST','MITCHEL','MERVIN','ZANE','RICH','JAMEL','LAZARO','ALPHONSE','RANDELL','MAJOR','JARRETT','BROOKS','ABDUL','LUCIANO','SEYMOUR','EUGENIO','MOHAMMED','VALENTIN','CHANCE','ARNULFO','LUCIEN','FERDINAND','THAD','EZRA','ALDO','RUBIN','ROYAL','MITCH','EARLE','ABE','WYATT','MARQUIS','LANNY','KAREEM','JAMAR','BORIS','ISIAH','EMILE','ELMO','ARON','LEOPOLDO','EVERETTE','JOSEF','ELOY','RODRICK','REINALDO','LUCIO','JERROD','WESTON','HERSHEL','BARTON','PARKER','LEMUEL','BURT','JULES','GIL','ELISEO','AHMAD','NIGEL','EFREN','ANTWAN','ALDEN','MARGARITO','COLEMAN','DINO','OSVALDO','LES','DEANDRE','NORMAND','KIETH','TREY','NORBERTO','NAPOLEON','JEROLD','FRITZ','ROSENDO','MILFORD','CHRISTOPER','ALFONZO','LYMAN','JOSIAH','BRANT','WILTON','RICO','JAMAAL','DEWITT','BRENTON','OLIN','FOSTER','FAUSTINO','CLAUDIO','JUDSON','GINO','EDGARDO','ALEC','TANNER','JARRED','DONN','TAD','PRINCE','PORFIRIO','ODIS','LENARD','CHAUNCEY','TOD','MEL','MARCELO','KORY','AUGUSTUS','KEVEN','HILARIO','BUD','SAL','ORVAL','MAURO','ZACHARIAH','OLEN','ANIBAL','MILO','JED','DILLON','AMADO','NEWTON','LENNY','RICHIE','HORACIO','BRICE','MOHAMED','DELMER','DARIO','REYES','MAC','JONAH','JERROLD','ROBT','HANK','RUPERT','ROLLAND','KENTON','DAMION','ANTONE','WALDO','FREDRIC','BRADLY','KIP','BURL','WALKER','TYREE','JEFFEREY','AHMED','WILLY','STANFORD','OREN','NOBLE','MOSHE','MIKEL','ENOCH','BRENDON','QUINTIN','JAMISON','FLORENCIO','DARRICK','TOBIAS','HASSAN','GIUSEPPE','DEMARCUS','CLETUS','TYRELL','LYNDON','KEENAN','WERNER','GERALDO','COLUMBUS','CHET','BERTRAM','MARKUS','HUEY','HILTON','DWAIN','DONTE','TYRON','OMER','ISAIAS','HIPOLITO','FERMIN','ADALBERTO','BO','BARRETT','TEODORO','MCKINLEY','MAXIMO','GARFIELD','RALEIGH','LAWERENCE','ABRAM','RASHAD','KING','EMMITT','DARON','SAMUAL','MIQUEL','EUSEBIO','DOMENIC','DARRON','BUSTER','WILBER','RENATO','JC','HOYT','HAYWOOD','EZEKIEL','CHAS','FLORENTINO','ELROY','CLEMENTE','ARDEN','NEVILLE','EDISON','DESHAWN','NATHANIAL','JORDON','DANILO','CLAUD','SHERWOOD','RAYMON','RAYFORD','CRISTOBAL','AMBROSE','TITUS','HYMAN','FELTON','EZEQUIEL','ERASMO','STANTON','LONNY','LEN','IKE','MILAN','LINO','JAROD','HERB','ANDREAS','WALTON','RHETT','PALMER','DOUGLASS','CORDELL','OSWALDO','ELLSWORTH','VIRGILIO','TONEY','NATHANAEL','DEL','BENEDICT','MOSE','JOHNSON','ISREAL','GARRET','FAUSTO','ASA','ARLEN','ZACK','WARNER','MODESTO','FRANCESCO','MANUAL','GAYLORD','GASTON','FILIBERTO','DEANGELO','MICHALE','GRANVILLE','WES','MALIK','ZACKARY','TUAN','ELDRIDGE','CRISTOPHER','CORTEZ','ANTIONE','MALCOM','LONG','KOREY','JOSPEH','COLTON','WAYLON','VON','HOSEA','SHAD','SANTO','RUDOLF','ROLF','REY','RENALDO','MARCELLUS','LUCIUS','KRISTOFER','BOYCE','BENTON','HAYDEN','HARLAND','ARNOLDO','RUEBEN','LEANDRO','KRAIG','JERRELL','JEROMY','HOBERT','CEDRICK','ARLIE','WINFORD','WALLY','LUIGI','KENETH','JACINTO','GRAIG','FRANKLYN','EDMUNDO','SID','PORTER','LEIF','JERAMY','BUCK','WILLIAN','VINCENZO','SHON','LYNWOOD','JERE','HAI','ELDEN','DORSEY','DARELL','BRODERICK','ALONSO'];
+```
+
+## --seed-contents--
+
+```js
+function namesScores(arr) {
+
+  return arr;
+}
+
+// Only change code above this line
+const test1 = ['THIS', 'IS', 'ONLY', 'A', 'TEST'];
+const test2 = ['I', 'REPEAT', 'THIS', 'IS', 'ONLY', 'A', 'TEST'];
+
+namesScores(test1);
+```
+
+# --solutions--
+
+```js
+function nameScoreCalc(word) {
+  let sum = 0;
+  let alphabets = ["", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];
+
+  for (let i = 0 ; i < word.length; i++)
+    sum += alphabets.indexOf(word[i].toLowerCase());
+  return sum;
+}
+
+function namesScores(arr) {
+  arr = [...arr].sort();
+  arr.unshift('');
+  let total = 0;
+
+  for (let i = 1 ; i < arr.length; i++)
+    total += nameScoreCalc(arr[i]) * i;
+  return total;
+}
+
+const test1 = ['THIS', 'IS', 'ONLY', 'A', 'TEST'];
+const test2 = ['I', 'REPEAT', 'THIS', 'IS', 'ONLY', 'A', 'TEST'];
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
new file mode 100644
index 0000000000..1fccaef107
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4481000cf542c50ff5b
+title: 'Problem 220: Heighway Dragon'
+challengeType: 5
+forumTopicId: 301863
+dashedName: problem-220-heighway-dragon
+---
+
+# --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.
+
+# --hints--
+
+`euler220()` should return 139776, 963904.
+
+```js
+assert.strictEqual(euler220(), 139776, 963904);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler220() {
+
+  return true;
+}
+
+euler220();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
new file mode 100644
index 0000000000..010d2bd57c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4491000cf542c50ff5c
+title: 'Problem 221: Alexandrian Integers'
+challengeType: 5
+forumTopicId: 301864
+dashedName: problem-221-alexandrian-integers
+---
+
+# --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 1/A = 1/p + 1/q + 1/r
+
+<!-- TODO Use MathJax -->
+
+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.
+
+# --hints--
+
+`euler221()` should return 1884161251122450.
+
+```js
+assert.strictEqual(euler221(), 1884161251122450);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler221() {
+
+  return true;
+}
+
+euler221();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
new file mode 100644
index 0000000000..423ce7ff8e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44b1000cf542c50ff5d
+title: 'Problem 222: Sphere Packing'
+challengeType: 5
+forumTopicId: 301865
+dashedName: problem-222-sphere-packing
+---
+
+# --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.
+
+# --hints--
+
+`euler222()` should return 1590933.
+
+```js
+assert.strictEqual(euler222(), 1590933);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler222() {
+
+  return true;
+}
+
+euler222();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
new file mode 100644
index 0000000000..28f8d8f214
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44b1000cf542c50ff5e
+title: 'Problem 223: Almost right-angled triangles I'
+challengeType: 5
+forumTopicId: 301866
+dashedName: problem-223-almost-right-angled-triangles-i
+---
+
+# --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?
+
+# --hints--
+
+`euler223()` should return 61614848.
+
+```js
+assert.strictEqual(euler223(), 61614848);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler223() {
+
+  return true;
+}
+
+euler223();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
new file mode 100644
index 0000000000..d9f557fd4a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44e1000cf542c50ff5f
+title: 'Problem 224: Almost right-angled triangles II'
+challengeType: 5
+forumTopicId: 301867
+dashedName: problem-224-almost-right-angled-triangles-ii
+---
+
+# --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?
+
+# --hints--
+
+`euler224()` should return 4137330.
+
+```js
+assert.strictEqual(euler224(), 4137330);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler224() {
+
+  return true;
+}
+
+euler224();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
new file mode 100644
index 0000000000..ff5fb05c1a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f44e1000cf542c50ff60
+title: 'Problem 225: Tribonacci non-divisors'
+challengeType: 5
+forumTopicId: 301868
+dashedName: problem-225-tribonacci-non-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler225()` should return 2009.
+
+```js
+assert.strictEqual(euler225(), 2009);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler225() {
+
+  return true;
+}
+
+euler225();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
new file mode 100644
index 0000000000..3aadacc50b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4511000cf542c50ff62
+title: 'Problem 226: A Scoop of Blancmange'
+challengeType: 5
+forumTopicId: 301869
+dashedName: problem-226-a-scoop-of-blancmange
+---
+
+# --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
+
+# --hints--
+
+`euler226()` should return 0.11316017.
+
+```js
+assert.strictEqual(euler226(), 0.11316017);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler226() {
+
+  return true;
+}
+
+euler226();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-227-the-chase.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-227-the-chase.md
new file mode 100644
index 0000000000..aff8e9b934
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-227-the-chase.md
@@ -0,0 +1,42 @@
+---
+id: 5900f44f1000cf542c50ff61
+title: 'Problem 227: The Chase'
+challengeType: 5
+forumTopicId: 301870
+dashedName: problem-227-the-chase
+---
+
+# --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.
+
+# --hints--
+
+`euler227()` should return 3780.618622.
+
+```js
+assert.strictEqual(euler227(), 3780.618622);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler227() {
+
+  return true;
+}
+
+euler227();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
new file mode 100644
index 0000000000..3ee325d2be
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4511000cf542c50ff63
+title: 'Problem 228: Minkowski Sums'
+challengeType: 5
+forumTopicId: 301871
+dashedName: problem-228-minkowski-sums
+---
+
+# --description--
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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?
+
+# --hints--
+
+`euler228()` should return 86226.
+
+```js
+assert.strictEqual(euler228(), 86226);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler228() {
+
+  return true;
+}
+
+euler228();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
new file mode 100644
index 0000000000..0431ab815b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4521000cf542c50ff64
+title: 'Problem 229: Four Representations using Squares'
+challengeType: 5
+forumTopicId: 301872
+dashedName: problem-229-four-representations-using-squares
+---
+
+# --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?
+
+# --hints--
+
+`euler229()` should return 11325263.
+
+```js
+assert.strictEqual(euler229(), 11325263);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler229() {
+
+  return true;
+}
+
+euler229();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
new file mode 100644
index 0000000000..ce8b2262e4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
@@ -0,0 +1,101 @@
+---
+id: 5900f3831000cf542c50fe96
+title: 'Problem 23: Non-abundant sums'
+challengeType: 5
+forumTopicId: 301873
+dashedName: problem-23-non-abundant-sums
+---
+
+# --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 positive integers &lt;= `n` which cannot be written as the sum of two abundant numbers.
+
+# --hints--
+
+`sumOfNonAbundantNumbers(10000)` should return a number.
+
+```js
+assert(typeof sumOfNonAbundantNumbers(10000) === 'number');
+```
+
+`sumOfNonAbundantNumbers(10000)` should return 3731004.
+
+```js
+assert(sumOfNonAbundantNumbers(10000) === 3731004);
+```
+
+`sumOfNonAbundantNumbers(15000)` should return 4039939.
+
+```js
+assert(sumOfNonAbundantNumbers(15000) === 4039939);
+```
+
+`sumOfNonAbundantNumbers(20000)` should return 4159710.
+
+```js
+assert(sumOfNonAbundantNumbers(20000) === 4159710);
+```
+
+`sumOfNonAbundantNumbers(28123)` should return 4179871.
+
+```js
+assert(sumOfNonAbundantNumbers(28123) === 4179871);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumOfNonAbundantNumbers(n) {
+
+  return n;
+}
+
+sumOfNonAbundantNumbers(28123);
+```
+
+# --solutions--
+
+```js
+function abundantCheck(number) {
+  let sum = 1;
+
+  for (let i = 2; i <= Math.sqrt(number); i += 1) {
+    if(number % i === 0) {
+      sum += i + +(i !== Math.sqrt(number) && number / i);
+    }
+  }
+  return sum > number;
+}
+
+function sumOfNonAbundantNumbers(n) {
+  let sum = 0;
+  const memo = {};
+  let abundantList = [];
+
+  // Function checkSum checks if num can be represented as a sum of numbers in the stack (array)
+  const checkSum = (num, stack, memo) => {
+    for (let i = 0; i < stack.length; i += 1) {
+      if ((num - stack[i]) in memo) return true;
+    }
+    return false;
+  };
+
+  for (let i = 1; i <= n; i += 1) {
+    if (abundantCheck(i)) {
+      abundantList.push(i);
+      memo[i] = 1;
+    }
+    if (checkSum(i, abundantList, memo)) continue;
+    sum += i;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
new file mode 100644
index 0000000000..16ea313199
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4531000cf542c50ff65
+title: 'Problem 230: Fibonacci Words'
+challengeType: 5
+forumTopicId: 301874
+dashedName: problem-230-fibonacci-words
+---
+
+# --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) .
+
+# --hints--
+
+`euler230()` should return 850481152593119200.
+
+```js
+assert.strictEqual(euler230(), 850481152593119200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler230() {
+
+  return true;
+}
+
+euler230();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
new file mode 100644
index 0000000000..c313225c72
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4531000cf542c50ff66
+title: 'Problem 231: The prime factorisation of binomial coefficients'
+challengeType: 5
+forumTopicId: 301875
+dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler231()` should return 7526965179680.
+
+```js
+assert.strictEqual(euler231(), 7526965179680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler231() {
+
+  return true;
+}
+
+euler231();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-232-the-race.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-232-the-race.md
new file mode 100644
index 0000000000..c109669bd8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-232-the-race.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4551000cf542c50ff67
+title: 'Problem 232: The Race'
+challengeType: 5
+forumTopicId: 301876
+dashedName: problem-232-the-race
+---
+
+# --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 .
+
+# --hints--
+
+`euler232()` should return 0.83648556.
+
+```js
+assert.strictEqual(euler232(), 0.83648556);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler232() {
+
+  return true;
+}
+
+euler232();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
new file mode 100644
index 0000000000..5903d7e8c9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4551000cf542c50ff68
+title: 'Problem 233: Lattice points on a circle'
+challengeType: 5
+forumTopicId: 301877
+dashedName: problem-233-lattice-points-on-a-circle
+---
+
+# --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 ?
+
+# --hints--
+
+`euler233()` should return 271204031455541300.
+
+```js
+assert.strictEqual(euler233(), 271204031455541300);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler233() {
+
+  return true;
+}
+
+euler233();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
new file mode 100644
index 0000000000..edf39ca239
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4571000cf542c50ff69
+title: 'Problem 234: Semidivisible numbers'
+challengeType: 5
+forumTopicId: 301878
+dashedName: problem-234-semidivisible-numbers
+---
+
+# --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 ?
+
+# --hints--
+
+`euler234()` should return 1259187438574927000.
+
+```js
+assert.strictEqual(euler234(), 1259187438574927000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler234() {
+
+  return true;
+}
+
+euler234();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
new file mode 100644
index 0000000000..549fc0275d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4571000cf542c50ff6a
+title: 'Problem 235: An Arithmetic Geometric sequence'
+challengeType: 5
+forumTopicId: 301879
+dashedName: problem-235-an-arithmetic-geometric-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler235()` should return 1.002322108633.
+
+```js
+assert.strictEqual(euler235(), 1.002322108633);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler235() {
+
+  return true;
+}
+
+euler235();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
new file mode 100644
index 0000000000..01c7effbc3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4591000cf542c50ff6b
+title: 'Problem 236: Luxury Hampers'
+challengeType: 5
+forumTopicId: 301881
+dashedName: problem-236-luxury-hampers
+---
+
+# --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.
+
+# --hints--
+
+`euler236()` should return 123 / 59.
+
+```js
+assert.strictEqual(euler236(), 123 / 59);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler236() {
+
+  return true;
+}
+
+euler236();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
new file mode 100644
index 0000000000..eec1076ec1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4591000cf542c50ff6c
+title: 'Problem 237: Tours on a 4 x n playing board'
+challengeType: 5
+forumTopicId: 301882
+dashedName: problem-237-tours-on-a-4-x-n-playing-board
+---
+
+# --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?
+
+# --hints--
+
+`euler237()` should return 15836928.
+
+```js
+assert.strictEqual(euler237(), 15836928);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler237() {
+
+  return true;
+}
+
+euler237();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
new file mode 100644
index 0000000000..4bb7527686
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -0,0 +1,58 @@
+---
+id: 5900f45b1000cf542c50ff6d
+title: 'Problem 238: Infinite string tour'
+challengeType: 5
+forumTopicId: 301883
+dashedName: problem-238-infinite-string-tour
+---
+
+# --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 &lt; k ≤ 103, ∑ p(k) = 4742.
+
+Find ∑ p(k), for 0 &lt; k ≤ 2·1015.
+
+# --hints--
+
+`euler238()` should return 9922545104535660.
+
+```js
+assert.strictEqual(euler238(), 9922545104535660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler238() {
+
+  return true;
+}
+
+euler238();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
new file mode 100644
index 0000000000..b68783fecf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
@@ -0,0 +1,42 @@
+---
+id: 5900f45c1000cf542c50ff6e
+title: 'Problem 239: Twenty-two Foolish Primes'
+challengeType: 5
+forumTopicId: 301884
+dashedName: problem-239-twenty-two-foolish-primes
+---
+
+# --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.
+
+# --hints--
+
+`euler239()` should return 0.001887854841.
+
+```js
+assert.strictEqual(euler239(), 0.001887854841);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler239() {
+
+  return true;
+}
+
+euler239();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
new file mode 100644
index 0000000000..49998335d2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3841000cf542c50fe97
+title: 'Problem 24: Lexicographic permutations'
+challengeType: 5
+forumTopicId: 301885
+dashedName: problem-24-lexicographic-permutations
+---
+
+# --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:
+
+<div style='text-align: center;'>012   021   102   120   201   210</div>
+
+What is the `n`th lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
+
+# --hints--
+
+`lexicographicPermutations(699999)` should return a number.
+
+```js
+assert(typeof lexicographicPermutations(699999) === 'number');
+```
+
+`lexicographicPermutations(699999)` should return 1938246570.
+
+```js
+assert(lexicographicPermutations(699999) == 1938246570);
+```
+
+`lexicographicPermutations(899999)` should return 2536987410.
+
+```js
+assert(lexicographicPermutations(899999) == 2536987410);
+```
+
+`lexicographicPermutations(900000)` should return 2537014689.
+
+```js
+assert(lexicographicPermutations(900000) == 2537014689);
+```
+
+`lexicographicPermutations(999999)` should return 2783915460.
+
+```js
+assert(lexicographicPermutations(999999) == 2783915460);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lexicographicPermutations(n) {
+
+  return n;
+}
+
+lexicographicPermutations(999999);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-240-top-dice.md
new file mode 100644
index 0000000000..392edfa3dd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -0,0 +1,48 @@
+---
+id: 5900f45d1000cf542c50ff6f
+title: 'Problem 240: Top Dice'
+challengeType: 5
+forumTopicId: 301887
+dashedName: problem-240-top-dice
+---
+
+# --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?
+
+# --hints--
+
+`euler240()` should return 7448717393364182000.
+
+```js
+assert.strictEqual(euler240(), 7448717393364182000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler240() {
+
+  return true;
+}
+
+euler240();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
new file mode 100644
index 0000000000..b80b7872cb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
@@ -0,0 +1,42 @@
+---
+id: 5900f45d1000cf542c50ff70
+title: 'Problem 241: Perfection Quotients'
+challengeType: 5
+forumTopicId: 301888
+dashedName: problem-241-perfection-quotients
+---
+
+# --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.
+
+# --hints--
+
+`euler241()` should return 482316491800641150.
+
+```js
+assert.strictEqual(euler241(), 482316491800641150);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler241() {
+
+  return true;
+}
+
+euler241();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
new file mode 100644
index 0000000000..c8eb8d360c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
@@ -0,0 +1,44 @@
+---
+id: 5900f45f1000cf542c50ff71
+title: 'Problem 242: Odd Triplets'
+challengeType: 5
+forumTopicId: 301889
+dashedName: problem-242-odd-triplets
+---
+
+# --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 ?
+
+# --hints--
+
+`euler242()` should return 997104142249036700.
+
+```js
+assert.strictEqual(euler242(), 997104142249036700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler242() {
+
+  return true;
+}
+
+euler242();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-243-resilience.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-243-resilience.md
new file mode 100644
index 0000000000..54c911233a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-243-resilience.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4601000cf542c50ff73
+title: 'Problem 243: Resilience'
+challengeType: 5
+forumTopicId: 301890
+dashedName: problem-243-resilience
+---
+
+# --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) &lt; 4/10 .
+
+Find the smallest denominator d, having a resilience R(d) &lt; 15499/94744 .
+
+# --hints--
+
+`euler243()` should return 892371480.
+
+```js
+assert.strictEqual(euler243(), 892371480);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler243() {
+
+  return true;
+}
+
+euler243();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-244-sliders.md
new file mode 100644
index 0000000000..dfc2ef5931
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4601000cf542c50ff72
+title: 'Problem 244: Sliders'
+challengeType: 5
+forumTopicId: 301891
+dashedName: problem-244-sliders
+---
+
+# --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?
+
+# --hints--
+
+`euler244()` should return 96356848.
+
+```js
+assert.strictEqual(euler244(), 96356848);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler244() {
+
+  return true;
+}
+
+euler244();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-245-coresilience.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-245-coresilience.md
new file mode 100644
index 0000000000..47fc69a5fa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-245-coresilience.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4621000cf542c50ff74
+title: 'Problem 245: Coresilience'
+challengeType: 5
+forumTopicId: 301892
+dashedName: problem-245-coresilience
+---
+
+# --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 &lt; n ≤ 2×1011, for which C(n) is a unit fraction.
+
+# --hints--
+
+`euler245()` should return 288084712410001.
+
+```js
+assert.strictEqual(euler245(), 288084712410001);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler245() {
+
+  return true;
+}
+
+euler245();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
new file mode 100644
index 0000000000..2d50a2e979
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4621000cf542c50ff75
+title: 'Problem 246: Tangents to an ellipse'
+challengeType: 5
+forumTopicId: 301893
+dashedName: problem-246-tangents-to-an-ellipse
+---
+
+# --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)
+
+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?
+
+# --hints--
+
+`euler246()` should return 810834388.
+
+```js
+assert.strictEqual(euler246(), 810834388);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler246() {
+
+  return true;
+}
+
+euler246();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
new file mode 100644
index 0000000000..d9a5572eea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4641000cf542c50ff76
+title: 'Problem 247: Squares under a hyperbola'
+challengeType: 5
+forumTopicId: 301894
+dashedName: problem-247-squares-under-a-hyperbola
+---
+
+# --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)?
+
+# --hints--
+
+`euler247()` should return 782252.
+
+```js
+assert.strictEqual(euler247(), 782252);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler247() {
+
+  return true;
+}
+
+euler247();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
new file mode 100644
index 0000000000..1641fd73a2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4651000cf542c50ff77
+title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
+challengeType: 5
+forumTopicId: 301895
+dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
+---
+
+# --description--
+
+The first number n for which φ(n)=13! is 6227180929.
+
+Find the 150,000th such number.
+
+# --hints--
+
+`euler248()` should return 23507044290.
+
+```js
+assert.strictEqual(euler248(), 23507044290);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler248() {
+
+  return true;
+}
+
+euler248();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
new file mode 100644
index 0000000000..71c8d1da19
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4671000cf542c50ff79
+title: 'Problem 249: Prime Subset Sums'
+challengeType: 5
+forumTopicId: 301896
+dashedName: problem-249-prime-subset-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler249()` should return 9275262564250418.
+
+```js
+assert.strictEqual(euler249(), 9275262564250418);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler249() {
+
+  return true;
+}
+
+euler249();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
new file mode 100644
index 0000000000..ca7d277f44
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
@@ -0,0 +1,85 @@
+---
+id: 5900f3851000cf542c50fe98
+title: 'Problem 25: 1000-digit Fibonacci number'
+challengeType: 5
+forumTopicId: 301897
+dashedName: problem-25-1000-digit-fibonacci-number
+---
+
+# --description--
+
+The Fibonacci sequence is defined by the recurrence relation:
+
+<div style='padding-left: 4em;'>F<sub>n</sub> = F<sub>n−1</sub> + F<sub>n−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.</div>
+
+Hence the first 12 terms will be:
+
+<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div>F<sub>1</sub> = 1</div><div>F<sub>2</sub> = 1</div><div>F<sub>3</sub> = 2</div><div>F<sub>4</sub> = 3</div><div>F<sub>5</sub> = 5</div><div>F<sub>6</sub> = 8</div><div>F<sub>7</sub> = 13</div><div>F<sub>8</sub> = 21</div><div>F<sub>9</sub> = 34</div><div>F<sub>10</sub> = 55</div><div>F<sub>11</sub> = 89</div><div>F<sub>12</sub> = 144</div></div>
+
+The 12th term, F<sub>12</sub>, is the first term to contain three digits.
+
+What is the index of the first term in the Fibonacci sequence to contain `n` digits?
+
+# --hints--
+
+`digitFibonacci(5)` should return a number.
+
+```js
+assert(typeof digitFibonacci(5) === 'number');
+```
+
+`digitFibonacci(5)` should return 21.
+
+```js
+assert.strictEqual(digitFibonacci(5), 21);
+```
+
+`digitFibonacci(10)` should return 45.
+
+```js
+assert.strictEqual(digitFibonacci(10), 45);
+```
+
+`digitFibonacci(15)` should return 69.
+
+```js
+assert.strictEqual(digitFibonacci(15), 69);
+```
+
+`digitFibonacci(20)` should return 93.
+
+```js
+assert.strictEqual(digitFibonacci(20), 93);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFibonacci(n) {
+
+  return n;
+}
+
+digitFibonacci(20);
+```
+
+# --solutions--
+
+```js
+const digitFibonacci = (n) => {
+  const digits = (num) => {
+    return num.toString().length;
+  };
+  let f1 = 1;
+  let f2 = 1;
+  let index = 3;
+  while (true) {
+    let fn = f1 + f2;
+    if (digits(fn) === n) return index;
+    [f1, f2] = [f2, fn];
+    index++;
+  }
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-250-250250.md
new file mode 100644
index 0000000000..9c48826055
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4661000cf542c50ff78
+title: 'Problem 250: 250250'
+challengeType: 5
+forumTopicId: 301898
+dashedName: problem-250-250250
+---
+
+# --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.
+
+# --hints--
+
+`euler250()` should return 1425480602091519.
+
+```js
+assert.strictEqual(euler250(), 1425480602091519);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler250() {
+
+  return true;
+}
+
+euler250();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
new file mode 100644
index 0000000000..9023efb818
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4671000cf542c50ff7a
+title: 'Problem 251: Cardano Triplets'
+challengeType: 5
+forumTopicId: 301899
+dashedName: problem-251-cardano-triplets
+---
+
+# --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.
+
+# --hints--
+
+`euler251()` should return 18946051.
+
+```js
+assert.strictEqual(euler251(), 18946051);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler251() {
+
+  return true;
+}
+
+euler251();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
new file mode 100644
index 0000000000..68251abd75
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4691000cf542c50ff7b
+title: 'Problem 252: Convex Holes'
+challengeType: 5
+forumTopicId: 301900
+dashedName: problem-252-convex-holes
+---
+
+# --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.
+
+# --hints--
+
+`euler252()` should return 104924.
+
+```js
+assert.strictEqual(euler252(), 104924);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler252() {
+
+  return true;
+}
+
+euler252();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
new file mode 100644
index 0000000000..78efca2bdc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4691000cf542c50ff7c
+title: 'Problem 253: Tidying up'
+challengeType: 5
+forumTopicId: 301901
+dashedName: problem-253-tidying-up
+---
+
+# --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.
+
+# --hints--
+
+`euler253()` should return 11.492847.
+
+```js
+assert.strictEqual(euler253(), 11.492847);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler253() {
+
+  return true;
+}
+
+euler253();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
new file mode 100644
index 0000000000..028f20783e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
@@ -0,0 +1,48 @@
+---
+id: 5900f46b1000cf542c50ff7d
+title: 'Problem 254: Sums of Digit Factorials'
+challengeType: 5
+forumTopicId: 301902
+dashedName: problem-254-sums-of-digit-factorials
+---
+
+# --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?
+
+# --hints--
+
+`euler254()` should return 8184523820510.
+
+```js
+assert.strictEqual(euler254(), 8184523820510);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler254() {
+
+  return true;
+}
+
+euler254();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
new file mode 100644
index 0000000000..8c6acc7113
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
@@ -0,0 +1,50 @@
+---
+id: 5900f46d1000cf542c50ff7f
+title: 'Problem 255: Rounded Square Roots'
+challengeType: 5
+forumTopicId: 301903
+dashedName: problem-255-rounded-square-roots
+---
+
+# --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 &lt; 1014)? Give your answer rounded to 10 decimal places.
+
+Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively.
+
+# --hints--
+
+`euler255()` should return 4.447401118.
+
+```js
+assert.strictEqual(euler255(), 4.447401118);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler255() {
+
+  return true;
+}
+
+euler255();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
new file mode 100644
index 0000000000..7a55e36abe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -0,0 +1,54 @@
+---
+id: 5900f46c1000cf542c50ff7e
+title: 'Problem 256: Tatami-Free Rooms'
+challengeType: 5
+forumTopicId: 301904
+dashedName: problem-256-tatami-free-rooms
+---
+
+# --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.
+
+# --hints--
+
+`euler256()` should return 85765680.
+
+```js
+assert.strictEqual(euler256(), 85765680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler256() {
+
+  return true;
+}
+
+euler256();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
new file mode 100644
index 0000000000..629b1f0340
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f46e1000cf542c50ff80
+title: 'Problem 257: Angular Bisectors'
+challengeType: 5
+forumTopicId: 301905
+dashedName: problem-257-angular-bisectors
+---
+
+# --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?
+
+# --hints--
+
+`euler257()` should return 139012411.
+
+```js
+assert.strictEqual(euler257(), 139012411);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler257() {
+
+  return true;
+}
+
+euler257();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
new file mode 100644
index 0000000000..963b52807e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
@@ -0,0 +1,40 @@
+---
+id: 5900f46e1000cf542c50ff81
+title: 'Problem 258: A lagged Fibonacci sequence'
+challengeType: 5
+forumTopicId: 301906
+dashedName: problem-258-a-lagged-fibonacci-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler258()` should return 12747994.
+
+```js
+assert.strictEqual(euler258(), 12747994);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler258() {
+
+  return true;
+}
+
+euler258();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
new file mode 100644
index 0000000000..c9eab8e6ef
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4701000cf542c50ff82
+title: 'Problem 259: Reachable Numbers'
+challengeType: 5
+forumTopicId: 301907
+dashedName: problem-259-reachable-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler259()` should return 20101196798.
+
+```js
+assert.strictEqual(euler259(), 20101196798);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler259() {
+
+  return true;
+}
+
+euler259();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
new file mode 100644
index 0000000000..d6ee972f90
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
@@ -0,0 +1,68 @@
+---
+id: 5900f3861000cf542c50fe99
+title: 'Problem 26: Reciprocal cycles'
+challengeType: 5
+forumTopicId: 301908
+dashedName: problem-26-reciprocal-cycles
+---
+
+# --description--
+
+A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
+
+<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div><sup>1</sup>/<sub>2</sub> = 0.5</div><div><sup>1</sup>/<sub>3</sub> = 0.(3)</div><div><sup>1</sup>/<sub>4</sub> = 0.25</div><div><sup>1</sup>/<sub>5</sub> = 0.2</div><div><sup>1</sup>/<sub>6</sub> = 0.1(6)</div><div><sup>1</sup>/<sub>7</sub> = 0.(142857)</div><div><sup>1</sup>/<sub>8</sub> = 0.125</div><div><sup>1</sup>/<sub>9</sub> = 0.(1)</div><div><sup>1</sup>/<sub>10</sub> = 0.1</div></div>
+
+Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.
+
+Find the value of `d` &lt; `n` for which <sup>1</sup>/<sub>d</sub> contains the longest recurring cycle in its decimal fraction part.
+
+# --hints--
+
+`reciprocalCycles(700)` should return a number.
+
+```js
+assert(typeof reciprocalCycles(700) === 'number');
+```
+
+`reciprocalCycles(700)` should return 659.
+
+```js
+assert(reciprocalCycles(700) == 659);
+```
+
+`reciprocalCycles(800)` should return 743.
+
+```js
+assert(reciprocalCycles(800) == 743);
+```
+
+`reciprocalCycles(900)` should return 887.
+
+```js
+assert(reciprocalCycles(900) == 887);
+```
+
+`reciprocalCycles(1000)` should return 983.
+
+```js
+assert(reciprocalCycles(1000) == 983);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function reciprocalCycles(n) {
+
+  return n;
+}
+
+reciprocalCycles(1000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-260-stone-game.md
new file mode 100644
index 0000000000..55f0dccfd5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4701000cf542c50ff83
+title: 'Problem 260: Stone Game'
+challengeType: 5
+forumTopicId: 301909
+dashedName: problem-260-stone-game
+---
+
+# --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.
+
+# --hints--
+
+`euler260()` should return 167542057.
+
+```js
+assert.strictEqual(euler260(), 167542057);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler260() {
+
+  return true;
+}
+
+euler260();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
new file mode 100644
index 0000000000..b265e7910b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4711000cf542c50ff84
+title: 'Problem 261: Pivotal Square Sums'
+challengeType: 5
+forumTopicId: 301910
+dashedName: problem-261-pivotal-square-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler261()` should return 238890850232021.
+
+```js
+assert.strictEqual(euler261(), 238890850232021);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler261() {
+
+  return true;
+}
+
+euler261();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-262-mountain-range.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
new file mode 100644
index 0000000000..01cc16de4e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4731000cf542c50ff85
+title: 'Problem 262: Mountain Range'
+challengeType: 5
+forumTopicId: 301911
+dashedName: problem-262-mountain-range
+---
+
+# --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) )
+
+# --hints--
+
+`euler262()` should return 2531.205.
+
+```js
+assert.strictEqual(euler262(), 2531.205);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler262() {
+
+  return true;
+}
+
+euler262();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
new file mode 100644
index 0000000000..24fca67d82
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4741000cf542c50ff86
+title: 'Problem 263: An engineers'' dream come true'
+challengeType: 5
+forumTopicId: 301912
+dashedName: problem-263-an-engineers-dream-come-true
+---
+
+# --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.
+
+# --hints--
+
+`euler263()` should return 2039506520.
+
+```js
+assert.strictEqual(euler263(), 2039506520);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler263() {
+
+  return true;
+}
+
+euler263();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
new file mode 100644
index 0000000000..34be7dede4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4751000cf542c50ff87
+title: 'Problem 264: Triangle Centres'
+challengeType: 5
+forumTopicId: 301913
+dashedName: problem-264-triangle-centres
+---
+
+# --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.
+
+# --hints--
+
+`euler264()` should return 2816417.1055.
+
+```js
+assert.strictEqual(euler264(), 2816417.1055);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler264() {
+
+  return true;
+}
+
+euler264();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
new file mode 100644
index 0000000000..0ed757aa65
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4761000cf542c50ff88
+title: 'Problem 265: Binary Circles'
+challengeType: 5
+forumTopicId: 301914
+dashedName: problem-265-binary-circles
+---
+
+# --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).
+
+# --hints--
+
+`euler265()` should return 209110240768.
+
+```js
+assert.strictEqual(euler265(), 209110240768);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler265() {
+
+  return true;
+}
+
+euler265();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
new file mode 100644
index 0000000000..18569d5b8e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4771000cf542c50ff89
+title: 'Problem 266: Pseudo Square Root'
+challengeType: 5
+forumTopicId: 301915
+dashedName: problem-266-pseudo-square-root
+---
+
+# --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.
+
+# --hints--
+
+`euler266()` should return 1096883702440585.
+
+```js
+assert.strictEqual(euler266(), 1096883702440585);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler266() {
+
+  return true;
+}
+
+euler266();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-267-billionaire.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-267-billionaire.md
new file mode 100644
index 0000000000..0c308ff3ec
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-267-billionaire.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4771000cf542c50ff8a
+title: 'Problem 267: Billionaire'
+challengeType: 5
+forumTopicId: 301916
+dashedName: problem-267-billionaire
+---
+
+# --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.
+
+# --hints--
+
+`euler267()` should return 0.999992836187.
+
+```js
+assert.strictEqual(euler267(), 0.999992836187);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler267() {
+
+  return true;
+}
+
+euler267();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
new file mode 100644
index 0000000000..c703c2b10f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -0,0 +1,43 @@
+---
+id: 5900f4791000cf542c50ff8b
+title: >-
+  Problem 268: Counting numbers with at least four distinct prime factors less
+  than 100
+challengeType: 5
+forumTopicId: 301917
+dashedName: >-
+  problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
+---
+
+# --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.
+
+# --hints--
+
+`euler268()` should return 785478606870985.
+
+```js
+assert.strictEqual(euler268(), 785478606870985);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler268() {
+
+  return true;
+}
+
+euler268();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
new file mode 100644
index 0000000000..b4b2692610
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4791000cf542c50ff8c
+title: 'Problem 269: Polynomials with at least one integer root'
+challengeType: 5
+forumTopicId: 301918
+dashedName: problem-269-polynomials-with-at-least-one-integer-root
+---
+
+# --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)?
+
+# --hints--
+
+`euler269()` should return 1311109198529286.
+
+```js
+assert.strictEqual(euler269(), 1311109198529286);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler269() {
+
+  return true;
+}
+
+euler269();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
new file mode 100644
index 0000000000..a694ee2a59
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
@@ -0,0 +1,78 @@
+---
+id: 5900f3871000cf542c50fe9a
+title: 'Problem 27: Quadratic primes'
+challengeType: 5
+forumTopicId: 301919
+dashedName: problem-27-quadratic-primes
+---
+
+# --description--
+
+Euler discovered the remarkable quadratic formula:
+
+<div style='margin-left: 4em;'>$n^2 + n + 41$</div>
+
+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:
+
+<div style='margin-left: 4em;'>
+  $n^2 + an + b$, where $|a| < range$ and $|b| \le range$<br>
+  where $|n|$ is the modulus/absolute value of $n$<br>
+  e.g. $|11| = 11$ and $|-4| = 4$<br>
+</div>
+
+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$.
+
+# --hints--
+
+`quadraticPrimes(200)` should return a number.
+
+```js
+assert(typeof quadraticPrimes(200) === 'number');
+```
+
+`quadraticPrimes(200)` should return -4925.
+
+```js
+assert(quadraticPrimes(200) == -4925);
+```
+
+`quadraticPrimes(500)` should return -18901.
+
+```js
+assert(quadraticPrimes(500) == -18901);
+```
+
+`quadraticPrimes(800)` should return -43835.
+
+```js
+assert(quadraticPrimes(800) == -43835);
+```
+
+`quadraticPrimes(1000)` should return -59231.
+
+```js
+assert(quadraticPrimes(1000) == -59231);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function quadraticPrimes(range) {
+
+  return range;
+}
+
+quadraticPrimes(1000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
new file mode 100644
index 0000000000..5d490e3b17
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -0,0 +1,48 @@
+---
+id: 5900f47c1000cf542c50ff8e
+title: 'Problem 270: Cutting Squares'
+challengeType: 5
+forumTopicId: 301920
+dashedName: problem-270-cutting-squares
+---
+
+# --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 ?
+
+# --hints--
+
+`euler270()` should return 82282080.
+
+```js
+assert.strictEqual(euler270(), 82282080);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler270() {
+
+  return true;
+}
+
+euler270();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
new file mode 100644
index 0000000000..e9f9bb785c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
@@ -0,0 +1,42 @@
+---
+id: 5900f47b1000cf542c50ff8d
+title: 'Problem 271: Modular Cubes, part 1'
+challengeType: 5
+forumTopicId: 301921
+dashedName: problem-271-modular-cubes-part-1
+---
+
+# --description--
+
+For a positive number n, define S(n) as the sum of the integers x, for which 1
+
+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).
+
+# --hints--
+
+`euler271()` should return 4617456485273130000.
+
+```js
+assert.strictEqual(euler271(), 4617456485273130000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler271() {
+
+  return true;
+}
+
+euler271();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
new file mode 100644
index 0000000000..3cfb07b5b3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
@@ -0,0 +1,42 @@
+---
+id: 5900f47d1000cf542c50ff8f
+title: 'Problem 272: Modular Cubes, part 2'
+challengeType: 5
+forumTopicId: 301922
+dashedName: problem-272-modular-cubes-part-2
+---
+
+# --description--
+
+For a positive number n, define C(n) as the number of the integers x, for which 1
+
+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.
+
+# --hints--
+
+`euler272()` should return 8495585919506151000.
+
+```js
+assert.strictEqual(euler272(), 8495585919506151000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler272() {
+
+  return true;
+}
+
+euler272();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
new file mode 100644
index 0000000000..508c463ddd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
@@ -0,0 +1,40 @@
+---
+id: 5900f47e1000cf542c50ff90
+title: 'Problem 273: Sum of Squares'
+challengeType: 5
+forumTopicId: 301923
+dashedName: problem-273-sum-of-squares
+---
+
+# --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 &lt; 150.
+
+# --hints--
+
+`euler273()` should return 2032447591196869000.
+
+```js
+assert.strictEqual(euler273(), 2032447591196869000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler273() {
+
+  return true;
+}
+
+euler273();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
new file mode 100644
index 0000000000..7841b6ed8f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
@@ -0,0 +1,50 @@
+---
+id: 5900f47f1000cf542c50ff91
+title: 'Problem 274: Divisibility Multipliers'
+challengeType: 5
+forumTopicId: 301924
+dashedName: problem-274-divisibility-multipliers
+---
+
+# --description--
+
+For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m &lt; 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?
+
+# --hints--
+
+`euler274()` should return 1601912348822.
+
+```js
+assert.strictEqual(euler274(), 1601912348822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler274() {
+
+  return true;
+}
+
+euler274();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
new file mode 100644
index 0000000000..a65dc0151c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4801000cf542c50ff92
+title: 'Problem 275: Balanced Sculptures'
+challengeType: 5
+forumTopicId: 301925
+dashedName: problem-275-balanced-sculptures
+---
+
+# --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?
+
+# --hints--
+
+`euler275()` should return 15030564.
+
+```js
+assert.strictEqual(euler275(), 15030564);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler275() {
+
+  return true;
+}
+
+euler275();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
new file mode 100644
index 0000000000..0e8392e57b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4801000cf542c50ff93
+title: 'Problem 276: Primitive Triangles'
+challengeType: 5
+forumTopicId: 301926
+dashedName: problem-276-primitive-triangles
+---
+
+# --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?
+
+# --hints--
+
+`euler276()` should return 5777137137739633000.
+
+```js
+assert.strictEqual(euler276(), 5777137137739633000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler276() {
+
+  return true;
+}
+
+euler276();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
new file mode 100644
index 0000000000..1f081396c2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4811000cf542c50ff94
+title: 'Problem 277: A Modified Collatz sequence'
+challengeType: 5
+forumTopicId: 301927
+dashedName: problem-277-a-modified-collatz-sequence
+---
+
+# --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"?
+
+# --hints--
+
+`euler277()` should return 1125977393124310.
+
+```js
+assert.strictEqual(euler277(), 1125977393124310);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler277() {
+
+  return true;
+}
+
+euler277();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
new file mode 100644
index 0000000000..6e26a6a316
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4831000cf542c50ff95
+title: 'Problem 278: Linear Combinations of Semiprimes'
+challengeType: 5
+forumTopicId: 301928
+dashedName: problem-278-linear-combinations-of-semiprimes
+---
+
+# --description--
+
+Given the values of integers 1 &lt; a1 &lt; a2 &lt;... &lt; an, consider the linear combination q1a1 + 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 &lt; q &lt; r &lt; 5000.
+
+# --hints--
+
+`euler278()` should return 1228215747273908500.
+
+```js
+assert.strictEqual(euler278(), 1228215747273908500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler278() {
+
+  return true;
+}
+
+euler278();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
new file mode 100644
index 0000000000..9fc673b5ea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4841000cf542c50ff96
+title: 'Problem 279: Triangles with integral sides and an integral angle'
+challengeType: 5
+forumTopicId: 301929
+dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle
+---
+
+# --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?
+
+# --hints--
+
+`euler279()` should return 416577688.
+
+```js
+assert.strictEqual(euler279(), 416577688);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler279() {
+
+  return true;
+}
+
+euler279();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
new file mode 100644
index 0000000000..a476199d1d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3881000cf542c50fe9b
+title: 'Problem 28: Number spiral diagonals'
+challengeType: 5
+forumTopicId: 301930
+dashedName: problem-28-number-spiral-diagonals
+---
+
+# --description--
+
+Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
+
+<div style='padding-left: 4em;'>
+  <div style='color: red; display: inline;'>21</div> 22 23 24 <div style='color: red; display: inline;'>25</div><br>
+  20  <div style='color: red; display: inline;'>7</div>  8  <div style='color: red; display: inline;'>9</div> 10<br>
+  19  6  <div style='color: red; display: inline;'>1</div>  2 11<br>
+  18  <div style='color: red; display: inline;'>5</div>  4  <div style='color: red; display: inline;'>3</div> 12<br>
+  <div style='color: red; display: inline;'>17</div> 16 15 14 <div style='color: red; display: inline;'>13</div><br>
+</div>
+
+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 an `n` by `n` spiral formed in the same way?
+
+# --hints--
+
+`spiralDiagonals(101)` should return a number.
+
+```js
+assert(typeof spiralDiagonals(101) === 'number');
+```
+
+`spiralDiagonals(101)` should return 692101.
+
+```js
+assert(spiralDiagonals(101) == 692101);
+```
+
+`spiralDiagonals(303)` should return 18591725.
+
+```js
+assert(spiralDiagonals(303) == 18591725);
+```
+
+`spiralDiagonals(505)` should return 85986601.
+
+```js
+assert(spiralDiagonals(505) == 85986601);
+```
+
+`spiralDiagonals(1001)` should return 669171001.
+
+```js
+assert(spiralDiagonals(1001) == 669171001);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralDiagonals(n) {
+
+  return n;
+}
+
+spiralDiagonals(1001);
+```
+
+# --solutions--
+
+```js
+const spiralDiagonals = (n) => {
+  const Sn2 = (n) => {
+    return n*(n+1)*(2*n+1)/6;
+  };
+  const Sn = (n) => {
+    return n*(n+1)/2;
+  };
+  let sum = (Sn2(n-1) + Sn(n-1) + n-1) + (Math.floor(n/2) + Sn2(n));
+  return sum;
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
new file mode 100644
index 0000000000..642a7d802f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4841000cf542c50ff97
+title: 'Problem 280: Ant and seeds'
+challengeType: 5
+forumTopicId: 301931
+dashedName: problem-280-ant-and-seeds
+---
+
+# --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.
+
+# --hints--
+
+`euler280()` should return 430.088247.
+
+```js
+assert.strictEqual(euler280(), 430.088247);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler280() {
+
+  return true;
+}
+
+euler280();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
new file mode 100644
index 0000000000..9ac6cf33a6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4861000cf542c50ff98
+title: 'Problem 281: Pizza Toppings'
+challengeType: 5
+forumTopicId: 301932
+dashedName: problem-281-pizza-toppings
+---
+
+# --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.
+
+# --hints--
+
+`euler281()` should return 1485776387445623.
+
+```js
+assert.strictEqual(euler281(), 1485776387445623);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler281() {
+
+  return true;
+}
+
+euler281();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
new file mode 100644
index 0000000000..5abd58ec44
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4861000cf542c50ff99
+title: 'Problem 282: The Ackermann function'
+challengeType: 5
+forumTopicId: 301933
+dashedName: problem-282-the-ackermann-function
+---
+
+# --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.
+
+# --hints--
+
+`euler282()` should return 1098988351.
+
+```js
+assert.strictEqual(euler282(), 1098988351);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler282() {
+
+  return true;
+}
+
+euler282();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
new file mode 100644
index 0000000000..7073e7c431
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4881000cf542c50ff9a
+title: >-
+  Problem 283: Integer sided triangles for which the area * perimeter ratio is
+  integral
+challengeType: 5
+forumTopicId: 301934
+dashedName: >-
+  problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
+---
+
+# --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.
+
+# --hints--
+
+`euler283()` should return 28038042525570324.
+
+```js
+assert.strictEqual(euler283(), 28038042525570324);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler283() {
+
+  return true;
+}
+
+euler283();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-284-steady-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
new file mode 100644
index 0000000000..818483669e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4891000cf542c50ff9b
+title: 'Problem 284: Steady Squares'
+challengeType: 5
+forumTopicId: 301935
+dashedName: problem-284-steady-squares
+---
+
+# --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.
+
+# --hints--
+
+`euler284()` should return 5a411d7b.
+
+```js
+assert.strictEqual(euler284(), '5a411d7b');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler284() {
+
+  return true;
+}
+
+euler284();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
new file mode 100644
index 0000000000..12ddabd722
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
@@ -0,0 +1,46 @@
+---
+id: 5900f48a1000cf542c50ff9c
+title: 'Problem 285: Pythagorean odds'
+challengeType: 5
+forumTopicId: 301936
+dashedName: problem-285-pythagorean-odds
+---
+
+# --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?
+
+# --hints--
+
+`euler285()` should return 157055.80999.
+
+```js
+assert.strictEqual(euler285(), 157055.80999);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler285() {
+
+  return true;
+}
+
+euler285();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
new file mode 100644
index 0000000000..abb357c47a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
@@ -0,0 +1,42 @@
+---
+id: 5900f48a1000cf542c50ff9d
+title: 'Problem 286: Scoring probabilities'
+challengeType: 5
+forumTopicId: 301937
+dashedName: problem-286-scoring-probabilities
+---
+
+# --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.
+
+# --hints--
+
+`euler286()` should return 52.6494571953.
+
+```js
+assert.strictEqual(euler286(), 52.6494571953);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler286() {
+
+  return true;
+}
+
+euler286();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
new file mode 100644
index 0000000000..8d11a248e2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -0,0 +1,54 @@
+---
+id: 5900f48b1000cf542c50ff9e
+title: 'Problem 287: Quadtree encoding (a simple compression algorithm)'
+challengeType: 5
+forumTopicId: 301938
+dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm
+---
+
+# --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 ?
+
+# --hints--
+
+`euler287()` should return 313135496.
+
+```js
+assert.strictEqual(euler287(), 313135496);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler287() {
+
+  return true;
+}
+
+euler287();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
new file mode 100644
index 0000000000..28a2e301ce
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -0,0 +1,48 @@
+---
+id: 5900f48d1000cf542c50ff9f
+title: 'Problem 288: An enormous factorial'
+challengeType: 5
+forumTopicId: 301939
+dashedName: problem-288-an-enormous-factorial
+---
+
+# --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
+
+# --hints--
+
+`euler288()` should return 605857431263982000.
+
+```js
+assert.strictEqual(euler288(), 605857431263982000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler288() {
+
+  return true;
+}
+
+euler288();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
new file mode 100644
index 0000000000..fcac68664d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -0,0 +1,48 @@
+---
+id: 5900f48d1000cf542c50ffa0
+title: 'Problem 289: Eulerian Cycles'
+challengeType: 5
+forumTopicId: 301940
+dashedName: problem-289-eulerian-cycles
+---
+
+# --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 &lt; m, 0 ≤ y &lt; 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.
+
+# --hints--
+
+`euler289()` should return 6567944538.
+
+```js
+assert.strictEqual(euler289(), 6567944538);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler289() {
+
+  return true;
+}
+
+euler289();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
new file mode 100644
index 0000000000..28c05dfc85
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -0,0 +1,86 @@
+---
+id: 5900f3891000cf542c50fe9c
+title: 'Problem 29: Distinct powers'
+challengeType: 5
+forumTopicId: 301941
+dashedName: problem-29-distinct-powers
+---
+
+# --description--
+
+Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+
+<div style='padding-left: 4em;'>
+  2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
+  3<sup>2</sup>=9, 3<sup>3</sup>=27, 3<sup>4</sup>=81, 3<sup>5</sup>=243 <br>
+  4<sup>2</sup>=16, 4<sup>3</sup>=64, 4<sup>4</sup>=256, 4<sup>5</sup>=1024 <br>
+  5<sup>2</sup>=25, 5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125 <br>
+</div>
+
+If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+
+<div style='padding-left: 4em;'>
+  4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
+</div>
+
+How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+
+# --hints--
+
+`distinctPowers(15)` should return a number.
+
+```js
+assert(typeof distinctPowers(15) === 'number');
+```
+
+`distinctPowers(15)` should return 177.
+
+```js
+assert.strictEqual(distinctPowers(15), 177);
+```
+
+`distinctPowers(20)` should return 324.
+
+```js
+assert.strictEqual(distinctPowers(20), 324);
+```
+
+`distinctPowers(25)` should return 519.
+
+```js
+assert.strictEqual(distinctPowers(25), 519);
+```
+
+`distinctPowers(30)` should return 755.
+
+```js
+assert.strictEqual(distinctPowers(30), 755);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function distinctPowers(n) {
+
+  return n;
+}
+
+distinctPowers(30);
+```
+
+# --solutions--
+
+```js
+const distinctPowers = (n) => {
+  let list = [];
+  for (let a=2; a<=n; a++) {
+    for (let b=2; b<=n; b++) {
+      let term = Math.pow(a, b);
+      if (list.indexOf(term)===-1) list.push(term);
+    }
+  }
+  return list.length;
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-290-digital-signature.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
new file mode 100644
index 0000000000..e46dfedd83
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
@@ -0,0 +1,38 @@
+---
+id: 5900f48f1000cf542c50ffa1
+title: 'Problem 290: Digital Signature'
+challengeType: 5
+forumTopicId: 301942
+dashedName: problem-290-digital-signature
+---
+
+# --description--
+
+How many integers 0 ≤ n &lt; 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?
+
+# --hints--
+
+`euler290()` should return 20444710234716470.
+
+```js
+assert.strictEqual(euler290(), 20444710234716470);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler290() {
+
+  return true;
+}
+
+euler290();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
new file mode 100644
index 0000000000..0c7d704d9f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
@@ -0,0 +1,40 @@
+---
+id: 5900f48f1000cf542c50ffa2
+title: 'Problem 291: Panaitopol Primes'
+challengeType: 5
+forumTopicId: 301943
+dashedName: problem-291-panaitopol-primes
+---
+
+# --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.
+
+# --hints--
+
+`euler291()` should return 4037526.
+
+```js
+assert.strictEqual(euler291(), 4037526);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler291() {
+
+  return true;
+}
+
+euler291();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
new file mode 100644
index 0000000000..446e875531
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4911000cf542c50ffa3
+title: 'Problem 292: Pythagorean Polygons'
+challengeType: 5
+forumTopicId: 301944
+dashedName: problem-292-pythagorean-polygons
+---
+
+# --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).
+
+# --hints--
+
+`euler292()` should return 3600060866.
+
+```js
+assert.strictEqual(euler292(), 3600060866);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler292() {
+
+  return true;
+}
+
+euler292();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
new file mode 100644
index 0000000000..18307e7b04
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4931000cf542c50ffa4
+title: 'Problem 293: Pseudo-Fortunate Numbers'
+challengeType: 5
+forumTopicId: 301945
+dashedName: problem-293-pseudo-fortunate-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler293()` should return 2209.
+
+```js
+assert.strictEqual(euler293(), 2209);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler293() {
+
+  return true;
+}
+
+euler293();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
new file mode 100644
index 0000000000..b7bc62a5f1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4931000cf542c50ffa5
+title: 'Problem 294: Sum of digits - experience #23'
+challengeType: 5
+forumTopicId: 301946
+dashedName: problem-294-sum-of-digits---experience-23
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler294()` should return 789184709.
+
+```js
+assert.strictEqual(euler294(), 789184709);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler294() {
+
+  return true;
+}
+
+euler294();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
new file mode 100644
index 0000000000..70d1de6d60
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4931000cf542c50ffa6
+title: 'Problem 295: Lenticular holes'
+challengeType: 5
+forumTopicId: 301947
+dashedName: problem-295-lenticular-holes
+---
+
+# --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 &lt; r1 ≤ r2 ≤ N. We can verify that L(10) = 30 and L(100) = 3442.
+
+Find L(100 000).
+
+# --hints--
+
+`euler295()` should return 4884650818.
+
+```js
+assert.strictEqual(euler295(), 4884650818);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler295() {
+
+  return true;
+}
+
+euler295();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
new file mode 100644
index 0000000000..0d269dca3c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4941000cf542c50ffa7
+title: 'Problem 296: Angular Bisector and Tangent'
+challengeType: 5
+forumTopicId: 301948
+dashedName: problem-296-angular-bisector-and-tangent
+---
+
+# --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?
+
+# --hints--
+
+`euler296()` should return 1137208419.
+
+```js
+assert.strictEqual(euler296(), 1137208419);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler296() {
+
+  return true;
+}
+
+euler296();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
new file mode 100644
index 0000000000..55d96b520c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4951000cf542c50ffa8
+title: 'Problem 297: Zeckendorf Representation'
+challengeType: 5
+forumTopicId: 301949
+dashedName: problem-297-zeckendorf-representation
+---
+
+# --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&lt;n&lt;106, ∑ z(n) = 7894453.
+
+Find ∑ z(n) for 0&lt;n&lt;1017.
+
+# --hints--
+
+`euler297()` should return 2252639041804718000.
+
+```js
+assert.strictEqual(euler297(), 2252639041804718000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler297() {
+
+  return true;
+}
+
+euler297();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
new file mode 100644
index 0000000000..a9c0c8ad7e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4971000cf542c50ffa9
+title: 'Problem 298: Selective Amnesia'
+challengeType: 5
+forumTopicId: 301950
+dashedName: problem-298-selective-amnesia
+---
+
+# --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 .
+
+# --hints--
+
+`euler298()` should return 1.76882294.
+
+```js
+assert.strictEqual(euler298(), 1.76882294);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler298() {
+
+  return true;
+}
+
+euler298();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
new file mode 100644
index 0000000000..586b589068
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4971000cf542c50ffaa
+title: 'Problem 299: Three similar triangles'
+challengeType: 5
+forumTopicId: 301951
+dashedName: problem-299-three-similar-triangles
+---
+
+# --description--
+
+Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
+
+with 0 &lt; a &lt; b and 0 &lt; c &lt; 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 &lt; 100, there are 92 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
+
+# --hints--
+
+`euler299()` should return 549936643.
+
+```js
+assert.strictEqual(euler299(), 549936643);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler299() {
+
+  return true;
+}
+
+euler299();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
new file mode 100644
index 0000000000..0fbe58b9f1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
@@ -0,0 +1,95 @@
+---
+id: 5900f36f1000cf542c50fe82
+title: 'Problem 3: Largest prime factor'
+challengeType: 5
+forumTopicId: 301952
+dashedName: problem-3-largest-prime-factor
+---
+
+# --description--
+
+The prime factors of 13195 are 5, 7, 13 and 29.
+
+What is the largest prime factor of the given `number`?
+
+# --hints--
+
+`largestPrimeFactor(2)` should return a number.
+
+```js
+assert(typeof largestPrimeFactor(2) === 'number');
+```
+
+`largestPrimeFactor(2)` should return 2.
+
+```js
+assert.strictEqual(largestPrimeFactor(2), 2);
+```
+
+`largestPrimeFactor(3)` should return 3.
+
+```js
+assert.strictEqual(largestPrimeFactor(3), 3);
+```
+
+`largestPrimeFactor(5)` should return 5.
+
+```js
+assert.strictEqual(largestPrimeFactor(5), 5);
+```
+
+`largestPrimeFactor(7)` should return 7.
+
+```js
+assert.strictEqual(largestPrimeFactor(7), 7);
+```
+
+`largestPrimeFactor(8)` should return 2.
+
+```js
+assert.strictEqual(largestPrimeFactor(8), 2);
+```
+
+`largestPrimeFactor(13195)` should return 29.
+
+```js
+assert.strictEqual(largestPrimeFactor(13195), 29);
+```
+
+`largestPrimeFactor(600851475143)` should return 6857.
+
+```js
+assert.strictEqual(largestPrimeFactor(600851475143), 6857);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestPrimeFactor(number) {
+
+  return true;
+}
+
+largestPrimeFactor(13195);
+```
+
+# --solutions--
+
+```js
+const largestPrimeFactor = (number) => {
+  let largestFactor = number;
+
+  for (let i = 2; i <= Math.sqrt(largestFactor); i++) {
+    if (!(largestFactor % i)) {
+      let factor = largestFactor / i;
+      let candidate = largestPrimeFactor(factor);
+
+      return i > candidate ? i : candidate;
+    }
+  }
+
+  return largestFactor;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
new file mode 100644
index 0000000000..1eb7fd409b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
@@ -0,0 +1,74 @@
+---
+id: 5900f38a1000cf542c50fe9d
+title: 'Problem 30: Digit n powers'
+challengeType: 5
+forumTopicId: 301953
+dashedName: problem-30-digit-n-powers
+---
+
+# --description--
+
+Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
+
+<div style='margin-left: 4em;'>
+  1634 = 1<sup>4</sup> + 6<sup>4</sup> + 3<sup>4</sup> + 4<sup>4</sup><br>
+  8208 = 8<sup>4</sup> + 2<sup>4</sup> + 0<sup>4</sup> + 8<sup>4</sup><br>
+  9474 = 9<sup>4</sup> + 4<sup>4</sup> + 7<sup>4</sup> + 4<sup>4</sup><br>
+</div>
+
+As 1 = 1<sup>4</sup> 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 `n` powers of their digits.
+
+# --hints--
+
+`digitnPowers(2)` should return a number.
+
+```js
+assert(typeof digitnPowers(2) === 'number');
+```
+
+`digitnPowers(2)` should return 0.
+
+```js
+assert(digitnPowers(2) == 0);
+```
+
+`digitnPowers(3)` should return 1301.
+
+```js
+assert(digitnPowers(3) == 1301);
+```
+
+`digitnPowers(4)` should return 19316.
+
+```js
+assert(digitnPowers(4) == 19316);
+```
+
+`digitnPowers(5)` should return 443839.
+
+```js
+assert(digitnPowers(5) == 443839);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitnPowers(n) {
+
+  return n;
+}
+
+digitnPowers(5);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
new file mode 100644
index 0000000000..52c5f272c6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -0,0 +1,50 @@
+---
+id: 5900f49a1000cf542c50ffac
+title: 'Problem 300: Protein folding'
+challengeType: 5
+forumTopicId: 301954
+dashedName: problem-300-protein-folding
+---
+
+# --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.
+
+# --hints--
+
+`euler300()` should return 8.0540771484375.
+
+```js
+assert.strictEqual(euler300(), 8.0540771484375);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler300() {
+
+  return true;
+}
+
+euler300();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-301-nim.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-301-nim.md
new file mode 100644
index 0000000000..8197d8abf5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-301-nim.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4991000cf542c50ffab
+title: 'Problem 301: Nim'
+challengeType: 5
+forumTopicId: 301955
+dashedName: problem-301-nim
+---
+
+# --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 ?
+
+# --hints--
+
+`euler301()` should return 2178309.
+
+```js
+assert.strictEqual(euler301(), 2178309);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler301() {
+
+  return true;
+}
+
+euler301();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
new file mode 100644
index 0000000000..78c112d626
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
@@ -0,0 +1,50 @@
+---
+id: 5900f49b1000cf542c50ffad
+title: 'Problem 302: Strong Achilles Numbers'
+challengeType: 5
+forumTopicId: 301956
+dashedName: problem-302-strong-achilles-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler302()` should return 1170060.
+
+```js
+assert.strictEqual(euler302(), 1170060);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler302() {
+
+  return true;
+}
+
+euler302();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
new file mode 100644
index 0000000000..1f9b36fad0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
@@ -0,0 +1,44 @@
+---
+id: 5900f49b1000cf542c50ffae
+title: 'Problem 303: Multiples with small digits'
+challengeType: 5
+forumTopicId: 301957
+dashedName: problem-303-multiples-with-small-digits
+---
+
+# --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 .
+
+# --hints--
+
+`euler303()` should return 1111981904675169.
+
+```js
+assert.strictEqual(euler303(), 1111981904675169);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler303() {
+
+  return true;
+}
+
+euler303();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-304-primonacci.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-304-primonacci.md
new file mode 100644
index 0000000000..aab56db553
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-304-primonacci.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49d1000cf542c50ffaf
+title: 'Problem 304: Primonacci'
+challengeType: 5
+forumTopicId: 301958
+dashedName: problem-304-primonacci
+---
+
+# --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.
+
+# --hints--
+
+`euler304()` should return 283988410192.
+
+```js
+assert.strictEqual(euler304(), 283988410192);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler304() {
+
+  return true;
+}
+
+euler304();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
new file mode 100644
index 0000000000..c42f144038
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49d1000cf542c50ffb0
+title: 'Problem 305: Reflexive Position'
+challengeType: 5
+forumTopicId: 301959
+dashedName: problem-305-reflexive-position
+---
+
+# --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.
+
+# --hints--
+
+`euler305()` should return 18174995535140.
+
+```js
+assert.strictEqual(euler305(), 18174995535140);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler305() {
+
+  return true;
+}
+
+euler305();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
new file mode 100644
index 0000000000..d750803f3b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49f1000cf542c50ffb1
+title: 'Problem 306: Paper-strip Game'
+challengeType: 5
+forumTopicId: 301960
+dashedName: problem-306-paper-strip-game
+---
+
+# --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?
+
+# --hints--
+
+`euler306()` should return 852938.
+
+```js
+assert.strictEqual(euler306(), 852938);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler306() {
+
+  return true;
+}
+
+euler306();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-307-chip-defects.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
new file mode 100644
index 0000000000..eac5e7e113
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4a01000cf542c50ffb2
+title: 'Problem 307: Chip Defects'
+challengeType: 5
+forumTopicId: 301961
+dashedName: problem-307-chip-defects
+---
+
+# --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
+
+# --hints--
+
+`euler307()` should return 0.7311720251.
+
+```js
+assert.strictEqual(euler307(), 0.7311720251);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler307() {
+
+  return true;
+}
+
+euler307();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
new file mode 100644
index 0000000000..a0cfc2d8a9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a11000cf542c50ffb3
+title: 'Problem 308: An amazing Prime-generating Automaton'
+challengeType: 5
+forumTopicId: 301962
+dashedName: problem-308-an-amazing-prime-generating-automaton
+---
+
+# --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 ?
+
+# --hints--
+
+`euler308()` should return 1539669807660924.
+
+```js
+assert.strictEqual(euler308(), 1539669807660924);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler308() {
+
+  return true;
+}
+
+euler308();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
new file mode 100644
index 0000000000..03d5603c1f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4a11000cf542c50ffb4
+title: 'Problem 309: Integer Ladders'
+challengeType: 5
+forumTopicId: 301963
+dashedName: problem-309-integer-ladders
+---
+
+# --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 &lt; x &lt; y &lt; 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 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
+
+# --hints--
+
+`euler309()` should return 210139.
+
+```js
+assert.strictEqual(euler309(), 210139);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler309() {
+
+  return true;
+}
+
+euler309();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-31-coin-sums.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
new file mode 100644
index 0000000000..0826a685f4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
@@ -0,0 +1,77 @@
+---
+id: 5900f38b1000cf542c50fe9e
+title: 'Problem 31: Coin sums'
+challengeType: 5
+forumTopicId: 301965
+dashedName: problem-31-coin-sums
+---
+
+# --description--
+
+In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
+
+<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).</div>
+
+It is possible to make £2 in the following way:
+
+<div style='margin-left: 4em;'>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p</div>
+
+How many different ways can `n` pence be made using any number of coins?
+
+# --hints--
+
+`coinSums(50)` should return a number.
+
+```js
+assert(typeof coinSums(50) === 'number');
+```
+
+`coinSums(50)` should return 451.
+
+```js
+assert(coinSums(50) == 451);
+```
+
+`coinSums(100)` should return 4563.
+
+```js
+assert(coinSums(100) == 4563);
+```
+
+`coinSums(150)` should return 21873.
+
+```js
+assert(coinSums(150) == 21873);
+```
+
+`coinSums(200)` should return 73682.
+
+```js
+assert(coinSums(200) == 73682);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function coinSums(n) {
+
+  return n;
+}
+
+coinSums(200);
+```
+
+# --solutions--
+
+```js
+const coinSums = (n) => {
+  const getWays = (n, m=8, c=[1, 2, 5, 10, 20, 50, 100, 200]) => {
+    if (n === 0) return 1;
+    if (m === 0 || n < 0) return 0;
+    return getWays(n - c[m - 1], m, c) + getWays(n, m - 1, c);
+  };
+  return getWays(n);
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-310-nim-square.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-310-nim-square.md
new file mode 100644
index 0000000000..c93f2fd531
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-310-nim-square.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a21000cf542c50ffb5
+title: 'Problem 310: Nim Square'
+challengeType: 5
+forumTopicId: 301966
+dashedName: problem-310-nim-square
+---
+
+# --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.
+
+# --hints--
+
+`euler310()` should return 2586528661783.
+
+```js
+assert.strictEqual(euler310(), 2586528661783);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler310() {
+
+  return true;
+}
+
+euler310();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
new file mode 100644
index 0000000000..b5aee9d2b5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4a31000cf542c50ffb6
+title: 'Problem 311: Biclinic Integral Quadrilaterals'
+challengeType: 5
+forumTopicId: 301967
+dashedName: problem-311-biclinic-integral-quadrilaterals
+---
+
+# --description--
+
+ABCD is a convex, integer sided quadrilateral with 1 ≤ AB &lt; BC &lt; CD &lt; 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).
+
+# --hints--
+
+`euler311()` should return 2466018557.
+
+```js
+assert.strictEqual(euler311(), 2466018557);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler311() {
+
+  return true;
+}
+
+euler311();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
new file mode 100644
index 0000000000..b9083a73f0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a51000cf542c50ffb7
+title: 'Problem 312: Cyclic paths on Sierpiński graphs'
+challengeType: 5
+forumTopicId: 301968
+dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
+---
+
+# --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.
+
+# --hints--
+
+`euler312()` should return 324681947.
+
+```js
+assert.strictEqual(euler312(), 324681947);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler312() {
+
+  return true;
+}
+
+euler312();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
new file mode 100644
index 0000000000..dd6ec7cfb3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4a61000cf542c50ffb8
+title: 'Problem 313: Sliding game'
+challengeType: 5
+forumTopicId: 301969
+dashedName: problem-313-sliding-game
+---
+
+# --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 &lt; 100 is prime.
+
+How many grids does S(m,n) = p2, where p &lt; 106 is prime?
+
+# --hints--
+
+`euler313()` should return 2057774861813004.
+
+```js
+assert.strictEqual(euler313(), 2057774861813004);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler313() {
+
+  return true;
+}
+
+euler313();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
new file mode 100644
index 0000000000..78cd0f1cf6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a71000cf542c50ffb9
+title: 'Problem 314: The Mouse on the Moon'
+challengeType: 5
+forumTopicId: 301970
+dashedName: problem-314-the-mouse-on-the-moon
+---
+
+# --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.
+
+# --hints--
+
+`euler314()` should return 132.52756426.
+
+```js
+assert.strictEqual(euler314(), 132.52756426);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler314() {
+
+  return true;
+}
+
+euler314();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
new file mode 100644
index 0000000000..38a2a69cca
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4a71000cf542c50ffba
+title: 'Problem 315: Digital root clocks'
+challengeType: 5
+forumTopicId: 301971
+dashedName: problem-315-digital-root-clocks
+---
+
+# --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.
+
+# --hints--
+
+`euler315()` should return 13625242.
+
+```js
+assert.strictEqual(euler315(), 13625242);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler315() {
+
+  return true;
+}
+
+euler315();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
new file mode 100644
index 0000000000..4a2821b24e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4a81000cf542c50ffbb
+title: 'Problem 316: Numbers in decimal expansions'
+challengeType: 5
+forumTopicId: 301972
+dashedName: problem-316-numbers-in-decimal-expansions
+---
+
+# --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.
+
+# --hints--
+
+`euler316()` should return 542934735751917760.
+
+```js
+assert.strictEqual(euler316(), 542934735751917760);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler316() {
+
+  return true;
+}
+
+euler316();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-317-firecracker.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-317-firecracker.md
new file mode 100644
index 0000000000..bb528a225a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-317-firecracker.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4aa1000cf542c50ffbc
+title: 'Problem 317: Firecracker'
+challengeType: 5
+forumTopicId: 301973
+dashedName: problem-317-firecracker
+---
+
+# --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.
+
+# --hints--
+
+`euler317()` should return 1856532.8455.
+
+```js
+assert.strictEqual(euler317(), 1856532.8455);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler317() {
+
+  return true;
+}
+
+euler317();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
new file mode 100644
index 0000000000..1e8e9b8821
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -0,0 +1,68 @@
+---
+id: 5900f4ab1000cf542c50ffbd
+title: 'Problem 318: 2011 nines'
+challengeType: 5
+forumTopicId: 301974
+dashedName: problem-318-2011-nines
+---
+
+# --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&lt;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.
+
+# --hints--
+
+`euler318()` should return 709313889.
+
+```js
+assert.strictEqual(euler318(), 709313889);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler318() {
+
+  return true;
+}
+
+euler318();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
new file mode 100644
index 0000000000..687eeb26cd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4ab1000cf542c50ffbe
+title: 'Problem 319: Bounded Sequences'
+challengeType: 5
+forumTopicId: 301975
+dashedName: problem-319-bounded-sequences
+---
+
+# --description--
+
+Let x1, x2,..., xn be a sequence of length n such that:
+
+x1 = 2
+
+for all 1 &lt; i ≤ n : xi-1 &lt; xi
+
+for all i and j with 1 ≤ i, j ≤ n : (xi) j &lt; (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.
+
+# --hints--
+
+`euler319()` should return 268457129.
+
+```js
+assert.strictEqual(euler319(), 268457129);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler319() {
+
+  return true;
+}
+
+euler319();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
new file mode 100644
index 0000000000..fe1724d44f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
@@ -0,0 +1,118 @@
+---
+id: 5900f38c1000cf542c50fe9f
+title: 'Problem 32: Pandigital products'
+challengeType: 5
+forumTopicId: 301976
+dashedName: problem-32-pandigital-products
+---
+
+# --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 `n` pandigital.
+
+**Hint:** Some products can be obtained in more than one way so be sure to only include it once in your sum.
+
+# --hints--
+
+`pandigitalProducts(4)` should return a number.
+
+```js
+assert(typeof pandigitalProducts(4) === 'number');
+```
+
+`pandigitalProducts(4)` should return `12`.
+
+```js
+assert.strictEqual(pandigitalProducts(4), 12);
+```
+
+`pandigitalProducts(6)` should return `162`.
+
+```js
+assert.strictEqual(pandigitalProducts(6), 162);
+```
+
+`pandigitalProducts(7)` should return `0`.
+
+```js
+assert.strictEqual(pandigitalProducts(7), 0);
+```
+
+`pandigitalProducts(8)` should return `13458`.
+
+```js
+assert.strictEqual(pandigitalProducts(8), 13458);
+```
+
+`pandigitalProducts(9)` should return `45228`.
+
+```js
+assert.strictEqual(pandigitalProducts(9), 45228);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalProducts(n) {
+
+  return true;
+}
+
+pandigitalProducts(4);
+```
+
+# --solutions--
+
+```js
+function pandigitalProducts(n) {
+  function is1toNPandigital(n, digitStr) {
+    // check if length is n
+    if (digitStr.length !== n) {
+      return false;
+    }
+    // check if pandigital
+    for (let i = digitStr.length; i > 0; i--) {
+      if (digitStr.indexOf(i.toString()) === -1) {
+        return false;
+      }
+    }
+    return true;
+  }
+  function concatenateNums(...numbers) {
+    let digitStr = '';
+    for (let i = 0; i < numbers.length; i++) {
+      digitStr += numbers[i].toString();
+    }
+    return digitStr;
+  }
+
+  const pandigitalNums = [];
+  const limit = 10 ** Math.floor(n / 2) - 1;
+  let sum = 0;
+  for (let mult1 = 2; mult1 < limit; mult1++) {
+    for (let mult2 = 2; mult2 < limit; mult2++) {
+      const product = mult1 * mult2;
+      const concatenated = concatenateNums(mult1, mult2, product);
+      if (concatenated.length > n) {
+        break;
+      } else if (concatenated.length < n) {
+        continue;
+      }
+      if (
+        is1toNPandigital(n, concatenated) &&
+        !pandigitalNums.includes(product)
+      ) {
+        pandigitalNums.push(product);
+        sum += product;
+      }
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
new file mode 100644
index 0000000000..5171172f98
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ae1000cf542c50ffbf
+title: 'Problem 320: Factorials divisible by a huge integer'
+challengeType: 5
+forumTopicId: 301977
+dashedName: problem-320-factorials-divisible-by-a-huge-integer
+---
+
+# --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.
+
+# --hints--
+
+`euler320()` should return 278157919195482660.
+
+```js
+assert.strictEqual(euler320(), 278157919195482660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler320() {
+
+  return true;
+}
+
+euler320();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
new file mode 100644
index 0000000000..34e52a4dea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ae1000cf542c50ffc0
+title: 'Problem 321: Swapping Counters'
+challengeType: 5
+forumTopicId: 301978
+dashedName: problem-321-swapping-counters
+---
+
+# --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.
+
+# --hints--
+
+`euler321()` should return 2470433131948040.
+
+```js
+assert.strictEqual(euler321(), 2470433131948040);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler321() {
+
+  return true;
+}
+
+euler321();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
new file mode 100644
index 0000000000..241c3a74f0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4af1000cf542c50ffc1
+title: 'Problem 322: Binomial coefficients divisible by 10'
+challengeType: 5
+forumTopicId: 301979
+dashedName: problem-322-binomial-coefficients-divisible-by-10
+---
+
+# --description--
+
+Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i &lt; m(i, m and n are positive integers).
+
+You are given that T(109, 107-10) = 989697000.
+
+Find T(1018, 1012-10).
+
+# --hints--
+
+`euler322()` should return 999998760323314000.
+
+```js
+assert.strictEqual(euler322(), 999998760323314000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler322() {
+
+  return true;
+}
+
+euler322();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
new file mode 100644
index 0000000000..b336759562
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b01000cf542c50ffc2
+title: 'Problem 323: Bitwise-OR operations on random integers'
+challengeType: 5
+forumTopicId: 301980
+dashedName: problem-323-bitwise-or-operations-on-random-integers
+---
+
+# --description--
+
+Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
+
+(i.e. 0 ≤ yi &lt; 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.
+
+# --hints--
+
+`euler323()` should return 6.3551758451.
+
+```js
+assert.strictEqual(euler323(), 6.3551758451);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler323() {
+
+  return true;
+}
+
+euler323();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
new file mode 100644
index 0000000000..66ce491477
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4b11000cf542c50ffc3
+title: 'Problem 324: Building a tower'
+challengeType: 5
+forumTopicId: 301981
+dashedName: problem-324-building-a-tower
+---
+
+# --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.
+
+# --hints--
+
+`euler324()` should return 96972774.
+
+```js
+assert.strictEqual(euler324(), 96972774);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler324() {
+
+  return true;
+}
+
+euler324();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
new file mode 100644
index 0000000000..6d0389b9fa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b11000cf542c50ffc4
+title: 'Problem 325: Stone Game II'
+challengeType: 5
+forumTopicId: 301982
+dashedName: problem-325-stone-game-ii
+---
+
+# --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 &lt; xi &lt; yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.
+
+Find S(1016) mod 710.
+
+# --hints--
+
+`euler325()` should return 54672965.
+
+```js
+assert.strictEqual(euler325(), 54672965);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler325() {
+
+  return true;
+}
+
+euler325();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
new file mode 100644
index 0000000000..1e6b648d9a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b21000cf542c50ffc5
+title: 'Problem 326: Modulo Summations'
+challengeType: 5
+forumTopicId: 301983
+dashedName: problem-326-modulo-summations
+---
+
+# --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).
+
+# --hints--
+
+`euler326()` should return 1966666166408794400.
+
+```js
+assert.strictEqual(euler326(), 1966666166408794400);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler326() {
+
+  return true;
+}
+
+euler326();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
new file mode 100644
index 0000000000..354596b1d7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4b31000cf542c50ffc6
+title: 'Problem 327: Rooms of Doom'
+challengeType: 5
+forumTopicId: 301984
+dashedName: problem-327-rooms-of-doom
+---
+
+# --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.
+
+# --hints--
+
+`euler327()` should return 34315549139516.
+
+```js
+assert.strictEqual(euler327(), 34315549139516);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler327() {
+
+  return true;
+}
+
+euler327();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
new file mode 100644
index 0000000000..4a00f455cc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4b41000cf542c50ffc7
+title: 'Problem 328: Lowest-cost Search'
+challengeType: 5
+forumTopicId: 301985
+dashedName: problem-328-lowest-cost-search
+---
+
+# --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).
+
+# --hints--
+
+`euler328()` should return 260511850222.
+
+```js
+assert.strictEqual(euler328(), 260511850222);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler328() {
+
+  return true;
+}
+
+euler328();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-329-prime-frog.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
new file mode 100644
index 0000000000..6b1e185daf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b51000cf542c50ffc8
+title: 'Problem 329: Prime Frog'
+challengeType: 5
+forumTopicId: 301986
+dashedName: problem-329-prime-frog
+---
+
+# --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.
+
+# --hints--
+
+`euler329()` should return 199740353 / 29386561536000.
+
+```js
+assert.strictEqual(euler329(), 199740353 / 29386561536000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler329() {
+
+  return true;
+}
+
+euler329();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
new file mode 100644
index 0000000000..ec7756e945
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
@@ -0,0 +1,102 @@
+---
+id: 5900f38d1000cf542c50fea0
+title: 'Problem 33: Digit cancelling fractions'
+challengeType: 5
+forumTopicId: 301987
+dashedName: problem-33-digit-cancelling-fractions
+---
+
+# --description--
+
+The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct, is obtained by cancelling the 9s.
+
+We shall consider fractions like, <sup>30</sup>/<sub>50</sub> = <sup>3</sup>/<sub>5</sub>, 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.
+
+# --hints--
+
+`digitCancellingFractions()` should return a number.
+
+```js
+assert(typeof digitCancellingFractions() === 'number');
+```
+
+`digitCancellingFractions()` should return 100.
+
+```js
+assert.strictEqual(digitCancellingFractions(), 100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitCancellingFractions() {
+
+  return true;
+}
+
+digitCancellingFractions();
+```
+
+# --solutions--
+
+```js
+function digitCancellingFractions() {
+  function isCurious(numerator, denominator) {
+    const fraction = numerator / denominator;
+    const numString = numerator.toString();
+    const denString = denominator.toString();
+
+    if (numString[1] === '0' && denString[1] === '0') {
+      // trivial
+      return false;
+    }
+    for (let i = 0; i < 2; i++) {
+      for (let j = 0; j < 2; j++) {
+        if (numString[i] === denString[j]) {
+          const newNum = parseInt(numString[1 - i], 10);
+          const newDen = parseInt(denString[1 - j], 10);
+          if (newNum / newDen === fraction) {
+            return true;
+          }
+        }
+      }
+    }
+    return false;
+  }
+  function findLargestDivisor(a, b) {
+    let gcd = a > b ? b : a;
+    while (gcd > 1) {
+      if (a % gcd === 0 && b % gcd === 0) {
+        return gcd;
+      }
+      gcd--;
+    }
+    return gcd;
+  }
+
+  function simplifyFraction(numerator, denominator) {
+    const divisor = findLargestDivisor(numerator, denominator);
+    return [numerator / divisor, denominator / divisor];
+  }
+
+  let multipleNumerator = 1;
+  let multipleDenominator = 1;
+
+  for (let denominator = 11; denominator < 100; denominator++) {
+    for (let numerator = 10; numerator < denominator; numerator++) {
+      if (isCurious(numerator, denominator)) {
+        multipleNumerator *= numerator;
+        multipleDenominator *= denominator;
+      }
+    }
+  }
+
+  return simplifyFraction(multipleNumerator, multipleDenominator)[1];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-330-eulers-number.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
new file mode 100644
index 0000000000..c8a3feab39
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4b71000cf542c50ffc9
+title: 'Problem 330: Euler''s Number'
+challengeType: 5
+forumTopicId: 301988
+dashedName: problem-330-eulers-number
+---
+
+# --description--
+
+An infinite sequence of real numbers a(n) is defined for all integers n as follows:
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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.
+
+# --hints--
+
+`euler330()` should return 15955822.
+
+```js
+assert.strictEqual(euler330(), 15955822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler330() {
+
+  return true;
+}
+
+euler330();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
new file mode 100644
index 0000000000..4d3d330a74
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b71000cf542c50ffca
+title: 'Problem 331: Cross flips'
+challengeType: 5
+forumTopicId: 301989
+dashedName: problem-331-cross-flips
+---
+
+# --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 .
+
+# --hints--
+
+`euler331()` should return 467178235146843500.
+
+```js
+assert.strictEqual(euler331(), 467178235146843500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler331() {
+
+  return true;
+}
+
+euler331();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
new file mode 100644
index 0000000000..ea3a4d0c43
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4b91000cf542c50ffcb
+title: 'Problem 332: Spherical triangles'
+challengeType: 5
+forumTopicId: 301990
+dashedName: problem-332-spherical-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler332()` should return 2717.751525.
+
+```js
+assert.strictEqual(euler332(), 2717.751525);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler332() {
+
+  return true;
+}
+
+euler332();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
new file mode 100644
index 0000000000..5af490eb7e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b91000cf542c50ffcc
+title: 'Problem 333: Special partitions'
+challengeType: 5
+forumTopicId: 301991
+dashedName: problem-333-special-partitions
+---
+
+# --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 &lt;100 such that P(q)=1 equals 233.
+
+Find the sum of the primes q &lt;1000000 such that P(q)=1.
+
+# --hints--
+
+`euler333()` should return 3053105.
+
+```js
+assert.strictEqual(euler333(), 3053105);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler333() {
+
+  return true;
+}
+
+euler333();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
new file mode 100644
index 0000000000..fe354cec8a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4ba1000cf542c50ffcd
+title: 'Problem 334: Spilling the beans'
+challengeType: 5
+forumTopicId: 301992
+dashedName: problem-334-spilling-the-beans
+---
+
+# --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:
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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.
+
+# --hints--
+
+`euler334()` should return 150320021261690850.
+
+```js
+assert.strictEqual(euler334(), 150320021261690850);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler334() {
+
+  return true;
+}
+
+euler334();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
new file mode 100644
index 0000000000..0605e0d053
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4bd1000cf542c50ffce
+title: 'Problem 335: Gathering the beans'
+challengeType: 5
+forumTopicId: 301993
+dashedName: problem-335-gathering-the-beans
+---
+
+# --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.
+
+# --hints--
+
+`euler335()` should return 5032316.
+
+```js
+assert.strictEqual(euler335(), 5032316);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler335() {
+
+  return true;
+}
+
+euler335();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
new file mode 100644
index 0000000000..3dbf18111c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4bd1000cf542c50ffcf
+title: 'Problem 336: Maximix Arrangements'
+challengeType: 5
+forumTopicId: 301994
+dashedName: problem-336-maximix-arrangements
+---
+
+# --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.
+
+# --hints--
+
+`euler336()` should return CAGBIHEFJDK.
+
+```js
+assert.strictEqual(euler336(), CAGBIHEFJDK);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler336() {
+
+  return true;
+}
+
+euler336();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
new file mode 100644
index 0000000000..677c918f05
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4be1000cf542c50ffd0
+title: 'Problem 337: Totient Stairstep Sequences'
+challengeType: 5
+forumTopicId: 301995
+dashedName: problem-337-totient-stairstep-sequences
+---
+
+# --description--
+
+Let {a1, a2,..., an} be an integer sequence of length n such that:
+
+a1 = 6
+
+for all 1 ≤ i &lt; n : φ(ai) &lt; φ(ai+1) &lt; ai &lt; 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.
+
+# --hints--
+
+`euler337()` should return 85068035.
+
+```js
+assert.strictEqual(euler337(), 85068035);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler337() {
+
+  return true;
+}
+
+euler337();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
new file mode 100644
index 0000000000..514dc560b0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4be1000cf542c50ffd1
+title: 'Problem 338: Cutting Rectangular Grid Paper'
+challengeType: 5
+forumTopicId: 301996
+dashedName: problem-338-cutting-rectangular-grid-paper
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler338()` should return 15614292.
+
+```js
+assert.strictEqual(euler338(), 15614292);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler338() {
+
+  return true;
+}
+
+euler338();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
new file mode 100644
index 0000000000..6844c7e65c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c01000cf542c50ffd2
+title: 'Problem 339: Peredur fab Efrawg'
+challengeType: 5
+forumTopicId: 301997
+dashedName: problem-339-peredur-fab-efrawg
+---
+
+# --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.
+
+# --hints--
+
+`euler339()` should return 19823.542204.
+
+```js
+assert.strictEqual(euler339(), 19823.542204);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler339() {
+
+  return true;
+}
+
+euler339();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
new file mode 100644
index 0000000000..080d068344
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
@@ -0,0 +1,50 @@
+---
+id: 5900f38e1000cf542c50fea1
+title: 'Problem 34: Digit factorials'
+challengeType: 5
+forumTopicId: 301998
+dashedName: problem-34-digit-factorials
+---
+
+# --description--
+
+145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
+
+Find the numbers and the sum of the 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.
+
+# --hints--
+
+`digitFactorial()` should return an object.
+
+```js
+assert.typeOf(digitFactorial(), 'object');
+```
+
+`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }.
+
+```js
+assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFactorial() {
+
+  var sum = 0;
+  var numbers = [];
+  return { sum, numbers };
+}
+
+digitFactorial();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
new file mode 100644
index 0000000000..86b29f061e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4c21000cf542c50ffd4
+title: 'Problem 340: Crazy Function'
+challengeType: 5
+forumTopicId: 301999
+dashedName: problem-340-crazy-function
+---
+
+# --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).
+
+# --hints--
+
+`euler340()` should return 291504964.
+
+```js
+assert.strictEqual(euler340(), 291504964);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler340() {
+
+  return true;
+}
+
+euler340();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
new file mode 100644
index 0000000000..740ef0d751
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4c11000cf542c50ffd3
+title: 'Problem 341: Golomb''s self-describing sequence'
+challengeType: 5
+forumTopicId: 302000
+dashedName: problem-341-golombs-self-describing-sequence
+---
+
+# --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 &lt; 103.
+
+Find ΣG(n3) for 1 ≤ n &lt; 106.
+
+# --hints--
+
+`euler341()` should return 56098610614277016.
+
+```js
+assert.strictEqual(euler341(), 56098610614277016);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler341() {
+
+  return true;
+}
+
+euler341();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
new file mode 100644
index 0000000000..2253ce390f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4c31000cf542c50ffd5
+title: 'Problem 342: The totient of a square is a cube'
+challengeType: 5
+forumTopicId: 302001
+dashedName: problem-342-the-totient-of-a-square-is-a-cube
+---
+
+# --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 &lt; 1010 such that φ(n2) is a cube.
+
+1 φ denotes Euler's totient function.
+
+# --hints--
+
+`euler342()` should return 5943040885644.
+
+```js
+assert.strictEqual(euler342(), 5943040885644);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler342() {
+
+  return true;
+}
+
+euler342();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
new file mode 100644
index 0000000000..3102009e8c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4c41000cf542c50ffd6
+title: 'Problem 343: Fractional Sequences'
+challengeType: 5
+forumTopicId: 302002
+dashedName: problem-343-fractional-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler343()` should return 269533451410884200.
+
+```js
+assert.strictEqual(euler343(), 269533451410884200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler343() {
+
+  return true;
+}
+
+euler343();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
new file mode 100644
index 0000000000..f4fb768b65
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4c51000cf542c50ffd7
+title: 'Problem 344: Silver dollar game'
+challengeType: 5
+forumTopicId: 302003
+dashedName: problem-344-silver-dollar-game
+---
+
+# --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).
+
+# --hints--
+
+`euler344()` should return 65579304332.
+
+```js
+assert.strictEqual(euler344(), 65579304332);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler344() {
+
+  return true;
+}
+
+euler344();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
new file mode 100644
index 0000000000..9cb8157d07
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4c81000cf542c50ffda
+title: 'Problem 345: Matrix Sum'
+challengeType: 5
+forumTopicId: 302004
+dashedName: problem-345-matrix-sum
+---
+
+# --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
+
+# --hints--
+
+`euler345()` should return 13938.
+
+```js
+assert.strictEqual(euler345(), 13938);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler345() {
+
+  return true;
+}
+
+euler345();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
new file mode 100644
index 0000000000..49a1f6b2c2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c71000cf542c50ffd8
+title: 'Problem 346: Strong Repunits'
+challengeType: 5
+forumTopicId: 302005
+dashedName: problem-346-strong-repunits
+---
+
+# --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.
+
+# --hints--
+
+`euler346()` should return 336108797689259260.
+
+```js
+assert.strictEqual(euler346(), 336108797689259260);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler346() {
+
+  return true;
+}
+
+euler346();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
new file mode 100644
index 0000000000..70845508fa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4c81000cf542c50ffd9
+title: 'Problem 347: Largest integer divisible by two primes'
+challengeType: 5
+forumTopicId: 302006
+dashedName: problem-347-largest-integer-divisible-by-two-primes
+---
+
+# --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).
+
+# --hints--
+
+`euler347()` should return 11109800204052.
+
+```js
+assert.strictEqual(euler347(), 11109800204052);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler347() {
+
+  return true;
+}
+
+euler347();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
new file mode 100644
index 0000000000..2fe6e2bc13
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c81000cf542c50ffdb
+title: 'Problem 348: Sum of a square and a cube'
+challengeType: 5
+forumTopicId: 302007
+dashedName: problem-348-sum-of-a-square-and-a-cube
+---
+
+# --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.
+
+# --hints--
+
+`euler348()` should return 1004195061.
+
+```js
+assert.strictEqual(euler348(), 1004195061);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler348() {
+
+  return true;
+}
+
+euler348();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
new file mode 100644
index 0000000000..e73c284fff
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ca1000cf542c50ffdc
+title: 'Problem 349: Langton''s ant'
+challengeType: 5
+forumTopicId: 302008
+dashedName: problem-349-langtons-ant
+---
+
+# --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?
+
+# --hints--
+
+`euler349()` should return 115384615384614940.
+
+```js
+assert.strictEqual(euler349(), 115384615384614940);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler349() {
+
+  return true;
+}
+
+euler349();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
new file mode 100644
index 0000000000..9abfdee8ae
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -0,0 +1,132 @@
+---
+id: 5900f38f1000cf542c50fea2
+title: 'Problem 35: Circular primes'
+challengeType: 5
+forumTopicId: 302009
+dashedName: problem-35-circular-primes
+---
+
+# --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 `n`, whereas 100 ≤ `n` ≤ 1000000?
+
+**Note:**  
+
+Circular primes individual rotation can exceed `n`.
+
+# --hints--
+
+`circularPrimes(100)` should return a number.
+
+```js
+assert(typeof circularPrimes(100) === 'number');
+```
+
+`circularPrimes(100)` should return 13.
+
+```js
+assert(circularPrimes(100) == 13);
+```
+
+`circularPrimes(100000)` should return 43.
+
+```js
+assert(circularPrimes(100000) == 43);
+```
+
+`circularPrimes(250000)` should return 45.
+
+```js
+assert(circularPrimes(250000) == 45);
+```
+
+`circularPrimes(500000)` should return 49.
+
+```js
+assert(circularPrimes(500000) == 49);
+```
+
+`circularPrimes(750000)` should return 49.
+
+```js
+assert(circularPrimes(750000) == 49);
+```
+
+`circularPrimes(1000000)` should return 55.
+
+```js
+assert(circularPrimes(1000000) == 55);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function circularPrimes(n) {
+
+  return n;
+}
+
+circularPrimes(1000000);
+```
+
+# --solutions--
+
+```js
+function rotate(n) {
+  if (n.length == 1) return n;
+  return n.slice(1) + n[0];
+}
+
+function circularPrimes(n) {
+  // Nearest n < 10^k
+  const bound = 10 ** Math.ceil(Math.log10(n));
+  const primes = [0, 0, 2];
+  let count = 0;
+
+  // Making primes array
+  for (let i = 4; i <= bound; i += 2) {
+    primes.push(i - 1);
+    primes.push(0);
+  }
+
+  // Getting upperbound
+  const upperBound = Math.ceil(Math.sqrt(bound));
+
+  // Setting other non-prime numbers to 0
+  for (let i = 3; i < upperBound; i += 2) {
+    if (primes[i]) {
+      for (let j = i * i; j < bound; j += i) {
+        primes[j] = 0;
+      }
+    }
+  }
+
+  // Iterating through the array
+  for (let i = 2; i < n; i++) {
+    if (primes[i]) {
+      let curr = String(primes[i]);
+      let tmp = 1; // tmp variable to hold the no of rotations
+      for (let x = rotate(curr); x != curr; x = rotate(x)) {
+        if (x > n && primes[x]) {
+          continue;
+        }
+        else if (!primes[x]) {
+          // If the rotated value is 0 then it isn't a circular prime, break the loop
+          tmp = 0;
+          break;
+        }
+        tmp++;
+        primes[x] = 0;
+      }
+      count += tmp;
+    }
+  }
+  return count;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
new file mode 100644
index 0000000000..ebc52998b5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4cb1000cf542c50ffdd
+title: 'Problem 350: Constraining the least greatest and the greatest least'
+challengeType: 5
+forumTopicId: 302010
+dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
+---
+
+# --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.
+
+# --hints--
+
+`euler350()` should return 84664213.
+
+```js
+assert.strictEqual(euler350(), 84664213);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler350() {
+
+  return true;
+}
+
+euler350();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
new file mode 100644
index 0000000000..33f0089171
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4cb1000cf542c50ffde
+title: 'Problem 351: Hexagonal orchards'
+challengeType: 5
+forumTopicId: 302011
+dashedName: problem-351-hexagonal-orchards
+---
+
+# --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).
+
+# --hints--
+
+`euler351()` should return 11762187201804552.
+
+```js
+assert.strictEqual(euler351(), 11762187201804552);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler351() {
+
+  return true;
+}
+
+euler351();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-352-blood-tests.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
new file mode 100644
index 0000000000..76af2f075c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4cd1000cf542c50ffdf
+title: 'Problem 352: Blood tests'
+challengeType: 5
+forumTopicId: 302012
+dashedName: problem-352-blood-tests
+---
+
+# --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.
+
+# --hints--
+
+`euler352()` should return 378563.260589.
+
+```js
+assert.strictEqual(euler352(), 378563.260589);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler352() {
+
+  return true;
+}
+
+euler352();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-353-risky-moon.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
new file mode 100644
index 0000000000..74faf24c26
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4cd1000cf542c50ffe0
+title: 'Problem 353: Risky moon'
+challengeType: 5
+forumTopicId: 302013
+dashedName: problem-353-risky-moon
+---
+
+# --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.
+
+# --hints--
+
+`euler353()` should return 1.2759860331.
+
+```js
+assert.strictEqual(euler353(), 1.2759860331);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler353() {
+
+  return true;
+}
+
+euler353();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
new file mode 100644
index 0000000000..346a1af451
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4cf1000cf542c50ffe1
+title: 'Problem 354: Distances in a bee''s honeycomb'
+challengeType: 5
+forumTopicId: 302014
+dashedName: problem-354-distances-in-a-bees-honeycomb
+---
+
+# --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.
+
+# --hints--
+
+`euler354()` should return 58065134.
+
+```js
+assert.strictEqual(euler354(), 58065134);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler354() {
+
+  return true;
+}
+
+euler354();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
new file mode 100644
index 0000000000..a166a1057a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4d01000cf542c50ffe2
+title: 'Problem 355: Maximal coprime subset'
+challengeType: 5
+forumTopicId: 302015
+dashedName: problem-355-maximal-coprime-subset
+---
+
+# --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).
+
+# --hints--
+
+`euler355()` should return 1726545007.
+
+```js
+assert.strictEqual(euler355(), 1726545007);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler355() {
+
+  return true;
+}
+
+euler355();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
new file mode 100644
index 0000000000..9027dcecf9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4d01000cf542c50ffe3
+title: 'Problem 356: Largest roots of cubic polynomials'
+challengeType: 5
+forumTopicId: 302016
+dashedName: problem-356-largest-roots-of-cubic-polynomials
+---
+
+# --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.
+
+# --hints--
+
+`euler356()` should return 28010159.
+
+```js
+assert.strictEqual(euler356(), 28010159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler356() {
+
+  return true;
+}
+
+euler356();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
new file mode 100644
index 0000000000..1bb3f094a2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4d11000cf542c50ffe4
+title: 'Problem 357: Prime generating integers'
+challengeType: 5
+forumTopicId: 302017
+dashedName: problem-357-prime-generating-integers
+---
+
+# --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.
+
+# --hints--
+
+`euler357()` should return 1739023853137.
+
+```js
+assert.strictEqual(euler357(), 1739023853137);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler357() {
+
+  return true;
+}
+
+euler357();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
new file mode 100644
index 0000000000..fb08a667a8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d21000cf542c50ffe5
+title: 'Problem 358: Cyclic numbers'
+challengeType: 5
+forumTopicId: 302018
+dashedName: problem-358-cyclic-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler358()` should return 3284144505.
+
+```js
+assert.strictEqual(euler358(), 3284144505);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler358() {
+
+  return true;
+}
+
+euler358();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
new file mode 100644
index 0000000000..971ae0f401
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d31000cf542c50ffe6
+title: 'Problem 359: Hilbert''s New Hotel'
+challengeType: 5
+forumTopicId: 302019
+dashedName: problem-359-hilberts-new-hotel
+---
+
+# --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.
+
+# --hints--
+
+`euler359()` should return 40632119.
+
+```js
+assert.strictEqual(euler359(), 40632119);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler359() {
+
+  return true;
+}
+
+euler359();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
new file mode 100644
index 0000000000..359211b530
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3901000cf542c50fea3
+title: 'Problem 36: Double-base palindromes'
+challengeType: 5
+forumTopicId: 302020
+dashedName: problem-36-double-base-palindromes
+---
+
+# --description--
+
+The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
+
+Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, which are palindromic in base 10 and base 2.
+
+(Please note that the palindromic number, in either base, may not include leading zeros.)
+
+# --hints--
+
+`doubleBasePalindromes(1000)` should return a number.
+
+```js
+assert(typeof doubleBasePalindromes(1000) === 'number');
+```
+
+`doubleBasePalindromes(1000)` should return 1772.
+
+```js
+assert(doubleBasePalindromes(1000) == 1772);
+```
+
+`doubleBasePalindromes(50000)` should return 105795.
+
+```js
+assert(doubleBasePalindromes(50000) == 105795);
+```
+
+`doubleBasePalindromes(500000)` should return 286602.
+
+```js
+assert(doubleBasePalindromes(500000) == 286602);
+```
+
+`doubleBasePalindromes(1000000)` should return 872187.
+
+```js
+assert(doubleBasePalindromes(1000000) == 872187);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function doubleBasePalindromes(n) {
+
+  return n;
+}
+
+doubleBasePalindromes(1000000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
new file mode 100644
index 0000000000..f028a5d58b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4d41000cf542c50ffe7
+title: 'Problem 360: Scary Sphere'
+challengeType: 5
+forumTopicId: 302021
+dashedName: problem-360-scary-sphere
+---
+
+# --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).
+
+# --hints--
+
+`euler360()` should return 878825614395267100.
+
+```js
+assert.strictEqual(euler360(), 878825614395267100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler360() {
+
+  return true;
+}
+
+euler360();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
new file mode 100644
index 0000000000..bc13159789
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4d51000cf542c50ffe8
+title: 'Problem 361: Subsequence of Thue-Morse sequence'
+challengeType: 5
+forumTopicId: 302022
+dashedName: problem-361-subsequence-of-thue-morse-sequence
+---
+
+# --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 .
+
+# --hints--
+
+`euler361()` should return 178476944.
+
+```js
+assert.strictEqual(euler361(), 178476944);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler361() {
+
+  return true;
+}
+
+euler361();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
new file mode 100644
index 0000000000..4d6bc3f4a9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4d61000cf542c50ffe9
+title: 'Problem 362: Squarefree factors'
+challengeType: 5
+forumTopicId: 302023
+dashedName: problem-362-squarefree-factors
+---
+
+# --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).
+
+# --hints--
+
+`euler362()` should return 457895958010.
+
+```js
+assert.strictEqual(euler362(), 457895958010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler362() {
+
+  return true;
+}
+
+euler362();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
new file mode 100644
index 0000000000..2fde41d1eb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d91000cf542c50ffeb
+title: 'Problem 363: Bézier Curves'
+challengeType: 5
+forumTopicId: 302024
+dashedName: problem-363-bzier-curves
+---
+
+# --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.
+
+# --hints--
+
+`euler363()` should return 0.0000372091.
+
+```js
+assert.strictEqual(euler363(), 0.0000372091);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler363() {
+
+  return true;
+}
+
+euler363();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
new file mode 100644
index 0000000000..84637798b8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d91000cf542c50ffea
+title: 'Problem 364: Comfortable distance'
+challengeType: 5
+forumTopicId: 302025
+dashedName: problem-364-comfortable-distance
+---
+
+# --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.
+
+# --hints--
+
+`euler364()` should return 44855254.
+
+```js
+assert.strictEqual(euler364(), 44855254);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler364() {
+
+  return true;
+}
+
+euler364();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
new file mode 100644
index 0000000000..1647ff46ea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4da1000cf542c50ffec
+title: 'Problem 365: A huge binomial coefficient'
+challengeType: 5
+forumTopicId: 302026
+dashedName: problem-365-a-huge-binomial-coefficient
+---
+
+# --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&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.
+
+# --hints--
+
+`euler365()` should return 162619462356610300.
+
+```js
+assert.strictEqual(euler365(), 162619462356610300);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler365() {
+
+  return true;
+}
+
+euler365();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
new file mode 100644
index 0000000000..b7f832ebf4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4da1000cf542c50ffed
+title: 'Problem 366: Stone Game III'
+challengeType: 5
+forumTopicId: 302027
+dashedName: problem-366-stone-game-iii
+---
+
+# --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.
+
+# --hints--
+
+`euler366()` should return 88351299.
+
+```js
+assert.strictEqual(euler366(), 88351299);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler366() {
+
+  return true;
+}
+
+euler366();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
new file mode 100644
index 0000000000..979702592a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4db1000cf542c50ffee
+title: 'Problem 367: Bozo sort'
+challengeType: 5
+forumTopicId: 302028
+dashedName: problem-367-bozo-sort
+---
+
+# --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.
+
+# --hints--
+
+`euler367()` should return 48271207.
+
+```js
+assert.strictEqual(euler367(), 48271207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler367() {
+
+  return true;
+}
+
+euler367();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
new file mode 100644
index 0000000000..dc9cf2f919
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4dd1000cf542c50ffef
+title: 'Problem 368: A Kempner-like series'
+challengeType: 5
+forumTopicId: 302029
+dashedName: problem-368-a-kempner-like-series
+---
+
+# --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.
+
+# --hints--
+
+`euler368()` should return 253.6135092068.
+
+```js
+assert.strictEqual(euler368(), 253.6135092068);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler368() {
+
+  return true;
+}
+
+euler368();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-369-badugi.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-369-badugi.md
new file mode 100644
index 0000000000..abdcb4c810
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-369-badugi.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4de1000cf542c50fff0
+title: 'Problem 369: Badugi'
+challengeType: 5
+forumTopicId: 302030
+dashedName: problem-369-badugi
+---
+
+# --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.
+
+# --hints--
+
+`euler369()` should return 862400558448.
+
+```js
+assert.strictEqual(euler369(), 862400558448);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler369() {
+
+  return true;
+}
+
+euler369();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
new file mode 100644
index 0000000000..7cac6e4ddb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3911000cf542c50fea4
+title: 'Problem 37: Truncatable primes'
+challengeType: 5
+forumTopicId: 302031
+dashedName: problem-37-truncatable-primes
+---
+
+# --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 `n` (8 ≤ `n` ≤ 11) 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.
+
+# --hints--
+
+`truncatablePrimes(8)` should return a number.
+
+```js
+assert(typeof truncatablePrimes(8) === 'number');
+```
+
+`truncatablePrimes(8)` should return 1986.
+
+```js
+assert(truncatablePrimes(8) == 1986);
+```
+
+`truncatablePrimes(9)` should return 5123.
+
+```js
+assert(truncatablePrimes(9) == 5123);
+```
+
+`truncatablePrimes(10)` should return 8920.
+
+```js
+assert(truncatablePrimes(10) == 8920);
+```
+
+`truncatablePrimes(11)` should return 748317.
+
+```js
+assert(truncatablePrimes(11) == 748317);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function truncatablePrimes(n) {
+
+  return n;
+}
+
+truncatablePrimes(11);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
new file mode 100644
index 0000000000..469f9151e0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4de1000cf542c50fff1
+title: 'Problem 370: Geometric triangles'
+challengeType: 5
+forumTopicId: 302032
+dashedName: problem-370-geometric-triangles
+---
+
+# --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 ?
+
+# --hints--
+
+`euler370()` should return 41791929448408.
+
+```js
+assert.strictEqual(euler370(), 41791929448408);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler370() {
+
+  return true;
+}
+
+euler370();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
new file mode 100644
index 0000000000..005b5aaf07
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4e01000cf542c50fff2
+title: 'Problem 371: Licence plates'
+challengeType: 5
+forumTopicId: 302033
+dashedName: problem-371-licence-plates
+---
+
+# --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.
+
+# --hints--
+
+`euler371()` should return 40.66368097.
+
+```js
+assert.strictEqual(euler371(), 40.66368097);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler371() {
+
+  return true;
+}
+
+euler371();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
new file mode 100644
index 0000000000..1a04cacb71
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4e11000cf542c50fff3
+title: 'Problem 372: Pencils of rays'
+challengeType: 5
+forumTopicId: 302034
+dashedName: problem-372-pencils-of-rays
+---
+
+# --description--
+
+Let R(M, N) be the number of lattice points (x, y) which satisfy M
+
+Note: represents the floor function.
+
+# --hints--
+
+`euler372()` should return 301450082318807040.
+
+```js
+assert.strictEqual(euler372(), 301450082318807040);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler372() {
+
+  return true;
+}
+
+euler372();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
new file mode 100644
index 0000000000..534c32ea25
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4e11000cf542c50fff4
+title: 'Problem 373: Circumscribed Circles'
+challengeType: 5
+forumTopicId: 302035
+dashedName: problem-373-circumscribed-circles
+---
+
+# --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).
+
+# --hints--
+
+`euler373()` should return 727227472448913.
+
+```js
+assert.strictEqual(euler373(), 727227472448913);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler373() {
+
+  return true;
+}
+
+euler373();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
new file mode 100644
index 0000000000..10fe621891
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4e51000cf542c50fff6
+title: 'Problem 374: Maximum Integer Partition Product'
+challengeType: 5
+forumTopicId: 302036
+dashedName: problem-374-maximum-integer-partition-product
+---
+
+# --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.
+
+# --hints--
+
+`euler374()` should return 334420941.
+
+```js
+assert.strictEqual(euler374(), 334420941);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler374() {
+
+  return true;
+}
+
+euler374();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
new file mode 100644
index 0000000000..684613a235
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4e41000cf542c50fff5
+title: 'Problem 375: Minimum of subsequences'
+challengeType: 5
+forumTopicId: 302037
+dashedName: problem-375-minimum-of-subsequences
+---
+
+# --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).
+
+# --hints--
+
+`euler375()` should return 7435327983715286000.
+
+```js
+assert.strictEqual(euler375(), 7435327983715286000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler375() {
+
+  return true;
+}
+
+euler375();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
new file mode 100644
index 0000000000..b76c4d26e8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4e51000cf542c50fff7
+title: 'Problem 376: Nontransitive sets of dice'
+challengeType: 5
+forumTopicId: 302038
+dashedName: problem-376-nontransitive-sets-of-dice
+---
+
+# --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 ?
+
+# --hints--
+
+`euler376()` should return 973059630185670.
+
+```js
+assert.strictEqual(euler376(), 973059630185670);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler376() {
+
+  return true;
+}
+
+euler376();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
new file mode 100644
index 0000000000..660508c234
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4e51000cf542c50fff8
+title: 'Problem 377: Sum of digits, experience 13'
+challengeType: 5
+forumTopicId: 302039
+dashedName: problem-377-sum-of-digits-experience-13
+---
+
+# --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.
+
+# --hints--
+
+`euler377()` should return 732385277.
+
+```js
+assert.strictEqual(euler377(), 732385277);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler377() {
+
+  return true;
+}
+
+euler377();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
new file mode 100644
index 0000000000..22589747fe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4e61000cf542c50fff9
+title: 'Problem 378: Triangle Triples'
+challengeType: 5
+forumTopicId: 302040
+dashedName: problem-378-triangle-triples
+---
+
+# --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 &lt; j &lt; 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.
+
+# --hints--
+
+`euler378()` should return 147534623725724700.
+
+```js
+assert.strictEqual(euler378(), 147534623725724700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler378() {
+
+  return true;
+}
+
+euler378();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
new file mode 100644
index 0000000000..3933d82ea2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4e81000cf542c50fffa
+title: 'Problem 379: Least common multiple count'
+challengeType: 5
+forumTopicId: 302041
+dashedName: problem-379-least-common-multiple-count
+---
+
+# --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).
+
+# --hints--
+
+`euler379()` should return 132314136838185.
+
+```js
+assert.strictEqual(euler379(), 132314136838185);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler379() {
+
+  return true;
+}
+
+euler379();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
new file mode 100644
index 0000000000..e385d29d0f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -0,0 +1,100 @@
+---
+id: 5900f3931000cf542c50fea5
+title: 'Problem 38: Pandigital multiples'
+challengeType: 5
+forumTopicId: 302042
+dashedName: problem-38-pandigital-multiples
+---
+
+# --description--
+
+Take the number 192 and multiply it by each of 1, 2, and 3:
+
+$$\begin{align}
+  192 × 1 = 192\\\\
+  192 × 2 = 384\\\\
+  192 × 3 = 576\\\\
+\end{align}$$
+
+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 `k` pandigital `k`-digit number that can be formed as the concatenated product of an integer with (1, 2, ..., `n`) where `n` > 1?
+
+# --hints--
+
+`pandigitalMultiples(8)` should return a number.
+
+```js
+assert(typeof pandigitalMultiples(8) === 'number');
+```
+
+`pandigitalMultiples(8)` should return `78156234`.
+
+```js
+assert.strictEqual(pandigitalMultiples(8), 78156234);
+```
+
+`pandigitalMultiples(9)` should return `932718654`.
+
+```js
+assert.strictEqual(pandigitalMultiples(9), 932718654);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalMultiples(k) {
+
+  return true;
+}
+
+pandigitalMultiples(8);
+```
+
+# --solutions--
+
+```js
+function pandigitalMultiples(k) {
+  function getKDigitConcatenatedProduct(num, k) {
+    // returns false if concatenated product is not k digits
+    let concatenatedProduct = num.toString();
+    for (let i = 2; concatenatedProduct.length < k; i++) {
+      concatenatedProduct += num * i;
+    }
+    return concatenatedProduct.length === k ? concatenatedProduct : false;
+  }
+
+  function is1toKPandigital(num, k) {
+    const numStr = num.toString();
+
+    // check if length is not k
+    if (numStr.length !== k) {
+      return false;
+    }
+
+    // check if pandigital
+    for (let i = k; i > 0; i--) {
+      if (numStr.indexOf(i.toString()) === -1) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  let largestNum = 0;
+  for (let i = 10 ** Math.floor(k / 2) + 1; i >= 1; i--) {
+    const concatenatedProduct = getKDigitConcatenatedProduct(i, k);
+    if (is1toKPandigital(concatenatedProduct, k)) {
+      const number = parseInt(concatenatedProduct, 10);
+      if (number > largestNum) {
+        largestNum = number;
+      }
+    }
+  }
+  return largestNum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
new file mode 100644
index 0000000000..8596f52fa7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4e81000cf542c50fffb
+title: 'Problem 380: Amazing Mazes!'
+challengeType: 5
+forumTopicId: 302044
+dashedName: problem-380-amazing-mazes
+---
+
+# --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.
+
+# --hints--
+
+`euler380()` should return Infinity.
+
+```js
+assert.strictEqual(euler380(), Infinity);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler380() {
+
+  return true;
+}
+
+euler380();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
new file mode 100644
index 0000000000..f64768a5c7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ea1000cf542c50fffc
+title: 'Problem 381: (prime-k) factorial'
+challengeType: 5
+forumTopicId: 302045
+dashedName: problem-381-prime-k-factorial
+---
+
+# --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 &lt; 100.
+
+Find ∑S(p) for 5 ≤ p &lt; 108.
+
+# --hints--
+
+`euler381()` should return 139602943319822.
+
+```js
+assert.strictEqual(euler381(), 139602943319822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler381() {
+
+  return true;
+}
+
+euler381();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
new file mode 100644
index 0000000000..ae95128f6b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4eb1000cf542c50fffd
+title: 'Problem 382: Generating polygons'
+challengeType: 5
+forumTopicId: 302046
+dashedName: problem-382-generating-polygons
+---
+
+# --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).
+
+# --hints--
+
+`euler382()` should return 697003956.
+
+```js
+assert.strictEqual(euler382(), 697003956);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler382() {
+
+  return true;
+}
+
+euler382();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
new file mode 100644
index 0000000000..f199cb4f94
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ed1000cf542c50ffff
+title: 'Problem 383: Divisibility comparison between factorials'
+challengeType: 5
+forumTopicId: 302047
+dashedName: problem-383-divisibility-comparison-between-factorials
+---
+
+# --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)!) &lt; 2·f5(i!) and 1 ≤ i ≤ n. It can be verified that T5(103) = 68 and T5(109) = 2408210.
+
+Find T5(1018).
+
+# --hints--
+
+`euler383()` should return 22173624649806.
+
+```js
+assert.strictEqual(euler383(), 22173624649806);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler383() {
+
+  return true;
+}
+
+euler383();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
new file mode 100644
index 0000000000..c57f0ee2f9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4ed1000cf542c50fffe
+title: 'Problem 384: Rudin-Shapiro sequence'
+challengeType: 5
+forumTopicId: 302048
+dashedName: problem-384-rudin-shapiro-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler384()` should return 3354706415856333000.
+
+```js
+assert.strictEqual(euler384(), 3354706415856333000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler384() {
+
+  return true;
+}
+
+euler384();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
new file mode 100644
index 0000000000..3cb1e30763
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4ee1000cf542c510000
+title: 'Problem 385: Ellipses inside triangles'
+challengeType: 5
+forumTopicId: 302049
+dashedName: problem-385-ellipses-inside-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler385()` should return 3776957309612154000.
+
+```js
+assert.strictEqual(euler385(), 3776957309612154000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler385() {
+
+  return true;
+}
+
+euler385();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
new file mode 100644
index 0000000000..36a6ce965c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ef1000cf542c510001
+title: 'Problem 386: Maximum length of an antichain'
+challengeType: 5
+forumTopicId: 302050
+dashedName: problem-386-maximum-length-of-an-antichain
+---
+
+# --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
+
+# --hints--
+
+`euler386()` should return 528755790.
+
+```js
+assert.strictEqual(euler386(), 528755790);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler386() {
+
+  return true;
+}
+
+euler386();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
new file mode 100644
index 0000000000..aa3caddfe3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4f11000cf542c510003
+title: 'Problem 387: Harshad Numbers'
+challengeType: 5
+forumTopicId: 302051
+dashedName: problem-387-harshad-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler387()` should return 696067597313468.
+
+```js
+assert.strictEqual(euler387(), 696067597313468);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler387() {
+
+  return true;
+}
+
+euler387();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
new file mode 100644
index 0000000000..ba13e9be3c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4f11000cf542c510002
+title: 'Problem 388: Distinct Lines'
+challengeType: 5
+forumTopicId: 302052
+dashedName: problem-388-distinct-lines
+---
+
+# --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.
+
+# --hints--
+
+`euler388()` should return 831907372805130000.
+
+```js
+assert.strictEqual(euler388(), 831907372805130000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler388() {
+
+  return true;
+}
+
+euler388();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
new file mode 100644
index 0000000000..0fb6bb2688
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4f21000cf542c510004
+title: 'Problem 389: Platonic Dice'
+challengeType: 5
+forumTopicId: 302053
+dashedName: problem-389-platonic-dice
+---
+
+# --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.
+
+# --hints--
+
+`euler389()` should return 2406376.3623.
+
+```js
+assert.strictEqual(euler389(), 2406376.3623);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler389() {
+
+  return true;
+}
+
+euler389();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
new file mode 100644
index 0000000000..d19bb816b7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
@@ -0,0 +1,91 @@
+---
+id: 5900f3931000cf542c50fea6
+title: 'Problem 39: Integer right triangles'
+challengeType: 5
+forumTopicId: 302054
+dashedName: problem-39-integer-right-triangles
+---
+
+# --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` ≤ `n`, is the number of solutions maximized?
+
+# --hints--
+
+`intRightTriangles(500)` should return a number.
+
+```js
+assert(typeof intRightTriangles(500) === 'number');
+```
+
+`intRightTriangles(500)` should return 420.
+
+```js
+assert(intRightTriangles(500) == 420);
+```
+
+`intRightTriangles(800)` should return 720.
+
+```js
+assert(intRightTriangles(800) == 720);
+```
+
+`intRightTriangles(900)` should return 840.
+
+```js
+assert(intRightTriangles(900) == 840);
+```
+
+`intRightTriangles(1000)` should return 840.
+
+```js
+assert(intRightTriangles(1000) == 840);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function intRightTriangles(n) {
+
+  return n;
+}
+
+intRightTriangles(500);
+```
+
+# --solutions--
+
+```js
+// Original idea for this solution came from
+// https://www.xarg.org/puzzle/project-euler/problem-39/
+
+function intRightTriangles(n) {
+  // store the number of triangles with a given perimeter
+  let triangles = {};
+  // a is the shortest side
+  for (let a = 3; a < n / 3; a++)
+  // o is the opposite side and is at least as long as a
+    for (let o = a; o < n / 2; o++) {
+      let h = Math.sqrt(a * a + o * o); // hypotenuse
+      let p = a + o + h;  // perimeter
+      if ((h % 1) === 0 && p <= n) {
+        triangles[p] = (triangles[p] || 0) + 1;
+      }
+    }
+
+  let max = 0, maxp = null;
+  for (let p in triangles) {
+    if (max < triangles[p]) {
+      max = triangles[p];
+      maxp = parseInt(p);
+    }
+  }
+  return maxp;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
new file mode 100644
index 0000000000..e582b23f2d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4f21000cf542c510005
+title: 'Problem 390: Triangles with non rational sides and integral area'
+challengeType: 5
+forumTopicId: 302055
+dashedName: problem-390-triangles-with-non-rational-sides-and-integral-area
+---
+
+# --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).
+
+# --hints--
+
+`euler390()` should return 2919133642971.
+
+```js
+assert.strictEqual(euler390(), 2919133642971);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler390() {
+
+  return true;
+}
+
+euler390();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-391-hopping-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
new file mode 100644
index 0000000000..4eda36c0a4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4f31000cf542c510006
+title: 'Problem 391: Hopping Game'
+challengeType: 5
+forumTopicId: 302056
+dashedName: problem-391-hopping-game
+---
+
+# --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.
+
+# --hints--
+
+`euler391()` should return 61029882288.
+
+```js
+assert.strictEqual(euler391(), 61029882288);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler391() {
+
+  return true;
+}
+
+euler391();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
new file mode 100644
index 0000000000..cd4d53f17d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4f41000cf542c510007
+title: 'Problem 392: Enmeshed unit circle'
+challengeType: 5
+forumTopicId: 302057
+dashedName: problem-392-enmeshed-unit-circle
+---
+
+# --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.
+
+# --hints--
+
+`euler392()` should return 3.1486734435.
+
+```js
+assert.strictEqual(euler392(), 3.1486734435);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler392() {
+
+  return true;
+}
+
+euler392();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
new file mode 100644
index 0000000000..21f98ec10c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4f61000cf542c510008
+title: 'Problem 393: Migrating ants'
+challengeType: 5
+forumTopicId: 302058
+dashedName: problem-393-migrating-ants
+---
+
+# --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).
+
+# --hints--
+
+`euler393()` should return 112398351350823100.
+
+```js
+assert.strictEqual(euler393(), 112398351350823100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler393() {
+
+  return true;
+}
+
+euler393();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
new file mode 100644
index 0000000000..26c7bce3a9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4f71000cf542c510009
+title: 'Problem 394: Eating pie'
+challengeType: 5
+forumTopicId: 302059
+dashedName: problem-394-eating-pie
+---
+
+# --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.
+
+# --hints--
+
+`euler394()` should return 3.2370342194.
+
+```js
+assert.strictEqual(euler394(), 3.2370342194);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler394() {
+
+  return true;
+}
+
+euler394();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
new file mode 100644
index 0000000000..80903ac0ef
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4f71000cf542c51000a
+title: 'Problem 395: Pythagorean tree'
+challengeType: 5
+forumTopicId: 302060
+dashedName: problem-395-pythagorean-tree
+---
+
+# --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.
+
+# --hints--
+
+`euler395()` should return 28.2453753155.
+
+```js
+assert.strictEqual(euler395(), 28.2453753155);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler395() {
+
+  return true;
+}
+
+euler395();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
new file mode 100644
index 0000000000..bb98b389ba
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4f81000cf542c51000b
+title: 'Problem 396: Weak Goodstein sequence'
+challengeType: 5
+forumTopicId: 302061
+dashedName: problem-396-weak-goodstein-sequence
+---
+
+# --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 &lt; 8.
+
+Find the last 9 digits of ΣG(n) for 1 ≤ n &lt; 16.
+
+# --hints--
+
+`euler396()` should return 173214653.
+
+```js
+assert.strictEqual(euler396(), 173214653);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler396() {
+
+  return true;
+}
+
+euler396();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
new file mode 100644
index 0000000000..d8d95c2dd3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4f91000cf542c51000c
+title: 'Problem 397: Triangle on parabola'
+challengeType: 5
+forumTopicId: 302062
+dashedName: problem-397-triangle-on-parabola
+---
+
+# --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 &lt; b &lt; c ≤ X.
+
+For example, F(1, 10) = 41 and F(10, 100) = 12492. Find F(106, 109).
+
+# --hints--
+
+`euler397()` should return 141630459461893730.
+
+```js
+assert.strictEqual(euler397(), 141630459461893730);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler397() {
+
+  return true;
+}
+
+euler397();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
new file mode 100644
index 0000000000..4b145fdfbc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4fa1000cf542c51000d
+title: 'Problem 398: Cutting rope'
+challengeType: 5
+forumTopicId: 302063
+dashedName: problem-398-cutting-rope
+---
+
+# --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.
+
+# --hints--
+
+`euler398()` should return 2010.59096.
+
+```js
+assert.strictEqual(euler398(), 2010.59096);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler398() {
+
+  return true;
+}
+
+euler398();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
new file mode 100644
index 0000000000..b61d13a336
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4fc1000cf542c51000e
+title: 'Problem 399: Squarefree Fibonacci Numbers'
+challengeType: 5
+forumTopicId: 302064
+dashedName: problem-399-squarefree-fibonacci-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler399()` should return 1508395636674243, 6.5e27330467.
+
+```js
+assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler399() {
+
+  return true;
+}
+
+euler399();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
new file mode 100644
index 0000000000..34dbf96399
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
@@ -0,0 +1,64 @@
+---
+id: 5900f3701000cf542c50fe83
+title: 'Problem 4: Largest palindrome product'
+challengeType: 5
+forumTopicId: 302065
+dashedName: problem-4-largest-palindrome-product
+---
+
+# --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 `n`-digit numbers.
+
+# --hints--
+
+`largestPalindromeProduct(2)` should return a number.
+
+```js
+assert(typeof largestPalindromeProduct(2) === 'number');
+```
+
+`largestPalindromeProduct(2)` should return 9009.
+
+```js
+assert.strictEqual(largestPalindromeProduct(2), 9009);
+```
+
+`largestPalindromeProduct(3)` should return 906609.
+
+```js
+assert.strictEqual(largestPalindromeProduct(3), 906609);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestPalindromeProduct(n) {
+
+  return true;
+}
+
+largestPalindromeProduct(3);
+```
+
+# --solutions--
+
+```js
+const largestPalindromeProduct = (digit)=>{
+  let start = 1;
+  let end = Number(`1e${digit}`) - 1;
+ let palindrome = [];
+  for(let i=start;i<=end;i++){
+    for(let j=start;j<=end;j++){
+      let product = i*j;
+      let palindromeRegex = /\b(\d)(\d?)(\d?).?\3\2\1\b/gi;
+      palindromeRegex.test(product) && palindrome.push(product);
+    }
+ }
+ return Math.max(...palindrome);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
new file mode 100644
index 0000000000..f7f6c8f51f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
@@ -0,0 +1,77 @@
+---
+id: 5900f3941000cf542c50fea7
+title: 'Problem 40: Champernowne''s constant'
+challengeType: 5
+forumTopicId: 302066
+dashedName: problem-40-champernownes-constant
+---
+
+# --description--
+
+An irrational decimal fraction is created by concatenating the positive integers:
+
+0.12345678910**1**112131415161718192021...
+
+It can be seen that the 12<sup>th</sup> digit of the fractional part is 1.
+
+If *d<sub>n</sub>* represents the *n*<sup>th</sup> digit of the fractional part, find the value of the following expression.
+
+d<sub>1</sub> × d<sub>10</sub> × d<sub>100</sub> × d<sub>1000</sub> × d<sub>10000</sub> × d<sub>100000</sub> × d<sub>1000000</sub>
+
+# --hints--
+
+`champernownesConstant(100)` should return a number.
+
+```js
+assert(typeof champernownesConstant(100) === 'number');
+```
+
+`champernownesConstant(100)` should return 5.
+
+```js
+assert.strictEqual(champernownesConstant(100), 5);
+```
+
+`champernownesConstant(1000)` should return 15.
+
+```js
+assert.strictEqual(champernownesConstant(1000), 15);
+```
+
+`champernownesConstant(1000000)` should return 210.
+
+```js
+assert.strictEqual(champernownesConstant(1000000), 210);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function champernownesConstant(n) {
+
+  return true;
+}
+
+champernownesConstant(100);
+```
+
+# --solutions--
+
+```js
+function champernownesConstant(n) {
+  let fractionalPart = '';
+  for (let i = 0; fractionalPart.length <= n; i++) {
+    fractionalPart += i.toString();
+  }
+
+  let product = 1;
+  for (let i = 0; i < n.toString().length; i++) {
+    const index = 10 ** i;
+    product *= parseInt(fractionalPart[index], 10);
+  }
+
+  return product;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
new file mode 100644
index 0000000000..07e767a5ba
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4fe1000cf542c510010
+title: 'Problem 400: Fibonacci tree game'
+challengeType: 5
+forumTopicId: 302067
+dashedName: problem-400-fibonacci-tree-game
+---
+
+# --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.
+
+# --hints--
+
+`euler400()` should return 438505383468410600.
+
+```js
+assert.strictEqual(euler400(), 438505383468410600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler400() {
+
+  return true;
+}
+
+euler400();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
new file mode 100644
index 0000000000..d1c5ca48cc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4fd1000cf542c51000f
+title: 'Problem 401: Sum of squares of divisors'
+challengeType: 5
+forumTopicId: 302069
+dashedName: problem-401-sum-of-squares-of-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler401()` should return 281632621.
+
+```js
+assert.strictEqual(euler401(), 281632621);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler401() {
+
+  return true;
+}
+
+euler401();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
new file mode 100644
index 0000000000..b4c4a63fe8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4ff1000cf542c510011
+title: 'Problem 402: Integer-valued polynomials'
+challengeType: 5
+forumTopicId: 302070
+dashedName: problem-402-integer-valued-polynomials
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler402()` should return 356019862.
+
+```js
+assert.strictEqual(euler402(), 356019862);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler402() {
+
+  return true;
+}
+
+euler402();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
new file mode 100644
index 0000000000..d854a56f4a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5001000cf542c510013
+title: 'Problem 403: Lattice points enclosed by parabola and line'
+challengeType: 5
+forumTopicId: 302071
+dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line
+---
+
+# --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.
+
+# --hints--
+
+`euler403()` should return 18224771.
+
+```js
+assert.strictEqual(euler403(), 18224771);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler403() {
+
+  return true;
+}
+
+euler403();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
new file mode 100644
index 0000000000..6b7341cea4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5001000cf542c510012
+title: 'Problem 404: Crisscross Ellipses'
+challengeType: 5
+forumTopicId: 302072
+dashedName: problem-404-crisscross-ellipses
+---
+
+# --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° &lt; θ &lt; 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).
+
+# --hints--
+
+`euler404()` should return 1199215615081353.
+
+```js
+assert.strictEqual(euler404(), 1199215615081353);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler404() {
+
+  return true;
+}
+
+euler404();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
new file mode 100644
index 0000000000..87f1f0c28f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5021000cf542c510014
+title: 'Problem 405: A rectangular tiling'
+challengeType: 5
+forumTopicId: 302073
+dashedName: problem-405-a-rectangular-tiling
+---
+
+# --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.
+
+# --hints--
+
+`euler405()` should return 237696125.
+
+```js
+assert.strictEqual(euler405(), 237696125);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler405() {
+
+  return true;
+}
+
+euler405();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
new file mode 100644
index 0000000000..fd6535eb66
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -0,0 +1,56 @@
+---
+id: 5900f5021000cf542c510015
+title: 'Problem 406: Guessing Game'
+challengeType: 5
+forumTopicId: 302074
+dashedName: problem-406-guessing-game
+---
+
+# --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.
+
+# --hints--
+
+`euler406()` should return 36813.12757207.
+
+```js
+assert.strictEqual(euler406(), 36813.12757207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler406() {
+
+  return true;
+}
+
+euler406();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-407-idempotents.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-407-idempotents.md
new file mode 100644
index 0000000000..eb473f7ba0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-407-idempotents.md
@@ -0,0 +1,42 @@
+---
+id: 5900f5041000cf542c510016
+title: 'Problem 407: Idempotents'
+challengeType: 5
+forumTopicId: 302075
+dashedName: problem-407-idempotents
+---
+
+# --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 &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
+
+Find ∑M(n) for 1 ≤ n ≤ 107.
+
+# --hints--
+
+`euler407()` should return 39782849136421.
+
+```js
+assert.strictEqual(euler407(), 39782849136421);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler407() {
+
+  return true;
+}
+
+euler407();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
new file mode 100644
index 0000000000..0c3decbbe7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5091000cf542c51001b
+title: 'Problem 408: Admissible paths through a grid'
+challengeType: 5
+forumTopicId: 302076
+dashedName: problem-408-admissible-paths-through-a-grid
+---
+
+# --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.
+
+# --hints--
+
+`euler408()` should return 299742733.
+
+```js
+assert.strictEqual(euler408(), 299742733);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler408() {
+
+  return true;
+}
+
+euler408();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
new file mode 100644
index 0000000000..d6dbeffce9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5061000cf542c510017
+title: 'Problem 409: Nim Extreme'
+challengeType: 5
+forumTopicId: 302077
+dashedName: problem-409-nim-extreme
+---
+
+# --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.
+
+# --hints--
+
+`euler409()` should return 253223948.
+
+```js
+assert.strictEqual(euler409(), 253223948);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler409() {
+
+  return true;
+}
+
+euler409();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
new file mode 100644
index 0000000000..41465478fc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3951000cf542c50fea8
+title: 'Problem 41: Pandigital prime'
+challengeType: 5
+forumTopicId: 302078
+dashedName: problem-41-pandigital-prime
+---
+
+# --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`-length digit pandigital prime that exists?
+
+# --hints--
+
+`pandigitalPrime(4)` should return a number.
+
+```js
+assert(typeof pandigitalPrime(4) === 'number');
+```
+
+`pandigitalPrime(4)` should return 4231.
+
+```js
+assert(pandigitalPrime(4) == 4231);
+```
+
+`pandigitalPrime(7)` should return 7652413.
+
+```js
+assert(pandigitalPrime(7) == 7652413);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalPrime(n) {
+
+  return n;
+}
+
+pandigitalPrime(7);
+```
+
+# --solutions--
+
+```js
+function pandigitalPrime(n) {
+  function isPrime(num) {
+    for (let i = 2, s = Math.sqrt(num); i <= s; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return num !== 1;
+  }
+
+  function getPermutations(n) {
+    if (n === 1) {
+      permutations.push(digitsArr.join(''));
+    } else {
+      for (let i = 0; i < n - 1; i++) {
+        getPermutations(n - 1);
+        // swap(n % 2 === 0 ? i : 0, n - 1);
+        if (n % 2 === 0) {
+          swap(i, n - 1);
+        } else {
+          swap(0, n - 1);
+        }
+      }
+      getPermutations(n - 1);
+    }
+  }
+  function swap(x, y) {
+    let temp = digitsArr[x];
+    digitsArr[x] = digitsArr[y];
+    digitsArr[y] = temp;
+  }
+  let max = 0;
+  let permutations = [];
+  let digitsArr;
+  let pandigitalNum = '';
+
+  for (let max = n; max > 0; max--) {
+    pandigitalNum += max;
+  }
+
+  for (let i = 0; i < pandigitalNum.length; i++) {
+    if (max > 0) {
+      break;
+    } else {
+      permutations = [];
+      const currMax = pandigitalNum.slice(i);
+      digitsArr = currMax.split('');
+      getPermutations(digitsArr.length);
+
+      // sort permutations in descending order
+      permutations.sort(function(a, b) {
+        return b - a;
+      });
+
+      for (let perm of permutations) {
+        const thisPerm = parseInt(perm);
+        if (isPrime(thisPerm)) {
+          max = thisPerm;
+          break;
+        }
+      }
+    }
+  }
+
+  return max;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
new file mode 100644
index 0000000000..cd55b71cbc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5071000cf542c510018
+title: 'Problem 410: Circle and tangent line'
+challengeType: 5
+forumTopicId: 302079
+dashedName: problem-410-circle-and-tangent-line
+---
+
+# --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 &lt; r ≤ R and 0 &lt; 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).
+
+# --hints--
+
+`euler410()` should return 799999783589946600.
+
+```js
+assert.strictEqual(euler410(), 799999783589946600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler410() {
+
+  return true;
+}
+
+euler410();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
new file mode 100644
index 0000000000..db9dd2cb86
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5081000cf542c510019
+title: 'Problem 411: Uphill paths'
+challengeType: 5
+forumTopicId: 302080
+dashedName: problem-411-uphill-paths
+---
+
+# --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.
+
+# --hints--
+
+`euler411()` should return 9936352.
+
+```js
+assert.strictEqual(euler411(), 9936352);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler411() {
+
+  return true;
+}
+
+euler411();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
new file mode 100644
index 0000000000..f0dfab1bf6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5081000cf542c51001a
+title: 'Problem 412: Gnomon numbering'
+challengeType: 5
+forumTopicId: 302081
+dashedName: problem-412-gnomon-numbering
+---
+
+# --description--
+
+For integers m, n (0 ≤ n &lt; 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.
+
+# --hints--
+
+`euler412()` should return 38788800.
+
+```js
+assert.strictEqual(euler412(), 38788800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler412() {
+
+  return true;
+}
+
+euler412();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
new file mode 100644
index 0000000000..a3a7ac23c5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f50a1000cf542c51001c
+title: 'Problem 413: One-child Numbers'
+challengeType: 5
+forumTopicId: 302082
+dashedName: problem-413-one-child-numbers
+---
+
+# --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).
+
+# --hints--
+
+`euler413()` should return 3079418648040719.
+
+```js
+assert.strictEqual(euler413(), 3079418648040719);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler413() {
+
+  return true;
+}
+
+euler413();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
new file mode 100644
index 0000000000..9cf45b79ab
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -0,0 +1,60 @@
+---
+id: 5900f50b1000cf542c51001d
+title: 'Problem 414: Kaprekar constant'
+challengeType: 5
+forumTopicId: 302083
+dashedName: problem-414-kaprekar-constant
+---
+
+# --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 &lt; 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 &lt; i &lt; 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.
+
+# --hints--
+
+`euler414()` should return 552506775824935500.
+
+```js
+assert.strictEqual(euler414(), 552506775824935500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler414() {
+
+  return true;
+}
+
+euler414();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
new file mode 100644
index 0000000000..951684acc0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f50c1000cf542c51001e
+title: 'Problem 415: Titanic sets'
+challengeType: 5
+forumTopicId: 302084
+dashedName: problem-415-titanic-sets
+---
+
+# --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.
+
+# --hints--
+
+`euler415()` should return 55859742.
+
+```js
+assert.strictEqual(euler415(), 55859742);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler415() {
+
+  return true;
+}
+
+euler415();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
new file mode 100644
index 0000000000..96e9fe1bb0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
@@ -0,0 +1,42 @@
+---
+id: 5900f50e1000cf542c510020
+title: 'Problem 416: A frog''s trip'
+challengeType: 5
+forumTopicId: 302085
+dashedName: problem-416-a-frogs-trip
+---
+
+# --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).
+
+# --hints--
+
+`euler416()` should return 898082747.
+
+```js
+assert.strictEqual(euler416(), 898082747);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler416() {
+
+  return true;
+}
+
+euler416();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
new file mode 100644
index 0000000000..e73dd646e8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -0,0 +1,48 @@
+---
+id: 5900f50d1000cf542c51001f
+title: 'Problem 417: Reciprocal cycles II'
+challengeType: 5
+forumTopicId: 302086
+dashedName: problem-417-reciprocal-cycles-ii
+---
+
+# --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
+
+# --hints--
+
+`euler417()` should return 446572970925740.
+
+```js
+assert.strictEqual(euler417(), 446572970925740);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler417() {
+
+  return true;
+}
+
+euler417();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
new file mode 100644
index 0000000000..ac11b1083f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
@@ -0,0 +1,46 @@
+---
+id: 5900f50f1000cf542c510021
+title: 'Problem 418: Factorisation triples'
+challengeType: 5
+forumTopicId: 302087
+dashedName: problem-418-factorisation-triples
+---
+
+# --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!).
+
+# --hints--
+
+`euler418()` should return 1177163565297340400.
+
+```js
+assert.strictEqual(euler418(), 1177163565297340400);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler418() {
+
+  return true;
+}
+
+euler418();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
new file mode 100644
index 0000000000..2d9f365090
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
@@ -0,0 +1,58 @@
+---
+id: 5900f5101000cf542c510022
+title: 'Problem 419: Look and say sequence'
+challengeType: 5
+forumTopicId: 302088
+dashedName: problem-419-look-and-say-sequence
+---
+
+# --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
+
+# --hints--
+
+`euler419()` should return 998567458, 1046245404, 43363922.
+
+```js
+assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler419() {
+
+  return true;
+}
+
+euler419();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
new file mode 100644
index 0000000000..bc3de08623
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
@@ -0,0 +1,71 @@
+---
+id: 5900f3961000cf542c50fea9
+title: 'Problem 42: Coded triangle numbers'
+challengeType: 5
+forumTopicId: 302089
+dashedName: problem-42-coded-triangle-numbers
+---
+
+# --description--
+
+The `n`<sup>th</sup> term of the sequence of triangle numbers is given by, `tn` = ½`n`(`n`+1); so the first ten triangle numbers are:
+
+<div style='margin-left: 4em;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
+
+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 = `t`<sub>10</sub>. If the word value is a triangle number then we shall call the word a triangle word.
+
+Using words array of `n`-length, how many are triangle words?
+
+# --hints--
+
+`codedTriangleNumbers(1400)` should return a number.
+
+```js
+assert(typeof codedTriangleNumbers(1400) === 'number');
+```
+
+`codedTriangleNumbers(1400)` should return 129.
+
+```js
+assert(codedTriangleNumbers(1400) == 129);
+```
+
+`codedTriangleNumbers(1500)` should return 137.
+
+```js
+assert(codedTriangleNumbers(1500) == 137);
+```
+
+`codedTriangleNumbers(1600)` should return 141.
+
+```js
+assert(codedTriangleNumbers(1600) == 141);
+```
+
+`codedTriangleNumbers(1786)` should return 162.
+
+```js
+assert(codedTriangleNumbers(1786) == 162);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function codedTriangleNumbers(n) {
+
+  return 1;
+}
+// Only change code above this line
+
+const words = ['A','ABILITY','ABLE','ABOUT','ABOVE','ABSENCE','ABSOLUTELY','ACADEMIC','ACCEPT','ACCESS','ACCIDENT','ACCOMPANY','ACCORDING','ACCOUNT','ACHIEVE','ACHIEVEMENT','ACID','ACQUIRE','ACROSS','ACT','ACTION','ACTIVE','ACTIVITY','ACTUAL','ACTUALLY','ADD','ADDITION','ADDITIONAL','ADDRESS','ADMINISTRATION','ADMIT','ADOPT','ADULT','ADVANCE','ADVANTAGE','ADVICE','ADVISE','AFFAIR','AFFECT','AFFORD','AFRAID','AFTER','AFTERNOON','AFTERWARDS','AGAIN','AGAINST','AGE','AGENCY','AGENT','AGO','AGREE','AGREEMENT','AHEAD','AID','AIM','AIR','AIRCRAFT','ALL','ALLOW','ALMOST','ALONE','ALONG','ALREADY','ALRIGHT','ALSO','ALTERNATIVE','ALTHOUGH','ALWAYS','AMONG','AMONGST','AMOUNT','AN','ANALYSIS','ANCIENT','AND','ANIMAL','ANNOUNCE','ANNUAL','ANOTHER','ANSWER','ANY','ANYBODY','ANYONE','ANYTHING','ANYWAY','APART','APPARENT','APPARENTLY','APPEAL','APPEAR','APPEARANCE','APPLICATION','APPLY','APPOINT','APPOINTMENT','APPROACH','APPROPRIATE','APPROVE','AREA','ARGUE','ARGUMENT','ARISE','ARM','ARMY','AROUND','ARRANGE','ARRANGEMENT','ARRIVE','ART','ARTICLE','ARTIST','AS','ASK','ASPECT','ASSEMBLY','ASSESS','ASSESSMENT','ASSET','ASSOCIATE','ASSOCIATION','ASSUME','ASSUMPTION','AT','ATMOSPHERE','ATTACH','ATTACK','ATTEMPT','ATTEND','ATTENTION','ATTITUDE','ATTRACT','ATTRACTIVE','AUDIENCE','AUTHOR','AUTHORITY','AVAILABLE','AVERAGE','AVOID','AWARD','AWARE','AWAY','AYE','BABY','BACK','BACKGROUND','BAD','BAG','BALANCE','BALL','BAND','BANK','BAR','BASE','BASIC','BASIS','BATTLE','BE','BEAR','BEAT','BEAUTIFUL','BECAUSE','BECOME','BED','BEDROOM','BEFORE','BEGIN','BEGINNING','BEHAVIOUR','BEHIND','BELIEF','BELIEVE','BELONG','BELOW','BENEATH','BENEFIT','BESIDE','BEST','BETTER','BETWEEN','BEYOND','BIG','BILL','BIND','BIRD','BIRTH','BIT','BLACK','BLOCK','BLOOD','BLOODY','BLOW','BLUE','BOARD','BOAT','BODY','BONE','BOOK','BORDER','BOTH','BOTTLE','BOTTOM','BOX','BOY','BRAIN','BRANCH','BREAK','BREATH','BRIDGE','BRIEF','BRIGHT','BRING','BROAD','BROTHER','BUDGET','BUILD','BUILDING','BURN','BUS','BUSINESS','BUSY','BUT','BUY','BY','CABINET','CALL','CAMPAIGN','CAN','CANDIDATE','CAPABLE','CAPACITY','CAPITAL','CAR','CARD','CARE','CAREER','CAREFUL','CAREFULLY','CARRY','CASE','CASH','CAT','CATCH','CATEGORY','CAUSE','CELL','CENTRAL','CENTRE','CENTURY','CERTAIN','CERTAINLY','CHAIN','CHAIR','CHAIRMAN','CHALLENGE','CHANCE','CHANGE','CHANNEL','CHAPTER','CHARACTER','CHARACTERISTIC','CHARGE','CHEAP','CHECK','CHEMICAL','CHIEF','CHILD','CHOICE','CHOOSE','CHURCH','CIRCLE','CIRCUMSTANCE','CITIZEN','CITY','CIVIL','CLAIM','CLASS','CLEAN','CLEAR','CLEARLY','CLIENT','CLIMB','CLOSE','CLOSELY','CLOTHES','CLUB','COAL','CODE','COFFEE','COLD','COLLEAGUE','COLLECT','COLLECTION','COLLEGE','COLOUR','COMBINATION','COMBINE','COME','COMMENT','COMMERCIAL','COMMISSION','COMMIT','COMMITMENT','COMMITTEE','COMMON','COMMUNICATION','COMMUNITY','COMPANY','COMPARE','COMPARISON','COMPETITION','COMPLETE','COMPLETELY','COMPLEX','COMPONENT','COMPUTER','CONCENTRATE','CONCENTRATION','CONCEPT','CONCERN','CONCERNED','CONCLUDE','CONCLUSION','CONDITION','CONDUCT','CONFERENCE','CONFIDENCE','CONFIRM','CONFLICT','CONGRESS','CONNECT','CONNECTION','CONSEQUENCE','CONSERVATIVE','CONSIDER','CONSIDERABLE','CONSIDERATION','CONSIST','CONSTANT','CONSTRUCTION','CONSUMER','CONTACT','CONTAIN','CONTENT','CONTEXT','CONTINUE','CONTRACT','CONTRAST','CONTRIBUTE','CONTRIBUTION','CONTROL','CONVENTION','CONVERSATION','COPY','CORNER','CORPORATE','CORRECT','COS','COST','COULD','COUNCIL','COUNT','COUNTRY','COUNTY','COUPLE','COURSE','COURT','COVER','CREATE','CREATION','CREDIT','CRIME','CRIMINAL','CRISIS','CRITERION','CRITICAL','CRITICISM','CROSS','CROWD','CRY','CULTURAL','CULTURE','CUP','CURRENT','CURRENTLY','CURRICULUM','CUSTOMER','CUT','DAMAGE','DANGER','DANGEROUS','DARK','DATA','DATE','DAUGHTER','DAY','DEAD','DEAL','DEATH','DEBATE','DEBT','DECADE','DECIDE','DECISION','DECLARE','DEEP','DEFENCE','DEFENDANT','DEFINE','DEFINITION','DEGREE','DELIVER','DEMAND','DEMOCRATIC','DEMONSTRATE','DENY','DEPARTMENT','DEPEND','DEPUTY','DERIVE','DESCRIBE','DESCRIPTION','DESIGN','DESIRE','DESK','DESPITE','DESTROY','DETAIL','DETAILED','DETERMINE','DEVELOP','DEVELOPMENT','DEVICE','DIE','DIFFERENCE','DIFFERENT','DIFFICULT','DIFFICULTY','DINNER','DIRECT','DIRECTION','DIRECTLY','DIRECTOR','DISAPPEAR','DISCIPLINE','DISCOVER','DISCUSS','DISCUSSION','DISEASE','DISPLAY','DISTANCE','DISTINCTION','DISTRIBUTION','DISTRICT','DIVIDE','DIVISION','DO','DOCTOR','DOCUMENT','DOG','DOMESTIC','DOOR','DOUBLE','DOUBT','DOWN','DRAW','DRAWING','DREAM','DRESS','DRINK','DRIVE','DRIVER','DROP','DRUG','DRY','DUE','DURING','DUTY','EACH','EAR','EARLY','EARN','EARTH','EASILY','EAST','EASY','EAT','ECONOMIC','ECONOMY','EDGE','EDITOR','EDUCATION','EDUCATIONAL','EFFECT','EFFECTIVE','EFFECTIVELY','EFFORT','EGG','EITHER','ELDERLY','ELECTION','ELEMENT','ELSE','ELSEWHERE','EMERGE','EMPHASIS','EMPLOY','EMPLOYEE','EMPLOYER','EMPLOYMENT','EMPTY','ENABLE','ENCOURAGE','END','ENEMY','ENERGY','ENGINE','ENGINEERING','ENJOY','ENOUGH','ENSURE','ENTER','ENTERPRISE','ENTIRE','ENTIRELY','ENTITLE','ENTRY','ENVIRONMENT','ENVIRONMENTAL','EQUAL','EQUALLY','EQUIPMENT','ERROR','ESCAPE','ESPECIALLY','ESSENTIAL','ESTABLISH','ESTABLISHMENT','ESTATE','ESTIMATE','EVEN','EVENING','EVENT','EVENTUALLY','EVER','EVERY','EVERYBODY','EVERYONE','EVERYTHING','EVIDENCE','EXACTLY','EXAMINATION','EXAMINE','EXAMPLE','EXCELLENT','EXCEPT','EXCHANGE','EXECUTIVE','EXERCISE','EXHIBITION','EXIST','EXISTENCE','EXISTING','EXPECT','EXPECTATION','EXPENDITURE','EXPENSE','EXPENSIVE','EXPERIENCE','EXPERIMENT','EXPERT','EXPLAIN','EXPLANATION','EXPLORE','EXPRESS','EXPRESSION','EXTEND','EXTENT','EXTERNAL','EXTRA','EXTREMELY','EYE','FACE','FACILITY','FACT','FACTOR','FACTORY','FAIL','FAILURE','FAIR','FAIRLY','FAITH','FALL','FAMILIAR','FAMILY','FAMOUS','FAR','FARM','FARMER','FASHION','FAST','FATHER','FAVOUR','FEAR','FEATURE','FEE','FEEL','FEELING','FEMALE','FEW','FIELD','FIGHT','FIGURE','FILE','FILL','FILM','FINAL','FINALLY','FINANCE','FINANCIAL','FIND','FINDING','FINE','FINGER','FINISH','FIRE','FIRM','FIRST','FISH','FIT','FIX','FLAT','FLIGHT','FLOOR','FLOW','FLOWER','FLY','FOCUS','FOLLOW','FOLLOWING','FOOD','FOOT','FOOTBALL','FOR','FORCE','FOREIGN','FOREST','FORGET','FORM','FORMAL','FORMER','FORWARD','FOUNDATION','FREE','FREEDOM','FREQUENTLY','FRESH','FRIEND','FROM','FRONT','FRUIT','FUEL','FULL','FULLY','FUNCTION','FUND','FUNNY','FURTHER','FUTURE','GAIN','GAME','GARDEN','GAS','GATE','GATHER','GENERAL','GENERALLY','GENERATE','GENERATION','GENTLEMAN','GET','GIRL','GIVE','GLASS','GO','GOAL','GOD','GOLD','GOOD','GOVERNMENT','GRANT','GREAT','GREEN','GREY','GROUND','GROUP','GROW','GROWING','GROWTH','GUEST','GUIDE','GUN','HAIR','HALF','HALL','HAND','HANDLE','HANG','HAPPEN','HAPPY','HARD','HARDLY','HATE','HAVE','HE','HEAD','HEALTH','HEAR','HEART','HEAT','HEAVY','HELL','HELP','HENCE','HER','HERE','HERSELF','HIDE','HIGH','HIGHLY','HILL','HIM','HIMSELF','HIS','HISTORICAL','HISTORY','HIT','HOLD','HOLE','HOLIDAY','HOME','HOPE','HORSE','HOSPITAL','HOT','HOTEL','HOUR','HOUSE','HOUSEHOLD','HOUSING','HOW','HOWEVER','HUGE','HUMAN','HURT','HUSBAND','I','IDEA','IDENTIFY','IF','IGNORE','ILLUSTRATE','IMAGE','IMAGINE','IMMEDIATE','IMMEDIATELY','IMPACT','IMPLICATION','IMPLY','IMPORTANCE','IMPORTANT','IMPOSE','IMPOSSIBLE','IMPRESSION','IMPROVE','IMPROVEMENT','IN','INCIDENT','INCLUDE','INCLUDING','INCOME','INCREASE','INCREASED','INCREASINGLY','INDEED','INDEPENDENT','INDEX','INDICATE','INDIVIDUAL','INDUSTRIAL','INDUSTRY','INFLUENCE','INFORM','INFORMATION','INITIAL','INITIATIVE','INJURY','INSIDE','INSIST','INSTANCE','INSTEAD','INSTITUTE','INSTITUTION','INSTRUCTION','INSTRUMENT','INSURANCE','INTEND','INTENTION','INTEREST','INTERESTED','INTERESTING','INTERNAL','INTERNATIONAL','INTERPRETATION','INTERVIEW','INTO','INTRODUCE','INTRODUCTION','INVESTIGATE','INVESTIGATION','INVESTMENT','INVITE','INVOLVE','IRON','IS','ISLAND','ISSUE','IT','ITEM','ITS','ITSELF','JOB','JOIN','JOINT','JOURNEY','JUDGE','JUMP','JUST','JUSTICE','KEEP','KEY','KID','KILL','KIND','KING','KITCHEN','KNEE','KNOW','KNOWLEDGE','LABOUR','LACK','LADY','LAND','LANGUAGE','LARGE','LARGELY','LAST','LATE','LATER','LATTER','LAUGH','LAUNCH','LAW','LAWYER','LAY','LEAD','LEADER','LEADERSHIP','LEADING','LEAF','LEAGUE','LEAN','LEARN','LEAST','LEAVE','LEFT','LEG','LEGAL','LEGISLATION','LENGTH','LESS','LET','LETTER','LEVEL','LIABILITY','LIBERAL','LIBRARY','LIE','LIFE','LIFT','LIGHT','LIKE','LIKELY','LIMIT','LIMITED','LINE','LINK','LIP','LIST','LISTEN','LITERATURE','LITTLE','LIVE','LIVING','LOAN','LOCAL','LOCATION','LONG','LOOK','LORD','LOSE','LOSS','LOT','LOVE','LOVELY','LOW','LUNCH','MACHINE','MAGAZINE','MAIN','MAINLY','MAINTAIN','MAJOR','MAJORITY','MAKE','MALE','MAN','MANAGE','MANAGEMENT','MANAGER','MANNER','MANY','MAP','MARK','MARKET','MARRIAGE','MARRIED','MARRY','MASS','MASTER','MATCH','MATERIAL','MATTER','MAY','MAYBE','ME','MEAL','MEAN','MEANING','MEANS','MEANWHILE','MEASURE','MECHANISM','MEDIA','MEDICAL','MEET','MEETING','MEMBER','MEMBERSHIP','MEMORY','MENTAL','MENTION','MERELY','MESSAGE','METAL','METHOD','MIDDLE','MIGHT','MILE','MILITARY','MILK','MIND','MINE','MINISTER','MINISTRY','MINUTE','MISS','MISTAKE','MODEL','MODERN','MODULE','MOMENT','MONEY','MONTH','MORE','MORNING','MOST','MOTHER','MOTION','MOTOR','MOUNTAIN','MOUTH','MOVE','MOVEMENT','MUCH','MURDER','MUSEUM','MUSIC','MUST','MY','MYSELF','NAME','NARROW','NATION','NATIONAL','NATURAL','NATURE','NEAR','NEARLY','NECESSARILY','NECESSARY','NECK','NEED','NEGOTIATION','NEIGHBOUR','NEITHER','NETWORK','NEVER','NEVERTHELESS','NEW','NEWS','NEWSPAPER','NEXT','NICE','NIGHT','NO','NOBODY','NOD','NOISE','NONE','NOR','NORMAL','NORMALLY','NORTH','NORTHERN','NOSE','NOT','NOTE','NOTHING','NOTICE','NOTION','NOW','NUCLEAR','NUMBER','NURSE','OBJECT','OBJECTIVE','OBSERVATION','OBSERVE','OBTAIN','OBVIOUS','OBVIOUSLY','OCCASION','OCCUR','ODD','OF','OFF','OFFENCE','OFFER','OFFICE','OFFICER','OFFICIAL','OFTEN','OIL','OKAY','OLD','ON','ONCE','ONE','ONLY','ONTO','OPEN','OPERATE','OPERATION','OPINION','OPPORTUNITY','OPPOSITION','OPTION','OR','ORDER','ORDINARY','ORGANISATION','ORGANISE','ORGANIZATION','ORIGIN','ORIGINAL','OTHER','OTHERWISE','OUGHT','OUR','OURSELVES','OUT','OUTCOME','OUTPUT','OUTSIDE','OVER','OVERALL','OWN','OWNER','PACKAGE','PAGE','PAIN','PAINT','PAINTING','PAIR','PANEL','PAPER','PARENT','PARK','PARLIAMENT','PART','PARTICULAR','PARTICULARLY','PARTLY','PARTNER','PARTY','PASS','PASSAGE','PAST','PATH','PATIENT','PATTERN','PAY','PAYMENT','PEACE','PENSION','PEOPLE','PER','PERCENT','PERFECT','PERFORM','PERFORMANCE','PERHAPS','PERIOD','PERMANENT','PERSON','PERSONAL','PERSUADE','PHASE','PHONE','PHOTOGRAPH','PHYSICAL','PICK','PICTURE','PIECE','PLACE','PLAN','PLANNING','PLANT','PLASTIC','PLATE','PLAY','PLAYER','PLEASE','PLEASURE','PLENTY','PLUS','POCKET','POINT','POLICE','POLICY','POLITICAL','POLITICS','POOL','POOR','POPULAR','POPULATION','POSITION','POSITIVE','POSSIBILITY','POSSIBLE','POSSIBLY','POST','POTENTIAL','POUND','POWER','POWERFUL','PRACTICAL','PRACTICE','PREFER','PREPARE','PRESENCE','PRESENT','PRESIDENT','PRESS','PRESSURE','PRETTY','PREVENT','PREVIOUS','PREVIOUSLY','PRICE','PRIMARY','PRIME','PRINCIPLE','PRIORITY','PRISON','PRISONER','PRIVATE','PROBABLY','PROBLEM','PROCEDURE','PROCESS','PRODUCE','PRODUCT','PRODUCTION','PROFESSIONAL','PROFIT','PROGRAM','PROGRAMME','PROGRESS','PROJECT','PROMISE','PROMOTE','PROPER','PROPERLY','PROPERTY','PROPORTION','PROPOSE','PROPOSAL','PROSPECT','PROTECT','PROTECTION','PROVE','PROVIDE','PROVIDED','PROVISION','PUB','PUBLIC','PUBLICATION','PUBLISH','PULL','PUPIL','PURPOSE','PUSH','PUT','QUALITY','QUARTER','QUESTION','QUICK','QUICKLY','QUIET','QUITE','RACE','RADIO','RAILWAY','RAIN','RAISE','RANGE','RAPIDLY','RARE','RATE','RATHER','REACH','REACTION','READ','READER','READING','READY','REAL','REALISE','REALITY','REALIZE','REALLY','REASON','REASONABLE','RECALL','RECEIVE','RECENT','RECENTLY','RECOGNISE','RECOGNITION','RECOGNIZE','RECOMMEND','RECORD','RECOVER','RED','REDUCE','REDUCTION','REFER','REFERENCE','REFLECT','REFORM','REFUSE','REGARD','REGION','REGIONAL','REGULAR','REGULATION','REJECT','RELATE','RELATION','RELATIONSHIP','RELATIVE','RELATIVELY','RELEASE','RELEVANT','RELIEF','RELIGION','RELIGIOUS','RELY','REMAIN','REMEMBER','REMIND','REMOVE','REPEAT','REPLACE','REPLY','REPORT','REPRESENT','REPRESENTATION','REPRESENTATIVE','REQUEST','REQUIRE','REQUIREMENT','RESEARCH','RESOURCE','RESPECT','RESPOND','RESPONSE','RESPONSIBILITY','RESPONSIBLE','REST','RESTAURANT','RESULT','RETAIN','RETURN','REVEAL','REVENUE','REVIEW','REVOLUTION','RICH','RIDE','RIGHT','RING','RISE','RISK','RIVER','ROAD','ROCK','ROLE','ROLL','ROOF','ROOM','ROUND','ROUTE','ROW','ROYAL','RULE','RUN','RURAL','SAFE','SAFETY','SALE','SAME','SAMPLE','SATISFY','SAVE','SAY','SCALE','SCENE','SCHEME','SCHOOL','SCIENCE','SCIENTIFIC','SCIENTIST','SCORE','SCREEN','SEA','SEARCH','SEASON','SEAT','SECOND','SECONDARY','SECRETARY','SECTION','SECTOR','SECURE','SECURITY','SEE','SEEK','SEEM','SELECT','SELECTION','SELL','SEND','SENIOR','SENSE','SENTENCE','SEPARATE','SEQUENCE','SERIES','SERIOUS','SERIOUSLY','SERVANT','SERVE','SERVICE','SESSION','SET','SETTLE','SETTLEMENT','SEVERAL','SEVERE','SEX','SEXUAL','SHAKE','SHALL','SHAPE','SHARE','SHE','SHEET','SHIP','SHOE','SHOOT','SHOP','SHORT','SHOT','SHOULD','SHOULDER','SHOUT','SHOW','SHUT','SIDE','SIGHT','SIGN','SIGNAL','SIGNIFICANCE','SIGNIFICANT','SILENCE','SIMILAR','SIMPLE','SIMPLY','SINCE','SING','SINGLE','SIR','SISTER','SIT','SITE','SITUATION','SIZE','SKILL','SKIN','SKY','SLEEP','SLIGHTLY','SLIP','SLOW','SLOWLY','SMALL','SMILE','SO','SOCIAL','SOCIETY','SOFT','SOFTWARE','SOIL','SOLDIER','SOLICITOR','SOLUTION','SOME','SOMEBODY','SOMEONE','SOMETHING','SOMETIMES','SOMEWHAT','SOMEWHERE','SON','SONG','SOON','SORRY','SORT','SOUND','SOURCE','SOUTH','SOUTHERN','SPACE','SPEAK','SPEAKER','SPECIAL','SPECIES','SPECIFIC','SPEECH','SPEED','SPEND','SPIRIT','SPORT','SPOT','SPREAD','SPRING','STAFF','STAGE','STAND','STANDARD','STAR','START','STATE','STATEMENT','STATION','STATUS','STAY','STEAL','STEP','STICK','STILL','STOCK','STONE','STOP','STORE','STORY','STRAIGHT','STRANGE','STRATEGY','STREET','STRENGTH','STRIKE','STRONG','STRONGLY','STRUCTURE','STUDENT','STUDIO','STUDY','STUFF','STYLE','SUBJECT','SUBSTANTIAL','SUCCEED','SUCCESS','SUCCESSFUL','SUCH','SUDDENLY','SUFFER','SUFFICIENT','SUGGEST','SUGGESTION','SUITABLE','SUM','SUMMER','SUN','SUPPLY','SUPPORT','SUPPOSE','SURE','SURELY','SURFACE','SURPRISE','SURROUND','SURVEY','SURVIVE','SWITCH','SYSTEM','TABLE','TAKE','TALK','TALL','TAPE','TARGET','TASK','TAX','TEA','TEACH','TEACHER','TEACHING','TEAM','TEAR','TECHNICAL','TECHNIQUE','TECHNOLOGY','TELEPHONE','TELEVISION','TELL','TEMPERATURE','TEND','TERM','TERMS','TERRIBLE','TEST','TEXT','THAN','THANK','THANKS','THAT','THE','THEATRE','THEIR','THEM','THEME','THEMSELVES','THEN','THEORY','THERE','THEREFORE','THESE','THEY','THIN','THING','THINK','THIS','THOSE','THOUGH','THOUGHT','THREAT','THREATEN','THROUGH','THROUGHOUT','THROW','THUS','TICKET','TIME','TINY','TITLE','TO','TODAY','TOGETHER','TOMORROW','TONE','TONIGHT','TOO','TOOL','TOOTH','TOP','TOTAL','TOTALLY','TOUCH','TOUR','TOWARDS','TOWN','TRACK','TRADE','TRADITION','TRADITIONAL','TRAFFIC','TRAIN','TRAINING','TRANSFER','TRANSPORT','TRAVEL','TREAT','TREATMENT','TREATY','TREE','TREND','TRIAL','TRIP','TROOP','TROUBLE','TRUE','TRUST','TRUTH','TRY','TURN','TWICE','TYPE','TYPICAL','UNABLE','UNDER','UNDERSTAND','UNDERSTANDING','UNDERTAKE','UNEMPLOYMENT','UNFORTUNATELY','UNION','UNIT','UNITED','UNIVERSITY','UNLESS','UNLIKELY','UNTIL','UP','UPON','UPPER','URBAN','US','USE','USED','USEFUL','USER','USUAL','USUALLY','VALUE','VARIATION','VARIETY','VARIOUS','VARY','VAST','VEHICLE','VERSION','VERY','VIA','VICTIM','VICTORY','VIDEO','VIEW','VILLAGE','VIOLENCE','VISION','VISIT','VISITOR','VITAL','VOICE','VOLUME','VOTE','WAGE','WAIT','WALK','WALL','WANT','WAR','WARM','WARN','WASH','WATCH','WATER','WAVE','WAY','WE','WEAK','WEAPON','WEAR','WEATHER','WEEK','WEEKEND','WEIGHT','WELCOME','WELFARE','WELL','WEST','WESTERN','WHAT','WHATEVER','WHEN','WHERE','WHEREAS','WHETHER','WHICH','WHILE','WHILST','WHITE','WHO','WHOLE','WHOM','WHOSE','WHY','WIDE','WIDELY','WIFE','WILD','WILL','WIN','WIND','WINDOW','WINE','WING','WINNER','WINTER','WISH','WITH','WITHDRAW','WITHIN','WITHOUT','WOMAN','WONDER','WONDERFUL','WOOD','WORD','WORK','WORKER','WORKING','WORKS','WORLD','WORRY','WORTH','WOULD','WRITE','WRITER','WRITING','WRONG','YARD','YEAH','YEAR','YES','YESTERDAY','YET','YOU','YOUNG','YOUR','YOURSELF','YOUTH'];
+
+codedTriangleNumbers(1786);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
new file mode 100644
index 0000000000..e65a335aad
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5111000cf542c510023
+title: 'Problem 420: 2x2 positive integer matrix'
+challengeType: 5
+forumTopicId: 302090
+dashedName: problem-420-2x2-positive-integer-matrix
+---
+
+# --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).
+
+# --hints--
+
+`euler420()` should return 145159332.
+
+```js
+assert.strictEqual(euler420(), 145159332);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler420() {
+
+  return true;
+}
+
+euler420();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
new file mode 100644
index 0000000000..61e0b86a92
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5131000cf542c510024
+title: 'Problem 421: Prime factors of n15+1'
+challengeType: 5
+forumTopicId: 302091
+dashedName: problem-421-prime-factors-of-n151
+---
+
+# --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.
+
+# --hints--
+
+`euler421()` should return 2304215802083466200.
+
+```js
+assert.strictEqual(euler421(), 2304215802083466200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler421() {
+
+  return true;
+}
+
+euler421();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
new file mode 100644
index 0000000000..cf7455ac9d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5131000cf542c510025
+title: 'Problem 422: Sequence of points on a hyperbola'
+challengeType: 5
+forumTopicId: 302092
+dashedName: problem-422-sequence-of-points-on-a-hyperbola
+---
+
+# --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.
+
+# --hints--
+
+`euler422()` should return 92060460.
+
+```js
+assert.strictEqual(euler422(), 92060460);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler422() {
+
+  return true;
+}
+
+euler422();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
new file mode 100644
index 0000000000..a19a5ce19d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5141000cf542c510027
+title: 'Problem 423: Consecutive die throws'
+challengeType: 5
+forumTopicId: 302093
+dashedName: problem-423-consecutive-die-throws
+---
+
+# --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.
+
+# --hints--
+
+`euler423()` should return 653972374.
+
+```js
+assert.strictEqual(euler423(), 653972374);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler423() {
+
+  return true;
+}
+
+euler423();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-424-kakuro.md
new file mode 100644
index 0000000000..827b969ce6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5141000cf542c510026
+title: 'Problem 424: Kakuro'
+challengeType: 5
+forumTopicId: 302094
+dashedName: problem-424-kakuro
+---
+
+# --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.
+
+# --hints--
+
+`euler424()` should return 1059760019628.
+
+```js
+assert.strictEqual(euler424(), 1059760019628);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler424() {
+
+  return true;
+}
+
+euler424();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-425-prime-connection.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
new file mode 100644
index 0000000000..d46740b0d5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5151000cf542c510028
+title: 'Problem 425: Prime connection'
+challengeType: 5
+forumTopicId: 302095
+dashedName: problem-425-prime-connection
+---
+
+# --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).
+
+# --hints--
+
+`euler425()` should return 46479497324.
+
+```js
+assert.strictEqual(euler425(), 46479497324);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler425() {
+
+  return true;
+}
+
+euler425();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
new file mode 100644
index 0000000000..5e2c48c34e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5171000cf542c510029
+title: 'Problem 426: Box-ball system'
+challengeType: 5
+forumTopicId: 302096
+dashedName: problem-426-box-ball-system
+---
+
+# --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.
+
+# --hints--
+
+`euler426()` should return 31591886008.
+
+```js
+assert.strictEqual(euler426(), 31591886008);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler426() {
+
+  return true;
+}
+
+euler426();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-427-n-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
new file mode 100644
index 0000000000..8f399eeaf0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5181000cf542c51002a
+title: 'Problem 427: n-sequences'
+challengeType: 5
+forumTopicId: 302097
+dashedName: problem-427-n-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler427()` should return 97138867.
+
+```js
+assert.strictEqual(euler427(), 97138867);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler427() {
+
+  return true;
+}
+
+euler427();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
new file mode 100644
index 0000000000..e3b2460e6d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5191000cf542c51002b
+title: 'Problem 428: Necklace of Circles'
+challengeType: 5
+forumTopicId: 302098
+dashedName: problem-428-necklace-of-circles
+---
+
+# --description--
+
+Let `a`, `b` and `c` be positive numbers.
+
+Let W, X, Y, Z be four collinear points where |WX| = `a`, |XY| = `b`, |YZ| = `c` and |WZ| = `a` + `b` + `c`.
+
+Let C<sub>in</sub> be the circle having the diameter XY.
+
+Let C<sub>out</sub> be the circle having the diameter WZ.
+
+The triplet (`a`, `b`, `c`) is called a *necklace triplet* if you can place `k` ≥ 3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:
+
+<ul><li>C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub> for 1 ≤ <var>i</var>, <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,</li><li>C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,</li><li>C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var> &lt; <var>k</var>, and</li><li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.</li></ul>
+For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
+<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet">
+
+Let T(`n`) be the number of necklace triplets (`a`, `b`, `c`) such that `a`, `b` and `c` are positive integers, and `b` ≤ `n`. For example, T(1) = 9, T(20) = 732 and T(3000) = 438106.
+
+Find T(1 000 000 000).
+
+# --hints--
+
+`necklace(1000000000)` should return 747215561862.
+
+```js
+assert.strictEqual(necklace(1000000000), 747215561862);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function necklace(n) {
+
+  return true;
+}
+
+necklace(1000000000)
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
new file mode 100644
index 0000000000..8b9c108829
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5191000cf542c51002c
+title: 'Problem 429: Sum of squares of unitary divisors'
+challengeType: 5
+forumTopicId: 302099
+dashedName: problem-429-sum-of-squares-of-unitary-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler429()` should return 98792821.
+
+```js
+assert.strictEqual(euler429(), 98792821);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler429() {
+
+  return true;
+}
+
+euler429();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
new file mode 100644
index 0000000000..7c3a5a8342
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
@@ -0,0 +1,126 @@
+---
+id: 5900f3971000cf542c50feaa
+title: 'Problem 43: Sub-string divisibility'
+challengeType: 5
+forumTopicId: 302100
+dashedName: problem-43-sub-string-divisibility
+---
+
+# --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 $d_1$ be the $1^{st}$ digit, $d_2$ be the $2^{nd}$ digit, and so on. In this way, we note the following:
+
+- ${d_2}{d_3}{d_4} = 406$ is divisible by 2
+- ${d_3}{d_4}{d_5} = 063$ is divisible by 3
+- ${d_4}{d_5}{d_6} = 635$ is divisible by 5
+- ${d_5}{d_6}{d_7} = 357$ is divisible by 7
+- ${d_6}{d_7}{d_8} = 572$ is divisible by 11
+- ${d_7}{d_8}{d_9} = 728$ is divisible by 13
+- ${d_8}{d_9}{d_{10}} = 289$ is divisible by 17
+
+Find the sum of all 0 to `n` pandigital numbers with sub-strings fulfilling `n - 2` of these divisibility properties.
+
+**Note:** Pandigital numbers starting with `0` are to be considered in the result.
+
+# --hints--
+
+`substringDivisibility(5)` should return a number.
+
+```js
+assert(typeof substringDivisibility(5) === 'number');
+```
+
+`substringDivisibility(5)` should return `12444480`.
+
+```js
+assert.strictEqual(substringDivisibility(5), 12444480)
+```
+
+`substringDivisibility(7)` should return `1099210170`.
+
+```js
+assert.strictEqual(substringDivisibility(7), 1099210170)
+```
+
+`substringDivisibility(8)` should return `1113342912`.
+
+```js
+assert.strictEqual(substringDivisibility(8), 1113342912)
+```
+
+`substringDivisibility(9)` should return `16695334890`.
+
+```js
+assert.strictEqual(substringDivisibility(9), 16695334890)
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function substringDivisibility(n) {
+
+  return true;
+}
+
+substringDivisibility(5);
+```
+
+# --solutions--
+
+```js
+function substringDivisibility(n) {
+  function isSubDivisable(digits) {
+    const factors = [2, 3, 5, 7, 11, 13, 17];
+
+    for (let i = 1; i < digits.length - 2; i++) {
+      const subNumber = digits[i] * 100 + digits[i + 1] * 10 + digits[i + 2];
+      if (subNumber % factors[i - 1] !== 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function heapsPermutations(k, digits, conditionCheck, results) {
+    if (k === 1) {
+      if (conditionCheck(digits)) {
+        const number = parseInt(digits.join(''), 10);
+        results.push(number);
+      }
+      return;
+    }
+
+    heapsPermutations(k - 1, digits, conditionCheck, results);
+
+    for (let i = 0; i < k - 1; i++) {
+      if (k % 2 === 0) {
+        [digits[i], digits[k - 1]] = [digits[k - 1], digits[i]];
+      } else {
+        [digits[0], digits[k - 1]] = [digits[k - 1], digits[0]];
+      }
+      heapsPermutations(k - 1, digits, conditionCheck, results);
+    }
+    return;
+  }
+
+  const allowedDigits = [...new Array(n + 1).keys()];
+  const divisablePandigitals = [];
+  heapsPermutations(
+    allowedDigits.length,
+    allowedDigits,
+    isSubDivisable,
+    divisablePandigitals
+  );
+
+  let sum = 0;
+  for (let i = 0; i < divisablePandigitals.length; i++) {
+    sum += divisablePandigitals[i];
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-430-range-flips.md
new file mode 100644
index 0000000000..ba66983c7b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -0,0 +1,48 @@
+---
+id: 5900f51a1000cf542c51002d
+title: 'Problem 430: Range flips'
+challengeType: 5
+forumTopicId: 302101
+dashedName: problem-430-range-flips
+---
+
+# --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.
+
+# --hints--
+
+`euler430()` should return 5000624921.38.
+
+```js
+assert.strictEqual(euler430(), 5000624921.38);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler430() {
+
+  return true;
+}
+
+euler430();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
new file mode 100644
index 0000000000..51a104b47a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -0,0 +1,46 @@
+---
+id: 5900f51b1000cf542c51002e
+title: 'Problem 431: Square Space Silo'
+challengeType: 5
+forumTopicId: 302102
+dashedName: problem-431-square-space-silo
+---
+
+# --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.
+
+# --hints--
+
+`euler431()` should return 23.386029052.
+
+```js
+assert.strictEqual(euler431(), 23.386029052);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler431() {
+
+  return true;
+}
+
+euler431();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-432-totient-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
new file mode 100644
index 0000000000..4f0f5928ef
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
@@ -0,0 +1,42 @@
+---
+id: 5900f51e1000cf542c510030
+title: 'Problem 432: Totient sum'
+challengeType: 5
+forumTopicId: 302103
+dashedName: problem-432-totient-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler432()` should return 754862080.
+
+```js
+assert.strictEqual(euler432(), 754862080);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler432() {
+
+  return true;
+}
+
+euler432();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
new file mode 100644
index 0000000000..5423c8691c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
@@ -0,0 +1,46 @@
+---
+id: 5900f51d1000cf542c51002f
+title: 'Problem 433: Steps in Euclid''s algorithm'
+challengeType: 5
+forumTopicId: 302104
+dashedName: problem-433-steps-in-euclids-algorithm
+---
+
+# --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).
+
+# --hints--
+
+`euler433()` should return 326624372659664.
+
+```js
+assert.strictEqual(euler433(), 326624372659664);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler433() {
+
+  return true;
+}
+
+euler433();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
new file mode 100644
index 0000000000..48a01b7a3b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -0,0 +1,52 @@
+---
+id: 5900f51f1000cf542c510031
+title: 'Problem 434: Rigid graphs'
+challengeType: 5
+forumTopicId: 302105
+dashedName: problem-434-rigid-graphs
+---
+
+# --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
+
+# --hints--
+
+`euler434()` should return 863253606.
+
+```js
+assert.strictEqual(euler434(), 863253606);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler434() {
+
+  return true;
+}
+
+euler434();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
new file mode 100644
index 0000000000..ee078a7382
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5201000cf542c510032
+title: 'Problem 435: Polynomials of Fibonacci numbers'
+challengeType: 5
+forumTopicId: 302106
+dashedName: problem-435-polynomials-of-fibonacci-numbers
+---
+
+# --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!).
+
+# --hints--
+
+`euler435()` should return 252541322550.
+
+```js
+assert.strictEqual(euler435(), 252541322550);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler435() {
+
+  return true;
+}
+
+euler435();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
new file mode 100644
index 0000000000..43b111b868
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5221000cf542c510033
+title: 'Problem 436: Unfair wager'
+challengeType: 5
+forumTopicId: 302107
+dashedName: problem-436-unfair-wager
+---
+
+# --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
+
+# --hints--
+
+`euler436()` should return 0.5276662759.
+
+```js
+assert.strictEqual(euler436(), 0.5276662759);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler436() {
+
+  return true;
+}
+
+euler436();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
new file mode 100644
index 0000000000..0072d0f9a9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -0,0 +1,64 @@
+---
+id: 5900f5241000cf542c510036
+title: 'Problem 437: Fibonacci primitive roots'
+challengeType: 5
+forumTopicId: 302108
+dashedName: problem-437-fibonacci-primitive-roots
+---
+
+# --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.
+
+# --hints--
+
+`euler437()` should return 74204709657207.
+
+```js
+assert.strictEqual(euler437(), 74204709657207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler437() {
+
+  return true;
+}
+
+euler437();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
new file mode 100644
index 0000000000..112326a2fa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5231000cf542c510034
+title: 'Problem 438: Integer part of polynomial equation''s solutions'
+challengeType: 5
+forumTopicId: 302109
+dashedName: problem-438-integer-part-of-polynomial-equations-solutions
+---
+
+# --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.
+
+# --hints--
+
+`euler438()` should return 2046409616809.
+
+```js
+assert.strictEqual(euler438(), 2046409616809);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler438() {
+
+  return true;
+}
+
+euler438();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
new file mode 100644
index 0000000000..4fb1871a85
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5231000cf542c510035
+title: 'Problem 439: Sum of sum of divisors'
+challengeType: 5
+forumTopicId: 302110
+dashedName: problem-439-sum-of-sum-of-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler439()` should return 968697378.
+
+```js
+assert.strictEqual(euler439(), 968697378);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler439() {
+
+  return true;
+}
+
+euler439();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
new file mode 100644
index 0000000000..3b89176ca1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
@@ -0,0 +1,77 @@
+---
+id: 5900f3981000cf542c50feab
+title: 'Problem 44: Pentagon numbers'
+challengeType: 5
+forumTopicId: 302111
+dashedName: problem-44-pentagon-numbers
+---
+
+# --description--
+
+Pentagonal numbers are generated by the formula, P<sub>n</sub>=`n`(3`n`−1)/2. The first ten pentagonal numbers are:
+
+1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
+
+It can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However, their difference, 70 − 22 = 48, is not pentagonal.
+
+Find the pair of pentagonal numbers, P<sub>j</sub> and P<sub>k</sub>, for which their sum and difference are pentagonal and D = |P<sub>k</sub> − P<sub>j</sub>| is minimized; what is the value of D?
+
+# --hints--
+
+`pentagonNumbers()` should return a number.
+
+```js
+assert(typeof pentagonNumbers() === 'number');
+```
+
+`pentagonNumbers()` should return 5482660.
+
+```js
+assert.strictEqual(pentagonNumbers(), 5482660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pentagonNumbers() {
+
+  return true;
+}
+
+pentagonNumbers();
+```
+
+# --solutions--
+
+```js
+function pentagonNumbers() {
+  function isPentagonal(num) {
+  // Formula found by solving pentagonal number
+  // equation for n.
+  const n = (Math.sqrt((24 * num) + 1) + 1) / 6;
+  return n % 1 === 0;
+  }
+
+  function pentagonal(num) {
+    return (num * ((3 * num) - 1)) / 2;
+  }
+  let result;
+  let i = 1;
+  while (!result) {
+  i++;
+  const num1 = (i * ((3 * i) - 1)) / 2; // Pentagonal num formula
+  const minDiff = num1 - (((i - 1) * ((3 * (i - 1)) - 1)) / 2);
+  let j = i - 1;
+  while (j > 0 && !result) {
+  const num2 = (j * ((3 * j) - 1)) / 2;
+  if (isPentagonal(num1 - num2) && isPentagonal(num1 + num2)) {
+        result = num1 - num2;
+      }
+      j--;
+    }
+  }
+  return result;
+  }
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
new file mode 100644
index 0000000000..a68f99a00a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5241000cf542c510037
+title: 'Problem 440: GCD and Tiling'
+challengeType: 5
+forumTopicId: 302112
+dashedName: problem-440-gcd-and-tiling
+---
+
+# --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.
+
+# --hints--
+
+`euler440()` should return 970746056.
+
+```js
+assert.strictEqual(euler440(), 970746056);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler440() {
+
+  return true;
+}
+
+euler440();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
new file mode 100644
index 0000000000..6cc5fd7e2e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5261000cf542c510038
+title: 'Problem 441: The inverse summation of coprime couples'
+challengeType: 5
+forumTopicId: 302113
+dashedName: problem-441-the-inverse-summation-of-coprime-couples
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler441()` should return 5000088.8395.
+
+```js
+assert.strictEqual(euler441(), 5000088.8395);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler441() {
+
+  return true;
+}
+
+euler441();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
new file mode 100644
index 0000000000..e5b1e35319
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5271000cf542c510039
+title: 'Problem 442: Eleven-free integers'
+challengeType: 5
+forumTopicId: 302114
+dashedName: problem-442-eleven-free-integers
+---
+
+# --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).
+
+# --hints--
+
+`euler442()` should return 1295552661530920200.
+
+```js
+assert.strictEqual(euler442(), 1295552661530920200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler442() {
+
+  return true;
+}
+
+euler442();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
new file mode 100644
index 0000000000..9afda46059
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5271000cf542c51003a
+title: 'Problem 443: GCD sequence'
+challengeType: 5
+forumTopicId: 302115
+dashedName: problem-443-gcd-sequence
+---
+
+# --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:
+
+n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
+
+<!-- TODO Use MathJax -->
+
+You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
+
+Find g(1015).
+
+# --hints--
+
+`euler443()` should return 2744233049300770.
+
+```js
+assert.strictEqual(euler443(), 2744233049300770);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler443() {
+
+  return true;
+}
+
+euler443();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
new file mode 100644
index 0000000000..04d71de485
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
@@ -0,0 +1,53 @@
+---
+id: 5900f52a1000cf542c51003b
+title: 'Problem 444: The Roundtable Lottery'
+challengeType: 5
+forumTopicId: 302116
+dashedName: problem-444-the-roundtable-lottery
+---
+
+# --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).
+
+# --hints--
+
+`euler444()` should return 1.200856722e+263.
+
+```js
+assert.strictEqual(euler444(), 1.200856722e263);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler444() {
+
+  return true;
+}
+
+euler444();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-445-retractions-a.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
new file mode 100644
index 0000000000..39c80f706d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52a1000cf542c51003c
+title: 'Problem 445: Retractions A'
+challengeType: 5
+forumTopicId: 302117
+dashedName: problem-445-retractions-a
+---
+
+# --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
+
+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.
+
+# --hints--
+
+`euler445()` should return 659104042.
+
+```js
+assert.strictEqual(euler445(), 659104042);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler445() {
+
+  return true;
+}
+
+euler445();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-446-retractions-b.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
new file mode 100644
index 0000000000..a46677999e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52c1000cf542c51003d
+title: 'Problem 446: Retractions B'
+challengeType: 5
+forumTopicId: 302118
+dashedName: problem-446-retractions-b
+---
+
+# --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
+
+F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
+
+Find F(107) (mod 1 000 000 007)
+
+# --hints--
+
+`euler446()` should return 907803852.
+
+```js
+assert.strictEqual(euler446(), 907803852);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler446() {
+
+  return true;
+}
+
+euler446();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-447-retractions-c.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
new file mode 100644
index 0000000000..c8cb09065c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52c1000cf542c51003e
+title: 'Problem 447: Retractions C'
+challengeType: 5
+forumTopicId: 302119
+dashedName: problem-447-retractions-c
+---
+
+# --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
+
+F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
+
+Find F(1014) (mod 1 000 000 007).
+
+# --hints--
+
+`euler447()` should return 530553372.
+
+```js
+assert.strictEqual(euler447(), 530553372);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler447() {
+
+  return true;
+}
+
+euler447();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
new file mode 100644
index 0000000000..6bf716c1d3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
@@ -0,0 +1,46 @@
+---
+id: 5900f52c1000cf542c51003f
+title: 'Problem 448: Average least common multiple'
+challengeType: 5
+forumTopicId: 302120
+dashedName: problem-448-average-least-common-multiple
+---
+
+# --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.
+
+# --hints--
+
+`euler448()` should return 106467648.
+
+```js
+assert.strictEqual(euler448(), 106467648);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler448() {
+
+  return true;
+}
+
+euler448();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
new file mode 100644
index 0000000000..18c1923095
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
@@ -0,0 +1,48 @@
+---
+id: 5900f52d1000cf542c510040
+title: 'Problem 449: Chocolate covered candy'
+challengeType: 5
+forumTopicId: 302121
+dashedName: problem-449-chocolate-covered-candy
+---
+
+# --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
+
+<!-- TODO Use MathJax -->
+
+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.
+
+# --hints--
+
+`euler449()` should return 103.37870096.
+
+```js
+assert.strictEqual(euler449(), 103.37870096);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler449() {
+
+  return true;
+}
+
+euler449();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
new file mode 100644
index 0000000000..5c3b224b4a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -0,0 +1,82 @@
+---
+id: 5900f3991000cf542c50feac
+title: 'Problem 45: Triangular, pentagonal, and hexagonal'
+challengeType: 5
+forumTopicId: 302122
+dashedName: problem-45-triangular-pentagonal-and-hexagonal
+---
+
+# --description--
+
+Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
+
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Triangle</div><div>T<sub>n</sub>=<var>n</var>(<var>n</var>+1)/2</div><div>1, 3, 6, 10, 15, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Pentagonal</div><div>P<sub>n</sub>=<var>n</var>(3<var>n</var>−1)/2</div><div>1, 5, 12, 22, 35, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Hexagonal</div><div>H<sub>n</sub>=<var>n</var>(2<var>n</var>−1)</div><div>1, 6, 15, 28, 45, ...</div></div>
+
+It can be verified that T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
+
+Find the next triangle number that is also pentagonal and hexagonal.
+
+# --hints--
+
+`triPentaHexa(40756)` should return a number.
+
+```js
+assert(typeof triPentaHexa(40756) === 'number');
+```
+
+`triPentaHexa(40756)` should return 1533776805.
+
+```js
+assert.strictEqual(triPentaHexa(40756), 1533776805);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function triPentaHexa(n) {
+
+  return true;
+}
+
+triPentaHexa(40756);
+```
+
+# --solutions--
+
+```js
+function triPentaHexa(n) {
+  function triangular(num) {
+  return (num * (num + 1)) / 2;
+}
+
+function isPentagonal(num) {
+  // Formula found by completing the square and
+  // solving for n.
+  const n = (Math.sqrt((24 * num) + 1) + 1) / 6;
+  return n % 1 === 0;
+}
+
+  function isHexagonal(num) {
+  // Formula found by completing the square and
+  // solving for n.
+  const n = Math.sqrt(0.5 * (num + (1 / 8))) + 0.25;
+ return n % 1 === 0;
+}
+
+let iTri = n;
+let tri;
+let found = false;
+while (!found) {
+  iTri++;
+  tri = triangular(iTri);
+  if (isPentagonal(tri) && isHexagonal(tri)) {
+    found = true;
+    }
+  }
+  return tri;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
new file mode 100644
index 0000000000..17cf3af082
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -0,0 +1,60 @@
+---
+id: 5900f52e1000cf542c510041
+title: 'Problem 450: Hypocycloid and Lattice points'
+challengeType: 5
+forumTopicId: 302123
+dashedName: problem-450-hypocycloid-and-lattice-points
+---
+
+# --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 &lt; 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).
+
+# --hints--
+
+`euler450()` should return 583333163984220900.
+
+```js
+assert.strictEqual(euler450(), 583333163984220900);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler450() {
+
+  return true;
+}
+
+euler450();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
new file mode 100644
index 0000000000..1b12ec1c22
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -0,0 +1,60 @@
+---
+id: 5900f5311000cf542c510042
+title: 'Problem 451: Modular inverses'
+challengeType: 5
+forumTopicId: 302124
+dashedName: problem-451-modular-inverses
+---
+
+# --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
+
+# --hints--
+
+`euler451()` should return 153651073760956.
+
+```js
+assert.strictEqual(euler451(), 153651073760956);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler451() {
+
+  return true;
+}
+
+euler451();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-452-long-products.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-452-long-products.md
new file mode 100644
index 0000000000..b52ca22d50
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-452-long-products.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5311000cf542c510043
+title: 'Problem 452: Long Products'
+challengeType: 5
+forumTopicId: 302125
+dashedName: problem-452-long-products
+---
+
+# --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.
+
+# --hints--
+
+`euler452()` should return 345558983.
+
+```js
+assert.strictEqual(euler452(), 345558983);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler452() {
+
+  return true;
+}
+
+euler452();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
new file mode 100644
index 0000000000..69b668a626
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5311000cf542c510044
+title: 'Problem 453: Lattice Quadrilaterals'
+challengeType: 5
+forumTopicId: 302126
+dashedName: problem-453-lattice-quadrilaterals
+---
+
+# --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.
+
+# --hints--
+
+`euler453()` should return 104354107.
+
+```js
+assert.strictEqual(euler453(), 104354107);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler453() {
+
+  return true;
+}
+
+euler453();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
new file mode 100644
index 0000000000..414cfab965
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5331000cf542c510045
+title: 'Problem 454: Diophantine reciprocals III'
+challengeType: 5
+forumTopicId: 302127
+dashedName: problem-454-diophantine-reciprocals-iii
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers. 1/x + 1/y= 1/n
+
+<!-- TODO Use MathJax -->
+
+For a limit L we define F(L) as the number of solutions which satisfy x &lt; y ≤ L.
+
+We can verify that F(15) = 4 and F(1000) = 1069. Find F(1012).
+
+# --hints--
+
+`euler454()` should return 5435004633092.
+
+```js
+assert.strictEqual(euler454(), 5435004633092);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler454() {
+
+  return true;
+}
+
+euler454();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
new file mode 100644
index 0000000000..71202a5f3f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -0,0 +1,42 @@
+---
+id: 5900f5331000cf542c510046
+title: 'Problem 455: Powers With Trailing Digits'
+challengeType: 5
+forumTopicId: 302129
+dashedName: problem-455-powers-with-trailing-digits
+---
+
+# --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.
+
+# --hints--
+
+`euler455()` should return 450186511399999.
+
+```js
+assert.strictEqual(euler455(), 450186511399999);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler455() {
+
+  return true;
+}
+
+euler455();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
new file mode 100644
index 0000000000..fba2743a69
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5351000cf542c510047
+title: 'Problem 456: Triangles containing the origin II'
+challengeType: 5
+forumTopicId: 302130
+dashedName: problem-456-triangles-containing-the-origin-ii
+---
+
+# --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).
+
+# --hints--
+
+`euler456()` should return 333333208685971500.
+
+```js
+assert.strictEqual(euler456(), 333333208685971500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler456() {
+
+  return true;
+}
+
+euler456();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
new file mode 100644
index 0000000000..77c3da532c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5361000cf542c510048
+title: 'Problem 457: A polynomial modulo the square of a prime'
+challengeType: 5
+forumTopicId: 302131
+dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
+---
+
+# --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).
+
+# --hints--
+
+`euler457()` should return 2647787126797397000.
+
+```js
+assert.strictEqual(euler457(), 2647787126797397000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler457() {
+
+  return true;
+}
+
+euler457();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
new file mode 100644
index 0000000000..de844d0fe5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5361000cf542c510049
+title: 'Problem 458: Permutations of Project'
+challengeType: 5
+forumTopicId: 302132
+dashedName: problem-458-permutations-of-project
+---
+
+# --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.
+
+# --hints--
+
+`euler458()` should return 423341841.
+
+```js
+assert.strictEqual(euler458(), 423341841);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler458() {
+
+  return true;
+}
+
+euler458();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
new file mode 100644
index 0000000000..72134eec52
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f5371000cf542c51004a
+title: 'Problem 459: Flipping game'
+challengeType: 5
+forumTopicId: 302133
+dashedName: problem-459-flipping-game
+---
+
+# --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).
+
+# --hints--
+
+`euler459()` should return 3996390106631.
+
+```js
+assert.strictEqual(euler459(), 3996390106631);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler459() {
+
+  return true;
+}
+
+euler459();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
new file mode 100644
index 0000000000..9cd82e5bdf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
@@ -0,0 +1,99 @@
+---
+id: 5900f39a1000cf542c50fead
+title: 'Problem 46: Goldbach''s other conjecture'
+challengeType: 5
+forumTopicId: 302134
+dashedName: problem-46-goldbachs-other-conjecture
+---
+
+# --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.
+
+<div style='margin-left: 2em;'>
+  9 = 7 + 2×1<sup>2</sup><br>
+  15 = 7 + 2×2<sup>2</sup><br>
+  21 = 3 + 2×3<sup>2</sup><br>
+  25 = 7 + 2×3<sup>2</sup><br>
+  27 = 19 + 2×2<sup>2</sup><br>
+  33 = 31 + 2×1<sup>2</sup>
+</div>
+
+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?
+
+# --hints--
+
+`goldbachsOtherConjecture()` should return a number.
+
+```js
+assert(typeof goldbachsOtherConjecture() === 'number');
+```
+
+`goldbachsOtherConjecture()` should return 5777.
+
+```js
+assert.strictEqual(goldbachsOtherConjecture(), 5777);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function goldbachsOtherConjecture() {
+
+  return true;
+}
+
+goldbachsOtherConjecture();
+```
+
+# --solutions--
+
+```js
+function goldbachsOtherConjecture() {  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function isSquare(num) {
+    return Math.sqrt(num) % 1 === 0;
+  }
+
+  // construct a list of prime numbers
+  const primes = [];
+  for (let i = 2; primes.length < 1000; i++) {
+    if (isPrime(i)) primes.push(i);
+  }
+
+  let num = 3;
+  let answer;
+  while (!answer) {
+    num += 2;
+    if (!isPrime(num)) {
+      let found = false;
+      for (let primeI = 0; primeI < primes.length && !found; primeI++) {
+        const square = (num - primes[primeI]) / 2;
+        if (isSquare(square)) {
+          found = true;
+          break;
+        }
+      }
+      if (!found) answer = num;
+    }
+  }
+  return answer;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
new file mode 100644
index 0000000000..467a9693c3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5381000cf542c51004b
+title: 'Problem 460: An ant on the move'
+challengeType: 5
+forumTopicId: 302135
+dashedName: problem-460-an-ant-on-the-move
+---
+
+# --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.
+
+# --hints--
+
+`euler460()` should return 18.420738199.
+
+```js
+assert.strictEqual(euler460(), 18.420738199);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler460() {
+
+  return true;
+}
+
+euler460();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-461-almost-pi.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
new file mode 100644
index 0000000000..10a83e63f8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
@@ -0,0 +1,153 @@
+---
+id: 5900f53a1000cf542c51004c
+title: 'Problem 461: Almost Pi'
+challengeType: 5
+forumTopicId: 302136
+dashedName: problem-461-almost-pi
+---
+
+# --description--
+
+Let `f(k, n)` = $e^\frac{k}{n} - 1$, for all non-negative integers `k`.
+
+Remarkably, `f(6, 200) + f(75, 200) + f(89, 200) + f(226, 200)` = 3.1415926… ≈ π.
+
+In fact, it is the best approximation of π of the form `f(a, 200) + f(b, 200) + f(c, 200) + f(d, 200)`.
+
+Let `almostPi(n)` = a<sup>2</sup> + b<sup>2</sup> + c<sup>2</sup> + d<sup>2</sup> for a, b, c, d that minimize the error: $\lvert f(a,n) + f(b,n) + f(c,n) + f(d,n) - \Pi\rvert$
+
+You are given `almostPi(200)` = 6<sup>2</sup> + 75<sup>2</sup> + 89<sup>2</sup> + 226<sup>2</sup> = 64658.
+
+# --hints--
+
+`almostPi` should be a function.
+
+```js
+assert(typeof almostPi === 'function')
+```
+
+`almostPi` should return a number.
+
+```js
+assert.strictEqual(typeof almostPi(10), 'number');
+```
+
+`almostPi(29)` should return `1208`.
+
+```js
+assert.strictEqual(almostPi(29), 1208);
+```
+
+`almostPi(50)` should return `4152`.
+
+```js
+assert.strictEqual(almostPi(50), 4152);
+```
+
+`almostPi(200)` should return `64658`.
+
+```js
+assert.strictEqual(almostPi(200), 64658);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function almostPi(n) {
+  
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function almostPi(n) {
+
+  // Find all possible values where f(k, n) <= PI
+  const f = [];
+  let max = 0;
+  while (1) {
+    let current = Math.exp(max / n) - 1;
+
+    if (current > Math.PI) break;
+
+    f.push(current);
+    ++max;
+  }
+
+  // Get all pairs where f[i] + f[j] <= PI
+  const pairs = [];
+  for (let i = 0; i < max; ++i) {
+    for (let j = 0; j < max; ++j) {
+      if (f[i] + f[j] > Math.PI) break;
+      pairs.push(f[i] + f[j]);
+    }
+  }
+
+  // Sort all values
+  pairs.sort((a, b) => a - b);
+
+  // Optimal Value for (a + b)
+  let left = 0;
+  // Optimal Value for (c + d)
+  let right = 0;
+  // minimum error with Math.abs(a + b - Math.PI)
+  let minError = Math.PI;
+
+  // Binary Search for the best match
+  for (let i = 0; i < pairs.length; ++i) {
+    let current = pairs[i];
+    let need = Math.PI - current;
+
+    if (need < current) break;
+
+    let match;
+    for (let i = 1; i < pairs.length; ++i) {
+      if (pairs[i] > need) {
+        match = i;
+        break;
+      }
+    }
+
+    let error = Math.abs(need - pairs[match]);
+    if (error < minError)
+    {
+      minError = error;
+      left = i;
+      right = match;
+    }
+
+    --match;
+    error = Math.abs(need - pairs[match]);
+    if (error < minError) {
+      minError = error;
+      left = i;
+      right = match;
+    }
+  }
+
+  let a, b, c, d;
+
+  OuterLoop1:
+  for (a = 0; a < max; ++a) {
+    for (b = a; b < max; ++b) {
+      if (pairs[left] == f[a] + f[b]) {
+        break OuterLoop1;
+      }
+    }
+  }
+
+  OuterLoop2:
+  for (c = 0; c < max; ++c) {
+    for (d = c; d < max; ++d) {
+      if (pairs[right] == f[c] + f[d]) {
+        break OuterLoop2;
+      }
+    }
+  }
+  return a*a + b*b + c*c + d*d;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
new file mode 100644
index 0000000000..6eb9550e45
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
@@ -0,0 +1,52 @@
+---
+id: 5900f53b1000cf542c51004d
+title: 'Problem 462: Permutation of 3-smooth numbers'
+challengeType: 5
+forumTopicId: 302137
+dashedName: problem-462-permutation-of-3-smooth-numbers
+---
+
+# --description--
+
+<!-- TODO use MathJax -->
+
+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.
+
+# --hints--
+
+`euler462()` should return Infinity.
+
+```js
+assert.strictEqual(euler462(), Infinity);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler462() {
+
+  return true;
+}
+
+euler462();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
new file mode 100644
index 0000000000..014935108f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -0,0 +1,50 @@
+---
+id: 5900f53c1000cf542c51004e
+title: 'Problem 463: A weird recurrence relation'
+challengeType: 5
+forumTopicId: 302138
+dashedName: problem-463-a-weird-recurrence-relation
+---
+
+# --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.
+
+# --hints--
+
+`euler463()` should return 808981553.
+
+```js
+assert.strictEqual(euler463(), 808981553);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler463() {
+
+  return true;
+}
+
+euler463();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
new file mode 100644
index 0000000000..5b209dd1d7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
@@ -0,0 +1,50 @@
+---
+id: 5900f53d1000cf542c51004f
+title: 'Problem 464: Möbius function and intervals'
+challengeType: 5
+forumTopicId: 302139
+dashedName: problem-464-mbius-function-and-intervals
+---
+
+# --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).
+
+# --hints--
+
+`euler464()` should return 198775297232878.
+
+```js
+assert.strictEqual(euler464(), 198775297232878);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler464() {
+
+  return true;
+}
+
+euler464();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
new file mode 100644
index 0000000000..2baaf0d775
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -0,0 +1,52 @@
+---
+id: 5900f53d1000cf542c510050
+title: 'Problem 465: Polar polygons'
+challengeType: 5
+forumTopicId: 302140
+dashedName: problem-465-polar-polygons
+---
+
+# --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.
+
+# --hints--
+
+`euler465()` should return 585965659.
+
+```js
+assert.strictEqual(euler465(), 585965659);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler465() {
+
+  return true;
+}
+
+euler465();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
new file mode 100644
index 0000000000..3050ea410b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -0,0 +1,48 @@
+---
+id: 5900f53e1000cf542c510051
+title: 'Problem 466: Distinct terms in a multiplication table'
+challengeType: 5
+forumTopicId: 302141
+dashedName: problem-466-distinct-terms-in-a-multiplication-table
+---
+
+# --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).
+
+# --hints--
+
+`euler466()` should return 258381958195474750.
+
+```js
+assert.strictEqual(euler466(), 258381958195474750);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler466() {
+
+  return true;
+}
+
+euler466();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-467-superinteger.md
new file mode 100644
index 0000000000..8cfd9dc16a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5411000cf542c510052
+title: 'Problem 467: Superinteger'
+challengeType: 5
+forumTopicId: 302142
+dashedName: problem-467-superinteger
+---
+
+# --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.
+
+# --hints--
+
+`euler467()` should return 775181359.
+
+```js
+assert.strictEqual(euler467(), 775181359);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler467() {
+
+  return true;
+}
+
+euler467();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
new file mode 100644
index 0000000000..239d2cf56d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5411000cf542c510054
+title: 'Problem 468: Smooth divisors of binomial coefficients'
+challengeType: 5
+forumTopicId: 302143
+dashedName: problem-468-smooth-divisors-of-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler468()` should return 852950321.
+
+```js
+assert.strictEqual(euler468(), 852950321);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler468() {
+
+  return true;
+}
+
+euler468();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
new file mode 100644
index 0000000000..4e8be025a2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5411000cf542c510053
+title: 'Problem 469: Empty chairs'
+challengeType: 5
+forumTopicId: 302144
+dashedName: problem-469-empty-chairs
+---
+
+# --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.
+
+# --hints--
+
+`euler469()` should return 0.56766764161831.
+
+```js
+assert.strictEqual(euler469(), 0.56766764161831);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler469() {
+
+  return true;
+}
+
+euler469();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
new file mode 100644
index 0000000000..998b035f79
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -0,0 +1,113 @@
+---
+id: 5900f39c1000cf542c50feae
+title: 'Problem 47: Distinct primes factors'
+challengeType: 5
+forumTopicId: 302145
+dashedName: problem-47-distinct-primes-factors
+---
+
+# --description--
+
+The first two consecutive numbers to have two distinct prime factors are:
+
+<div style='padding-left: 4em;'>
+  14 = 2 × 7<br>
+  15 = 3 × 5
+</div>
+
+The first three consecutive numbers to have three distinct prime factors are:
+
+<div style='padding-left: 4em;'>
+  644 = 2<sup>2</sup> × 7 × 23<br>
+  645 = 3 × 5 × 43<br>
+  646 = 2 × 17 × 19
+</div>
+
+Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?
+
+# --hints--
+
+`distinctPrimeFactors(2, 2)` should return a number.
+
+```js
+assert(typeof distinctPrimeFactors(2, 2) === 'number');
+```
+
+`distinctPrimeFactors(2, 2)` should return 14.
+
+```js
+assert.strictEqual(distinctPrimeFactors(2, 2), 14);
+```
+
+`distinctPrimeFactors(3, 3)` should return 644.
+
+```js
+assert.strictEqual(distinctPrimeFactors(3, 3), 644);
+```
+
+`distinctPrimeFactors(4, 4)` should return 134043.
+
+```js
+assert.strictEqual(distinctPrimeFactors(4, 4), 134043);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
+
+  return true;
+}
+
+distinctPrimeFactors(4, 4);
+```
+
+# --solutions--
+
+```js
+function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
+  function numberOfPrimeFactors(n) {
+    let factors = 0;
+
+    //  Considering 2 as a special case
+    let firstFactor = true;
+    while (n % 2 == 0) {
+      n = n / 2;
+      if (firstFactor) {
+        factors++;
+        firstFactor = false;
+      }
+    }
+    // Adding other factors
+    for (let i = 3; i < Math.sqrt(n); i += 2) {
+      firstFactor = true;
+      while (n % i == 0) {
+        n = n / i;
+        if (firstFactor) {
+          factors++;
+          firstFactor = false;
+        }
+      }
+    }
+
+    if (n > 1) { factors++; }
+
+    return factors;
+  }
+
+  let number = 0;
+  let consecutive = 0;
+
+  while (consecutive < targetConsecutive) {
+    number++;
+    if (numberOfPrimeFactors(number) >= targetNumPrimes) {
+      consecutive++;
+    } else {
+      consecutive = 0;
+    }
+  }
+  return number - targetConsecutive + 1;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
new file mode 100644
index 0000000000..10ee6d95d8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5431000cf542c510055
+title: 'Problem 470: Super Ramvok'
+challengeType: 5
+forumTopicId: 302146
+dashedName: problem-470-super-ramvok
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler470()` should return 147668794.
+
+```js
+assert.strictEqual(euler470(), 147668794);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler470() {
+
+  return true;
+}
+
+euler470();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
new file mode 100644
index 0000000000..95385ddec9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5431000cf542c510056
+title: 'Problem 471: Triangle inscribed in ellipse'
+challengeType: 5
+forumTopicId: 302148
+dashedName: problem-471-triangle-inscribed-in-ellipse
+---
+
+# --description--
+
+The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 &lt; 2b &lt; 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.
+
+# --hints--
+
+`euler471()` should return 1.895093981e+31.
+
+```js
+assert.strictEqual(euler471(), 1.895093981e31);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler471() {
+
+  return true;
+}
+
+euler471();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
new file mode 100644
index 0000000000..f4e9015549
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -0,0 +1,56 @@
+---
+id: 5900f5451000cf542c510057
+title: 'Problem 472: Comfortable Distance II'
+challengeType: 5
+forumTopicId: 302149
+dashedName: problem-472-comfortable-distance-ii
+---
+
+# --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.
+
+# --hints--
+
+`euler472()` should return 73811586.
+
+```js
+assert.strictEqual(euler472(), 73811586);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler472() {
+
+  return true;
+}
+
+euler472();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
new file mode 100644
index 0000000000..505c8a757b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5461000cf542c510058
+title: 'Problem 473: Phigital number base'
+challengeType: 5
+forumTopicId: 302150
+dashedName: problem-473-phigital-number-base
+---
+
+# --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.
+
+# --hints--
+
+`euler473()` should return 35856681704365.
+
+```js
+assert.strictEqual(euler473(), 35856681704365);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler473() {
+
+  return true;
+}
+
+euler473();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
new file mode 100644
index 0000000000..5c77726bd2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5471000cf542c510059
+title: 'Problem 474: Last digits of divisors'
+challengeType: 5
+forumTopicId: 302151
+dashedName: problem-474-last-digits-of-divisors
+---
+
+# --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).
+
+# --hints--
+
+`euler474()` should return 9690646731515010.
+
+```js
+assert.strictEqual(euler474(), 9690646731515010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler474() {
+
+  return true;
+}
+
+euler474();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-475-music-festival.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-475-music-festival.md
new file mode 100644
index 0000000000..dd8cf3538b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-475-music-festival.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5481000cf542c51005a
+title: 'Problem 475: Music festival'
+challengeType: 5
+forumTopicId: 302152
+dashedName: problem-475-music-festival
+---
+
+# --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.
+
+# --hints--
+
+`euler475()` should return 75780067.
+
+```js
+assert.strictEqual(euler475(), 75780067);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler475() {
+
+  return true;
+}
+
+euler475();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
new file mode 100644
index 0000000000..a5a8bf868b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5481000cf542c51005b
+title: 'Problem 476: Circle Packing II'
+challengeType: 5
+forumTopicId: 302153
+dashedName: problem-476-circle-packing-ii
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler476()` should return 110242.87794.
+
+```js
+assert.strictEqual(euler476(), 110242.87794);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler476() {
+
+  return true;
+}
+
+euler476();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
new file mode 100644
index 0000000000..f4c95faba7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
@@ -0,0 +1,66 @@
+---
+id: 5900f54a1000cf542c51005c
+title: 'Problem 477: Number Sequence Game'
+challengeType: 5
+forumTopicId: 302154
+dashedName: problem-477-number-sequence-game
+---
+
+# --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).
+
+# --hints--
+
+`euler477()` should return 25044905874565164.
+
+```js
+assert.strictEqual(euler477(), 25044905874565164);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler477() {
+
+  return true;
+}
+
+euler477();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-478-mixtures.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-478-mixtures.md
new file mode 100644
index 0000000000..37e7681ecf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-478-mixtures.md
@@ -0,0 +1,50 @@
+---
+id: 5900f54c1000cf542c51005e
+title: 'Problem 478: Mixtures'
+challengeType: 5
+forumTopicId: 302155
+dashedName: problem-478-mixtures
+---
+
+# --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.
+
+# --hints--
+
+`euler478()` should return 59510340.
+
+```js
+assert.strictEqual(euler478(), 59510340);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler478() {
+
+  return true;
+}
+
+euler478();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
new file mode 100644
index 0000000000..202e7e04be
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
@@ -0,0 +1,46 @@
+---
+id: 5900f54b1000cf542c51005d
+title: 'Problem 479: Roots on the Rise'
+challengeType: 5
+forumTopicId: 302156
+dashedName: problem-479-roots-on-the-rise
+---
+
+# --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.
+
+# --hints--
+
+`euler479()` should return 191541795.
+
+```js
+assert.strictEqual(euler479(), 191541795);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler479() {
+
+  return true;
+}
+
+euler479();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-48-self-powers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-48-self-powers.md
new file mode 100644
index 0000000000..58e654f893
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-48-self-powers.md
@@ -0,0 +1,80 @@
+---
+id: 5900f39c1000cf542c50feaf
+title: 'Problem 48: Self powers'
+challengeType: 5
+forumTopicId: 302157
+dashedName: problem-48-self-powers
+---
+
+# --description--
+
+The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
+
+Find the last ten digits of the series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.
+
+# --hints--
+
+`selfPowers(10, 3)` should return a number.
+
+```js
+assert(typeof selfPowers(10, 3) === 'number');
+```
+
+`selfPowers(10, 3)` should return 317.
+
+```js
+assert.strictEqual(selfPowers(10, 3), 317);
+```
+
+`selfPowers(150, 6)` should return 29045.
+
+```js
+assert.strictEqual(selfPowers(150, 6), 29045);
+```
+
+`selfPowers(673, 7)` should return 2473989.
+
+```js
+assert.strictEqual(selfPowers(673, 7), 2473989);
+```
+
+`selfPowers(1000, 10)` should return 9110846700.
+
+```js
+assert.strictEqual(selfPowers(1000, 10), 9110846700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function selfPowers(power, lastDigits) {
+
+  return true;
+}
+
+selfPowers(1000, 10);
+```
+
+# --solutions--
+
+```js
+function selfPowers(power, lastDigits) {
+  let sum = 0;
+  const modulo = Math.pow(10, lastDigits);
+
+  for (let i = 1; i <= power; i++) {
+    let temp = i;
+    for (let j = 1; j < i; j++) {
+      temp *= i;
+      temp %= modulo;
+    }
+
+    sum += temp;
+    sum %= modulo;
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
new file mode 100644
index 0000000000..9e2ac8d96d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -0,0 +1,114 @@
+---
+id: 5900f54c1000cf542c51005f
+title: 'Problem 480: The Last Question'
+challengeType: 5
+forumTopicId: 302158
+dashedName: problem-480-the-last-question
+---
+
+# --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).
+
+# --hints--
+
+`euler480()` should return turnthestarson.
+
+```js
+assert.strictEqual(euler480(), turnthestarson);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler480() {
+
+  return true;
+}
+
+euler480();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
new file mode 100644
index 0000000000..0dc7ae0ddc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
@@ -0,0 +1,93 @@
+---
+id: 5900f39d1000cf542c50feb0
+title: 'Problem 49: Prime permutations'
+challengeType: 5
+forumTopicId: 302159
+dashedName: problem-49-prime-permutations
+---
+
+# --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?
+
+# --hints--
+
+`primePermutations()` should return a number.
+
+```js
+assert(typeof primePermutations() === 'number');
+```
+
+`primePermutations()` should return 296962999629.
+
+```js
+assert.strictEqual(primePermutations(), 296962999629);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePermutations() {
+
+  return true;
+}
+
+primePermutations();
+```
+
+# --solutions--
+
+```js
+function primePermutations() {
+  function arePermutations(num1, num2) {
+    const numStr1 = num1.toString();
+    let numStr2 = num2.toString();
+    if (numStr1.length !== numStr2.length) {
+      return false;
+    }
+
+    for (let i = 0; i < numStr1.length; i++) {
+      const index = numStr2.indexOf(numStr1[i]);
+      if (index === -1) {
+        return false;
+      }
+      numStr2 = numStr2.slice(0, index) + numStr2.slice(index + 1);
+    }
+    return true;
+  }
+
+  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  for (let num1 = 1000; num1 <= 9999; num1++) {
+    const num2 = num1 + 3330;
+    const num3 = num2 + 3330;
+    if (isPrime(num1) && isPrime(num2) && isPrime(num3)) {
+      if (arePermutations(num1, num2) && arePermutations(num1, num3)
+        && num1 !== 1487) {
+        // concatenate and return numbers
+        return (num1 * 100000000) + (num2 * 10000) + num3;
+      }
+    }
+  }
+  return 0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
new file mode 100644
index 0000000000..bdece251d7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3711000cf542c50fe84
+title: 'Problem 5: Smallest multiple'
+challengeType: 5
+forumTopicId: 302160
+dashedName: problem-5-smallest-multiple
+---
+
+# --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 `n`?
+
+# --hints--
+
+`smallestMult(5)` should return a number.
+
+```js
+assert(typeof smallestMult(5) === 'number');
+```
+
+`smallestMult(5)` should return 60.
+
+```js
+assert.strictEqual(smallestMult(5), 60);
+```
+
+`smallestMult(7)` should return 420.
+
+```js
+assert.strictEqual(smallestMult(7), 420);
+```
+
+`smallestMult(10)` should return 2520.
+
+```js
+assert.strictEqual(smallestMult(10), 2520);
+```
+
+`smallestMult(13)` should return 360360.
+
+```js
+assert.strictEqual(smallestMult(13), 360360);
+```
+
+`smallestMult(20)` should return 232792560.
+
+```js
+assert.strictEqual(smallestMult(20), 232792560);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function smallestMult(n) {
+
+  return true;
+}
+
+smallestMult(20);
+```
+
+# --solutions--
+
+```js
+function smallestMult(n){
+  function gcd(a, b) {
+    return b === 0 ? a : gcd(b, a%b); // Euclidean algorithm
+  }
+
+  function lcm(a, b) {
+    return a * b / gcd(a, b);
+  }
+  var result = 1;
+  for(var i = 2; i <= n; i++) {
+    result = lcm(result, i);
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
new file mode 100644
index 0000000000..92924bf85e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
@@ -0,0 +1,95 @@
+---
+id: 5900f39e1000cf542c50feb1
+title: 'Problem 50: Consecutive prime sum'
+challengeType: 5
+forumTopicId: 302161
+dashedName: problem-50-consecutive-prime-sum
+---
+
+# --description--
+
+The prime 41, can be written as the sum of six consecutive primes:
+
+<div style='text-align: center;'>41 = 2 + 3 + 5 + 7 + 11 + 13</div>
+
+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?
+
+# --hints--
+
+`consecutivePrimeSum(1000)` should return a number.
+
+```js
+assert(typeof consecutivePrimeSum(1000) === 'number');
+```
+
+`consecutivePrimeSum(1000)` should return 953.
+
+```js
+assert.strictEqual(consecutivePrimeSum(1000), 953);
+```
+
+`consecutivePrimeSum(1000000)` should return 997651.
+
+```js
+assert.strictEqual(consecutivePrimeSum(1000000), 997651);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function consecutivePrimeSum(limit) {
+
+  return true;
+}
+
+consecutivePrimeSum(1000000);
+```
+
+# --solutions--
+
+```js
+function consecutivePrimeSum(limit) {
+  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+  function getPrimes(limit) {
+    const primes = [];
+    for (let i = 0; i <= limit; i++) {
+      if (isPrime(i)) primes.push(i);
+    }
+    return primes;
+  }
+
+  const primes = getPrimes(limit);
+  let primeSum = [...primes];
+  primeSum.reduce((acc, n, i) => {
+    primeSum[i] += acc;
+    return acc += n;
+  }, 0);
+
+  for (let j = primeSum.length - 1; j >= 0; j--) {
+    for (let i = 0; i < j; i++) {
+      const sum = primeSum[j] - primeSum[i];
+      if (sum > limit) break;
+      if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
new file mode 100644
index 0000000000..7190e580ae
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
@@ -0,0 +1,48 @@
+---
+id: 5900f39f1000cf542c50feb2
+title: 'Problem 51: Prime digit replacements'
+challengeType: 5
+forumTopicId: 302162
+dashedName: problem-51-prime-digit-replacements
+---
+
+# --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.
+
+# --hints--
+
+`primeDigitReplacements()` should return a number.
+
+```js
+assert(typeof primeDigitReplacements() === 'number');
+```
+
+`primeDigitReplacements()` should return 121313.
+
+```js
+assert.strictEqual(primeDigitReplacements(), 121313);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeDigitReplacements() {
+
+  return true;
+}
+
+primeDigitReplacements();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
new file mode 100644
index 0000000000..d5431d8135
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
@@ -0,0 +1,81 @@
+---
+id: 5900f3a01000cf542c50feb3
+title: 'Problem 52: Permuted multiples'
+challengeType: 5
+forumTopicId: 302163
+dashedName: problem-52-permuted-multiples
+---
+
+# --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, such that multiplied by integers $\\{2, 3, \ldots, n\\}$, contain the same digits.
+
+# --hints--
+
+`permutedMultiples(2)` should return a number.
+
+```js
+assert(typeof permutedMultiples(2) === 'number');
+```
+
+`permutedMultiples(2)` should return `125874`.
+
+```js
+assert.strictEqual(permutedMultiples(2), 125874);
+```
+
+`permutedMultiples(6)` should return `142857`.
+
+```js
+assert.strictEqual(permutedMultiples(6), 142857);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permutedMultiples(n) {
+
+  return true;
+}
+
+permutedMultiples(2);
+```
+
+# --solutions--
+
+```js
+function permutedMultiples(n) {
+    const isPermutation = (a, b) =>
+        a.length !== b.length
+            ? false
+            : a.split('').sort().join() === b.split('').sort().join();
+
+
+    let start = 1;
+    let found = false;
+    let result = 0;
+
+    while (!found) {
+        start *= 10;
+        for (let i = start; i < start * 10 / n; i++) {
+            found = true;
+            for (let j = 2; j <= n; j++) {
+                if (!isPermutation(i + '', j * i + '')) {
+                    found = false;
+                    break;
+                }
+            }
+            if (found) {
+                result = i;
+                break;
+            }
+        }
+    }
+
+    return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
new file mode 100644
index 0000000000..dbd39ef975
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
@@ -0,0 +1,89 @@
+---
+id: 5900f3a11000cf542c50feb4
+title: 'Problem 53: Combinatoric selections'
+challengeType: 5
+forumTopicId: 302164
+dashedName: problem-53-combinatoric-selections
+---
+
+# --description--
+
+There are exactly ten ways of selecting three from five, 12345:
+
+<div style='text-align: center;'>123, 124, 125, 134, 135, 145, 234, 235, 245, and 345</div>
+
+In combinatorics, we use the notation, $\\displaystyle \\binom 5 3 = 10$
+
+In general, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, where $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, and $0! = 1$.
+
+It is not until $n = 23$, that a value exceeds one-million: $\\displaystyle \\binom {23} {10} = 1144066$.
+
+How many, not necessarily distinct, values of $\\displaystyle \\binom n r$ for $1 \\le n \\le 100$, are greater than one-million?
+
+# --hints--
+
+`combinatoricSelections(1000)` should return a number.
+
+```js
+assert(typeof combinatoricSelections(1000) === 'number');
+```
+
+`combinatoricSelections(1000)` should return 4626.
+
+```js
+assert.strictEqual(combinatoricSelections(1000), 4626);
+```
+
+`combinatoricSelections(10000)` should return 4431.
+
+```js
+assert.strictEqual(combinatoricSelections(10000), 4431);
+```
+
+`combinatoricSelections(100000)` should return 4255.
+
+```js
+assert.strictEqual(combinatoricSelections(100000), 4255);
+```
+
+`combinatoricSelections(1000000)` should return 4075.
+
+```js
+assert.strictEqual(combinatoricSelections(1000000), 4075);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function combinatoricSelections(limit) {
+
+  return 1;
+}
+
+combinatoricSelections(1000000);
+```
+
+# --solutions--
+
+```js
+function combinatoricSelections(limit) {
+    const factorial = n =>
+        Array.apply(null, { length: n })
+            .map((_, i) => i + 1)
+            .reduce((p, c) => p * c, 1);
+
+    let result = 0;
+    const nMax = 100;
+
+    for (let n = 1; n <= nMax; n++) {
+        for (let r = 0; r <= n; r++) {
+            if (factorial(n) / (factorial(r) * factorial(n - r)) >= limit)
+                result++;
+        }
+    }
+
+    return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
new file mode 100644
index 0000000000..16e04a9885
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -0,0 +1,1096 @@
+---
+id: 5900f3a21000cf542c50feb5
+title: 'Problem 54: Poker hands'
+challengeType: 5
+forumTopicId: 302165
+dashedName: problem-54-poker-hands
+---
+
+# --description--
+
+In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:
+
+<ul>
+  <li>High Card: Highest value card.</li>
+  <li>One Pair: Two cards of the same value.</li>
+  <li>Two Pairs: Two different pairs.</li>
+  <li>Three of a Kind: Three cards of the same value.</li>
+  <li>Straight: All cards are consecutive values.</li>
+  <li>Flush: All cards of the same suit.</li>
+  <li>Full House: Three of a kind and a pair.</li>
+  <li>Four of a Kind: Four cards of the same value.</li>
+  <li>Straight Flush: All cards are consecutive values of same suit.</li>
+  <li>Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.</li>
+</ul>
+
+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   |
+| ------------------ | --------------------------------------------------------- | ---------------------------------------------------------- | -------- |
+| <strong>1</strong> | 5H 5C 6S 7S KD <br> Pair of Fives                         | 2C 3S 8S 8D TD <br> Pair of Eights                         | Player 2 |
+| <strong>2</strong> | 5D 8C 9S JS AC <br> Highest card Ace                      | 2C 5C 7D 8S QH <br> Highest card Queen                     | Player 1 |
+| <strong>3</strong> | 2D 9C AS AH AC <br> Three Aces                            | 3D 6D 7D TD QD <br> Flush with Diamonds                    | Player 2 |
+| <strong>4</strong> | 4D 6S 9H QH QC <br> Pair of Queens <br> Highest card Nine | 3D 6D 7H QD QS <br> Pair of Queens <br> Highest card Seven | Player 1 |
+| <strong>5</strong> | 2H 2D 4C 4D 4S <br> Full House <br> with Three Fours      | 3C 3D 3S 9S 9D <br> Full House <br> with Three Threes      | Player 1 |
+
+The global array (`handsArr`) passed to the function, 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?
+
+# --hints--
+
+`pokerHands(testArr)` should return a number.
+
+```js
+assert(typeof pokerHands(testArr) === 'number');
+```
+
+`pokerHands(testArr)` should return 2.
+
+```js
+assert.strictEqual(pokerHands(testArr), 2);
+```
+
+`pokerHands(handsArr)` should return 376.
+
+```js
+assert.strictEqual(pokerHands(handsArr), 376);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const handsArr = [
+  '8C TS KC 9H 4S 7D 2S 5D 3S AC',
+  '5C AD 5D AC 9C 7C 5H 8D TD KS',
+  '3H 7H 6S KC JS QH TD JC 2D 8S',
+  'TH 8H 5C QS TC 9H 4D JC KS JS',
+  '7C 5H KC QH JD AS KH 4C AD 4S',
+  '5H KS 9C 7D 9H 8D 3S 5D 5C AH',
+  '6H 4H 5C 3H 2H 3S QH 5S 6S AS',
+  'TD 8C 4H 7C TC KC 4C 3H 7S KS',
+  '7C 9C 6D KD 3H 4C QS QC AC KH',
+  'JC 6S 5H 2H 2D KD 9D 7C AS JS',
+  'AD QH TH 9D 8H TS 6D 3S AS AC',
+  '2H 4S 5C 5S TC KC JD 6C TS 3C',
+  'QD AS 6H JS 2C 3D 9H KC 4H 8S',
+  'KD 8S 9S 7C 2S 3S 6D 6S 4H KC',
+  '3C 8C 2D 7D 4D 9S 4S QH 4H JD',
+  '8C KC 7S TC 2D TS 8H QD AC 5C',
+  '3D KH QD 6C 6S AD AS 8H 2H QS',
+  '6S 8D 4C 8S 6C QH TC 6D 7D 9D',
+  '2S 8D 8C 4C TS 9S 9D 9C AC 3D',
+  '3C QS 2S 4H JH 3D 2D TD 8S 9H',
+  '5H QS 8S 6D 3C 8C JD AS 7H 7D',
+  '6H TD 9D AS JH 6C QC 9S KD JC',
+  'AH 8S QS 4D TH AC TS 3C 3D 5C',
+  '5S 4D JS 3D 8H 6C TS 3S AD 8C',
+  '6D 7C 5D 5H 3S 5C JC 2H 5S 3D',
+  '5H 6H 2S KS 3D 5D JD 7H JS 8H',
+  'KH 4H AS JS QS QC TC 6D 7C KS',
+  '3D QS TS 2H JS 4D AS 9S JC KD',
+  'QD 5H 4D 5D KH 7H 3D JS KD 4H',
+  '2C 9H 6H 5C 9D 6C JC 2D TH 9S',
+  '7D 6D AS QD JH 4D JS 7C QS 5C',
+  '3H KH QD AD 8C 8H 3S TH 9D 5S',
+  'AH 9S 4D 9D 8S 4H JS 3C TC 8D',
+  '2C KS 5H QD 3S TS 9H AH AD 8S',
+  '5C 7H 5D KD 9H 4D 3D 2D KS AD',
+  'KS KC 9S 6D 2C QH 9D 9H TS TC',
+  '9C 6H 5D QH 4D AD 6D QC JS KH',
+  '9S 3H 9D JD 5C 4D 9H AS TC QH',
+  '2C 6D JC 9C 3C AD 9S KH 9D 7D',
+  'KC 9C 7C JC JS KD 3H AS 3C 7D',
+  'QD KH QS 2C 3S 8S 8H 9H 9C JC',
+  'QH 8D 3C KC 4C 4H 6D AD 9H 9D',
+  '3S KS QS 7H KH 7D 5H 5D JD AD',
+  '2H 2C 6H TH TC 7D 8D 4H 8C AS',
+  '4S 2H AC QC 3S 6D TH 4D 4C KH',
+  '4D TC KS AS 7C 3C 6D 2D 9H 6C',
+  '8C TD 5D QS 2C 7H 4C 9C 3H 9H',
+  '5H JH TS 7S TD 6H AD QD 8H 8S',
+  '5S AD 9C 8C 7C 8D 5H 9D 8S 2S',
+  '4H KH KS 9S 2S KC 5S AD 4S 7D',
+  'QS 9C QD 6H JS 5D AC 8D 2S AS',
+  'KH AC JC 3S 9D 9S 3C 9C 5S JS',
+  'AD 3C 3D KS 3S 5C 9C 8C TS 4S',
+  'JH 8D 5D 6H KD QS QD 3D 6C KC',
+  '8S JD 6C 3S 8C TC QC 3C QH JS',
+  'KC JC 8H 2S 9H 9C JH 8S 8C 9S',
+  '8S 2H QH 4D QC 9D KC AS TH 3C',
+  '8S 6H TH 7C 2H 6S 3C 3H AS 7S',
+  'QH 5S JS 4H 5H TS 8H AH AC JC',
+  '9D 8H 2S 4S TC JC 3C 7H 3H 5C',
+  '3D AD 3C 3S 4C QC AS 5D TH 8C',
+  '6S 9D 4C JS KH AH TS JD 8H AD',
+  '4C 6S 9D 7S AC 4D 3D 3S TC JD',
+  'AD 7H 6H 4H JH KC TD TS 7D 6S',
+  '8H JH TC 3S 8D 8C 9S 2C 5C 4D',
+  '2C 9D KC QH TH QS JC 9C 4H TS',
+  'QS 3C QD 8H KH 4H 8D TD 8S AC',
+  '7C 3C TH 5S 8H 8C 9C JD TC KD',
+  'QC TC JD TS 8C 3H 6H KD 7C TD',
+  'JH QS KS 9C 6D 6S AS 9H KH 6H',
+  '2H 4D AH 2D JH 6H TD 5D 4H JD',
+  'KD 8C 9S JH QD JS 2C QS 5C 7C',
+  '4S TC 7H 8D 2S 6H 7S 9C 7C KC',
+  '8C 5D 7H 4S TD QC 8S JS 4H KS',
+  'AD 8S JH 6D TD KD 7C 6C 2D 7D',
+  'JC 6H 6S JS 4H QH 9H AH 4C 3C',
+  '6H 5H AS 7C 7S 3D KH KC 5D 5C',
+  'JC 3D TD AS 4D 6D 6S QH JD KS',
+  '8C 7S 8S QH 2S JD 5C 7H AH QD',
+  '8S 3C 6H 6C 2C 8D TD 7D 4C 4D',
+  '5D QH KH 7C 2S 7H JS 6D QC QD',
+  'AD 6C 6S 7D TH 6H 2H 8H KH 4H',
+  'KS JS KD 5D 2D KH 7D 9C 8C 3D',
+  '9C 6D QD 3C KS 3S 7S AH JD 2D',
+  'AH QH AS JC 8S 8H 4C KC TH 7D',
+  'JC 5H TD 7C 5D KD 4C AD 8H JS',
+  'KC 2H AC AH 7D JH KH 5D 7S 6D',
+  '9S 5S 9C 6H 8S TD JD 9H 6C AC',
+  '7D 8S 6D TS KD 7H AC 5S 7C 5D',
+  'AH QC JC 4C TC 8C 2H TS 2C 7D',
+  'KD KC 6S 3D 7D 2S 8S 3H 5S 5C',
+  '8S 5D 8H 4C 6H KC 3H 7C 5S KD',
+  'JH 8C 3D 3C 6C KC TD 7H 7C 4C',
+  'JC KC 6H TS QS TD KS 8H 8C 9S',
+  '6C 5S 9C QH 7D AH KS KC 9S 2C',
+  '4D 4S 8H TD 9C 3S 7D 9D AS TH',
+  '6S 7D 3C 6H 5D KD 2C 5C 9D 9C',
+  '2H KC 3D AD 3H QD QS 8D JC 4S',
+  '8C 3H 9C 7C AD 5D JC 9D JS AS',
+  '5D 9H 5C 7H 6S 6C QC JC QD 9S',
+  'JC QS JH 2C 6S 9C QC 3D 4S TC',
+  '4H 5S 8D 3D 4D 2S KC 2H JS 2C',
+  'TD 3S TH KD 4D 7H JH JS KS AC',
+  '7S 8C 9S 2D 8S 7D 5C AD 9D AS',
+  '8C 7H 2S 6C TH 3H 4C 3S 8H AC',
+  'KD 5H JC 8H JD 2D 4H TD JH 5C',
+  '3D AS QH KS 7H JD 8S 5S 6D 5H',
+  '9S 6S TC QS JC 5C 5D 9C TH 8C',
+  '5H 3S JH 9H 2S 2C 6S 7S AS KS',
+  '8C QD JC QS TC QC 4H AC KH 6C',
+  'TC 5H 7D JH 4H 2H 8D JC KS 4D',
+  '5S 9C KH KD 9H 5C TS 3D 7D 2D',
+  '5H AS TC 4D 8C 2C TS 9D 3H 8D',
+  '6H 8D 2D 9H JD 6C 4S 5H 5S 6D',
+  'AD 9C JC 7D 6H 9S 6D JS 9H 3C',
+  'AD JH TC QS 4C 5D 9S 7C 9C AH',
+  'KD 6H 2H TH 8S QD KS 9D 9H AS',
+  '4H 8H 8D 5H 6C AH 5S AS AD 8S',
+  'QS 5D 4S 2H TD KS 5H AC 3H JC',
+  '9C 7D QD KD AC 6D 5H QH 6H 5S',
+  'KC AH QH 2H 7D QS 3H KS 7S JD',
+  '6C 8S 3H 6D KS QD 5D 5C 8H TC',
+  '9H 4D 4S 6S 9D KH QC 4H 6C JD',
+  'TD 2D QH 4S 6H JH KD 3C QD 8C',
+  '4S 6H 7C QD 9D AS AH 6S AD 3C',
+  '2C KC TH 6H 8D AH 5C 6D 8S 5D',
+  'TD TS 7C AD JC QD 9H 3C KC 7H',
+  '5D 4D 5S 8H 4H 7D 3H JD KD 2D',
+  'JH TD 6H QS 4S KD 5C 8S 7D 8H',
+  'AC 3D AS 8C TD 7H KH 5D 6C JD',
+  '9D KS 7C 6D QH TC JD KD AS KC',
+  'JH 8S 5S 7S 7D AS 2D 3D AD 2H',
+  '2H 5D AS 3C QD KC 6H 9H 9S 2C',
+  '9D 5D TH 4C JH 3H 8D TC 8H 9H',
+  '6H KD 2C TD 2H 6C 9D 2D JS 8C',
+  'KD 7S 3C 7C AS QH TS AD 8C 2S',
+  'QS 8H 6C JS 4C 9S QC AD TD TS',
+  '2H 7C TS TC 8C 3C 9H 2D 6D JC',
+  'TC 2H 8D JH KS 6D 3H TD TH 8H',
+  '9D TD 9H QC 5D 6C 8H 8C KC TS',
+  '2H 8C 3D AH 4D TH TC 7D 8H KC',
+  'TS 5C 2D 8C 6S KH AH 5H 6H KC',
+  '5S 5D AH TC 4C JD 8D 6H 8C 6C',
+  'KC QD 3D 8H 2D JC 9H 4H AD 2S',
+  'TD 6S 7D JS KD 4H QS 2S 3S 8C',
+  '4C 9H JH TS 3S 4H QC 5S 9S 9C',
+  '2C KD 9H JS 9S 3H JC TS 5D AC',
+  'AS 2H 5D AD 5H JC 7S TD JS 4C',
+  '2D 4S 8H 3D 7D 2C AD KD 9C TS',
+  '7H QD JH 5H JS AC 3D TH 4C 8H',
+  '6D KH KC QD 5C AD 7C 2D 4H AC',
+  '3D 9D TC 8S QD 2C JC 4H JD AH',
+  '6C TD 5S TC 8S AH 2C 5D AS AC',
+  'TH 7S 3D AS 6C 4C 7H 7D 4H AH',
+  '5C 2H KS 6H 7S 4H 5H 3D 3C 7H',
+  '3C 9S AC 7S QH 2H 3D 6S 3S 3H',
+  '2D 3H AS 2C 6H TC JS 6S 9C 6C',
+  'QH KD QD 6D AC 6H KH 2C TS 8C',
+  '8H 7D 3S 9H 5D 3H 4S QC 9S 5H',
+  '2D 9D 7H 6H 3C 8S 5H 4D 3S 4S',
+  'KD 9S 4S TC 7S QC 3S 8S 2H 7H',
+  'TC 3D 8C 3H 6C 2H 6H KS KD 4D',
+  'KC 3D 9S 3H JS 4S 8H 2D 6C 8S',
+  '6H QS 6C TC QD 9H 7D 7C 5H 4D',
+  'TD 9D 8D 6S 6C TC 5D TS JS 8H',
+  '4H KC JD 9H TC 2C 6S 5H 8H AS',
+  'JS 9C 5C 6S 9D JD 8H KC 4C 6D',
+  '4D 8D 8S 6C 7C 6H 7H 8H 5C KC',
+  'TC 3D JC 6D KS 9S 6H 7S 9C 2C',
+  '6C 3S KD 5H TS 7D 9H 9S 6H KH',
+  '3D QD 4C 6H TS AC 3S 5C 2H KD',
+  '4C AS JS 9S 7C TS 7H 9H JC KS',
+  '4H 8C JD 3H 6H AD 9S 4S 5S KS',
+  '4C 2C 7D 3D AS 9C 2S QS KC 6C',
+  '8S 5H 3D 2S AC 9D 6S 3S 4D TD',
+  'QD TH 7S TS 3D AC 7H 6C 5D QC',
+  'TC QD AD 9C QS 5C 8D KD 3D 3C',
+  '9D 8H AS 3S 7C 8S JD 2D 8D KC',
+  '4C TH AC QH JS 8D 7D 7S 9C KH',
+  '9D 8D 4C JH 2C 2S QD KD TS 4H',
+  '4D 6D 5D 2D JH 3S 8S 3H TC KH',
+  'AD 4D 2C QS 8C KD JH JD AH 5C',
+  '5C 6C 5H 2H JH 4H KS 7C TC 3H',
+  '3C 4C QC 5D JH 9C QD KH 8D TC',
+  '3H 9C JS 7H QH AS 7C 9H 5H JC',
+  '2D 5S QD 4S 3C KC 6S 6C 5C 4C',
+  '5D KH 2D TS 8S 9C AS 9S 7C 4C',
+  '7C AH 8C 8D 5S KD QH QS JH 2C',
+  '8C 9D AH 2H AC QC 5S 8H 7H 2C',
+  'QD 9H 5S QS QC 9C 5H JC TH 4H',
+  '6C 6S 3H 5H 3S 6H KS 8D AC 7S',
+  'AC QH 7H 8C 4S KC 6C 3D 3S TC',
+  '9D 3D JS TH AC 5H 3H 8S 3S TC',
+  'QD KH JS KS 9S QC 8D AH 3C AC',
+  '5H 6C KH 3S 9S JH 2D QD AS 8C',
+  '6C 4D 7S 7H 5S JC 6S 9H 4H JH',
+  'AH 5S 6H 9S AD 3S TH 2H 9D 8C',
+  '4C 8D 9H 7C QC AD 4S 9C KC 5S',
+  '9D 6H 4D TC 4C JH 2S 5D 3S AS',
+  '2H 6C 7C KH 5C AD QS TH JD 8S',
+  '3S 4S 7S AH AS KC JS 2S AD TH',
+  'JS KC 2S 7D 8C 5C 9C TS 5H 9D',
+  '7S 9S 4D TD JH JS KH 6H 5D 2C',
+  'JD JS JC TH 2D 3D QD 8C AC 5H',
+  '7S KH 5S 9D 5D TD 4S 6H 3C 2D',
+  '4S 5D AC 8D 4D 7C AD AS AH 9C',
+  '6S TH TS KS 2C QC AH AS 3C 4S',
+  '2H 8C 3S JC 5C 7C 3H 3C KH JH',
+  '7S 3H JC 5S 6H 4C 2S 4D KC 7H',
+  '4D 7C 4H 9S 8S 6S AD TC 6C JC',
+  'KH QS 3S TC 4C 8H 8S AC 3C TS',
+  'QD QS TH 3C TS 7H 7D AH TD JC',
+  'TD JD QC 4D 9S 7S TS AD 7D AC',
+  'AH 7H 4S 6D 7C 2H 9D KS JC TD',
+  '7C AH JD 4H 6D QS TS 2H 2C 5C',
+  'TC KC 8C 9S 4C JS 3C JC 6S AH',
+  'AS 7D QC 3D 5S JC JD 9D TD KH',
+  'TH 3C 2S 6H AH AC 5H 5C 7S 8H',
+  'QC 2D AC QD 2S 3S JD QS 6S 8H',
+  'KC 4H 3C 9D JS 6H 3S 8S AS 8C',
+  '7H KC 7D JD 2H JC QH 5S 3H QS',
+  '9H TD 3S 8H 7S AC 5C 6C AH 7C',
+  '8D 9H AH JD TD QS 7D 3S 9C 8S',
+  'AH QH 3C JD KC 4S 5S 5D TD KS',
+  '9H 7H 6S JH TH 4C 7C AD 5C 2D',
+  '7C KD 5S TC 9D 6S 6C 5D 2S TH',
+  'KC 9H 8D 5H 7H 4H QC 3D 7C AS',
+  '6S 8S QC TD 4S 5C TH QS QD 2S',
+  '8S 5H TH QC 9H 6S KC 7D 7C 5C',
+  '7H KD AH 4D KH 5C 4S 2D KC QH',
+  '6S 2C TD JC AS 4D 6C 8C 4H 5S',
+  'JC TC JD 5S 6S 8D AS 9D AD 3S',
+  '6D 6H 5D 5S TC 3D 7D QS 9D QD',
+  '4S 6C 8S 3S 7S AD KS 2D 7D 7C',
+  'KC QH JC AC QD 5D 8D QS 7H 7D',
+  'JS AH 8S 5H 3D TD 3H 4S 6C JH',
+  '4S QS 7D AS 9H JS KS 6D TC 5C',
+  '2D 5C 6H TC 4D QH 3D 9H 8S 6C',
+  '6D 7H TC TH 5S JD 5C 9C KS KD',
+  '8D TD QH 6S 4S 6C 8S KC 5C TC',
+  '5S 3D KS AC 4S 7D QD 4C TH 2S',
+  'TS 8H 9S 6S 7S QH 3C AH 7H 8C',
+  '4C 8C TS JS QC 3D 7D 5D 7S JH',
+  '8S 7S 9D QC AC 7C 6D 2H JH KC',
+  'JS KD 3C 6S 4S 7C AH QC KS 5H',
+  'KS 6S 4H JD QS TC 8H KC 6H AS',
+  'KH 7C TC 6S TD JC 5C 7D AH 3S',
+  '3H 4C 4H TC TH 6S 7H 6D 9C QH',
+  '7D 5H 4S 8C JS 4D 3D 8S QH KC',
+  '3H 6S AD 7H 3S QC 8S 4S 7S JS',
+  '3S JD KH TH 6H QS 9C 6C 2D QD',
+  '4S QH 4D 5H KC 7D 6D 8D TH 5S',
+  'TD AD 6S 7H KD KH 9H 5S KC JC',
+  '3H QC AS TS 4S QD KS 9C 7S KC',
+  'TS 6S QC 6C TH TC 9D 5C 5D KD',
+  'JS 3S 4H KD 4C QD 6D 9S JC 9D',
+  '8S JS 6D 4H JH 6H 6S 6C KS KH',
+  'AC 7D 5D TC 9S KH 6S QD 6H AS',
+  'AS 7H 6D QH 8D TH 2S KH 5C 5H',
+  '4C 7C 3D QC TC 4S KH 8C 2D JS',
+  '6H 5D 7S 5H 9C 9H JH 8S TH 7H',
+  'AS JS 2S QD KH 8H 4S AC 8D 8S',
+  '3H 4C TD KD 8C JC 5C QS 2D JD',
+  'TS 7D 5D 6C 2C QS 2H 3C AH KS',
+  '4S 7C 9C 7D JH 6C 5C 8H 9D QD',
+  '2S TD 7S 6D 9C 9S QS KH QH 5C',
+  'JC 6S 9C QH JH 8D 7S JS KH 2H',
+  '8D 5H TH KC 4D 4S 3S 6S 3D QS',
+  '2D JD 4C TD 7C 6D TH 7S JC AH',
+  'QS 7S 4C TH 9D TS AD 4D 3H 6H',
+  '2D 3H 7D JD 3D AS 2S 9C QC 8S',
+  '4H 9H 9C 2C 7S JH KD 5C 5D 6H',
+  'TC 9H 8H JC 3C 9S 8D KS AD KC',
+  'TS 5H JD QS QH QC 8D 5D KH AH',
+  '5D AS 8S 6S 4C AH QC QD TH 7H',
+  '3H 4H 7D 6S 4S 9H AS 8H JS 9D',
+  'JD 8C 2C 9D 7D 5H 5S 9S JC KD',
+  'KD 9C 4S QD AH 7C AD 9D AC TD',
+  '6S 4H 4S 9C 8D KS TC 9D JH 7C',
+  '5S JC 5H 4S QH AC 2C JS 2S 9S',
+  '8C 5H AS QD AD 5C 7D 8S QC TD',
+  'JC 4C 8D 5C KH QS 4D 6H 2H 2C',
+  'TH 4S 2D KC 3H QD AC 7H AD 9D',
+  'KH QD AS 8H TH KC 8D 7S QH 8C',
+  'JC 6C 7D 8C KH AD QS 2H 6S 2D',
+  'JC KH 2D 7D JS QC 5H 4C 5D AD',
+  'TS 3S AD 4S TD 2D TH 6S 9H JH',
+  '9H 2D QS 2C 4S 3D KH AS AC 9D',
+  'KH 6S 8H 4S KD 7D 9D TS QD QC',
+  'JH 5H AH KS AS AD JC QC 5S KH',
+  '5D 7D 6D KS KD 3D 7C 4D JD 3S',
+  'AC JS 8D 5H 9C 3H 4H 4D TS 2C',
+  '6H KS KH 9D 7C 2S 6S 8S 2H 3D',
+  '6H AC JS 7S 3S TD 8H 3H 4H TH',
+  '9H TC QC KC 5C KS 6H 4H AC 8S',
+  'TC 7D QH 4S JC TS 6D 6C AC KH',
+  'QH 7D 7C JH QS QD TH 3H 5D KS',
+  '3D 5S 8D JS 4C 2C KS 7H 9C 4H',
+  '5H 8S 4H TD 2C 3S QD QC 3H KC',
+  'QC JS KD 9C AD 5S 9D 7D 7H TS',
+  '8C JC KH 7C 7S 6C TS 2C QD TH',
+  '5S 9D TH 3C 7S QH 8S 9C 2H 5H',
+  '5D 9H 6H 2S JS KH 3H 7C 2H 5S',
+  'JD 5D 5S 2C TC 2S 6S 6C 3C 8S',
+  '4D KH 8H 4H 2D KS 3H 5C 2S 9H',
+  '3S 2D TD 7H 8S 6H JD KC 9C 8D',
+  '6S QD JH 7C 9H 5H 8S 8H TH TD',
+  'QS 7S TD 7D TS JC KD 7C 3C 2C',
+  '3C JD 8S 4H 2D 2S TD AS 4D AC',
+  'AH KS 6C 4C 4S 7D 8C 9H 6H AS',
+  '5S 3C 9S 2C QS KD 4D 4S AC 5D',
+  '2D TS 2C JS KH QH 5D 8C AS KC',
+  'KD 3H 6C TH 8S 7S KH 6H 9S AC',
+  '6H 7S 6C QS AH 2S 2H 4H 5D 5H',
+  '5H JC QD 2C 2S JD AS QC 6S 7D',
+  '6C TC AS KD 8H 9D 2C 7D JH 9S',
+  '2H 4C 6C AH 8S TD 3H TH 7C TS',
+  'KD 4S TS 6C QH 8D 9D 9C AH 7D',
+  '6D JS 5C QD QC 9C 5D 8C 2H KD',
+  '3C QH JH AD 6S AH KC 8S 6D 6H',
+  '3D 7C 4C 7S 5S 3S 6S 5H JC 3C',
+  'QH 7C 5H 3C 3S 8C TS 4C KD 9C',
+  'QD 3S 7S 5H 7H QH JC 7C 8C KD',
+  '3C KD KH 2S 4C TS AC 6S 2C 7C',
+  '2C KH 3C 4C 6H 4D 5H 5S 7S QD',
+  '4D 7C 8S QD TS 9D KS 6H KD 3C',
+  'QS 4D TS 7S 4C 3H QD 8D 9S TC',
+  'TS QH AC 6S 3C 9H 9D QS 8S 6H',
+  '3S 7S 5D 4S JS 2D 6C QH 6S TH',
+  '4C 4H AS JS 5D 3D TS 9C AC 8S',
+  '6S 9C 7C 3S 5C QS AD AS 6H 3C',
+  '9S 8C 7H 3H 6S 7C AS 9H JD KH',
+  '3D 3H 7S 4D 6C 7C AC 2H 9C TH',
+  '4H 5S 3H AC TC TH 9C 9H 9S 8D',
+  '8D 9H 5H 4D 6C 2H QD 6S 5D 3S',
+  '4C 5C JD QS 4D 3H TH AC QH 8C',
+  'QC 5S 3C 7H AD 4C KS 4H JD 6D',
+  'QS AH 3H KS 9H 2S JS JH 5H 2H',
+  '2H 5S TH 6S TS 3S KS 3C 5H JS',
+  '2D 9S 7H 3D KC JH 6D 7D JS TD',
+  'AC JS 8H 2C 8C JH JC 2D TH 7S',
+  '5D 9S 8H 2H 3D TC AH JC KD 9C',
+  '9D QD JC 2H 6D KH TS 9S QH TH',
+  '2C 8D 4S JD 5H 3H TH TC 9C KC',
+  'AS 3D 9H 7D 4D TH KH 2H 7S 3H',
+  '4H 7S KS 2S JS TS 8S 2H QD 8D',
+  '5S 6H JH KS 8H 2S QC AC 6S 3S',
+  'JC AS AD QS 8H 6C KH 4C 4D QD',
+  '2S 3D TS TD 9S KS 6S QS 5C 8D',
+  '3C 6D 4S QC KC JH QD TH KH AD',
+  '9H AH 4D KS 2S 8D JH JC 7C QS',
+  '2D 6C TH 3C 8H QD QH 2S 3S KS',
+  '6H 5D 9S 4C TS TD JS QD 9D JD',
+  '5H 8H KH 8S KS 7C TD AD 4S KD',
+  '2C 7C JC 5S AS 6C 7D 8S 5H 9C',
+  '6S QD 9S TS KH QS 5S QH 3C KC',
+  '7D 3H 3C KD 5C AS JH 7H 6H JD',
+  '9D 5C 9H KC 8H KS 4S AD 4D 2S',
+  '3S JD QD 8D 2S 7C 5S 6S 5H TS',
+  '6D 9S KC TD 3S 6H QD JD 5C 8D',
+  '5H 9D TS KD 8D 6H TD QC 4C 7D',
+  '6D 4S JD 9D AH 9S AS TD 9H QD',
+  '2D 5S 2H 9C 6H 9S TD QC 7D TC',
+  '3S 2H KS TS 2C 9C 8S JS 9D 7D',
+  '3C KC 6D 5D 6C 6H 8S AS 7S QS',
+  'JH 9S 2H 8D 4C 8H 9H AD TH KH',
+  'QC AS 2S JS 5C 6H KD 3H 7H 2C',
+  'QD 8H 2S 8D 3S 6D AH 2C TC 5C',
+  'JD JS TS 8S 3H 5D TD KC JC 6H',
+  '6S QS TC 3H 5D AH JC 7C 7D 4H',
+  '7C 5D 8H 9C 2H 9H JH KH 5S 2C',
+  '9C 7H 6S TH 3S QC QD 4C AC JD',
+  '2H 5D 9S 7D KC 3S QS 2D AS KH',
+  '2S 4S 2H 7D 5C TD TH QH 9S 4D',
+  '6D 3S TS 6H 4H KS 9D 8H 5S 2D',
+  '9H KS 4H 3S 5C 5D KH 6H 6S JS',
+  'KC AS 8C 4C JC KH QC TH QD AH',
+  '6S KH 9S 2C 5H TC 3C 7H JC 4D',
+  'JD 4S 6S 5S 8D 7H 7S 4D 4C 2H',
+  '7H 9H 5D KH 9C 7C TS TC 7S 5H',
+  '4C 8D QC TS 4S 9H 3D AD JS 7C',
+  '8C QS 5C 5D 3H JS AH KC 4S 9D',
+  'TS JD 8S QS TH JH KH 2D QD JS',
+  'JD QC 5D 6S 9H 3S 2C 8H 9S TS',
+  '2S 4C AD 7H JC 5C 2D 6D 4H 3D',
+  '7S JS 2C 4H 8C AD QD 9C 3S TD',
+  'JD TS 4C 6H 9H 7D QD 6D 3C AS',
+  'AS 7C 4C 6S 5D 5S 5C JS QC 4S',
+  'KD 6S 9S 7C 3C 5S 7D JH QD JS',
+  '4S 7S JH 2C 8S 5D 7H 3D QH AD',
+  'TD 6H 2H 8D 4H 2D 7C AD KH 5D',
+  'TS 3S 5H 2C QD AH 2S 5C KH TD',
+  'KC 4D 8C 5D AS 6C 2H 2S 9H 7C',
+  'KD JS QC TS QS KH JH 2C 5D AD',
+  '3S 5H KC 6C 9H 3H 2H AD 7D 7S',
+  '7S JS JH KD 8S 7D 2S 9H 7C 2H',
+  '9H 2D 8D QC 6S AD AS 8H 5H 6C',
+  '2S 7H 6C 6D 7D 8C 5D 9D JC 3C',
+  '7C 9C 7H JD 2H KD 3S KH AD 4S',
+  'QH AS 9H 4D JD KS KD TS KH 5H',
+  '4C 8H 5S 3S 3D 7D TD AD 7S KC',
+  'JS 8S 5S JC 8H TH 9C 4D 5D KC',
+  '7C 5S 9C QD 2C QH JS 5H 8D KH',
+  'TD 2S KS 3D AD KC 7S TC 3C 5D',
+  '4C 2S AD QS 6C 9S QD TH QH 5C',
+  '8C AD QS 2D 2S KC JD KS 6C JC',
+  '8D 4D JS 2H 5D QD 7S 7D QH TS',
+  '6S 7H 3S 8C 8S 9D QS 8H 6C 9S',
+  '4S TC 2S 5C QD 4D QS 6D TH 6S',
+  '3S 5C 9D 6H 8D 4C 7D TC 7C TD',
+  'AH 6S AS 7H 5S KD 3H 5H AC 4C',
+  '8D 8S AH KS QS 2C AD 6H 7D 5D',
+  '6H 9H 9S 2H QS 8S 9C 5D 2D KD',
+  'TS QC 5S JH 7D 7S TH 9S 9H AC',
+  '7H 3H 6S KC 4D 6D 5C 4S QD TS',
+  'TD 2S 7C QD 3H JH 9D 4H 7S 7H',
+  'KS 3D 4H 5H TC 2S AS 2D 6D 7D',
+  '8H 3C 7H TD 3H AD KC TH 9C KH',
+  'TC 4C 2C 9S 9D 9C 5C 2H JD 3C',
+  '3H AC TS 5D AD 8D 6H QC 6S 8C',
+  '2S TS 3S JD 7H 8S QH 4C 5S 8D',
+  'AC 4S 6C 3C KH 3D 7C 2D 8S 2H',
+  '4H 6C 8S TH 2H 4S 8H 9S 3H 7S',
+  '7C 4C 9C 2C 5C AS 5D KD 4D QH',
+  '9H 4H TS AS 7D 8D 5D 9S 8C 2H',
+  'QC KD AC AD 2H 7S AS 3S 2D 9S',
+  '2H QC 8H TC 6D QD QS 5D KH 3C',
+  'TH JD QS 4C 2S 5S AD 7H 3S AS',
+  '7H JS 3D 6C 3S 6D AS 9S AC QS',
+  '9C TS AS 8C TC 8S 6H 9D 8D 6C',
+  '4D JD 9C KC 7C 6D KS 3S 8C AS',
+  '3H 6S TC 8D TS 3S KC 9S 7C AS',
+  '8C QC 4H 4S 8S 6C 3S TC AH AC',
+  '4D 7D 5C AS 2H 6S TS QC AD TC',
+  'QD QC 8S 4S TH 3D AH TS JH 4H',
+  '5C 2D 9S 2C 3H 3C 9D QD QH 7D',
+  'KC 9H 6C KD 7S 3C 4D AS TC 2D',
+  '3D JS 4D 9D KS 7D TH QC 3H 3C',
+  '8D 5S 2H 9D 3H 8C 4C 4H 3C TH',
+  'JC TH 4S 6S JD 2D 4D 6C 3D 4C',
+  'TS 3S 2D 4H AC 2C 6S 2H JH 6H',
+  'TD 8S AD TC AH AC JH 9S 6S 7S',
+  '6C KC 4S JD 8D 9H 5S 7H QH AH',
+  'KD 8D TS JH 5C 5H 3H AD AS JS',
+  '2D 4H 3D 6C 8C 7S AD 5D 5C 8S',
+  'TD 5D 7S 9C 4S 5H 6C 8C 4C 8S',
+  'JS QH 9C AS 5C QS JC 3D QC 7C',
+  'JC 9C KH JH QS QC 2C TS 3D AD',
+  '5D JH AC 5C 9S TS 4C JD 8C KS',
+  'KC AS 2D KH 9H 2C 5S 4D 3D 6H',
+  'TH AH 2D 8S JC 3D 8C QH 7S 3S',
+  '8H QD 4H JC AS KH KS 3C 9S 6D',
+  '9S QH 7D 9C 4S AC 7H KH 4D KD',
+  'AH AD TH 6D 9C 9S KD KS QH 4H',
+  'QD 6H 9C 7C QS 6D 6S 9D 5S JH',
+  'AH 8D 5H QD 2H JC KS 4H KH 5S',
+  '5C 2S JS 8D 9C 8C 3D AS KC AH',
+  'JD 9S 2H QS 8H 5S 8C TH 5C 4C',
+  'QC QS 8C 2S 2C 3S 9C 4C KS KH',
+  '2D 5D 8S AH AD TD 2C JS KS 8C',
+  'TC 5S 5H 8H QC 9H 6H JD 4H 9S',
+  '3C JH 4H 9H AH 4S 2H 4C 8D AC',
+  '8S TH 4D 7D 6D QD QS 7S TC 7C',
+  'KH 6D 2D JD 5H JS QD JH 4H 4S',
+  '9C 7S JH 4S 3S TS QC 8C TC 4H',
+  'QH 9D 4D JH QS 3S 2C 7C 6C 2D',
+  '4H 9S JD 5C 5H AH 9D TS 2D 4C',
+  'KS JH TS 5D 2D AH JS 7H AS 8D',
+  'JS AH 8C AD KS 5S 8H 2C 6C TH',
+  '2H 5D AD AC KS 3D 8H TS 6H QC',
+  '6D 4H TS 9C 5H JS JH 6S JD 4C',
+  'JH QH 4H 2C 6D 3C 5D 4C QS KC',
+  '6H 4H 6C 7H 6S 2S 8S KH QC 8C',
+  '3H 3D 5D KS 4H TD AD 3S 4D TS',
+  '5S 7C 8S 7D 2C KS 7S 6C 8C JS',
+  '5D 2H 3S 7C 5C QD 5H 6D 9C 9H',
+  'JS 2S KD 9S 8D TD TS AC 8C 9D',
+  '5H QD 2S AC 8C 9H KS 7C 4S 3C',
+  'KH AS 3H 8S 9C JS QS 4S AD 4D',
+  'AS 2S TD AD 4D 9H JC 4C 5H QS',
+  '5D 7C 4H TC 2D 6C JS 4S KC 3S',
+  '4C 2C 5D AC 9H 3D JD 8S QS QH',
+  '2C 8S 6H 3C QH 6D TC KD AC AH',
+  'QC 6C 3S QS 4S AC 8D 5C AD KH',
+  '5S 4C AC KH AS QC 2C 5C 8D 9C',
+  '8H JD 3C KH 8D 5C 9C QD QH 9D',
+  '7H TS 2C 8C 4S TD JC 9C 5H QH',
+  'JS 4S 2C 7C TH 6C AS KS 7S JD',
+  'JH 7C 9H 7H TC 5H 3D 6D 5D 4D',
+  '2C QD JH 2H 9D 5S 3D TD AD KS',
+  'JD QH 3S 4D TH 7D 6S QS KS 4H',
+  'TC KS 5S 8D 8H AD 2S 2D 4C JH',
+  '5S JH TC 3S 2D QS 9D 4C KD 9S',
+  'AC KH 3H AS 9D KC 9H QD 6C 6S',
+  '9H 7S 3D 5C 7D KC TD 8H 4H 6S',
+  '3C 7H 8H TC QD 4D 7S 6S QH 6C',
+  '6D AD 4C QD 6C 5D 7D 9D KS TS',
+  'JH 2H JD 9S 7S TS KH 8D 5D 8H',
+  '2D 9S 4C 7D 9D 5H QD 6D AC 6S',
+  '7S 6D JC QD JH 4C 6S QS 2H 7D',
+  '8C TD JH KD 2H 5C QS 2C JS 7S',
+  'TC 5H 4H JH QD 3S 5S 5D 8S KH',
+  'KS KH 7C 2C 5D JH 6S 9C 6D JC',
+  '5H AH JD 9C JS KC 2H 6H 4D 5S',
+  'AS 3C TH QC 6H 9C 8S 8C TD 7C',
+  'KC 2C QD 9C KH 4D 7S 3C TS 9H',
+  '9C QC 2S TS 8C TD 9S QD 3S 3C',
+  '4D 9D TH JH AH 6S 2S JD QH JS',
+  'QD 9H 6C KD 7D 7H 5D 6S 8H AH',
+  '8H 3C 4S 2H 5H QS QH 7S 4H AC',
+  'QS 3C 7S 9S 4H 3S AH KS 9D 7C',
+  'AD 5S 6S 2H 2D 5H TC 4S 3C 8C',
+  'QH TS 6S 4D JS KS JH AS 8S 6D',
+  '2C 8S 2S TD 5H AS TC TS 6C KC',
+  'KC TS 8H 2H 3H 7C 4C 5S TH TD',
+  'KD AD KH 7H 7S 5D 5H 5S 2D 9C',
+  'AD 9S 3D 7S 8C QC 7C 9C KD KS',
+  '3C QC 9S 8C 4D 5C AS QD 6C 2C',
+  '2H KC 8S JD 7S AC 8D 5C 2S 4D',
+  '9D QH 3D 2S TC 3S KS 3C 9H TD',
+  'KD 6S AC 2C 7H 5H 3S 6C 6H 8C',
+  'QH TC 8S 6S KH TH 4H 5D TS 4D',
+  '8C JS 4H 6H 2C 2H 7D AC QD 3D',
+  'QS KC 6S 2D 5S 4H TD 3H JH 4C',
+  '7S 5H 7H 8H KH 6H QS TH KD 7D',
+  '5H AD KD 7C KH 5S TD 6D 3C 6C',
+  '8C 9C 5H JD 7C KC KH 7H 2H 3S',
+  '7S 4H AD 4D 8S QS TH 3D 7H 5S',
+  '8D TC KS KD 9S 6D AD JD 5C 2S',
+  '7H 8H 6C QD 2H 6H 9D TC 9S 7C',
+  '8D 6D 4C 7C 6C 3C TH KH JS JH',
+  '5S 3S 8S JS 9H AS AD 8H 7S KD',
+  'JH 7C 2C KC 5H AS AD 9C 9S JS',
+  'AD AC 2C 6S QD 7C 3H TH KS KD',
+  '9D JD 4H 8H 4C KH 7S TS 8C KC',
+  '3S 5S 2H 7S 6H 7D KS 5C 6D AD',
+  '5S 8C 9H QS 7H 7S 2H 6C 7D TD',
+  'QS 5S TD AC 9D KC 3D TC 2D 4D',
+  'TD 2H 7D JD QD 4C 7H 5D KC 3D',
+  '4C 3H 8S KD QH 5S QC 9H TC 5H',
+  '9C QD TH 5H TS 5C 9H AH QH 2C',
+  '4D 6S 3C AC 6C 3D 2C 2H TD TH',
+  'AC 9C 5D QC 4D AD 8D 6D 8C KC',
+  'AD 3C 4H AC 8D 8H 7S 9S TD JC',
+  '4H 9H QH JS 2D TH TD TC KD KS',
+  '5S 6S 9S 8D TH AS KH 5H 5C 8S',
+  'JD 2S 9S 6S 5S 8S 5D 7S 7H 9D',
+  '5D 8C 4C 9D AD TS 2C 7D KD TC',
+  '8S QS 4D KC 5C 8D 4S KH JD KD',
+  'AS 5C AD QH 7D 2H 9S 7H 7C TC',
+  '2S 8S JD KH 7S 6C 6D AD 5D QC',
+  '9H 6H 3S 8C 8H AH TC 4H JS TD',
+  '2C TS 4D 7H 2D QC 9C 5D TH 7C',
+  '6C 8H QC 5D TS JH 5C 5H 9H 4S',
+  '2D QC 7H AS JS 8S 2H 4C 4H 8D',
+  'JS 6S AC KD 3D 3C 4S 7H TH KC',
+  'QH KH 6S QS 5S 4H 3C QD 3S 3H',
+  '7H AS KH 8C 4H 9C 5S 3D 6S TS',
+  '9C 7C 3H 5S QD 2C 3D AD AC 5H',
+  'JH TD 2D 4C TS 3H KH AD 3S 7S',
+  'AS 4C 5H 4D 6S KD JC 3C 6H 2D',
+  '3H 6S 8C 2D TH 4S AH QH AD 5H',
+  '7C 2S 9H 7H KC 5C 6D 5S 3H JC',
+  '3C TC 9C 4H QD TD JH 6D 9H 5S',
+  '7C 6S 5C 5D 6C 4S 7H 9H 6H AH',
+  'AD 2H 7D KC 2C 4C 2S 9S 7H 3S',
+  'TH 4C 8S 6S 3S AD KS AS JH TD',
+  '5C TD 4S 4D AD 6S 5D TC 9C 7D',
+  '8H 3S 4D 4S 5S 6H 5C AC 3H 3D',
+  '9H 3C AC 4S QS 8S 9D QH 5H 4D',
+  'JC 6C 5H TS AC 9C JD 8C 7C QD',
+  '8S 8H 9C JD 2D QC QH 6H 3C 8D',
+  'KS JS 2H 6H 5H QH QS 3H 7C 6D',
+  'TC 3H 4S 7H QC 2H 3S 8C JS KH',
+  'AH 8H 5S 4C 9H JD 3H 7S JC AC',
+  '3C 2D 4C 5S 6C 4S QS 3S JD 3D',
+  '5H 2D TC AH KS 6D 7H AD 8C 6H',
+  '6C 7S 3C JD 7C 8H KS KH AH 6D',
+  'AH 7D 3H 8H 8S 7H QS 5H 9D 2D',
+  'JD AC 4H 7S 8S 9S KS AS 9D QH',
+  '7S 2C 8S 5S JH QS JC AH KD 4C',
+  'AH 2S 9H 4H 8D TS TD 6H QH JD',
+  '4H JC 3H QS 6D 7S 9C 8S 9D 8D',
+  '5H TD 4S 9S 4C 8C 8D 7H 3H 3D',
+  'QS KH 3S 2C 2S 3C 7S TD 4S QD',
+  '7C TD 4D 5S KH AC AS 7H 4C 6C',
+  '2S 5H 6D JD 9H QS 8S 2C 2H TD',
+  '2S TS 6H 9H 7S 4H JC 4C 5D 5S',
+  '2C 5H 7D 4H 3S QH JC JS 6D 8H',
+  '4C QH 7C QD 3S AD TH 8S 5S TS',
+  '9H TC 2S TD JC 7D 3S 3D TH QH',
+  '7D 4C 8S 5C JH 8H 6S 3S KC 3H',
+  'JC 3H KH TC QH TH 6H 2C AC 5H',
+  'QS 2H 9D 2C AS 6S 6C 2S 8C 8S',
+  '9H 7D QC TH 4H KD QS AC 7S 3C',
+  '4D JH 6S 5S 8H KS 9S QC 3S AS',
+  'JD 2D 6S 7S TC 9H KC 3H 7D KD',
+  '2H KH 7C 4D 4S 3H JS QD 7D KC',
+  '4C JC AS 9D 3C JS 6C 8H QD 4D',
+  'AH JS 3S 6C 4C 3D JH 6D 9C 9H',
+  '9H 2D 8C 7H 5S KS 6H 9C 2S TC',
+  '6C 8C AD 7H 6H 3D KH AS 5D TH',
+  'KS 8C 3S TS 8S 4D 5S 9S 6C 4H',
+  '9H 4S 4H 5C 7D KC 2D 2H 9D JH',
+  '5C JS TC 9D 9H 5H 7S KH JC 6S',
+  '7C 9H 8H 4D JC KH JD 2H TD TC',
+  '8H 6C 2H 2C KH 6H 9D QS QH 5H',
+  'AC 7D 2S 3D QD JC 2D 8D JD JH',
+  '2H JC 2D 7H 2C 3C 8D KD TD 4H',
+  '3S 4H 6D 8D TS 3H TD 3D 6H TH',
+  'JH JC 3S AC QH 9H 7H 8S QC 2C',
+  '7H TD QS 4S 8S 9C 2S 5D 4D 2H',
+  '3D TS 3H 2S QC 8H 6H KC JC KS',
+  '5D JD 7D TC 8C 6C 9S 3D 8D AC',
+  '8H 6H JH 6C 5D 8D 8S 4H AD 2C',
+  '9D 4H 2D 2C 3S TS AS TC 3C 5D',
+  '4D TH 5H KS QS 6C 4S 2H 3D AD',
+  '5C KC 6H 2C 5S 3C 4D 2D 9H 9S',
+  'JD 4C 3H TH QH 9H 5S AH 8S AC',
+  '7D 9S 6S 2H TD 9C 4H 8H QS 4C',
+  '3C 6H 5D 4H 8C 9C KC 6S QD QS',
+  '3S 9H KD TC 2D JS 8C 6S 4H 4S',
+  '2S 4C 8S QS 6H KH 3H TH 8C 5D',
+  '2C KH 5S 3S 7S 7H 6C 9D QD 8D',
+  '8H KS AC 2D KH TS 6C JS KC 7H',
+  '9C KS 5C TD QC AH 6C 5H 9S 7C',
+  '5D 4D 3H 4H 6S 7C 7S AH QD TD',
+  '2H 7D QC 6S TC TS AH 7S 9D 3H',
+  'TH 5H QD 9S KS 7S 7C 6H 8C TD',
+  'TH 2D 4D QC 5C 7D JD AH 9C 4H',
+  '4H 3H AH 8D 6H QC QH 9H 2H 2C',
+  '2D AD 4C TS 6H 7S TH 4H QS TD',
+  '3C KD 2H 3H QS JD TC QC 5D 8H',
+  'KS JC QD TH 9S KD 8D 8C 2D 9C',
+  '3C QD KD 6D 4D 8D AH AD QC 8S',
+  '8H 3S 9D 2S 3H KS 6H 4C 7C KC',
+  'TH 9S 5C 3D 7D 6H AC 7S 4D 2C',
+  '5C 3D JD 4D 2D 6D 5H 9H 4C KH',
+  'AS 7H TD 6C 2H 3D QD KS 4C 4S',
+  'JC 3C AC 7C JD JS 8H 9S QC 5D',
+  'JD 6S 5S 2H AS 8C 7D 5H JH 3D',
+  '8D TC 5S 9S 8S 3H JC 5H 7S AS',
+  '5C TD 3D 7D 4H 8D 7H 4D 5D JS',
+  'QS 9C KS TD 2S 8S 5C 2H 4H AS',
+  'TH 7S 4H 7D 3H JD KD 5D 2S KC',
+  'JD 7H 4S 8H 4C JS 6H QH 5S 4H',
+  '2C QS 8C 5S 3H QC 2S 6C QD AD',
+  '8C 3D JD TC 4H 2H AD 5S AC 2S',
+  '5D 2C JS 2D AD 9D 3D 4C 4S JH',
+  '8D 5H 5D 6H 7S 4D KS 9D TD JD',
+  '3D 6D 9C 2S AS 7D 5S 5C 8H JD',
+  '7C 8S 3S 6S 5H JD TC AD 7H 7S',
+  '2S 9D TS 4D AC 8D 6C QD JD 3H',
+  '9S KH 2C 3C AC 3D 5H 6H 8D 5D',
+  'KS 3D 2D 6S AS 4C 2S 7C 7H KH',
+  'AC 2H 3S JC 5C QH 4D 2D 5H 7S',
+  'TS AS JD 8C 6H JC 8S 5S 2C 5D',
+  '7S QH 7H 6C QC 8H 2D 7C JD 2S',
+  '2C QD 2S 2H JC 9C 5D 2D JD JH',
+  '7C 5C 9C 8S 7D 6D 8D 6C 9S JH',
+  '2C AD 6S 5H 3S KS 7S 9D KH 4C',
+  '7H 6C 2C 5C TH 9D 8D 3S QC AH',
+  '5S KC 6H TC 5H 8S TH 6D 3C AH',
+  '9C KD 4H AD TD 9S 4S 7D 6H 5D',
+  '7H 5C 5H 6D AS 4C KD KH 4H 9D',
+  '3C 2S 5C 6C JD QS 2H 9D 7D 3H',
+  'AC 2S 6S 7S JS QD 5C QS 6H AD',
+  '5H TH QC 7H TC 3S 7C 6D KC 3D',
+  '4H 3D QC 9S 8H 2C 3S JC KS 5C',
+  '4S 6S 2C 6H 8S 3S 3D 9H 3H JS',
+  '4S 8C 4D 2D 8H 9H 7D 9D AH TS',
+  '9S 2C 9H 4C 8D AS 7D 3D 6D 5S',
+  '6S 4C 7H 8C 3H 5H JC AH 9D 9C',
+  '2S 7C 5S JD 8C 3S 3D 4D 7D 6S',
+  '3C KC 4S 5D 7D 3D JD 7H 3H 4H',
+  '9C 9H 4H 4D TH 6D QD 8S 9S 7S',
+  '2H AC 8S 4S AD 8C 2C AH 7D TC',
+  'TS 9H 3C AD KS TC 3D 8C 8H JD',
+  'QC 8D 2C 3C 7D 7C JD 9H 9C 6C',
+  'AH 6S JS JH 5D AS QC 2C JD TD',
+  '9H KD 2H 5D 2D 3S 7D TC AH TS',
+  'TD 8H AS 5D AH QC AC 6S TC 5H',
+  'KS 4S 7H 4D 8D 9C TC 2H 6H 3H',
+  '3H KD 4S QD QH 3D 8H 8C TD 7S',
+  '8S JD TC AH JS QS 2D KH KS 4D',
+  '3C AD JC KD JS KH 4S TH 9H 2C',
+  'QC 5S JS 9S KS AS 7C QD 2S JD',
+  'KC 5S QS 3S 2D AC 5D 9H 8H KS',
+  '6H 9C TC AD 2C 6D 5S JD 6C 7C',
+  'QS KH TD QD 2C 3H 8S 2S QC AH',
+  '9D 9H JH TC QH 3C 2S JS 5C 7H',
+  '6C 3S 3D 2S 4S QD 2D TH 5D 2C',
+  '2D 6H 6D 2S JC QH AS 7H 4H KH',
+  '5H 6S KS AD TC TS 7C AC 4S 4H',
+  'AD 3C 4H QS 8C 9D KS 2H 2D 4D',
+  '4S 9D 6C 6D 9C AC 8D 3H 7H KD',
+  'JC AH 6C TS JD 6D AD 3S 5D QD',
+  'JC JH JD 3S 7S 8S JS QC 3H 4S',
+  'JD TH 5C 2C AD JS 7H 9S 2H 7S',
+  '8D 3S JH 4D QC AS JD 2C KC 6H',
+  '2C AC 5H KD 5S 7H QD JH AH 2D',
+  'JC QH 8D 8S TC 5H 5C AH 8C 6C',
+  '3H JS 8S QD JH 3C 4H 6D 5C 3S',
+  '6D 4S 4C AH 5H 5S 3H JD 7C 8D',
+  '8H AH 2H 3H JS 3C 7D QC 4H KD',
+  '6S 2H KD 5H 8H 2D 3C 8S 7S QD',
+  '2S 7S KC QC AH TC QS 6D 4C 8D',
+  '5S 9H 2C 3S QD 7S 6C 2H 7C 9D',
+  '3C 6C 5C 5S JD JC KS 3S 5D TS',
+  '7C KS 6S 5S 2S 2D TC 2H 5H QS',
+  'AS 7H 6S TS 5H 9S 9D 3C KD 2H',
+  '4S JS QS 3S 4H 7C 2S AC 6S 9D',
+  '8C JH 2H 5H 7C 5D QH QS KH QC',
+  '3S TD 3H 7C KC 8D 5H 8S KH 8C',
+  '4H KH JD TS 3C 7H AS QC JS 5S',
+  'AH 9D 2C 8D 4D 2D 6H 6C KC 6S',
+  '2S 6H 9D 3S 7H 4D KH 8H KD 3D',
+  '9C TC AC JH KH 4D JD 5H TD 3S',
+  '7S 4H 9D AS 4C 7D QS 9S 2S KH',
+  '3S 8D 8S KS 8C JC 5C KH 2H 5D',
+  '8S QH 2C 4D KC JS QC 9D AC 6H',
+  '8S 8C 7C JS JD 6S 4C 9C AC 4S',
+  'QH 5D 2C 7D JC 8S 2D JS JH 4C',
+  'JS 4C 7S TS JH KC KH 5H QD 4S',
+  'QD 8C 8D 2D 6S TD 9D AC QH 5S',
+  'QH QC JS 3D 3C 5C 4H KH 8S 7H',
+  '7C 2C 5S JC 8S 3H QC 5D 2H KC',
+  '5S 8D KD 6H 4H QD QH 6D AH 3D',
+  '7S KS 6C 2S 4D AC QS 5H TS JD',
+  '7C 2D TC 5D QS AC JS QC 6C KC',
+  '2C KS 4D 3H TS 8S AD 4H 7S 9S',
+  'QD 9H QH 5H 4H 4D KH 3S JC AD',
+  '4D AC KC 8D 6D 4C 2D KH 2C JD',
+  '2C 9H 2D AH 3H 6D 9C 7D TC KS',
+  '8C 3H KD 7C 5C 2S 4S 5H AS AH',
+  'TH JD 4H KD 3H TC 5C 3S AC KH',
+  '6D 7H AH 7S QC 6H 2D TD JD AS',
+  'JH 5D 7H TC 9S 7D JC AS 5S KH',
+  '2H 8C AD TH 6H QD KD 9H 6S 6C',
+  'QH KC 9D 4D 3S JS JH 4H 2C 9H',
+  'TC 7H KH 4H JC 7D 9S 3H QS 7S',
+  'AD 7D JH 6C 7H 4H 3S 3H 4D QH',
+  'JD 2H 5C AS 6C QC 4D 3C TC JH',
+  'AC JD 3H 6H 4C JC AD 7D 7H 9H',
+  '4H TC TS 2C 8C 6S KS 2H JD 9S',
+  '4C 3H QS QC 9S 9H 6D KC 9D 9C',
+  '5C AD 8C 2C QH TH QD JC 8D 8H',
+  'QC 2C 2S QD 9C 4D 3S 8D JH QS',
+  '9D 3S 2C 7S 7C JC TD 3C TC 9H',
+  '3C TS 8H 5C 4C 2C 6S 8D 7C 4H',
+  'KS 7H 2H TC 4H 2C 3S AS AH QS',
+  '8C 2D 2H 2C 4S 4C 6S 7D 5S 3S',
+  'TH QC 5D TD 3C QS KD KC KS AS',
+  '4D AH KD 9H KS 5C 4C 6H JC 7S',
+  'KC 4H 5C QS TC 2H JC 9S AH QH',
+  '4S 9H 3H 5H 3C QD 2H QC JH 8H',
+  '5D AS 7H 2C 3D JH 6H 4C 6S 7D',
+  '9C JD 9H AH JS 8S QH 3H KS 8H',
+  '3S AC QC TS 4D AD 3D AH 8S 9H',
+  '7H 3H QS 9C 9S 5H JH JS AH AC',
+  '8D 3C JD 2H AC 9C 7H 5S 4D 8H',
+  '7C JH 9H 6C JS 9S 7H 8C 9D 4H',
+  '2D AS 9S 6H 4D JS JH 9H AD QD',
+  '6H 7S JH KH AH 7H TD 5S 6S 2C',
+  '8H JH 6S 5H 5S 9D TC 4C QC 9S',
+  '7D 2C KD 3H 5H AS QD 7H JS 4D',
+  'TS QH 6C 8H TH 5H 3C 3H 9C 9D',
+  'AD KH JS 5D 3H AS AC 9S 5C KC',
+  '2C KH 8C JC QS 6D AH 2D KC TC',
+  '9D 3H 2S 7C 4D 6D KH KS 8D 7D',
+  '9H 2S TC JH AC QC 3H 5S 3S 8H',
+  '3S AS KD 8H 4C 3H 7C JH QH TS',
+  '7S 6D 7H 9D JH 4C 3D 3S 6C AS',
+  '4S 2H 2C 4C 8S 5H KC 8C QC QD',
+  '3H 3S 6C QS QC 2D 6S 5D 2C 9D',
+  '2H 8D JH 2S 3H 2D 6C 5C 7S AD',
+  '9H JS 5D QH 8S TS 2H 7S 6S AD',
+  '6D QC 9S 7H 5H 5C 7D KC JD 4H',
+  'QC 5S 9H 9C 4D 6S KS 2S 4C 7C',
+  '9H 7C 4H 8D 3S 6H 5C 8H JS 7S',
+  '2D 6H JS TD 4H 4D JC TH 5H KC',
+  'AC 7C 8D TH 3H 9S 2D 4C KC 4D',
+  'KD QS 9C 7S 3D KS AD TS 4C 4H',
+  'QH 9C 8H 2S 7D KS 7H 5D KD 4C',
+  '9C 2S 2H JC 6S 6C TC QC JH 5C',
+  '7S AC 8H KC 8S 6H QS JC 3D 6S',
+  'JS 2D JH 8C 4S 6H 8H 6D 5D AD',
+  '6H 7D 2S 4H 9H 7C AS AC 8H 5S',
+  '3C JS 4S 6D 5H 2S QH 6S 9C 2C',
+  '3D 5S 6S 9S 4C QS 8D QD 8S TC',
+  '9C 3D AH 9H 5S 2C 7D AD JC 3S',
+  '7H TC AS 3C 6S 6D 7S KH KC 9H',
+  '3S TC 8H 6S 5H JH 8C 7D AC 2S',
+  'QD 9D 9C 3S JC 8C KS 8H 5D 4D',
+  'JS AH JD 6D 9D 8C 9H 9S 8H 3H',
+  '2D 6S 4C 4D 8S AD 4S TC AH 9H',
+  'TS AC QC TH KC 6D 4H 7S 8C 2H',
+  '3C QD JS 9D 5S JC AH 2H TS 9H',
+  '3H 4D QH 5D 9C 5H 7D 4S JC 3S',
+  '8S TH 3H 7C 2H JD JS TS AC 8D',
+  '9C 2H TD KC JD 2S 8C 5S AD 2C',
+  '3D KD 7C 5H 4D QH QD TC 6H 7D',
+  '7H 2C KC 5S KD 6H AH QC 7S QH',
+  '6H 5C AC 5H 2C 9C 2D 7C TD 2S',
+  '4D 9D AH 3D 7C JD 4H 8C 4C KS',
+  'TH 3C JS QH 8H 4C AS 3D QS QC',
+  '4D 7S 5H JH 6D 7D 6H JS KH 3C',
+  'QD 8S 7D 2H 2C 7C JC 2S 5H 8C',
+  'QH 8S 9D TC 2H AD 7C 8D QD 6S',
+  '3S 7C AD 9H 2H 9S JD TS 4C 2D',
+  '3S AS 4H QC 2C 8H 8S 7S TD TC',
+  'JH TH TD 3S 4D 4H 5S 5D QS 2C',
+  '8C QD QH TC 6D 4S 9S 9D 4H QC',
+  '8C JS 9D 6H JD 3H AD 6S TD QC',
+  'KC 8S 3D 7C TD 7D 8D 9H 4S 3S',
+  '6C 4S 3D 9D KD TC KC KS AC 5S',
+  '7C 6S QH 3D JS KD 6H 6D 2D 8C',
+  'JD 2S 5S 4H 8S AC 2D 6S TS 5C',
+  '5H 8C 5S 3C 4S 3D 7C 8D AS 3H',
+  'AS TS 7C 3H AD 7D JC QS 6C 6H',
+  '3S 9S 4C AC QH 5H 5D 9H TS 4H',
+  '6C 5C 7H 7S TD AD JD 5S 2H 2S',
+  '7D 6C KC 3S JD 8D 8S TS QS KH',
+  '8S QS 8D 6C TH AC AH 2C 8H 9S',
+  '7H TD KH QH 8S 3D 4D AH JD AS',
+  'TS 3D 2H JC 2S JH KH 6C QC JS',
+  'KC TH 2D 6H 7S 2S TC 8C 9D QS',
+  '3C 9D 6S KH 8H 6D 5D TH 2C 2H',
+  '6H TC 7D AD 4D 8S TS 9H TD 7S',
+  'JS 6D JD JC 2H AC 6C 3D KH 8D',
+  'KH JD 9S 5D 4H 4C 3H 7S QS 5C',
+  '4H JD 5D 3S 3C 4D KH QH QS 7S',
+  'JD TS 8S QD AH 4C 6H 3S 5S 2C',
+  'QS 3D JD AS 8D TH 7C 6S QC KS',
+  '7S 2H 8C QC 7H AC 6D 2D TH KH',
+  '5S 6C 7H KH 7D AH 8C 5C 7S 3D',
+  '3C KD AD 7D 6C 4D KS 2D 8C 4S',
+  '7C 8D 5S 2D 2S AH AD 2C 9D TD',
+  '3C AD 4S KS JH 7C 5C 8C 9C TH',
+  'AS TD 4D 7C JD 8C QH 3C 5H 9S',
+  '3H 9C 8S 9S 6S QD KS AH 5H JH',
+  'QC 9C 5S 4H 2H TD 7D AS 8C 9D',
+  '8C 2C 9D KD TC 7S 3D KH QC 3C',
+  '4D AS 4C QS 5S 9D 6S JD QH KS',
+  '6D AH 6C 4C 5H TS 9H 7D 3D 5S',
+  'QS JD 7C 8D 9C AC 3S 6S 6C KH',
+  '8H JH 5D 9S 6D AS 6S 3S QC 7H',
+  'QD AD 5C JH 2H AH 4H AS KC 2C',
+  'JH 9C 2C 6H 2D JS 5D 9H KC 6D',
+  '7D 9D KD TH 3H AS 6S QC 6H AD',
+  'JD 4H 7D KC 3H JS 3C TH 3D QS',
+  '4C 3H 8C QD 5H 6H AS 8H AD JD',
+  'TH 8S KD 5D QC 7D JS 5S 5H TS',
+  '7D KC 9D QS 3H 3C 6D TS 7S AH',
+  '7C 4H 7H AH QC AC 4D 5D 6D TH',
+  '3C 4H 2S KD 8H 5H JH TC 6C JD',
+  '4S 8C 3D 4H JS TD 7S JH QS KD',
+  '7C QC KD 4D 7H 6S AD TD TC KH',
+  '5H 9H KC 3H 4D 3D AD 6S QD 6H',
+  'TH 7C 6H TS QH 5S 2C KC TD 6S',
+  '7C 4D 5S JD JH 7D AC KD KH 4H',
+  '7D 6C 8D 8H 5C JH 8S QD TH JD',
+  '8D 7D 6C 7C 9D KD AS 5C QH JH',
+  '9S 2C 8C 3C 4C KS JH 2D 8D 4H',
+  '7S 6C JH KH 8H 3H 9D 2D AH 6D',
+  '4D TC 9C 8D 7H TD KS TH KD 3C',
+  'JD 9H 8D QD AS KD 9D 2C 2S 9C',
+  '8D 3H 5C 7H KS 5H QH 2D 8C 9H',
+  '2D TH 6D QD 6C KC 3H 3S AD 4C',
+  '4H 3H JS 9D 3C TC 5H QH QC JC',
+  '3D 5C 6H 3S 3C JC 5S 7S 2S QH',
+  'AC 5C 8C 4D 5D 4H 2S QD 3C 3H',
+  '2C TD AH 9C KD JS 6S QD 4C QC',
+  'QS 8C 3S 4H TC JS 3H 7C JC AD',
+  '5H 4D 9C KS JC TD 9S TS 8S 9H',
+  'QD TS 7D AS AC 2C TD 6H 8H AH',
+  '6S AD 8C 4S 9H 8D 9D KH 8S 3C',
+  'QS 4D 2D 7S KH JS JC AD 4C 3C',
+  'QS 9S 7H KC TD TH 5H JS AC JH',
+  '6D AC 2S QS 7C AS KS 6S KH 5S',
+  '6D 8H KH 3C QS 2H 5C 9C 9D 6C',
+  'JS 2C 4C 6H 7D JC AC QD TD 3H',
+  '4H QC 8H JD 4C KD KS 5C KC 7S',
+  '6D 2D 3H 2S QD 5S 7H AS TH 6S',
+  'AS 6D 8D 2C 8S TD 8H QD JC AH',
+  '9C 9H 2D TD QH 2H 5C TC 3D 8H',
+  'KC 8S 3D KH 2S TS TC 6S 4D JH',
+  '9H 9D QS AC KC 6H 5D 4D 8D AH',
+  '9S 5C QS 4H 7C 7D 2H 8S AD JS',
+  '3D AC 9S AS 2C 2D 2H 3H JC KH',
+  '7H QH KH JD TC KS 5S 8H 4C 8D',
+  '2H 7H 3S 2S 5H QS 3C AS 9H KD',
+  'AD 3D JD 6H 5S 9C 6D AC 9S 3S',
+  '3D 5D 9C 2D AC 4S 2S AD 6C 6S',
+  'QC 4C 2D 3H 6S KC QH QD 2H JH',
+  'QC 3C 8S 4D 9S 2H 5C 8H QS QD',
+  '6D KD 6S 7H 3S KH 2H 5C JC 6C',
+  '3S 9S TC 6S 8H 2D AD 7S 8S TS',
+  '3C 6H 9C 3H 5C JC 8H QH TD QD',
+  '3C JS QD 5D TD 2C KH 9H TH AS',
+  '9S TC JD 3D 5C 5H AD QH 9H KC',
+  'TC 7H 4H 8H 3H TD 6S AC 7C 2S',
+  'QS 9D 5D 3C JC KS 4D 6C JH 2S',
+  '9S 6S 3C 7H TS 4C KD 6D 3D 9C',
+  '2D 9H AH AC 7H 2S JH 3S 7C QC',
+  'QD 9H 3C 2H AC AS 8S KD 8C KH',
+  '2D 7S TD TH 6D JD 8D 4D 2H 5S',
+  '8S QH KD JD QS JH 4D KC 5H 3S',
+  '3C KH QC 6D 8H 3S AH 7D TD 2D',
+  '5S 9H QH 4S 6S 6C 6D TS TH 7S',
+  '6C 4C 6D QS JS 9C TS 3H 8D 8S',
+  'JS 5C 7S AS 2C AH 2H AD 5S TC',
+  'KD 6C 9C 9D TS 2S JC 4H 2C QD',
+  'QS 9H TC 3H KC KS 4H 3C AD TH',
+  'KH 9C 2H KD 9D TC 7S KC JH 2D',
+  '7C 3S KC AS 8C 5D 9C 9S QH 3H',
+  '2D 8C TD 4C 2H QC 5D TC 2C 7D',
+  'KS 4D 6C QH TD KH 5D 7C AD 8D',
+  '2S 9S 8S 4C 8C 3D 6H QD 7C 7H',
+  '6C 8S QH 5H TS 5C 3C 4S 2S 2H',
+  '8S 6S 2H JC 3S 3H 9D 8C 2S 7H',
+  'QC 2C 8H 9C AC JD 4C 4H 6S 3S',
+  '3H 3S 7D 4C 9S 5H 8H JC 3D TC',
+  'QH 2S 2D 9S KD QD 9H AD 6D 9C',
+  '8D 2D KS 9S JC 4C JD KC 4S TH',
+  'KH TS 6D 4D 5C KD 5H AS 9H AD',
+  'QD JS 7C 6D 5D 5C TH 5H QH QS',
+  '9D QH KH 5H JH 4C 4D TC TH 6C',
+  'KH AS TS 9D KD 9C 7S 4D 8H 5S',
+  'KH AS 2S 7D 9D 4C TS TH AH 7C',
+  'KS 4D AC 8S 9S 8D TH QH 9D 5C',
+  '5D 5C 8C QS TC 4C 3D 3S 2C 8D',
+  '9D KS 2D 3C KC 4S 8C KH 6C JC',
+  '8H AH 6H 7D 7S QD 3C 4C 6C KC',
+  '3H 2C QH 8H AS 7D 4C 8C 4H KC',
+  'QD 5S 4H 2C TD AH JH QH 4C 8S',
+  '3H QS 5S JS 8H 2S 9H 9C 3S 2C',
+  '6H TS 7S JC QD AC TD KC 5S 3H',
+  'QH AS QS 7D JC KC 2C 4C 5C 5S',
+  'QH 3D AS JS 4H 8D 7H JC 2S 9C',
+  '5D 4D 2S 4S 9D 9C 2D QS 8H 7H',
+  '6D 7H 3H JS TS AC 2D JH 7C 8S',
+  'JH 5H KC 3C TC 5S 9H 4C 8H 9D',
+  '8S KC 5H 9H AD KS 9D KH 8D AH',
+  'JC 2H 9H KS 6S 3H QC 5H AH 9C',
+  '5C KH 5S AD 6C JC 9H QC 9C TD',
+  '5S 5D JC QH 2D KS 8H QS 2H TS',
+  'JH 5H 5S AH 7H 3C 8S AS TD KH',
+  '6H 3D JD 2C 4C KC 7S AH 6C JH',
+  '4C KS 9D AD 7S KC 7D 8H 3S 9C',
+  '7H 5C 5H 3C 8H QC 3D KH 6D JC',
+  '2D 4H 5D 7D QC AD AH 9H QH 8H',
+  'KD 8C JS 9D 3S 3C 2H 5D 6D 2S',
+  '8S 6S TS 3C 6H 8D 5S 3H TD 6C',
+  'KS 3D JH 9C 7C 9S QS 5S 4H 6H',
+  '7S 6S TH 4S KC KD 3S JC JH KS',
+  '7C 3C 2S 6D QH 2C 7S 5H 8H AH',
+  'KC 8D QD 6D KH 5C 7H 9D 3D 9C',
+  '6H 2D 8S JS 9S 2S 6D KC 7C TC',
+  'KD 9C JH 7H KC 8S 2S 7S 3D 6H',
+  '4H 9H 2D 4C 8H 7H 5S 8S 2H 8D',
+  'AD 7C 3C 7S 5S 4D 9H 3D JC KH',
+  '5D AS 7D 6D 9C JC 4C QH QS KH',
+  'KD JD 7D 3D QS QC 8S 6D JS QD',
+  '6S 8C 5S QH TH 9H AS AC 2C JD',
+  'QC KS QH 7S 3C 4C 5C KC 5D AH',
+  '6C 4H 9D AH 2C 3H KD 3D TS 5C',
+  'TD 8S QS AS JS 3H KD AC 4H KS',
+  '7D 5D TS 9H 4H 4C 9C 2H 8C QC',
+  '2C 7D 9H 4D KS 4C QH AD KD JS',
+  'QD AD AH KH 9D JS 9H JC KD JD',
+  '8S 3C 4S TS 7S 4D 5C 2S 6H 7C',
+  'JS 7S 5C KD 6D QH 8S TD 2H 6S',
+  'QH 6C TC 6H TD 4C 9D 2H QC 8H',
+  '3D TS 4D 2H 6H 6S 2C 7H 8S 6C',
+  '9H 9D JD JH 3S AH 2C 6S 3H 8S',
+  '2C QS 8C 5S 3H 2S 7D 3C AD 4S',
+  '5C QC QH AS TS 4S 6S 4C 5H JS',
+  'JH 5C TD 4C 6H JS KD KH QS 4H',
+  'TC KH JC 4D 9H 9D 8D KC 3C 8H',
+  '2H TC 8S AD 9S 4H TS 7H 2C 5C',
+  '4H 2S 6C 5S KS AH 9C 7C 8H KD',
+  'TS QH TD QS 3C JH AH 2C 8D 7D',
+  '5D KC 3H 5S AC 4S 7H QS 4C 2H',
+  '3D 7D QC KH JH 6D 6C TD TH KD',
+  '5S 8D TH 6C 9D 7D KH 8C 9S 6D',
+  'JD QS 7S QC 2S QH JC 4S KS 8D',
+  '7S 5S 9S JD KD 9C JC AD 2D 7C',
+  '4S 5H AH JH 9C 5D TD 7C 2D 6S',
+  'KC 6C 7H 6S 9C QD 5S 4H KS TD',
+  '6S 8D KS 2D TH TD 9H JD TS 3S',
+  'KH JS 4H 5D 9D TC TD QC JD TS',
+  'QS QD AC AD 4C 6S 2D AS 3H KC',
+  '4C 7C 3C TD QS 9C KC AS 8D AD',
+  'KC 7H QC 6D 8H 6S 5S AH 7S 8C',
+  '3S AD 9H JC 6D JD AS KH 6S JH',
+  'AD 3D TS KS 7H JH 2D JS QD AC',
+  '9C JD 7C 6D TC 6H 6C JC 3D 3S',
+  'QC KC 3S JC KD 2C 8D AH QS TS',
+  'AS KD 3D JD 8H 7C 8C 5C QD 6C'
+];
+```
+
+## --seed-contents--
+
+```js
+function pokerHands(arr) {
+
+  return true;
+}
+
+const testArr = [
+  '8C TS KC 9H 4S 7D 2S 5D 3S AC',
+  '5C AD 5D AC 9C 7C 5H 8D TD KS',
+  '3H 7H 6S KC JS QH TD JC 2D 8S',
+  'TH 8H 5C QS TC 9H 4D JC KS JS',
+  '7C 5H KC QH JD AS KH 4C AD 4S'
+];
+
+pokerHands(testArr);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
new file mode 100644
index 0000000000..8b074ba259
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
@@ -0,0 +1,113 @@
+---
+id: 5900f3a31000cf542c50feb6
+title: 'Problem 55: Lychrel numbers'
+challengeType: 5
+forumTopicId: 302166
+dashedName: problem-55-lychrel-numbers
+---
+
+# --description--
+
+If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
+
+Not all numbers produce palindromes so quickly. For example,
+
+<div style="margin-left: 4em;">
+  349 + 943 = 1292,<br>
+  1292 + 2921 = 4213<br>
+  4213 + 3124 = 7337<br>
+</div>
+
+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 `num`?
+
+**Note:** Wording was modified slightly on 24 April 2007 to emphasize the theoretical nature of Lychrel numbers.
+
+# --hints--
+
+`countLychrelNumbers(1000)` should return a number.
+
+```js
+assert(typeof countLychrelNumbers(1000) === 'number');
+```
+
+`countLychrelNumbers(1000)` should return 13.
+
+```js
+assert.strictEqual(countLychrelNumbers(1000), 13);
+```
+
+`countLychrelNumbers(3243)` should return 39.
+
+```js
+assert.strictEqual(countLychrelNumbers(3243), 39);
+```
+
+`countLychrelNumbers(5000)` should return 76.
+
+```js
+assert.strictEqual(countLychrelNumbers(5000), 76);
+```
+
+`countLychrelNumbers(7654)` should return 140.
+
+```js
+assert.strictEqual(countLychrelNumbers(7654), 140);
+```
+
+`countLychrelNumbers(10000)` should return 249.
+
+```js
+assert.strictEqual(countLychrelNumbers(10000), 249);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countLychrelNumbers(num) {
+
+  return true;
+}
+
+countLychrelNumbers(10000);
+```
+
+# --solutions--
+
+```js
+const countLychrelNumbers = (size) => {
+  const numReverse = (num) => {
+    return Number(num.toString().split('').reverse().join(''));
+  };
+  const isPalin = (num) => {
+    if (numReverse(num) === num) {
+      return true;
+    }
+    return false;
+  };
+  let total = 0;
+  for (let i = 1; i < size; i++) {
+    let loopCount = 1;
+    let sum = i;
+    while (loopCount < 50) {
+      sum = sum + numReverse(sum);
+      if (isPalin(sum)) {
+        break;
+      } else {
+        loopCount++;
+      }
+    }
+    if (loopCount === 50) {
+      total++;
+    }
+  }
+  return total;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
new file mode 100644
index 0000000000..407314741a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
@@ -0,0 +1,101 @@
+---
+id: 5900f3a41000cf542c50feb7
+title: 'Problem 56: Powerful digit sum'
+challengeType: 5
+forumTopicId: 302167
+dashedName: problem-56-powerful-digit-sum
+---
+
+# --description--
+
+A googol ($10^{100}$) is a massive number: one followed by one-hundred zeros; $100^{100}$ 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, $a^b$, where `a`, `b` &lt; `n`, what is the maximum digital sum?
+
+# --hints--
+
+`powerfulDigitSum(3)` should return a number.
+
+```js
+assert(typeof powerfulDigitSum(3) === 'number');
+```
+
+`powerfulDigitSum(3)` should return `4`.
+
+```js
+assert.strictEqual(powerfulDigitSum(3), 4);
+```
+
+`powerfulDigitSum(10)` should return `45`.
+
+```js
+assert.strictEqual(powerfulDigitSum(10), 45);
+```
+
+`powerfulDigitSum(50)` should return `406`.
+
+```js
+assert.strictEqual(powerfulDigitSum(50), 406);
+```
+
+`powerfulDigitSum(75)` should return `684`.
+
+```js
+assert.strictEqual(powerfulDigitSum(75), 684);
+```
+
+`powerfulDigitSum(100)` should return `972`.
+
+```js
+assert.strictEqual(powerfulDigitSum(100), 972);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerfulDigitSum(n) {
+
+  return true;
+}
+
+powerfulDigitSum(3);
+```
+
+# --solutions--
+
+```js
+function powerfulDigitSum(n) {
+  function sumDigitsOfPower(numA, numB) {
+    let digitsSum = 0;
+    let number = power(numA, numB);
+    while (number > 0n) {
+      const digit = number % 10n;
+      digitsSum += parseInt(digit, 10);
+      number = number / 10n;
+    }
+    return digitsSum;
+  }
+
+  function power(numA, numB) {
+    let sum = 1n;
+    for (let b = 0; b < numB; b++) {
+      sum = sum * BigInt(numA);
+    }
+    return sum;
+  }
+
+  const limit = n - 1;
+  let maxDigitsSum = 0;
+  for (let a = limit; a > 0; a--) {
+    for (let b = limit; b > 0; b--) {
+      const curDigitSum = sumDigitsOfPower(a, b);
+      if (curDigitSum > maxDigitsSum) {
+        maxDigitsSum = curDigitSum;
+      }
+    }
+  }
+  return maxDigitsSum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
new file mode 100644
index 0000000000..17103bc6fe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
@@ -0,0 +1,98 @@
+---
+id: 5900f3a51000cf542c50feb8
+title: 'Problem 57: Square root convergents'
+challengeType: 5
+forumTopicId: 302168
+dashedName: problem-57-square-root-convergents
+---
+
+# --description--
+
+It is possible to show that the square root of two can be expressed as an infinite continued fraction.
+
+<div style='text-align: center;'>$\sqrt 2 =1+ \frac 1 {2+ \frac 1 {2 +\frac 1 {2+ \dots}}}$</div>
+
+By expanding this for the first four iterations, we get:
+
+$1 + \\frac 1 2 = \\frac 32 = 1.5$
+
+$1 + \\frac 1 {2 + \\frac 1 2} = \\frac 7 5 = 1.4$
+
+$1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 2}} = \\frac {17}{12} = 1.41666 \\dots$
+
+$1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 {2+\\frac 1 2}}} = \\frac {41}{29} = 1.41379 \\dots$
+
+The next three expansions are $\\frac {99}{70}$, $\\frac {239}{169}$, and $\\frac {577}{408}$, but the eighth expansion, $\\frac {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 `n` expansions, how many fractions contain a numerator with more digits than denominator?
+
+# --hints--
+
+`squareRootConvergents(10)` should return a number.
+
+```js
+assert(typeof squareRootConvergents(10) === 'number');
+```
+
+`squareRootConvergents(10)` should return 1.
+
+```js
+assert.strictEqual(squareRootConvergents(10), 1);
+```
+
+`squareRootConvergents(100)` should return 15.
+
+```js
+assert.strictEqual(squareRootConvergents(100), 15);
+```
+
+`squareRootConvergents(1000)` should return 153.
+
+```js
+assert.strictEqual(squareRootConvergents(1000), 153);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function squareRootConvergents(n) {
+
+  return true;
+}
+
+squareRootConvergents(1000);
+```
+
+# --solutions--
+
+```js
+function squareRootConvergents(n) {
+  function countDigits(number) {
+    let counter = 0;
+    while (number > 0) {
+      counter++;
+      number = number / 10n;
+    }
+    return counter;
+  }
+
+  // Use BigInt as integer won't handle all cases
+  let numerator = 3n;
+  let denominator = 2n;
+  let moreDigitsInNumerator = 0;
+
+  for (let i = 2; i <= n; i++) {
+    [numerator, denominator] = [
+      numerator + 2n * denominator,
+      denominator + numerator
+    ];
+
+    if (countDigits(numerator) > countDigits(denominator)) {
+      moreDigitsInNumerator++;
+    }
+  }
+  return moreDigitsInNumerator;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
new file mode 100644
index 0000000000..29a3012e44
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
@@ -0,0 +1,105 @@
+---
+id: 5900f3a61000cf542c50feb9
+title: 'Problem 58: Spiral primes'
+challengeType: 5
+forumTopicId: 302169
+dashedName: problem-58-spiral-primes
+---
+
+# --description--
+
+Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.
+
+<div style='text-align: center;'>
+  <strong><span style='color: red;'>37</span></strong> 36 35 34 33 32 <strong><span style='color: red;'>31</span></strong><br>
+  38 <strong><span style='color: red;'>17</span></strong> 16 15 14 <strong><span style='color: red;'>13</span></strong> 30<br>
+  39 18  <strong><span style='color: red;'>5</span></strong>  4  <strong><span style='color: red;'>3</span></strong> 12 29<br>
+  40 19  6  1  2 11 28<br>
+  41 20  <strong><span style='color: red;'>7</span></strong>  8  9 10 27<br>
+  42 21 22 23 24 25 26<br>
+  <strong><span style='color: red;'>43</span></strong> 44 45 46 47 48 49<br>
+</div>
+
+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 percent of primes along both diagonals first falls below `percent`?
+
+# --hints--
+
+`spiralPrimes(50)` should return a number.
+
+```js
+assert(typeof spiralPrimes(50) === 'number');
+```
+
+`spiralPrimes(50)` should return `11`.
+
+```js
+assert.strictEqual(spiralPrimes(50), 11);
+```
+
+`spiralPrimes(15)` should return `981`.
+
+```js
+assert.strictEqual(spiralPrimes(15), 981);
+```
+
+`spiralPrimes(10)` should return `26241`.
+
+```js
+assert.strictEqual(spiralPrimes(10), 26241);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralPrimes(percent) {
+
+  return true;
+}
+
+spiralPrimes(50);
+```
+
+# --solutions--
+
+```js
+function spiralPrimes(percent) {
+  function isPrime(n) {
+    if (n <= 3) {
+      return n > 1;
+    } else if (n % 2 === 0 || n % 3 === 0) {
+      return false;
+    }
+
+    for (let i = 5; i * i <= n; i += 6) {
+      if (n % i === 0 || n % (i + 2) === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  let totalCount = 1;
+  let primesCount = 0;
+  let curNumber = 1;
+  let curSideLength = 1;
+  let ratio = 1;
+  const wantedRatio = percent / 100;
+
+  while (ratio >= wantedRatio) {
+    curSideLength += 2;
+    for (let i = 0; i < 4; i++) {
+      curNumber += curSideLength - 1;
+      totalCount++;
+      if (i !== 3 && isPrime(curNumber)) {
+        primesCount++;
+      }
+    }
+    ratio = primesCount / totalCount;
+  }
+  return curSideLength;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
new file mode 100644
index 0000000000..683db15249
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
@@ -0,0 +1,58 @@
+---
+id: 5900f3a81000cf542c50feba
+title: 'Problem 59: XOR decryption'
+challengeType: 5
+forumTopicId: 302170
+dashedName: problem-59-xor-decryption
+---
+
+# --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`, an array 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.
+
+# --hints--
+
+`XORDecryption(cipher)` should return a number.
+
+```js
+assert(typeof XORDecryption(cipher) === 'number');
+```
+
+`XORDecryption(cipher)` should return 129448.
+
+```js
+assert.strictEqual(XORDecryption(cipher), 129448);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function XORDecryption(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const cipher = [
+  36,22,80,0,0,4,23,25,19,17,88,4,4,19,21,11,88,22,23,23,29,69,12,24,0,88,25,11,12,2,10,28,5,6,12,25,10,22,80,10,30,80,10,22,21,69,23,22,69,61,5,9,29,2,66,11,80,8,23,3,17,88,19,0,20,21,7,10,17,17,29,20,69,8,17,21,29,2,22,84,80,71,60,21,69,11,5,8,21,25,22,88,3,0,10,25,0,10,5,8,88,2,0,27,25,21,10,31,6,25,2,16,21,82,69,35,63,11,88,4,13,29,80,22,13,29,22,88,31,3,88,3,0,10,25,0,11,80,10,30,80,23,29,19,12,8,2,10,27,17,9,11,45,95,88,57,69,16,17,19,29,80,23,29,19,0,22,4,9,1,80,3,23,5,11,28,92,69,9,5,12,12,21,69,13,30,0,0,0,0,27,4,0,28,28,28,84,80,4,22,80,0,20,21,2,25,30,17,88,21,29,8,2,0,11,3,12,23,30,69,30,31,23,88,4,13,29,80,0,22,4,12,10,21,69,11,5,8,88,31,3,88,4,13,17,3,69,11,21,23,17,21,22,88,65,69,83,80,84,87,68,69,83,80,84,87,73,69,83,80,84,87,65,83,88,91,69,29,4,6,86,92,69,15,24,12,27,24,69,28,21,21,29,30,1,11,80,10,22,80,17,16,21,69,9,5,4,28,2,4,12,5,23,29,80,10,30,80,17,16,21,69,27,25,23,27,28,0,84,80,22,23,80,17,16,17,17,88,25,3,88,4,13,29,80,17,10,5,0,88,3,16,21,80,10,30,80,17,16,25,22,88,3,0,10,25,0,11,80,12,11,80,10,26,4,4,17,30,0,28,92,69,30,2,10,21,80,12,12,80,4,12,80,10,22,19,0,88,4,13,29,80,20,13,17,1,10,17,17,13,2,0,88,31,3,88,4,13,29,80,6,17,2,6,20,21,69,30,31,9,20,31,18,11,94,69,54,17,8,29,28,28,84,80,44,88,24,4,14,21,69,30,31,16,22,20,69,12,24,4,12,80,17,16,21,69,11,5,8,88,31,3,88,4,13,17,3,69,11,21,23,17,21,22,88,25,22,88,17,69,11,25,29,12,24,69,8,17,23,12,80,10,30,80,17,16,21,69,11,1,16,25,2,0,88,31,3,88,4,13,29,80,21,29,2,12,21,21,17,29,2,69,23,22,69,12,24,0,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,67,80,10,10,80,7,1,80,21,13,4,17,17,30,2,88,4,13,29,80,22,13,29,69,23,22,69,12,24,12,11,80,22,29,2,12,29,3,69,29,1,16,25,28,69,12,31,69,11,92,69,17,4,69,16,17,22,88,4,13,29,80,23,25,4,12,23,80,22,9,2,17,80,70,76,88,29,16,20,4,12,8,28,12,29,20,69,26,9,69,11,80,17,23,80,84,88,31,3,88,4,13,29,80,21,29,2,12,21,21,17,29,2,69,12,31,69,12,24,0,88,20,12,25,29,0,12,21,23,86,80,44,88,7,12,20,28,69,11,31,10,22,80,22,16,31,18,88,4,13,25,4,69,12,24,0,88,3,16,21,80,10,30,80,17,16,25,22,88,3,0,10,25,0,11,80,17,23,80,7,29,80,4,8,0,23,23,8,12,21,17,17,29,28,28,88,65,75,78,68,81,65,67,81,72,70,83,64,68,87,74,70,81,75,70,81,67,80,4,22,20,69,30,2,10,21,80,8,13,28,17,17,0,9,1,25,11,31,80,17,16,25,22,88,30,16,21,18,0,10,80,7,1,80,22,17,8,73,88,17,11,28,80,17,16,21,11,88,4,4,19,25,11,31,80,17,16,21,69,11,1,16,25,2,0,88,2,10,23,4,73,88,4,13,29,80,11,13,29,7,29,2,69,75,94,84,76,65,80,65,66,83,77,67,80,64,73,82,65,67,87,75,72,69,17,3,69,17,30,1,29,21,1,88,0,23,23,20,16,27,21,1,84,80,18,16,25,6,16,80,0,0,0,23,29,3,22,29,3,69,12,24,0,88,0,0,10,25,8,29,4,0,10,80,10,30,80,4,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,86,80,35,23,28,9,23,7,12,22,23,69,25,23,4,17,30,69,12,24,0,88,3,4,21,21,69,11,4,0,8,3,69,26,9,69,15,24,12,27,24,69,49,80,13,25,20,69,25,2,23,17,6,0,28,80,4,12,80,17,16,25,22,88,3,16,21,92,69,49,80,13,25,6,0,88,20,12,11,19,10,14,21,23,29,20,69,12,24,4,12,80,17,16,21,69,11,5,8,88,31,3,88,4,13,29,80,22,29,2,12,29,3,69,73,80,78,88,65,74,73,70,69,83,80,84,87,72,84,88,91,69,73,95,87,77,70,69,83,80,84,87,70,87,77,80,78,88,21,17,27,94,69,25,28,22,23,80,1,29,0,0,22,20,22,88,31,11,88,4,13,29,80,20,13,17,1,10,17,17,13,2,0,88,31,3,88,4,13,29,80,6,17,2,6,20,21,75,88,62,4,21,21,9,1,92,69,12,24,0,88,3,16,21,80,10,30,80,17,16,25,22,88,29,16,20,4,12,8,28,12,29,20,69,26,9,69,65,64,69,31,25,19,29,3,69,12,24,0,88,18,12,9,5,4,28,2,4,12,21,69,80,22,10,13,2,17,16,80,21,23,7,0,10,89,69,23,22,69,12,24,0,88,19,12,10,19,16,21,22,0,10,21,11,27,21,69,23,22,69,12,24,0,88,0,0,10,25,8,29,4,0,10,80,10,30,80,4,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,86,80,36,22,20,69,26,9,69,11,25,8,17,28,4,10,80,23,29,17,22,23,30,12,22,23,69,49,80,13,25,6,0,88,28,12,19,21,18,17,3,0,88,18,0,29,30,69,25,18,9,29,80,17,23,80,1,29,4,0,10,29,12,22,21,69,12,24,0,88,3,16,21,3,69,23,22,69,12,24,0,88,3,16,26,3,0,9,5,0,22,4,69,11,21,23,17,21,22,88,25,11,88,7,13,17,19,13,88,4,13,29,80,0,0,0,10,22,21,11,12,3,69,25,2,0,88,21,19,29,30,69,22,5,8,26,21,23,11,94
+];
+
+XORDecryption(cipher);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
new file mode 100644
index 0000000000..ec60601f10
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
@@ -0,0 +1,78 @@
+---
+id: 5900f3721000cf542c50fe85
+title: 'Problem 6: Sum square difference'
+challengeType: 5
+forumTopicId: 302171
+dashedName: problem-6-sum-square-difference
+---
+
+# --description--
+
+The sum of the squares of the first ten natural numbers is,
+
+<div style='text-align: center;'>1<sup>2</sup> + 2<sup>2</sup> + ... + 10<sup>2</sup> = 385</div>
+
+The square of the sum of the first ten natural numbers is,
+
+<div style='text-align: center;'>(1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025</div>
+
+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 `n` natural numbers and the square of the sum.
+
+# --hints--
+
+`sumSquareDifference(10)` should return a number.
+
+```js
+assert(typeof sumSquareDifference(10) === 'number');
+```
+
+`sumSquareDifference(10)` should return 2640.
+
+```js
+assert.strictEqual(sumSquareDifference(10), 2640);
+```
+
+`sumSquareDifference(20)` should return 41230.
+
+```js
+assert.strictEqual(sumSquareDifference(20), 41230);
+```
+
+`sumSquareDifference(100)` should return 25164150.
+
+```js
+assert.strictEqual(sumSquareDifference(100), 25164150);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumSquareDifference(n) {
+
+  return true;
+}
+
+sumSquareDifference(100);
+```
+
+# --solutions--
+
+```js
+const sumSquareDifference = (number)=>{
+  let squareOfSum = Math.pow(sumOfArithmeticSeries(1,1,number),2);
+  let sumOfSquare = sumOfSquareOfNumbers(number);
+ return squareOfSum - sumOfSquare;
+}
+
+function sumOfArithmeticSeries(a,d,n){
+  return (n/2)*(2*a+(n-1)*d);
+}
+
+function sumOfSquareOfNumbers(n){
+ return (n*(n+1)*(2*n+1))/6;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
new file mode 100644
index 0000000000..5acc6c2176
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3a81000cf542c50febb
+title: 'Problem 60: Prime pair sets'
+challengeType: 5
+forumTopicId: 302172
+dashedName: problem-60-prime-pair-sets
+---
+
+# --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.
+
+# --hints--
+
+`primePairSets()` should return a number.
+
+```js
+assert(typeof primePairSets() === 'number');
+```
+
+`primePairSets()` should return 26033.
+
+```js
+assert.strictEqual(primePairSets(), 26033);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePairSets() {
+
+  return true;
+}
+
+primePairSets();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
new file mode 100644
index 0000000000..3f1e157026
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -0,0 +1,252 @@
+---
+id: 5900f3a91000cf542c50febc
+title: 'Problem 61: Cyclical figurate numbers'
+challengeType: 5
+forumTopicId: 302173
+dashedName: problem-61-cyclical-figurate-numbers
+---
+
+# --description--
+
+Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:
+
+| Type of Number | Formula                      | Sequence              |
+| -------------- | ---------------------------- | --------------------- |
+| Triangle       | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
+| Square         | $P_4(n) = n^2$               | 1, 4, 9, 16, 25, ...  |
+| Pentagonal     | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
+| Hexagonal      | $P_6(n) = n(2n−1)$           | 1, 6, 15, 28, 45, ... |
+| Heptagonal     | $P_7(n) = \frac{n(5n−3)}{2}$ | 1, 7, 18, 34, 55, ... |
+| Octagonal      | $P_8(n) = n(3n−2)$           | 1, 8, 21, 40, 65, ... |
+
+The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.
+
+1. 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).
+2. Each polygonal type: triangle ($P_3(127) = 8128$), square ($P_4(91) = 8281$), and pentagonal ($P_5(44) = 2882$), is represented by a different number in the set.
+3. This is the only set of 4-digit numbers with this property.
+
+Find the sum of all numbers in ordered sets of `n` cyclic 4-digit numbers for which each of the $P_3$ to $P_{n + 2}$ polygonal types, is represented by a different number in the set.
+
+# --hints--
+
+`cyclicalFigurateNums(3)` should return a number.
+
+```js
+assert(typeof cyclicalFigurateNums(3) === 'number');
+```
+
+`cyclicalFigurateNums(3)` should return `19291`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(3), 19291);
+```
+
+`cyclicalFigurateNums(4)` should return `28684`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(4), 28684);
+```
+
+`cyclicalFigurateNums(5)` should return `76255`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(5), 76255);
+```
+
+`cyclicalFigurateNums(6)` should return `28684`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(6), 28684);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cyclicalFigurateNums(n) {
+
+  return true;
+}
+
+cyclicalFigurateNums(3);
+```
+
+# --solutions--
+
+```js
+function cyclicalFigurateNums(n) {
+  function getChains(chain, n, numberTypes, numsExcludingLastNeededType) {
+    if (chain.length === n) {
+      return [chain];
+    }
+
+    const nextNumbers = getNextNumbersInChain(
+      chain[chain.length - 1],
+      numsExcludingLastNeededType
+    );
+
+    const chains = [];
+    for (let j = 0; j < nextNumbers.length; j++) {
+      const nextNumber = nextNumbers[j];
+      if (chain.indexOf(nextNumber) === -1) {
+        const nextChain = [...chain, nextNumber];
+        chains.push(
+          ...getChains(nextChain, n, numberTypes, numsExcludingLastNeededType)
+        );
+      }
+    }
+    return chains;
+  }
+
+  function getNextNumbersInChain(num, numsExcludingLastNeededType) {
+    const results = [];
+    const beginning = num % 100;
+    numsExcludingLastNeededType.forEach(number => {
+      if (Math.floor(number / 100) === beginning) {
+        results.push(number);
+      }
+    });
+    return results;
+  }
+
+  function fillNumberTypes(n, numberTypes, numsExcludingLastNeededType) {
+    const [, lastTypeCheck, lastTypeArr] = numberTypes[n - 1];
+
+    for (let i = 1000; i <= 9999; i++) {
+      for (let j = 0; j < n - 1; j++) {
+        const [, typeCheck, typeArr] = numberTypes[j];
+        if (typeCheck(i)) {
+          typeArr.push(i);
+          numsExcludingLastNeededType.add(i);
+        }
+      }
+
+      if (lastTypeCheck(i)) {
+        lastTypeArr.push(i);
+      }
+    }
+  }
+
+  function isCyclicalChain(chain, n, numberTypes) {
+    const numberTypesInChain = getNumberTypesInChain(chain, numberTypes);
+
+    if (!isChainAllowed(numberTypesInChain, n)) {
+      return false;
+    }
+
+    const isChainCyclic =
+      Math.floor(chain[0] / 100) === chain[chain.length - 1] % 100;
+    return isChainCyclic;
+  }
+
+  function getNumberTypesInChain(chain, numberTypes) {
+    const numbersInChain = {};
+    for (let i = 0; i < numberTypes.length; i++) {
+      const numberTypeName = numberTypes[i][0];
+      numbersInChain[numberTypeName] = [];
+    }
+
+    for (let i = 0; i < chain.length; i++) {
+      for (let j = 0; j < n; j++) {
+        const [typeName, , typeNumbers] = numberTypes[j];
+        const typeNumbersInChain = numbersInChain[typeName];
+        if (typeNumbers.indexOf(chain[i]) !== -1) {
+          typeNumbersInChain.push(chain[i]);
+        }
+      }
+    }
+    return numbersInChain;
+  }
+
+  function isChainAllowed(numberTypesInChain, n) {
+    for (let i = 0; i < n; i++) {
+      const typeName = numberTypes[i][0];
+      const isNumberWithTypeInChain = numberTypesInChain[typeName].length > 0;
+      if (!isNumberWithTypeInChain) {
+        return false;
+      }
+
+      for (let j = i + 1; j < n; j++) {
+        const otherTypeName = numberTypes[j][0];
+        if (
+          isNumberRepeatedAsOnlyNumberInTwoTypes(
+            numberTypesInChain[typeName],
+            numberTypesInChain[otherTypeName]
+          )
+        ) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+
+  function isNumberRepeatedAsOnlyNumberInTwoTypes(
+    typeNumbers,
+    otherTypeNumbers
+  ) {
+    return (
+      typeNumbers.length === 1 &&
+      otherTypeNumbers.length === 1 &&
+      typeNumbers[0] === otherTypeNumbers[0]
+    );
+  }
+
+  function isTriangle(num) {
+    return ((8 * num + 1) ** 0.5 - 1) % 2 === 0;
+  }
+
+  function isSquare(num) {
+    return num ** 0.5 === parseInt(num ** 0.5, 10);
+  }
+
+  function isPentagonal(num) {
+    return ((24 * num + 1) ** 0.5 + 1) % 6 === 0;
+  }
+
+  function isHexagonal(num) {
+    return ((8 * num + 1) ** 0.5 + 1) % 4 === 0;
+  }
+
+  function isHeptagonal(num) {
+    return ((40 * num + 9) ** 0.5 + 3) % 10 === 0;
+  }
+
+  function isOctagonal(num) {
+    return ((3 * num + 1) ** 0.5 + 1) % 3 === 0;
+  }
+
+  const numberTypes = [
+    ['triangle', isTriangle, []],
+    ['square', isSquare, []],
+    ['pentagonal', isPentagonal, []],
+    ['hexagonal', isHexagonal, []],
+    ['heptagonal', isHeptagonal, []],
+    ['octagonal', isOctagonal, []]
+  ];
+  const numsExcludingLastNeededType = new Set();
+  fillNumberTypes(n, numberTypes, numsExcludingLastNeededType);
+
+  const nNumberChains = [];
+  const [, , lastType] = numberTypes[n - 1];
+  for (let i = 0; i < lastType.length; i++) {
+    const startOfChain = lastType[i];
+    nNumberChains.push(
+      ...getChains([startOfChain], n, numberTypes, numsExcludingLastNeededType)
+    );
+  }
+
+  const cyclicalChains = nNumberChains.filter(chain =>
+    isCyclicalChain(chain, n, numberTypes)
+  );
+
+  let sum = 0;
+  for (let i = 0; i < cyclicalChains.length; i++) {
+    for (let j = 0; j < cyclicalChains[0].length; j++) {
+      sum += cyclicalChains[i][j];
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
new file mode 100644
index 0000000000..82294e0708
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
@@ -0,0 +1,97 @@
+---
+id: 5900f3aa1000cf542c50febd
+title: 'Problem 62: Cubic permutations'
+challengeType: 5
+forumTopicId: 302174
+dashedName: problem-62-cubic-permutations
+---
+
+# --description--
+
+The cube, 41063625 ($345^3$), can be permuted to produce two other cubes: 56623104 ($384^3$) and 66430125 ($405^3$). 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 `n` permutations of its digits are cube.
+
+# --hints--
+
+`cubicPermutations(2)` should return a number.
+
+```js
+assert(typeof cubicPermutations(2) === 'number');
+```
+
+`cubicPermutations(2)` should return `125`.
+
+```js
+assert.strictEqual(cubicPermutations(2), 125);
+```
+
+`cubicPermutations(3)` should return `41063625`.
+
+```js
+assert.strictEqual(cubicPermutations(3), 41063625);
+```
+
+`cubicPermutations(4)` should return `1006012008`.
+
+```js
+assert.strictEqual(cubicPermutations(4), 1006012008);
+```
+
+`cubicPermutations(5)` should return `127035954683`.
+
+```js
+assert.strictEqual(cubicPermutations(5), 127035954683);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cubicPermutations(n) {
+
+  return true;
+}
+
+cubicPermutations(2);
+```
+
+# --solutions--
+
+```js
+function cubicPermutations(n) {
+  function getDigits(num) {
+    const digits = [];
+    while (num > 0) {
+      digits.push(num % 10);
+      num = Math.floor(num / 10);
+    }
+    return digits;
+  }
+
+  function getCube(num) {
+    return num ** 3;
+  }
+
+  const digitsToCubeCounts = {};
+  let curNum = 1;
+  let digits;
+
+  while (!digitsToCubeCounts[digits] || digitsToCubeCounts[digits].count < n) {
+    const cube = getCube(curNum);
+    digits = getDigits(cube).sort().join();
+    if (!digitsToCubeCounts[digits]) {
+      digitsToCubeCounts[digits] = {
+        count: 1,
+        smallestCube: cube
+      };
+    } else {
+      digitsToCubeCounts[digits].count += 1;
+    }
+
+    curNum++;
+  }
+  return digitsToCubeCounts[digits].smallestCube;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
new file mode 100644
index 0000000000..02c9603685
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
@@ -0,0 +1,122 @@
+---
+id: 5900f3ab1000cf542c50febe
+title: 'Problem 63: Powerful digit counts'
+challengeType: 5
+forumTopicId: 302175
+dashedName: problem-63-powerful-digit-counts
+---
+
+# --description--
+
+The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.
+
+Complete the function so that it returns how many positive integers are of length `n` and an `n`th power.
+
+# --hints--
+
+`powerfulDigitCounts(1)` should return a number.
+
+```js
+assert(typeof powerfulDigitCounts(1) === 'number');
+```
+
+`powerfulDigitCounts(1)` should return `9`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(1), 9);
+```
+
+`powerfulDigitCounts(2)` should return `6`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(2), 6);
+```
+
+`powerfulDigitCounts(3)` should return `5`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(3), 5);
+```
+
+`powerfulDigitCounts(4)` should return `4`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(4), 4);
+```
+
+`powerfulDigitCounts(5)` should return `3`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(5), 3);
+```
+
+`powerfulDigitCounts(6)` should return `3`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(6), 3);
+```
+
+`powerfulDigitCounts(7)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(7), 2);
+```
+
+`powerfulDigitCounts(8)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(8), 2);
+```
+
+`powerfulDigitCounts(10)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(10), 2);
+```
+
+`powerfulDigitCounts(21)` should return `1`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(21), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerfulDigitCounts(n) {
+
+  return true;
+}
+
+powerfulDigitCounts(1);
+```
+
+# --solutions--
+
+```js
+function powerfulDigitCounts(n) {
+  function countDigits(num) {
+    let counter = 0;
+    while (num > 0) {
+      num = Math.floor(num / 10);
+      counter++;
+    }
+    return counter;
+  }
+
+  let numbersCount = 0;
+
+  let curNum = 1;
+  while (curNum < 10) {
+    let power = n;
+    if (power === countDigits(curNum ** power)) {
+      numbersCount++;
+    }
+    curNum++;
+  }
+
+  return numbersCount;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
new file mode 100644
index 0000000000..6cc017e1fb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -0,0 +1,148 @@
+---
+id: 5900f3ac1000cf542c50febf
+title: 'Problem 64: Odd period square roots'
+challengeType: 5
+forumTopicId: 302176
+dashedName: problem-64-odd-period-square-roots
+---
+
+# --description--
+
+All square roots are periodic when written as continued fractions and can be written in the form:
+
+$\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
+
+For example, let us consider $\\sqrt{23}:$:
+
+$\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
+
+If we continue we would get the following expansion:
+
+$\\displaystyle \\quad \\quad \\sqrt{23}=4+\\frac 1 {1+\\frac 1 {3+ \\frac 1 {1+\\frac 1 {8+ \\dots}}}}$
+
+The process can be summarized as follows:
+
+$\\quad \\quad a_0=4, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$
+
+$\\quad \\quad a_1=1, \\frac 7 {\\sqrt{23}-3}=\\frac {7(\\sqrt{23}+3)} {14}=3+\\frac {\\sqrt{23}-3} 2$
+
+$\\quad \\quad a_2=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\frac {\\sqrt{23}-4} 7$
+
+$\\quad \\quad a_3=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} 7=8+\\sqrt{23}-4$
+
+$\\quad \\quad a_4=8, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$
+
+$\\quad \\quad a_5=1, \\frac 7 {\\sqrt{23}-3}=\\frac {7 (\\sqrt{23}+3)} {14}=3+\\frac {\\sqrt{23}-3} 2$
+
+$\\quad \\quad a_6=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\frac {\\sqrt{23}-4} 7$
+
+$\\quad \\quad a_7=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} {7}=8+\\sqrt{23}-4$
+
+It can be seen that the sequence is repeating. For conciseness, we use the notation $\\sqrt{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:
+
+$\\quad \\quad \\sqrt{2}=\[1;(2)]$, period = 1
+
+$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, period = 2
+
+$\\quad \\quad \\sqrt{5}=\[2;(4)]$, period = 1
+
+$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, period = 2
+
+$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, period = 4
+
+$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, period = 2
+
+$\\quad \\quad \\sqrt{10}=\[3;(6)]$, period = 1
+
+$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, period = 2
+
+$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, period = 2
+
+$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, period = 5
+
+Exactly four continued fractions, for $N \\le 13$, have an odd period.
+
+How many continued fractions for $N \\le n$ have an odd period?
+
+# --hints--
+
+`oddPeriodSqrts(13)` should return a number.
+
+```js
+assert(typeof oddPeriodSqrts(13) === 'number');
+```
+
+`oddPeriodSqrts(500)` should return `83`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(500), 83);
+```
+
+`oddPeriodSqrts(1000)` should return `152`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(1000), 152);
+```
+
+`oddPeriodSqrts(5000)` should return `690`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(5000), 690);
+```
+
+`oddPeriodSqrts(10000)` should return `1322`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(10000), 1322);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function oddPeriodSqrts(n) {
+
+  return true;
+}
+
+oddPeriodSqrts(13);
+```
+
+# --solutions--
+
+```js
+function oddPeriodSqrts(n) {
+  // Based on https://www.mathblog.dk/project-euler-continued-fractions-odd-period/
+  function getPeriod(num) {
+    let period = 0;
+    let m = 0;
+    let d = 1;
+    let a = Math.floor(Math.sqrt(num));
+    const a0 = a;
+    while (2 * a0 !== a) {
+      m = d * a - m;
+      d = Math.floor((num - m ** 2) / d);
+      a = Math.floor((Math.sqrt(num) + m) / d);
+      period++;
+    }
+    return period;
+  }
+
+  function isPerfectSquare(num) {
+    return Number.isInteger(Math.sqrt(num));
+  }
+
+  let counter = 0;
+  for (let i = 2; i <= n; i++) {
+    if (!isPerfectSquare(i)) {
+      if (getPeriod(i) % 2 !== 0) {
+        counter++;
+      }
+    }
+  }
+  return counter;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
new file mode 100644
index 0000000000..7a1383a7f0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3ad1000cf542c50fec0
+title: 'Problem 65: Convergents of e'
+challengeType: 5
+forumTopicId: 302177
+dashedName: problem-65-convergents-of-e
+---
+
+# --description--
+
+The square root of 2 can be written as an infinite continued fraction.
+
+$\\sqrt{2} = 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + ...}}}}$
+
+The infinite continued fraction can be written, $\\sqrt{2} = \[1; (2)]$ indicates that 2 repeats *ad infinitum*. In a similar way, $\\sqrt{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 $\\sqrt{2}$.
+
+$1 + \\dfrac{1}{2} = \\dfrac{3}{2}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2}} = \\dfrac{7}{5}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}} = \\dfrac{17}{12}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}}} = \\dfrac{41}{29}$
+
+Hence the sequence of the first ten convergents for $\\sqrt{2}$ are:
+
+$1, \\dfrac{3}{2}, \\dfrac{7}{5}, \\dfrac{17}{12}, \\dfrac{41}{29}, \\dfrac{99}{70}, \\dfrac{239}{169}, \\dfrac{577}{408}, \\dfrac{1393}{985}, \\dfrac{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, \\dfrac{8}{3}, \\dfrac{11}{4}, \\dfrac{19}{7}, \\dfrac{87}{32}, \\dfrac{106}{39}, \\dfrac{193}{71}, \\dfrac{1264}{465}, \\dfrac{1457}{536}, ...$
+
+The sum of digits in the numerator of the 10<sup>th</sup> convergent is $1 + 4 + 5 + 7 = 17$.
+
+Find the sum of digits in the numerator of the `n`<sup>th</sup> convergent of the continued fraction for `e`.
+
+# --hints--
+
+`convergentsOfE(10)` should return a number.
+
+```js
+assert(typeof convergentsOfE(10) === 'number');
+```
+
+`convergentsOfE(10)` should return `17`.
+
+```js
+assert.strictEqual(convergentsOfE(10), 17);
+```
+
+`convergentsOfE(30)` should return `53`.
+
+```js
+assert.strictEqual(convergentsOfE(30), 53);
+```
+
+`convergentsOfE(50)` should return `91`.
+
+```js
+assert.strictEqual(convergentsOfE(50), 91);
+```
+
+`convergentsOfE(70)` should return `169`.
+
+```js
+assert.strictEqual(convergentsOfE(70), 169);
+```
+
+`convergentsOfE(100)` should return `272`.
+
+```js
+assert.strictEqual(convergentsOfE(100), 272);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convergentsOfE(n) {
+
+  return true;
+}
+
+convergentsOfE(10);
+```
+
+# --solutions--
+
+```js
+function convergentsOfE(n) {
+  function sumDigits(num) {
+    let sum = 0n;
+    while (num > 0) {
+      sum += num % 10n;
+      num = num / 10n;
+    }
+    return parseInt(sum);
+  }
+
+  // BigInt is needed for high convergents
+  let convergents = [
+    [2n, 1n],
+    [3n, 1n]
+  ];
+  const multipliers = [1n, 1n, 2n];
+  for (let i = 2; i < n; i++) {
+    const [secondLastConvergent, lastConvergent] = convergents;
+    const [secondLastNumerator, secondLastDenominator] = secondLastConvergent;
+    const [lastNumerator, lastDenominator] = lastConvergent;
+    const curMultiplier = multipliers[i % 3];
+
+    const numerator = secondLastNumerator + curMultiplier * lastNumerator;
+    const denominator = secondLastDenominator + curMultiplier * lastDenominator;
+
+    convergents = [lastConvergent, [numerator, denominator]]
+    if (i % 3 === 2) {
+      multipliers[2] += 2n;
+    }
+  }
+  return sumDigits(convergents[1][0]);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
new file mode 100644
index 0000000000..0eab98070b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
@@ -0,0 +1,129 @@
+---
+id: 5900f3ae1000cf542c50fec1
+title: 'Problem 66: Diophantine equation'
+challengeType: 5
+forumTopicId: 302178
+dashedName: problem-66-diophantine-equation
+---
+
+# --description--
+
+Consider quadratic Diophantine equations of the form:
+
+<div style='text-align: center;'>x<sup>2</sup> – Dy<sup>2</sup> = 1</div>
+
+For example, when D=13, the minimal solution in x is 649<sup>2</sup> – 13×180<sup>2</sup> = 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:
+
+<div style='margin-left: 2em;'>
+  3<sup>2</sup> – 2×2<sup>2</sup> = 1<br>
+  2<sup>2</sup> – 3×1<sup>2</sup> = 1<br>
+  <strong><span style='color: red;'>9</span></strong><sup>2</sup> – 5×4<sup>2</sup> = 1<br>
+  5<sup>2</sup> – 6×2<sup>2</sup> = 1<br>
+  8<sup>2</sup> – 7×3<sup>2</sup> = 1<br>
+</div>
+
+Hence, by considering minimal solutions in `x` for D ≤ 7, the largest `x` is obtained when D=5.
+
+Find the value of D ≤ `n` in minimal solutions of `x` for which the largest value of `x` is obtained.
+
+# --hints--
+
+`diophantineEquation(7)` should return a number.
+
+```js
+assert(typeof diophantineEquation(7) === 'number');
+```
+
+`diophantineEquation(7)` should return `5`.
+
+```
+assert.strictEqual(diophantineEquation(7), 5);
+```
+
+`diophantineEquation(100)` should return `61`.
+
+```
+assert.strictEqual(diophantineEquation(100), 61);
+```
+
+`diophantineEquation(409)` should return `409`.
+
+```
+assert.strictEqual(diophantineEquation(409), 409);
+```
+
+`diophantineEquation(500)` should return `421`.
+
+```
+assert.strictEqual(diophantineEquation(500), 421);
+```
+
+`diophantineEquation(1000)` should return `661`.
+
+```js
+assert.strictEqual(diophantineEquation(1000), 661);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineEquation(n) {
+
+  return true;
+}
+
+diophantineEquation(7);
+```
+
+# --solutions--
+
+```js
+function diophantineEquation(n) {
+  // Based on https://www.mathblog.dk/project-euler-66-diophantine-equation/
+  function isSolution(D, numerator, denominator) {
+    return numerator * numerator - BigInt(D) * denominator * denominator === 1n;
+  }
+
+  let result = 0;
+  let biggestX = 0;
+
+  for (let D = 2; D <= n; D++) {
+    let boundary = Math.floor(Math.sqrt(D));
+    if (boundary ** 2 === D) {
+      continue;
+    }
+
+    let m = 0n;
+    let d = 1n;
+    let a = BigInt(boundary);
+
+    let [numerator, prevNumerator] = [a, 1n];
+
+    let [denominator, prevDenominator] = [1n, 0n];
+
+    while (!isSolution(D, numerator, denominator)) {
+      m = d * a - m;
+      d = (BigInt(D) - m * m) / d;
+      a = (BigInt(boundary) + m) / d;
+
+      [numerator, prevNumerator] = [a * numerator + prevNumerator, numerator];
+      [denominator, prevDenominator] = [
+        a * denominator + prevDenominator,
+        denominator
+      ];
+    }
+
+    if (numerator > biggestX) {
+      biggestX = numerator;
+      result = D;
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
new file mode 100644
index 0000000000..9e1e818c9c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
@@ -0,0 +1,96 @@
+---
+id: 5900f3b01000cf542c50fec2
+title: 'Problem 67: Maximum path sum II'
+challengeType: 5
+forumTopicId: 302179
+dashedName: problem-67-maximum-path-sum-ii
+---
+
+# --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.
+
+<div style='text-align: center;'>
+  <strong style='color: red;'>3</strong><br>
+  <strong style='color: red;'>7</strong> 4<br>
+  2 <strong style='color: red;'>4</strong> 6<br>
+  8 5 <strong style='color: red;'>9</strong> 3
+</div>
+
+That is, 3 + 7 + 4 + 9 = 23.
+
+Find the maximum total from top to bottom in `numTriangle`, a 2D array defined in the background 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 2<sup>99</sup> altogether! If you could check one trillion (10<sup>12</sup>) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)
+
+# --hints--
+
+`maximumPathSumII(testTriangle)` should return a number.
+
+```js
+assert(typeof maximumPathSumII(_testTriangle) === 'number');
+```
+
+`maximumPathSumII(testTriangle)` should return 23.
+
+```js
+assert.strictEqual(maximumPathSumII(_testTriangle), 23);
+```
+
+`maximumPathSumII(numTriangle)` should return 7273.
+
+```js
+assert.strictEqual(maximumPathSumII(_numTriangle), 7273);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const _testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+const _numTriangle = [[59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[73,41,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,40,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[26,53,6,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[10,51,87,86,81,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[61,95,66,57,25,68,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,81,80,38,92,67,73,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[30,28,51,76,81,18,75,44,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[84,14,95,87,62,81,17,78,58,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[21,46,71,58,2,79,62,39,31,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[56,34,35,53,78,31,81,18,90,93,15,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[78,53,4,21,84,93,32,13,97,11,37,51,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[45,3,81,79,5,18,78,86,13,30,63,99,95,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[39,87,96,28,3,38,42,17,82,87,58,7,22,57,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[6,17,51,17,7,93,9,7,75,97,95,78,87,8,53,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[67,66,59,60,88,99,94,65,55,77,55,34,27,53,78,28,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[76,40,41,4,87,16,9,42,75,69,23,97,30,60,10,79,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[12,10,44,26,21,36,32,84,98,60,13,12,36,16,63,31,91,35,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[70,39,6,5,55,27,38,48,28,22,34,35,62,62,15,14,94,89,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,56,68,84,96,21,34,34,34,81,62,40,65,54,62,5,98,3,2,60,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[38,89,46,37,99,54,34,53,36,14,70,26,2,90,45,13,31,61,83,73,47,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[36,10,63,96,60,49,41,5,37,42,14,58,84,93,96,17,9,43,5,43,6,59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,57,87,57,61,28,37,51,84,73,79,15,39,95,88,87,43,39,11,86,77,74,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,42,5,79,30,49,99,73,46,37,50,2,45,9,54,52,27,95,27,65,19,45,26,45,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[71,39,17,78,76,29,52,90,18,99,78,19,35,62,71,19,23,65,93,85,49,33,75,9,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[33,24,47,61,60,55,32,88,57,55,91,54,46,57,7,77,98,52,80,99,24,25,46,78,79,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,9,13,55,10,67,26,78,76,82,63,49,51,31,24,68,5,57,7,54,69,21,67,43,17,63,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[24,59,6,8,98,74,66,26,61,60,13,3,9,9,24,30,71,8,88,70,72,70,29,90,11,82,41,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,82,67,4,36,60,92,77,91,85,62,49,59,61,30,90,29,94,26,41,89,4,53,22,83,41,9,74,90,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[48,28,26,37,28,52,77,26,51,32,18,98,79,36,62,13,17,8,19,54,89,29,73,68,42,14,8,16,70,37,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,60,69,70,72,71,9,59,13,60,38,13,57,36,9,30,43,89,30,39,15,2,44,73,5,73,26,63,56,86,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[55,55,85,50,62,99,84,77,28,85,3,21,27,22,19,26,82,69,54,4,13,7,85,14,1,15,70,59,89,95,10,19,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[4,9,31,92,91,38,92,86,98,75,21,5,64,42,62,84,36,20,73,42,21,23,22,51,51,79,25,45,85,53,3,43,22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[75,63,2,49,14,12,89,14,60,78,92,16,44,82,38,30,72,11,46,52,90,27,8,65,78,3,85,41,57,79,39,52,33,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[78,27,56,56,39,13,19,43,86,72,58,95,39,7,4,34,21,98,39,15,39,84,89,69,84,46,37,57,59,35,59,50,26,15,93,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[42,89,36,27,78,91,24,11,17,41,5,94,7,69,51,96,3,96,47,90,90,45,91,20,50,56,10,32,36,49,4,53,85,92,25,65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,9,61,30,61,97,66,21,96,92,98,90,6,34,96,60,32,69,68,33,75,84,18,31,71,50,84,63,3,3,19,11,28,42,75,45,45,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[61,31,61,68,96,34,49,39,5,71,76,59,62,67,6,47,96,99,34,21,32,47,52,7,71,60,42,72,94,56,82,83,84,40,94,87,82,46,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1,20,60,14,17,38,26,78,66,81,45,95,18,51,98,81,48,16,53,88,37,52,69,95,72,93,22,34,98,20,54,27,73,61,56,63,60,34,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[93,42,94,83,47,61,27,51,79,79,45,1,44,73,31,70,83,42,88,25,53,51,30,15,65,94,80,44,61,84,12,77,2,62,2,65,94,42,14,94,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[32,73,9,67,68,29,74,98,10,19,85,48,38,31,85,67,53,93,93,77,47,67,39,72,94,53,18,43,77,40,78,32,29,59,24,6,2,83,50,60,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[32,1,44,30,16,51,15,81,98,15,10,62,86,79,50,62,45,60,70,38,31,85,65,61,64,6,69,84,14,22,56,43,9,48,66,69,83,91,60,40,36,61,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,48,22,99,15,95,64,43,1,16,94,2,99,19,17,69,11,58,97,56,89,31,77,45,67,96,12,73,8,20,36,47,81,44,50,64,68,85,40,81,85,52,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[91,35,92,45,32,84,62,15,19,64,21,66,6,1,52,80,62,59,12,25,88,28,91,50,40,16,22,99,92,79,87,51,21,77,74,77,7,42,38,42,74,83,2,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[46,19,77,66,24,18,5,32,2,84,31,99,92,58,96,72,91,36,62,99,55,29,53,42,12,37,26,58,89,50,66,19,82,75,12,48,24,87,91,85,2,7,3,76,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[99,98,84,93,7,17,33,61,92,20,66,60,24,66,40,30,67,5,37,29,24,96,3,27,70,62,13,4,45,47,59,88,43,20,66,15,46,92,30,4,71,66,78,70,53,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[67,60,38,6,88,4,17,72,10,99,71,7,42,25,54,5,26,64,91,50,45,71,6,30,67,48,69,82,8,56,80,67,18,46,66,63,1,20,8,80,47,7,91,16,3,79,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[18,54,78,49,80,48,77,40,68,23,60,88,58,80,33,57,11,69,55,53,64,2,94,49,60,92,16,35,81,21,82,96,25,24,96,18,2,5,49,3,50,77,6,32,84,27,18,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[68,1,50,4,3,21,42,94,53,24,89,5,92,26,52,36,68,11,85,1,4,42,2,45,15,6,50,4,53,73,25,74,81,88,98,21,67,84,79,97,99,20,95,4,40,46,2,58,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[94,10,2,78,88,52,21,3,88,60,6,53,49,71,20,91,12,65,7,49,21,22,11,41,58,99,36,16,9,48,17,24,52,36,23,15,72,16,84,56,2,99,43,76,81,71,29,39,49,17,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[64,39,59,84,86,16,17,66,3,9,43,6,64,18,63,29,68,6,23,7,87,14,26,35,17,12,98,41,53,64,78,18,98,27,28,84,80,67,75,62,10,11,76,90,54,10,5,54,41,39,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[43,83,18,37,32,31,52,29,95,47,8,76,35,11,4,53,35,43,34,10,52,57,12,36,20,39,40,55,78,44,7,31,38,26,8,15,56,88,86,1,52,62,10,24,32,5,60,65,53,28,57,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,50,3,52,7,73,49,92,66,80,1,46,8,67,25,36,73,93,7,42,25,53,13,96,76,83,87,90,54,89,78,22,78,91,73,51,69,9,79,94,83,53,9,40,69,62,10,79,49,47,3,81,30,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[71,54,73,33,51,76,59,54,79,37,56,45,84,17,62,21,98,69,41,95,65,24,39,37,62,3,24,48,54,64,46,82,71,78,33,67,9,16,96,68,52,74,79,68,32,21,13,78,96,60,9,69,20,36,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[73,26,21,44,46,38,17,83,65,98,7,23,52,46,61,97,33,13,60,31,70,15,36,77,31,58,56,93,75,68,21,36,69,53,90,75,25,82,39,50,65,94,29,30,11,33,11,13,96,2,56,47,7,49,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[76,46,73,30,10,20,60,70,14,56,34,26,37,39,48,24,55,76,84,91,39,86,95,61,50,14,53,93,64,67,37,31,10,84,42,70,48,20,10,72,60,61,84,79,69,65,99,73,89,25,85,48,92,56,97,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,14,80,27,22,30,44,27,67,75,79,32,51,54,81,29,65,14,19,4,13,82,4,91,43,40,12,52,29,99,7,76,60,25,1,7,61,71,37,92,40,47,99,66,57,1,43,44,22,40,53,53,9,69,26,81,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[49,80,56,90,93,87,47,13,75,28,87,23,72,79,32,18,27,20,28,10,37,59,21,18,70,4,79,96,3,31,45,71,81,6,14,18,17,5,31,50,92,79,23,47,9,39,47,91,43,54,69,47,42,95,62,46,32,85,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,18,62,85,87,28,64,5,77,51,47,26,30,65,5,70,65,75,59,80,42,52,25,20,44,10,92,17,71,95,52,14,77,13,24,55,11,65,26,91,1,30,63,15,49,48,41,17,67,47,3,68,20,90,98,32,4,40,68,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,51,58,60,6,55,23,68,5,19,76,94,82,36,96,43,38,90,87,28,33,83,5,17,70,83,96,93,6,4,78,47,80,6,23,84,75,23,87,72,99,14,50,98,92,38,90,64,61,58,76,94,36,66,87,80,51,35,61,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[57,95,64,6,53,36,82,51,40,33,47,14,7,98,78,65,39,58,53,6,50,53,4,69,40,68,36,69,75,78,75,60,3,32,39,24,74,47,26,90,13,40,44,71,90,76,51,24,36,50,25,45,70,80,61,80,61,43,90,64,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[18,29,86,56,68,42,79,10,42,44,30,12,96,18,23,18,52,59,2,99,67,46,60,86,43,38,55,17,44,93,42,21,55,14,47,34,55,16,49,24,23,29,96,51,55,10,46,53,27,92,27,46,63,57,30,65,43,27,21,20,24,83,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[81,72,93,19,69,52,48,1,13,83,92,69,20,48,69,59,20,62,5,42,28,89,90,99,32,72,84,17,8,87,36,3,60,31,36,36,81,26,97,36,48,54,56,56,27,16,91,8,23,11,87,99,33,47,2,14,44,73,70,99,43,35,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,56,61,86,56,12,70,59,63,32,1,15,81,47,71,76,95,32,65,80,54,70,34,51,40,45,33,4,64,55,78,68,88,47,31,47,68,87,3,84,23,44,89,72,35,8,31,76,63,26,90,85,96,67,65,91,19,14,17,86,4,71,32,95,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,13,4,22,64,37,37,28,56,62,86,33,7,37,10,44,52,82,52,6,19,52,57,75,90,26,91,24,6,21,14,67,76,30,46,14,35,89,89,41,3,64,56,97,87,63,22,34,3,79,17,45,11,53,25,56,96,61,23,18,63,31,37,37,47,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[77,23,26,70,72,76,77,4,28,64,71,69,14,85,96,54,95,48,6,62,99,83,86,77,97,75,71,66,30,19,57,90,33,1,60,61,14,12,90,99,32,77,56,41,18,14,87,49,10,14,90,64,18,50,21,74,14,16,88,5,45,73,82,47,74,44,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[22,97,41,13,34,31,54,61,56,94,3,24,59,27,98,77,4,9,37,40,12,26,87,9,71,70,7,18,64,57,80,21,12,71,83,94,60,39,73,79,73,19,97,32,64,29,41,7,48,84,85,67,12,74,95,20,24,52,41,67,56,61,29,93,35,72,69,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[72,23,63,66,1,11,7,30,52,56,95,16,65,26,83,90,50,74,60,18,16,48,43,77,37,11,99,98,30,94,91,26,62,73,45,12,87,73,47,27,1,88,66,99,21,41,95,80,2,53,23,32,61,48,32,43,43,83,14,66,95,91,19,81,80,67,25,88,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[8,62,32,18,92,14,83,71,37,96,11,83,39,99,5,16,23,27,10,67,2,25,44,11,55,31,46,64,41,56,44,74,26,81,51,31,45,85,87,9,81,95,22,28,76,69,46,48,64,87,67,76,27,89,31,11,74,16,62,3,60,94,42,47,9,34,94,93,72,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[56,18,90,18,42,17,42,32,14,86,6,53,33,95,99,35,29,15,44,20,49,59,25,54,34,59,84,21,23,54,35,90,78,16,93,13,37,88,54,19,86,67,68,55,66,84,65,42,98,37,87,56,33,28,58,38,28,38,66,27,52,21,81,15,8,22,97,32,85,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[91,53,40,28,13,34,91,25,1,63,50,37,22,49,71,58,32,28,30,18,68,94,23,83,63,62,94,76,80,41,90,22,82,52,29,12,18,56,10,8,35,14,37,57,23,65,67,40,72,39,93,39,70,89,40,34,7,46,94,22,20,5,53,64,56,30,5,56,61,88,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[23,95,11,12,37,69,68,24,66,10,87,70,43,50,75,7,62,41,83,58,95,93,89,79,45,39,2,22,5,22,95,43,62,11,68,29,17,40,26,44,25,71,87,16,70,85,19,25,59,94,90,41,41,80,61,70,55,60,84,33,95,76,42,63,15,9,3,40,38,12,3,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,84,56,80,61,55,85,97,16,94,82,94,98,57,84,30,84,48,93,90,71,5,95,90,73,17,30,98,40,64,65,89,7,79,9,19,56,36,42,30,23,69,73,72,7,5,27,61,24,31,43,48,71,84,21,28,26,65,65,59,65,74,77,20,10,81,61,84,95,8,52,23,70,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[47,81,28,9,98,51,67,64,35,51,59,36,92,82,77,65,80,24,72,53,22,7,27,10,21,28,30,22,48,82,80,48,56,20,14,43,18,25,50,95,90,31,77,8,9,48,44,80,90,22,93,45,82,17,13,96,25,26,8,73,34,99,6,49,24,6,83,51,40,14,15,10,25,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,25,10,81,30,64,24,74,75,80,36,75,82,60,22,69,72,91,45,67,3,62,79,54,89,74,44,83,64,96,66,73,44,30,74,50,37,5,9,97,70,1,60,46,37,91,39,75,75,18,58,52,72,78,51,81,86,52,8,97,1,46,43,66,98,62,81,18,70,93,73,8,32,46,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[96,80,82,7,59,71,92,53,19,20,88,66,3,26,26,10,24,27,50,82,94,73,63,8,51,33,22,45,19,13,58,33,90,15,22,50,36,13,55,6,35,47,82,52,33,61,36,27,28,46,98,14,73,20,73,32,16,26,80,53,47,66,76,38,94,45,2,1,22,52,47,96,64,58,52,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[88,46,23,39,74,63,81,64,20,90,33,33,76,55,58,26,10,46,42,26,74,74,12,83,32,43,9,2,73,55,86,54,85,34,28,23,29,79,91,62,47,41,82,87,99,22,48,90,20,5,96,75,95,4,43,28,81,39,81,1,28,42,78,25,39,77,90,57,58,98,17,36,73,22,63,74,51,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[29,39,74,94,95,78,64,24,38,86,63,87,93,6,70,92,22,16,80,64,29,52,20,27,23,50,14,13,87,15,72,96,81,22,8,49,72,30,70,24,79,31,16,64,59,21,89,34,96,91,48,76,43,53,88,1,57,80,23,81,90,79,58,1,80,87,17,99,86,90,72,63,32,69,14,28,88,69,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,17,71,95,56,93,71,35,43,45,4,98,92,94,84,96,11,30,31,27,31,60,92,3,48,5,98,91,86,94,35,90,90,8,48,19,33,28,68,37,59,26,65,96,50,68,22,7,9,49,34,31,77,49,43,6,75,17,81,87,61,79,52,26,27,72,29,50,7,98,86,1,17,10,46,64,24,18,56,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[51,30,25,94,88,85,79,91,40,33,63,84,49,67,98,92,15,26,75,19,82,5,18,78,65,93,61,48,91,43,59,41,70,51,22,15,92,81,67,91,46,98,11,11,65,31,66,10,98,65,83,21,5,56,5,98,73,67,46,74,69,34,8,30,5,52,7,98,32,95,30,94,65,50,24,63,28,81,99,57,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[19,23,61,36,9,89,71,98,65,17,30,29,89,26,79,74,94,11,44,48,97,54,81,55,39,66,69,45,28,47,13,86,15,76,74,70,84,32,36,33,79,20,78,14,41,47,89,28,81,5,99,66,81,86,38,26,6,25,13,60,54,55,23,53,27,5,89,25,23,11,13,54,59,54,56,34,16,24,53,44,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[13,40,57,72,21,15,60,8,4,19,11,98,34,45,9,97,86,71,3,15,56,19,15,44,97,31,90,4,87,87,76,8,12,30,24,62,84,28,12,85,82,53,99,52,13,94,6,65,97,86,9,50,94,68,69,74,30,67,87,94,63,7,78,27,80,36,69,41,6,92,32,78,37,82,30,5,18,87,99,72,19,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[44,20,55,77,69,91,27,31,28,81,80,27,2,7,97,23,95,98,12,25,75,29,47,71,7,47,78,39,41,59,27,76,13,15,66,61,68,35,69,86,16,53,67,63,99,85,41,56,8,28,33,40,94,76,90,85,31,70,24,65,84,65,99,82,19,25,54,37,21,46,33,2,52,99,51,33,26,4,87,2,8,18,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,42,61,45,91,6,64,79,80,82,32,16,83,63,42,49,19,78,65,97,40,42,14,61,49,34,4,18,25,98,59,30,82,72,26,88,54,36,21,75,3,88,99,53,46,51,55,78,22,94,34,40,68,87,84,25,30,76,25,8,92,84,42,61,40,38,9,99,40,23,29,39,46,55,10,90,35,84,56,70,63,23,91,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,92,3,71,89,7,9,37,68,66,58,20,44,92,51,56,13,71,79,99,26,37,2,6,16,67,36,52,58,16,79,73,56,60,59,27,44,77,94,82,20,50,98,33,9,87,94,37,40,83,64,83,58,85,17,76,53,2,83,52,22,27,39,20,48,92,45,21,9,42,24,23,12,37,52,28,50,78,79,20,86,62,73,20,59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,96,80,15,91,90,99,70,10,9,58,90,93,50,81,99,54,38,36,10,30,11,35,84,16,45,82,18,11,97,36,43,96,79,97,65,40,48,23,19,17,31,64,52,65,65,37,32,65,76,99,79,34,65,79,27,55,33,3,1,33,27,61,28,66,8,4,70,49,46,48,83,1,45,19,96,13,81,14,21,31,79,93,85,50,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,92,48,84,59,98,31,53,23,27,15,22,79,95,24,76,5,79,16,93,97,89,38,89,42,83,2,88,94,95,82,21,1,97,48,39,31,78,9,65,50,56,97,61,1,7,65,27,21,23,14,15,80,97,44,78,49,35,33,45,81,74,34,5,31,57,9,38,94,7,69,54,69,32,65,68,46,68,78,90,24,28,49,51,45,86,35,0,0,0,0,0,0,0,0,0,0,0,0,0],[41,63,89,76,87,31,86,9,46,14,87,82,22,29,47,16,13,10,70,72,82,95,48,64,58,43,13,75,42,69,21,12,67,13,64,85,58,23,98,9,37,76,5,22,31,12,66,50,29,99,86,72,45,25,10,28,19,6,90,43,29,31,67,79,46,25,74,14,97,35,76,37,65,46,23,82,6,22,30,76,93,66,94,17,96,13,20,72,0,0,0,0,0,0,0,0,0,0,0,0],[63,40,78,8,52,9,90,41,70,28,36,14,46,44,85,96,24,52,58,15,87,37,5,98,99,39,13,61,76,38,44,99,83,74,90,22,53,80,56,98,30,51,63,39,44,30,91,91,4,22,27,73,17,35,53,18,35,45,54,56,27,78,48,13,69,36,44,38,71,25,30,56,15,22,73,43,32,69,59,25,93,83,45,11,34,94,44,39,92,0,0,0,0,0,0,0,0,0,0,0],[12,36,56,88,13,96,16,12,55,54,11,47,19,78,17,17,68,81,77,51,42,55,99,85,66,27,81,79,93,42,65,61,69,74,14,1,18,56,12,1,58,37,91,22,42,66,83,25,19,4,96,41,25,45,18,69,96,88,36,93,10,12,98,32,44,83,83,4,72,91,4,27,73,7,34,37,71,60,59,31,1,54,54,44,96,93,83,36,4,45,0,0,0,0,0,0,0,0,0,0],[30,18,22,20,42,96,65,79,17,41,55,69,94,81,29,80,91,31,85,25,47,26,43,49,2,99,34,67,99,76,16,14,15,93,8,32,99,44,61,77,67,50,43,55,87,55,53,72,17,46,62,25,50,99,73,5,93,48,17,31,70,80,59,9,44,59,45,13,74,66,58,94,87,73,16,14,85,38,74,99,64,23,79,28,71,42,20,37,82,31,23,0,0,0,0,0,0,0,0,0],[51,96,39,65,46,71,56,13,29,68,53,86,45,33,51,49,12,91,21,21,76,85,2,17,98,15,46,12,60,21,88,30,92,83,44,59,42,50,27,88,46,86,94,73,45,54,23,24,14,10,94,21,20,34,23,51,4,83,99,75,90,63,60,16,22,33,83,70,11,32,10,50,29,30,83,46,11,5,31,17,86,42,49,1,44,63,28,60,7,78,95,40,0,0,0,0,0,0,0,0],[44,61,89,59,4,49,51,27,69,71,46,76,44,4,9,34,56,39,15,6,94,91,75,90,65,27,56,23,74,6,23,33,36,69,14,39,5,34,35,57,33,22,76,46,56,10,61,65,98,9,16,69,4,62,65,18,99,76,49,18,72,66,73,83,82,40,76,31,89,91,27,88,17,35,41,35,32,51,32,67,52,68,74,85,80,57,7,11,62,66,47,22,67,0,0,0,0,0,0,0],[65,37,19,97,26,17,16,24,24,17,50,37,64,82,24,36,32,11,68,34,69,31,32,89,79,93,96,68,49,90,14,23,4,4,67,99,81,74,70,74,36,96,68,9,64,39,88,35,54,89,96,58,66,27,88,97,32,14,6,35,78,20,71,6,85,66,57,2,58,91,72,5,29,56,73,48,86,52,9,93,22,57,79,42,12,1,31,68,17,59,63,76,7,77,0,0,0,0,0,0],[73,81,14,13,17,20,11,9,1,83,8,85,91,70,84,63,62,77,37,7,47,1,59,95,39,69,39,21,99,9,87,2,97,16,92,36,74,71,90,66,33,73,73,75,52,91,11,12,26,53,5,26,26,48,61,50,90,65,1,87,42,47,74,35,22,73,24,26,56,70,52,5,48,41,31,18,83,27,21,39,80,85,26,8,44,2,71,7,63,22,5,52,19,8,20,0,0,0,0,0],[17,25,21,11,72,93,33,49,64,23,53,82,3,13,91,65,85,2,40,5,42,31,77,42,5,36,6,54,4,58,7,76,87,83,25,57,66,12,74,33,85,37,74,32,20,69,3,97,91,68,82,44,19,14,89,28,85,85,80,53,34,87,58,98,88,78,48,65,98,40,11,57,10,67,70,81,60,79,74,72,97,59,79,47,30,20,54,80,89,91,14,5,33,36,79,39,0,0,0,0],[60,85,59,39,60,7,57,76,77,92,6,35,15,72,23,41,45,52,95,18,64,79,86,53,56,31,69,11,91,31,84,50,44,82,22,81,41,40,30,42,30,91,48,94,74,76,64,58,74,25,96,57,14,19,3,99,28,83,15,75,99,1,89,85,79,50,3,95,32,67,44,8,7,41,62,64,29,20,14,76,26,55,48,71,69,66,19,72,44,25,14,1,48,74,12,98,7,0,0,0],[64,66,84,24,18,16,27,48,20,14,47,69,30,86,48,40,23,16,61,21,51,50,26,47,35,33,91,28,78,64,43,68,4,79,51,8,19,60,52,95,6,68,46,86,35,97,27,58,4,65,30,58,99,12,12,75,91,39,50,31,42,64,70,4,46,7,98,73,98,93,37,89,77,91,64,71,64,65,66,21,78,62,81,74,42,20,83,70,73,95,78,45,92,27,34,53,71,15,0,0],[30,11,85,31,34,71,13,48,5,14,44,3,19,67,23,73,19,57,6,90,94,72,57,69,81,62,59,68,88,57,55,69,49,13,7,87,97,80,89,5,71,5,5,26,38,40,16,62,45,99,18,38,98,24,21,26,62,74,69,4,85,57,77,35,58,67,91,79,79,57,86,28,66,34,72,51,76,78,36,95,63,90,8,78,47,63,45,31,22,70,52,48,79,94,15,77,61,67,68,0],[23,33,44,81,80,92,93,75,94,88,23,61,39,76,22,3,28,94,32,6,49,65,41,34,18,23,8,47,62,60,3,63,33,13,80,52,31,54,73,43,70,26,16,69,57,87,83,31,3,93,70,81,47,95,77,44,29,68,39,51,56,59,63,7,25,70,7,77,43,53,64,3,94,42,95,39,18,1,66,21,16,97,20,50,90,16,70,10,95,69,29,6,25,61,41,26,15,59,63,35]];
+```
+
+## --seed-contents--
+
+```js
+function maximumPathSumII(triangle) {
+
+  return true;
+}
+
+const testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+
+maximumPathSumII(testTriangle);
+```
+
+# --solutions--
+
+```js
+function maximumPathSumII(triangle) {
+  const newTriangle = [];
+  for (let i = 0; i < triangle.length; i++) {
+    newTriangle.push(triangle[i].slice());
+  }
+
+  for (let i = newTriangle.length - 2; i >= 0; i--) {
+    for (let j = i; j >= 0; j--) {
+      let higherOption = 0;
+      if (newTriangle[i + 1][j + 1] > newTriangle[i + 1][j]) {
+        higherOption = newTriangle[i + 1][j + 1];
+      } else {
+        higherOption = newTriangle[i + 1][j];
+      }
+      newTriangle[i][j] += higherOption;
+    }
+  }
+  return newTriangle[0][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
new file mode 100644
index 0000000000..1492709e24
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -0,0 +1,71 @@
+---
+id: 5900f3b01000cf542c50fec3
+title: 'Problem 68: Magic 5-gon ring'
+challengeType: 5
+forumTopicId: 302180
+dashedName: problem-68-magic-5-gon-ring
+---
+
+# --description--
+
+Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.
+
+<img class="img-responsive center-block" alt="a completed example of a 3-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;">
+
+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.
+
+<div style='text-align: center;'>
+
+| <div style='width: 100px;'>Total</div> | <div style='width: 250px;'>Solution Set</div> |
+| -------------------------------------- | --------------------------------------------- |
+| 9                                      | 4,2,3; 5,3,1; 6,1,2                           |
+| 9                                      | 4,3,2; 6,2,1; 5,1,3                           |
+| 10                                     | 2,3,5; 4,5,1; 6,1,3                           |
+| 10                                     | 2,5,3; 6,3,1; 4,1,5                           |
+| 11                                     | 1,4,6; 3,6,2; 5,2,4                           |
+| 11                                     | 1,6,4; 5,4,2; 3,2,6                           |
+| 12                                     | 1,5,6; 2,6,4; 3,4,5                           |
+| 12                                     | 1,6,5; 3,5,4; 2,4,6                           |
+
+</div>
+
+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?
+
+<img class="img-responsive center-block" alt="a blank diagram of a 5-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;">
+
+# --hints--
+
+`magic5GonRing()` should return a number.
+
+```js
+assert(typeof magic5GonRing() === 'number');
+```
+
+`magic5GonRing()` should return 6531031914842725.
+
+```js
+assert.strictEqual(magic5GonRing(), 6531031914842725);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function magic5GonRing() {
+
+  return true;
+}
+
+magic5GonRing();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
new file mode 100644
index 0000000000..2e538e324d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3b11000cf542c50fec4
+title: 'Problem 69: Totient maximum'
+challengeType: 5
+forumTopicId: 302181
+dashedName: problem-69-totient-maximum
+---
+
+# --description--
+
+Euler's Totient function, ${\phi}(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, ${\phi}(9) = 6$.
+
+<div style='margin-left: 4em;'>
+
+| $n$ | $\text{Relatively Prime}$ | $\displaystyle{\phi}(n)$ | $\displaystyle\frac{n}{{\phi}(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                                |
+
+</div>
+
+It can be seen that `n` = 6 produces a maximum $\displaystyle\frac{n}{{\phi}(n)}$ for `n` ≤ 10.
+
+Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ is a maximum.
+
+# --hints--
+
+`totientMaximum(10)` should return a number.
+
+```js
+assert(typeof totientMaximum(10) === 'number');
+```
+
+`totientMaximum(10)` should return `6`.
+
+```js
+assert.strictEqual(totientMaximum(10), 6);
+```
+
+`totientMaximum(10000)` should return `2310`.
+
+```js
+assert.strictEqual(totientMaximum(10000), 2310);
+```
+
+`totientMaximum(500000)` should return `30030`.
+
+```js
+assert.strictEqual(totientMaximum(500000), 30030);
+```
+
+`totientMaximum(1000000)` should return `510510`.
+
+```js
+assert.strictEqual(totientMaximum(1000000), 510510);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function totientMaximum(limit) {
+
+  return true;
+}
+
+totientMaximum(10);
+```
+
+# --solutions--
+
+```js
+function totientMaximum(limit) {
+  function getSievePrimes(max) {
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+    const primes = [];
+    for (let i = 2; i < max; i = i + 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j = j + i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  const MAX_PRIME = 50;
+  const primes = getSievePrimes(MAX_PRIME);
+  let result = 1;
+
+  for (let i = 0; result * primes[i] < limit; i++) {
+    result *= primes[i];
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
new file mode 100644
index 0000000000..18b18b2bf1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
@@ -0,0 +1,86 @@
+---
+id: 5900f3731000cf542c50fe86
+title: 'Problem 7: 10001st prime'
+challengeType: 5
+forumTopicId: 302182
+dashedName: problem-7-10001st-prime
+---
+
+# --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 `n`th prime number?
+
+# --hints--
+
+`nthPrime(6)` should return a number.
+
+```js
+assert(typeof nthPrime(6) === 'number');
+```
+
+`nthPrime(6)` should return 13.
+
+```js
+assert.strictEqual(nthPrime(6), 13);
+```
+
+`nthPrime(10)` should return 29.
+
+```js
+assert.strictEqual(nthPrime(10), 29);
+```
+
+`nthPrime(100)` should return 541.
+
+```js
+assert.strictEqual(nthPrime(100), 541);
+```
+
+`nthPrime(1000)` should return 7919.
+
+```js
+assert.strictEqual(nthPrime(1000), 7919);
+```
+
+`nthPrime(10001)` should return 104743.
+
+```js
+assert.strictEqual(nthPrime(10001), 104743);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nthPrime(n) {
+
+  return true;
+}
+
+nthPrime(10001);
+```
+
+# --solutions--
+
+```js
+const nthPrime = n => {
+  let pN = 2;
+  let step = 0;
+  while (step < n) {
+    let isPrime = true;
+    let rootN = Math.sqrt(pN);
+    for (let i = 2; i <= rootN; i++) {
+      if (!(pN % i)) {
+        isPrime = false;
+        break;
+      }
+    }
+    isPrime ? step++ : '';
+    pN++;
+  }
+  return pN - 1;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
new file mode 100644
index 0000000000..09c3e10628
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
@@ -0,0 +1,118 @@
+---
+id: 5900f3b21000cf542c50fec5
+title: 'Problem 70: Totient permutation'
+challengeType: 5
+forumTopicId: 302183
+dashedName: problem-70-totient-permutation
+---
+
+# --description--
+
+Euler's Totient function, ${\phi}(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, ${\phi}(9) = 6$. The number 1 is considered to be relatively prime to every positive number, so ${\phi}(1) = 1$.
+
+Interestingly, ${\phi}(87109) = 79180$, and it can be seen that 87109 is a permutation of 79180.
+
+Find the value of `n`, 1 &lt; `n` &lt; `limit`, for which ${\phi}(n)$ is a permutation of `n` and the ratio $\displaystyle\frac{n}{{\phi}(n)}$ produces a minimum.
+
+# --hints--
+
+`totientPermutation(10000)` should return a number.
+
+```js
+assert(typeof totientPermutation(10000) === 'number');
+```
+
+`totientPermutation(10000)` should return `4435`.
+
+```js
+assert.strictEqual(totientPermutation(10000), 4435);
+```
+
+`totientPermutation(100000)` should return `75841`.
+
+```js
+assert.strictEqual(totientPermutation(100000), 75841);
+```
+
+`totientPermutation(500000)` should return `474883`.
+
+```js
+assert.strictEqual(totientPermutation(500000), 474883);
+```
+
+`totientPermutation(10000000)` should return `8319823`.
+
+```js
+assert.strictEqual(totientPermutation(10000000), 8319823);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function totientPermutation(limit) {
+
+  return true;
+}
+
+totientPermutation(10000);
+```
+
+# --solutions--
+
+```js
+function totientPermutation(limit) {
+  function getSievePrimes(max) {
+    const primes = [];
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+
+    for (let i = 2; i < max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j += i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  function sortDigits(number) {
+    return number.toString().split('').sort().join('');
+  }
+
+  function isPermutation(numberA, numberB) {
+    return sortDigits(numberA) === sortDigits(numberB);
+  }
+
+  const MAX_PRIME = 4000;
+  const primes = getSievePrimes(MAX_PRIME);
+
+  let nValue = 1;
+  let minRatio = Infinity;
+
+  for (let i = 1; i < primes.length; i++) {
+    for (let j = i + 1; j < primes.length; j++) {
+      const num = primes[i] * primes[j];
+      if (num > limit) {
+        break;
+      }
+
+      const phi = (primes[i] - 1) * (primes[j] - 1);
+      const ratio = num / phi;
+
+      if (minRatio > ratio && isPermutation(num, phi)) {
+        nValue = num;
+        minRatio = ratio;
+      }
+    }
+  }
+  return nValue;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
new file mode 100644
index 0000000000..55a2e9b72f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
@@ -0,0 +1,95 @@
+---
+id: 5900f3b31000cf542c50fec6
+title: 'Problem 71: Ordered fractions'
+challengeType: 5
+forumTopicId: 302184
+dashedName: problem-71-ordered-fractions
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${{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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{\textbf2}{\textbf5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$
+
+It can be seen that $\frac{2}{5}$ is the fraction immediately to the left of $\frac{3}{7}$.
+
+By listing the set of reduced proper fractions for `d` ≤ `limit` in ascending order of size, find the numerator of the fraction immediately to the left of $\frac{3}{7}$.
+
+# --hints--
+
+`orderedFractions(8)` should return a number.
+
+```js
+assert(typeof orderedFractions(8) === 'number');
+```
+
+`orderedFractions(8)` should return `2`.
+
+```js
+assert.strictEqual(orderedFractions(8), 2);
+```
+
+`orderedFractions(10)` should return `2`.
+
+```js
+assert.strictEqual(orderedFractions(10), 2);
+```
+
+`orderedFractions(9994)` should return `4283`.
+
+```js
+assert.strictEqual(orderedFractions(9994), 4283);
+```
+
+`orderedFractions(500000)` should return `214283`.
+
+```js
+assert.strictEqual(orderedFractions(500000), 214283);
+```
+
+`orderedFractions(1000000)` should return `428570`.
+
+```js
+assert.strictEqual(orderedFractions(1000000), 428570);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function orderedFractions(limit) {
+
+  return true;
+}
+
+orderedFractions(8);
+```
+
+# --solutions--
+
+```js
+function orderedFractions(limit) {
+  const fractions = [];
+  const fractionValues = {};
+  const highBoundary = 3 / 7;
+  let lowBoundary = 2 / 7;
+
+  for (let denominator = limit; denominator > 2; denominator--) {
+    let numerator = Math.floor((3 * denominator - 1) / 7);
+    let value = numerator / denominator;
+    if (value > highBoundary || value < lowBoundary) {
+      continue;
+    }
+    fractionValues[value] = [numerator, denominator];
+    fractions.push(value);
+    lowBoundary = value;
+  }
+
+  fractions.sort();
+  return fractionValues[fractions[fractions.length - 1]][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
new file mode 100644
index 0000000000..3929bde7af
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
@@ -0,0 +1,90 @@
+---
+id: 5900f3b41000cf542c50fec7
+title: 'Problem 72: Counting fractions'
+challengeType: 5
+forumTopicId: 302185
+dashedName: problem-72-counting-fractions
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{2}{5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{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` ≤ `limit`?
+
+# --hints--
+
+`countingFractions(8)` should return a number.
+
+```js
+assert(typeof countingFractions(8) === 'number');
+```
+
+`countingFractions(8)` should return `21`.
+
+```js
+assert.strictEqual(countingFractions(8), 21);
+```
+
+`countingFractions(20000)` should return `121590395`.
+
+```js
+assert.strictEqual(countingFractions(20000), 121590395);
+```
+
+`countingFractions(500000)` should return `75991039675`.
+
+```js
+assert.strictEqual(countingFractions(500000), 75991039675);
+```
+
+`countingFractions(1000000)` should return `303963552391`.
+
+```js
+assert.strictEqual(countingFractions(1000000), 303963552391);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingFractions(limit) {
+
+  return true;
+}
+
+countingFractions(8);
+```
+
+# --solutions--
+
+```js
+function countingFractions(limit) {
+  const phi = {};
+  let count = 0;
+
+  for (let i = 2; i <= limit; i++) {
+    if (!phi[i]) {
+      phi[i] = i;
+    }
+    if (phi[i] === i) {
+      for (let j = i; j <= limit; j += i) {
+        if (!phi[j]) {
+          phi[j] = j;
+        }
+        phi[j] = (phi[j] / i) * (i - 1);
+      }
+    }
+    count += phi[i];
+  }
+
+  return count;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
new file mode 100644
index 0000000000..10c1ae6ea8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3b61000cf542c50fec8
+title: 'Problem 73: Counting fractions in a range'
+challengeType: 5
+forumTopicId: 302186
+dashedName: problem-73-counting-fractions-in-a-range
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \mathbf{\frac{3}{8}, \frac{2}{5}, \frac{3}{7}}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$
+
+It can be seen that there are `3` fractions between $\frac{1}{3}$ and $\frac{1}{2}$.
+
+How many fractions lie between $\frac{1}{3}$ and $\frac{1}{2}$ in the sorted set of reduced proper fractions for `d` ≤ `limit`?
+
+# --hints--
+
+`countingFractionsInARange(8)` should return a number.
+
+```js
+assert(typeof countingFractionsInARange(8) === 'number');
+```
+
+`countingFractionsInARange(8)` should return `3`.
+
+```js
+assert.strictEqual(countingFractionsInARange(8), 3);
+```
+
+`countingFractionsInARange(1000)` should return `50695`.
+
+```js
+assert.strictEqual(countingFractionsInARange(1000), 50695);
+```
+
+`countingFractionsInARange(6000)` should return `1823861`.
+
+```js
+assert.strictEqual(countingFractionsInARange(6000), 1823861);
+```
+
+`countingFractionsInARange(12000)` should return `7295372`.
+
+```js
+assert.strictEqual(countingFractionsInARange(12000), 7295372);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingFractionsInARange(limit) {
+
+  return true;
+}
+
+countingFractionsInARange(8);
+```
+
+# --solutions--
+
+```js
+function countingFractionsInARange(limit) {
+  let result = 0;
+  const stack = [[3, 2]];
+  while (stack.length > 0) {
+    const [startDenominator, endDenominator] = stack.pop();
+    const curDenominator = startDenominator + endDenominator;
+    if (curDenominator <= limit) {
+      result++;
+      stack.push([startDenominator, curDenominator]);
+      stack.push([curDenominator, endDenominator]);
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
new file mode 100644
index 0000000000..f8645892aa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -0,0 +1,131 @@
+---
+id: 5900f3b61000cf542c50fec9
+title: 'Problem 74: Digit factorial chains'
+challengeType: 5
+forumTopicId: 302187
+dashedName: problem-74-digit-factorial-chains
+---
+
+# --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:
+
+$$\begin{align}
+&169 → 363601 → 1454 → 169\\\\
+&871 → 45361 → 871\\\\
+&872 → 45362 → 872\\\\
+\end{align}$$
+
+It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
+
+$$\begin{align}
+&69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\
+&78 → 45360 → 871 → 45361\\ (→ 871)\\\\
+&540 → 145\\ (→ 145)\\\\
+\end{align}$$
+
+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 `n`, contain exactly sixty non-repeating terms?
+
+# --hints--
+
+`digitFactorialChains(2000)` should return a number.
+
+```js
+assert(typeof digitFactorialChains(2000) === 'number');
+```
+
+`digitFactorialChains(2000)` should return `6`.
+
+```js
+assert.strictEqual(digitFactorialChains(2000), 6);
+```
+
+`digitFactorialChains(100000)` should return `42`.
+
+```js
+assert.strictEqual(digitFactorialChains(100000), 42);
+```
+
+`digitFactorialChains(500000)` should return `282`.
+
+```js
+assert.strictEqual(digitFactorialChains(500000), 282);
+```
+
+`digitFactorialChains(1000000)` should return `402`.
+
+```js
+assert.strictEqual(digitFactorialChains(1000000), 402);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFactorialChains(n) {
+
+  return true;
+}
+
+digitFactorialChains(2000);
+```
+
+# --solutions--
+
+```js
+function digitFactorialChains(n) {
+  function sumDigitsFactorials(number) {
+    let sum = 0;
+    while (number > 0) {
+      sum += factorials[number % 10];
+      number = Math.floor(number / 10);
+    }
+    return sum;
+  }
+
+  const factorials = [1];
+  for (let i = 1; i < 10; i++) {
+    factorials.push(factorials[factorials.length - 1] * i);
+  }
+
+  const sequences = {
+    169: 3,
+    871: 2,
+    872: 2,
+    1454: 3,
+    45362: 2,
+    45461: 2,
+    3693601: 3
+  };
+  let result = 0;
+
+  for (let i = 2; i < n; i++) {
+    let curNum = i;
+    let chainLength = 0;
+    const curSequence = [];
+    while (curSequence.indexOf(curNum) === -1) {
+      curSequence.push(curNum);
+      curNum = sumDigitsFactorials(curNum);
+      chainLength++;
+      if (sequences.hasOwnProperty(curNum) > 0) {
+        chainLength += sequences[curNum];
+        break;
+      }
+    }
+    if (chainLength === 60) {
+      result++;
+    }
+    for (let j = 1; j < curSequence.length; j++) {
+      sequences[curSequence[j]] = chainLength - j;
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
new file mode 100644
index 0000000000..a20c0a95ea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3b71000cf542c50feca
+title: 'Problem 75: Singular integer right triangles'
+challengeType: 5
+forumTopicId: 302188
+dashedName: problem-75-singular-integer-right-triangles
+---
+
+# --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.
+
+<div style='margin-left: 4em;'>
+  <strong>12 cm:</strong> (3,4,5)<br>
+  <strong>24 cm:</strong> (6,8,10)<br>
+  <strong>30 cm:</strong> (5,12,13)<br>
+  <strong>36 cm:</strong> (9,12,15)<br>
+  <strong>40 cm:</strong> (8,15,17)<br>
+  <strong>48 cm:</strong> (12,16,20)<br><br>
+</div>
+
+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.
+
+<div style='margin-left: 4em;'>
+  <strong>120 cm:</strong> (30,40,50), (20,48,52), (24,45,51)<br><br>
+</div>
+
+Given that L is the length of the wire, for how many values of L ≤ `n` can exactly one, integer sided right angle, triangle be formed?
+
+# --hints--
+
+`singularIntRightTriangles(48)` should return a number.
+
+```js
+assert(typeof singularIntRightTriangles(48) === 'number');
+```
+
+`singularIntRightTriangles(48)` should return `6`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(48), 6);
+```
+
+`singularIntRightTriangles(700000)` should return `75783`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(700000), 75783);
+```
+
+`singularIntRightTriangles(1000000)` should return `107876`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(1000000), 107876);
+```
+
+`singularIntRightTriangles(1500000)` should return `161667`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(1500000), 161667);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function singularIntRightTriangles(n) {
+
+  return true;
+}
+
+singularIntRightTriangles(48);
+```
+
+# --solutions--
+
+```js
+function singularIntRightTriangles(limit) {
+  function euclidFormula(m, n) {
+    return [m ** 2 - n ** 2, 2 * m * n, m ** 2 + n ** 2];
+  }
+
+  function gcd(numberA, numberB) {
+    if (numberB === 0) {
+      return numberA;
+    }
+    return gcd(numberB, numberA % numberB);
+  }
+
+  function notBothOdd(numberA, numberB) {
+    return (numberA + numberB) % 2 === 1;
+  }
+
+  function areCoprime(numberA, numberB) {
+    return gcd(numberA, numberB) === 1;
+  }
+
+  const trianglesWithPerimeter = new Array(limit + 1).fill(0);
+  const mLimit = Math.sqrt(limit / 2);
+
+  for (let m = 2; m < mLimit; m++) {
+    for (let n = 1; n < m; n++) {
+      if (notBothOdd(m, n) && areCoprime(m, n)) {
+        const [sideA, sideB, sideC] = euclidFormula(m, n);
+        const perimeter = sideA + sideB + sideC;
+        let curPerimeter = perimeter;
+        while (curPerimeter <= limit) {
+          trianglesWithPerimeter[curPerimeter]++;
+          curPerimeter += perimeter;
+        }
+      }
+    }
+  }
+  return trianglesWithPerimeter.filter(trianglesCount => trianglesCount === 1)
+    .length;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-76-counting-summations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
new file mode 100644
index 0000000000..bbc9618245
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3b81000cf542c50fecb
+title: 'Problem 76: Counting summations'
+challengeType: 5
+forumTopicId: 302189
+dashedName: problem-76-counting-summations
+---
+
+# --description--
+
+It is possible to write five as a sum in exactly six different ways:
+
+<div style='margin-left: 4em;'>
+  4 + 1<br>
+  3 + 2<br>
+  3 + 1 + 1<br>
+  2 + 2 + 1<br>
+  2 + 1 + 1 + 1<br>
+  1 + 1 + 1 + 1 + 1<br><br>
+</div>
+
+How many different ways can `n` be written as a sum of at least two positive integers?
+
+# --hints--
+
+`countingSummations(5)` should return a number.
+
+```js
+assert(typeof countingSummations(5) === 'number');
+```
+
+`countingSummations(5)` should return `6`.
+
+```js
+assert.strictEqual(countingSummations(5), 6);
+```
+
+`countingSummations(20)` should return `626`.
+
+```js
+assert.strictEqual(countingSummations(20), 626);
+```
+
+`countingSummations(50)` should return `204225`.
+
+```js
+assert.strictEqual(countingSummations(50), 204225);
+```
+
+`countingSummations(100)` should return `190569291`.
+
+```js
+assert.strictEqual(countingSummations(100), 190569291);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingSummations(n) {
+
+  return true;
+}
+
+countingSummations(5);
+```
+
+# --solutions--
+
+```js
+function countingSummations(n) {
+  const combinations = new Array(n + 1).fill(0);
+  combinations[0] = 1;
+
+  for (let i = 1; i < n; i++) {
+    for (let j = i; j < n + 1; j++) {
+      combinations[j] += combinations[j - i];
+    }
+  }
+  return combinations[n];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-77-prime-summations.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
new file mode 100644
index 0000000000..bd26cc3c69
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3b91000cf542c50fecc
+title: 'Problem 77: Prime summations'
+challengeType: 5
+forumTopicId: 302190
+dashedName: problem-77-prime-summations
+---
+
+# --description--
+
+It is possible to write ten as the sum of primes in exactly five different ways:
+
+<div style='margin-left: 4em;'>
+  7 + 3<br>
+  5 + 5<br>
+  5 + 3 + 2<br>
+  3 + 3 + 2 + 2<br>
+  2 + 2 + 2 + 2 + 2<br><br>
+</div>
+
+What is the first value which can be written as the sum of primes in over `n` ways?
+
+# --hints--
+
+`primeSummations(5)` should return a number.
+
+```js
+assert(typeof primeSummations(5) === 'number');
+```
+
+`primeSummations(5)` should return `11`.
+
+```js
+assert.strictEqual(primeSummations(5), 11);
+```
+
+`primeSummations(100)` should return `31`.
+
+```js
+assert.strictEqual(primeSummations(100), 31);
+```
+
+`primeSummations(1000)` should return `53`.
+
+```js
+assert.strictEqual(primeSummations(1000), 53);
+```
+
+`primeSummations(5000)` should return `71`.
+
+```js
+assert.strictEqual(primeSummations(5000), 71);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeSummations(n) {
+
+  return true;
+}
+
+primeSummations(5);
+```
+
+# --solutions--
+
+```js
+function primeSummations(n) {
+  function getSievePrimes(max) {
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+    const primes = [];
+
+    for (let i = 2; i < max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j += i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  const MAX_NUMBER = 100;
+  const primes = getSievePrimes(MAX_NUMBER);
+
+  for (let curNumber = 2; curNumber < MAX_NUMBER; curNumber++) {
+    const combinations = new Array(curNumber + 1).fill(0);
+    combinations[0] = 1;
+    for (let i = 0; i < primes.length; i++) {
+      for (let j = primes[i]; j <= curNumber; j++) {
+        combinations[j] += combinations[j - primes[i]];
+      }
+    }
+    if (combinations[curNumber] > n) {
+      return curNumber;
+    }
+  }
+
+  return false;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
new file mode 100644
index 0000000000..61f145116f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
@@ -0,0 +1,103 @@
+---
+id: 5900f3ba1000cf542c50fecd
+title: 'Problem 78: Coin partitions'
+challengeType: 5
+forumTopicId: 302191
+dashedName: problem-78-coin-partitions
+---
+
+# --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$.
+
+<div style='text-align: center;'>
+
+| Coin piles        |
+| ----------------- |
+| OOOOO             |
+| OOOO   O          |
+| OOO   OO          |
+| OOO   O   O       |
+| OO   OO   O       |
+| OO   O   O   O    |
+| O   O   O   O   O |
+
+</div><br>
+
+Find the least value of `n` for which ${p}(n)$ is divisible by `divisor`.
+
+# --hints--
+
+`coinPartitions(7)` should return a number.
+
+```js
+assert(typeof coinPartitions(7) === 'number');
+```
+
+`coinPartitions(7)` should return `5`.
+
+```js
+assert.strictEqual(coinPartitions(7), 5);
+```
+
+`coinPartitions(10000)` should return `599`.
+
+```js
+assert.strictEqual(coinPartitions(10000), 599);
+```
+
+`coinPartitions(100000)` should return `11224`.
+
+```js
+assert.strictEqual(coinPartitions(100000), 11224);
+```
+
+`coinPartitions(1000000)` should return `55374`.
+
+```js
+assert.strictEqual(coinPartitions(1000000), 55374);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function coinPartitions(divisor) {
+
+  return true;
+}
+
+coinPartitions(7);
+```
+
+# --solutions--
+
+```js
+function coinPartitions(divisor) {
+  const partitions = [1];
+
+  let n = 0;
+  while (partitions[n] !== 0) {
+    n++;
+    partitions.push(0);
+
+    let i = 0;
+    let pentagonal = 1;
+    while (pentagonal <= n) {
+      const sign = i % 4 > 1 ? -1 : 1;
+      partitions[n] += sign * partitions[n - pentagonal];
+      partitions[n] = partitions[n] % divisor;
+
+      i++;
+
+      let k = Math.floor(i / 2) + 1;
+      if (i % 2 !== 0) {
+        k *= -1;
+      }
+      pentagonal = Math.floor((k * (3 * k - 1)) / 2);
+    }
+  }
+  return n;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
new file mode 100644
index 0000000000..e9858fa539
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
@@ -0,0 +1,115 @@
+---
+id: 5900f3bb1000cf542c50fece
+title: 'Problem 79: Passcode derivation'
+challengeType: 5
+forumTopicId: 302192
+dashedName: problem-79-passcode-derivation
+---
+
+# --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 arrays, `keylog1`, `keylog2`, and `keylog3`, contains fifty successful login attempts.
+
+Given that the three characters are always asked for in order, analyze the array so as to determine the shortest possible secret passcode of unknown length.
+
+# --hints--
+
+`passcodeDerivation(keylog1)` should return a number.
+
+```js
+assert(typeof passcodeDerivation(_keylog1) === 'number');
+```
+
+`passcodeDerivation(keylog1)` should return `531278`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog1), 531278);
+```
+
+`passcodeDerivation(keylog2)` should return `1230567`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog2), 1230567);
+```
+
+`passcodeDerivation(keylog3)` should return `73162890`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog3), 73162890);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _keylog1 = [
+  127,327,178,528,537,538,532,328,127,178,537,127,317,328,512,278,328,327,178,327,578,317,527,178,128,328,517,312,531,128,128,317,527,312,328,532,512,518,317,127,537,528,537,527,327,278,532,128, 318,517
+];
+const _keylog2 = [
+  305,367,256,123,357,120,125,307,236,256,356,267,357,256,356,136,257,107,126,567,567,105,120,237,367,120,367,135,207,167,367,367,307,125,120,130,367,230,106,356,126,106,130,123,307,127,306,167,136,126
+];
+const _keylog3 = [
+  319,680,180,690,129,620,762,689,762,318,368,710,720,710,629,168,160,689,716,731,736,729,316,729,729,710,769,290,719,680,318,389,162,289,162,718,729,319,790,680,890,362,319,760,316,729,380,319,728,716,
+];
+```
+
+## --seed-contents--
+
+```js
+function passcodeDerivation(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const keylog1 = [
+  319,680,180,690,129,620,762,689,762,318,368,710,720,710,629,168,160,689,716,731,736,729,316,729,729,710,769,290,719,680,318,389,162,289,162,718,729,319,790,680,890,362,319,760,316,729,380,319,728,716,
+];
+
+passcodeDerivation(keylog1);
+```
+
+# --solutions--
+
+```js
+function passcodeDerivation(arr) {
+  const numbersInPasscode = [];
+  const relativePositions = new Array(10)
+    .fill()
+    .map(() => new Array(10).fill(0));
+
+  for (let i = 0; i < arr.length; i++) {
+    const curAttempt = arr[i]
+      .toString()
+      .split('')
+      .map(key => parseInt(key, 10));
+    for (let j = 0; j < curAttempt.length; j++) {
+      if (numbersInPasscode.indexOf(curAttempt[j]) === -1) {
+        numbersInPasscode.push(curAttempt[j]);
+      }
+      for (let k = j + 1; k < curAttempt.length; k++) {
+        relativePositions[curAttempt[j]][curAttempt[k]] += 1;
+      }
+    }
+  }
+
+  const ranks = {};
+  for (let i = 0; i < numbersInPasscode.length; i++) {
+    const curNumber = numbersInPasscode[i];
+    ranks[curNumber] = relativePositions[curNumber].filter(
+      count => count > 0
+    ).length;
+  }
+
+  const passcode = numbersInPasscode
+    .sort((i, j) => ranks[i] - ranks[j])
+    .reverse()
+    .join('');
+
+  return parseInt(passcode, 10);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
new file mode 100644
index 0000000000..0fd4703af7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
@@ -0,0 +1,92 @@
+---
+id: 5900f3741000cf542c50fe87
+title: 'Problem 8: Largest product in a series'
+challengeType: 5
+forumTopicId: 302193
+dashedName: problem-8-largest-product-in-a-series
+---
+
+# --description--
+
+The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
+
+<div style='text-align: center;'>73167176531330624919225119674426574742355349194934</div>
+<div style='text-align: center;'>96983520312774506326239578318016984801869478851843</div>
+<div style='text-align: center;'>85861560789112949495459501737958331952853208805511</div>
+<div style='text-align: center;'>12540698747158523863050715693290963295227443043557</div>
+<div style='text-align: center;'>66896648950445244523161731856403098711121722383113</div>
+<div style='text-align: center;'>62229893423380308135336276614282806444486645238749</div>
+<div style='text-align: center;'>30358907296290491560440772390713810515859307960866</div>
+<div style='text-align: center;'>70172427121883998797908792274921901699720888093776</div>
+<div style='text-align: center;'>65727333001053367881220235421809751254540594752243</div>
+<div style='text-align: center;'>52584907711670556013604839586446706324415722155397</div>
+<div style='text-align: center;'>53697817977846174064955149290862569321978468622482</div>
+<div style='text-align: center;'>83972241375657056057490261407972968652414535100474</div>
+<div style='text-align: center;'>82166370484403199890008895243450658541227588666881</div>
+<div style='text-align: center;'>16427171479924442928230863465674813919123162824586</div>
+<div style='text-align: center;'>17866458359124566529476545682848912883142607690042</div>
+<div style='text-align: center;'>24219022671055626321111109370544217506941658960408</div>
+<div style='text-align: center;'>07198403850962455444362981230987879927244284909188</div>
+<div style='text-align: center;'>84580156166097919133875499200524063689912560717606</div>
+<div style='text-align: center;'>05886116467109405077541002256983155200055935729725</div>
+<div style='text-align: center;'>71636269561882670428252483600823257530420752963450</div>
+
+Find the `n` adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
+
+# --hints--
+
+`largestProductinaSeries(4)` should return a number.
+
+```js
+assert(typeof largestProductinaSeries(4) === 'number');
+```
+
+`largestProductinaSeries(4)` should return 5832.
+
+```js
+assert.strictEqual(largestProductinaSeries(4), 5832);
+```
+
+`largestProductinaSeries(13)` should return 23514624000.
+
+```js
+assert.strictEqual(largestProductinaSeries(13), 23514624000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestProductinaSeries(n) {
+
+  let thousandDigits = [7,3,1,6,7,1,7,6,5,3,1,3,3,0,6,2,4,9,1,9,2,2,5,1,1,9,6,7,4,4,2,6,5,7,4,7,4,2,3,5,5,3,4,9,1,9,4,9,3,4,9,6,9,8,3,5,2,0,3,1,2,7,7,4,5,0,6,3,2,6,2,3,9,5,7,8,3,1,8,0,1,6,9,8,4,8,0,1,8,6,9,4,7,8,8,5,1,8,4,3,8,5,8,6,1,5,6,0,7,8,9,1,1,2,9,4,9,4,9,5,4,5,9,5,0,1,7,3,7,9,5,8,3,3,1,9,5,2,8,5,3,2,0,8,8,0,5,5,1,1,1,2,5,4,0,6,9,8,7,4,7,1,5,8,5,2,3,8,6,3,0,5,0,7,1,5,6,9,3,2,9,0,9,6,3,2,9,5,2,2,7,4,4,3,0,4,3,5,5,7,6,6,8,9,6,6,4,8,9,5,0,4,4,5,2,4,4,5,2,3,1,6,1,7,3,1,8,5,6,4,0,3,0,9,8,7,1,1,1,2,1,7,2,2,3,8,3,1,1,3,6,2,2,2,9,8,9,3,4,2,3,3,8,0,3,0,8,1,3,5,3,3,6,2,7,6,6,1,4,2,8,2,8,0,6,4,4,4,4,8,6,6,4,5,2,3,8,7,4,9,3,0,3,5,8,9,0,7,2,9,6,2,9,0,4,9,1,5,6,0,4,4,0,7,7,2,3,9,0,7,1,3,8,1,0,5,1,5,8,5,9,3,0,7,9,6,0,8,6,6,7,0,1,7,2,4,2,7,1,2,1,8,8,3,9,9,8,7,9,7,9,0,8,7,9,2,2,7,4,9,2,1,9,0,1,6,9,9,7,2,0,8,8,8,0,9,3,7,7,6,6,5,7,2,7,3,3,3,0,0,1,0,5,3,3,6,7,8,8,1,2,2,0,2,3,5,4,2,1,8,0,9,7,5,1,2,5,4,5,4,0,5,9,4,7,5,2,2,4,3,5,2,5,8,4,9,0,7,7,1,1,6,7,0,5,5,6,0,1,3,6,0,4,8,3,9,5,8,6,4,4,6,7,0,6,3,2,4,4,1,5,7,2,2,1,5,5,3,9,7,5,3,6,9,7,8,1,7,9,7,7,8,4,6,1,7,4,0,6,4,9,5,5,1,4,9,2,9,0,8,6,2,5,6,9,3,2,1,9,7,8,4,6,8,6,2,2,4,8,2,8,3,9,7,2,2,4,1,3,7,5,6,5,7,0,5,6,0,5,7,4,9,0,2,6,1,4,0,7,9,7,2,9,6,8,6,5,2,4,1,4,5,3,5,1,0,0,4,7,4,8,2,1,6,6,3,7,0,4,8,4,4,0,3,1,9,9,8,9,0,0,0,8,8,9,5,2,4,3,4,5,0,6,5,8,5,4,1,2,2,7,5,8,8,6,6,6,8,8,1,1,6,4,2,7,1,7,1,4,7,9,9,2,4,4,4,2,9,2,8,2,3,0,8,6,3,4,6,5,6,7,4,8,1,3,9,1,9,1,2,3,1,6,2,8,2,4,5,8,6,1,7,8,6,6,4,5,8,3,5,9,1,2,4,5,6,6,5,2,9,4,7,6,5,4,5,6,8,2,8,4,8,9,1,2,8,8,3,1,4,2,6,0,7,6,9,0,0,4,2,2,4,2,1,9,0,2,2,6,7,1,0,5,5,6,2,6,3,2,1,1,1,1,1,0,9,3,7,0,5,4,4,2,1,7,5,0,6,9,4,1,6,5,8,9,6,0,4,0,8,0,7,1,9,8,4,0,3,8,5,0,9,6,2,4,5,5,4,4,4,3,6,2,9,8,1,2,3,0,9,8,7,8,7,9,9,2,7,2,4,4,2,8,4,9,0,9,1,8,8,8,4,5,8,0,1,5,6,1,6,6,0,9,7,9,1,9,1,3,3,8,7,5,4,9,9,2,0,0,5,2,4,0,6,3,6,8,9,9,1,2,5,6,0,7,1,7,6,0,6,0,5,8,8,6,1,1,6,4,6,7,1,0,9,4,0,5,0,7,7,5,4,1,0,0,2,2,5,6,9,8,3,1,5,5,2,0,0,0,5,5,9,3,5,7,2,9,7,2,5,7,1,6,3,6,2,6,9,5,6,1,8,8,2,6,7,0,4,2,8,2,5,2,4,8,3,6,0,0,8,2,3,2,5,7,5,3,0,4,2,0,7,5,2,9,6,3,4,5,0];
+  return true;
+}
+
+largestProductinaSeries(13);
+```
+
+# --solutions--
+
+```js
+const largestProductinaSeries = (number)=>{
+  let thousandDigits = [7,3,1,6,7,1,7,6,5,3,1,3,3,0,6,2,4,9,1,9,2,2,5,1,1,9,6,7,4,4,2,6,5,7,4,7,4,2,3,5,5,3,4,9,1,9,4,9,3,4,9,6,9,8,3,5,2,0,3,1,2,7,7,4,5,0,6,3,2,6,2,3,9,5,7,8,3,1,8,0,1,6,9,8,4,8,0,1,8,6,9,4,7,8,8,5,1,8,4,3,8,5,8,6,1,5,6,0,7,8,9,1,1,2,9,4,9,4,9,5,4,5,9,5,0,1,7,3,7,9,5,8,3,3,1,9,5,2,8,5,3,2,0,8,8,0,5,5,1,1,1,2,5,4,0,6,9,8,7,4,7,1,5,8,5,2,3,8,6,3,0,5,0,7,1,5,6,9,3,2,9,0,9,6,3,2,9,5,2,2,7,4,4,3,0,4,3,5,5,7,6,6,8,9,6,6,4,8,9,5,0,4,4,5,2,4,4,5,2,3,1,6,1,7,3,1,8,5,6,4,0,3,0,9,8,7,1,1,1,2,1,7,2,2,3,8,3,1,1,3,6,2,2,2,9,8,9,3,4,2,3,3,8,0,3,0,8,1,3,5,3,3,6,2,7,6,6,1,4,2,8,2,8,0,6,4,4,4,4,8,6,6,4,5,2,3,8,7,4,9,3,0,3,5,8,9,0,7,2,9,6,2,9,0,4,9,1,5,6,0,4,4,0,7,7,2,3,9,0,7,1,3,8,1,0,5,1,5,8,5,9,3,0,7,9,6,0,8,6,6,7,0,1,7,2,4,2,7,1,2,1,8,8,3,9,9,8,7,9,7,9,0,8,7,9,2,2,7,4,9,2,1,9,0,1,6,9,9,7,2,0,8,8,8,0,9,3,7,7,6,6,5,7,2,7,3,3,3,0,0,1,0,5,3,3,6,7,8,8,1,2,2,0,2,3,5,4,2,1,8,0,9,7,5,1,2,5,4,5,4,0,5,9,4,7,5,2,2,4,3,5,2,5,8,4,9,0,7,7,1,1,6,7,0,5,5,6,0,1,3,6,0,4,8,3,9,5,8,6,4,4,6,7,0,6,3,2,4,4,1,5,7,2,2,1,5,5,3,9,7,5,3,6,9,7,8,1,7,9,7,7,8,4,6,1,7,4,0,6,4,9,5,5,1,4,9,2,9,0,8,6,2,5,6,9,3,2,1,9,7,8,4,6,8,6,2,2,4,8,2,8,3,9,7,2,2,4,1,3,7,5,6,5,7,0,5,6,0,5,7,4,9,0,2,6,1,4,0,7,9,7,2,9,6,8,6,5,2,4,1,4,5,3,5,1,0,0,4,7,4,8,2,1,6,6,3,7,0,4,8,4,4,0,3,1,9,9,8,9,0,0,0,8,8,9,5,2,4,3,4,5,0,6,5,8,5,4,1,2,2,7,5,8,8,6,6,6,8,8,1,1,6,4,2,7,1,7,1,4,7,9,9,2,4,4,4,2,9,2,8,2,3,0,8,6,3,4,6,5,6,7,4,8,1,3,9,1,9,1,2,3,1,6,2,8,2,4,5,8,6,1,7,8,6,6,4,5,8,3,5,9,1,2,4,5,6,6,5,2,9,4,7,6,5,4,5,6,8,2,8,4,8,9,1,2,8,8,3,1,4,2,6,0,7,6,9,0,0,4,2,2,4,2,1,9,0,2,2,6,7,1,0,5,5,6,2,6,3,2,1,1,1,1,1,0,9,3,7,0,5,4,4,2,1,7,5,0,6,9,4,1,6,5,8,9,6,0,4,0,8,0,7,1,9,8,4,0,3,8,5,0,9,6,2,4,5,5,4,4,4,3,6,2,9,8,1,2,3,0,9,8,7,8,7,9,9,2,7,2,4,4,2,8,4,9,0,9,1,8,8,8,4,5,8,0,1,5,6,1,6,6,0,9,7,9,1,9,1,3,3,8,7,5,4,9,9,2,0,0,5,2,4,0,6,3,6,8,9,9,1,2,5,6,0,7,1,7,6,0,6,0,5,8,8,6,1,1,6,4,6,7,1,0,9,4,0,5,0,7,7,5,4,1,0,0,2,2,5,6,9,8,3,1,5,5,2,0,0,0,5,5,9,3,5,7,2,9,7,2,5,7,1,6,3,6,2,6,9,5,6,1,8,8,2,6,7,0,4,2,8,2,5,2,4,8,3,6,0,0,8,2,3,2,5,7,5,3,0,4,2,0,7,5,2,9,6,3,4,5,0];
+ let numberOfDigits = thousandDigits.length;
+ let currentIndex = 0;
+ let productOfAdjDigits = [];
+
+  while(currentIndex<=(numberOfDigits-number)){
+   let currentAdj = thousandDigits.slice(currentIndex,currentIndex+number);
+    let isAdjDigits = false;
+
+    productOfAdjDigits.push(currentAdj.reduce((prev,cur)=>{
+     return prev*cur;
+    }));
+
+    currentIndex++;
+ }
+
+ return Math.max(...productOfAdjDigits);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
new file mode 100644
index 0000000000..a552334705
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
@@ -0,0 +1,109 @@
+---
+id: 5900f3bc1000cf542c50fecf
+title: 'Problem 80: Square root digital expansion'
+challengeType: 5
+forumTopicId: 302194
+dashedName: problem-80-square-root-digital-expansion
+---
+
+# --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 `n` natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.
+
+# --hints--
+
+`sqrtDigitalExpansion(2)` should return a number.
+
+```js
+assert(typeof sqrtDigitalExpansion(2) === 'number');
+```
+
+`sqrtDigitalExpansion(2)` should return `475`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(2), 475);
+```
+
+`sqrtDigitalExpansion(50)` should return `19543`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(50), 19543);
+```
+
+`sqrtDigitalExpansion(100)` should return `40886`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(100), 40886);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sqrtDigitalExpansion(n) {
+
+  return true;
+}
+
+sqrtDigitalExpansion(2);
+```
+
+# --solutions--
+
+```js
+function sqrtDigitalExpansion(n) {
+  function sumDigits(number) {
+    let sum = 0;
+    while (number > 0n) {
+      let digit = number % 10n;
+      sum += parseInt(digit, 10);
+      number = number / 10n;
+    }
+    return sum;
+  }
+
+  function power(numberA, numberB) {
+    let result = 1n;
+    for (let b = 0; b < numberB; b++) {
+      result = result * BigInt(numberA);
+    }
+    return result;
+  }
+
+  // Based on http://www.afjarvis.staff.shef.ac.uk/maths/jarvisspec02.pdf
+  function expandSquareRoot(number, numDigits) {
+    let a = 5n * BigInt(number);
+    let b = 5n;
+    const boundaryWithNeededDigits = power(10, numDigits + 1);
+
+    while (b < boundaryWithNeededDigits) {
+      if (a >= b) {
+        a = a - b;
+        b = b + 10n;
+      } else {
+        a = a * 100n;
+        b = (b / 10n) * 100n + 5n;
+      }
+    }
+    return b / 100n;
+  }
+
+  let result = 0;
+  let nextPerfectRoot = 1;
+  const requiredDigits = 100;
+  for (let i = 1; i <= n; i++) {
+    if (nextPerfectRoot ** 2 === i) {
+      nextPerfectRoot++;
+      continue;
+    }
+    result += sumDigits(expandSquareRoot(i, requiredDigits));
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
new file mode 100644
index 0000000000..1a34ca9936
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -0,0 +1,189 @@
+---
+id: 5900f3bd1000cf542c50fed0
+title: 'Problem 81: Path sum: two ways'
+challengeType: 5
+forumTopicId: 302195
+dashedName: problem-81-path-sum-two-ways
+---
+
+# --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 from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
+
+# --hints--
+
+`pathSumTwoWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumTwoWays(_testMatrix1) === 'number');
+```
+
+`pathSumTwoWays(testMatrix1)` should return `2427`.
+
+```js
+assert.strictEqual(pathSumTwoWays(_testMatrix1), 2427);
+```
+
+`pathSumTwoWays(testMatrix2)` should return `427337`.
+
+```js
+assert.strictEqual(pathSumTwoWays(_testMatrix2), 427337);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumTwoWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumTwoWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumTwoWays(matrix) {
+  function makeMinimalMove(row, column) {
+    if (resultMatrix[row][column + 1] < resultMatrix[row + 1][column]) {
+      return resultMatrix[row][column + 1];
+    }
+    return resultMatrix[row + 1][column];
+  }
+
+  const size = matrix.length;
+  const resultMatrix = [];
+  for (let i = 0; i < size; i++) {
+    resultMatrix.push([...matrix[i]])
+  }
+
+  for (let i = size - 2; i >= 0; i--) {
+    resultMatrix[size - 1][i] += resultMatrix[size - 1][i + 1];
+    resultMatrix[i][size - 1] += resultMatrix[i + 1][size - 1];
+  }
+
+  for (let row = size - 2; row >= 0; row--) {
+    for (let column = size - 2; column >= 0; column--) {
+      resultMatrix[row][column] += makeMinimalMove(row, column);
+    }
+  }
+  return resultMatrix[0][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
new file mode 100644
index 0000000000..27e015ed2f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -0,0 +1,199 @@
+---
+id: 5900f3be1000cf542c50fed1
+title: 'Problem 82: Path sum: three ways'
+challengeType: 5
+forumTopicId: 302196
+dashedName: problem-82-path-sum-three-ways
+---
+
+# --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 from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
+
+# --hints--
+
+`pathSumThreeWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumThreeWays(_testMatrix1) === 'number');
+```
+
+`pathSumThreeWays(testMatrix1)` should return `994`.
+
+```js
+assert.strictEqual(pathSumThreeWays(_testMatrix1), 994);
+```
+
+`pathSumThreeWays(testMatrix2)` should return `260324`.
+
+```js
+assert.strictEqual(pathSumThreeWays(_testMatrix2), 260324);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumThreeWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumThreeWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumThreeWays(matrix) {
+  function makeMinimumMoveFromUpOrRight(row, column) {
+    const curValue = matrix[row][column];
+    if (values[row - 1] > values[row]) {
+      return values[row] + curValue;
+    }
+    return values[row - 1] + curValue;
+  }
+  function isGoingFromDownBetter(row, column) {
+    return values[row] > values[row + 1] + matrix[row][column];
+  }
+
+  const size = matrix.length;
+  const values = [];
+  for (let row = 0; row < size; row++) {
+    values.push(matrix[row][size - 1]);
+  }
+
+  for (let column = size - 2; column >= 0; column--) {
+    values[0] += matrix[0][column];
+
+    for (let row = 1; row < size; row++) {
+      values[row] = makeMinimumMoveFromUpOrRight(row, column);
+    }
+
+    for (let row = size - 2; row >= 0; row--) {
+      if (isGoingFromDownBetter(row, column)) {
+        values[row] = values[row + 1] + matrix[row][column];
+      }
+    }
+  }
+
+  return Math.min(...values);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
new file mode 100644
index 0000000000..bd3b6f085a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -0,0 +1,219 @@
+---
+id: 5900f3bf1000cf542c50fed2
+title: 'Problem 83: Path sum: four ways'
+challengeType: 5
+forumTopicId: 302197
+dashedName: problem-83-path-sum-four-ways
+---
+
+# --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 from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
+
+# --hints--
+
+`pathSumFourWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumFourWays(_testMatrix1) === 'number');
+```
+
+`pathSumFourWays(testMatrix1)` should return `2297`.
+
+```js
+assert.strictEqual(pathSumFourWays(_testMatrix1), 2297);
+```
+
+`pathSumFourWays(testMatrix2)` should return `425185`.
+
+```js
+assert.strictEqual(pathSumFourWays(_testMatrix2), 425185);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumFourWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumFourWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumFourWays(matrix) {
+  const MOVES = [
+    [-1, 0],
+    [1, 0],
+    [0, -1],
+    [0, 1]
+  ];
+
+  function getAllowedMoves(row, col) {
+    const moves = [];
+    for (let i = 0; i < MOVES.length; i++) {
+      const [rowChange, colChange] = MOVES[i];
+      const nextRow = row + rowChange;
+      const nextCol = col + colChange;
+      if (isMoveAllowed(nextRow, nextCol)) {
+        moves.push([nextRow, nextCol]);
+      }
+    }
+    return moves;
+  }
+
+  function isMoveAllowed(nextRow, nextCol) {
+    if (nextRow < 0 || nextRow >= size || nextCol < 0 || nextCol >= size) {
+      return false;
+    }
+    return true;
+  }
+
+  const size = matrix.length;
+  const resultMatrix = new Array(size)
+    .fill()
+    .map(() => new Array(size).fill(Infinity));
+
+  const [startRow, startCol] = new Array(2).fill(size - 1);
+  const queue = [[startRow, startCol]];
+  resultMatrix[startRow][startCol] = matrix[startRow][startCol];
+
+  while (queue.length > 0) {
+    const [curRow, curCol] = queue.shift();
+
+    const allowedMoves = getAllowedMoves(curRow, curCol);
+
+    for (let i = 0; i < allowedMoves.length; i++) {
+      const [nextRow, nextCol] = allowedMoves[i];
+      const bestPath = resultMatrix[nextRow][nextCol];
+      const newPath = resultMatrix[curRow][curCol] + matrix[nextRow][nextCol];
+      if (newPath < bestPath) {
+        resultMatrix[nextRow][nextCol] = newPath;
+        queue.push(allowedMoves[i]);
+      }
+    }
+  }
+  return resultMatrix[0][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
new file mode 100644
index 0000000000..6870d2e420
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
@@ -0,0 +1,268 @@
+---
+id: 5900f3c11000cf542c50fed3
+title: 'Problem 84: Monopoly odds'
+challengeType: 5
+forumTopicId: 302198
+dashedName: problem-84-monopoly-odds
+---
+
+# --description--
+
+In the game, *Monopoly*, the standard board is set up in the following way:
+
+<div style="text-align: center;">
+  <table cellspacing="1" cellpadding="5" border="0" style="background-color: black; color: black;" align="center">
+    <tbody>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">GO</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">A1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">A2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">T1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">JAIL</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">H2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">T2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">U1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">H1</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C3</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R4</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G1</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D3</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G2J</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">U2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">FP</td>
+      </tr>
+    </tbody>
+  </table>
+</div><br>
+
+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.
+
+<ul>
+  <li>Community Chest (2/16 cards):</li>
+  <ol>
+    <li>Advance to GO</li>
+    <li>Go to JAIL</li>
+  </ol>
+
+  <li>Chance (10/16 cards):</li>
+  <ol>
+    <li>Advance to GO</li>
+    <li>Go to JAIL</li>
+    <li>Go to C1</li>
+    <li>Go to E3</li>
+    <li>Go to H2</li>
+    <li>Go to R1</li>
+    <li>Go to next R (railway company)</li>
+    <li>Go to next R</li>
+    <li>Go to next U (utility company)</li>
+    <li>Go back 3 squares.</li>
+  </ol>
+</ul>
+
+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 `n`-sided dice are used, find the six-digit modal string.
+
+# --hints--
+
+`monopolyOdds(8)` should return a string.
+
+```js
+assert(typeof monopolyOdds(8) === 'string');
+```
+
+`monopolyOdds(8)` should return string `102400`.
+
+```js
+assert.strictEqual(monopolyOdds(8), '102400');
+```
+
+`monopolyOdds(10)` should return string `100024`.
+
+```js
+assert.strictEqual(monopolyOdds(10), '100024');
+```
+
+`monopolyOdds(20)` should return string `100005`.
+
+```js
+assert.strictEqual(monopolyOdds(20), '100005');
+```
+
+`monopolyOdds(4)` should return string `101524`.
+
+```js
+assert.strictEqual(monopolyOdds(4), '101524');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function monopolyOdds(n) {
+
+  return true;
+}
+
+monopolyOdds(8);
+```
+
+# --solutions--
+
+```js
+function monopolyOdds(n) {
+  function chanceCard(position, chanceCardPosition) {
+    chanceCardPosition = (chanceCardPosition + 1) % 16;
+    if (chanceCardPosition < 6) {
+      position = chanceCardsMoves[chanceCardPosition];
+    } else if (chanceCardPosition === 6 || chanceCardPosition === 7) {
+      position = nextMovesFromR[position];
+    } else if (chanceCardPosition === 8) {
+      position = nextMovesFromU[position];
+    } else if (chanceCardPosition === 9) {
+      position -= 3;
+    }
+    return [position, chanceCardPosition];
+  }
+
+  function chestCard(position, chestPosition) {
+    chestPosition = (chestPosition + 1) % 16;
+    if (chestPosition < 2) {
+      position = chestCardsMoves[chestPosition];
+    }
+    return [position, chestPosition];
+  }
+
+  function isChest(position) {
+    return position === 2 || position === 17 || position === 33;
+  }
+
+  function isChance(position) {
+    return position === 7 || position === 22 || position === 36;
+  }
+
+  function isJail(position) {
+    return position === 30;
+  }
+
+  function roll(dice) {
+    return Math.floor(Math.random() * dice) + 1;
+  }
+
+  function getTopThree(board) {
+    return sortByVisits(board)
+      .slice(0, 3)
+      .map(elem => elem[0].toString().padStart(2, '0'))
+      .join('');
+  }
+
+  function sortByVisits(board) {
+    return board
+      .map((element, index) => [index, element])
+      .sort((a, b) => a[1] - b[1])
+      .reverse();
+  }
+
+  const rounds = 2000000;
+  const chestCardsMoves = [0, 10];
+  const chanceCardsMoves = [0, 10, 11, 24, 39, 5];
+  const nextMovesFromR = { 7: 15, 22: 25, 36: 5 };
+  const nextMovesFromU = { 7: 12, 36: 12, 22: 28 };
+
+  const board = new Array(40).fill(0);
+  let doubleCount = 0;
+  let curPosition = 0;
+  let curChestCard = 0;
+  let curChanceCard = 0;
+
+  for (let i = 0; i < rounds; i++) {
+    const dice1 = roll(n);
+    const dice2 = roll(n);
+
+    if (dice1 === dice2) {
+      doubleCount++;
+    } else {
+      doubleCount = 0;
+    }
+
+    if (doubleCount > 2) {
+      curPosition = 10;
+      doubleCount = 0;
+    } else {
+      curPosition = (curPosition + dice1 + dice2) % 40;
+
+      if (isChance(curPosition)) {
+        [curPosition, curChanceCard] = chanceCard(curPosition, curChanceCard);
+      } else if (isChest(curPosition)) {
+        [curPosition, curChestCard] = chestCard(curPosition, curChestCard);
+      } else if (isJail(curPosition)) {
+        curPosition = 10;
+      }
+    }
+    board[curPosition]++;
+  }
+  return getTopThree(board);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
new file mode 100644
index 0000000000..5db9e13fec
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -0,0 +1,109 @@
+---
+id: 5900f3c11000cf542c50fed4
+title: 'Problem 85: Counting rectangles'
+challengeType: 5
+forumTopicId: 302199
+dashedName: problem-85-counting-rectangles
+---
+
+# --description--
+
+By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
+
+<img class="img-responsive center-block" alt="a diagram of the different rectangles found within a 3 by 2 rectangular grid" src="https://cdn-media-1.freecodecamp.org/project-euler/counting-rectangles.png" style="background-color: white; padding: 10px;">
+
+Although there may not exists a rectangular grid that contains exactly `n` rectangles, find the area of the grid with the nearest solution.
+
+# --hints--
+
+`countingRectangles(18)` should return a number.
+
+```js
+assert(typeof countingRectangles(18) === 'number');
+```
+
+`countingRectangles(18)` should return `6`.
+
+```js
+assert.strictEqual(countingRectangles(18), 6);
+```
+
+`countingRectangles(250)` should return `22`.
+
+```js
+assert.strictEqual(countingRectangles(250), 22);
+```
+
+`countingRectangles(50000)` should return `364`.
+
+```js
+assert.strictEqual(countingRectangles(50000), 364);
+```
+
+`countingRectangles(1000000)` should return `1632`.
+
+```js
+assert.strictEqual(countingRectangles(1000000), 1632);
+```
+
+`countingRectangles(2000000)` should return `2772`.
+
+```js
+assert.strictEqual(countingRectangles(2000000), 2772);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingRectangles(n) {
+
+  return true;
+}
+
+countingRectangles(18);
+```
+
+# --solutions--
+
+```js
+function countingRectangles(n) {
+  function numberOfRectangles(h, w) {
+    return (h * (h + 1) * w * (w + 1)) / 4;
+  }
+
+  function rectangleArea(h, w) {
+    return h * w;
+  }
+
+  let rectanglesCount = 1;
+  let maxSide = 1;
+  while (rectanglesCount < n) {
+    maxSide++;
+    rectanglesCount = numberOfRectangles(maxSide, 1);
+  }
+
+  let bestDiff = Math.abs(rectanglesCount - n);
+  let bestSize = [maxSide, 1];
+
+  let curHeight = maxSide - 1;
+  let curWidth = 1;
+
+  for (curWidth; curWidth < curHeight; curWidth++) {
+    for (curHeight; curHeight > curWidth; curHeight--) {
+      rectanglesCount = numberOfRectangles(curHeight, curWidth);
+      const curDiff = Math.abs(rectanglesCount - n);
+      if (curDiff < bestDiff) {
+        bestDiff = curDiff;
+        bestSize = [curHeight, curWidth];
+      }
+
+      if (rectanglesCount < n) {
+        break;
+      }
+    }
+  }
+  return rectangleArea(...bestSize);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
new file mode 100644
index 0000000000..caa496a114
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -0,0 +1,94 @@
+---
+id: 5900f3c31000cf542c50fed5
+title: 'Problem 86: Cuboid route'
+challengeType: 5
+forumTopicId: 302200
+dashedName: problem-86-cuboid-route
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner" src="https://cdn-media-1.freecodecamp.org/project-euler/cuboid-route.png" style="background-color: white; padding: 10px;">
+
+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 `n`.
+
+# --hints--
+
+`cuboidRoute(2000)` should return a number.
+
+```js
+assert(typeof cuboidRoute(2000) === 'number');
+```
+
+`cuboidRoute(2000)` should return `100`.
+
+```js
+assert.strictEqual(cuboidRoute(2000), 100);
+```
+
+`cuboidRoute(25000)` should return `320`.
+
+```js
+assert.strictEqual(cuboidRoute(25000), 320);
+```
+
+`cuboidRoute(500000)` should return `1309`.
+
+```js
+assert.strictEqual(cuboidRoute(500000), 1309);
+```
+
+`cuboidRoute(1000000)` should return `1818`.
+
+```js
+assert.strictEqual(cuboidRoute(1000000), 1818);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cuboidRoute(n) {
+
+  return true;
+}
+
+cuboidRoute(2000);
+```
+
+# --solutions--
+
+```js
+function cuboidRoute(n) {
+  // Based on https://www.mathblog.dk/project-euler-86-shortest-path-cuboid/
+  function getLength(a, b) {
+    return Math.sqrt(a ** 2 + b ** 2);
+  }
+
+  let M = 2;
+  let counter = 0;
+
+  while (counter < n) {
+    M++;
+    for (let baseHeightWidth = 3; baseHeightWidth <= 2 * M; baseHeightWidth++) {
+      const pathLength = getLength(M, baseHeightWidth);
+      if (Number.isInteger(pathLength)) {
+        if (baseHeightWidth <= M) {
+          counter += Math.floor(baseHeightWidth / 2);
+        } else {
+          counter += 1 + M - Math.floor((baseHeightWidth + 1) / 2);
+        }
+      }
+    }
+  }
+
+  return M;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
new file mode 100644
index 0000000000..57da5afe79
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
@@ -0,0 +1,131 @@
+---
+id: 5900f3c51000cf542c50fed8
+title: 'Problem 87: Prime power triples'
+challengeType: 5
+forumTopicId: 302201
+dashedName: problem-87-prime-power-triples
+---
+
+# --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:
+
+<div style='margin-left: 4em;'>
+  28 = 2<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  33 = 3<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  49 = 5<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  47 = 2<sup>2</sup> + 3<sup>3</sup> + 2<sup>4</sup>
+</div><br>
+
+How many numbers below `n` can be expressed as the sum of a prime square, prime cube, and prime fourth power?
+
+# --hints--
+
+`primePowerTriples(50)` should return a number.
+
+```js
+assert(typeof primePowerTriples(50) === 'number');
+```
+
+`primePowerTriples(50)` should return `4`.
+
+```js
+assert.strictEqual(primePowerTriples(50), 4);
+```
+
+`primePowerTriples(10035)` should return `684`.
+
+```js
+assert.strictEqual(primePowerTriples(10035), 684);
+```
+
+`primePowerTriples(500000)` should return `18899`.
+
+```js
+assert.strictEqual(primePowerTriples(500000), 18899);
+```
+
+`primePowerTriples(5000000)` should return `138932`.
+
+```js
+assert.strictEqual(primePowerTriples(5000000), 138932);
+```
+
+`primePowerTriples(50000000)` should return `1097343`.
+
+```js
+assert.strictEqual(primePowerTriples(50000000), 1097343);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePowerTriples(n) {
+
+  return true;
+}
+
+primePowerTriples(50);
+```
+
+# --solutions--
+
+```js
+function primePowerTriples(n) {
+  function getSievePrimes(max) {
+    const primes = [];
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+
+    for (let i = 2; i <= max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j <= max; j = j + i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  function getPowersSummed(numbers, powers, limit, curSum) {
+    if (curSum >= limit) {
+      return [];
+    } else if (powers.length === 0) {
+      return [curSum];
+    }
+
+    const powersSummed = [];
+
+    const curPower = powers[0];
+    const powersLeft = powers.slice(1);
+    for (let i = 0; i < numbers.length; i++) {
+      const curNumber = numbers[i];
+      const nextSum = curSum + curNumber ** curPower;
+      if (nextSum >= limit) {
+        return powersSummed;
+      }
+      const result = getPowersSummed(
+        numbers,
+        powersLeft,
+        limit,
+        curSum + curNumber ** curPower
+      );
+      powersSummed.push(...result);
+    }
+    return powersSummed;
+  }
+
+  const maximumBaseNumber = Math.floor(Math.sqrt(n - 2 ** 3 - 2 ** 4)) + 1;
+  const primes = getSievePrimes(maximumBaseNumber);
+  const uniqueSums = new Set(getPowersSummed(primes, [2, 3, 4], n, 0));
+
+  return uniqueSums.size;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
new file mode 100644
index 0000000000..3134d9cacf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3c51000cf542c50fed6
+title: 'Problem 88: Product-sum numbers'
+challengeType: 5
+forumTopicId: 302203
+dashedName: problem-88-product-sum-numbers
+---
+
+# --description--
+
+A natural number, `N`, that can be written as the sum and product of a given set of at least two natural numbers, $\\{a_1, a_2, \ldots , a_k\\}$ is called a product-sum number: $N = a_1 + a_2 + \cdots + a_k = a_1 × a_2 × \cdots × a_k$.
+
+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.
+
+<div style='margin-left: 4em;'>
+  <var>k</var>=2: 4 = 2 × 2 = 2 + 2<br>
+  <var>k</var>=3: 6 = 1 × 2 × 3 = 1 + 2 + 3<br>
+  <var>k</var>=4: 8 = 1 × 1 × 2 × 4 = 1 + 1 + 2 + 4<br>
+  <var>k</var>=5: 8 = 1 × 1 × 2 × 2 × 2  = 1 + 1 + 2 + 2 + 2<br>
+  <var>k</var>=6: 12 = 1 × 1 × 1 × 1 × 2 × 6 = 1 + 1 + 1 + 1 + 2 + 6
+</div><br>
+
+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` ≤ `limit`?
+
+# --hints--
+
+`productSumNumbers(6)` should return a number.
+
+```js
+assert(typeof productSumNumbers(6) === 'number');
+```
+
+`productSumNumbers(6)` should return `30`.
+
+```js
+assert.strictEqual(productSumNumbers(6), 30);
+```
+
+`productSumNumbers(12)` should return `61`.
+
+```js
+assert.strictEqual(productSumNumbers(12), 61);
+```
+
+`productSumNumbers(300)` should return `12686`.
+
+```js
+assert.strictEqual(productSumNumbers(300), 12686);
+```
+
+`productSumNumbers(6000)` should return `2125990`.
+
+```js
+assert.strictEqual(productSumNumbers(6000), 2125990);
+```
+
+`productSumNumbers(12000)` should return `7587457`.
+
+```js
+assert.strictEqual(productSumNumbers(12000), 7587457);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function productSumNumbers(limit) {
+
+  return true;
+}
+
+productSumNumbers(6);
+```
+
+# --solutions--
+
+```js
+function productSumNumbers(limit) {
+  function getProductSums(curProduct, curSum, factorsCount, start) {
+    const k = curProduct - curSum + factorsCount;
+    if (k <= limit) {
+      if (curProduct < minimalProductSums[k]) {
+        minimalProductSums[k] = curProduct;
+      }
+      for (let i = start; i < Math.floor((limit / curProduct) * 2) + 1; i++) {
+        getProductSums(curProduct * i, curSum + i, factorsCount + 1, i);
+      }
+    }
+  }
+
+  const minimalProductSums = new Array(limit + 1).fill(2 * limit);
+  getProductSums(1, 1, 1, 2);
+
+  const uniqueProductSums = [...new Set(minimalProductSums.slice(2))];
+
+  let sum = 0;
+  for (let i = 0; i < uniqueProductSums.length; i++) {
+    sum += uniqueProductSums[i];
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
new file mode 100644
index 0000000000..3c0e7ac2aa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3c51000cf542c50fed7
+title: 'Problem 89: Roman numerals'
+challengeType: 5
+forumTopicId: 302204
+dashedName: problem-89-roman-numerals
+---
+
+# --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.
+
+- Numerals must be arranged in descending order of size.
+- M, C, and X cannot be equaled or exceeded by smaller denominations.
+- D, L, and V can each only appear once.
+
+In addition to the three rules given above, if subtractive combinations are used then the following four rules must be followed.
+
+- Only one I, X, and C can be used as the leading numeral in part of a subtractive pair.
+- I can only be placed before V and X.
+- X can only be placed before L and C.
+- C can only be placed before D and M.
+
+For example, it would appear that there are at least six ways of writing the number sixteen:
+
+<div style="margin-left: 4em; font-family: 'courier new', monospace;">
+  IIIIIIIIIIIIIIII<br>
+  VIIIIIIIIIII<br>
+  VVIIIIII<br>
+  XIIIIII<br>
+  VVVI<br>
+  XVI<br><br>
+</div>
+
+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 array, `roman`, will contain numbers written with valid, but not necessarily minimal, Roman numerals.
+
+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 array contain no more than four consecutive identical units.
+
+# --hints--
+
+`romanNumerals(testNumerals1)` should return a number.
+
+```js
+assert(typeof romanNumerals(_testNumerals1) === 'number');
+```
+
+`romanNumerals(testNumerals1)` should return `19`.
+
+```js
+assert.strictEqual(romanNumerals(_testNumerals1), 19);
+```
+
+`romanNumerals(testNumerals2)` should return `743`.
+
+```js
+assert.strictEqual(romanNumerals(_testNumerals2), 743);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testNumerals1 = [
+  'XIIIIII', 'XVI', 'MMMCCLXVIIII', 'XXXXVI', 'MMMMXX', 'CCLI', 'CCCCXX', 'MMMMDCXXXXI', 'DCCCCIIII', 'MXVIIII'
+];
+const _testNumerals2 = [
+  'MMMMDCLXXII','MMDCCCLXXXIII','MMMDLXVIIII','MMMMDXCV','DCCCLXXII','MMCCCVI','MMMCDLXXXVII','MMMMCCXXI','MMMCCXX','MMMMDCCCLXXIII','MMMCCXXXVII','MMCCCLXXXXIX','MDCCCXXIIII','MMCXCVI','CCXCVIII','MMMCCCXXXII','MDCCXXX','MMMDCCCL','MMMMCCLXXXVI','MMDCCCXCVI','MMMDCII','MMMCCXII','MMMMDCCCCI','MMDCCCXCII','MDCXX','CMLXXXVII','MMMXXI','MMMMCCCXIV','MLXXII','MCCLXXVIIII','MMMMCCXXXXI','MMDCCCLXXII','MMMMXXXI','MMMDCCLXXX','MMDCCCLXXIX','MMMMLXXXV','MCXXI','MDCCCXXXVII','MMCCCLXVII','MCDXXXV','CCXXXIII','CMXX','MMMCLXIV','MCCCLXXXVI','DCCCXCVIII','MMMDCCCCXXXIV','CDXVIIII','MMCCXXXV','MDCCCXXXII','MMMMD','MMDCCLXIX','MMMMCCCLXXXXVI','MMDCCXLII','MMMDCCCVIIII','DCCLXXXIIII','MDCCCCXXXII','MMCXXVII','DCCCXXX','CCLXIX','MMMXI','MMMMCMLXXXXVIII','MMMMDLXXXVII','MMMMDCCCLX','MMCCLIV','CMIX','MMDCCCLXXXIIII','CLXXXII','MMCCCCXXXXV','MMMMDLXXXVIIII','MMMDCCCXXI','MMDCCCCLXXVI','MCCCCLXX','MMCDLVIIII','MMMDCCCLIX','MMMMCCCCXIX','MMMDCCCLXXV','XXXI','CDLXXXIII','MMMCXV','MMDCCLXIII','MMDXXX','MMMMCCCLVII','MMMDCI','MMMMCDLXXXIIII','MMMMCCCXVI','CCCLXXXVIII','MMMMCML','MMMMXXIV','MMMCCCCXXX','DCCX','MMMCCLX','MMDXXXIII','CCCLXIII','MMDCCXIII','MMMCCCXLIV','CLXXXXI','CXVI','MMMMCXXXIII','CLXX','DCCCXVIII','MLXVII','DLXXXX','MMDXXI','MMMMDLXXXXVIII','MXXII','LXI','DCCCCXLIII','MMMMDV','MMMMXXXIV','MDCCCLVIII','MMMCCLXXII','MMMMDCCXXXVI','MMMMLXXXIX','MDCCCLXXXI','MMMMDCCCXV','MMMMCCCCXI','MMMMCCCLIII','MDCCCLXXI','MMCCCCXI','MLXV','MMCDLXII','MMMMDXXXXII','MMMMDCCCXL','MMMMCMLVI','CCLXXXIV','MMMDCCLXXXVI','MMCLII','MMMCCCCXV','MMLXXXIII','MMMV','MMMV','DCCLXII','MMDCCCCXVI','MMDCXLVIII','CCLIIII','CCCXXV','MMDCCLXXXVIIII','MMMMDCLXXVIII','MMMMDCCCXCI','MMMMCCCXX','MMCCXLV','MMMDCCCLXIX','MMCCLXIIII','MMMDCCCXLIX','MMMMCCCLXIX','CMLXXXXI','MCMLXXXIX','MMCDLXI','MMDCLXXVIII','MMMMDCCLXI','MCDXXV','DL','CCCLXXII','MXVIIII','MCCCCLXVIII','CIII','MMMDCCLXXIIII','MMMDVIII','MMMMCCCLXXXXVII','MMDXXVII','MMDCCLXXXXV','MMMMCXLVI','MMMDCCLXXXII','MMMDXXXVI','MCXXII','CLI','DCLXXXIX','MMMCLI','MDCLXIII','MMMMDCCXCVII','MMCCCLXXXV','MMMDCXXVIII','MMMCDLX','MMMCMLII','MMMIV','MMMMDCCCLVIII','MMMDLXXXVIII','MCXXIV','MMMMLXXVI','CLXXIX','MMMCCCCXXVIIII','DCCLXXXV','MMMDCCCVI','LI','CLXXXVI','MMMMCCCLXXVI','MCCCLXVI','CCXXXIX','MMDXXXXI','MMDCCCXLI','DCCCLXXXVIII','MMMMDCCCIV','MDCCCCXV','MMCMVI','MMMMCMLXXXXV','MMDCCLVI','MMMMCCXLVIII','DCCCCIIII','MMCCCCIII','MMMDCCLXXXVIIII','MDCCCLXXXXV','DVII','MMMV','DCXXV','MMDCCCXCV','DCVIII','MMCDLXVI','MCXXVIII','MDCCXCVIII','MMDCLX','MMMDCCLXIV','MMCDLXXVII','MMDLXXXIIII','MMMMCCCXXII','MMMDCCCXLIIII','DCCCCLXVII','MMMCLXXXXIII','MCCXV','MMMMDCXI','MMMMDCLXXXXV','MMMCCCLII','MMCMIX','MMDCCXXV','MMDLXXXVI','MMMMDCXXVIIII','DCCCCXXXVIIII','MMCCXXXIIII','MMDCCLXXVIII','MDCCLXVIIII','MMCCLXXXV','MMMMDCCCLXXXVIII','MMCMXCI','MDXLII','MMMMDCCXIV','MMMMLI','DXXXXIII','MMDCCXI','MMMMCCLXXXIII','MMMDCCCLXXIII','MDCLVII','MMCD','MCCCXXVII','MMMMDCCIIII','MMMDCCXLVI','MMMCLXXXVII','MMMCCVIIII','MCCCCLXXIX','DL','DCCCLXXVI','MMDXCI','MMMMDCCCCXXXVI','MMCII','MMMDCCCXXXXV','MMMCDXLV','MMDCXXXXIV','MMD','MDCCCLXXXX','MMDCXLIII','MMCCXXXII','MMDCXXXXVIIII','DCCCLXXI','MDXCVIIII','MMMMCCLXXVIII','MDCLVIIII','MMMCCCLXXXIX','MDCLXXXV','MDLVIII','MMMMCCVII','MMMMDCXIV','MMMCCCLXIIII','MMIIII','MMMMCCCLXXIII','CCIII','MMMCCLV','MMMDXIII','MMMCCCXC','MMMDCCCXXI','MMMMCCCCXXXII','CCCLVI','MMMCCCLXXXVI','MXVIIII','MMMCCCCXIIII','CLXVII','MMMCCLXX','CCCCLXIV','MMXXXXII','MMMMCCLXXXX','MXL','CCXVI','CCCCLVIIII','MMCCCII','MCCCLVIII','MMMMCCCX','MCDLXXXXIV','MDCCCXIII','MMDCCCXL','MMMMCCCXXIII','DXXXIV','CVI','MMMMDCLXXX','DCCCVII','MMCMLXIIII','MMMDCCCXXXIII','DCCC','MDIII','MMCCCLXVI','MMMCCCCLXXI','MMDCCCCXVIII','CCXXXVII','CCCXXV','MDCCCXII','MMMCMV','MMMMCMXV','MMMMDCXCI','DXXI','MMCCXLVIIII','MMMMCMLII','MDLXXX','MMDCLXVI','CXXI','MMMDCCCLIIII','MMMCXXI','MCCIII','MMDCXXXXI','CCXCII','MMMMDXXXV','MMMCCCLXV','MMMMDLXV','MMMCCCCXXXII','MMMCCCVIII','DCCCCLXXXXII','MMCLXIV','MMMMCXI','MLXXXXVII','MMMCDXXXVIII','MDXXII','MLV','MMMMDLXVI','MMMCXII','XXXIII','MMMMDCCCXXVI','MMMLXVIIII','MMMLX','MMMCDLXVII','MDCCCLVII','MMCXXXVII','MDCCCCXXX','MMDCCCLXIII','MMMMDCXLIX','MMMMCMXLVIII','DCCCLXXVIIII','MDCCCLIII','MMMCMLXI','MMMMCCLXI','MMDCCCLIII','MMMDCCCVI','MMDXXXXIX','MMCLXXXXV','MMDXXX','MMMXIII','DCLXXIX','DCCLXII','MMMMDCCLXVIII','MDCCXXXXIII','CCXXXII','MMMMDCXXV','MMMCCCXXVIII','MDCVIII','MMMCLXXXXIIII','CLXXXI','MDCCCCXXXIII','MMMMDCXXX','MMMDCXXIV','MMMCCXXXVII','MCCCXXXXIIII','CXVIII','MMDCCCCIV','MMMMCDLXXV','MMMDLXIV','MDXCIII','MCCLXXXI','MMMDCCCXXIV','MCXLIII','MMMDCCCI','MCCLXXX','CCXV','MMDCCLXXI','MMDLXXXIII','MMMMDCXVII','MMMCMLXV','MCLXVIII','MMMMCCLXXVI','MMMDCCLXVIIII','MMMMDCCCIX','DLXXXXIX','DCCCXXII','MMMMIII','MMMMCCCLXXVI','DCCCXCIII','DXXXI','MXXXIIII','CCXII','MMMDCCLXXXIIII','MMMCXX','MMMCMXXVII','DCCCXXXX','MMCDXXXVIIII','MMMMDCCXVIII','LV','MMMDCCCCVI','MCCCII','MMCMLXVIIII','MDCCXI','MMMMDLXVII','MMCCCCLXI','MMDCCV','MMMCCCXXXIIII','MMMMDI','MMMDCCCXCV','MMDCCLXXXXI','MMMDXXVI','MMMDCCCLVI','MMDCXXX','MCCCVII','MMMMCCCLXII','MMMMXXV','MMCMXXV','MMLVI','MMDXXX','MMMMCVII','MDC','MCCIII','MMMMDCC','MMCCLXXV','MMDCCCXXXXVI','MMMMCCCLXV','CDXIIII','MLXIIII','CCV','MMMCMXXXI','CCCCLXVI','MDXXXII','MMMMCCCLVIII','MMV','MMMCLII','MCMLI','MMDCCXX','MMMMCCCCXXXVI','MCCLXXXI','MMMCMVI','DCCXXX','MMMMCCCLXV','DCCCXI','MMMMDCCCXIV','CCCXXI','MMDLXXV','CCCCLXXXX','MCCCLXXXXII','MMDCIX','DCCXLIIII','DXIV','MMMMCLII','CDLXI','MMMCXXVII','MMMMDCCCCLXIII','MMMDCLIIII','MCCCCXXXXII','MMCCCLX','CCCCLIII','MDCCLXXVI','MCMXXIII','MMMMDLXXVIII','MMDCCCCLX','MMMCCCLXXXX','MMMCDXXVI','MMMDLVIII','CCCLXI','MMMMDCXXII','MMDCCCXXI','MMDCCXIII','MMMMCLXXXVI','MDCCCCXXVI','MDV','MMDCCCCLXXVI','MMMMCCXXXVII','MMMDCCLXXVIIII','MMMCCCCLXVII','DCCXLI','MMCLXXXVIII','MCCXXXVI','MMDCXLVIII','MMMMCXXXII','MMMMDCCLXVI','MMMMCMLI','MMMMCLXV','MMMMDCCCXCIV','MCCLXXVII','LXXVIIII','DCCLII','MMMCCCXCVI','MMMCLV','MMDCCCXXXXVIII','DCCCXV','MXC','MMDCCLXXXXVII','MMMMCML','MMDCCCLXXVIII','DXXI','MCCCXLI','DCLXXXXI','MMCCCLXXXXVIII','MDCCCCLXXVIII','MMMMDXXV','MMMDCXXXVI','MMMCMXCVII','MMXVIIII','MMMDCCLXXIV','MMMCXXV','DXXXVIII','MMMMCLXVI','MDXII','MMCCCLXX','CCLXXI','DXIV','MMMCLIII','DLII','MMMCCCXLIX','MMCCCCXXVI','MMDCXLIII','MXXXXII','CCCLXXXV','MDCLXXVI','MDCXII','MMMCCCLXXXIII','MMDCCCCLXXXII','MMMMCCCLXXXV','MMDCXXI','DCCCXXX','MMMDCCCCLII','MMMDCCXXII','MMMMCDXCVIII','MMMCCLXVIIII','MMXXV','MMMMCDXIX','MMMMCCCX','MMMCCCCLXVI','MMMMDCLXXVIIII','MMMMDCXXXXIV','MMMCMXII','MMMMXXXIII','MMMMDLXXXII','DCCCLIV','MDXVIIII','MMMCLXXXXV','CCCCXX','MMDIX','MMCMLXXXVIII','DCCXLIII','DCCLX','D','MCCCVII','MMMMCCCLXXXIII','MDCCCLXXIIII','MMMDCCCCLXXXVII','MMMMCCCVII','MMMDCCLXXXXVI','CDXXXIV','MCCLXVIII','MMMMDLX','MMMMDXII','MMMMCCCCLIIII','MCMLXXXXIII','MMMMDCCCIII','MMDCLXXXIII','MDCCCXXXXIV','XXXXVII','MMMDCCCXXXII','MMMDCCCXLII','MCXXXV','MDCXXVIIII','MMMCXXXXIIII','MMMMCDXVII','MMMDXXIII','MMMMCCCCLXI','DCLXXXXVIIII','LXXXXI','CXXXIII','MCDX','MCCLVII','MDCXXXXII','MMMCXXIV','MMMMLXXXX','MMDCCCCXLV','MLXXX','MMDCCCCLX','MCDLIII','MMMCCCLXVII','MMMMCCCLXXIV','MMMDCVIII','DCCCCXXIII','MMXCI','MMDCCIV','MMMMDCCCXXXIV','CCCLXXI','MCCLXXXII','MCMIII','CCXXXI','DCCXXXVIII','MMMMDCCXLVIIII','MMMMCMXXXV','DCCCLXXV','DCCXCI','MMMMDVII','MMMMDCCCLXVIIII','CCCXCV','MMMMDCCXX','MCCCCII','MMMCCCXC','MMMCCCII','MMDCCLXXVII','MMDCLIIII','CCXLIII','MMMDCXVIII','MMMCCCIX','MCXV','MMCCXXV','MLXXIIII','MDCCXXVI','MMMCCCXX','MMDLXX','MMCCCCVI','MMDCCXX','MMMMDCCCCXCV','MDCCCXXXII','MMMMDCCCCXXXX','XCIV','MMCCCCLX','MMXVII','MLXXI','MMMDXXVIII','MDCCCCII','MMMCMLVII','MMCLXXXXVIII','MDCCCCLV','MCCCCLXXIIII','MCCCLII','MCDXLVI','MMMMDXVIII','DCCLXXXIX','MMMDCCLXIV','MDCCCCXLIII','CLXXXXV','MMMMCCXXXVI','MMMDCCCXXI','MMMMCDLXXVII','MCDLIII','MMCCXLVI','DCCCLV','MCDLXX','DCLXXVIII','MMDCXXXIX','MMMMDCLX','MMDCCLI','MMCXXXV','MMMCCXII','MMMMCMLXII','MMMMCCV','MCCCCLXIX','MMMMCCIII','CLXVII','MCCCLXXXXIIII','MMMMDCVIII','MMDCCCLXI','MMLXXIX','CMLXIX','MMDCCCXLVIIII','DCLXII','MMMCCCXLVII','MDCCCXXXV','MMMMDCCXCVI','DCXXX','XXVI','MMLXIX','MMCXI','DCXXXVII','MMMMCCCXXXXVIII','MMMMDCLXI','MMMMDCLXXIIII','MMMMVIII','MMMMDCCCLXII','MDCXCI','MMCCCXXIIII','CCCCXXXXV','MMDCCCXXI','MCVI','MMDCCLXVIII','MMMMCXL','MLXVIII','CMXXVII','CCCLV','MDCCLXXXIX','MMMCCCCLXV','MMDCCLXII','MDLXVI','MMMCCCXVIII','MMMMCCLXXXI','MMCXXVII','MMDCCCLXVIII','MMMCXCII','MMMMDCLVIII','MMMMDCCCXXXXII','MMDCCCCLXXXXVI','MDCCXL','MDCCLVII','MMMMDCCCLXXXVI','DCCXXXIII','MMMMDCCCCLXXXV','MMCCXXXXVIII','MMMCCLXXVIII','MMMDCLXXVIII','DCCCI','MMMMLXXXXVIIII','MMMCCCCLXXII','MMCLXXXVII','CCLXVI','MCDXLIII','MMCXXVIII','MDXIV','CCCXCVIII','CLXXVIII','MMCXXXXVIIII','MMMDCLXXXIV','CMLVIII','MCDLIX','MMMMDCCCXXXII','MMMMDCXXXIIII','MDCXXI','MMMDCXLV','MCLXXVIII','MCDXXII','IV','MCDLXXXXIII','MMMMDCCLXV','CCLI','MMMMDCCCXXXVIII','DCLXII','MCCCLXVII','MMMMDCCCXXXVI','MMDCCXLI','MLXI','MMMCDLXVIII','MCCCCXCIII','XXXIII','MMMDCLXIII','MMMMDCL','DCCCXXXXIIII','MMDLVII','DXXXVII','MCCCCXXIIII','MCVII','MMMMDCCXL','MMMMCXXXXIIII','MCCCCXXIV','MMCLXVIII','MMXCIII','MDCCLXXX','MCCCLIIII','MMDCLXXI','MXI','MCMLIV','MMMCCIIII','DCCLXXXVIIII','MDCLIV','MMMDCXIX','CMLXXXI','DCCLXXXVII','XXV','MMMXXXVI','MDVIIII','CLXIII','MMMCDLVIIII','MMCCCCVII','MMMLXX','MXXXXII','MMMMCCCLXVIII','MMDCCCXXVIII','MMMMDCXXXXI','MMMMDCCCXXXXV','MMMXV','MMMMCCXVIIII','MMDCCXIIII','MMMXXVII','MDCCLVIIII','MMCXXIIII','MCCCLXXIV','DCLVIII','MMMLVII','MMMCXLV','MMXCVII','MMMCCCLXXXVII','MMMMCCXXII','DXII','MMMDLV','MCCCLXXVIII','MMMCLIIII','MMMMCLXXXX','MMMCLXXXIIII','MDCXXIII','MMMMCCXVI','MMMMDLXXXIII','MMMDXXXXIII','MMMMCCCCLV','MMMDLXXXI','MMMCCLXXVI','MMMMXX','MMMMDLVI','MCCCCLXXX','MMMXXII','MMXXII','MMDCCCCXXXI','MMMDXXV','MMMDCLXXXVIIII','MMMDLXXXXVII','MDLXIIII','CMXC','MMMXXXVIII','MDLXXXVIII','MCCCLXXVI','MMCDLIX','MMDCCCXVIII','MDCCCXXXXVI','MMMMCMIV','MMMMDCIIII','MMCCXXXV','XXXXVI','MMMMCCXVII','MMCCXXIV','MCMLVIIII','MLXXXIX','MMMMLXXXIX','CLXXXXIX','MMMDCCCCLVIII','MMMMCCLXXIII','MCCCC','DCCCLIX','MMMCCCLXXXII','MMMCCLXVIIII','MCLXXXV','CDLXXXVII','DCVI','MMX','MMCCXIII','MMMMDCXX','MMMMXXVIII','DCCCLXII','MMMMCCCXLIII','MMMMCLXV','DXCI','MMMMCLXXX','MMMDCCXXXXI','MMMMXXXXVI','DCLX','MMMCCCXI','MCCLXXX','MMCDLXXII','DCCLXXI','MMMCCCXXXVI','MCCCCLXXXVIIII','CDLVIII','DCCLVI','MMMMDCXXXVIII','MMCCCLXXXIII','MMMMDCCLXXV','MMMXXXVI','CCCLXXXXIX','CV','CCCCXIII','CCCCXVI','MDCCCLXXXIIII','MMDCCLXXXII','MMMMCCCCLXXXI','MXXV','MMCCCLXXVIIII','MMMCCXII','MMMMCCXXXIII','MMCCCLXXXVI','MMMDCCCLVIIII','MCCXXXVII','MDCLXXV','XXXV','MMDLI','MMMCCXXX','MMMMCXXXXV','CCCCLIX','MMMMDCCCLXXIII','MMCCCXVII','DCCCXVI','MMMCCCXXXXV','MDCCCCXCV','CLXXXI','MMMMDCCLXX','MMMDCCCIII','MMCLXXVII','MMMDCCXXIX','MMDCCCXCIIII','MMMCDXXIIII','MMMMXXVIII','MMMMDCCCCLXVIII','MDCCCXX','MMMMCDXXI','MMMMDLXXXIX','CCXVI','MDVIII','MMCCLXXI','MMMDCCCLXXI','MMMCCCLXXVI','MMCCLXI','MMMMDCCCXXXIV','DLXXXVI','MMMMDXXXII','MMMXXIIII','MMMMCDIV','MMMMCCCXLVIII','MMMMCXXXVIII','MMMCCCLXVI','MDCCXVIII','MMCXX','CCCLIX','MMMMDCCLXXII','MDCCCLXXV','MMMMDCCCXXIV','DCCCXXXXVIII','MMMDCCCCXXXVIIII','MMMMCCXXXV','MDCLXXXIII','MMCCLXXXIV','MCLXXXXIIII','DXXXXIII','MCCCXXXXVIII','MMCLXXIX','MMMMCCLXIV','MXXII','MMMCXIX','MDCXXXVII','MMDCCVI','MCLXXXXVIII','MMMCXVI','MCCCLX','MMMCDX','CCLXVIIII','MMMCCLX','MCXXVIII','LXXXII','MCCCCLXXXI','MMMI','MMMCCCLXIV','MMMCCCXXVIIII','CXXXVIII','MMCCCXX','MMMCCXXVIIII','MCCLXVI','MMMCCCCXXXXVI','MMDCCXCIX','MCMLXXI','MMCCLXVIII','CDLXXXXIII','MMMMDCCXXII','MMMMDCCLXXXVII','MMMDCCLIV','MMCCLXIII','MDXXXVII','DCCXXXIIII','MCII','MMMDCCCLXXI','MMMLXXIII','MDCCCLIII','MMXXXVIII','MDCCXVIIII','MDCCCCXXXVII','MMCCCXVI','MCMXXII','MMMCCCLVIII','MMMMDCCCXX','MCXXIII','MMMDLXI','MMMMDXXII','MDCCCX','MMDXCVIIII','MMMDCCCCVIII','MMMMDCCCCXXXXVI','MMDCCCXXXV','MMCXCIV','MCMLXXXXIII','MMMCCCLXXVI','MMMMDCLXXXV','CMLXIX','DCXCII','MMXXVIII','MMMMCCCXXX','XXXXVIIII'
+];
+```
+
+## --seed-contents--
+
+```js
+function romanNumerals(roman) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testNumerals1 = [
+  'XIIIIII', 'XVI', 'MMMCCLXVIIII', 'XXXXVI', 'MMMMXX', 'CCLI', 'CCCCXX', 'MMMMDCXXXXI', 'DCCCCIIII', 'MXVIIII'
+];
+
+romanNumerals(testNumerals1);
+```
+
+# --solutions--
+
+```js
+function romanNumerals(roman) {
+  const numerals = [...roman];
+  const replaces = [
+    ['VIIII', 'IX'],
+    ['IIII', 'IV'],
+    ['LXXXX', 'XC'],
+    ['XXXX', 'XL'],
+    ['DCCCC', 'CM'],
+    ['CCCC', 'CD']
+  ];
+  let savedChars = 0;
+  for (let i = 0; i < numerals.length; i++) {
+    const charsBefore = numerals[i].length;
+    for (let j = 0; j < replaces.length; j++) {
+      numerals[i] = numerals[i].replace(...replaces[j]);
+    }
+    const charsAfter = numerals[i].length;
+    savedChars += charsBefore - charsAfter;
+  }
+  return savedChars;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
new file mode 100644
index 0000000000..3ce9715e40
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
@@ -0,0 +1,74 @@
+---
+id: 5900f3761000cf542c50fe88
+title: 'Problem 9: Special Pythagorean triplet'
+challengeType: 5
+forumTopicId: 302205
+dashedName: problem-9-special-pythagorean-triplet
+---
+
+# --description--
+
+A Pythagorean triplet is a set of three natural numbers, `a` &lt; `b` &lt; `c`, for which,
+
+<div style='text-align: center;'><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup></div>
+
+For example, 3<sup>2</sup> + 4<sup>2</sup> = 9 + 16 = 25 = 5<sup>2</sup>.
+
+There exists exactly one Pythagorean triplet for which `a` + `b` + `c` = 1000. Find the product `abc` such that `a` + `b` + `c` = `n`.
+
+# --hints--
+
+`specialPythagoreanTriplet(24)` should return a number.
+
+```js
+assert(typeof specialPythagoreanTriplet(24) === 'number');
+```
+
+`specialPythagoreanTriplet(24)` should return 480.
+
+```js
+assert.strictEqual(specialPythagoreanTriplet(24), 480);
+```
+
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000
+
+```js
+assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));
+```
+
+`specialPythagoreanTriplet(1000)` should return 31875000.
+
+```js
+assert.strictEqual(specialPythagoreanTriplet(1000), 31875000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function specialPythagoreanTriplet(n) {
+ let sumOfabc = n;
+
+ return true;
+}
+
+specialPythagoreanTriplet(1000);
+```
+
+# --solutions--
+
+```js
+const specialPythagoreanTriplet = (n)=>{
+ let sumOfabc = n;
+ let a,b,c;
+ for(a = 1; a<=sumOfabc/3; a++){
+ for(b = a+1; b<=sumOfabc/2; b++){
+ c = Math.sqrt(a*a+b*b);
+ if((a+b+c) == sumOfabc){
+ return a*b*c;
+ }
+ }
+ }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
new file mode 100644
index 0000000000..c07bf97f28
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -0,0 +1,65 @@
+---
+id: 5900f3c61000cf542c50fed9
+title: 'Problem 90: Cube digit pairs'
+challengeType: 5
+forumTopicId: 302207
+dashedName: problem-90-cube-digit-pairs
+---
+
+# --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:
+
+<img class="img-responsive center-block" alt="two cubes, one with the number 6 and the other with number 4" src="https://cdn-media-1.freecodecamp.org/project-euler/cube-digit-pairs.png" style="background-color: white; padding: 10px;">
+
+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.
+
+<div style="margin-left: 4em;">
+  {1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}<br>
+  {1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}
+</div>
+
+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?
+
+# --hints--
+
+`cubeDigitPairs()` should return a number.
+
+```js
+assert(typeof cubeDigitPairs() === 'number');
+```
+
+`cubeDigitPairs()` should return 1217.
+
+```js
+assert.strictEqual(cubeDigitPairs(), 1217);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cubeDigitPairs() {
+
+  return true;
+}
+
+cubeDigitPairs();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
new file mode 100644
index 0000000000..b38a0eb1bc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -0,0 +1,119 @@
+---
+id: 5900f3c71000cf542c50feda
+title: 'Problem 91: Right triangles with integer coordinates'
+challengeType: 5
+forumTopicId: 302208
+dashedName: problem-91-right-triangles-with-integer-coordinates
+---
+
+# --description--
+
+The points ${P}(x_1, y_1)$ and ${Q}(x_2, y_2)$ are plotted at integer co-ordinates and are joined to the origin, ${O}(0, 0)$, to form ${\Delta}OPQ$.
+
+<img class="img-responsive center-block" alt="a graph plotting points P (x_1, y_1) and Q(x_2, y_2) at integer coordinates that are joined to the origin O (0, 0)" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-1.png" style="background-color: white; padding: 10px;">
+
+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 ≤ x_1, y_1, x_2, y_2 ≤ 2$.
+
+<img class="img-responsive center-block" alt="a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-2.png" style="background-color: white; padding: 10px;">
+
+Given that $0 ≤ x_1, y_1, x_2, y_2 ≤ limit$, how many right triangles can be formed?
+
+# --hints--
+
+`rightTrianglesIntCoords(2)` should return a number.
+
+```js
+assert(typeof rightTrianglesIntCoords(2) === 'number');
+```
+
+`rightTrianglesIntCoords(2)` should return `14`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(2), 14);
+```
+
+`rightTrianglesIntCoords(10)` should return `448`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(10), 448);
+```
+
+`rightTrianglesIntCoords(25)` should return `3207`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(25), 3207);
+```
+
+`rightTrianglesIntCoords(50)` should return `14234`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(50), 14234);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function rightTrianglesIntCoords(limit) {
+
+  return true;
+}
+
+rightTrianglesIntCoords(2);
+```
+
+# --solutions--
+
+```js
+function rightTrianglesIntCoords(limit) {
+  function isRightTriangle(points) {
+    for (let i = 0; i < points.length; i++) {
+      const pointA = points[i];
+      const pointB = points[(i + 1) % 3];
+      const pointC = points[(i + 2) % 3];
+      const vectorAB = [pointB[0] - pointA[0], pointB[1] - pointA[1]];
+      const vectorAC = [pointC[0] - pointA[0], pointC[1] - pointA[1]];
+
+      if (isRightAngleBetween(vectorAB, vectorAC)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  function isRightAngleBetween(vector1, vector2) {
+    return vector1[0] * vector2[0] + vector1[1] * vector2[1] === 0;
+  }
+
+  function getSetKey(points) {
+    return (
+      '0.0,' +
+      points
+        .sort((a, b) => a[0] - b[0])
+        .map(point => point.join('.'))
+        .join(',')
+    );
+  }
+
+  const pointO = [0, 0];
+  const rightTriangles = new Set();
+  for (let x1 = 1; x1 <= limit; x1++) {
+    for (let y1 = 0; y1 <= limit; y1++) {
+      const pointP = [x1, y1];
+      for (let x2 = 0; x2 <= limit; x2++) {
+        for (let y2 = 1; y2 <= limit; y2++) {
+          const pointQ = [x2, y2];
+          if (pointP[0] === pointQ[0] && pointP[1] === pointQ[1]) {
+            continue;
+          }
+          if (isRightTriangle([pointO, pointP, pointQ])) {
+            rightTriangles.add(getSetKey([pointP, pointQ]));
+          }
+        }
+      }
+    }
+  }
+  return rightTriangles.size;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
new file mode 100644
index 0000000000..065f0b748d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
@@ -0,0 +1,155 @@
+---
+id: 5900f3c81000cf542c50fedb
+title: 'Problem 92: Square digit chains'
+challengeType: 5
+forumTopicId: 302209
+dashedName: problem-92-square-digit-chains
+---
+
+# --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,
+
+$$\begin{align}
+  & 44 → 32 → 13 → 10 → \boldsymbol{1} → \boldsymbol{1}\\\\
+  & 85 → \boldsymbol{89} → 145 → 42 → 20 → 4 → 16 → 37 → 58 → \boldsymbol{89}\\\\
+\end{align}$$
+
+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 `limit` will arrive at 89?
+
+# --hints--
+
+`squareDigitChains(100)` should return a number.
+
+```js
+assert(typeof squareDigitChains(100) === 'number');
+```
+
+`squareDigitChains(100)` should return `80`.
+
+```js
+assert.strictEqual(squareDigitChains(100), 80);
+```
+
+`squareDigitChains(1000)` should return `857`.
+
+```js
+assert.strictEqual(squareDigitChains(1000), 857);
+```
+
+`squareDigitChains(100000)` should return `85623`.
+
+```js
+assert.strictEqual(squareDigitChains(100000), 85623);
+```
+
+`squareDigitChains(10000000)` should return `8581146`.
+
+```js
+assert.strictEqual(squareDigitChains(10000000), 8581146);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function squareDigitChains(limit) {
+
+  return true;
+}
+
+squareDigitChains(100);
+```
+
+# --solutions--
+
+```js
+function squareDigitChains(limit) {
+  // Based on https://www.xarg.org/puzzle/project-euler/problem-92/
+  function getCombinations(neededDigits, curDigits) {
+    if (neededDigits === curDigits.length) {
+      return [curDigits];
+    }
+    const combinations = [];
+    const lastDigit = curDigits.length !== 0 ? curDigits[0] : 9;
+    for (let i = 0; i <= lastDigit; i++) {
+      const results = getCombinations(neededDigits, [i].concat(curDigits));
+      combinations.push(...results);
+    }
+    return combinations;
+  }
+
+  function getPossibleSums(limit) {
+    const digitsCount = getDigits(limit).length - 1;
+    const possibleSquaredSums = [false];
+    for (let i = 1; i <= 81 * digitsCount; i++) {
+      let curVal = i;
+      while (curVal !== 1 && curVal !== 89) {
+        curVal = addSquaredDigits(curVal);
+      }
+      possibleSquaredSums[i] = curVal === 89;
+    }
+    return possibleSquaredSums;
+  }
+
+  function addSquaredDigits(num) {
+    const digits = getDigits(num);
+    let result = 0;
+    for (let i = 0; i < digits.length; i++) {
+      result += digits[i] ** 2;
+    }
+    return result;
+  }
+
+  function getDigits(number) {
+    const digits = [];
+    while (number > 0) {
+      digits.push(number % 10);
+      number = Math.floor(number / 10);
+    }
+    return digits;
+  }
+
+  function getFactorials(number) {
+    const factorials = [1];
+    for (let i = 1; i < number; i++) {
+      factorials[i] = factorials[i - 1] * i;
+    }
+    return factorials;
+  }
+
+  const neededDigits = getDigits(limit).length - 1;
+  const combinations = getCombinations(neededDigits, []);
+  const possibleSquaredDigitsSums = getPossibleSums(limit);
+  const factorials = getFactorials(neededDigits + 1);
+
+  let endingWith89 = 0;
+
+  for (let i = 0; i < combinations.length; i++) {
+    let counts = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+    let digits = combinations[i];
+    let curSum = 0;
+    for (let j = 0; j < digits.length; j++) {
+      const curDigit = digits[j];
+      curSum += curDigit ** 2;
+      counts[curDigit]++;
+    }
+
+    if (possibleSquaredDigitsSums[curSum]) {
+      let denominator = 1;
+      for (let j = 0; j < counts.length; j++) {
+        denominator = denominator * factorials[counts[j]];
+      }
+      endingWith89 += Math.floor(
+        factorials[factorials.length - 1] / denominator
+      );
+    }
+  }
+  return endingWith89;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
new file mode 100644
index 0000000000..81b5dce63a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
@@ -0,0 +1,59 @@
+---
+id: 5900f3ca1000cf542c50fedc
+title: 'Problem 93: Arithmetic expressions'
+challengeType: 5
+forumTopicId: 302210
+dashedName: problem-93-arithmetic-expressions
+---
+
+# --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,
+
+<div style='margin-left: 4em;'>
+  8 = (4 * (1 + 3)) / 2<br>
+  14 = 4 * (3 + 1 / 2)<br>
+  19 = 4 * (2 + 3) − 1<br>
+  36 = 3 * 4 * (2 + 1)
+</div>
+
+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` &lt; `b` &lt; `c` &lt; `d`, for which the longest set of consecutive positive integers, 1 to `n`, can be obtained, giving your answer as a string: `abcd`.
+
+# --hints--
+
+`arithmeticExpressions()` should return a number.
+
+```js
+assert(typeof arithmeticExpressions() === 'number');
+```
+
+`arithmeticExpressions()` should return 1258.
+
+```js
+assert.strictEqual(arithmeticExpressions(), 1258);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function arithmeticExpressions() {
+
+  return true;
+}
+
+arithmeticExpressions();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
new file mode 100644
index 0000000000..ef0c095e03
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
@@ -0,0 +1,84 @@
+---
+id: 5900f3ca1000cf542c50fedd
+title: 'Problem 94: Almost equilateral triangles'
+challengeType: 5
+forumTopicId: 302211
+dashedName: problem-94-almost-equilateral-triangles
+---
+
+# --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 <dfn>almost equilateral triangle</dfn> 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 `limit`.
+
+# --hints--
+
+`almostEquilateralTriangles(50)` should return a number.
+
+```js
+assert(typeof almostEquilateralTriangles(50) === 'number');
+```
+
+`almostEquilateralTriangles(50)` should return `66`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(50), 66);
+```
+
+`almostEquilateralTriangles(10000)` should return `3688`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(10000), 3688);
+```
+
+`almostEquilateralTriangles(10000000)` should return `9973078`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(10000000), 9973078);
+```
+
+`almostEquilateralTriangles(1000000000)` should return `518408346`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(1000000000), 518408346);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function almostEquilateralTriangles(limit) {
+
+  return true;
+}
+
+almostEquilateralTriangles(50);
+```
+
+# --solutions--
+
+```js
+function almostEquilateralTriangles(limit) {
+  // Based on https://blog.dreamshire.com/project-euler-94-solution/
+  let perimetersSum = 0;
+
+  let sidesAB = 1;
+  let sideC = 1;
+  let perimeter = 0;
+  let perimeterOffset = 1;
+
+  while (perimeter <= limit) {
+    [sidesAB, sideC] = [4 * sidesAB - sideC + 2 * perimeterOffset, sidesAB];
+    perimeterOffset = -perimeterOffset;
+
+    perimetersSum += perimeter;
+    perimeter = 3 * sidesAB - perimeterOffset;
+  }
+
+  return perimetersSum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
new file mode 100644
index 0000000000..9d42e7c6f5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
@@ -0,0 +1,126 @@
+---
+id: 5900f3cc1000cf542c50fede
+title: 'Problem 95: Amicable chains'
+challengeType: 5
+forumTopicId: 302212
+dashedName: problem-95-amicable-chains
+---
+
+# --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 → \cdots)
+$$
+
+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 `limit`.
+
+# --hints--
+
+`amicableChains(300)` should return a number.
+
+```js
+assert(typeof amicableChains(300) === 'number');
+```
+
+`amicableChains(300)` should return `220`.
+
+```js
+assert.strictEqual(amicableChains(300), 220);
+```
+
+`amicableChains(15000)` should return `220`.
+
+```js
+assert.strictEqual(amicableChains(15000), 220);
+```
+
+`amicableChains(100000)` should return `12496`.
+
+```js
+assert.strictEqual(amicableChains(100000), 12496);
+```
+
+`amicableChains(1000000)` should return `14316`.
+
+```js
+assert.strictEqual(amicableChains(1000000), 14316);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function amicableChains(limit) {
+
+  return true;
+}
+
+amicableChains(300);
+```
+
+# --solutions--
+
+```js
+function amicableChains(limit) {
+  function getSmallestMember(chain) {
+    let smallest = chain[0];
+    for (let i = 1; i < chain.length; i++) {
+      if (smallest > chain[i]) {
+        smallest = chain[i];
+      }
+    }
+    return smallest;
+  }
+
+  function getFactorsSums(limit) {
+    const factorsSums = new Array(limit + 1).fill(1);
+    for (let i = 2; i <= limit / 2; i++) {
+      for (let j = 2 * i; j <= limit; j += i) {
+        factorsSums[j] += i;
+      }
+    }
+    return factorsSums;
+  }
+
+  const factorsSums = getFactorsSums(limit);
+  const checkedNumbers = new Set();
+
+  let longestChain = 0;
+  let smallestMember = 0;
+  for (let i = 0; i <= limit; i++) {
+    const curChain = [];
+    let curNumber = i;
+    while (!checkedNumbers.has(curNumber) && factorsSums[curNumber] <= limit) {
+      curNumber = factorsSums[curNumber];
+
+      const chainStart = curChain.indexOf(curNumber);
+      if (chainStart === -1) {
+        curChain.push(curNumber);
+        continue;
+      }
+
+      const chainLength = curChain.length - chainStart;
+      if (chainLength > longestChain) {
+        longestChain = chainLength;
+        smallestMember = getSmallestMember(curChain.slice(chainStart));
+      }
+      break;
+    }
+
+    for (let j = 0; j < curChain.length; j++) {
+      checkedNumbers.add(curChain[j]);
+    }
+  }
+
+  return smallestMember;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-96-su-doku.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-96-su-doku.md
new file mode 100644
index 0000000000..10509108d2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-96-su-doku.md
@@ -0,0 +1,296 @@
+---
+id: 5900f3cc1000cf542c50fedf
+title: 'Problem 96: Su Doku'
+challengeType: 5
+forumTopicId: 302213
+dashedName: problem-96-su-doku
+---
+
+# --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.
+
+<div style="margin: auto; background-color: white; padding: 10px; width: 80%; text-align: center;">
+  <table border="0" cellpadding="0" cellspacing="0" align="center">
+    <tbody>
+      <tr>
+        <td>
+          <table cellpadding="5" cellspacing="0" border="1">
+            <tbody>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 3<br />9 0 0<br />0 0 1
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 2 0<br />3 0 5<br />8 0 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 0 0<br />0 0 1<br />4 0 0
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 8<br />7 0 0<br />0 0 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  1 0 2<br />0 0 0<br />7 0 8
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 0 0<br />0 0 8<br />2 0 0
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 2<br />8 0 0<br />0 0 5
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 0 9<br />2 0 3<br />0 1 0
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 0 0<br />0 0 9<br />3 0 0
+                </td>
+              </tr>
+            </tbody>
+          </table>
+        </td>
+        <td width="50">
+          <img src="images/spacer.gif" width="50" height="1" alt="" /><br />
+        </td>
+        <td>
+          <table cellpadding="5" cellspacing="0" border="1">
+            <tbody>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  4 8 3<br />9 6 7<br />2 5 1
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 2 1<br />3 4 5<br />8 7 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 5 7<br />8 2 1<br />4 9 3
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 4 8<br />7 2 9<br />1 3 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  1 3 2<br />5 6 4<br />7 9 8
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 7 6<br />1 3 8<br />2 4 5
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  3 7 2<br />8 1 4<br />6 9 5
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 8 9<br />2 5 3<br />4 1 7
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 1 4<br />7 6 9<br />3 8 2
+                </td>
+              </tr>
+            </tbody>
+          </table>
+        </td>
+      </tr>
+    </tbody>
+  </table>
+</div>
+
+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 `puzzlesArr` array contains different Su Doku puzzle strings ranging in difficulty, but all with unique solutions.
+
+By solving all puzzles in `puzzlesArr`, 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.
+
+# --hints--
+
+`suDoku(testPuzzles1)` should return a number.
+
+```js
+assert(typeof suDoku(_testPuzzles1) === 'number');
+```
+
+`suDoku(testPuzzles1)` should return `1190`.
+
+```js
+assert.strictEqual(suDoku(_testPuzzles1), 1190);
+```
+
+`suDoku(testPuzzles2)` should return `24702`.
+
+```js
+assert.strictEqual(suDoku(_testPuzzles2), 24702);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testPuzzles1 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
+];
+
+const _testPuzzles2 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000',
+  '030050040008010500460000012070502080000603000040109030250000098001020600080060020',
+  '020810740700003100090002805009040087400208003160030200302700060005600008076051090',
+  '100920000524010000000000070050008102000000000402700090060000000000030945000071006',
+  '043080250600000000000001094900004070000608000010200003820500000000000005034090710',
+  '480006902002008001900370060840010200003704100001060049020085007700900600609200018',
+  '000900002050123400030000160908000000070000090000000205091000050007439020400007000',
+  '001900003900700160030005007050000009004302600200000070600100030042007006500006800',
+  '000125400008400000420800000030000095060902010510000060000003049000007200001298000',
+  '062340750100005600570000040000094800400000006005830000030000091006400007059083260',
+  '300000000005009000200504000020000700160000058704310600000890100000067080000005437',
+  '630000000000500008005674000000020000003401020000000345000007004080300902947100080',
+  '000020040008035000000070602031046970200000000000501203049000730000000010800004000',
+  '361025900080960010400000057008000471000603000259000800740000005020018060005470329',
+  '050807020600010090702540006070020301504000908103080070900076205060090003080103040',
+  '080005000000003457000070809060400903007010500408007020901020000842300000000100080',
+  '003502900000040000106000305900251008070408030800763001308000104000020000005104800',
+  '000000000009805100051907420290401065000000000140508093026709580005103600000000000',
+  '020030090000907000900208005004806500607000208003102900800605007000309000030020050',
+  '005000006070009020000500107804150000000803000000092805907006000030400010200000600',
+  '040000050001943600009000300600050002103000506800020007005000200002436700030000040',
+  '004000000000030002390700080400009001209801307600200008010008053900040000000000800',
+  '360020089000361000000000000803000602400603007607000108000000000000418000970030014',
+  '500400060009000800640020000000001008208000501700500000000090084003000600060003002',
+  '007256400400000005010030060000508000008060200000107000030070090200000004006312700',
+  '000000000079050180800000007007306800450708096003502700700000005016030420000000000',
+  '030000080009000500007509200700105008020090030900402001004207100002000800070000090',
+  '200170603050000100000006079000040700000801000009050000310400000005000060906037002',
+  '000000080800701040040020030374000900000030000005000321010060050050802006080000000',
+  '000000085000210009960080100500800016000000000890006007009070052300054000480000000',
+  '608070502050608070002000300500090006040302050800050003005000200010704090409060701',
+  '050010040107000602000905000208030501040070020901080406000401000304000709020060010',
+  '053000790009753400100000002090080010000907000080030070500000003007641200061000940',
+  '006080300049070250000405000600317004007000800100826009000702000075040190003090600',
+  '005080700700204005320000084060105040008000500070803010450000091600508007003010600',
+  '000900800128006400070800060800430007500000009600079008090004010003600284001007000',
+  '000080000270000054095000810009806400020403060006905100017000620460000038000090000',
+  '000602000400050001085010620038206710000000000019407350026040530900020007000809000',
+  '000900002050123400030000160908000000070000090000000205091000050007439020400007000',
+  '380000000000400785009020300060090000800302009000040070001070500495006000000000092',
+  '000158000002060800030000040027030510000000000046080790050000080004070100000325000',
+  '010500200900001000002008030500030007008000500600080004040100700000700006003004050',
+  '080000040000469000400000007005904600070608030008502100900000005000781000060000010',
+  '904200007010000000000706500000800090020904060040002000001607000000000030300005702',
+  '000700800006000031040002000024070000010030080000060290000800070860000500002006000',
+  '001007090590080001030000080000005800050060020004100000080000030100020079020700400',
+  '000003017015009008060000000100007000009000200000500004000000020500600340340200000',
+  '300200000000107000706030500070009080900020004010800050009040301000702000000008006'
+];
+```
+
+## --seed-contents--
+
+```js
+function suDoku(puzzlesArr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testPuzzles1 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
+];
+
+suDoku(testPuzzles1);
+```
+
+# --solutions--
+
+```js
+function suDoku(puzzlesArr) {
+  function solve(puzzle) {
+    for (let row = 0; row < 9; row++) {
+      for (let col = 0; col < 9; col++) {
+        if (puzzle[row][col] > 0) {
+          continue;
+        }
+
+        const allowedNumbers = getAllowedNumbers(puzzle, row, col);
+
+        for (let number = 1; number <= 9; number++) {
+          if (allowedNumbers[number]) {
+            puzzle[row][col] = number;
+            if (solve(puzzle)) {
+              return true;
+            }
+          }
+        }
+
+        puzzle[row][col] = 0;
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function getAllowedNumbers(puzzle, row, col) {
+    const allowed = new Array(10).fill(true);
+    allowed[0] = false;
+
+    for (let i = 0; i < 9; i++) {
+      const numberInSameRow = puzzle[row][i];
+      if (numberInSameRow > 0) {
+        allowed[numberInSameRow] = false;
+      }
+
+      const numberInSameCol = puzzle[i][col];
+      if (numberInSameCol > 0) {
+        allowed[numberInSameCol] = false;
+      }
+    }
+
+    const rowOfSubGrid = Math.floor(row / 3) * 3;
+    const colOfSubGrid = Math.floor(col / 3) * 3;
+    for (let rowInSubGrid = 0; rowInSubGrid < 3; rowInSubGrid++) {
+      for (let colInSubGrid = 0; colInSubGrid < 3; colInSubGrid++) {
+        const numberInSameSubGrid =
+          puzzle[rowOfSubGrid + rowInSubGrid][colOfSubGrid + colInSubGrid];
+        if (numberInSameSubGrid > 0) {
+          allowed[numberInSameSubGrid] = false;
+        }
+      }
+    }
+
+    return allowed;
+  }
+
+  function parsePuzzle(string) {
+    const puzzle = [];
+    for (let row = 0; row < 9; row++) {
+      puzzle.push(
+        string
+          .slice(row * 9, 9 + row * 9)
+          .split('')
+          .map(x => parseInt(x, 10))
+      );
+    }
+    return puzzle;
+  }
+
+  let sum = 0;
+  for (let i = 0; i < puzzlesArr.length; i++) {
+    const puzzle = parsePuzzle(puzzlesArr[i]);
+    if (solve(puzzle)) {
+      sum += 100 * puzzle[0][0] + 10 * puzzle[0][1] + puzzle[0][2];
+    }
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
new file mode 100644
index 0000000000..15dafc79a9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
@@ -0,0 +1,88 @@
+---
+id: 5900f3ce1000cf542c50fee0
+title: 'Problem 97: Large non-Mersenne prime'
+challengeType: 5
+forumTopicId: 302214
+dashedName: problem-97-large-non-mersenne-prime
+---
+
+# --description--
+
+The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form $2^{6972593} − 1$; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form $2^p − 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 × 2^{7830457} + 1$.
+
+Find the last ten digits of that non-Mersenne prime in the form $multiplier × 2^{power} + 1$.
+
+# --hints--
+
+`largeNonMersennePrime(19, 6833086)` should return a string.
+
+```js
+assert(typeof largeNonMersennePrime(19, 6833086) === 'string');
+```
+
+`largeNonMersennePrime(19, 6833086)` should return the string `3637590017`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(19, 6833086), '3637590017');
+```
+
+`largeNonMersennePrime(27, 7046834)` should return the string `0130771969`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(27, 7046834), '0130771969');
+```
+
+`largeNonMersennePrime(6679881, 6679881)` should return the string `4455386113`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(6679881, 6679881), '4455386113');
+```
+
+`largeNonMersennePrime(28433, 7830457)` should return the string `8739992577`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(28433, 7830457), '8739992577');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largeNonMersennePrime(multiplier, power) {
+
+  return true;
+}
+
+largeNonMersennePrime(19, 6833086);
+```
+
+# --solutions--
+
+```js
+function largeNonMersennePrime(multiplier, power) {
+  function modStepsResults(number, other, mod, startValue, step) {
+    let result = startValue;
+    for (let i = 0; i < other; i++) {
+      result = step(number, result) % mod;
+    }
+    return result;
+  }
+
+  const numOfDigits = 10;
+  const mod = 10 ** numOfDigits;
+  const digitsAfterPower = modStepsResults(2, power, mod, 1, (a, b) => a * b);
+  const digitsAfterMultiply = modStepsResults(
+    digitsAfterPower,
+    multiplier,
+    mod,
+    0,
+    (a, b) => a + b
+  );
+  const lastDigits = (digitsAfterMultiply + 1) % mod;
+
+  return lastDigits.toString().padStart(10, '0');
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
new file mode 100644
index 0000000000..e63309053f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
@@ -0,0 +1,205 @@
+---
+id: 5900f3cf1000cf542c50fee1
+title: 'Problem 98: Anagramic squares'
+challengeType: 5
+forumTopicId: 302215
+dashedName: problem-98-anagramic-squares
+---
+
+# --description--
+
+By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: $1296 = 36^2$. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: $9216 = 96^2$. 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 the `words` array, 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 `words` array.
+
+# --hints--
+
+`anagramicSquares(['CARE', 'RACE'])` should return a number.
+
+```js
+assert(typeof anagramicSquares(['CARE', 'RACE']) === 'number');
+```
+
+`anagramicSquares(['CARE', 'RACE'])` should return `9216`.
+
+```js
+assert.strictEqual(anagramicSquares(['CARE', 'RACE']), 9216);
+```
+
+`anagramicSquares(testWords1)` should return `4761`.
+
+```js
+assert.strictEqual(anagramicSquares(_testWords1), 4761);
+```
+
+`anagramicSquares(testWords2)` should return `18769`.
+
+```js
+assert.strictEqual(anagramicSquares(_testWords2), 18769);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testWords1 = [
+  "DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH"
+];
+const _testWords2 = [
+  "A","ABILITY","ABLE","ABOUT","ABOVE","ABSENCE","ABSOLUTELY","ACADEMIC","ACCEPT","ACCESS","ACCIDENT","ACCOMPANY","ACCORDING","ACCOUNT","ACHIEVE","ACHIEVEMENT","ACID","ACQUIRE","ACROSS","ACT","ACTION","ACTIVE","ACTIVITY","ACTUAL","ACTUALLY","ADD","ADDITION","ADDITIONAL","ADDRESS","ADMINISTRATION","ADMIT","ADOPT","ADULT","ADVANCE","ADVANTAGE","ADVICE","ADVISE","AFFAIR","AFFECT","AFFORD","AFRAID","AFTER","AFTERNOON","AFTERWARDS","AGAIN","AGAINST","AGE","AGENCY","AGENT","AGO","AGREE","AGREEMENT","AHEAD","AID","AIM","AIR","AIRCRAFT","ALL","ALLOW","ALMOST","ALONE","ALONG","ALREADY","ALRIGHT","ALSO","ALTERNATIVE","ALTHOUGH","ALWAYS","AMONG","AMONGST","AMOUNT","AN","ANALYSIS","ANCIENT","AND","ANIMAL","ANNOUNCE","ANNUAL","ANOTHER","ANSWER","ANY","ANYBODY","ANYONE","ANYTHING","ANYWAY","APART","APPARENT","APPARENTLY","APPEAL","APPEAR","APPEARANCE","APPLICATION","APPLY","APPOINT","APPOINTMENT","APPROACH","APPROPRIATE","APPROVE","AREA","ARGUE","ARGUMENT","ARISE","ARM","ARMY","AROUND","ARRANGE","ARRANGEMENT","ARRIVE","ART","ARTICLE","ARTIST","AS","ASK","ASPECT","ASSEMBLY","ASSESS","ASSESSMENT","ASSET","ASSOCIATE","ASSOCIATION","ASSUME","ASSUMPTION","AT","ATMOSPHERE","ATTACH","ATTACK","ATTEMPT","ATTEND","ATTENTION","ATTITUDE","ATTRACT","ATTRACTIVE","AUDIENCE","AUTHOR","AUTHORITY","AVAILABLE","AVERAGE","AVOID","AWARD","AWARE","AWAY","AYE","BABY","BACK","BACKGROUND","BAD","BAG","BALANCE","BALL","BAND","BANK","BAR","BASE","BASIC","BASIS","BATTLE","BE","BEAR","BEAT","BEAUTIFUL","BECAUSE","BECOME","BED","BEDROOM","BEFORE","BEGIN","BEGINNING","BEHAVIOUR","BEHIND","BELIEF","BELIEVE","BELONG","BELOW","BENEATH","BENEFIT","BESIDE","BEST","BETTER","BETWEEN","BEYOND","BIG","BILL","BIND","BIRD","BIRTH","BIT","BLACK","BLOCK","BLOOD","BLOODY","BLOW","BLUE","BOARD","BOAT","BODY","BONE","BOOK","BORDER","BOTH","BOTTLE","BOTTOM","BOX","BOY","BRAIN","BRANCH","BREAK","BREATH","BRIDGE","BRIEF","BRIGHT","BRING","BROAD","BROTHER","BUDGET","BUILD","BUILDING","BURN","BUS","BUSINESS","BUSY","BUT","BUY","BY","CABINET","CALL","CAMPAIGN","CAN","CANDIDATE","CAPABLE","CAPACITY","CAPITAL","CAR","CARD","CARE","CAREER","CAREFUL","CAREFULLY","CARRY","CASE","CASH","CAT","CATCH","CATEGORY","CAUSE","CELL","CENTRAL","CENTRE","CENTURY","CERTAIN","CERTAINLY","CHAIN","CHAIR","CHAIRMAN","CHALLENGE","CHANCE","CHANGE","CHANNEL","CHAPTER","CHARACTER","CHARACTERISTIC","CHARGE","CHEAP","CHECK","CHEMICAL","CHIEF","CHILD","CHOICE","CHOOSE","CHURCH","CIRCLE","CIRCUMSTANCE","CITIZEN","CITY","CIVIL","CLAIM","CLASS","CLEAN","CLEAR","CLEARLY","CLIENT","CLIMB","CLOSE","CLOSELY","CLOTHES","CLUB","COAL","CODE","COFFEE","COLD","COLLEAGUE","COLLECT","COLLECTION","COLLEGE","COLOUR","COMBINATION","COMBINE","COME","COMMENT","COMMERCIAL","COMMISSION","COMMIT","COMMITMENT","COMMITTEE","COMMON","COMMUNICATION","COMMUNITY","COMPANY","COMPARE","COMPARISON","COMPETITION","COMPLETE","COMPLETELY","COMPLEX","COMPONENT","COMPUTER","CONCENTRATE","CONCENTRATION","CONCEPT","CONCERN","CONCERNED","CONCLUDE","CONCLUSION","CONDITION","CONDUCT","CONFERENCE","CONFIDENCE","CONFIRM","CONFLICT","CONGRESS","CONNECT","CONNECTION","CONSEQUENCE","CONSERVATIVE","CONSIDER","CONSIDERABLE","CONSIDERATION","CONSIST","CONSTANT","CONSTRUCTION","CONSUMER","CONTACT","CONTAIN","CONTENT","CONTEXT","CONTINUE","CONTRACT","CONTRAST","CONTRIBUTE","CONTRIBUTION","CONTROL","CONVENTION","CONVERSATION","COPY","CORNER","CORPORATE","CORRECT","COS","COST","COULD","COUNCIL","COUNT","COUNTRY","COUNTY","COUPLE","COURSE","COURT","COVER","CREATE","CREATION","CREDIT","CRIME","CRIMINAL","CRISIS","CRITERION","CRITICAL","CRITICISM","CROSS","CROWD","CRY","CULTURAL","CULTURE","CUP","CURRENT","CURRENTLY","CURRICULUM","CUSTOMER","CUT","DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","EACH","EAR","EARLY","EARN","EARTH","EASILY","EAST","EASY","EAT","ECONOMIC","ECONOMY","EDGE","EDITOR","EDUCATION","EDUCATIONAL","EFFECT","EFFECTIVE","EFFECTIVELY","EFFORT","EGG","EITHER","ELDERLY","ELECTION","ELEMENT","ELSE","ELSEWHERE","EMERGE","EMPHASIS","EMPLOY","EMPLOYEE","EMPLOYER","EMPLOYMENT","EMPTY","ENABLE","ENCOURAGE","END","ENEMY","ENERGY","ENGINE","ENGINEERING","ENJOY","ENOUGH","ENSURE","ENTER","ENTERPRISE","ENTIRE","ENTIRELY","ENTITLE","ENTRY","ENVIRONMENT","ENVIRONMENTAL","EQUAL","EQUALLY","EQUIPMENT","ERROR","ESCAPE","ESPECIALLY","ESSENTIAL","ESTABLISH","ESTABLISHMENT","ESTATE","ESTIMATE","EVEN","EVENING","EVENT","EVENTUALLY","EVER","EVERY","EVERYBODY","EVERYONE","EVERYTHING","EVIDENCE","EXACTLY","EXAMINATION","EXAMINE","EXAMPLE","EXCELLENT","EXCEPT","EXCHANGE","EXECUTIVE","EXERCISE","EXHIBITION","EXIST","EXISTENCE","EXISTING","EXPECT","EXPECTATION","EXPENDITURE","EXPENSE","EXPENSIVE","EXPERIENCE","EXPERIMENT","EXPERT","EXPLAIN","EXPLANATION","EXPLORE","EXPRESS","EXPRESSION","EXTEND","EXTENT","EXTERNAL","EXTRA","EXTREMELY","EYE","FACE","FACILITY","FACT","FACTOR","FACTORY","FAIL","FAILURE","FAIR","FAIRLY","FAITH","FALL","FAMILIAR","FAMILY","FAMOUS","FAR","FARM","FARMER","FASHION","FAST","FATHER","FAVOUR","FEAR","FEATURE","FEE","FEEL","FEELING","FEMALE","FEW","FIELD","FIGHT","FIGURE","FILE","FILL","FILM","FINAL","FINALLY","FINANCE","FINANCIAL","FIND","FINDING","FINE","FINGER","FINISH","FIRE","FIRM","FIRST","FISH","FIT","FIX","FLAT","FLIGHT","FLOOR","FLOW","FLOWER","FLY","FOCUS","FOLLOW","FOLLOWING","FOOD","FOOT","FOOTBALL","FOR","FORCE","FOREIGN","FOREST","FORGET","FORM","FORMAL","FORMER","FORWARD","FOUNDATION","FREE","FREEDOM","FREQUENTLY","FRESH","FRIEND","FROM","FRONT","FRUIT","FUEL","FULL","FULLY","FUNCTION","FUND","FUNNY","FURTHER","FUTURE","GAIN","GAME","GARDEN","GAS","GATE","GATHER","GENERAL","GENERALLY","GENERATE","GENERATION","GENTLEMAN","GET","GIRL","GIVE","GLASS","GO","GOAL","GOD","GOLD","GOOD","GOVERNMENT","GRANT","GREAT","GREEN","GREY","GROUND","GROUP","GROW","GROWING","GROWTH","GUEST","GUIDE","GUN","HAIR","HALF","HALL","HAND","HANDLE","HANG","HAPPEN","HAPPY","HARD","HARDLY","HATE","HAVE","HE","HEAD","HEALTH","HEAR","HEART","HEAT","HEAVY","HELL","HELP","HENCE","HER","HERE","HERSELF","HIDE","HIGH","HIGHLY","HILL","HIM","HIMSELF","HIS","HISTORICAL","HISTORY","HIT","HOLD","HOLE","HOLIDAY","HOME","HOPE","HORSE","HOSPITAL","HOT","HOTEL","HOUR","HOUSE","HOUSEHOLD","HOUSING","HOW","HOWEVER","HUGE","HUMAN","HURT","HUSBAND","I","IDEA","IDENTIFY","IF","IGNORE","ILLUSTRATE","IMAGE","IMAGINE","IMMEDIATE","IMMEDIATELY","IMPACT","IMPLICATION","IMPLY","IMPORTANCE","IMPORTANT","IMPOSE","IMPOSSIBLE","IMPRESSION","IMPROVE","IMPROVEMENT","IN","INCIDENT","INCLUDE","INCLUDING","INCOME","INCREASE","INCREASED","INCREASINGLY","INDEED","INDEPENDENT","INDEX","INDICATE","INDIVIDUAL","INDUSTRIAL","INDUSTRY","INFLUENCE","INFORM","INFORMATION","INITIAL","INITIATIVE","INJURY","INSIDE","INSIST","INSTANCE","INSTEAD","INSTITUTE","INSTITUTION","INSTRUCTION","INSTRUMENT","INSURANCE","INTEND","INTENTION","INTEREST","INTERESTED","INTERESTING","INTERNAL","INTERNATIONAL","INTERPRETATION","INTERVIEW","INTO","INTRODUCE","INTRODUCTION","INVESTIGATE","INVESTIGATION","INVESTMENT","INVITE","INVOLVE","IRON","IS","ISLAND","ISSUE","IT","ITEM","ITS","ITSELF","JOB","JOIN","JOINT","JOURNEY","JUDGE","JUMP","JUST","JUSTICE","KEEP","KEY","KID","KILL","KIND","KING","KITCHEN","KNEE","KNOW","KNOWLEDGE","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH","MACHINE","MAGAZINE","MAIN","MAINLY","MAINTAIN","MAJOR","MAJORITY","MAKE","MALE","MAN","MANAGE","MANAGEMENT","MANAGER","MANNER","MANY","MAP","MARK","MARKET","MARRIAGE","MARRIED","MARRY","MASS","MASTER","MATCH","MATERIAL","MATTER","MAY","MAYBE","ME","MEAL","MEAN","MEANING","MEANS","MEANWHILE","MEASURE","MECHANISM","MEDIA","MEDICAL","MEET","MEETING","MEMBER","MEMBERSHIP","MEMORY","MENTAL","MENTION","MERELY","MESSAGE","METAL","METHOD","MIDDLE","MIGHT","MILE","MILITARY","MILK","MIND","MINE","MINISTER","MINISTRY","MINUTE","MISS","MISTAKE","MODEL","MODERN","MODULE","MOMENT","MONEY","MONTH","MORE","MORNING","MOST","MOTHER","MOTION","MOTOR","MOUNTAIN","MOUTH","MOVE","MOVEMENT","MUCH","MURDER","MUSEUM","MUSIC","MUST","MY","MYSELF","NAME","NARROW","NATION","NATIONAL","NATURAL","NATURE","NEAR","NEARLY","NECESSARILY","NECESSARY","NECK","NEED","NEGOTIATION","NEIGHBOUR","NEITHER","NETWORK","NEVER","NEVERTHELESS","NEW","NEWS","NEWSPAPER","NEXT","NICE","NIGHT","NO","NOBODY","NOD","NOISE","NONE","NOR","NORMAL","NORMALLY","NORTH","NORTHERN","NOSE","NOT","NOTE","NOTHING","NOTICE","NOTION","NOW","NUCLEAR","NUMBER","NURSE","OBJECT","OBJECTIVE","OBSERVATION","OBSERVE","OBTAIN","OBVIOUS","OBVIOUSLY","OCCASION","OCCUR","ODD","OF","OFF","OFFENCE","OFFER","OFFICE","OFFICER","OFFICIAL","OFTEN","OIL","OKAY","OLD","ON","ONCE","ONE","ONLY","ONTO","OPEN","OPERATE","OPERATION","OPINION","OPPORTUNITY","OPPOSITION","OPTION","OR","ORDER","ORDINARY","ORGANISATION","ORGANISE","ORGANIZATION","ORIGIN","ORIGINAL","OTHER","OTHERWISE","OUGHT","OUR","OURSELVES","OUT","OUTCOME","OUTPUT","OUTSIDE","OVER","OVERALL","OWN","OWNER","PACKAGE","PAGE","PAIN","PAINT","PAINTING","PAIR","PANEL","PAPER","PARENT","PARK","PARLIAMENT","PART","PARTICULAR","PARTICULARLY","PARTLY","PARTNER","PARTY","PASS","PASSAGE","PAST","PATH","PATIENT","PATTERN","PAY","PAYMENT","PEACE","PENSION","PEOPLE","PER","PERCENT","PERFECT","PERFORM","PERFORMANCE","PERHAPS","PERIOD","PERMANENT","PERSON","PERSONAL","PERSUADE","PHASE","PHONE","PHOTOGRAPH","PHYSICAL","PICK","PICTURE","PIECE","PLACE","PLAN","PLANNING","PLANT","PLASTIC","PLATE","PLAY","PLAYER","PLEASE","PLEASURE","PLENTY","PLUS","POCKET","POINT","POLICE","POLICY","POLITICAL","POLITICS","POOL","POOR","POPULAR","POPULATION","POSITION","POSITIVE","POSSIBILITY","POSSIBLE","POSSIBLY","POST","POTENTIAL","POUND","POWER","POWERFUL","PRACTICAL","PRACTICE","PREFER","PREPARE","PRESENCE","PRESENT","PRESIDENT","PRESS","PRESSURE","PRETTY","PREVENT","PREVIOUS","PREVIOUSLY","PRICE","PRIMARY","PRIME","PRINCIPLE","PRIORITY","PRISON","PRISONER","PRIVATE","PROBABLY","PROBLEM","PROCEDURE","PROCESS","PRODUCE","PRODUCT","PRODUCTION","PROFESSIONAL","PROFIT","PROGRAM","PROGRAMME","PROGRESS","PROJECT","PROMISE","PROMOTE","PROPER","PROPERLY","PROPERTY","PROPORTION","PROPOSE","PROPOSAL","PROSPECT","PROTECT","PROTECTION","PROVE","PROVIDE","PROVIDED","PROVISION","PUB","PUBLIC","PUBLICATION","PUBLISH","PULL","PUPIL","PURPOSE","PUSH","PUT","QUALITY","QUARTER","QUESTION","QUICK","QUICKLY","QUIET","QUITE","RACE","RADIO","RAILWAY","RAIN","RAISE","RANGE","RAPIDLY","RARE","RATE","RATHER","REACH","REACTION","READ","READER","READING","READY","REAL","REALISE","REALITY","REALIZE","REALLY","REASON","REASONABLE","RECALL","RECEIVE","RECENT","RECENTLY","RECOGNISE","RECOGNITION","RECOGNIZE","RECOMMEND","RECORD","RECOVER","RED","REDUCE","REDUCTION","REFER","REFERENCE","REFLECT","REFORM","REFUSE","REGARD","REGION","REGIONAL","REGULAR","REGULATION","REJECT","RELATE","RELATION","RELATIONSHIP","RELATIVE","RELATIVELY","RELEASE","RELEVANT","RELIEF","RELIGION","RELIGIOUS","RELY","REMAIN","REMEMBER","REMIND","REMOVE","REPEAT","REPLACE","REPLY","REPORT","REPRESENT","REPRESENTATION","REPRESENTATIVE","REQUEST","REQUIRE","REQUIREMENT","RESEARCH","RESOURCE","RESPECT","RESPOND","RESPONSE","RESPONSIBILITY","RESPONSIBLE","REST","RESTAURANT","RESULT","RETAIN","RETURN","REVEAL","REVENUE","REVIEW","REVOLUTION","RICH","RIDE","RIGHT","RING","RISE","RISK","RIVER","ROAD","ROCK","ROLE","ROLL","ROOF","ROOM","ROUND","ROUTE","ROW","ROYAL","RULE","RUN","RURAL","SAFE","SAFETY","SALE","SAME","SAMPLE","SATISFY","SAVE","SAY","SCALE","SCENE","SCHEME","SCHOOL","SCIENCE","SCIENTIFIC","SCIENTIST","SCORE","SCREEN","SEA","SEARCH","SEASON","SEAT","SECOND","SECONDARY","SECRETARY","SECTION","SECTOR","SECURE","SECURITY","SEE","SEEK","SEEM","SELECT","SELECTION","SELL","SEND","SENIOR","SENSE","SENTENCE","SEPARATE","SEQUENCE","SERIES","SERIOUS","SERIOUSLY","SERVANT","SERVE","SERVICE","SESSION","SET","SETTLE","SETTLEMENT","SEVERAL","SEVERE","SEX","SEXUAL","SHAKE","SHALL","SHAPE","SHARE","SHE","SHEET","SHIP","SHOE","SHOOT","SHOP","SHORT","SHOT","SHOULD","SHOULDER","SHOUT","SHOW","SHUT","SIDE","SIGHT","SIGN","SIGNAL","SIGNIFICANCE","SIGNIFICANT","SILENCE","SIMILAR","SIMPLE","SIMPLY","SINCE","SING","SINGLE","SIR","SISTER","SIT","SITE","SITUATION","SIZE","SKILL","SKIN","SKY","SLEEP","SLIGHTLY","SLIP","SLOW","SLOWLY","SMALL","SMILE","SO","SOCIAL","SOCIETY","SOFT","SOFTWARE","SOIL","SOLDIER","SOLICITOR","SOLUTION","SOME","SOMEBODY","SOMEONE","SOMETHING","SOMETIMES","SOMEWHAT","SOMEWHERE","SON","SONG","SOON","SORRY","SORT","SOUND","SOURCE","SOUTH","SOUTHERN","SPACE","SPEAK","SPEAKER","SPECIAL","SPECIES","SPECIFIC","SPEECH","SPEED","SPEND","SPIRIT","SPORT","SPOT","SPREAD","SPRING","STAFF","STAGE","STAND","STANDARD","STAR","START","STATE","STATEMENT","STATION","STATUS","STAY","STEAL","STEP","STICK","STILL","STOCK","STONE","STOP","STORE","STORY","STRAIGHT","STRANGE","STRATEGY","STREET","STRENGTH","STRIKE","STRONG","STRONGLY","STRUCTURE","STUDENT","STUDIO","STUDY","STUFF","STYLE","SUBJECT","SUBSTANTIAL","SUCCEED","SUCCESS","SUCCESSFUL","SUCH","SUDDENLY","SUFFER","SUFFICIENT","SUGGEST","SUGGESTION","SUITABLE","SUM","SUMMER","SUN","SUPPLY","SUPPORT","SUPPOSE","SURE","SURELY","SURFACE","SURPRISE","SURROUND","SURVEY","SURVIVE","SWITCH","SYSTEM","TABLE","TAKE","TALK","TALL","TAPE","TARGET","TASK","TAX","TEA","TEACH","TEACHER","TEACHING","TEAM","TEAR","TECHNICAL","TECHNIQUE","TECHNOLOGY","TELEPHONE","TELEVISION","TELL","TEMPERATURE","TEND","TERM","TERMS","TERRIBLE","TEST","TEXT","THAN","THANK","THANKS","THAT","THE","THEATRE","THEIR","THEM","THEME","THEMSELVES","THEN","THEORY","THERE","THEREFORE","THESE","THEY","THIN","THING","THINK","THIS","THOSE","THOUGH","THOUGHT","THREAT","THREATEN","THROUGH","THROUGHOUT","THROW","THUS","TICKET","TIME","TINY","TITLE","TO","TODAY","TOGETHER","TOMORROW","TONE","TONIGHT","TOO","TOOL","TOOTH","TOP","TOTAL","TOTALLY","TOUCH","TOUR","TOWARDS","TOWN","TRACK","TRADE","TRADITION","TRADITIONAL","TRAFFIC","TRAIN","TRAINING","TRANSFER","TRANSPORT","TRAVEL","TREAT","TREATMENT","TREATY","TREE","TREND","TRIAL","TRIP","TROOP","TROUBLE","TRUE","TRUST","TRUTH","TRY","TURN","TWICE","TYPE","TYPICAL","UNABLE","UNDER","UNDERSTAND","UNDERSTANDING","UNDERTAKE","UNEMPLOYMENT","UNFORTUNATELY","UNION","UNIT","UNITED","UNIVERSITY","UNLESS","UNLIKELY","UNTIL","UP","UPON","UPPER","URBAN","US","USE","USED","USEFUL","USER","USUAL","USUALLY","VALUE","VARIATION","VARIETY","VARIOUS","VARY","VAST","VEHICLE","VERSION","VERY","VIA","VICTIM","VICTORY","VIDEO","VIEW","VILLAGE","VIOLENCE","VISION","VISIT","VISITOR","VITAL","VOICE","VOLUME","VOTE","WAGE","WAIT","WALK","WALL","WANT","WAR","WARM","WARN","WASH","WATCH","WATER","WAVE","WAY","WE","WEAK","WEAPON","WEAR","WEATHER","WEEK","WEEKEND","WEIGHT","WELCOME","WELFARE","WELL","WEST","WESTERN","WHAT","WHATEVER","WHEN","WHERE","WHEREAS","WHETHER","WHICH","WHILE","WHILST","WHITE","WHO","WHOLE","WHOM","WHOSE","WHY","WIDE","WIDELY","WIFE","WILD","WILL","WIN","WIND","WINDOW","WINE","WING","WINNER","WINTER","WISH","WITH","WITHDRAW","WITHIN","WITHOUT","WOMAN","WONDER","WONDERFUL","WOOD","WORD","WORK","WORKER","WORKING","WORKS","WORLD","WORRY","WORTH","WOULD","WRITE","WRITER","WRITING","WRONG","YARD","YEAH","YEAR","YES","YESTERDAY","YET","YOU","YOUNG","YOUR","YOURSELF","YOUTH"
+];
+```
+
+## --seed-contents--
+
+```js
+function anagramicSquares(words) {
+
+  return true;
+}
+
+// Only change code above this line
+const testWords1 = [
+"DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH"
+];
+
+anagramicSquares(testWords1);
+```
+
+# --solutions--
+
+```js
+function anagramicSquares(words) {
+  // Based on https://www.mathblog.dk/project-euler-98-anagrams-square-numbers/
+  function findMaximumSquare(squares, word1, word2) {
+    let maximumSquare = 0;
+
+    for (let i = 0; i < squares.length; i++) {
+      const length = squares[i].toString().length;
+
+      if (length < word1.length) {
+        continue;
+      }
+      if (length > word1.length) {
+        break;
+      }
+
+      const word1Square = squares[i];
+      const letterToDigit = mapLettersToDigits(word1, word1Square);
+
+      const noProperMappingExist = Object.keys(letterToDigit).length === 0;
+      if (noProperMappingExist) {
+        continue;
+      }
+
+      const word2Square = getNumberFromMapping(word2, letterToDigit);
+      if (word2Square === 0) {
+        continue;
+      }
+
+      const doesWord2SquareExist = squares.indexOf(word2Square) !== -1;
+      if (doesWord2SquareExist) {
+        const pairMaximum = Math.max(word1Square, word2Square);
+        maximumSquare = Math.max(maximumSquare, pairMaximum);
+      }
+    }
+    return maximumSquare;
+  }
+
+  function getNumberFromMapping(word, letterToDigit) {
+    const wouldNumberHaveLeadingZero = letterToDigit[word[0]] === 0;
+    if (wouldNumberHaveLeadingZero) {
+      return 0;
+    }
+
+    let number = 0;
+    for (let i = 0; i < word.length; i++) {
+      number = number * 10 + letterToDigit[word[i]];
+    }
+    return number;
+  }
+
+  function mapLettersToDigits(word, square) {
+    const letterToDigit = {};
+    for (let j = word.length - 1; j >= 0; j--) {
+      const curDigit = square % 10;
+      square = Math.floor(square / 10);
+
+      const curLetter = word[j];
+
+      const isLetterRepeated = letterToDigit.hasOwnProperty(curLetter);
+      if (isLetterRepeated) {
+        const isLetterUsedForTheSameDigit =
+          letterToDigit[curLetter] === curDigit;
+        if (isLetterUsedForTheSameDigit) {
+          continue;
+        }
+
+        return {};
+      }
+
+      const isDigitUsed = Object.values(letterToDigit).indexOf(curDigit) !== -1;
+      if (isDigitUsed) {
+        return {};
+      }
+
+      letterToDigit[curLetter] = curDigit;
+    }
+    return letterToDigit;
+  }
+
+  function groupWordsWithSameLetters(words) {
+    const lettersToWords = {};
+    for (let i = 0; i < words.length; i++) {
+      const word = words[i];
+      const sortedLetters = word.split('').sort().join('');
+      if (!lettersToWords.hasOwnProperty(sortedLetters)) {
+        lettersToWords[sortedLetters] = [];
+      }
+      lettersToWords[sortedLetters].push(word);
+    }
+    return lettersToWords;
+  }
+
+  const lettersToWords = groupWordsWithSameLetters(words);
+
+  const anagrams = Object.keys(lettersToWords).filter(
+    letters => lettersToWords[letters].length > 1
+  );
+  const lengthOfLongestAnagram = anagrams
+    .map(anagram => anagram.length)
+    .sort((a, b) => b - a)[0];
+
+  const squares = [];
+  const numberLimit = (10 ** lengthOfLongestAnagram) ** 0.5;
+  for (let number = 2; number < numberLimit; number++) {
+    const square = number ** 2;
+    squares.push(square);
+  }
+
+  let largestSquare = 0;
+  for (let i = 0; i < anagrams.length; i++) {
+    const curWords = lettersToWords[anagrams[i]];
+
+    for (let j = 0; j < curWords.length; j++) {
+      for (let k = j + 1; k < curWords.length; k++) {
+        const squareValue = findMaximumSquare(
+          squares,
+          curWords[j],
+          curWords[k]
+        );
+        if (squareValue > largestSquare) {
+          largestSquare = squareValue;
+        }
+      }
+    }
+  }
+
+  return largestSquare;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
new file mode 100644
index 0000000000..07d9a48f01
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3d01000cf542c50fee2
+title: 'Problem 99: Largest exponential'
+challengeType: 5
+forumTopicId: 302216
+dashedName: problem-99-largest-exponential
+---
+
+# --description--
+
+Comparing two numbers written in index form like $2^{11}$ and $3^7$ is not difficult, as any calculator would confirm that $2^{11} = 2048 &lt; 3^7 = 2187$.
+
+However, confirming that $632382^{518061} &lt; 519432^{525806}$ would be much more difficult, as both numbers contain over three million digits.
+
+Using the 2D `baseExp` array of base/exponent pairs, determine pair with the greatest numerical value and return it.
+
+# --hints--
+
+`largestExponential(testArray1)` should return an array.
+
+```js
+assert(Array.isArray(largestExponential(_testArray1)));
+```
+
+`largestExponential(testArray1)` should return `[840237, 507276]`.
+
+```js
+assert.deepEqual(largestExponential(_testArray1), [840237, 507276]);
+```
+
+`largestExponential(testArray2)` should return `[895447, 504922]`.
+
+```js
+assert.deepEqual(largestExponential(_testArray2), [895447, 504922]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testArray1 = [
+  [492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123]
+];
+const _testArray2 = [
+  [519432,525806],[632382,518061],[78864,613712],[466580,530130],[780495,510032],[525895,525320],[15991,714883],[960290,502358],[760018,511029],[166800,575487],[210884,564478],[555151,523163],[681146,515199],[563395,522587],[738250,512126],[923525,503780],[595148,520429],[177108,572629],[750923,511482],[440902,532446],[881418,505504],[422489,534197],[979858,501616],[685893,514935],[747477,511661],[167214,575367],[234140,559696],[940238,503122],[728969,512609],[232083,560102],[900971,504694],[688801,514772],[189664,569402],[891022,505104],[445689,531996],[119570,591871],[821453,508118],[371084,539600],[911745,504251],[623655,518600],[144361,582486],[352442,541775],[420726,534367],[295298,549387],[6530,787777],[468397,529976],[672336,515696],[431861,533289],[84228,610150],[805376,508857],[444409,532117],[33833,663511],[381850,538396],[402931,536157],[92901,604930],[304825,548004],[731917,512452],[753734,511344],[51894,637373],[151578,580103],[295075,549421],[303590,548183],[333594,544123],[683952,515042],[60090,628880],[951420,502692],[28335,674991],[714940,513349],[343858,542826],[549279,523586],[804571,508887],[260653,554881],[291399,549966],[402342,536213],[408889,535550],[40328,652524],[375856,539061],[768907,510590],[165993,575715],[976327,501755],[898500,504795],[360404,540830],[478714,529095],[694144,514472],[488726,528258],[841380,507226],[328012,544839],[22389,690868],[604053,519852],[329514,544641],[772965,510390],[492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123],[597706,520257],[310484,547206],[944468,502959],[121283,591152],[451131,531507],[566499,522367],[425373,533918],[40240,652665],[39130,654392],[714926,513355],[469219,529903],[806929,508783],[287970,550487],[92189,605332],[103841,599094],[671839,515725],[452048,531421],[987837,501323],[935192,503321],[88585,607450],[613883,519216],[144551,582413],[647359,517155],[213902,563816],[184120,570789],[258126,555322],[502546,527130],[407655,535678],[401528,536306],[477490,529193],[841085,507237],[732831,512408],[833000,507595],[904694,504542],[581435,521348],[455545,531110],[873558,505829],[94916,603796],[720176,513068],[545034,523891],[246348,557409],[556452,523079],[832015,507634],[173663,573564],[502634,527125],[250732,556611],[569786,522139],[216919,563178],[521815,525623],[92304,605270],[164446,576167],[753413,511364],[11410,740712],[448845,531712],[925072,503725],[564888,522477],[7062,780812],[641155,517535],[738878,512100],[636204,517828],[372540,539436],[443162,532237],[571192,522042],[655350,516680],[299741,548735],[581914,521307],[965471,502156],[513441,526277],[808682,508700],[237589,559034],[543300,524025],[804712,508889],[247511,557192],[543486,524008],[504383,526992],[326529,545039],[792493,509458],[86033,609017],[126554,589005],[579379,521481],[948026,502823],[404777,535969],[265767,554022],[266876,553840],[46631,643714],[492397,527958],[856106,506581],[795757,509305],[748946,511584],[294694,549480],[409781,535463],[775887,510253],[543747,523991],[210592,564536],[517119,525990],[520253,525751],[247926,557124],[592141,520626],[346580,542492],[544969,523902],[506501,526817],[244520,557738],[144745,582349],[69274,620858],[292620,549784],[926027,503687],[736320,512225],[515528,526113],[407549,535688],[848089,506927],[24141,685711],[9224,757964],[980684,501586],[175259,573121],[489160,528216],[878970,505604],[969546,502002],[525207,525365],[690461,514675],[156510,578551],[659778,516426],[468739,529945],[765252,510770],[76703,615230],[165151,575959],[29779,671736],[928865,503569],[577538,521605],[927555,503618],[185377,570477],[974756,501809],[800130,509093],[217016,563153],[365709,540216],[774508,510320],[588716,520851],[631673,518104],[954076,502590],[777828,510161],[990659,501222],[597799,520254],[786905,509727],[512547,526348],[756449,511212],[869787,505988],[653747,516779],[84623,609900],[839698,507295],[30159,670909],[797275,509234],[678136,515373],[897144,504851],[989554,501263],[413292,535106],[55297,633667],[788650,509637],[486748,528417],[150724,580377],[56434,632490],[77207,614869],[588631,520859],[611619,519367],[100006,601055],[528924,525093],[190225,569257],[851155,506789],[682593,515114],[613043,519275],[514673,526183],[877634,505655],[878905,505602],[1926,914951],[613245,519259],[152481,579816],[841774,507203],[71060,619442],[865335,506175],[90244,606469],[302156,548388],[399059,536557],[478465,529113],[558601,522925],[69132,620966],[267663,553700],[988276,501310],[378354,538787],[529909,525014],[161733,576968],[758541,511109],[823425,508024],[149821,580667],[269258,553438],[481152,528891],[120871,591322],[972322,501901],[981350,501567],[676129,515483],[950860,502717],[119000,592114],[392252,537272],[191618,568919],[946699,502874],[289555,550247],[799322,509139],[703886,513942],[194812,568143],[261823,554685],[203052,566221],[217330,563093],[734748,512313],[391759,537328],[807052,508777],[564467,522510],[59186,629748],[113447,594545],[518063,525916],[905944,504492],[613922,519213],[439093,532607],[445946,531981],[230530,560399],[297887,549007],[459029,530797],[403692,536075],[855118,506616],[963127,502245],[841711,507208],[407411,535699],[924729,503735],[914823,504132],[333725,544101],[176345,572832],[912507,504225],[411273,535308],[259774,555036],[632853,518038],[119723,591801],[163902,576321],[22691,689944],[402427,536212],[175769,572988],[837260,507402],[603432,519893],[313679,546767],[538165,524394],[549026,523608],[61083,627945],[898345,504798],[992556,501153],[369999,539727],[32847,665404],[891292,505088],[152715,579732],[824104,507997],[234057,559711],[730507,512532],[960529,502340],[388395,537687],[958170,502437],[57105,631806],[186025,570311],[993043,501133],[576770,521664],[215319,563513],[927342,503628],[521353,525666],[39563,653705],[752516,511408],[110755,595770],[309749,547305],[374379,539224],[919184,503952],[990652,501226],[647780,517135],[187177,570017],[168938,574877],[649558,517023],[278126,552016],[162039,576868],[658512,516499],[498115,527486],[896583,504868],[561170,522740],[747772,511647],[775093,510294],[652081,516882],[724905,512824],[499707,527365],[47388,642755],[646668,517204],[571700,522007],[180430,571747],[710015,513617],[435522,532941],[98137,602041],[759176,511070],[486124,528467],[526942,525236],[878921,505604],[408313,535602],[926980,503640],[882353,505459],[566887,522345],[3326,853312],[911981,504248],[416309,534800],[392991,537199],[622829,518651],[148647,581055],[496483,527624],[666314,516044],[48562,641293],[672618,515684],[443676,532187],[274065,552661],[265386,554079],[347668,542358],[31816,667448],[181575,571446],[961289,502320],[365689,540214],[987950,501317],[932299,503440],[27388,677243],[746701,511701],[492258,527969],[147823,581323],[57918,630985],[838849,507333],[678038,515375],[27852,676130],[850241,506828],[818403,508253],[131717,587014],[850216,506834],[904848,504529],[189758,569380],[392845,537217],[470876,529761],[925353,503711],[285431,550877],[454098,531234],[823910,508003],[318493,546112],[766067,510730],[261277,554775],[421530,534289],[694130,514478],[120439,591498],[213308,563949],[854063,506662],[365255,540263],[165437,575872],[662240,516281],[289970,550181],[847977,506933],[546083,523816],[413252,535113],[975829,501767],[361540,540701],[235522,559435],[224643,561577],[736350,512229],[328303,544808],[35022,661330],[307838,547578],[474366,529458],[873755,505819],[73978,617220],[827387,507845],[670830,515791],[326511,545034],[309909,547285],[400970,536363],[884827,505352],[718307,513175],[28462,674699],[599384,520150],[253565,556111],[284009,551093],[343403,542876],[446557,531921],[992372,501160],[961601,502308],[696629,514342],[919537,503945],[894709,504944],[892201,505051],[358160,541097],[448503,531745],[832156,507636],[920045,503924],[926137,503675],[416754,534757],[254422,555966],[92498,605151],[826833,507873],[660716,516371],[689335,514746],[160045,577467],[814642,508425],[969939,501993],[242856,558047],[76302,615517],[472083,529653],[587101,520964],[99066,601543],[498005,527503],[709800,513624],[708000,513716],[20171,698134],[285020,550936],[266564,553891],[981563,501557],[846502,506991],[334,1190800],[209268,564829],[9844,752610],[996519,501007],[410059,535426],[432931,533188],[848012,506929],[966803,502110],[983434,501486],[160700,577267],[504374,526989],[832061,507640],[392825,537214],[443842,532165],[440352,532492],[745125,511776],[13718,726392],[661753,516312],[70500,619875],[436952,532814],[424724,533973],[21954,692224],[262490,554567],[716622,513264],[907584,504425],[60086,628882],[837123,507412],[971345,501940],[947162,502855],[139920,584021],[68330,621624],[666452,516038],[731446,512481],[953350,502619],[183157,571042],[845400,507045],[651548,516910],[20399,697344],[861779,506331],[629771,518229],[801706,509026],[189207,569512],[737501,512168],[719272,513115],[479285,529045],[136046,585401],[896746,504860],[891735,505067],[684771,514999],[865309,506184],[379066,538702],[503117,527090],[621780,518717],[209518,564775],[677135,515423],[987500,501340],[197049,567613],[329315,544673],[236756,559196],[357092,541226],[520440,525733],[213471,563911],[956852,502490],[702223,514032],[404943,535955],[178880,572152],[689477,514734],[691351,514630],[866669,506128],[370561,539656],[739805,512051],[71060,619441],[624861,518534],[261660,554714],[366137,540160],[166054,575698],[601878,519990],[153445,579501],[279899,551729],[379166,538691],[423209,534125],[675310,515526],[145641,582050],[691353,514627],[917468,504026],[284778,550976],[81040,612235],[161699,576978],[616394,519057],[767490,510661],[156896,578431],[427408,533714],[254849,555884],[737217,512182],[897133,504851],[203815,566051],[270822,553189],[135854,585475],[778805,510111],[784373,509847],[305426,547921],[733418,512375],[732087,512448],[540668,524215],[702898,513996],[628057,518328],[640280,517587],[422405,534204],[10604,746569],[746038,511733],[839808,507293],[457417,530938],[479030,529064],[341758,543090],[620223,518824],[251661,556451],[561790,522696],[497733,527521],[724201,512863],[489217,528217],[415623,534867],[624610,518548],[847541,506953],[432295,533249],[400391,536421],[961158,502319],[139173,584284],[421225,534315],[579083,521501],[74274,617000],[701142,514087],[374465,539219],[217814,562985],[358972,540995],[88629,607424],[288597,550389],[285819,550812],[538400,524385],[809930,508645],[738326,512126],[955461,502535],[163829,576343],[826475,507891],[376488,538987],[102234,599905],[114650,594002],[52815,636341],[434037,533082],[804744,508880],[98385,601905],[856620,506559],[220057,562517],[844734,507078],[150677,580387],[558697,522917],[621751,518719],[207067,565321],[135297,585677],[932968,503404],[604456,519822],[579728,521462],[244138,557813],[706487,513800],[711627,513523],[853833,506674],[497220,527562],[59428,629511],[564845,522486],[623621,518603],[242689,558077],[125091,589591],[363819,540432],[686453,514901],[656813,516594],[489901,528155],[386380,537905],[542819,524052],[243987,557841],[693412,514514],[488484,528271],[896331,504881],[336730,543721],[728298,512647],[604215,519840],[153729,579413],[595687,520398],[540360,524240],[245779,557511],[924873,503730],[509628,526577],[528523,525122],[3509,847707],[522756,525555],[895447,504922],[44840,646067],[45860,644715],[463487,530404],[398164,536654],[894483,504959],[619415,518874],[966306,502129],[990922,501212],[835756,507474],[548881,523618],[453578,531282],[474993,529410],[80085,612879],[737091,512193],[50789,638638],[979768,501620],[792018,509483],[665001,516122],[86552,608694],[462772,530469],[589233,520821],[891694,505072],[592605,520594],[209645,564741],[42531,649269],[554376,523226],[803814,508929],[334157,544042],[175836,572970],[868379,506051],[658166,516520],[278203,551995],[966198,502126],[627162,518387],[296774,549165],[311803,547027],[843797,507118],[702304,514032],[563875,522553],[33103,664910],[191932,568841],[543514,524006],[506835,526794],[868368,506052],[847025,506971],[678623,515342],[876139,505726],[571997,521984],[598632,520198],[213590,563892],[625404,518497],[726508,512738],[689426,514738],[332495,544264],[411366,535302],[242546,558110],[315209,546555],[797544,509219],[93889,604371],[858879,506454],[124906,589666],[449072,531693],[235960,559345],[642403,517454],[720567,513047],[705534,513858],[603692,519870],[488137,528302],[157370,578285],[63515,625730],[666326,516041],[619226,518883],[443613,532186],[597717,520257],[96225,603069],[86940,608450],[40725,651929],[460976,530625],[268875,553508],[270671,553214],[363254,540500],[384248,538137],[762889,510892],[377941,538833],[278878,551890],[176615,572755],[860008,506412],[944392,502967],[608395,519571],[225283,561450],[45095,645728],[333798,544090],[625733,518476],[995584,501037],[506135,526853],[238050,558952],[557943,522972],[530978,524938],[634244,517949],[177168,572616],[85200,609541],[953043,502630],[523661,525484],[999295,500902],[840803,507246],[961490,502312],[471747,529685],[380705,538523],[911180,504275],[334149,544046],[478992,529065],[325789,545133],[335884,543826],[426976,533760],[749007,511582],[667067,516000],[607586,519623],[674054,515599],[188534,569675],[565185,522464],[172090,573988],[87592,608052],[907432,504424],[8912,760841],[928318,503590],[757917,511138],[718693,513153],[315141,546566],[728326,512645],[353492,541647],[638429,517695],[628892,518280],[877286,505672],[620895,518778],[385878,537959],[423311,534113],[633501,517997],[884833,505360],[883402,505416],[999665,500894],[708395,513697],[548142,523667],[756491,511205],[987352,501340],[766520,510705],[591775,520647],[833758,507563],[843890,507108],[925551,503698],[74816,616598],[646942,517187],[354923,541481],[256291,555638],[634470,517942],[930904,503494],[134221,586071],[282663,551304],[986070,501394],[123636,590176],[123678,590164],[481717,528841],[423076,534137],[866246,506145],[93313,604697],[783632,509880],[317066,546304],[502977,527103],[141272,583545],[71708,618938],[617748,518975],[581190,521362],[193824,568382],[682368,515131],[352956,541712],[351375,541905],[505362,526909],[905165,504518],[128645,588188],[267143,553787],[158409,577965],[482776,528754],[628896,518282],[485233,528547],[563606,522574],[111001,595655],[115920,593445],[365510,540237],[959724,502374],[938763,503184],[930044,503520],[970959,501956],[913658,504176],[68117,621790],[989729,501253],[567697,522288],[820427,508163],[54236,634794],[291557,549938],[124961,589646],[403177,536130],[405421,535899],[410233,535417],[815111,508403],[213176,563974],[83099,610879],[998588,500934],[513640,526263],[129817,587733],[1820,921851],[287584,550539],[299160,548820],[860621,506386],[529258,525059],[586297,521017],[953406,502616],[441234,532410],[986217,501386],[781938,509957],[461247,530595],[735424,512277],[146623,581722],[839838,507288],[510667,526494],[935085,503327],[737523,512167],[303455,548204],[992779,501145],[60240,628739],[939095,503174],[794368,509370],[501825,527189],[459028,530798],[884641,505363],[512287,526364],[835165,507499],[307723,547590],[160587,577304],[735043,512300],[493289,527887],[110717,595785],[306480,547772],[318593,546089],[179810,571911],[200531,566799],[314999,546580],[197020,567622],[301465,548487],[237808,559000],[131944,586923],[882527,505449],[468117,530003],[711319,513541],[156240,578628],[965452,502162],[992756,501148],[437959,532715],[739938,512046],[614249,519196],[391496,537356],[62746,626418],[688215,514806],[75501,616091],[883573,505412],[558824,522910],[759371,511061],[173913,573489],[891351,505089],[727464,512693],[164833,576051],[812317,508529],[540320,524243],[698061,514257],[69149,620952],[471673,529694],[159092,577753],[428134,533653],[89997,606608],[711061,513557],[779403,510081],[203327,566155],[798176,509187],[667688,515963],[636120,517833],[137410,584913],[217615,563034],[556887,523038],[667229,515991],[672276,515708],[325361,545187],[172115,573985],[13846,725685]
+];
+```
+
+## --seed-contents--
+
+```js
+function largestExponential(baseExp) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testArray1 = [
+  [492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123]
+];
+
+largestExponential(testArray1);
+```
+
+# --solutions--
+
+```js
+function largestExponential(baseExp) {
+  let maximum = 0;
+  let indexOfMaximum = 0;
+  for (let i = 1; i < baseExp.length; i++) {
+    const curValue = Math.log(baseExp[i][0]) * baseExp[i][1];
+    if (curValue > maximum) {
+      maximum = curValue;
+      indexOfMaximum = i;
+    }
+  }
+
+  return baseExp[indexOfMaximum];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/100-doors.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/100-doors.md
new file mode 100644
index 0000000000..e791c06558
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/100-doors.md
@@ -0,0 +1,67 @@
+---
+id: 594810f028c0303b75339acb
+title: 100 doors
+challengeType: 5
+forumTopicId: 302217
+dashedName: 100-doors
+---
+
+# --description--
+
+There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and 'toggle' the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (i.e., door #2, #4, #6, ...) and toggle it. The third time, visit every 3rd door (i.e., door #3, #6, #9, ...), etc., until you only visit the 100th door.
+
+# --instructions--
+
+Implement a function to determine the state of the doors after the last pass. Return the final result in an array, with only the door number included in the array if it is open.
+
+# --hints--
+
+`getFinalOpenedDoors` should be a function.
+
+```js
+assert(typeof getFinalOpenedDoors === 'function');
+```
+
+`getFinalOpenedDoors` should return an array.
+
+```js
+assert(Array.isArray(getFinalOpenedDoors(100)));
+```
+
+`getFinalOpenedDoors` should produce the correct result.
+
+```js
+assert.deepEqual(getFinalOpenedDoors(100), solution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const solution = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100];
+```
+
+## --seed-contents--
+
+```js
+function getFinalOpenedDoors(numDoors) {
+
+}
+```
+
+# --solutions--
+
+```js
+function getFinalOpenedDoors(numDoors) {
+  // this is the final pattern (always squares).
+  // thus, the most efficient solution simply returns an array of squares up to numDoors).
+  const finalState = [];
+  let i = 1;
+  while (Math.pow(i, 2) <= numDoors) {
+    finalState.push(Math.pow(i, 2));
+    i++;
+  }
+  return finalState;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/24-game.md
new file mode 100644
index 0000000000..80b03ca6a5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/24-game.md
@@ -0,0 +1,203 @@
+---
+id: 5951e88f64ebf159166a1176
+title: 24 game
+challengeType: 5
+forumTopicId: 302218
+dashedName: 24-game
+---
+
+# --description--
+
+The [24 Game](https://en.wikipedia.org/wiki/24_Game) tests a person's mental arithmetic.
+
+The aim of the game is to arrange four numbers in a way that when evaluated, the result is 24
+
+# --instructions--
+
+Implement a function that takes a string of four digits as its argument, with each digit from 1 to 9 (inclusive) with repetitions allowed, and returns an arithmetic expression that evaluates to the number 24. If no such solution exists, return "no solution exists".
+
+**Rules:**
+<ul>
+  <li> Only the following operators/functions are allowed: multiplication, division, addition, subtraction. </li>
+  <li> Division should use floating point or rational arithmetic, etc, to preserve remainders. </li>
+  <li> Forming multiple digit numbers from the supplied digits is disallowed. (So an answer of 12+12 when given 1, 2, 2, and 1 is wrong). </li>
+  <li> The order of the digits when given does not have to be preserved. </li>
+</ul>
+
+| Example input                 | Example output            |
+| ----------------------------- | ------------------------- |
+| <code>solve24("4878");</code> | <code>(7-8/8)\*4</code>   |
+| <code>solve24("1234");</code> | <code>3\*1\*4\*2</code>   |
+| <code>solve24("6789");</code> | <code>(6\*8)/(9-7)</code> |
+| <code>solve24("1127");</code> | <code>(1+7)\*(2+1)</code> |
+
+# --hints--
+
+`solve24` should be a function.
+
+```js
+assert(typeof solve24 === 'function');
+```
+
+`solve24("4878")` should return `(7-8/8)*4` or `4*(7-8/8)`
+
+```js
+assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+```
+
+`solve24("1234")` should return any arrangement of `1*2*3*4`
+
+```js
+assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+```
+
+`solve24("6789")` should return `(6*8)/(9-7)` or `(8*6)/(9-7)`
+
+```js
+assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+```
+
+`solve24("1127")` should return a permutation of `(1+7)*(1+2)`
+
+```js
+assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  '4878',
+  '1234',
+  '6789',
+  '1127'
+];
+
+const answers = [
+  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
+  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
+  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
+  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
+];
+
+function include(ansArr, res) {
+  const index = ansArr.indexOf(res);
+  return index >= 0;
+}
+
+//The main method for detecting single parentheses
+function removeParentheses(ans) {
+  for (let i = 0; i < ans.length; i++) {
+    if (!isNaN(ans[i])) {
+      ans = removeParenthesesHelper(ans, i);
+    }
+  }
+  return ans;
+}
+
+//Helper to remove left and right parantheses
+function removeParenthesesHelper(ans, i) {
+  while (i > 0 && i < ans.length - 1) {
+    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
+      //Paranthesis detected. Remove them.
+      ans = replaceChar(ans, '', i - 1);
+      ans = replaceChar(ans, '', i);
+      i--;
+    } else {
+      return ans;
+    }
+  }
+  return ans;
+}
+
+//Replace a character at a given index for the provided character
+function replaceChar(origString, replaceChar, index) {
+  let firstPart = origString.substr(0, index);
+  let lastPart = origString.substr(index + 1);
+  let newString = firstPart + replaceChar + lastPart;
+  return newString;
+}
+```
+
+## --seed-contents--
+
+```js
+function solve24 (numStr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function solve24(numStr) {
+  const digitsArr = numStr.split('');
+  const answers = [];
+
+  const digitPermutations = [];
+  const operatorPermutations = [];
+
+  function generateDigitPermutations (digits, permutations = []) {
+    if (digits.length === 0) {
+      digitPermutations.push(permutations);
+    }
+    else {
+      for (let i = 0; i < digits.length; i++) {
+        const curr = digits.slice();
+        const next = curr.splice(i, 1);
+        generateDigitPermutations(curr.slice(), permutations.concat(next));
+      }
+    }
+  }
+
+  function generateOperatorPermutations (permutations = []) {
+    const operators = ['+', '-', '*', '/'];
+    if (permutations.length === 3) {
+      operatorPermutations.push(permutations);
+    }
+    else {
+      for (let i = 0; i < operators.length; i++) {
+        const curr = permutations.slice();
+        curr.push(operators[i]);
+        generateOperatorPermutations(curr);
+      }
+    }
+  }
+
+  generateDigitPermutations(digitsArr);
+  generateOperatorPermutations();
+
+  interleave();
+
+  return answers[0];
+
+  function interleave () {
+    for (let i = 0; i < digitPermutations.length; i++) {
+      for (let j = 0; j < operatorPermutations.length; j++) {
+        const d = digitPermutations[i];
+        const o = operatorPermutations[j];
+        const perm = [
+          `${d[0]}${o[0]}${d[1]}${o[1]}${d[2]}${o[2]}${d[3]}`,
+          `(${d[0]}${o[0]}${d[1]})${o[1]}${d[2]}${o[2]}${d[3]}`,
+          `${d[0]}${o[0]}(${d[1]}${o[1]}${d[2]})${o[2]}${d[3]}`,
+          `${d[0]}${o[0]}${d[1]}${o[1]}(${d[2]}${o[2]}${d[3]})`,
+          `${d[0]}${o[0]}(${d[1]}${o[1]}${d[2]}${o[2]}${d[3]})`,
+          `(${d[0]}${o[0]}${d[1]}${o[1]}${d[2]})${o[2]}${d[3]}`,
+          `(${d[0]}${o[0]}${d[1]})${o[1]}(${d[2]}${o[2]}${d[3]})`
+        ];
+
+        perm.forEach(combination => {
+          const res = eval(combination);
+
+          if (res === 24) {
+            return answers.push(combination);
+          }
+        });
+      }
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
new file mode 100644
index 0000000000..66eecef2be
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -0,0 +1,116 @@
+---
+id: 5949b579404977fbaefcd736
+title: 9 billion names of God the integer
+challengeType: 5
+forumTopicId: 302219
+dashedName: 9-billion-names-of-god-the-integer
+---
+
+# --description--
+
+This task is a variation of the [short story by Arthur C. Clarke](<https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary> "wp: The Nine Billion Names of God#Plot_summary").
+
+(Solvers should be aware of the consequences of completing this task.)
+
+In detail, to specify what is meant by a "name":
+
+<ul>
+  <li>The integer 1 has 1 name "1".</li>
+  <li>The integer 2 has 2 names "1+1" and "2".</li>
+  <li>The integer 3 has 3 names "1+1+1", "2+1",  and "3".</li>
+  <li>The integer 4 has 5 names "1+1+1+1", "2+1+1", "2+2", "3+1", "4".</li>
+  <li>The integer 5 has 7 names "1+1+1+1+1", "2+1+1+1", "2+2+1", "3+1+1", "3+2", "4+1", "5".</li>
+</ul>
+
+This can be visualized in the following form:
+
+<pre>          1
+        1   1
+      1   1   1
+    1   2   1   1
+  1   2   2   1   1
+1   3   3   2   1   1
+</pre>
+
+Where row $n$ corresponds to integer $n$, and each column $C$ in row $m$ from left to right corresponds to the number of names beginning with $C$.
+
+Optionally note that the sum of the $n$-th row $P(n)$ is the integer partition function.
+
+# --instructions--
+
+Implement a function that returns the sum of the $n$-th row.
+
+# --hints--
+
+`numberOfNames` should be function.
+
+```js
+assert(typeof numberOfNames === 'function');
+```
+
+`numberOfNames(5)` should equal 7.
+
+```js
+assert.equal(numberOfNames(5), 7);
+```
+
+`numberOfNames(12)` should equal 77.
+
+```js
+assert.equal(numberOfNames(12), 77);
+```
+
+`numberOfNames(18)` should equal 385.
+
+```js
+assert.equal(numberOfNames(18), 385);
+```
+
+`numberOfNames(23)` should equal 1255.
+
+```js
+assert.equal(numberOfNames(23), 1255);
+```
+
+`numberOfNames(42)` should equal 53174.
+
+```js
+assert.equal(numberOfNames(42), 53174);
+```
+
+`numberOfNames(123)` should equal 2552338241.
+
+```js
+assert.equal(numberOfNames(123), 2552338241);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function numberOfNames(num) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function numberOfNames(num) {
+  const cache = [
+    [1]
+  ];
+  for (let l = cache.length; l < num + 1; l++) {
+    let Aa;
+    let Mi;
+    const r = [0];
+    for (let x = 1; x < l + 1; x++) {
+      r.push(r[r.length - 1] + (Aa = cache[l - x < 0 ? cache.length - (l - x) : l - x])[(Mi = Math.min(x, l - x)) < 0 ? Aa.length - Mi : Mi]);
+    }
+    cache.push(r);
+  }
+  return cache[num][cache[num].length - 1];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abc-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abc-problem.md
new file mode 100644
index 0000000000..b42b619749
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abc-problem.md
@@ -0,0 +1,136 @@
+---
+id: 594810f028c0303b75339acc
+title: ABC Problem
+challengeType: 5
+forumTopicId: 302220
+dashedName: abc-problem
+---
+
+# --description--
+
+You are given a collection of ABC blocks (e.g., childhood alphabet blocks). There are 20 blocks with two letters on each block. A complete alphabet is guaranteed amongst all sides of the blocks. The sample collection of blocks:
+
+<pre>(B O)
+(X K)
+(D Q)
+(C P)
+(N A)
+(G T)
+(R E)
+(T G)
+(Q D)
+(F S)
+(J W)
+(H U)
+(V I)
+(A N)
+(O B)
+(E R)
+(F S)
+(L Y)
+(P C)
+(Z M)
+</pre>
+
+# --instructions--
+
+Implement a function that takes a string (word) and determines whether the word can be spelled with the given collection of blocks.
+
+Some rules to keep in mind:
+
+<ul>
+  <li>Once a letter on a block is used, that block cannot be used again.</li>
+  <li>The function should be case-insensitive.</li>
+</ul>
+
+# --hints--
+
+`canMakeWord` should be a function.
+
+```js
+assert(typeof canMakeWord === 'function');
+```
+
+`canMakeWord` should return a boolean.
+
+```js
+assert(typeof canMakeWord('hi') === 'boolean');
+```
+
+`canMakeWord("bark")` should return true.
+
+```js
+assert(canMakeWord(words[0]));
+```
+
+`canMakeWord("BooK")` should return false.
+
+```js
+assert(!canMakeWord(words[1]));
+```
+
+`canMakeWord("TReAT")` should return true.
+
+```js
+assert(canMakeWord(words[2]));
+```
+
+`canMakeWord("COMMON")` should return false.
+
+```js
+assert(!canMakeWord(words[3]));
+```
+
+`canMakeWord("squAD")` should return true.
+
+```js
+assert(canMakeWord(words[4]));
+```
+
+`canMakeWord("conFUSE")` should return true.
+
+```js
+assert(canMakeWord(words[5]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const words = ['bark', 'BooK', 'TReAT', 'COMMON', 'squAD', 'conFUSE'];
+```
+
+## --seed-contents--
+
+```js
+function canMakeWord(word) {
+
+}
+```
+
+# --solutions--
+
+```js
+function canMakeWord(word) {
+  const characters = 'BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM';
+  const blocks = characters.split(' ').map(pair => pair.split(''));
+
+  const letters = [...word.toUpperCase()];
+  let length = letters.length;
+  const copy = new Set(blocks);
+
+  letters.forEach(letter => {
+    for (let block of copy) {
+      const index = block.indexOf(letter);
+
+      if (index !== -1) {
+        length--;
+        copy.delete(block);
+        break;
+      }
+    }
+  });
+  return !length;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
new file mode 100644
index 0000000000..33cbddb68a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
@@ -0,0 +1,95 @@
+---
+id: 594810f028c0303b75339acd
+title: 'Abundant, deficient and perfect number classifications'
+challengeType: 5
+forumTopicId: 302221
+dashedName: abundant-deficient-and-perfect-number-classifications
+---
+
+# --description--
+
+These define three classifications of positive integers based on their proper divisors.
+
+Let $P(n)$ be the sum of the proper divisors of `n` where proper divisors are all positive integers `n` other than `n` itself.
+
+If `P(n) < n` then `n` is classed as `deficient`
+
+If `P(n) === n` then `n` is classed as `perfect`
+
+If `P(n) > n` then `n` is classed as `abundant`
+
+**Example**: `6` has proper divisors of `1`, `2`, and `3`. `1 + 2 + 3 = 6`, so `6` is classed as a perfect number.
+
+# --instructions--
+
+Implement a function that calculates how many of the integers from `1` to `num` (inclusive) are in each of the three classes. Output the result as an array in the following format `[deficient, perfect, abundant]`.
+
+# --hints--
+
+`getDPA` should be a function.
+
+```js
+assert(typeof getDPA === 'function');
+```
+
+`getDPA(5000)` should return an array.
+
+```js
+assert(Array.isArray(getDPA(5000)));
+```
+
+`getDPA(5000)` return array should have a length of `3`.
+
+```js
+assert(getDPA(5000).length === 3);
+```
+
+`getDPA(5000)` should return `[3758, 3, 1239]`.
+
+```js
+assert.deepEqual(getDPA(5000), [3758, 3, 1239]);
+```
+
+`getDPA(10000)` should return `[7508, 4, 2488]`.
+
+```js
+assert.deepEqual(getDPA(10000), [7508, 4, 2488]);
+```
+
+`getDPA(20000)` should return `[15043, 4, 4953]`.
+
+```js
+assert.deepEqual(getDPA(20000), [15043, 4, 4953]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function getDPA(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function getDPA(num) {
+  const dpa = [1, 0, 0];
+  for (let n = 2; n <= num; n += 1) {
+    let ds = 1;
+    const e = Math.sqrt(n);
+    for (let d = 2; d < e; d += 1) {
+      if (n % d === 0) {
+        ds += d + (n / d);
+      }
+    }
+    if (n % e === 0) {
+      ds += e;
+    }
+    dpa[ds < n ? 0 : ds === n ? 1 : 2] += 1;
+  }
+  return dpa;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
new file mode 100644
index 0000000000..fd90df9f34
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -0,0 +1,79 @@
+---
+id: 594810f028c0303b75339ace
+title: Accumulator factory
+challengeType: 5
+forumTopicId: 302222
+dashedName: accumulator-factory
+---
+
+# --description--
+
+A problem posed by [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
+
+# --instructions--
+
+Create a function that takes a number $n$ and generates accumulator functions that return the sum of every number ever passed to them.
+
+**Rules:**
+
+Do not use global variables.
+
+**Hint:**
+
+Closures save outer state.
+
+# --hints--
+
+`accumulator` should be a function.
+
+```js
+assert(typeof accumulator === 'function');
+```
+
+`accumulator(0)` should return a function.
+
+```js
+assert(typeof accumulator(0) === 'function');
+```
+
+`accumulator(0)(2)` should return a number.
+
+```js
+assert(typeof accumulator(0)(2) === 'number');
+```
+
+Passing in the values 3, -4, 1.5, and 5 should return 5.5.
+
+```js
+assert(testFn(5) === 5.5);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testFn = typeof accumulator(3) === 'function' && accumulator(3);
+if (testFn) {
+  testFn(-4);
+  testFn(1.5);
+}
+```
+
+## --seed-contents--
+
+```js
+function accumulator(sum) {
+
+}
+```
+
+# --solutions--
+
+```js
+function accumulator(sum) {
+  return function(n) {
+    return sum += n;
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ackermann-function.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ackermann-function.md
new file mode 100644
index 0000000000..f80262dc40
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ackermann-function.md
@@ -0,0 +1,71 @@
+---
+id: 594810f028c0303b75339acf
+title: Ackermann function
+challengeType: 5
+forumTopicId: 302223
+dashedName: ackermann-function
+---
+
+# --description--
+
+The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree.
+
+The Ackermann function is usually defined as follows:
+
+$A(m, n) = \\begin{cases} n+1 & \\mbox{if } m = 0 \\\\ A(m-1, 1) & \\mbox{if } m > 0 \\mbox{ and } n = 0 \\\\ A(m-1, A(m, n-1)) & \\mbox{if } m > 0 \\mbox{ and } n > 0. \\end{cases}$
+
+Its arguments are never negative and it always terminates.
+
+# --instructions--
+
+Write a function which returns the value of $A(m, n)$. Arbitrary precision is preferred (since the function grows so quickly), but not required.
+
+# --hints--
+
+`ack` should be a function.
+
+```js
+assert(typeof ack === 'function');
+```
+
+`ack(0, 0)` should return 1.
+
+```js
+assert(ack(0, 0) === 1);
+```
+
+`ack(1, 1)` should return 3.
+
+```js
+assert(ack(1, 1) === 3);
+```
+
+`ack(2, 5)` should return 13.
+
+```js
+assert(ack(2, 5) === 13);
+```
+
+`ack(3, 3)` should return 61.
+
+```js
+assert(ack(3, 3) === 61);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function ack(m, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function ack(m, n) {
+  return m === 0 ? n + 1 : ack(m - 1, n === 0 ? 1 : ack(m, n - 1));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/align-columns.md
new file mode 100644
index 0000000000..45ff5fa2f3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/align-columns.md
@@ -0,0 +1,194 @@
+---
+id: 594810f028c0303b75339ad0
+title: Align columns
+challengeType: 5
+forumTopicId: 302224
+dashedName: align-columns
+---
+
+# --description--
+
+Given a text file of many lines, where fields within a line are delineated by a single `$` character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either left justified, right justified, or center justified within its column.
+
+# --instructions--
+
+Use the following text to test your programs:
+
+<pre>
+Given$a$text$file$of$many$lines
+where$fields$within$a$line$
+are$delineated$by$a$single$'dollar'$character
+write$a$program
+that$aligns$each$column$of$fields
+by$ensuring$that$words$in$each$
+column$are$separated$by$at$least$one$space.
+Further,$allow$for$each$word$in$a$column$to$be$either$left$
+justified,$right$justified
+or$center$justified$within$its$column.
+</pre>
+
+**Note that:**
+
+<ul>
+  <li>The example input texts lines may, or may not, have trailing dollar characters.</li>
+  <li>All columns should share the same alignment.</li>
+  <li>Consecutive space characters produced adjacent to the end of lines are insignificant for the purposes of the task.</li>
+  <li>Output text will be viewed in a mono-spaced font on a plain text editor or basic terminal.</li>
+  <li>The minimum space between columns should be computed from the text and not hard-coded.</li>
+  <li>It is not a requirement to add separating characters between or around columns.</li>
+</ul>
+
+# --hints--
+
+`formatText` should be a function.
+
+```js
+assert(typeof formatText === 'function');
+```
+
+`formatText` with the above input and "right" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'right'), rightAligned);
+```
+
+`formatText` with the above input and "left" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'left'), leftAligned);
+```
+
+`formatText` with the above input and "center" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'center'), centerAligned);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testInput = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$\"dollar\"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+const rightAligned = '     Given          a      text   file     of     many     lines\n' +
+'     where     fields    within      a   line \n' +
+'       are delineated        by      a single "dollar" character\n' +
+'     write          a   program\n' +
+'      that     aligns      each column     of   fields \n' +
+'        by   ensuring      that  words     in     each \n' +
+'    column        are separated     by     at    least       one space.\n' +
+'  Further,      allow       for   each   word       in         a column to be either left \n' +
+'justified,      right justified\n' +
+'        or     center justified within    its  column.';
+
+const leftAligned = 'Given      a          text      file   of     many     lines    \n' +
+'where      fields     within    a      line   \n' +
+'are        delineated by        a      single "dollar" character\n' +
+'write      a          program  \n' +
+'that       aligns     each      column of     fields   \n' +
+'by         ensuring   that      words  in     each     \n' +
+'column     are        separated by     at     least    one       space.\n' +
+'Further,   allow      for       each   word   in       a         column to be either left \n' +
+'justified, right      justified\n' +
+'or         center     justified within its    column. ';
+
+const centerAligned = '  Given        a        text     file    of     many     lines  \n' +
+'  where      fields    within     a     line  \n' +
+'   are     delineated    by       a    single \"dollar\" character\n' +
+'  write        a       program \n' +
+'   that      aligns     each    column   of    fields  \n' +
+'    by      ensuring    that    words    in     each   \n' +
+'  column      are     separated   by     at    least      one    space.\n' +
+' Further,    allow       for     each   word     in        a     column to be either left \n' +
+'justified,   right    justified\n' +
+'    or       center   justified within  its   column. ';
+```
+
+## --seed-contents--
+
+```js
+const testArr = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$"dollar"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+function formatText(input, justification) {
+
+}
+```
+
+# --solutions--
+
+```js
+const testArr = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$"dollar"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+String.prototype.repeat = function (n) { return new Array(1 + parseInt(n)).join(this); };
+
+function formatText(input, justification) {
+  let x, y, max, cols = 0, diff, left, right;
+  for (x = 0; x < input.length; x++) {
+    input[x] = input[x].split('$');
+    if (input[x].length > cols) {
+      cols = input[x].length;
+    }
+  }
+  for (x = 0; x < cols; x++) {
+    max = 0;
+    for (y = 0; y < input.length; y++) {
+      if (input[y][x] && max < input[y][x].length) {
+        max = input[y][x].length;
+      }
+    }
+    for (y = 0; y < input.length; y++) {
+      if (input[y][x]) {
+        diff = (max - input[y][x].length) / 2;
+        left = ' '.repeat(Math.floor(diff));
+        right = ' '.repeat(Math.ceil(diff));
+        if (justification === 'left') {
+          right += left; left = '';
+        }
+        if (justification === 'right') {
+          left += right; right = '';
+        }
+        input[y][x] = left + input[y][x] + right;
+      }
+    }
+  }
+  for (x = 0; x < input.length; x++) {
+    input[x] = input[x].join(' ');
+  }
+  input = input.join('\n');
+  return input;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
new file mode 100644
index 0000000000..3fe512a48f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -0,0 +1,126 @@
+---
+id: 5949b579404977fbaefcd737
+title: Amicable pairs
+challengeType: 5
+forumTopicId: 302225
+dashedName: amicable-pairs
+---
+
+# --description--
+
+Two integers $N$ and $M$ are said to be [amicable pairs](<https://en.wikipedia.org/wiki/Amicable numbers> "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](<https://rosettacode.org/wiki/Proper divisors> "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+
+**Example:**
+
+**1184** and **1210** are an amicable pair, with proper divisors:
+
+<ul>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605   respectively.</li>
+</ul>
+
+# --instructions--
+
+Calculate and show here the Amicable pairs below 20,000 (there are eight).
+
+# --hints--
+
+`amicablePairsUpTo` should be a function.
+
+```js
+assert(typeof amicablePairsUpTo === 'function');
+```
+
+`amicablePairsUpTo(300)` should return `[[220,284]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(300), answer300);
+```
+
+`amicablePairsUpTo(3000)` should return `[[220,284],[1184,1210],[2620,2924]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(3000), answer3000);
+```
+
+`amicablePairsUpTo(20000)` should return `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(20000), answer20000);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const answer300 = [[220, 284]];
+const answer3000 = [
+  [220, 284],
+  [1184, 1210],
+  [2620, 2924]
+];
+const answer20000 = [
+  [220, 284],
+  [1184, 1210],
+  [2620, 2924],
+  [5020, 5564],
+  [6232, 6368],
+  [10744, 10856],
+  [12285, 14595],
+  [17296, 18416]
+];
+```
+
+## --seed-contents--
+
+```js
+function amicablePairsUpTo(maxNum) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// amicablePairsUpTo :: Int -> [(Int, Int)]
+function amicablePairsUpTo(maxNum) {
+  return range(1, maxNum)
+    .map(x => properDivisors(x)
+      .reduce((a, b) => a + b, 0))
+    .reduce((a, m, i, lst) => {
+      const n = i + 1;
+
+      return (m > n) && lst[m - 1] === n ?
+        a.concat([
+          [n, m]
+        ]) : a;
+    }, []);
+}
+
+// properDivisors :: Int -> [Int]
+function properDivisors(n) {
+  if (n < 2) return [];
+
+  const rRoot = Math.sqrt(n);
+  const intRoot = Math.floor(rRoot);
+  const blnPerfectSquare = rRoot === intRoot;
+  const lows = range(1, intRoot)
+  .filter(x => (n % x) === 0);
+
+  return lows.concat(lows.slice(1)
+    .map(x => n / x)
+    .reverse()
+    .slice(blnPerfectSquare | 0));
+}
+
+// Int -> Int -> Maybe Int -> [Int]
+function range(m, n, step) {
+  const d = (step || 1) * (n >= m ? 1 : -1);
+
+  return Array.from({
+    length: Math.floor((n - m) / d) + 1
+  }, (_, i) => m + (i * d));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-mode.md
new file mode 100644
index 0000000000..e9f98a9187
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -0,0 +1,79 @@
+---
+id: 594d8d0ab97724821379b1e6
+title: Averages/Mode
+challengeType: 5
+forumTopicId: 302226
+dashedName: averagesmode
+---
+
+# --description--
+
+Write a program to find the [mode](<https://en.wikipedia.org/wiki/Mode (statistics)> "wp: Mode (statistics)") value of a collection.
+
+The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique.
+
+If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriate or possible to support an unspecified value type, use integers.
+
+# --hints--
+
+`mode` should be a function.
+
+```js
+assert(typeof mode === 'function');
+```
+
+`mode([1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17])` should equal `[6]`
+
+```js
+assert.deepEqual(mode(arr1), [6]);
+```
+
+`mode([1, 2, 4, 4, 1])` should equal `[1, 4]`.
+
+```js
+assert.deepEqual(mode(arr2).sort(), [1, 4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const arr1 = [1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17];
+const arr2 = [1, 2, 4, 4, 1];
+```
+
+## --seed-contents--
+
+```js
+function mode(arr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function mode(arr) {
+  const counter = {};
+  let result = [];
+  let max = 0;
+  // for (const i in arr) {
+  arr.forEach(el => {
+    if (!(el in counter)) {
+      counter[el] = 0;
+    }
+    counter[el]++;
+
+    if (counter[el] === max) {
+      result.push(el);
+    }
+    else if (counter[el] > max) {
+      max = counter[el];
+      result = [el];
+    }
+  });
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
new file mode 100644
index 0000000000..daac04f1a5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -0,0 +1,144 @@
+---
+id: 594d966a1467eb84194f0086
+title: Averages/Pythagorean means
+challengeType: 5
+forumTopicId: 302227
+dashedName: averagespythagorean-means
+---
+
+# --description--
+
+Compute all three of the [Pythagorean means](<https://en.wikipedia.org/wiki/Pythagorean means> "wp: Pythagorean means") of the set of integers $1$ through $10$ (inclusive).
+
+Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers.
+
+<ul>
+  <li>The most common of the three means, the <a class='rosetta__link--rosetta' href='https://rosettacode.org/wiki/Averages/Arithmetic mean' title='Averages/Arithmetic mean' target='_blank'>arithmetic mean</a>, is the sum of the list divided by its length:<br>
+  <big>$ A(x_1, \ldots, x_n) = \frac{x_1 + \cdots + x_n}{n}$</big></li>
+  <li>The <a class='rosetta__link--wiki' href='https://en.wikipedia.org/wiki/Geometric mean' title='wp: Geometric mean' target='_blank'>geometric mean</a> is the $n$th root of the product of the list:<br>
+  <big>$ G(x_1, \ldots, x_n) = \sqrt[n]{x_1 \cdots x_n} $</big></li>
+  <li>The <a class='rosetta__link--wiki' href='https://en.wikipedia.org/wiki/Harmonic mean' title='wp: Harmonic mean' target='_blank'>harmonic mean</a> is $n$ divided by the sum of the reciprocal of each item in the list:<br>
+  <big>$ H(x_1, \ldots, x_n) = \frac{n}{\frac{1}{x_1} + \cdots + \frac{1}{x_n}} $</big></li>
+</ul>
+
+# --instructions--
+
+When writing your function, assume the input is an ordered array of all inclusive numbers.
+
+For the answer, please output an object in the following format:
+
+```js
+{
+  values: {
+    Arithmetic: 5.5,
+    Geometric: 4.528728688116765,
+    Harmonic: 3.414171521474055
+  },
+  test: 'is A >= G >= H ? yes'
+}
+```
+
+# --hints--
+
+`pythagoreanMeans` should be a function.
+
+```js
+assert(typeof pythagoreanMeans === 'function');
+```
+
+`pythagoreanMeans([1, 2, ..., 10])` should equal the same output above.
+
+```js
+assert.deepEqual(pythagoreanMeans(range1), answer1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const range1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+const answer1 = {
+  values: {
+    Arithmetic: 5.5,
+    Geometric: 4.528728688116765,
+    Harmonic: 3.414171521474055
+  },
+  test: 'is A >= G >= H ? yes'
+};
+```
+
+## --seed-contents--
+
+```js
+function pythagoreanMeans(rangeArr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function pythagoreanMeans(rangeArr) {
+  // arithmeticMean :: [Number] -> Number
+  const arithmeticMean = xs =>
+    foldl((sum, n) => sum + n, 0, xs) / length(xs);
+
+  // geometricMean :: [Number] -> Number
+  const geometricMean = xs =>
+    raise(foldl((product, x) => product * x, 1, xs), 1 / length(xs));
+
+  // harmonicMean :: [Number] -> Number
+  const harmonicMean = xs =>
+    length(xs) / foldl((invSum, n) => invSum + (1 / n), 0, xs);
+
+  // GENERIC FUNCTIONS ------------------------------------------------------
+
+  // A list of functions applied to a list of arguments
+  // <*> :: [(a -> b)] -> [a] -> [b]
+  const ap = (fs, xs) => //
+    Array.prototype.concat(...fs.map(f => //
+      Array.prototype.concat(...xs.map(x => [f(x)]))));
+
+  // foldl :: (b -> a -> b) -> b -> [a] -> b
+  const foldl = (f, a, xs) => xs.reduce(f, a);
+
+  // length :: [a] -> Int
+  const length = xs => xs.length;
+
+  // mapFromList :: [(k, v)] -> Dictionary
+  const mapFromList = kvs =>
+    foldl((a, [k, v]) =>
+      (a[(typeof k === 'string' && k)] = v, a), {}, kvs);
+
+  // raise :: Num -> Int -> Num
+  const raise = (n, e) => Math.pow(n, e);
+/*
+  // show :: a -> String
+  // show :: a -> Int -> String
+  const show = (...x) =>
+    JSON.stringify.apply(
+      null, x.length > 1 ? [x[0], null, x[1]] : x
+    );
+*/
+  // zip :: [a] -> [b] -> [(a,b)]
+  const zip = (xs, ys) =>
+    xs.slice(0, Math.min(xs.length, ys.length))
+      .map((x, i) => [x, ys[i]]);
+
+  // TEST -------------------------------------------------------------------
+  // mean :: Dictionary
+  const mean = mapFromList(zip(
+    ['Arithmetic', 'Geometric', 'Harmonic'],
+    ap([arithmeticMean, geometricMean, harmonicMean], [
+      rangeArr
+    ])
+  ));
+
+  return {
+    values: mean,
+    test: `is A >= G >= H ? ${mean.Arithmetic >= mean.Geometric &&
+      mean.Geometric >= mean.Harmonic ? 'yes' : 'no'}`
+  };
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
new file mode 100644
index 0000000000..080f3e6eea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -0,0 +1,57 @@
+---
+id: 594da033de4190850b893874
+title: Averages/Root mean square
+challengeType: 5
+forumTopicId: 302228
+dashedName: averagesroot-mean-square
+---
+
+# --description--
+
+Compute the [Root mean square](<https://en.wikipedia.org/wiki/Root mean square> "wp: Root mean square") of the numbers 1 through 10 inclusive.
+
+The *root mean square* is also known by its initials RMS (or rms), and as the **quadratic mean**.
+
+The RMS is calculated as the mean of the squares of the numbers, square-rooted:
+
+$$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
+
+# --hints--
+
+`rms` should be a function.
+
+```js
+assert(typeof rms === 'function');
+```
+
+`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` should equal `6.2048368229954285`.
+
+```js
+assert.equal(rms(arr1), answer1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const arr1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+const answer1 = 6.2048368229954285;
+```
+
+## --seed-contents--
+
+```js
+function rms(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function rms(arr) {
+  const sumOfSquares = arr.reduce((s, x) => s + x * x, 0);
+  return Math.sqrt(sumOfSquares / arr.length);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/babbage-problem.md
new file mode 100644
index 0000000000..27054cccc5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -0,0 +1,78 @@
+---
+id: 594db4d0dedb4c06a2a4cefd
+title: Babbage problem
+challengeType: 5
+forumTopicId: 302229
+dashedName: babbage-problem
+---
+
+# --description--
+
+[Charles Babbage](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
+
+<blockquote>
+  What is the smallest positive integer whose square ends in the digits 269,696?
+  <footer style='margin-left: 2em;'>Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, <i>Electronic Computers</i>, second edition, 1970, p. 125.</footer>
+</blockquote>
+
+He thought the answer might be 99,736, whose square is 9,947,269,696; but he couldn't be certain.
+
+The task is to find out if Babbage had the right answer.
+
+# --instructions--
+
+Implement a function to return the lowest integer that satisfies the Babbage problem. If Babbage was right, return Babbage's number.
+
+# --hints--
+
+`babbage` should be a function.
+
+```js
+assert(typeof babbage === 'function');
+```
+
+`babbage(99736, 269696)` should not return 99736 (there is a smaller answer).
+
+```js
+assert.equal(babbage(babbageAns, endDigits), answer);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const babbageAns = 99736;
+const endDigits = 269696;
+const answer = 25264;
+```
+
+## --seed-contents--
+
+```js
+function babbage(babbageNum, endDigits) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function babbage(babbageAns, endDigits) {
+  const babbageNum = Math.pow(babbageAns, 2);
+  const babbageStartDigits = parseInt(babbageNum.toString().replace('269696', ''));
+  let answer = 99736;
+
+  // count down from this answer and save any sqrt int result. return lowest one
+  for (let i = babbageStartDigits; i >= 0; i--) {
+    const num = parseInt(i.toString().concat('269696'));
+    const result = Math.sqrt(num);
+    if (result === Math.floor(Math.sqrt(num))) {
+      answer = result;
+    }
+  }
+
+  return answer;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/balanced-brackets.md
new file mode 100644
index 0000000000..e32338e301
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -0,0 +1,188 @@
+---
+id: 594dc6c729e5700999302b45
+title: Balanced brackets
+challengeType: 5
+forumTopicId: 302230
+dashedName: balanced-brackets
+---
+
+# --description--
+
+Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
+
+**Examples:**
+| Input                     | Output |
+| ------------------------- | ------ |
+| <code>\[]</code>          | true   |
+| <code>]\[</code>          | false  |
+| <code>[][]</code>         | true   |
+| <code>]\[]</code>         | false  |
+| <code>\[]]\[\[]</code>    | false  |
+| <code>\[\[\[\[]]]]</code> | true   |
+
+# --hints--
+
+`isBalanced` should be a function.
+
+```js
+assert(typeof isBalanced === 'function');
+```
+
+`isBalanced("[]")` should return true.
+
+```js
+assert(isBalanced(testCases[0]));
+```
+
+`isBalanced("]][[[][][][]][")` should return false.
+
+```js
+assert(!isBalanced(testCases[1]));
+```
+
+`isBalanced("[][[[[][][[[]]]]]]")` should return true.
+
+```js
+assert(isBalanced(testCases[2]));
+```
+
+`isBalanced("][")` should return false.
+
+```js
+assert(!isBalanced(testCases[3]));
+```
+
+`isBalanced("[[[]]]][[]")` should return false.
+
+```js
+assert(!isBalanced(testCases[4]));
+```
+
+`isBalanced("][[]")` should return false.
+
+```js
+assert(!isBalanced(testCases[5]));
+```
+
+`isBalanced("][[][]][[[]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[6]));
+```
+
+`isBalanced("[[][]]][")` should return false.
+
+```js
+assert(!isBalanced(testCases[7]));
+```
+
+`isBalanced("[[[]]][[]]]][][[")` should return false.
+
+```js
+assert(!isBalanced(testCases[8]));
+```
+
+`isBalanced("[]][[]]][[[[][]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[9]));
+```
+
+`isBalanced("][]][[][")` should return false.
+
+```js
+assert(!isBalanced(testCases[10]));
+```
+
+`isBalanced("[[]][[][]]")` should return true.
+
+```js
+assert(isBalanced(testCases[11]));
+```
+
+`isBalanced("[[]]")` should return true.
+
+```js
+assert(isBalanced(testCases[12]));
+```
+
+`isBalanced("]][]][[]][[[")` should return false.
+
+```js
+assert(!isBalanced(testCases[13]));
+```
+
+`isBalanced("][]][][[")` should return false.
+
+```js
+assert(!isBalanced(testCases[14]));
+```
+
+`isBalanced("][][")` should return false.
+
+```js
+assert(!isBalanced(testCases[15]));
+```
+
+`isBalanced("[]]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[16]));
+```
+
+`isBalanced("")` should return true.
+
+```js
+assert(isBalanced(testCases[17]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  '[]',
+  ']][[[][][][]][',
+  '[][[[[][][[[]]]]]]',
+  '][',
+  '[[[]]]][[]',
+  '][[]',
+  '][[][]][[[]]',
+  '[[][]]][',
+  '[[[]]][[]]]][][[',
+  '[]][[]]][[[[][]]',
+  '][]][[][',
+  '[[]][[][]]',
+  '[[]]',
+  ']][]][[]][[[',
+  '][]][][[',
+  '][][',
+  '[]]]',
+  ''
+];
+```
+
+## --seed-contents--
+
+```js
+function isBalanced(str) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function isBalanced(str) {
+  if (str === '') return true;
+  let a = str;
+  let b;
+  do {
+    b = a;
+    a = a.replace(/\[\]/g, '');
+  } while (a !== b);
+  return !a;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
new file mode 100644
index 0000000000..bbd910fb6c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -0,0 +1,150 @@
+---
+id: 5951815dd895584b06884620
+title: Circles of given radius through two points
+challengeType: 5
+forumTopicId: 302231
+dashedName: circles-of-given-radius-through-two-points
+---
+
+# --description--
+
+Given two points on a plane and a radius, usually two circles of given radius can be drawn through the points.
+
+**Exceptions:**
+
+<ul>
+  <li>A radius of zero should be treated as never describing circles (except in the case where the points are coincident).</li>
+  <li>If the points are coincident then an infinite number of circles with the point on their circumference can be drawn, unless the radius is equal to zero as well which then collapses the circles to a point.</li>
+  <li>If the points form a diameter then return a single circle.</li>
+  <li>If the points are too far apart then no circles can be drawn.</li>
+</ul>
+
+# --instructions--
+
+Implement a function that takes two points and a radius and returns the two circles through those points. For each resulting circle, provide the coordinates for the center of each circle rounded to four decimal digits. Return each coordinate as an array, and coordinates as an array of arrays.
+
+**For edge cases, return the following:**
+
+<ul>
+  <li>If points are on the diameter, return one point. If the radius is also zero however, return <code>"Radius Zero"</code>.</li>
+  <li>If points are coincident, return <code>"Coincident point. Infinite solutions"</code>.</li>
+  <li>If points are farther apart than the diameter, return <code>"No intersection. Points further apart than circle diameter"</code>.</li>
+</ul>
+
+**Sample inputs:**
+
+<pre>      p1                p2           r
+0.1234, 0.9876    0.8765, 0.2345    2.0
+0.0000, 2.0000    0.0000, 0.0000    1.0
+0.1234, 0.9876    0.1234, 0.9876    2.0
+0.1234, 0.9876    0.8765, 0.2345    0.5
+0.1234, 0.9876    0.1234, 0.9876    0.0
+</pre>
+
+# --hints--
+
+`getCircles` should be a function.
+
+```js
+assert(typeof getCircles === 'function');
+```
+
+`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 2.0)` should return `[[1.8631, 1.9742], [-0.8632, -0.7521]]`.
+
+```js
+assert.deepEqual(getCircles(...testCases[0]), answers[0]);
+```
+
+`getCircles([0.0000, 2.0000], [0.0000, 0.0000], 1.0)` should return `[0, 1]`
+
+```js
+assert.deepEqual(getCircles(...testCases[1]), answers[1]);
+```
+
+`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 2.0)` should return `Coincident point. Infinite solutions`
+
+```js
+assert.deepEqual(getCircles(...testCases[2]), answers[2]);
+```
+
+`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 0.5)` should return `No intersection. Points further apart than circle diameter`
+
+```js
+assert.deepEqual(getCircles(...testCases[3]), answers[3]);
+```
+
+`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 0.0)` should return `Radius Zero`
+
+```js
+assert.deepEqual(getCircles(...testCases[4]), answers[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  [[0.1234, 0.9876], [0.8765, 0.2345], 2.0],
+  [[0.0000, 2.0000], [0.0000, 0.0000], 1.0],
+  [[0.1234, 0.9876], [0.1234, 0.9876], 2.0],
+  [[0.1234, 0.9876], [0.8765, 0.2345], 0.5],
+  [[0.1234, 0.9876], [0.1234, 0.9876], 0.0]
+];
+const answers = [
+  [[1.8631, 1.9742], [-0.8632, -0.7521]],
+  [0, 1],
+  'Coincident point. Infinite solutions',
+  'No intersection. Points further apart than circle diameter',
+  'Radius Zero'
+];
+```
+
+## --seed-contents--
+
+```js
+function getCircles(...args) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const hDist = (p1, p2) => Math.hypot(...p1.map((e, i) => e - p2[i])) / 2;
+const pAng = (p1, p2) => Math.atan(p1.map((e, i) => e - p2[i]).reduce((p, c) => c / p, 1));
+const solveF = (p, r) => t => [parseFloat((r * Math.cos(t) + p[0]).toFixed(4)), parseFloat((r * Math.sin(t) + p[1]).toFixed(4))];
+const diamPoints = (p1, p2) => p1.map((e, i) => parseFloat((e + (p2[i] - e) / 2).toFixed(4)));
+
+function getCircles(...args) {
+  const [p1, p2, s] = args;
+  const solve = solveF(p1, s);
+  const halfDist = hDist(p1, p2);
+
+  let msg = [];
+  switch (Math.sign(s - halfDist)) {
+    case 0:
+      msg = s ? diamPoints(p1, p2) :
+        'Radius Zero';
+      break;
+    case 1:
+      if (!halfDist) {
+        msg = 'Coincident point. Infinite solutions';
+      }
+      else {
+        const theta = pAng(p1, p2);
+        const theta2 = Math.acos(halfDist / s);
+        [1, -1].map(e => solve(theta + e * theta2)).forEach(
+          e => msg.push(e));
+      }
+      break;
+    case -1:
+      msg = 'No intersection. Points further apart than circle diameter';
+      break;
+    default:
+      msg = 'Reached the default';
+  }
+  return msg;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/closest-pair-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
new file mode 100644
index 0000000000..9221d424b3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
@@ -0,0 +1,414 @@
+---
+id: 5951a53863c8a34f02bf1bdc
+title: Closest-pair problem
+challengeType: 5
+forumTopicId: 302232
+dashedName: closest-pair-problem
+---
+
+# --description--
+
+Provide a function to find the closest two points among a set of given points in two dimensions.
+
+The straightforward solution is a $O(n^2)$ algorithm (which we can call *brute-force algorithm*); the pseudo-code (using indexes) could be simply:
+
+<pre><strong>bruteForceClosestPair</strong> of P(1), P(2), ... P(N)
+<strong>if</strong> N &#x3C; 2 <strong>then</strong>
+  <strong>return</strong> ∞
+<strong>else</strong>
+  minDistance ← |P(1) - P(2)|
+  minPoints ← { P(1), P(2) }
+  <strong>foreach</strong> i ∈ [1, N-1]
+    <strong>foreach</strong> j ∈ [i+1, N]
+      <strong>if</strong> |P(i) - P(j)| &#x3C; minDistance <strong>then</strong>
+        minDistance ← |P(i) - P(j)|
+        minPoints ← { P(i), P(j) }
+      <strong>endif</strong>
+    <strong>endfor</strong>
+  <strong>endfor</strong>
+  <strong>return</strong> minDistance, minPoints
+<strong>endif</strong>
+</pre>
+
+A better algorithm is based on the recursive divide and conquer approach, which is $O(n\log n)$ a pseudo-code could be:
+
+<pre><strong>closestPair</strong> of (xP, yP)
+  where xP is P(1) .. P(N) sorted by x coordinate, and
+  yP is P(1) .. P(N) sorted by y coordinate (ascending order)
+<strong>if</strong> N ≤ 3 <strong>then</strong>
+  <strong>return</strong> closest points of xP using brute-force algorithm
+<strong>else</strong>
+  xL ← points of xP from 1 to ⌈N/2⌉
+  xR ← points of xP from ⌈N/2⌉+1 to N
+  xm ← xP(⌈N/2⌉)<sub>x</sub>
+  yL ← { p ∈ yP : p<sub>x</sub> ≤ xm }
+  yR ← { p ∈ yP : p<sub>x</sub> > xm }
+  (dL, pairL) ← closestPair of (xL, yL)
+  (dR, pairR) ← closestPair of (xR, yR)
+  (dmin, pairMin) ← (dR, pairR)
+  <strong>if</strong> dL &#x3C; dR <strong>then</strong>
+    (dmin, pairMin) ← (dL, pairL)
+  <strong>endif</strong>
+  yS ← { p ∈ yP : |xm - p<sub>x</sub>| &#x3C; dmin }
+  nS ← number of points in yS
+  (closest, closestPair) ← (dmin, pairMin)
+  <strong>for</strong> i <strong>from</strong> 1 <strong>to</strong> nS - 1
+    k ← i + 1
+    <strong>while</strong> k ≤ nS <strong>and</strong> yS(k)<sub>y</sub> - yS(i)<sub>y</sub> &#x3C; dmin
+      <strong>if</strong> |yS(k) - yS(i)| &#x3C; closest <strong>then</strong>
+        (closest, closestPair) ← (|yS(k) - yS(i)|, {yS(k), yS(i)})
+      <strong>endif</strong>
+      k ← k + 1
+    <strong>endwhile</strong>
+  <strong>endfor</strong>
+  <strong>return</strong> closest, closestPair
+<strong>endif</strong>
+</pre>
+
+For the input, expect the argument to be an array of `Point` objects with `x` and `y` members set to numbers. Return an object containing the key:value pairs for `distance` and `pair` (the pair of two closest points).
+
+For example `getClosestPair` with input array `points`:
+
+```js
+const points = [
+  new Point(1, 2),
+  new Point(3, 3),
+  new Point(2, 2)
+];
+```
+
+Would return:
+
+```js
+{
+  distance: 1,
+  pair: [
+    {
+      x: 1,
+      y: 2
+    },
+    {
+      x: 2,
+      y: 2
+    }
+  ]
+}
+```
+
+**Note:** Sort the `pair` array by their `x` values in incrementing order.
+
+
+# --hints--
+
+`getClosestPair` should be a function.
+
+```js
+assert(typeof getClosestPair === 'function');
+```
+
+`getClosestPair(points1).distance` should be `0.0894096443343775`.
+
+```js
+assert.equal(getClosestPair(points1).distance, answer1.distance);
+```
+
+`getClosestPair(points1).pair` should be `[ { x: 7.46489, y: 4.6268 }, { x: 7.46911, y: 4.71611 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points1))).pair,
+  answer1.pair
+);
+```
+
+`getClosestPair(points2).distance` should be `65.06919393998976`.
+
+```js
+assert.equal(getClosestPair(points2).distance, answer2.distance);
+```
+
+`getClosestPair(points2).pair` should be `[ { x: 37134, y: 1963 }, { x: 37181, y: 2008 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points2))).pair,
+  answer2.pair
+);
+```
+
+`getClosestPair(points3).distance` should be `6754.625082119658`.
+
+```js
+assert.equal(getClosestPair(points3).distance, answer3.distance);
+```
+
+`getClosestPair(points3).pair` should be `[ { x: 46817, y: 64975 }, { x: 48953, y: 58567 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points3))).pair,
+  answer3.pair
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const points1 = [
+    new Point(0.748501, 4.09624),
+    new Point(3.00302, 5.26164),
+    new Point(3.61878,  9.52232),
+    new Point(7.46911,  4.71611),
+    new Point(5.7819,   2.69367),
+    new Point(2.34709,  8.74782),
+    new Point(2.87169,  5.97774),
+    new Point(6.33101,  0.463131),
+    new Point(7.46489,  4.6268),
+    new Point(1.45428,  0.087596)
+];
+
+const answer1 = {
+  distance: 0.0894096443343775,
+  pair: [
+    {
+      x: 7.46489,
+      y: 4.6268
+    },
+    {
+      x: 7.46911,
+      y: 4.71611
+    }
+  ]
+};
+
+const points2 = [
+  new Point(37100, 13118),
+  new Point(37134, 1963),
+  new Point(37181, 2008),
+  new Point(37276, 21611),
+  new Point(37307, 9320)
+];
+
+const answer2 = {
+  distance: 65.06919393998976,
+  pair: [
+    {
+      x: 37134,
+      y: 1963
+    },
+    {
+      x: 37181,
+      y: 2008
+    }
+  ]
+};
+
+const points3 = [
+  new Point(16910, 54699),
+  new Point(14773, 61107),
+  new Point(95547, 45344),
+  new Point(95951, 17573),
+  new Point(5824, 41072),
+  new Point(8769, 52562),
+  new Point(21182, 41881),
+  new Point(53226, 45749),
+  new Point(68180, 887),
+  new Point(29322, 44017),
+  new Point(46817, 64975),
+  new Point(10501, 483),
+  new Point(57094, 60703),
+  new Point(23318, 35472),
+  new Point(72452, 88070),
+  new Point(67775, 28659),
+  new Point(19450, 20518),
+  new Point(17314, 26927),
+  new Point(98088, 11164),
+  new Point(25050, 56835),
+  new Point(8364, 6892),
+  new Point(37868, 18382),
+  new Point(23723, 7701),
+  new Point(55767, 11569),
+  new Point(70721, 66707),
+  new Point(31863, 9837),
+  new Point(49358, 30795),
+  new Point(13041, 39744),
+  new Point(59635, 26523),
+  new Point(25859, 1292),
+  new Point(1551, 53890),
+  new Point(70316, 94479),
+  new Point(48549, 86338),
+  new Point(46413, 92747),
+  new Point(27186, 50426),
+  new Point(27591, 22655),
+  new Point(10905, 46153),
+  new Point(40408, 84202),
+  new Point(52821, 73520),
+  new Point(84865, 77388),
+  new Point(99819, 32527),
+  new Point(34404, 75657),
+  new Point(78457, 96615),
+  new Point(42140, 5564),
+  new Point(62175, 92342),
+  new Point(54958, 67112),
+  new Point(4092, 19709),
+  new Point(99415, 60298),
+  new Point(51090, 52158),
+  new Point(48953, 58567)
+];
+
+const answer3 = {
+  distance: 6754.625082119658,
+  pair: [
+    {
+      x: 46817,
+      y: 64975
+    },
+    {
+      x: 48953,
+      y: 58567
+    }
+  ]
+}
+```
+
+## --seed-contents--
+
+```js
+const Point = function(x, y) {
+  this.x = x;
+  this.y = y;
+};
+Point.prototype.getX = function() {
+  return this.x;
+};
+Point.prototype.getY = function() {
+  return this.y;
+};
+
+function getClosestPair(pointsArr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const Point = function(x, y) {
+  this.x = x;
+  this.y = y;
+};
+Point.prototype.getX = function() {
+  return this.x;
+};
+Point.prototype.getY = function() {
+  return this.y;
+};
+
+const mergeSort = function mergeSort(points, comp) {
+    if(points.length < 2) return points;
+
+    var n = points.length,
+        i = 0,
+        j = 0,
+        leftN = Math.floor(n / 2),
+        rightN = leftN;
+
+    var leftPart = mergeSort( points.slice(0, leftN), comp),
+        rightPart = mergeSort( points.slice(rightN), comp );
+
+    var sortedPart = [];
+
+    while((i < leftPart.length) && (j < rightPart.length)) {
+        if(comp(leftPart[i], rightPart[j]) < 0) {
+            sortedPart.push(leftPart[i]);
+            i += 1;
+        }
+        else {
+            sortedPart.push(rightPart[j]);
+            j += 1;
+        }
+    }
+    while(i < leftPart.length) {
+        sortedPart.push(leftPart[i]);
+        i += 1;
+    }
+    while(j < rightPart.length) {
+        sortedPart.push(rightPart[j]);
+        j += 1;
+    }
+    return sortedPart;
+};
+
+const closestPair = function _closestPair(Px, Py) {
+    if(Px.length < 2) return { distance: Infinity, pair: [ new Point(0, 0), new Point(0, 0) ] };
+    if(Px.length < 3) {
+        //find euclid distance
+        var d = Math.sqrt( Math.pow(Math.abs(Px[1].x - Px[0].x), 2) + Math.pow(Math.abs(Px[1].y - Px[0].y), 2) );
+        return {
+            distance: d,
+            pair: [ Px[0], Px[1] ]
+        };
+    }
+
+    var n = Px.length,
+        leftN = Math.floor(n / 2),
+        rightN = leftN;
+
+    var Xl = Px.slice(0, leftN),
+        Xr = Px.slice(rightN),
+        Xm = Xl[leftN - 1],
+        Yl = [],
+        Yr = [];
+    //separate Py
+    for(var i = 0; i < Py.length; i += 1) {
+        if(Py[i].x <= Xm.x)
+            Yl.push(Py[i]);
+        else
+            Yr.push(Py[i]);
+    }
+
+    var dLeft = _closestPair(Xl, Yl),
+        dRight = _closestPair(Xr, Yr);
+
+    var minDelta = dLeft.distance,
+        closestPair = dLeft.pair;
+    if(dLeft.distance > dRight.distance) {
+        minDelta = dRight.distance;
+        closestPair = dRight.pair;
+    }
+
+    //filter points around Xm within delta (minDelta)
+    var closeY = [];
+    for(i = 0; i < Py.length; i += 1) {
+        if(Math.abs(Py[i].x - Xm.x) < minDelta) closeY.push(Py[i]);
+    }
+    //find min within delta. 8 steps max
+    for(i = 0; i < closeY.length; i += 1) {
+        for(var j = i + 1; j < Math.min( (i + 8), closeY.length ); j += 1) {
+            var d = Math.sqrt( Math.pow(Math.abs(closeY[j].x - closeY[i].x), 2) + Math.pow(Math.abs(closeY[j].y - closeY[i].y), 2) );
+            if(d < minDelta) {
+                minDelta = d;
+                closestPair = [ closeY[i], closeY[j] ]
+            }
+        }
+    }
+
+    return {
+        distance: minDelta,
+        pair: closestPair.sort((pointA, pointB) => pointA.x - pointB.x)
+    };
+};
+
+function getClosestPair(points) {
+  const sortX = function(a, b) { return (a.x < b.x) ? -1 : ((a.x > b.x) ? 1 : 0); }
+  const sortY = function(a, b) { return (a.y < b.y) ? -1 : ((a.y > b.y) ? 1 : 0); }
+
+  const Px = mergeSort(points, sortX);
+  const Py = mergeSort(points, sortY);
+
+  return closestPair(Px, Py);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/combinations.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/combinations.md
new file mode 100644
index 0000000000..27e9a3fa6d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/combinations.md
@@ -0,0 +1,95 @@
+---
+id: 5958469238c0d8d2632f46db
+title: Combinations
+challengeType: 5
+forumTopicId: 302233
+dashedName: combinations
+---
+
+# --description--
+
+Given non-negative integers `m` and `n`, generate all size `m` combinations of the integers from `0` (zero) to `n-1` in sorted order (each combination is sorted and the entire table is sorted).
+
+**Example:**
+
+`3` comb `5` is:
+
+<pre>0 1 2
+0 1 3
+0 1 4
+0 2 3
+0 2 4
+0 3 4
+1 2 3
+1 2 4
+1 3 4
+2 3 4
+</pre>
+
+# --hints--
+
+`combinations` should be a function.
+
+```js
+assert(typeof combinations === 'function');
+```
+
+`combinations(3, 5)` should return `[[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]]`.
+
+```js
+assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1);
+```
+
+`combinations(4, 6)` should return `[[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]`
+
+```js
+assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testInput1 = [3, 5];
+const testOutput1 = [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]];
+
+const testInput2 = [4, 6];
+const testOutput2 = [[0, 1, 2, 3], [0, 1, 2, 4], [0, 1, 2, 5], [0, 1, 3, 4], [0, 1, 3, 5], [0, 1, 4, 5], [0, 2, 3, 4], [0, 2, 3, 5], [0, 2, 4, 5], [0, 3, 4, 5], [1, 2, 3, 4], [1, 2, 3, 5], [1, 2, 4, 5], [1, 3, 4, 5], [2, 3, 4, 5]];
+```
+
+## --seed-contents--
+
+```js
+function combinations(m, n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function combinations(m, n) {
+  const nArr = [...Array(n).keys()];
+
+  return (function generateCombinations (size, numArr) {
+    const ret = [];
+
+    for (let i = 0; i < numArr.length; i++) {
+      if (size === 1) {
+        ret.push([numArr[i]]);
+      }
+      else {
+        const sub = generateCombinations(size - 1, numArr.slice(i + 1, numArr.length));
+        for (let subI = 0; subI < sub.length; subI++) {
+          const next = sub[subI];
+          next.unshift(numArr[i]);
+          ret.push(next);
+        }
+      }
+    }
+    return ret;
+  }(m, nArr));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
new file mode 100644
index 0000000000..6223a523ce
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -0,0 +1,101 @@
+---
+id: 596e414344c3b2872167f0fe
+title: Comma quibbling
+challengeType: 5
+forumTopicId: 302234
+dashedName: comma-quibbling
+---
+
+# --description--
+
+Comma quibbling is a task originally set by Eric Lippert in his [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+
+# --instructions--
+
+Write a function to generate a string output which is the concatenation of input words from a list/sequence where:
+
+<ol>
+  <li>An input of no words produces the output string of just the two brace characters (<code>"{}"</code>)</li>
+  <li>An input of just one word, e.g. <code>["ABC"]</code>, produces the output string of the word inside the two braces, e.g. <code>"{ABC}"</code></li>
+  <li>An input of two words, e.g. <code>["ABC", "DEF"]</code>, produces the output string of the two words inside the two braces with the words separated by the string <code>" and "</code>, e.g. <code>"{ABC and DEF}"</code></li>
+  <li>An input of three or more words, e.g. <code>["ABC", "DEF", "G", "H"]</code>, produces the output string of all but the last word separated by <code>", "</code> with the last word separated by <code>" and "</code> and all within braces; e.g. <code>"{ABC, DEF, G and H}"</code></li>
+</ol>
+
+Test your function with the following series of inputs showing your output here on this page:
+
+<ul>
+  <li>[] # (No input words).</li>
+  <li>["ABC"]</li>
+  <li>["ABC", "DEF"]</li>
+  <li>["ABC", "DEF", "G", "H"]</li>
+</ul>
+
+**Note:** Assume words are non-empty strings of uppercase characters for this task.
+
+# --hints--
+
+`quibble` should be a function.
+
+```js
+assert(typeof quibble === 'function');
+```
+
+`quibble(["ABC"])` should return a string.
+
+```js
+assert(typeof quibble(['ABC']) === 'string');
+```
+
+`quibble([])` should return "{}".
+
+```js
+assert.equal(quibble(testCases[0]), results[0]);
+```
+
+`quibble(["ABC"])` should return "{ABC}".
+
+```js
+assert.equal(quibble(testCases[1]), results[1]);
+```
+
+`quibble(["ABC", "DEF"])` should return "{ABC and DEF}".
+
+```js
+assert.equal(quibble(testCases[2]), results[2]);
+```
+
+`quibble(["ABC", "DEF", "G", "H"])` should return "{ABC,DEF,G and H}".
+
+```js
+assert.equal(quibble(testCases[3]), results[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+```
+
+## --seed-contents--
+
+```js
+function quibble(words) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function quibble(words) {
+  return "{" +
+    words.slice(0, words.length - 1).join(",") +
+   (words.length > 1 ? " and " : "") +
+   (words[words.length - 1] || '') +
+  "}";
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
new file mode 100644
index 0000000000..313cda7dcc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -0,0 +1,132 @@
+---
+id: 596e457071c35c882915b3e4
+title: Compare a list of strings
+challengeType: 5
+forumTopicId: 302235
+dashedName: compare-a-list-of-strings
+---
+
+# --description--
+
+Given a [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") of arbitrarily many strings, implement a function for each of the following conditions:
+
+<ul>
+  <li>test if they are all lexically equal</li>
+  <li>test if every string is lexically less than the one after it  (i.e. whether the list is in strict ascending order)</li>
+</ul>
+
+# --hints--
+
+`allEqual` should be a function.
+
+```js
+assert(typeof allEqual === 'function');
+```
+
+`azSorted` should be a function.
+
+```js
+assert(typeof azSorted === 'function');
+```
+
+`allEqual(["AA", "AA", "AA", "AA"])` should return true.
+
+```js
+assert(allEqual(testCases[0]));
+```
+
+`azSorted(["AA", "AA", "AA", "AA"])` should return false.
+
+```js
+assert(!azSorted(testCases[0]));
+```
+
+`allEqual(["AA", "ACB", "BB", "CC"])` should return false.
+
+```js
+assert(!allEqual(testCases[1]));
+```
+
+`azSorted(["AA", "ACB", "BB", "CC"])` should return true.
+
+```js
+assert(azSorted(testCases[1]));
+```
+
+`allEqual([])` should return true.
+
+```js
+assert(allEqual(testCases[2]));
+```
+
+`azSorted([])` should return true.
+
+```js
+assert(azSorted(testCases[2]));
+```
+
+`allEqual(["AA"])` should return true.
+
+```js
+assert(allEqual(testCases[3]));
+```
+
+`azSorted(["AA"])` should return true.
+
+```js
+assert(azSorted(testCases[3]));
+```
+
+`allEqual(["BB", "AA"])` should return false.
+
+```js
+assert(!allEqual(testCases[4]));
+```
+
+`azSorted(["BB", "AA"])` should return false.
+
+```js
+assert(!azSorted(testCases[4]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [['AA', 'AA', 'AA', 'AA'], ['AA', 'ACB', 'BB', 'CC'], [], ['AA'], ['BB', 'AA']];
+```
+
+## --seed-contents--
+
+```js
+function allEqual(arr) {
+
+  return true;
+}
+
+function azSorted(arr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function allEqual(a) {
+  let out = true;
+  let i = 0;
+  while (++i < a.length) {
+    out = out && (a[i - 1] === a[i]);
+  } return out;
+}
+
+function azSorted(a) {
+  let out = true;
+  let i = 0;
+  while (++i < a.length) {
+    out = out && (a[i - 1] < a[i]);
+  } return out;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
new file mode 100644
index 0000000000..740d69b7b0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -0,0 +1,129 @@
+---
+id: 596fd036dc1ab896c5db98b1
+title: Convert seconds to compound duration
+challengeType: 5
+forumTopicId: 302236
+dashedName: convert-seconds-to-compound-duration
+---
+
+# --description--
+
+Implement a function which:
+
+<ul>
+  <li>takes a positive integer representing a duration in seconds as input (e.g., <code>100</code>), and</li>
+  <li>returns a string which shows the same duration decomposed into weeks, days, hours, minutes, and seconds as detailed below (e.g., <code>1 min, 40 sec</code>).</li>
+</ul>
+
+Demonstrate that it passes the following three test-cases:
+
+<div style='font-size:115%; font-weight: bold;'>Test Cases</div>
+
+| Input number | Output number                         |
+| ------------ | ------------------------------------- |
+| 7259         | <code>2 hr, 59 sec</code>             |
+| 86400        | <code>1 d</code>                      |
+| 6000000      | <code>9 wk, 6 d, 10 hr, 40 min</code> |
+
+<div style="font-size:115%; font-weight: bold;">Details</div>
+<ul>
+  <li>
+    The following five units should be used:
+
+| Unit   | Suffix used in Output | Conversion            |
+| ------ | --------------------- | --------------------- |
+| week   | <code>wk</code>       | 1 week = 7 days       |
+| day    | <code>d</code>        | 1 day = 24 hours      |
+| hour   | <code>hr</code>       | 1 hour = 60 minutes   |
+| minute | <code>min</code>      | 1 minute = 60 seconds |
+| second | <code>sec</code>      | ---                   |
+
+  </li>
+  <li>
+    However, <strong>only</strong> include quantities with non-zero values in the output (e.g., return <code>1 d</code> and not <code>0 wk, 1 d, 0 hr, 0 min, 0 sec</code>).
+  </li>
+  <li>
+    Give larger units precedence over smaller ones as much as possible (e.g., return <code>2 min, 10 sec</code> and not <code>1 min, 70 sec</code> or <code>130 sec</code>).
+  </li>
+  <li>
+    Mimic the formatting shown in the test-cases (quantities sorted from largest unit to smallest and separated by comma+space; value and unit of each quantity separated by space).
+  </li>
+</ul>
+
+# --hints--
+
+`convertSeconds` should be a function.
+
+```js
+assert(typeof convertSeconds === 'function');
+```
+
+`convertSeconds(7259)` should return `2 hr, 59 sec`.
+
+```js
+assert.equal(convertSeconds(testCases[0]), results[0]);
+```
+
+`convertSeconds(86400)` should return `1 d`.
+
+```js
+assert.equal(convertSeconds(testCases[1]), results[1]);
+```
+
+`convertSeconds(6000000)` should return `9 wk, 6 d, 10 hr, 40 min`.
+
+```js
+assert.equal(convertSeconds(testCases[2]), results[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [7259, 86400, 6000000];
+const results = ['2 hr, 59 sec', '1 d', '9 wk, 6 d, 10 hr, 40 min'];
+```
+
+## --seed-contents--
+
+```js
+function convertSeconds(sec) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function convertSeconds(sec) {
+  const localNames = ['wk', 'd', 'hr', 'min', 'sec'];
+  // compoundDuration :: [String] -> Int -> String
+  const compoundDuration = (labels, intSeconds) =>
+    weekParts(intSeconds)
+    .map((v, i) => [v, labels[i]])
+    .reduce((a, x) =>
+      a.concat(x[0] ? [`${x[0]} ${x[1] || '?'}`] : []), []
+    )
+    .join(', ');
+
+    // weekParts :: Int -> [Int]
+  const weekParts = intSeconds => [0, 7, 24, 60, 60]
+    .reduceRight((a, x) => {
+      const r = a.rem;
+      const mod = x !== 0 ? r % x : r;
+
+      return {
+        rem: (r - mod) / (x || 1),
+        parts: [mod].concat(a.parts)
+      };
+    }, {
+      rem: intSeconds,
+      parts: []
+    })
+    .parts;
+
+  return compoundDuration(localNames, sec);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
new file mode 100644
index 0000000000..50d6c16f8d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
@@ -0,0 +1,79 @@
+---
+id: 596fda99c69f779975a1b67d
+title: Count occurrences of a substring
+challengeType: 5
+forumTopicId: 302237
+dashedName: count-occurrences-of-a-substring
+---
+
+# --description--
+
+Create a function, or show a built-in function, to count the number of non-overlapping occurrences of a substring inside a string.
+
+The function should take two arguments:
+
+<ul>
+  <li>the first argument being the string to search, and</li>
+  <li>the second a substring to be searched for.</li>
+</ul>
+
+It should return an integer count.
+
+The matching should yield the highest number of non-overlapping matches.
+
+In general, this essentially means matching from left-to-right or right-to-left.
+
+# --hints--
+
+`countSubstring` should be a function.
+
+```js
+assert(typeof countSubstring === 'function');
+```
+
+`countSubstring("the three truths", "th")` should return `3`.
+
+```js
+assert.equal(countSubstring(testCases[0], searchString[0]), results[0]);
+```
+
+`countSubstring("ababababab", "abab")` should return `2`.
+
+```js
+assert.equal(countSubstring(testCases[1], searchString[1]), results[1]);
+```
+
+`countSubstring("abaabba*bbaba*bbab", "a*b")` should return `2`.
+
+```js
+assert.equal(countSubstring(testCases[2], searchString[2]), results[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = ['the three truths', 'ababababab', 'abaabba*bbaba*bbab'];
+const searchString = ['th', 'abab', 'a*b'];
+const results = [3, 2, 2];
+```
+
+## --seed-contents--
+
+```js
+function countSubstring(str, subStr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function countSubstring(str, subStr) {
+  const escapedSubStr = subStr.replace(/[.+*?^$[\]{}()|/]/g, '\\$&');
+  const matches = str.match(new RegExp(escapedSubStr, 'g'));
+  return matches ? matches.length : 0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-the-coins.md
new file mode 100644
index 0000000000..3e6bd14d1d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -0,0 +1,93 @@
+---
+id: 59713bd26bdeb8a594fb9413
+title: Count the coins
+challengeType: 5
+forumTopicId: 302238
+dashedName: count-the-coins
+---
+
+# --description--
+
+There are four types of common coins in [US](https://en.wikipedia.org/wiki/United_States) currency:
+
+<ul>
+  <li>quarters (25 cents)</li>
+  <li>dimes (10 cents)</li>
+  <li>nickels (5 cents), and</li>
+  <li>pennies (1 cent)</li>
+</ul>
+
+<p>There are six ways to make change for 15 cents:</p>
+
+<ul>
+  <li>A dime and a nickel</li>
+  <li>A dime and 5 pennies</li>
+  <li>3 nickels</li>
+  <li>2 nickels and 5 pennies</li>
+  <li>A nickel and 10 pennies</li>
+  <li>15 pennies</li>
+</ul>
+
+# --instructions--
+
+Implement a function to determine how many ways there are to make change for a given input, `cents`, that represents an amount of US pennies using these common coins.
+
+# --hints--
+
+`countCoins` should be a function.
+
+```js
+assert(typeof countCoins === 'function');
+```
+
+`countCoins(15)` should return `6`.
+
+```js
+assert.equal(countCoins(15), 6);
+```
+
+`countCoins(85)` shouls return `163`.
+
+```js
+assert.equal(countCoins(85), 163);
+```
+
+`countCoins(100)` should return `242`.
+
+```js
+assert.equal(countCoins(100), 242);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countCoins(cents) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function countCoins(cents) {
+  const operands = [1, 5, 10, 25];
+  const targetsLength = cents + 1;
+  const operandsLength = operands.length;
+  const t = [1];
+
+  for (let a = 0; a < operandsLength; a++) {
+    for (let b = 1; b < targetsLength; b++) {
+      // initialise undefined target
+      t[b] = t[b] ? t[b] : 0;
+
+      // accumulate target + operand ways
+      t[b] += (b < operands[a]) ? 0 : t[b - operands[a]];
+    }
+  }
+
+  return t[targetsLength - 1];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cramers-rule.md
new file mode 100644
index 0000000000..9b49a3fac2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -0,0 +1,167 @@
+---
+id: 59713da0a428c1a62d7db430
+title: Cramer's rule
+challengeType: 5
+forumTopicId: 302239
+dashedName: cramers-rule
+---
+
+# --description--
+
+In [linear algebra](<https://en.wikipedia.org/wiki/linear algebra> "wp: linear algebra"), [Cramer's rule](<https://en.wikipedia.org/wiki/Cramer's rule> "wp: Cramer's rule") is an explicit formula for the solution of a [system of linear equations](<https://en.wikipedia.org/wiki/system of linear equations> "wp: system of linear equations") with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations.
+
+Given
+
+$\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
+
+which in matrix format is
+
+$\\begin{bmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{bmatrix}\\begin{bmatrix} x \\\\ y \\\\ z \\end{bmatrix}=\\begin{bmatrix} {\\color{red}d_1} \\\\ {\\color{red}d_2} \\\\ {\\color{red}d_3} \\end{bmatrix}.$
+
+Then the values of $x, y$ and $z$ can be found as follows:
+
+$x = \\frac{\\begin{vmatrix} {\\color{red}d_1} & b_1 & c_1 \\\\ {\\color{red}d_2} & b_2 & c_2 \\\\ {\\color{red}d_3} & b_3 & c_3 \\end{vmatrix} } { \\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\quad y = \\frac {\\begin{vmatrix} a_1 & {\\color{red}d_1} & c_1 \\\\ a_2 & {\\color{red}d_2} & c_2 \\\\ a_3 & {\\color{red}d_3} & c_3 \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\text{ and }z = \\frac { \\begin{vmatrix} a_1 & b_1 & {\\color{red}d_1} \\\\ a_2 & b_2 & {\\color{red}d_2} \\\\ a_3 & b_3 & {\\color{red}d_3} \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix} }.$
+
+# --instructions--
+
+Given the following system of equations:
+
+$\\begin{cases} 2w-x+5y+z=-3 \\\\ 3w+2x+2y-6z=-32 \\\\ w+3x+3y-z=-47 \\\\ 5w-2x-3y+3z=49 \\\\ \\end{cases}$
+
+solve for $w$, $x$, $y$ and $z$, using Cramer's rule.
+
+# --hints--
+
+`cramersRule` should be a function.
+
+```js
+assert(typeof cramersRule === 'function');
+```
+
+`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` should return `[2, -12, -4, 1]`.
+
+```js
+assert.deepEqual(cramersRule(matrices[0], freeTerms[0]), answers[0]);
+```
+
+`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` should return `[1, 1, -1]`.
+
+```js
+assert.deepEqual(cramersRule(matrices[1], freeTerms[1]), answers[1]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const matrices = [
+  [
+    [2, -1, 5, 1],
+    [3, 2, 2, -6],
+    [1, 3, 3, -1],
+    [5, -2, -3, 3]
+  ],
+  [
+    [3, 1, 1],
+    [2, 2, 5],
+    [1, -3, -4]
+  ]
+];
+const freeTerms = [[-3, -32, -47, 49], [3, -1, 2]];
+
+const answers = [[2, -12, -4, 1], [1, 1, -1]];
+```
+
+## --seed-contents--
+
+```js
+function cramersRule(matrix, freeTerms) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+/**
+ * Compute Cramer's Rule
+ * @param  {array} matrix    x,y,z, etc. terms
+ * @param  {array} freeTerms
+ * @return {array}           solution for x,y,z, etc.
+ */
+function cramersRule(matrix, freeTerms) {
+  const det = detr(matrix);
+  const returnArray = [];
+  let i;
+
+  for (i = 0; i < matrix[0].length; i++) {
+    const tmpMatrix = insertInTerms(matrix, freeTerms, i);
+    returnArray.push(detr(tmpMatrix) / det);
+  }
+  return returnArray;
+}
+
+/**
+ * Inserts single dimensional array into
+ * @param  {array} matrix multidimensional array to have ins inserted into
+ * @param  {array} ins single dimensional array to be inserted vertically into matrix
+ * @param  {array} at  zero based offset for ins to be inserted into matrix
+ * @return {array}     New multidimensional array with ins replacing the at column in matrix
+ */
+function insertInTerms(matrix, ins, at) {
+  const tmpMatrix = clone(matrix);
+  let i;
+  for (i = 0; i < matrix.length; i++) {
+    tmpMatrix[i][at] = ins[i];
+  }
+  return tmpMatrix;
+}
+/**
+ * Compute the determinate of a matrix.  No protection, assumes square matrix
+ * function borrowed, and adapted from MIT Licensed numericjs library (www.numericjs.com)
+ * @param  {array} m Input Matrix (multidimensional array)
+ * @return {number}   result rounded to 2 decimal
+ */
+function detr(m) {
+  let ret = 1;
+  let j;
+  let k;
+  const A = clone(m);
+  const n = m[0].length;
+  let alpha;
+
+  for (j = 0; j < n - 1; j++) {
+    k = j;
+    for (let i = j + 1; i < n; i++) { if (Math.abs(A[i][j]) > Math.abs(A[k][j])) { k = i; } }
+    if (k !== j) {
+      const temp = A[k]; A[k] = A[j]; A[j] = temp;
+      ret *= -1;
+    }
+    const Aj = A[j];
+    for (let i = j + 1; i < n; i++) {
+      const Ai = A[i];
+      alpha = Ai[j] / Aj[j];
+      for (k = j + 1; k < n - 1; k += 2) {
+        const k1 = k + 1;
+        Ai[k] -= Aj[k] * alpha;
+        Ai[k1] -= Aj[k1] * alpha;
+      }
+      if (k !== n) { Ai[k] -= Aj[k] * alpha; }
+    }
+    if (Aj[j] === 0) { return 0; }
+    ret *= Aj[j];
+  }
+  return Math.round(ret * A[j][j] * 100) / 100;
+}
+
+/**
+ * Clone two dimensional Array using ECMAScript 5 map function and EcmaScript 3 slice
+ * @param  {array} m Input matrix (multidimensional array) to clone
+ * @return {array}   New matrix copy
+ */
+function clone(m) {
+  return m.map(a => a.slice());
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
new file mode 100644
index 0000000000..4ca5496cb7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -0,0 +1,101 @@
+---
+id: 5a23c84252665b21eecc7e03
+title: Cumulative standard deviation
+challengeType: 5
+forumTopicId: 302240
+dashedName: cumulative-standard-deviation
+---
+
+# --description--
+
+Write a function that takes an array of numbers as parameter and returns the [standard deviation](<https://en.wikipedia.org/wiki/Standard Deviation>) of the series.
+
+# --hints--
+
+`standardDeviation` should be a function.
+
+```js
+assert(typeof standardDeviation == 'function');
+```
+
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return a number.
+
+```js
+assert(typeof standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]) == 'number');
+```
+
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return `2`.
+
+```js
+assert.equal(standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]), 2);
+```
+
+`standardDeviation([600, 470, 170, 430, 300])` should return `147.323`.
+
+```js
+assert.equal(standardDeviation([600, 470, 170, 430, 300]), 147.323);
+```
+
+`standardDeviation([75, 83, 96, 100, 121, 125])` should return `18.239`.
+
+```js
+assert.equal(standardDeviation([75, 83, 96, 100, 121, 125]), 18.239);
+```
+
+`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` should return `16.87`.
+
+```js
+assert.equal(
+  standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82]),
+  16.87
+);
+```
+
+`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` should return `22.631`.
+
+```js
+assert.equal(
+  standardDeviation([
+    271,
+    354,
+    296,
+    301,
+    333,
+    326,
+    285,
+    298,
+    327,
+    316,
+    287,
+    314
+  ]),
+  22.631
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function standardDeviation(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function standardDeviation(arr) {
+  var sum = 0,
+    sum_sq = 0,
+    n = arr.length;
+  arr.forEach(function(e) {
+    sum += e;
+    sum_sq += e * e;
+  });
+
+  var std_dev = Math.sqrt(sum_sq / n - Math.pow(sum / n, 2));
+  return Math.round(std_dev * 1000) / 1000;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cusip.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cusip.md
new file mode 100644
index 0000000000..0daefa3293
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cusip.md
@@ -0,0 +1,118 @@
+---
+id: 5a23c84252665b21eecc7e05
+title: CUSIP
+challengeType: 5
+forumTopicId: 302241
+dashedName: cusip
+---
+
+# --description--
+
+A **CUSIP** is a nine-character alphanumeric code that identifies a North American financial security for the purposes of facilitating clearing and settlement of trades. The CUSIP was adopted as an American National Standard under Accredited Standards X9.6.
+
+# --instructions--
+
+Write a function that takes a string as a parameter and checks if the string is valid CUSIP.
+
+# --hints--
+
+`isCusip` should be a function.
+
+```js
+assert(typeof isCusip == 'function');
+```
+
+`isCusip("037833100")` should return a boolean.
+
+```js
+assert(typeof isCusip('037833100') == 'boolean');
+```
+
+`isCusip("037833100")` should return `true`.
+
+```js
+assert.equal(isCusip('037833100'), true);
+```
+
+`isCusip("17275R102")` should return `true`.
+
+```js
+assert.equal(isCusip('17275R102'), true);
+```
+
+`isCusip("38259P50a")` should return `false`.
+
+```js
+assert.equal(isCusip('38259P50a'), false);
+```
+
+`isCusip("38259P508")` should return `true`.
+
+```js
+assert.equal(isCusip('38259P508'), true);
+```
+
+`isCusip("38259P50#")` should return `false`.
+
+```js
+assert.equal(isCusip('38259P50#'), false);
+```
+
+`isCusip("68389X105")` should return `true`.
+
+```js
+assert.equal(isCusip('68389X105'), true);
+```
+
+`isCusip("68389X106")` should return `false`.
+
+```js
+assert.equal(isCusip('68389X106'), false);
+```
+
+`isCusip("5949181")` should return `false`.
+
+```js
+assert.equal(isCusip('5949181'), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isCusip(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isCusip(s) {
+  if (s.length != 9) return false;
+  var sum = 0;
+  var ASCII = x => x.charCodeAt(0);
+  for (var i = 0; i < 7; i++) {
+    var c = s.charCodeAt(i);
+
+    var v;
+    if (c >= ASCII('0') && c <= ASCII('9')) {
+      v = c - 48;
+    } else if (c >= ASCII('A') && c <= ASCII('Z')) {
+      v = c - 64; // lower case letters apparently invalid
+    } else if (c == ASCII('*')) {
+      v = 36;
+    } else if (c == ASCII('@')) {
+      v = 37;
+    } else if (c == ASCII('#')) {
+      v = 38;
+    } else {
+      return false;
+    }
+    if (i % 2 == 1) v *= 2; // check if odd as using 0-based indexing
+    sum += Math.floor(v / 10) + (v % 10);
+  }
+  return s.charCodeAt(8) - 48 == (10 - (sum % 10)) % 10;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
new file mode 100644
index 0000000000..74e9412a08
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
@@ -0,0 +1,203 @@
+---
+id: 5a23c84252665b21eecc7e06
+title: Cut a rectangle
+challengeType: 5
+forumTopicId: 302242
+dashedName: cut-a-rectangle
+---
+
+# --description--
+
+A given rectangle is made from *m* × *n* squares. If *m* and *n* are not both odd, then it is possible to cut a path through the rectangle along the square edges such that the rectangle splits into two connected pieces with the same shape (after rotating one of the pieces by 180°). All such paths for 2 × 2 and 4 × 3 rectangles are shown below.
+
+<div style="width: 100%; text-align: center;">
+  <svg xmlns="https://www.w3.org/2000/svg" xmlns:xlink="https://www.w3.org/1999/xlink" width="520" height="170" aria-hidden="true" alt="Diagram showing the possible paths for 2 by 2 and 4 by 3 rectangles">
+    <style>
+      .diagram-g { fill: none; stroke: #ccc }
+      .diagram-s, .diagram-s2 { fill: #bff; stroke: black; fill-opacity: .4 }
+      .diagram-s2 { fill: #fbf }
+      .diagram-d { stroke:black; fill:none}
+    </style>
+    <defs>
+      <g id="diagram-m">
+        <g id="diagram-h4">
+          <g id="diagram-h2">
+            <path id="diagram-h" d="m0 10h 640" class="diagram-g"/>
+            <use xlink:href="#diagram-h" transform="translate(0, 20)"/>
+          </g>
+          <use xlink:href="#diagram-h2" transform="translate(0, 40)"/>
+        </g>
+        <use xlink:href="#diagram-h4" transform="translate(0, 80)"/>
+        <g id="diagram-v8">
+          <g id="diagram-v4">
+            <g id="diagram-v2">
+              <path id="diagram-v" d="m10 0v160 m 20 0 v-160" class="diagram-g"/>
+              <use xlink:href="#diagram-v" transform="translate(40, 0)"/>
+            </g>
+            <use xlink:href="#diagram-v2" transform="translate(80, 0)"/>
+          </g>
+          <use xlink:href="#diagram-v4" transform="translate(160, 0)"/>
+        </g>
+        <use xlink:href="#diagram-v8" transform="translate(320, 0)"/>
+      </g>
+      <path id="diagram-b" d="m0 0h80v60h-80z" class="diagram-s"/>
+    </defs>
+    <g transform="translate(.5, .5)">
+      <use xlink:href="#diagram-m"/>
+      <g transform="translate(10, 10)">
+        <path d="m0 0v40h40v-40z" class="diagram-s2"/>
+        <path d="m20 0v40" class="diagram-d"/>
+        <path d="m60 0v40h40v-40z" class="diagram-s2"/>
+        <path d="m60 20h40" class="diagram-d"/>
+        <g transform="translate(120, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 20h40v20h40" class="diagram-d"/>
+        </g>
+        <g transform="translate(220, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 40h40v-20h40" class="diagram-d"/>
+        </g>
+        <g transform="translate(320, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m20 0v40h20v-20h20v40" class="diagram-d"/>
+        </g>
+        <g transform="translate(420, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m60 0v40h-20v-20h-20v40" class="diagram-d"/>
+        </g>
+        <g transform="translate(20, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m40 0v60" class="diagram-d"/>
+        </g>
+        <g transform="translate(120, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m60 0v20h-20v20h-20v20" class="diagram-d"/>
+        </g>
+        <g transform="translate(220, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m20 0v20h20v20h20v20" class="diagram-d"/>
+        </g>
+        <g transform="translate(320, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 20h20v20h20v-20h20v20h20" class="diagram-d"/>
+        </g>
+        <g transform="translate(420, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 40h20v-20h20v20h20v-20h20" class="diagram-d"/>
+        </g>
+      </g>
+    </g>
+  </svg>
+</div>
+
+# --instructions--
+
+Write a function that calculates the number of different ways to cut an *m* × *n* rectangle.
+
+# --hints--
+
+`cutRectangle` should be a function.
+
+```js
+assert(typeof cutRectangle == 'function');
+```
+
+`cutRectangle(2, 2)` should return a number.
+
+```js
+assert(typeof cutRectangle(2, 2) == 'number');
+```
+
+`cutRectangle(2, 2)` should return `2`.
+
+```js
+assert.equal(cutRectangle(2, 2), 2);
+```
+
+`cutRectangle(4, 3)` should return `9`.
+
+```js
+assert.equal(cutRectangle(4, 3), 9);
+```
+
+`cutRectangle(4, 4)` should return `22`.
+
+```js
+assert.equal(cutRectangle(4, 4), 22);
+```
+
+`cutRectangle(8, 3)` should return `53`.
+
+```js
+assert.equal(cutRectangle(8, 3), 53);
+```
+
+`cutRectangle(7, 4)` should return `151`.
+
+```js
+assert.equal(cutRectangle(7, 4), 151);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cutRectangle(w, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function cutRectangle(w, h) {
+  if (w % 2 == 1 && h % 2 == 1) return;
+
+  var dirs = [[0, -1], [-1, 0], [0, 1], [1, 0]];
+
+  var grid = new Array(h);
+  for (var i = 0; i < grid.length; i++) grid[i] = new Array(w);
+  var stack = [];
+
+  var half = Math.floor((w * h) / 2);
+  var bits = Math.pow(2, half) - 1;
+  var result = 0;
+  for (; bits > 0; bits -= 2) {
+    for (var i = 0; i < half; i++) {
+      var r = Math.floor(i / w);
+      var c = i % w;
+      grid[r][c] = (bits & (1 << i)) != 0 ? 1 : 0;
+      grid[h - r - 1][w - c - 1] = 1 - grid[r][c];
+    }
+
+    stack.push(0);
+    grid[0][0] = 2;
+    var count = 1;
+    while (stack.length != 0) {
+      var pos = stack.pop();
+      var r = Math.floor(pos / w);
+      var c = pos % w;
+
+      for (var dir of dirs) {
+        var nextR = r + dir[0];
+        var nextC = c + dir[1];
+
+        if (nextR >= 0 && nextR < h && nextC >= 0 && nextC < w) {
+          if (grid[nextR][nextC] == 1) {
+            stack.push(nextR * w + nextC);
+            grid[nextR][nextC] = 2;
+            count++;
+          }
+        }
+      }
+    }
+
+    if (count == half) {
+      result++;
+    }
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-format.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-format.md
new file mode 100644
index 0000000000..7db6dbebb1
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-format.md
@@ -0,0 +1,90 @@
+---
+id: 59669d08d75b60482359409f
+title: Date format
+challengeType: 5
+forumTopicId: 302243
+dashedName: date-format
+---
+
+# --description--
+
+Return an array with two date strings of the current date with the following specifications:
+
+- The first string's date order should be the year number, month number, and day number separated by dashes (`-`).
+- The first string's year should be four digits in length.
+- The first string's month and day should not contain any leading zeros.
+- The second string's weekday and month names should not be abbreviated.
+- The second string's day should not contain any leading zeros.
+
+Example outputs:
+
+```js
+['2007-11-23', 'Friday, November 23, 2007']
+['2021-3-2', 'Tuesday, March 2, 2021']
+```
+
+# --hints--
+
+`getDateFormats` should be a function.
+
+```js
+assert(typeof getDateFormats === 'function');
+```
+
+`getDateFormats` should return an object.
+
+```js
+assert(typeof getDateFormats() === 'object');
+```
+
+`getDateFormats` should return an array with 2 elements.
+
+```js
+assert(getDateFormats().length === 2);
+```
+
+`getDateFormats` should return the correct date in the right format
+
+```js
+assert.deepEqual(getDateFormats(), dates, equalsMessage);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const getDateSolution = () => {
+  const date = new Date();
+  const weekdays = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
+  const months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
+  const fmt1 = `${date.getFullYear()}-${(1 + date.getMonth())}-${date.getDate()}`;
+  const fmt2 = `${weekdays[date.getDay()]}, ${months[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;
+  return [fmt1, fmt2];
+};
+
+const dates = getDateSolution();
+const equalsMessage = `message: <code>getDataFormats()</code> should return <code>["${dates[0]}", "${dates[1]}"]</code>.`;
+```
+
+## --seed-contents--
+
+```js
+function getDateFormats() {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function getDateFormats() {
+  const date = new Date();
+  const weekdays = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
+  const months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
+  const fmt1 = `${date.getFullYear()}-${(1 + date.getMonth())}-${date.getDate()}`;
+  const fmt2 = `${weekdays[date.getDay()]}, ${months[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;
+  return [fmt1, fmt2];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-manipulation.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-manipulation.md
new file mode 100644
index 0000000000..3412cd12fd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/date-manipulation.md
@@ -0,0 +1,109 @@
+---
+id: 5966c21cf732a95f1b67dd28
+title: Date manipulation
+challengeType: 5
+forumTopicId: 302244
+dashedName: date-manipulation
+---
+
+# --description--
+
+Given a date string in EST, output the given date as a string with 12 hours added to the time. Time zone should be preserved.
+
+Example input: `"March 6 2009 7:30pm EST"`
+
+Example output: `"March 7 2009 7:30am EST"`
+
+# --hints--
+
+`add12Hours` should be a function.
+
+```js
+assert(typeof add12Hours === 'function');
+```
+
+`add12Hours(dateString)` should return a string.
+
+```js
+assert(typeof add12Hours('January 17 2017 11:43am EST') === 'string');
+```
+
+`add12Hours("January 17 2017 11:43am EST")` should return `"January 17 2017 11:43pm EST"`
+
+```js
+assert(
+  add12Hours('January 17 2017 11:43am EST') === 'January 17 2017 11:43pm EST'
+);
+```
+
+Should handle day change. `add12Hours("March 6 2009 7:30pm EST")` should return `"March 7 2009 7:30am EST"`
+
+```js
+assert(add12Hours('March 6 2009 7:30pm EST') === 'March 7 2009 7:30am EST');
+```
+
+Should handle month change in a leap years. `add12Hours("February 29 2004 9:15pm EST")` should return `"March 1 2004 9:15am EST"`
+
+```js
+assert(add12Hours('February 29 2004 9:15pm EST') === 'March 1 2004 9:15am EST');
+```
+
+Should handle month change in a common years. `add12Hours("February 28 1999 3:15pm EST")` should return `"March 1 1999 3:15am EST"`
+
+```js
+assert(add12Hours('February 28 1999 3:15pm EST') === 'March 1 1999 3:15am EST');
+```
+
+Should handle year change. `add12Hours("December 31 2020 1:45pm EST")` should return `"January 1 2021 1:45am EST"`
+
+```js
+assert(
+  add12Hours('December 31 2020 1:45pm EST') === 'January 1 2021 1:45am EST'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function add12Hours(dateString) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function add12Hours(dateString) {
+  const months = ['January', 'February', 'March', 'April', 'May', 'June',
+    'July', 'August', 'September', 'October', 'November', 'December'];
+  // Get the parts of the string
+  const parts = dateString.split(' ');
+  const month = months.indexOf(parts[0]);
+  const day = parseInt(parts[1], 10);
+  const year = parseInt(parts[2], 10);
+  const time = parts[3].split(':');
+  let hours = parseInt(time[0], 10);
+  if (time[1].slice(-2) === 'pm') {
+    hours += 12;
+  }
+  const minutes = parseInt(time[1].slice(0, -2), 10);
+
+  // Create a date with given parts, and updated hours
+  const date = new Date();
+  date.setFullYear(year, month, day);
+  date.setHours(hours + 12);  // Add 12 hours
+  date.setMinutes(minutes);
+
+  let hoursOutput = date.getHours();
+  let abbreviation = 'am';
+  if (hoursOutput > 12) {
+    hoursOutput -= 12;
+    abbreviation = 'pm';
+  }
+
+  return `${months[date.getMonth()]} ${date.getDate()} ${date.getFullYear()} ${hoursOutput}:${date.getMinutes()}${abbreviation} EST`;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/day-of-the-week.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/day-of-the-week.md
new file mode 100644
index 0000000000..0260694251
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/day-of-the-week.md
@@ -0,0 +1,74 @@
+---
+id: 5966f99c45e8976909a85575
+title: Day of the week
+challengeType: 5
+forumTopicId: 302245
+dashedName: day-of-the-week
+---
+
+# --description--
+
+A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January).
+
+# --instructions--
+
+Write a function that takes a start year and an end year and return an array of all the years where the 25th of December will be a Sunday.
+
+# --hints--
+
+`findXmasSunday` should be a function.
+
+```js
+assert(typeof findXmasSunday === 'function');
+```
+
+`findXmasSunday(2000, 2100)` should return an array.
+
+```js
+assert(typeof findXmasSunday(2000, 2100) === 'object');
+```
+
+`findXmasSunday(1970, 2017)` should return `[1977, 1983, 1988, 1994, 2005, 2011, 2016]`
+
+```js
+assert.deepEqual(findXmasSunday(1970, 2017), firstSolution);
+```
+
+`findXmasSunday(2008, 2121)` should return `[2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118]`
+
+```js
+assert.deepEqual(findXmasSunday(2008, 2121), secondSolution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const firstSolution = [1977, 1983, 1988, 1994, 2005, 2011, 2016];
+const secondSolution = [2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118];
+```
+
+## --seed-contents--
+
+```js
+function findXmasSunday(start, end) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function findXmasSunday(start, end) {
+  const xmasSunday = [];
+  for (let year = start; year <= end; year++) {
+    const xmas = new Date(year, 11, 25);
+    if (xmas.getDay() === 0) {
+      xmasSunday.push(year);
+    }
+  }
+  return xmasSunday;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
new file mode 100644
index 0000000000..e74d1883eb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -0,0 +1,210 @@
+---
+id: 59694356a6e7011f7f1c5f4e
+title: Deal cards for FreeCell
+challengeType: 5
+forumTopicId: 302246
+dashedName: deal-cards-for-freecell
+---
+
+# --description--
+
+*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for [DOS](https://rosettacode.org/wiki/DOS "DOS"), then [Windows](https://rosettacode.org/wiki/Windows "Windows"). This version introduced 32000 numbered deals.
+
+As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
+
+The algorithm uses this [linear congruential generator](<https://rosettacode.org/wiki/linear congruential generator> "linear congruential generator") from Microsoft C:
+
+<ul>
+  <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
+  <li>$rand_n = state_n \div 2^{16}$</li>
+  <li>$rand_n$ is in range 0 to 32767.</li>
+</ul>
+
+The algorithm follows:
+
+<ol>
+  <li>Seed the RNG with the number of the deal.
+  </li><li>Create an <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>array</a> of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
+  <li>Until the array is empty:</li>
+  <li>Choose a random card at index ≡ next random number (mod array length).</li>
+    <ul>
+      <li>Swap this random card with the last card of the array.</li>
+      <li>Remove this random card from the array. (Array length goes down by 1.)</li>
+      <li>Deal this random card.</li>
+    </ul>
+  <li>Deal all 52 cards, face up, across 8 columns. The first 8 cards go in 8 columns, the next 8 cards go on the first 8 cards, and so on.</li>
+</ol>
+
+**Example:**
+
+**Order to deal cards**
+
+<pre> 1  2  3  4  5  6  7  8
+ 9 10 11 12 13 14 15 16
+17 18 19 20 21 22 23 24
+25 26 27 28 29 30 31 32
+33 34 35 36 37 38 39 40
+41 42 43 44 45 46 47 48
+49 50 51 52</pre>
+
+**Game #1**
+
+```js
+[
+  ['JD', '2D', '9H', 'JC', '5D', '7H', '7C', '5H'],
+  ['KD', 'KC', '9S', '5S', 'AD', 'QC', 'KH', '3H'],
+  ['2S', 'KS', '9D', 'QD', 'JS', 'AS', 'AH', '3C'],
+  ['4C', '5C', 'TS', 'QH', '4H', 'AC', '4D', '7S'],
+  ['3S', 'TD', '4S', 'TH', '8H', '2C', 'JH', '7D'],
+  ['6D', '8S', '8D', 'QS', '6C', '3D', '8C', 'TC'],
+  ['6S', '9C', '2H', '6H']
+]
+```
+
+**Game #617**
+
+```js
+[
+  ['7D', 'AD', '5C', '3S', '5S', '8C', '2D', 'AH'],
+  ['TD', '7S', 'QD', 'AC', '6D', '8H', 'AS', 'KH'],
+  ['TH', 'QC', '3H', '9D', '6S', '8D', '3D', 'TC'],
+  ['KD', '5H', '9S', '3C', '8S', '7H', '4D', 'JS'],
+  ['4C', 'QS', '9C', '9H', '7C', '6H', '2C', '2S'],
+  ['4S', 'TS', '2H', '5D', 'JC', '6C', 'JH', 'QH'],
+  ['JD', 'KS', 'KC', '4H']
+]
+```
+
+# --instructions--
+
+Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
+
+Deals can also be checked against [FreeCell solutions to 1000000 games](https://freecellgamesolutions.com/). (Summon a video solution, and it displays the initial deal.)
+
+# --hints--
+
+`dealFreeCell` should be a function.
+
+```js
+assert(typeof dealFreeCell === 'function');
+```
+
+`dealFreeCell(seed)` should return an object.
+
+```js
+assert(typeof dealFreeCell(1) === 'object');
+```
+
+`dealFreeCell(seed)` should return an array of length 7.
+
+```js
+assert(dealFreeCell(1).length === 7);
+```
+
+`dealFreeCell(1)` should return an array identical to example "Game #1"
+
+```js
+assert.deepEqual(dealFreeCell(1), game1);
+```
+
+`dealFreeCell(617)` should return an array identical to example "Game #617"
+
+```js
+assert.deepEqual(dealFreeCell(617), game617);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const replaceThis = 3;
+const game1 = [
+  ['JD', '2D', '9H', 'JC', '5D', '7H', '7C', '5H'],
+  ['KD', 'KC', '9S', '5S', 'AD', 'QC', 'KH', '3H'],
+  ['2S', 'KS', '9D', 'QD', 'JS', 'AS', 'AH', '3C'],
+  ['4C', '5C', 'TS', 'QH', '4H', 'AC', '4D', '7S'],
+  ['3S', 'TD', '4S', 'TH', '8H', '2C', 'JH', '7D'],
+  ['6D', '8S', '8D', 'QS', '6C', '3D', '8C', 'TC'],
+  ['6S', '9C', '2H', '6H']
+];
+const game617 = [
+  ['7D', 'AD', '5C', '3S', '5S', '8C', '2D', 'AH'],
+  ['TD', '7S', 'QD', 'AC', '6D', '8H', 'AS', 'KH'],
+  ['TH', 'QC', '3H', '9D', '6S', '8D', '3D', 'TC'],
+  ['KD', '5H', '9S', '3C', '8S', '7H', '4D', 'JS'],
+  ['4C', 'QS', '9C', '9H', '7C', '6H', '2C', '2S'],
+  ['4S', 'TS', '2H', '5D', 'JC', '6C', 'JH', 'QH'],
+  ['JD', 'KS', 'KC', '4H']
+];
+```
+
+## --seed-contents--
+
+```js
+function dealFreeCell(seed) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// RNG
+function FreeCellRNG(seed) {
+  return {
+    lastNum: seed,
+    next() {
+      this.lastNum = ((214013 * this.lastNum) + 2531011) % (Math.pow(2, 31));
+      return this.lastNum >> 16;
+    }
+  };
+}
+// Get cards
+function getDeck() {
+  const ranks = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K'];
+  const suits = ['C', 'D', 'H', 'S'];
+  const cards = [];
+  for (let i = 0; i < ranks.length; i += 1) {
+    for (let j = 0; j < suits.length; j += 1) {
+      cards.push(`${ranks[i]}${suits[j]}`);
+    }
+  }
+  return cards;
+}
+function dealFreeCell(seed) {
+  const rng = FreeCellRNG(seed);
+  const deck = getDeck();
+
+  const deltCards = [[], [], [], [], [], [], []];
+  let currentColumn = 0;
+  let currentRow = 0;
+
+  let rand;
+  let temp;
+  let card;
+  while (deck.length > 0) {
+    // Choose a random card
+    rand = rng.next() % deck.length;
+
+    // Swap this random card with the last card in the array
+    temp = deck[deck.length - 1];
+    deck[deck.length - 1] = deck[rand];
+    deck[rand] = temp;
+
+    // Remove this card from the array
+    card = deck.pop();
+
+    // Deal this card
+    deltCards[currentRow].push(card);
+    currentColumn += 1;
+    if (currentColumn === 8) {
+      currentColumn = 0;
+      currentRow += 1;
+    }
+  }
+
+  return deltCards;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deepcopy.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deepcopy.md
new file mode 100644
index 0000000000..24b950d8d5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/deepcopy.md
@@ -0,0 +1,85 @@
+---
+id: 596a8888ab7c01048de257d5
+title: Deepcopy
+challengeType: 5
+forumTopicId: 302247
+dashedName: deepcopy
+---
+
+# --description--
+
+Write a function that returns a deep copy of a given object. The copy must not be the same object that was given.
+
+This task will not test for:
+
+<ul>
+  <li>Objects with properties that are functions</li>
+  <li>Date objects or object with properties that are Date objects</li>
+  <li>RegEx or object with properties that are RegEx objects</li>
+  <li>Prototype copying</li>
+</ul>
+
+# --hints--
+
+`deepcopy` should be a function.
+
+```js
+assert(typeof deepcopy === 'function');
+```
+
+`deepcopy({test: "test"})` should return an object.
+
+```js
+assert(typeof deepcopy(obj1) === 'object');
+```
+
+`deepcopy` should not return the same object that was provided.
+
+```js
+assert(deepcopy(obj2) != obj2);
+```
+
+When passed an object containing an array, `deepcopy` should return a deep copy of the object.
+
+```js
+assert.deepEqual(deepcopy(obj2), obj2);
+```
+
+When passed an object containing another object, `deepcopy`  should return a deep copy of the object.
+
+```js
+assert.deepEqual(deepcopy(obj3), obj3);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const obj1 = { test: 'test' };
+const obj2 = {
+  t: 'test',
+  a: ['an', 'array']
+};
+const obj3 = {
+  t: 'try',
+  o: obj2
+};
+```
+
+## --seed-contents--
+
+```js
+function deepcopy(obj) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function deepcopy(obj) {
+  return JSON.parse(JSON.stringify(obj));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
new file mode 100644
index 0000000000..2bc3f2dd1b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
@@ -0,0 +1,132 @@
+---
+id: 597089c87eec450c68aa1643
+title: Define a primitive data type
+challengeType: 5
+forumTopicId: 302248
+dashedName: define-a-primitive-data-type
+---
+
+# --description--
+
+Define a type that behaves like an integer but has a lowest valid value of 1 and a highest valid value of 10.
+
+Error handling:
+
+<ul>
+  <li>If you try to instantiate a <code>Num</code> with a value outside of 1 - 10, it should throw a <code>TypeError</code> with an error message of <code>'Out of range'</code>.</li>
+  <li>If you try to instantiate a <code>Num</code> with a value that is not a number, it should throw a <code>TypeError</code> with an error message of <code>'Not a Number'</code>.</li>
+</ul>
+
+# --hints--
+
+`Num` should be a function.
+
+```js
+assert(typeof Num === 'function');
+```
+
+`new Num(4)` should return an object.
+
+```js
+assert(typeof new Num(4) === 'object');
+```
+
+`new Num('test')` should throw a TypeError with message 'Not a Number'.
+
+```js
+assert.throws(() => new Num('test'), TypeError);
+```
+
+`new Num(0)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(0), TypeError);
+```
+
+`new Num(-5)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(-5), TypeError);
+```
+
+`new Num(10)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(11), TypeError);
+```
+
+`new Num(20)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(20), TypeError);
+```
+
+`new Num(3) + new Num(4)` should equal 7.
+
+```js
+assert.equal(new Num(3) + new Num(4), 7);
+```
+
+`new Num(3) - new Num(4)` should equal -1.
+
+```js
+assert.equal(new Num(3) - new Num(4), -1);
+```
+
+`new Num(3) * new Num(4)` should equal 12.
+
+```js
+assert.equal(new Num(3) * new Num(4), 12);
+```
+
+`new Num(3) / new Num(4)` should equal 0.75.
+
+```js
+assert.equal(new Num(3) / new Num(4), 0.75);
+```
+
+`new Num(3) < new Num(4)` should be true.
+
+```js
+assert(new Num(3) < new Num(4));
+```
+
+`new Num(3) > new Num(4)` should be false.
+
+```js
+assert(!(new Num(3) > new Num(4)));
+```
+
+`(new Num(5)).toString()` should return '5'
+
+```js
+assert.equal(new Num(5).toString(), '5');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Num(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function Num(n) {
+  if (isNaN(n)) {
+    throw new TypeError('Not a Number');
+  }
+  if (n < 1 || n > 10) {
+    throw new TypeError('Out of range');
+  }
+
+  this._value = +n;
+}
+Num.prototype.valueOf = function() { return this._value; };
+Num.prototype.toString = function () { return this._value.toString(); };
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/department-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/department-numbers.md
new file mode 100644
index 0000000000..0eba1bec54
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/department-numbers.md
@@ -0,0 +1,126 @@
+---
+id: 59f40b17e79dbf1ab720ed7a
+title: Department Numbers
+challengeType: 5
+forumTopicId: 302249
+dashedName: department-numbers
+---
+
+# --description--
+
+There is a highly organized city that has decided to assign a number to each of their departments:
+
+<ul>
+  <li>Police department</li>
+  <li>Sanitation department</li>
+  <li>Fire department</li>
+</ul>
+
+Each department can have a number between 1 and 7 (inclusive).
+
+The three department numbers are to be unique (different from each other) and must add up to the number 12.
+
+The Chief of the Police doesn't like odd numbers and wants to have an even number for his department.
+
+# --instructions--
+
+Write a program which outputs all valid combinations as an array.
+
+```js
+[2, 3, 7] [2, 4, 6] [2, 6, 4]
+[2, 7, 3] [4, 1, 7] [4, 2, 6]
+[4, 3, 5] [4, 5, 3] [4, 6, 2]
+[4, 7, 1] [6, 1, 5] [6, 2, 4]
+[6, 4, 2] [6, 5, 1]
+```
+
+# --hints--
+
+`combinations` should be a function.
+
+```js
+assert(typeof combinations === 'function');
+```
+
+`combinations([1, 2, 3], 6)` should return an Array.
+
+```js
+assert(Array.isArray(combinations([1, 2, 3], 6)));
+```
+
+`combinations([1, 2, 3, 4, 5, 6, 7], 12)` should return an array of length 14.
+
+```js
+assert(combinations(nums, total).length === len);
+```
+
+`combinations([1, 2, 3, 4, 5, 6, 7], 12)` should return all valid combinations.
+
+```js
+assert.deepEqual(combinations(nums, total), result);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const nums = [1, 2, 3, 4, 5, 6, 7];
+const total = 12;
+const len = 14;
+const result = [
+  [2, 3, 7],
+  [2, 4, 6],
+  [2, 6, 4],
+  [2, 7, 3],
+  [4, 1, 7],
+  [4, 2, 6],
+  [4, 3, 5],
+  [4, 5, 3],
+  [4, 6, 2],
+  [4, 7, 1],
+  [6, 1, 5],
+  [6, 2, 4],
+  [6, 4, 2],
+  [6, 5, 1]
+];
+```
+
+## --seed-contents--
+
+```js
+function combinations(possibleNumbers, total) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function combinations(possibleNumbers, total) {
+  let firstNumber;
+  let secondNumber;
+  let thridNumber;
+  const allCombinations = [];
+
+  for (let i = 0; i < possibleNumbers.length; i += 1) {
+    firstNumber = possibleNumbers[i];
+
+    if (firstNumber % 2 === 0) {
+      for (let j = 0; j < possibleNumbers.length; j += 1) {
+        secondNumber = possibleNumbers[j];
+
+        if (j !== i && firstNumber + secondNumber <= total) {
+          thridNumber = total - firstNumber - secondNumber;
+
+          if (thridNumber !== firstNumber && thridNumber !== secondNumber && possibleNumbers.includes(thridNumber)) {
+            allCombinations.push([firstNumber, secondNumber, thridNumber]);
+          }
+        }
+      }
+    }
+  }
+  return allCombinations;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/discordian-date.md
new file mode 100644
index 0000000000..217c79db1c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -0,0 +1,195 @@
+---
+id: 59f4eafba0343628bb682785
+title: Discordian date
+challengeType: 5
+forumTopicId: 302250
+dashedName: discordian-date
+---
+
+# --description--
+
+Convert a given date from the [Gregorian calendar](<https://en.wikipedia.org/wiki/Gregorian calendar> "wp: Gregorian calendar") to the [Discordian calendar](<https://en.wikipedia.org/wiki/Discordian calendar> "wp: Discordian calendar").
+
+# --hints--
+
+`discordianDate` should be a function.
+
+```js
+assert(typeof discordianDate === 'function');
+```
+
+`discordianDate(new Date(2010, 6, 22))` should return `"Pungenday, the 57th day of Confusion in the YOLD 3176"`.
+
+```js
+assert(
+  discordianDate(new Date(2010, 6, 22)) ===
+    'Pungenday, the 57th day of Confusion in the YOLD 3176'
+);
+```
+
+`discordianDate(new Date(2012, 1, 28))` should return `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 1, 28)) ===
+    'Prickle-Prickle, the 59th day of Chaos in the YOLD 3178'
+);
+```
+
+`discordianDate(new Date(2012, 1, 29))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib\'s Day!"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 1, 29)) ===
+    "Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib's Day!"
+);
+```
+
+`discordianDate(new Date(2012, 2, 1))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 2, 1)) ===
+    'Setting Orange, the 60th day of Chaos in the YOLD 3178'
+);
+```
+
+`discordianDate(new Date(2010, 0, 5))` should return `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!"`.
+
+```js
+assert(
+  discordianDate(new Date(2010, 0, 5)) ===
+    'Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!'
+);
+```
+
+`discordianDate(new Date(2011, 4, 3))` should return `"Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!"`.
+
+```js
+assert(
+  discordianDate(new Date(2011, 4, 3)) ===
+    'Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!'
+);
+```
+
+`discordianDate(new Date(2015, 9, 19))` should return `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"`.
+
+```js
+assert(
+  discordianDate(new Date(2015, 9, 19)) ===
+    'Boomtime, the 73rd day of Bureaucracy in the YOLD 3181'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function discordianDate(date) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+/**
+ * All Hail Discordia! - this script prints Discordian date using system date.
+ *
+ * lang: JavaScript
+ * author: jklu
+ * contributors: JamesMcGuigan
+ *
+ * source: https://rosettacode.org/wiki/Discordian_date#JavaScript
+ */
+const seasons = [
+  'Chaos', 'Discord', 'Confusion',
+  'Bureaucracy', 'The Aftermath'
+];
+const weekday = [
+  'Sweetmorn', 'Boomtime', 'Pungenday',
+  'Prickle-Prickle', 'Setting Orange'
+];
+
+const apostle = [
+  'Mungday', 'Mojoday', 'Syaday',
+  'Zaraday', 'Maladay'
+];
+
+const holiday = [
+  'Chaoflux', 'Discoflux', 'Confuflux',
+  'Bureflux', 'Afflux'
+];
+
+
+Date.prototype.isLeapYear = function() {
+  const year = this.getFullYear();
+  if ((year & 3) !== 0) { return false; }
+  return ((year % 100) !== 0 || (year % 400) === 0);
+};
+
+// Get Day of Year
+Date.prototype.getDOY = function() {
+  const dayCount = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334];
+  const mn = this.getMonth();
+  const dn = this.getDate();
+  let dayOfYear = dayCount[mn] + dn;
+  if (mn > 1 && this.isLeapYear()) { dayOfYear += 1; }
+  return dayOfYear;
+};
+
+Date.prototype.isToday = function() {
+  const today = new Date();
+  return this.getDate() === today.getDate()
+      && this.getMonth() === today.getMonth()
+      && this.getFullYear() === today.getFullYear()
+  ;
+};
+
+function discordianDate(date) {
+  if (!date) { date = new Date(); }
+
+  const y = date.getFullYear();
+  const yold = y + 1166;
+  let dayOfYear = date.getDOY();
+  let celebrateHoliday = null;
+
+  if (date.isLeapYear()) {
+    if (dayOfYear === 60) {
+      celebrateHoliday = 'St. Tib\'s Day';
+    }
+    else if (dayOfYear > 60) {
+      dayOfYear--;
+    }
+  }
+  dayOfYear--;
+
+  const divDay = Math.floor(dayOfYear / 73);
+
+  const seasonDay = (dayOfYear % 73) + 1;
+  if (seasonDay === 5) {
+    celebrateHoliday = apostle[divDay];
+  }
+  if (seasonDay === 50) {
+    celebrateHoliday = holiday[divDay];
+  }
+
+  const season = seasons[divDay];
+  const dayOfWeek = weekday[dayOfYear % 5];
+
+  const nth = (seasonDay % 10 === 1) ? 'st'
+          : (seasonDay % 10 === 2) ? 'nd'
+          : (seasonDay % 10 === 3) ? 'rd'
+                                  : 'th';
+
+  return ''
+         + dayOfWeek
+         + ', the ' + seasonDay + nth
+         + ' day of ' + season
+         + ' in the YOLD ' + yold
+         + (celebrateHoliday ? '. Celebrate ' + celebrateHoliday + '!' : '')
+    ;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/dot-product.md
new file mode 100644
index 0000000000..5584a7e26a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -0,0 +1,75 @@
+---
+id: 5a23c84252665b21eecc7e1e
+title: Dot product
+challengeType: 5
+forumTopicId: 302251
+dashedName: dot-product
+---
+
+# --description--
+
+Create a function, to compute the **[dot product](<https://en.wikipedia.org/wiki/Dot product>)**, also known as the **scalar product** of two vectors.
+
+# --hints--
+
+`dotProduct` should be a function.
+
+```js
+assert(typeof dotProduct == 'function');
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return a number.
+
+```js
+assert(typeof dotProduct([1, 3, -5], [4, -2, -1]) == 'number');
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return `3`.
+
+```js
+assert.equal(dotProduct([1, 3, -5], [4, -2, -1]), 3);
+```
+
+`dotProduct([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])` should return `130`.
+
+```js
+assert.equal(dotProduct([1, 2, 3, 4, 5], [6, 7, 8, 9, 10]), 130);
+```
+
+`dotProduct([5, 4, 3, 2], [7, 8, 9, 6])` should return `106`.
+
+```js
+assert.equal(dotProduct([5, 4, 3, 2], [7, 8, 9, 6]), 106);
+```
+
+`dotProduct([-5, 4, -3, 2], [-7, -8, 9, -6])` should return `-36`.
+
+```js
+assert.equal(dotProduct([-5, 4, -3, 2], [-7, -8, 9, -6]), -36);
+```
+
+`dotProduct([17, 27, 34, 43, 15], [62, 73, 48, 95, 110])` should return `10392`.
+
+```js
+assert.equal(dotProduct([17, 27, 34, 43, 15], [62, 73, 48, 95, 110]), 10392);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function dotProduct(ary1, ary2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function dotProduct(ary1, ary2) {
+  var dotprod = 0;
+  for (var i = 0; i < ary1.length; i++) dotprod += ary1[i] * ary2[i];
+  return dotprod;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/element-wise-operations.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/element-wise-operations.md
new file mode 100644
index 0000000000..52a15c8d11
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/element-wise-operations.md
@@ -0,0 +1,214 @@
+---
+id: 599c333915e0ea32d04d4bec
+title: Element-wise operations
+challengeType: 5
+forumTopicId: 302252
+dashedName: element-wise-operations
+---
+
+# --description--
+
+Implement basic element-wise matrix-matrix and scalar-matrix operations.
+
+**Implement:**
+
+<ul>
+  <li>addition</li>
+  <li>subtraction</li>
+  <li>multiplication</li>
+  <li>division</li>
+  <li>exponentiation</li>
+</ul>
+
+The first parameter will be the operation to be performed, for example, "m_add" for matrix addition and "s_add" for scalar addition. The second and third parameters will be the matrices on which the operations are to be performed.
+
+# --hints--
+
+`operation` should be a function.
+
+```js
+assert(typeof operation === 'function');
+```
+
+`operation("m_add",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[2,4],[6,8]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_add',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [2, 4],
+    [6, 8]
+  ]
+);
+```
+
+`operation("s_add",[[1,2],[3,4]],2)` should return `[[3,4],[5,6]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    's_add',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    2
+  ),
+  [
+    [3, 4],
+    [5, 6]
+  ]
+);
+```
+
+`operation("m_sub",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[0,0],[0,0]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_sub',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [0, 0],
+    [0, 0]
+  ]
+);
+```
+
+`operation("m_mult",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,4],[9,16]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_mult',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 4],
+    [9, 16]
+  ]
+);
+```
+
+`operation("m_div",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,1],[1,1]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_div',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 1],
+    [1, 1]
+  ]
+);
+```
+
+`operation("m_exp",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,4],[27,256]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_exp',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 4],
+    [27, 256]
+  ]
+);
+```
+
+`operation("m_add",[[1,2,3,4],[5,6,7,8]],[[9,10,11,12],[13,14,15,16]])` should return `[[10,12,14,16],[18,20,22,24]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_add',
+    [
+      [1, 2, 3, 4],
+      [5, 6, 7, 8]
+    ],
+    [
+      [9, 10, 11, 12],
+      [13, 14, 15, 16]
+    ]
+  ),
+  [
+    [10, 12, 14, 16],
+    [18, 20, 22, 24]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function operation(op, arr1, arr2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function operation(op, arr1, arr2) {
+  const ops = {
+    add: ((a, b) => a + b),
+    sub: ((a, b) => a - b),
+    mult: ((a, b) => a * b),
+    div: ((a, b) => a / b),
+    exp: ((a, b) => Math.pow(a, b))
+  };
+  const ifm = op.startsWith('m');
+  const doOp = ops[op.substring(2)];
+  for (let i = 0; i < arr1.length; i++) {
+    for (let j = 0; j < arr1[0].length; j++) {
+      arr1[i][j] = doOp(arr1[i][j], (ifm) ? (arr2[i][j]) : (arr2));
+    }
+  }
+  return arr1;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/emirp-primes.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/emirp-primes.md
new file mode 100644
index 0000000000..564476da7a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/emirp-primes.md
@@ -0,0 +1,138 @@
+---
+id: 599d0ba974141b0f508b37d5
+title: Emirp primes
+challengeType: 5
+forumTopicId: 302253
+dashedName: emirp-primes
+---
+
+# --description--
+
+An emirp (**prime** spelled backwards) are primes that when reversed (in their decimal representation) are a different prime.
+
+# --instructions--
+
+Write a function that:
+
+<ul>
+  <li>Shows the first <code>n</code> emirp numbers.</li>
+  <li>Shows the emirp numbers in a range.</li>
+  <li>Shows the number of emirps in a range.</li>
+  <li>Shows the <code>n<sup>th</sup></code> emirp number.</li>
+</ul>
+
+The function should accept two parameters. The first will receive `n` or the range as an array. The second will receive a boolean, that specifies if the function returns the emirps as an array or a single number (the number of primes in the range or the <code>n<sup>th</sup></code> prime). According to the parameters the function should return an array or a number.
+
+# --hints--
+
+`emirps` should be a function.
+
+```js
+assert(typeof emirps === 'function');
+```
+
+`emirps(20,true)` should return `[13,17,31,37,71,73,79,97,107,113,149,157,167,179,199,311,337,347,359,389]`
+
+```js
+assert.deepEqual(emirps(20, true), [
+  13,
+  17,
+  31,
+  37,
+  71,
+  73,
+  79,
+  97,
+  107,
+  113,
+  149,
+  157,
+  167,
+  179,
+  199,
+  311,
+  337,
+  347,
+  359,
+  389
+]);
+```
+
+`emirps(1000)` should return `70529`
+
+```js
+assert.deepEqual(emirps(1000), 70529);
+```
+
+`emirps([7700,8000],true)` should return `[7717,7757,7817,7841,7867,7879,7901,7927,7949,7951,7963]`
+
+```js
+assert.deepEqual(emirps([7700, 8000], true), [
+  7717,
+  7757,
+  7817,
+  7841,
+  7867,
+  7879,
+  7901,
+  7927,
+  7949,
+  7951,
+  7963
+]);
+```
+
+`emirps([7700,8000],false)` should return `11`
+
+```js
+assert.deepEqual(emirps([7700, 8000], false), 11);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function emirps(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function emirps(num, showEmirps)
+{
+  const is_prime = function(n)
+    {
+    if (!(n % 2) || !(n % 3)) return false;
+    let p = 1;
+    while (p * p < n)
+                    { if (n % (p += 4) == 0 || n % (p += 2) == 0)
+                            { return false; } }
+    return true;
+  };
+  const is_emirp = function(n) {
+    const r = parseInt(n.toString().split('').reverse().join(''));
+    return r != n && is_prime(n) && is_prime(r);
+  };
+
+  let i,
+    arr = [];
+  if (typeof num === 'number') {
+    for (i = 0; arr.length < num; i++) if (is_emirp(i)) arr.push(i);
+    // first x emirps
+    if (showEmirps) return arr;
+    // xth emirp
+    return arr.pop();
+  }
+
+  if (Array.isArray(num)) {
+    for (i = num[0]; i <= num[1]; i++) if (is_emirp(i)) arr.push(i);
+    // emirps between x .. y
+    if (showEmirps) return arr;
+    // number of emirps between x .. y
+    return arr.length;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/entropy.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/entropy.md
new file mode 100644
index 0000000000..75d61ccc5d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/entropy.md
@@ -0,0 +1,96 @@
+---
+id: 599d15309e88c813a40baf58
+title: Entropy
+challengeType: 5
+forumTopicId: 302254
+dashedName: entropy
+---
+
+# --description--
+
+Calculate the Shannon entropy H of a given input string.
+
+Given the discreet random variable $X$ that is a string of $N$ "symbols" (total characters) consisting of $n$ different characters (n=2 for binary), the Shannon entropy of X in bits/symbol is:
+
+$H_2(X) = -\\sum\_{i=1}^n \\frac{count_i}{N} \\log_2 \\left(\\frac{count_i}{N}\\right)$
+
+where $count_i$ is the count of character $n_i$.
+
+# --hints--
+
+`entropy` should be a function.
+
+```js
+assert(typeof entropy === 'function');
+```
+
+`entropy("0")` should return `0`
+
+```js
+assert.equal(entropy('0'), 0);
+```
+
+`entropy("01")` should return `1`
+
+```js
+assert.equal(entropy('01'), 1);
+```
+
+`entropy("0123")` should return `2`
+
+```js
+assert.equal(entropy('0123'), 2);
+```
+
+`entropy("01234567")` should return `3`
+
+```js
+assert.equal(entropy('01234567'), 3);
+```
+
+`entropy("0123456789abcdef")` should return `4`
+
+```js
+assert.equal(entropy('0123456789abcdef'), 4);
+```
+
+`entropy("1223334444")` should return `1.8464393446710154`
+
+```js
+assert.equal(entropy('1223334444'), 1.8464393446710154);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function entropy(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function entropy(s) {
+    // Create a dictionary of character frequencies and iterate over it.
+  function process(s, evaluator) {
+    let h = Object.create(null),
+      k;
+    s.split('').forEach(c => {
+      h[c] && h[c]++ || (h[c] = 1); });
+    if (evaluator) for (k in h) evaluator(k, h[k]);
+    return h;
+  }
+    // Measure the entropy of a string in bits per symbol.
+
+  let sum = 0,
+    len = s.length;
+  process(s, (k, f) => {
+    const p = f / len;
+    sum -= p * Math.log(p) / Math.log(2);
+  });
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/equilibrium-index.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/equilibrium-index.md
new file mode 100644
index 0000000000..a7a33f9d37
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/equilibrium-index.md
@@ -0,0 +1,130 @@
+---
+id: 5987fd532b954e0f21b5d3f6
+title: Equilibrium index
+challengeType: 5
+forumTopicId: 302255
+dashedName: equilibrium-index
+---
+
+# --description--
+
+An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices.
+
+For example, in a sequence $A$:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 = -7$</big></li>
+  <li><big>$A_1 =  1$</big></li>
+  <li><big>$A_2 =  5$</big></li>
+  <li><big>$A_3 =  2$</big></li>
+  <li><big>$A_4 = -4$</big></li>
+  <li><big>$A_5 =  3$</big></li>
+  <li><big>$A_6 =  0$</big></li>
+</ul>
+
+`3` is an equilibrium index, because:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 + A_1 + A_2 = A_4 + A_5 + A_6$</big></li>
+</ul>
+
+`6` is also an equilibrium index, because:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 + A_1 + A_2 + A_3 + A_4 + A_5 = 0$</big></li>
+</ul>
+
+(sum of zero elements is zero)
+
+`7` is not an equilibrium index, because it is not a valid index of sequence $A$.
+
+# --instructions--
+
+Write a function that, given a sequence, returns its equilibrium indices (if any).
+
+Assume that the sequence may be very long.
+
+# --hints--
+
+`equilibrium` should be a function.
+
+```js
+assert(typeof equilibrium === 'function');
+```
+
+`equilibrium([-7, 1, 5, 2, -4, 3, 0])` should return `[3,6]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[0]), ans[0]);
+```
+
+`equilibrium([2, 4, 6])` should return `[]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[1]), ans[1]);
+```
+
+`equilibrium([2, 9, 2])` should return `[1]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[2]), ans[2]);
+```
+
+`equilibrium([1, -1, 1, -1, 1, -1, 1])` should return `[0,1,2,3,4,5,6]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[3]), ans[3]);
+```
+
+`equilibrium([1])` should return `[0]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[4]), ans[4]);
+```
+
+`equilibrium([])` should return `[]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[5]), ans[5]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const equilibriumTests =
+  [[-7, 1, 5, 2, -4, 3, 0], // 3, 6
+  [2, 4, 6], // empty
+  [2, 9, 2], // 1
+  [1, -1, 1, -1, 1, -1, 1], // 0,1,2,3,4,5,6
+  [1], // 0
+  [] // empty
+  ];
+const ans = [[3, 6], [], [1], [0, 1, 2, 3, 4, 5, 6], [0], []];
+```
+
+## --seed-contents--
+
+```js
+function equilibrium(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function equilibrium(a) {
+  let N = a.length,
+    i,
+    l = [],
+    r = [],
+    e = [];
+  for (l[0] = a[0], r[N - 1] = a[N - 1], i = 1; i < N; i++)
+    { l[i] = l[i - 1] + a[i], r[N - i - 1] = r[N - i] + a[N - i - 1]; }
+  for (i = 0; i < N; i++)
+    { if (l[i] === r[i]) e.push(i); }
+  return e;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
new file mode 100644
index 0000000000..a6d1c4cb34
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
@@ -0,0 +1,156 @@
+---
+id: 599d1566a02b571412643b84
+title: Ethiopian multiplication
+challengeType: 5
+forumTopicId: 302257
+dashedName: ethiopian-multiplication
+---
+
+# --description--
+
+Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving.
+
+**Method:**
+
+<ol>
+  <li>Take two numbers to be multiplied and write them down at the top of two columns</li>
+  <li>In the left-hand column repeatedly halve the last number, discarding any remainders, and write the result below the last in the same column, until you write a value of <code>1</code></li>
+  <li>In the right-hand column repeatedly double the last number and write the result below. stop when you add a result in the same row as where the left hand column shows <code>1</code></li>
+  <li>Examine the table produced and discard any row where the value in the left column is even</li>
+  <li>Sum the values in the right-hand column that remain to produce the result of multiplying the original two numbers together</li>
+</ol>
+
+**For example:** `17 × 34`
+
+<pre>17   34
+</pre>
+
+Halving the first column:
+
+<pre>17   34
+8
+4
+2
+1
+</pre>
+
+Doubling the second column:
+
+<pre>17   34
+8    68
+4   136
+2   272
+1   544
+</pre>
+
+Strike-out rows whose first cell is even:
+
+<pre>17   34
+8    <strike>68</strike>
+4   <strike>136</strike>
+2   <strike>272</strike>
+1   544
+</pre>
+
+Sum the remaining numbers in the right-hand column:
+
+<!-- markdownlint-disable MD003 -->
+
+<pre>17   34
+8    --
+4   ---
+2   ---
+1   544
+   ====
+    578
+</pre>
+
+<!-- markdownlint-enable MD003 -->
+
+So `17` multiplied by `34`, by the Ethiopian method is `578`.
+
+# --instructions--
+
+The task is to define three named functions/methods/procedures/subroutines:
+
+<ol>
+  <li>one to halve an integer,</li>
+  <li>one to double an integer, and</li>
+  <li>one to state if an integer is even</li>
+</ol>
+
+Use these functions to create a function that does Ethiopian multiplication.
+
+<!-- markdownlint-disable MD046-->
+
+# --hints--
+
+`eth_mult` should be a function.
+
+```js
+assert(typeof eth_mult === 'function');
+```
+
+`eth_mult(17,34)` should return `578`.
+
+```js
+assert.equal(eth_mult(17, 34), 578);
+```
+
+`eth_mult(23,46)` should return `1058`.
+
+```js
+assert.equal(eth_mult(23, 46), 1058);
+```
+
+`eth_mult(12,27)` should return `324`.
+
+```js
+assert.equal(eth_mult(12, 27), 324);
+```
+
+`eth_mult(56,98)` should return `5488`.
+
+```js
+assert.equal(eth_mult(56, 98), 5488);
+```
+
+`eth_mult(63,74)` should return `4662`.
+
+```js
+assert.equal(eth_mult(63, 74), 4662);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function eth_mult(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function eth_mult(a, b) {
+  let sum = 0; a = [a]; b = [b];
+
+  let half = a => a / 2,
+    double = a => a * 2,
+    is_even = a => a % 2 == 0;
+
+  while (a[0] !== 1) {
+    a.unshift(Math.floor(half(a[0])));
+    b.unshift(double(b[0]));
+  }
+
+  for (let i = a.length - 1; i > 0; i -= 1) {
+    if (!is_even(a[i])) {
+      sum += b[i];
+    }
+  }
+  return sum + b[0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/euler-method.md
new file mode 100644
index 0000000000..86f2d9c75e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -0,0 +1,152 @@
+---
+id: 59880443fb36441083c6c20e
+title: Euler method
+challengeType: 5
+forumTopicId: 302258
+dashedName: euler-method
+---
+
+# --description--
+
+Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in [the wikipedia page](<https://en.wikipedia.org/wiki/Euler method> "wp: Euler method").
+
+The ODE has to be provided in the following form:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dy(t)}{dt} = f(t,y(t))$</big></li>
+</ul>
+
+with an initial value
+
+<ul style='list-style: none;'>
+  <li><big>$y(t_0) = y_0$</big></li>
+</ul>
+
+To get a numeric solution, we replace the derivative on the LHS with a finite difference approximation:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dy(t)}{dt}  \approx \frac{y(t+h)-y(t)}{h}$</big></li>
+</ul>
+
+then solve for $y(t+h)$:
+
+<ul style='list-style: none;'>
+  <li><big>$y(t+h) \approx y(t) + h \, \frac{dy(t)}{dt}$</big></li>
+</ul>
+
+which is the same as
+
+<ul style='list-style: none;'>
+  <li><big>$y(t+h) \approx y(t) + h \, f(t,y(t))$</big></li>
+</ul>
+
+The iterative solution rule is then:
+
+<ul style='list-style: none;'>
+  <li><big>$y_{n+1} = y_n + h \, f(t_n, y_n)$</big></li>
+</ul>
+
+where $h$ is the step size, the most relevant parameter for accuracy of the solution. A smaller step size increases accuracy but also the computation cost, so it has always has to be hand-picked according to the problem at hand.
+
+**Example: Newton's Cooling Law**
+
+Newton's cooling law describes how an object of initial temperature $T(t_0) = T_0$ cools down in an environment of temperature $T_R$:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dT(t)}{dt} = -k \, \Delta T$</big></li>
+</ul>
+
+or
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dT(t)}{dt} = -k \, (T(t) - T_R)$</big></li>
+</ul>
+
+It says that the cooling rate $\\frac{dT(t)}{dt}$ of the object is proportional to the current temperature difference $\\Delta T = (T(t) - T_R)$ to the surrounding environment.
+
+The analytical solution, which we will compare to the numerical approximation, is
+
+<ul style='list-style: none;'>
+  <li><big>$T(t) = T_R + (T_0 - T_R) \; e^{-k t}$</big></li>
+</ul>
+
+# --instructions--
+
+Implement a routine of Euler's method and then use it to solve the given example of Newton's cooling law for three different step sizes of:
+
+<ul>
+  <li><code>2 s</code></li>
+  <li><code>5 s</code> and</li>
+  <li><code>10 s</code></li>
+</ul>
+
+and compare with the analytical solution.
+
+**Initial values:**
+
+<ul>
+  <li>initial temperature <big>$T_0$</big> shall be <code>100 °C</code></li>
+  <li>room temperature <big>$T_R$</big> shall be <code>20 °C</code></li>
+  <li>cooling constant <big>$k$</big> shall be <code>0.07</code></li>
+  <li>time interval to calculate shall be from <code>0 s</code> to <code>100 s</code></li>
+</ul>  
+
+First parameter to the function is initial time, second parameter is initial temperature, third parameter is elapsed time and fourth parameter is step size.
+
+# --hints--
+
+`eulersMethod` should be a function.
+
+```js
+assert(typeof eulersMethod === 'function');
+```
+
+`eulersMethod(0, 100, 100, 2)` should return a number.
+
+```js
+assert(typeof eulersMethod(0, 100, 100, 2) === 'number');
+```
+
+`eulersMethod(0, 100, 100, 2)` should return 20.0424631833732.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 2), 20.0424631833732);
+```
+
+`eulersMethod(0, 100, 100, 5)` should return 20.01449963666907.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 5), 20.01449963666907);
+```
+
+`eulersMethod(0, 100, 100, 10)` should return 20.000472392.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 10), 20.000472392);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function eulersMethod(x1, y1, x2, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function eulersMethod(x1, y1, x2, h) {
+  let x = x1;
+  let y = y1;
+
+  while ((x < x2 && x1 < x2) || (x > x2 && x1 > x2)) {
+    y += h * (-0.07 * (y - 20));
+    x += h;
+  }
+
+  return y;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
new file mode 100644
index 0000000000..5b48751996
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
@@ -0,0 +1,74 @@
+---
+id: 598de241872ef8353c58a7a2
+title: Evaluate binomial coefficients
+challengeType: 5
+forumTopicId: 302259
+dashedName: evaluate-binomial-coefficients
+---
+
+# --description--
+
+Write a function to calculate the binomial coefficient for the given value of n and k.
+
+This formula is recommended:
+
+$\\binom{n}{k} = \\frac{n!}{(n-k)!k!} = \\frac{n(n-1)(n-2)\\ldots(n-k+1)}{k(k-1)(k-2)\\ldots 1}$
+
+# --hints--
+
+`binom` should be a function.
+
+```js
+assert(typeof binom === 'function');
+```
+
+`binom(5,3)` should return 10.
+
+```js
+assert.equal(binom(5, 3), 10);
+```
+
+`binom(7,2)` should return 21.
+
+```js
+assert.equal(binom(7, 2), 21);
+```
+
+`binom(10,4)` should return 210.
+
+```js
+assert.equal(binom(10, 4), 210);
+```
+
+`binom(6,1)` should return 6.
+
+```js
+assert.equal(binom(6, 1), 6);
+```
+
+`binom(12,8)` should return 495.
+
+```js
+assert.equal(binom(12, 8), 495);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function binom(n, k) {
+
+}
+```
+
+# --solutions--
+
+```js
+function binom(n, k) {
+  let coeff = 1;
+  for (let i = n - k + 1; i <= n; i++) coeff *= i;
+  for (let i = 1; i <= k; i++) coeff /= i;
+  return coeff;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
new file mode 100644
index 0000000000..5dffbaf6cb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -0,0 +1,246 @@
+---
+id: 59e09e6d412c5939baa02d16
+title: Execute a Markov algorithm
+challengeType: 5
+forumTopicId: 302260
+dashedName: execute-a-markov-algorithm
+---
+
+# --description--
+
+Create an interpreter for a [Markov Algorithm](<https://en.wikipedia.org/wiki/Markov algorithm> "wp: Markov algorithm").
+
+Rules have the syntax:
+
+<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
+[comment] ::= # {[any character]}
+[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
+[whitespace] ::= ([tab] | [space]) [[whitespace]]
+</pre>
+
+There is one rule per line.
+
+If there is a `.` (period) present before the \[replacement], then this is a terminating rule in which case the interpreter must halt execution.
+
+A ruleset consists of a sequence of rules, with optional comments.
+
+Rulesets
+
+Use the following tests on entries:
+
+**Ruleset 1:**
+
+<pre># This rules file is extracted from Wikipedia:
+# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
+A -> apple
+B -> bag
+S -> shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As from T S.` should generate the output `I bought a bag of apples from my brother.`
+
+**Ruleset 2:**
+
+A test of the terminating rule
+
+<pre># Slightly modified from the rules on Wikipedia
+A -> apple
+B -> bag
+S -> .shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As from T S.` should generate `I bought a bag of apples from T shop.`
+
+**Ruleset 3:**
+
+This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
+
+<pre># BNF Syntax testing rules
+A -> apple
+WWWW -> with
+Bgage -> ->.*
+B -> bag
+->.* -> money
+W -> WW
+S -> .shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As W my Bgage from T S.` should generate `I bought a bag of apples with my money from T shop.`
+
+**Ruleset 4:**
+
+This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.)
+
+<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
+### By Donal Fellows.
+# Unary addition engine
+_+1 -> _1+
+1+1 -> 11+
+# Pass for converting from the splitting of multiplication into ordinary
+# addition
+1! -> !1
+,! -> !+
+_! -> _
+# Unary multiplication by duplicating left side, right side times
+1*1 -> x,@y
+1x -> xX
+X, -> 1,1
+X1 -> 1X
+_x -> _X
+,x -> ,X
+y1 -> 1y
+y_ -> _
+# Next phase of applying
+1@1 -> x,@y
+1@_ -> @_
+,@_ -> !_
+++ -> +
+# Termination cleanup for addition
+_1 -> 1
+1+_ -> 1
+_+_ ->
+</pre>
+
+Sample text of `_1111*11111_` should generate the output `11111111111111111111`
+
+**Ruleset 5:**
+
+A simple [Turing machine](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), implementing a three-state [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
+
+The tape consists of `0`s and `1`s, the states are `A`, `B`, `C` and `H` (for `H`alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
+
+Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
+
+<pre># Turing machine: three-state busy beaver
+#
+# state A, symbol 0 => write 1, move right, new state B
+A0 -> 1B
+# state A, symbol 1 => write 1, move left, new state C
+0A1 -> C01
+1A1 -> C11
+# state B, symbol 0 => write 1, move left, new state A
+0B0 -> A01
+1B0 -> A11
+# state B, symbol 1 => write 1, move right, new state B
+B1 -> 1B
+# state C, symbol 0 => write 1, move left, new state B
+0C0 -> B01
+1C0 -> B11
+# state C, symbol 1 => write 1, move left, halt
+0C1 -> H01
+1C1 -> H11
+</pre>
+
+This ruleset should turn `000000A000000` into `00011H1111000`
+
+# --hints--
+
+`markov` should be a function.
+
+```js
+assert(typeof markov === 'function');
+```
+
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from my brother.".
+
+```js
+assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+```
+
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from T shop.".
+
+```js
+assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+```
+
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return "I bought a bag of apples with my money from T shop.".
+
+```js
+assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+```
+
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return "11111111111111111111".
+
+```js
+assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+```
+
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return "00011H1111000".
+
+```js
+assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+
+let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
+            ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
+let tests=["I bought a B of As from T S.",
+            "I bought a B of As from T S.",
+            "I bought a B of As W my Bgage from T S.",
+            "_1111*11111_",
+            "000000A000000"];
+let outputs=["I bought a bag of apples from my brother.",
+            "I bought a bag of apples from T shop.",
+            "I bought a bag of apples with my money from T shop.",
+            "11111111111111111111",
+            "00011H1111000"]
+
+```
+
+
+## --seed-contents--
+
+```js
+function markov(rules,test) {
+
+}
+```
+
+# --solutions--
+
+```js
+function markov(rules,test) {
+    let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
+    let origTest = test;
+
+    let captures = [];
+
+    rules.forEach(function(rule){
+        let m = pattern.exec(rule);
+        for (let j = 0; j < m.length; j++)
+            m[j] = m[j + 1];
+        captures.push(m);
+    });
+
+    test = origTest;
+    let copy = test;
+    for (let j = 0; j < captures.length; j++) {
+        let c = captures[j];
+        test = test.replace(c[0], c[2]);
+        if (c[1]==".")
+            break;
+        if (test!=copy) {
+            j = -1;
+            copy = test;
+        }
+    }
+    return test;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-brain.md
new file mode 100644
index 0000000000..a1dc29757d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -0,0 +1,202 @@
+---
+id: 59e0a8df964e4540d5abe599
+title: Execute Brain****
+challengeType: 5
+forumTopicId: 302261
+dashedName: execute-brain
+---
+
+# --description--
+
+Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
+
+RCBF is a set of [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") compilers and interpreters written for Rosetta Code in a variety of languages.
+
+Below are links to each of the versions of RCBF.
+
+An implementation need only properly implement the following instructions:
+
+| Command           | Description                                                                        |
+| ----------------- | ---------------------------------------------------------------------------------- |
+| <code>></code>    | Move the pointer to the right                                                      |
+| <code>&lt;</code> | Move the pointer to the left                                                       |
+| <code>+</code>    | Increment the memory cell under the pointer                                        |
+| <code>-</code>    | Decrement the memory cell under the pointer                                        |
+| <code>.</code>    | Output the character signified by the cell at the pointer                          |
+| <code>,</code>    | Input a character and store it in the cell at the pointer                          |
+| <code>\[</code>   | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
+| <code>]</code>    | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
+
+Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
+
+# --hints--
+
+`brain(bye)` should return a string
+
+```js
+assert(typeof brain(bye) === 'string');
+```
+
+`brain("++++++[>++++++++++<-]>+++++.")` should return "A"
+
+```js
+assert.equal(brain('++++++[>++++++++++<-]>+++++.'), 'A');
+```
+
+`brain(bye)` should return `Goodbye, World!\r\n`
+
+```js
+assert.equal(brain(bye), 'Goodbye, World!\r\n');
+```
+
+`brain(hello)` should return `Hello World!\n`
+
+```js
+assert.equal(brain(hello), 'Hello World!\n');
+```
+
+`brain(fib)` should return `1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89`
+
+```js
+assert.equal(brain(fib), '1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+let fib=`+
+
+++
+
++++
+
+++++
+
++>+>>
+
+>>++++
+
++++++++
+
+++++++++
+
++++++++++
+
+++++++++++
+
+++++++>++++
+
+++++++++++++
+
++++++++++++++
+
++++<<<<<<[>[>>
+
+>>>>+>+<<<<<<<-
+
+]>>>>>>>[<<<<<<<
+
++>>>>>>>-]<[>++++
+
+++++++[-<-[>>+>+<<
+
+<-]>>>[<<<+>>>-]+<[
+
+>[-]<[-]]>[<<[>>>+<<
+
+<-]>>[-]]<<]>>>[>>+>+
+
+<<<-]>>>[<<<+>>>-]+<[>
+
+[-]<[-]]>[<<+>>[-]]<<<<
+
+<<<]>>>>>[++++++++++++++
+
++++++++++++++++++++++++++
+
++++++++++.[-]]++++++++++<[
+
+->-<]>+++++++++++++++++++++
+
++++++++++++++++++++++++++++.
+
+[-]<<<<<<<<<<<<[>>>+>+<<<<-]>
+
+>>>[<<<<+>>>>-]<-[>>.>.<<<[-]]
+
+<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+
+
+>-]>[<+>-]<<<-]`;
+let hello='++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.'
+let bye='++++++++++[>+>+++>++++>+++++++>++++++++>+++++++++>++++++++++>+++++++++++>++++++++++++<<<<<<<<<-]>>>>+.>>>>+..<.<++++++++.>>>+.<<+.<<<<++++.<++.>>>+++++++.>>>.+++.<+++++++.--------.<<<<<+.<+++.---.';
+```
+
+## --seed-contents--
+
+```js
+function brain(prog) {
+
+}
+```
+
+# --solutions--
+
+```js
+function brain(prog){
+  var output="";
+    var code; // formatted code
+  var ip = 0; // current instruction within code
+  var nest = 0; // current bracket nesting (for Out button)
+  var ahead = []; // locations of matching brackets
+
+  var data = [0]; // data array (mod by +, -)
+  var dp = 0; // index into data (mod by <, >)
+
+  var inp = 0; // current input character (fetch with ,)
+  var quit = 0;
+    var commands = {
+    '>':function() { if (++dp >= data.length) data[dp]=0 },
+    '<':function() { if (--dp < 0) quit++ },
+    '+':function() { ++data[dp] },
+    '-':function() { --data[dp] },
+    '[':function() { if (!data[dp]) ip = ahead[ip]; else ++nest },
+    ']':function() { if ( data[dp]) ip = ahead[ip]; else --nest },
+    ',':function() {
+        var c = document.getElementById("input").value.charCodeAt(inp++);
+        data[dp] = isNaN(c) ? 0 : c; // EOF: other options are -1 or no change
+    },
+    '.':function() {
+            output+=String.fromCharCode(data[dp]);
+            /*var s = document.getElementById("output").innerHTML)
+             + String.fromCharCode(data[dp]);
+            s = s.replace(/\n/g,"<br>").replace(/ /g,"&amp;nbsp;");
+            document.getElementById("output").innerHTML = s;*/
+        },
+    };
+
+    let ar=prog.split('');
+    var st = [], back, error = -1;
+    for (ip=0; ip<ar.length; ip++) {
+        switch(ar[ip]) {
+        case '[':
+            st.push(ip);
+            break;
+        case ']':
+            if (st.length == 0) error = ip;
+            back = st.pop();
+            ahead[ip] = back;
+            ahead[back] = ip;
+            break;
+        }
+    }
+
+    for(ip=0;ip<ar.length;ip++){
+    if(commands.hasOwnProperty(ar[ip]))
+          commands[ar[ip]]();
+    }
+
+    return output;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
new file mode 100644
index 0000000000..620da453ff
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
@@ -0,0 +1,139 @@
+---
+id: 598ee8b91b410510ae82efef
+title: Extensible prime generator
+challengeType: 5
+forumTopicId: 302262
+dashedName: extensible-prime-generator
+---
+
+# --description--
+
+Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime.
+
+The generator should be able to:
+
+<ul>
+  <li>Show the first <code>n</code> prime numbers</li>
+  <li>Show the prime numbers in a range</li>
+  <li>Show the number of primes in a range</li>
+  <li>Show the <code>n<sup>th</sup></code> prime number</li>
+</ul>
+
+The function should have two parameters. The first will receive `n` or the range as an array. The second will receive a boolean, that specifies if the function returns the prime numbers as an array or a single number(the number of primes in the range or the <code>n<sup>th</sup></code> prime). According to the parameters the function should return an array.
+
+# --hints--
+
+`primeGenerator` should be a function.
+
+```js
+assert(typeof primeGenerator === 'function');
+```
+
+`primeGenerator(20, true)` should return `[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71]`.
+
+```js
+assert.deepEqual(primeGenerator(20, true), [
+  2,
+  3,
+  5,
+  7,
+  11,
+  13,
+  17,
+  19,
+  23,
+  29,
+  31,
+  37,
+  41,
+  43,
+  47,
+  53,
+  59,
+  61,
+  67,
+  71
+]);
+```
+
+`primeGenerator([100, 150], true)` should return `[101, 103, 107, 109, 113, 127, 131, 137, 139, 149]`.
+
+```js
+assert.deepEqual(primeGenerator([100, 150], true), [
+  101,
+  103,
+  107,
+  109,
+  113,
+  127,
+  131,
+  137,
+  139,
+  149
+]);
+```
+
+`primeGenerator([7700, 8000], false)` should return `30`.
+
+```js
+assert.equal(primeGenerator([7700, 8000], false), 30);
+```
+
+`primeGenerator(10000, false)` should return `104729`.
+
+```js
+assert.equal(primeGenerator(10000, false), 104729);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeGenerator(num, showPrimes) {
+
+}
+```
+
+# --solutions--
+
+```js
+function primeGenerator(num, showPrimes) {
+  let i,
+    arr = [];
+
+  function isPrime(num) {
+    // try primes <= 16
+    if (num <= 16) { return (
+      num == 2 || num == 3 || num == 5 || num == 7 || num == 11 || num == 13
+    ); }
+    // cull multiples of 2, 3, 5 or 7
+    if (num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num % 7 == 0)
+      { return false; }
+    // cull square numbers ending in 1, 3, 7 or 9
+    for (let i = 10; i * i <= num; i += 10) {
+      if (num % (i + 1) == 0) return false;
+      if (num % (i + 3) == 0) return false;
+      if (num % (i + 7) == 0) return false;
+      if (num % (i + 9) == 0) return false;
+    }
+    return true;
+  }
+
+  if (typeof num === 'number') {
+    for (i = 0; arr.length < num; i++) if (isPrime(i)) arr.push(i);
+    // first x primes
+    if (showPrimes) return arr;
+    // xth prime
+    return arr.pop();
+  }
+
+  if (Array.isArray(num)) {
+    for (i = num[0]; i <= num[1]; i++) if (isPrime(i)) arr.push(i);
+    // primes between x .. y
+    if (showPrimes) return arr;
+    // number of primes between x .. y
+    return arr.length;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factorial.md
new file mode 100644
index 0000000000..f58bdffe25
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factorial.md
@@ -0,0 +1,80 @@
+---
+id: 597b2b2a2702b44414742771
+title: Factorial
+challengeType: 5
+forumTopicId: 302263
+dashedName: factorial
+---
+
+# --description--
+
+Write a function to return the factorial of a number.
+
+Factorial of a number is given by:
+
+<pre><big>n! = n * (n-1) * (n-2) * ..... * 1</big>
+</pre>
+
+For example:
+
+<ul>
+  <li><code>3! = 3 * 2 * 1 = 6</code></li>
+  <li><code>4! = 4 * 3 * 2 * 1 = 24</code></li>
+</ul>
+
+**Note:** `0! = 1`
+
+# --hints--
+
+`factorial` should be a function.
+
+```js
+assert(typeof factorial === 'function');
+```
+
+`factorial(2)` should return a number.
+
+```js
+assert(typeof factorial(2) === 'number');
+```
+
+`factorial(3)` should return 6.
+
+```js
+assert.equal(factorial(3), 6);
+```
+
+`factorial(5)` should return 120.
+
+```js
+assert.equal(factorial(5), 120);
+```
+
+`factorial(10)` should return 3,628,800.
+
+```js
+assert.equal(factorial(10), 3628800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function factorial(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function factorial(n) {
+  let sum = 1;
+  while (n > 1) {
+    sum *= n;
+    n--;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
new file mode 100644
index 0000000000..273062a0cf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -0,0 +1,148 @@
+---
+id: 598eea87e5cf4b116c3ff81a
+title: Factors of a Mersenne number
+challengeType: 5
+forumTopicId: 302264
+dashedName: factors-of-a-mersenne-number
+---
+
+# --description--
+
+A Mersenne number is a number in the form of <code>2<sup>P</sup>-1</code>.
+
+If `P` is prime, the Mersenne number may be a Mersenne prime. (If `P` is not prime, the Mersenne number is also not prime.)
+
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, [Lucas-Lehmer test](<https://rosettacode.org/wiki/Lucas-Lehmer test> "Lucas-Lehmer test").
+
+There are very efficient algorithms for determining if a number divides <code>2<sup>P</sup>-1</code> (or equivalently, if <code>2<sup>P</sup> mod (the number) = 1</code>).
+
+Some languages already have built-in implementations of this exponent-and-mod operation (called modPow or similar).
+
+The following is how to implement this modPow yourself:
+
+For example, let's compute <code>2<sup>23</sup> mod 47</code>.
+
+Convert the exponent 23 to binary, you get 10111. Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
+
+Remove the top bit of the exponent, and if it's 1 multiply `square` by the base of the exponentiation (2), then compute <code><tt>square</tt> modulo 47</code>.
+
+Use the result of the modulo from the last step as the initial value of `square` in the next step:
+
+<pre>Remove   Optional
+square        top bit  multiply by 2  mod 47
+------------  -------  -------------  ------
+1*1 = 1       1  0111  1*2 = 2           2
+2*2 = 4       0   111     no             4
+4*4 = 16      1    11  16*2 = 32        32
+32*32 = 1024  1     1  1024*2 = 2048    27
+27*27 = 729   1        729*2 = 1458      1
+</pre>
+
+Since <code>2<sup>23</sup> mod 47 = 1</code>, 47 is a factor of <code>2<sup>P</sup>-1</code>.
+
+(To see this, subtract 1 from both sides: <code>2<sup>23</sup>-1 = 0 mod 47</code>.)
+
+Since we've shown that 47 is a factor, <code>2<sup>23</sup>-1</code> is not prime.
+
+Further properties of Mersenne numbers allow us to refine the process even more.
+
+Any factor `q` of <code>2<sup>P</sup>-1</code> must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`.
+
+Finally any potential factor `q` must be [prime](<https://rosettacode.org/wiki/Primality by Trial Division> "Primality by Trial Division").
+
+As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, <code>M<sub>4</sub>=15</code> yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`.
+
+# --instructions--
+
+Using the above method find a factor of <code>2<sup>p</sup>-1</code>.
+
+# --hints--
+
+`check_mersenne` should be a function.
+
+```js
+assert(typeof check_mersenne === 'function');
+```
+
+`check_mersenne(3)` should return a string.
+
+```js
+assert(typeof check_mersenne(3) == 'string');
+```
+
+`check_mersenne(3)` should return the string `M3 = 2^3-1 is prime`.
+
+```js
+assert.equal(check_mersenne(3), 'M3 = 2^3-1 is prime');
+```
+
+`check_mersenne(23)` should return the string `M23 = 2^23-1 is composite with factor 47`.
+
+```js
+assert.equal(check_mersenne(23), 'M23 = 2^23-1 is composite with factor 47');
+```
+
+`check_mersenne(929)` should return the string `M929 = 2^929-1 is composite with factor 13007`.
+
+```js
+assert.equal(
+  check_mersenne(929),
+  'M929 = 2^929-1 is composite with factor 13007'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function check_mersenne(p) {
+
+}
+```
+
+# --solutions--
+
+```js
+function check_mersenne(p){
+    function isPrime(value){
+      for (let i=2; i < value; i++){
+        if (value % i == 0){
+          return false;
+        }
+        if (value % i != 0){
+          return true;
+         }
+      }
+    }
+
+    function trial_factor(base, exp, mod){
+      let square, bits;
+      square = 1;
+      bits = exp.toString(2).split('');
+      for (let i=0,ln=bits.length; i<ln; i++){
+        square = Math.pow(square, 2) * (bits[i] == 1 ? base : 1) % mod;
+      }
+      return (square == 1);
+    }
+
+    function mersenne_factor(p){
+      let limit, k, q;
+      limit = Math.sqrt(Math.pow(2,p) - 1);
+      k = 1;
+      while ((2*k*p - 1) < limit){
+        q = 2*k*p + 1;
+        if (isPrime(q) && (q % 8 == 1 || q % 8 == 7) && trial_factor(2,p,q)){
+          return q; // q is a factor of 2**p-1
+        }
+        k++;
+      }
+      return null;
+    }
+  let f, result;
+  result="M"+p+" = 2^"+p+"-1 is ";
+  f = mersenne_factor(p);
+  result+=f == null ? "prime" : "composite with factor "+f;
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
new file mode 100644
index 0000000000..31d9b722b7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
@@ -0,0 +1,74 @@
+---
+id: 597f1e7fbc206f0e9ba95dc4
+title: Factors of an integer
+challengeType: 5
+forumTopicId: 302265
+dashedName: factors-of-an-integer
+---
+
+# --description--
+
+Write a function that returns the factors of a positive integer as an array.
+
+These factors are the positive integers by which the number being factored can be divided to yield a positive integer result.
+
+# --hints--
+
+`factors` should be a function.
+
+```js
+assert(typeof factors === 'function');
+```
+
+`factors(45)` should return `[1,3,5,9,15,45]`.
+
+```js
+assert.deepEqual(factors(45), ans[0]);
+```
+
+`factors(53)` should return `[1,53]`.
+
+```js
+assert.deepEqual(factors(53), ans[1]);
+```
+
+`factors(64)` should return `[1,2,4,8,16,32,64]`.
+
+```js
+assert.deepEqual(factors(64), ans[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ans=[[1,3,5,9,15,45],[1,53],[1,2,4,8,16,32,64]];
+```
+
+## --seed-contents--
+
+```js
+function factors(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function factors(num)
+{
+ let n_factors = [], i, sqr=Math.floor(Math.sqrt(num));
+
+ for (i = 1; i <=sqr ; i += 1)
+  if (num % i === 0)
+  {
+   n_factors.push(i);
+   if (num / i !== i)
+    n_factors.push(num / i);
+  }
+ n_factors.sort(function(a, b){return a - b;});
+ return n_factors;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/farey-sequence.md
new file mode 100644
index 0000000000..8e508d134c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -0,0 +1,109 @@
+---
+id: 59c3ec9f15068017c96eb8a3
+title: Farey sequence
+challengeType: 5
+forumTopicId: 302266
+dashedName: farey-sequence
+---
+
+# --description--
+
+The [Farey sequence](<https://en.wikipedia.org/wiki/Farey sequence> "wp: Farey sequence") <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
+
+The *Farey sequence* is sometimes incorrectly called a *Farey series*.
+
+Each Farey sequence:
+
+<ul>
+  <li>starts with the value  0,  denoted by the fraction  $ \frac{0}{1} $</li>
+  <li>ends with the value  1,  denoted by the fraction  $ \frac{1}{1}$.</li>
+</ul>
+
+The Farey sequences of orders `1` to `5` are:
+
+<ul>
+  <li style='list-style: none;'>${\bf\it{F}}_1 = \frac{0}{1}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_2 = \frac{0}{1}, \frac{1}{2}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_3 = \frac{0}{1}, \frac{1}{3}, \frac{1}{2}, \frac{2}{3}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_4 = \frac{0}{1}, \frac{1}{4}, \frac{1}{3}, \frac{1}{2}, \frac{2}{3}, \frac{3}{4}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_5 = \frac{0}{1}, \frac{1}{5}, \frac{1}{4}, \frac{1}{3}, \frac{2}{5}, \frac{1}{2}, \frac{3}{5}, \frac{2}{3}, \frac{3}{4}, \frac{4}{5}, \frac{1}{1}$</li>
+</ul>
+
+# --instructions--
+
+Write a function that returns the Farey sequence of order `n`. The function should have one parameter that is `n`. It should return the sequence as an array.
+
+# --hints--
+
+`farey` should be a function.
+
+```js
+assert(typeof farey === 'function');
+```
+
+`farey(3)` should return an array
+
+```js
+assert(Array.isArray(farey(3)));
+```
+
+`farey(3)` should return `["1/3","1/2","2/3"]`
+
+```js
+assert.deepEqual(farey(3), ['1/3', '1/2', '2/3']);
+```
+
+`farey(4)` should return `["1/4","1/3","1/2","2/4","2/3","3/4"]`
+
+```js
+assert.deepEqual(farey(4), ['1/4', '1/3', '1/2', '2/4', '2/3', '3/4']);
+```
+
+`farey(5)` should return `["1/5","1/4","1/3","2/5","1/2","2/4","3/5","2/3","3/4","4/5"]`
+
+```js
+assert.deepEqual(farey(5), [
+  '1/5',
+  '1/4',
+  '1/3',
+  '2/5',
+  '1/2',
+  '2/4',
+  '3/5',
+  '2/3',
+  '3/4',
+  '4/5'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function farey(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function farey(n){
+    let farSeq=[];
+    for(let den = 1; den <= n; den++){
+        for(let num = 1; num < den; num++){
+            farSeq.push({
+                str:num+"/"+den,
+                val:num/den});
+        }
+    }
+    farSeq.sort(function(a,b){
+        return a.val-b.val;
+    });
+    farSeq=farSeq.map(function(a){
+        return a.str;
+    });
+    return farSeq;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
new file mode 100644
index 0000000000..6791320f73
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -0,0 +1,133 @@
+---
+id: 598eef80ba501f1268170e1e
+title: Fibonacci n-step number sequences
+challengeType: 5
+forumTopicId: 302267
+dashedName: fibonacci-n-step-number-sequences
+---
+
+# --description--
+
+These number series are an expansion of the ordinary [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence> "Fibonacci sequence") where:
+
+<ol>
+  <li>For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
+  <li>For $n = 3$ we have the tribonacci sequence; with initial values $[1, 1, 2]$ and $F_k^3 = F_{k-1}^3 + F_{k-2}^3 + F_{k-3}^3$</li>
+  <li>For $n = 4$ we have the tetranacci sequence; with initial values $[1, 1, 2, 4]$ and $F_k^4 = F_{k-1}^4 + F_{k-2}^4 + F_{k-3}^4 + F_{k-4}^4$...</li>
+  <li>For general $n>2$ we have the Fibonacci $n$-step sequence - $F_k^n$; with initial values of the first $n$ values of the $(n-1)$'th Fibonacci $n$-step sequence $F_k^{n-1}$; and $k$'th value of this $n$'th sequence being $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$</li>
+</ol>
+
+For small values of $n$, [Greek numeric prefixes](<https://en.wikipedia.org/wiki/Number prefix#Greek_series> "wp: Number prefix#Greek_series") are sometimes used to individually name each series.
+
+Fibonacci $n$-step sequences:
+
+| $n$ | Series name | Values                                                 |
+| --- | ----------- | ------------------------------------------------------ |
+| 2   | fibonacci   | 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 ...         |
+| 3   | tribonacci  | 1 1 2 4 7 13 24 44 81 149 274 504 927 1705 3136 ...    |
+| 4   | tetranacci  | 1 1 2 4 8 15 29 56 108 208 401 773 1490 2872 5536 ...  |
+| 5   | pentanacci  | 1 1 2 4 8 16 31 61 120 236 464 912 1793 3525 6930 ...  |
+| 6   | hexanacci   | 1 1 2 4 8 16 32 63 125 248 492 976 1936 3840 7617 ...  |
+| 7   | heptanacci  | 1 1 2 4 8 16 32 64 127 253 504 1004 2000 3984 7936 ... |
+| 8   | octonacci   | 1 1 2 4 8 16 32 64 128 255 509 1016 2028 4048 8080 ... |
+| 9   | nonanacci   | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
+| 10  | decanacci   | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
+
+Allied sequences can be generated where the initial values are changed: The [Lucas series](<https://en.wikipedia.org/wiki/Lucas number> "wp: Lucas number") sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
+
+# --instructions--
+
+Write a function to generate Fibonacci $n$-step number sequences and Lucas sequences. The first parameter will be $n$. The second parameter will be the number of elements to be returned. The third parameter will specify whether to output the Fibonacci sequence or the Lucas sequence. If the parameter is `"f"` then return the Fibonacci sequence and if it is `"l"`, then return the Lucas sequence. The sequences must be returned as an array.
+
+# --hints--
+
+`fib_luc` should be a function.
+
+```js
+assert(typeof fib_luc === 'function');
+```
+
+`fib_luc(2,10,"f")` should return `[1,1,2,3,5,8,13,21,34,55]`.
+
+```js
+assert.deepEqual(fib_luc(2, 10, 'f'), ans[0]);
+```
+
+`fib_luc(3,15,"f")` should return `[1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136]`.
+
+```js
+assert.deepEqual(fib_luc(3, 15, 'f'), ans[1]);
+```
+
+`fib_luc(4,15,"f")` should return `[1,1,2,4,8,15,29,56,108,208,401,773,1490,2872,5536]`.
+
+```js
+assert.deepEqual(fib_luc(4, 15, 'f'), ans[2]);
+```
+
+`fib_luc(2,10,"l")` should return `[ 2, 1, 3, 4, 7, 11, 18, 29, 47, 76]`.
+
+```js
+assert.deepEqual(fib_luc(2, 10, 'l'), ans[3]);
+```
+
+`fib_luc(3,15,"l")` should return `[ 2, 1, 3, 6, 10, 19, 35, 64, 118, 217, 399, 734, 1350, 2483, 4567 ]`.
+
+```js
+assert.deepEqual(fib_luc(3, 15, 'l'), ans[4]);
+```
+
+`fib_luc(4,15,"l")` should return `[ 2, 1, 3, 6, 12, 22, 43, 83, 160, 308, 594, 1145, 2207, 4254, 8200 ]`.
+
+```js
+assert.deepEqual(fib_luc(4, 15, 'l'), ans[5]);
+```
+
+`fib_luc(5,15,"l")` should return `[ 2, 1, 3, 6, 12, 24, 46, 91, 179, 352, 692, 1360, 2674, 5257, 10335 ]`.
+
+```js
+assert.deepEqual(fib_luc(5, 15, 'l'), ans[6]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ans = [[1,1,2,3,5,8,13,21,34,55],
+[1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136],
+[1,1,2,4,8,15,29,56,108,208,401,773,1490,2872,5536],
+[ 2, 1, 3, 4, 7, 11, 18, 29, 47, 76],
+[ 2, 1, 3, 6, 10, 19, 35, 64, 118, 217, 399, 734, 1350, 2483, 4567 ],
+[ 2, 1, 3, 6, 12, 22, 43, 83, 160, 308, 594, 1145, 2207, 4254, 8200 ],
+[ 2, 1, 3, 6, 12, 24, 46, 91, 179, 352, 692, 1360, 2674, 5257, 10335 ]];
+```
+
+## --seed-contents--
+
+```js
+function fib_luc(n, len, w) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fib_luc(n, len, w) {
+    function nacci(a, n, len) {
+        while (a.length < len) {
+            let sum = 0;
+            for (let i = Math.max(0, a.length - n); i < a.length; i++)
+                sum += a[i];
+            a.push(sum);
+        }
+        return a;
+    }
+    if(w=="f"){
+        return nacci(nacci([1,1], n, n), n, len);
+    }else{
+        return nacci(nacci([2,1], n, n), n, len);
+    }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
new file mode 100644
index 0000000000..2cce69c185
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
@@ -0,0 +1,75 @@
+---
+id: 597f24c1dda4e70f53c79c81
+title: Fibonacci sequence
+challengeType: 5
+forumTopicId: 302268
+dashedName: fibonacci-sequence
+---
+
+# --description--
+
+Write a function to generate the <code>n<sup>th</sup></code> Fibonacci number.
+
+The <code>n<sup>th</sup></code> Fibonacci number is given by:
+
+<code>F<sub>n</sub> = F<sub>n-1</sub> + F<sub>n-2</sub></code>
+
+The first two terms of the series are 0 and 1.
+
+Hence, the series is: 0, 1, 1, 2, 3, 5, 8, 13...
+
+# --hints--
+
+`fibonacci` should be a function.
+
+```js
+assert(typeof fibonacci === 'function');
+```
+
+`fibonacci(2)` should return a number.
+
+```js
+assert(typeof fibonacci(2) == 'number');
+```
+
+`fibonacci(3)` should return 2.
+
+```js
+assert.equal(fibonacci(3), 2);
+```
+
+`fibonacci(5)` should return 5.
+
+```js
+assert.equal(fibonacci(5), 5);
+```
+
+`fibonacci(10)` should return 55.
+
+```js
+assert.equal(fibonacci(10), 55);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fibonacci(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fibonacci(n) {
+  let a = 0, b = 1, t;
+  while (--n >= 0) {
+    t = a;
+    a = b;
+    b += t;
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
new file mode 100644
index 0000000000..708f743add
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -0,0 +1,121 @@
+---
+id: 5992e222d397f00d21122931
+title: Fibonacci word
+challengeType: 5
+forumTopicId: 302269
+dashedName: fibonacci-word
+---
+
+# --description--
+
+The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+
+<pre>Define  F_Word<sub>1</sub>  as  <strong>1</strong>
+Define  F_Word<sub>2</sub>  as  <strong>0</strong>
+Form   F_Word<sub>3</sub>  as  F_Word<sub>2</sub>   concatenated with  F_Word<sub>1</sub>   i.e.:  <strong>01</strong>
+Form   F_Word<sub>n</sub>  as  F_Word<sub>n-1</sub>  concatenated with  F_word<sub>n-2</sub>
+</pre>
+
+# --instructions--
+
+Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+
+# --hints--
+
+`fibWord` should be a function.
+
+```js
+assert(typeof fibWord === 'function');
+```
+
+`fibWord(5)` should return an array.
+
+```js
+assert(Array.isArray(fibWord(5)));
+```
+
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+
+```js
+assert.deepEqual(fibWord(5), ans);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
+
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+
+  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
+
+  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+```
+
+## --seed-contents--
+
+```js
+function fibWord(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fibWord(n) {
+    function entropy(s) {
+         //create an object containing each individual char
+      //and the amount of iterations per char
+        function prob(s) {
+            var h = Object.create(null);
+            s.split('').forEach(function(c) {
+               h[c] && h[c]++ || (h[c] = 1);
+            });
+            return h;
+        }
+
+        s = s.toString(); //just in case
+        var e = 0, l = s.length, h = prob(s);
+
+        for (var i in h ) {
+            var p = h[i]/l;
+            e -= p * Math.log(p) / Math.log(2);
+        }
+        return e;
+    }
+    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
+
+    for (var i = 0; i < n; i++) {
+        if (i === 0 || i === 1) {
+            w = wNth[i];
+        } else {
+            w = wNth[i - 1] + wNth[i - 2];
+            wNth.push(w);
+        }
+        var l = w.length;
+        var e = entropy(w);
+
+        if (l <= 21) {
+            o.push({
+                N: i + 1,
+                Length: l,
+                Entropy: e,
+                Word: w
+            });
+        } else {
+            o.push({
+                N: i + 1,
+                Length: l,
+                Entropy: e,
+                Word: "..."
+            });
+        }
+    }
+  return o;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fizzbuzz.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fizzbuzz.md
new file mode 100644
index 0000000000..9839933b09
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fizzbuzz.md
@@ -0,0 +1,92 @@
+---
+id: 5e9ddb06ec35240f39657419
+title: FizzBuzz
+challengeType: 5
+forumTopicId: 385370
+dashedName: fizzbuzz
+---
+
+# --description--
+
+Write a program that generates an array of integers from 1 to 100 (inclusive). But:
+
+<ul>
+    <li>for multiples of 3, add <code>"Fizz"</code> to the array instead of the number</li>
+    <li>for multiples of 5, add <code>"Buzz"</code> to the array instead of the number</li>
+    <li>for multiples of 3 and 5, add <code>"FizzBuzz"</code> to the array instead of the number</li>
+</ul>
+
+# --instructions--
+
+Your program should return an array containing the results based on the rules above.
+
+# --hints--
+
+`fizzBuzz` should be a function.
+
+```js
+assert(typeof fizzBuzz == 'function');
+```
+
+`fizzBuzz()` should return an Array.
+
+```js
+assert(Array.isArray(fizzBuzz()) == true);
+```
+
+Numbers divisible by only 3 should return `"Fizz"`.
+
+```js
+assert.equal(fizzBuzz()[2], 'Fizz');
+```
+
+Numbers divisible by only 5 should return `"Buzz"`.
+
+```js
+assert.equal(fizzBuzz()[99], 'Buzz');
+```
+
+Numbers divisible by both 3 and 5 should return `"FizzBuzz"`.
+
+```js
+assert.equal(fizzBuzz()[89], 'FizzBuzz');
+```
+
+Numbers not divisible by either 3 or 5 should return the number itself.
+
+```js
+assert.equal(fizzBuzz()[12], 13);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fizzBuzz() {
+
+}
+```
+
+# --solutions--
+
+```js
+function fizzBuzz() {
+    let res=[];
+    for (let i =1; i < 101; i++) {
+        if (i % 3 === 0  && i % 5 === 0) {
+            res.push("FizzBuzz");
+        }
+        else if (i % 3 === 0) {
+            res.push("Fizz");
+        }
+        else if (i % 5 === 0) {
+            res.push("Buzz");
+        } 
+        else {
+            res.push(i);
+        }
+    }
+    return res;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fractran.md
new file mode 100644
index 0000000000..e8e4d35925
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/fractran.md
@@ -0,0 +1,139 @@
+---
+id: 5a7dad05be01840e1778a0d1
+title: Fractran
+challengeType: 5
+forumTopicId: 302270
+dashedName: fractran
+---
+
+# --description--
+
+[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") is a Turing-complete esoteric programming language invented by the mathematician [John Horton Conway](<https://en.wikipedia.org/wiki/John Horton Conway> "wp: John Horton Conway").
+
+A FRACTRAN program is an ordered list of positive fractions $P = (f_1, f_2, \\ldots, f_m)$, together with an initial positive integer input $n$.
+
+The program is run by updating the integer $n$ as follows:
+
+<ul>
+  <li>for the first fraction, $f_i$, in the list for which $nf_i$ is an integer, replace $n$ with $nf_i$ ;</li>
+  <li>repeat this rule until no fraction in the list produces an integer when multiplied by $n$, then halt.</li>
+</ul>
+
+Conway gave a program for primes in FRACTRAN:
+
+$\\dfrac{17}{91}$, $\\dfrac{78}{85}$, $\\dfrac{19}{51}$, $\\dfrac{23}{38}$, $\\dfrac{29}{33}$, $\\dfrac{77}{29}$, $\\dfrac{95}{23}$, $\\dfrac{77}{19}$, $\\dfrac{1}{17}$, $\\dfrac{11}{13}$, $\\dfrac{13}{11}$, $\\dfrac{15}{14}$, $\\dfrac{15}{2}$, $\\dfrac{55}{1}$
+
+Starting with $n=2$, this FRACTRAN program will change $n$ to $15=2\\times (\\frac{15}{2})$, then $825=15\\times (\\frac{55}{1})$, generating the following sequence of integers:
+
+$2$, $15$, $825$, $725$, $1925$, $2275$, $425$, $390$, $330$, $290$, $770$, $\\ldots$
+
+After 2, this sequence contains the following powers of 2:
+
+$2^2=4$, $2^3=8$, $2^5=32$, $2^7=128$, $2^{11}=2048$, $2^{13}=8192$, $2^{17}=131072$, $2^{19}=524288$, $\\ldots$
+
+which are the prime powers of 2.
+
+# --instructions--
+
+Write a function that takes a fractran program as a string parameter and returns the first 10 numbers of the program as an array. If the result does not have 10 numbers then return the numbers as is.
+
+# --hints--
+
+`fractran` should be a function.
+
+```js
+assert(typeof fractran == 'function');
+```
+
+`fractran("3/2, 1/3")` should return an array.
+
+```js
+assert(Array.isArray(fractran('3/2, 1/3')));
+```
+
+`fractran("3/2, 1/3")` should return `[ 2, 3, 1 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 1/3'), [2, 3, 1]);
+```
+
+`fractran("3/2, 5/3, 1/5")` should return `[ 2, 3, 5, 1 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 5/3, 1/5'), [2, 3, 5, 1]);
+```
+
+`fractran("3/2, 6/3")` should return `[ 2, 3, 6, 9, 18, 27, 54, 81, 162, 243 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 6/3'), [2, 3, 6, 9, 18, 27, 54, 81, 162, 243]);
+```
+
+`fractran("2/7, 7/2")` should return `[ 2, 7, 2, 7, 2, 7, 2, 7, 2, 7 ]`.
+
+```js
+assert.deepEqual(fractran('2/7, 7/2'), [2, 7, 2, 7, 2, 7, 2, 7, 2, 7]);
+```
+
+`fractran("17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23, 77/19, 1/17, 11/13, 13/11, 15/14, 15/2, 55/1")` should return `[ 2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290 ]`.
+
+```js
+assert.deepEqual(
+  fractran(
+    '17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23, 77/19, 1/17, 11/13, 13/11, 15/14, 15/2, 55/1'
+  ),
+  [2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fractran(progStr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fractran(progStr){
+  var num = new Array();
+  var den = new Array();
+  var val ;
+  var out="";
+  function compile(prog){
+    var regex = /\s*(\d*)\s*\/\s*(\d*)\s*(.*)/m;
+    while(regex.test(prog)){
+      num.push(regex.exec(prog)[1]);
+      den.push(regex.exec(prog)[2]);
+      prog = regex.exec(prog)[3];
+    }
+  }
+
+  function step(val){
+    var i=0;
+    while(i<den.length && val%den[i] != 0) i++;
+    return num[i]*val/den[i];
+  }
+
+  var seq=[]
+
+  function exec(val){
+    var i = 0;
+    while(val && i<limit){
+      seq.push(val)
+      val = step(val);
+      i ++;
+    }
+  }
+
+  // Main
+  compile(progStr);
+  var limit = 10;
+  exec(2);
+  return seq;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gamma-function.md
new file mode 100644
index 0000000000..d764232158
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -0,0 +1,104 @@
+---
+id: 5a23c84252665b21eecc7e76
+title: Gamma function
+challengeType: 5
+forumTopicId: 302271
+dashedName: gamma-function
+---
+
+# --description--
+
+Implement one algorithm (or more) to compute the [Gamma](<https://en.wikipedia.org/wiki/Gamma function>) ($\\Gamma$) function (in the real field only).
+
+The Gamma function can be defined as:
+
+<div style='padding-left: 4em;'><big><big>$\Gamma(x) = \displaystyle\int_0^\infty t^{x-1}e^{-t} dt$</big></big></div>
+
+# --hints--
+
+`gamma` should be a function.
+
+```js
+assert(typeof gamma == 'function');
+```
+
+`gamma(.1)` should return a number.
+
+```js
+assert(typeof gamma(0.1) == 'number');
+```
+
+`gamma(.1)` should return `9.513507698668736`.
+
+```js
+assert.equal(round(gamma(0.1)), round(9.513507698668736));
+```
+
+`gamma(.2)` should return `4.590843711998803`.
+
+```js
+assert.equal(round(gamma(0.2)), round(4.590843711998803));
+```
+
+`gamma(.3)` should return `2.9915689876875904`.
+
+```js
+assert.equal(round(gamma(0.3)), round(2.9915689876875904));
+```
+
+`gamma(.4)` should return `2.218159543757687`.
+
+```js
+assert.equal(round(gamma(0.4)), round(2.218159543757687));
+```
+
+`gamma(.5)` should return `1.7724538509055159`.
+
+```js
+assert.equal(round(gamma(0.5)), round(1.7724538509055159));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function round(x) {
+  return Number(x).toPrecision(13);
+}
+```
+
+## --seed-contents--
+
+```js
+function gamma(x) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gamma(x) {
+  var p = [0.99999999999980993, 676.5203681218851, -1259.1392167224028,
+  771.32342877765313, -176.61502916214059, 12.507343278686905,
+  -0.13857109526572012, 9.9843695780195716e-6, 1.5056327351493116e-7
+  ];
+
+  var g = 7;
+  if (x < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * x) * gamma(1 - x));
+  }
+
+  x -= 1;
+  var a = p[0];
+  var t = x + g + 0.5;
+  for (var i = 1; i < p.length; i++) {
+  a += p[i] / (x + i);
+  }
+
+  var result=Math.sqrt(2 * Math.PI) * Math.pow(t, x + 0.5) * Math.exp(-t) * a;
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gaussian-elimination.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
new file mode 100644
index 0000000000..2e5adf4bd9
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
@@ -0,0 +1,230 @@
+---
+id: 5a23c84252665b21eecc7e77
+title: Gaussian elimination
+challengeType: 5
+forumTopicId: 302272
+dashedName: gaussian-elimination
+---
+
+# --description--
+
+Write a function to solve \\(Ax = b\\) using Gaussian elimination then backwards substitution.
+
+\\(A\\) being an \\(n \\times n\\) matrix. Also, \\(x\\) and \\(b\\) are \\(n\\) by 1 vectors.
+
+To improve accuracy, please use partial pivoting and scaling.
+
+# --hints--
+
+`gaussianElimination` should be a function.
+
+```js
+assert(typeof gaussianElimination == 'function');
+```
+
+`gaussianElimination([[1,1],[1,-1]], [5,1])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    gaussianElimination(
+      [
+        [1, 1],
+        [1, -1]
+      ],
+      [5, 1]
+    )
+  )
+);
+```
+
+`gaussianElimination([[1,1],[1,-1]], [5,1])` should return `[ 3, 2 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 1],
+      [1, -1]
+    ],
+    [5, 1]
+  ),
+  [3, 2]
+);
+```
+
+`gaussianElimination([[2,3],[2,1]] , [8,4])` should return `[ 1, 2 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [2, 3],
+      [2, 1]
+    ],
+    [8, 4]
+  ),
+  [1, 2]
+);
+```
+
+`gaussianElimination([[1,3],[5,-2]], [14,19])` should return `[ 5, 3 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 3],
+      [5, -2]
+    ],
+    [14, 19]
+  ),
+  [5, 3]
+);
+```
+
+`gaussianElimination([[1,1],[5,-1]] , [10,14])` should return `[ 4, 6 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 1],
+      [5, -1]
+    ],
+    [10, 14]
+  ),
+  [4, 6]
+);
+```
+
+`gaussianElimination([[1,2,3],[4,5,6],[7,8,8]] , [6,15,23])` should return `[ 1, 1, 1 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 2, 3],
+      [4, 5, 6],
+      [7, 8, 8]
+    ],
+    [6, 15, 23]
+  ),
+  [1, 1, 1]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gaussianElimination(A,b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gaussianElimination(A, b) {
+  // Lower Upper Decomposition
+  function ludcmp(A) {
+    // A is a matrix that we want to decompose into Lower and Upper matrices.
+    var d = true
+    var n = A.length
+    var idx = new Array(n) // Output vector with row permutations from partial pivoting
+    var vv = new Array(n) // Scaling information
+
+    for (var i=0; i<n; i++) {
+        var max = 0
+        for (var j=0; j<n; j++) {
+            var temp = Math.abs(A[i][j])
+            if (temp > max) max = temp
+        }
+        if (max == 0) return // Singular Matrix!
+        vv[i] = 1 / max // Scaling
+    }
+
+        var Acpy = new Array(n)
+        for (var i=0; i<n; i++) {
+            var Ai = A[i]
+            let Acpyi = new Array(Ai.length)
+            for (j=0; j<Ai.length; j+=1) Acpyi[j] = Ai[j]
+            Acpy[i] = Acpyi
+        }
+        A = Acpy
+
+    var tiny = 1e-20 // in case pivot element is zero
+    for (var i=0; ; i++) {
+        for (var j=0; j<i; j++) {
+            var sum = A[j][i]
+            for (var k=0; k<j; k++) sum -= A[j][k] * A[k][i];
+            A[j][i] = sum
+        }
+        var jmax = 0
+        var max = 0;
+        for (var j=i; j<n; j++) {
+            var sum = A[j][i]
+            for (var k=0; k<i; k++) sum -= A[j][k] * A[k][i];
+            A[j][i] = sum
+            var temp = vv[j] * Math.abs(sum)
+            if (temp >= max) {
+                max = temp
+                jmax = j
+            }
+        }
+        if (i <= jmax) {
+            for (var j=0; j<n; j++) {
+                var temp = A[jmax][j]
+                A[jmax][j] = A[i][j]
+                A[i][j] = temp
+            }
+            d = !d;
+            vv[jmax] = vv[i]
+        }
+        idx[i] = jmax;
+        if (i == n-1) break;
+        var temp = A[i][i]
+        if (temp == 0) A[i][i] = temp = tiny
+        temp = 1 / temp
+        for (var j=i+1; j<n; j++) A[j][i] *= temp
+    }
+    return {A:A, idx:idx, d:d}
+  }
+
+  // Lower Upper Back Substitution
+  function lubksb(lu, b) {
+    // solves the set of n linear equations A*x = b.
+    // lu is the object containing A, idx and d as determined by the routine ludcmp.
+    var A = lu.A
+    var idx = lu.idx
+    var n = idx.length
+
+        var bcpy = new Array(n)
+        for (var i=0; i<b.length; i+=1) bcpy[i] = b[i]
+        b = bcpy
+
+    for (var ii=-1, i=0; i<n; i++) {
+        var ix = idx[i]
+        var sum = b[ix]
+        b[ix] = b[i]
+        if (ii > -1)
+            for (var j=ii; j<i; j++) sum -= A[i][j] * b[j]
+        else if (sum)
+            ii = i
+        b[i] = sum
+    }
+    for (var i=n-1; i>=0; i--) {
+        var sum = b[i]
+        for (var j=i+1; j<n; j++) sum -= A[i][j] * b[j]
+        b[i] = sum / A[i][i]
+    }
+    return b // solution vector x
+  }
+
+    var lu = ludcmp(A)
+    if (lu === undefined) return // Singular Matrix!
+    return lubksb(lu, b)
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
new file mode 100644
index 0000000000..4af8e94f0e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -0,0 +1,175 @@
+---
+id: 5a23c84252665b21eecc7e78
+title: General FizzBuzz
+challengeType: 5
+forumTopicId: 302273
+dashedName: general-fizzbuzz
+---
+
+# --description--
+
+Write a generalized version of [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) that works for any list of factors, along with their words.
+
+This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
+
+The first will be an array with the FizzBuzz rules. For example: `[ [3, "Fizz"] , [5, "Buzz"] ]`.
+
+This indicates that `Fizz` should be printed if the number is a multiple of 3 and `Buzz` if it is a multiple of 5. If it is a multiple of both then the strings should be concatenated in the order specified in the array. In this case, `FizzBuzz` if the number is a multiple of 3 and 5.
+
+The second parameter is the number for which the function should return a string as stated above.
+
+# --hints--
+
+`genFizzBuzz` should be a function.
+
+```js
+assert(typeof genFizzBuzz == 'function');
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 6)` should return a string.
+
+```js
+assert(
+  typeof genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    6
+  ) == 'string'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 6)` should return `"Fizz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    6
+  ),
+  'Fizz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 10)` should return `"Buzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    10
+  ),
+  'Buzz'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 12)` should return `"Buzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    12
+  ),
+  'Buzz'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 13)` should return `"13"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    13
+  ),
+  '13'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 15)` should return `"BuzzFizz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    15
+  ),
+  'BuzzFizz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 15)` should return `"FizzBuzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    15
+  ),
+  'FizzBuzz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"],[7, "Baxx"]], 105)` should return `"FizzBuzzBaxx"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz'],
+      [7, 'Baxx']
+    ],
+    105
+  ),
+  'FizzBuzzBaxx'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function genFizzBuzz(rules, num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function genFizzBuzz(rules, num) {
+  let res='';
+  rules.forEach(function (e) {
+    if(num % e[0] == 0)
+      res+=e[1];
+  })
+
+  if(res==''){
+    res=num.toString();
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
new file mode 100644
index 0000000000..5f643c3a38
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
@@ -0,0 +1,99 @@
+---
+id: 5a23c84252665b21eecc7e7a
+title: Generate lower case ASCII alphabet
+challengeType: 5
+forumTopicId: 302274
+dashedName: generate-lower-case-ascii-alphabet
+---
+
+# --description--
+
+Write a function to generate an array of lower case ASCII characters for a given range. For example, given the range `['a', 'd']`, the function should return `['a', 'b', 'c', 'd']`.
+
+# --hints--
+
+`lascii` should be a function.
+
+```js
+assert(typeof lascii == 'function');
+```
+
+`lascii("a","d")` should return an array.
+
+```js
+assert(Array.isArray(lascii('a', 'd')));
+```
+
+`lascii('a','d')` should return `[ 'a', 'b', 'c', 'd' ]`.
+
+```js
+assert.deepEqual(lascii('a', 'd'), results[0]);
+```
+
+`lascii('c','i')` should return `[ 'c', 'd', 'e', 'f', 'g', 'h', 'i' ]`.
+
+```js
+assert.deepEqual(lascii('c', 'i'), results[1]);
+```
+
+`lascii('m','q')` should return `[ 'm', 'n', 'o', 'p', 'q' ]`.
+
+```js
+assert.deepEqual(lascii('m', 'q'), results[2]);
+```
+
+`lascii('k','n')` should return `[ 'k', 'l', 'm', 'n' ]`.
+
+```js
+assert.deepEqual(lascii('k', 'n'), results[3]);
+```
+
+`lascii('t','z')` should return `[ 't', 'u', 'v', 'w', 'x', 'y', 'z' ]`.
+
+```js
+assert.deepEqual(lascii('t', 'z'), results[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let results=[
+  [ 'a', 'b', 'c', 'd' ],
+  [ 'c', 'd', 'e', 'f', 'g', 'h', 'i' ],
+  [ 'm', 'n', 'o', 'p', 'q' ],
+  [ 'k', 'l', 'm', 'n' ],
+  [ 't', 'u', 'v', 'w', 'x', 'y', 'z' ]
+]
+```
+
+## --seed-contents--
+
+```js
+function lascii(cFrom, cTo) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lascii(cFrom, cTo) {
+
+  function cRange(cFrom, cTo) {
+    var iStart = cFrom.charCodeAt(0);
+
+    return Array.apply(
+      null, Array(cTo.charCodeAt(0) - iStart + 1)
+    ).map(function (_, i) {
+
+      return String.fromCharCode(iStart + i);
+
+    });
+  }
+
+  return cRange(cFrom, cTo);
+
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generator-exponential.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generator-exponential.md
new file mode 100644
index 0000000000..f888e8dff0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/generator-exponential.md
@@ -0,0 +1,117 @@
+---
+id: 5a23c84252665b21eecc7e7b
+title: Generator/Exponential
+challengeType: 5
+forumTopicId: 302275
+dashedName: generatorexponential
+---
+
+# --description--
+
+A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided.
+
+Generators are often built on top of coroutines or objects so that the internal state of the object is handled "naturally".
+
+Generators are often used in situations where a sequence is potentially infinite, and where it is possible to construct the next value of the sequence with only minimal state.
+
+# --instructions--
+
+Write a function that uses generators to generate squares and cubes. Create a new generator that filters all cubes from the generator of squares.
+
+The function should return the \\( n^{th} \\) value of the filtered generator.
+
+For example for \\(n=7\\), the function should return 81 as the sequence would be 4, 9, 16, 25, 36, 49, 81. Here 64 is filtered out, as it is a cube.
+
+# --hints--
+
+`exponentialGenerator` should be a function.
+
+```js
+assert(typeof exponentialGenerator == 'function');
+```
+
+`exponentialGenerator()` should return a number.
+
+```js
+assert(typeof exponentialGenerator(10) == 'number');
+```
+
+`exponentialGenerator(10)` should return `144`.
+
+```js
+assert.equal(exponentialGenerator(10), 144);
+```
+
+`exponentialGenerator(12)` should return `196`.
+
+```js
+assert.equal(exponentialGenerator(12), 196);
+```
+
+`exponentialGenerator(14)` should return `256`.
+
+```js
+assert.equal(exponentialGenerator(14), 256);
+```
+
+`exponentialGenerator(20)` should return `484`.
+
+```js
+assert.equal(exponentialGenerator(20), 484);
+```
+
+`exponentialGenerator(25)` should return `784`.
+
+```js
+assert.equal(exponentialGenerator(25), 784);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function exponentialGenerator(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function exponentialGenerator(n){
+  function* PowersGenerator(m) {
+    var n=0;
+    while(1) {
+        yield Math.pow(n, m);
+        n += 1;
+    }
+  }
+
+  function* FilteredGenerator(g, f){
+    var value = g.next().value;
+    var filter = f.next().value;
+    while(1) {
+        if( value < filter ) {
+            yield value;
+            value = g.next().value;
+        } else if ( value > filter ) {
+            filter = f.next().value;
+        } else {
+            value = g.next().value;
+            filter = f.next().value;
+        }
+    }
+  }
+
+  var squares = PowersGenerator(2);
+  var cubes = PowersGenerator(3);
+
+  var filtered = FilteredGenerator(squares, cubes);
+
+  var curr=0;
+  for(var i=0;i<n;i++) curr=filtered.next();
+
+  return curr.value;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gray-code.md
new file mode 100644
index 0000000000..4e5c523737
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -0,0 +1,122 @@
+---
+id: 5a23c84252665b21eecc7e80
+title: Gray code
+challengeType: 5
+forumTopicId: 302276
+dashedName: gray-code
+---
+
+# --description--
+
+[Gray code](<https://en.wikipedia.org/wiki/Gray code>) is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
+
+This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs.
+
+It is also useful for generating inputs for [Karnaugh maps](<https://en.wikipedia.org/wiki/Karnaugh map>) in order from left to right or top to bottom.
+
+# --instructions--
+
+Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters.
+
+The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded.
+
+Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary).
+
+There are many possible Gray codes. The following encodes what is called "binary reflected Gray code."
+
+Encoding (MSB is bit 0, b is binary, g is Gray code):
+
+<pre>if b[i-1] = 1
+  g[i] = not b[i]
+else
+  g[i] = b[i]
+</pre>
+
+Or:
+
+<pre>g = b xor (b logically right shifted 1 time)
+</pre>
+
+Decoding (MSB is bit 0, b is binary, g is Gray code):
+
+<pre>b[0] = g[0]<br>
+for other bits:
+b[i] = g[i] xor b[i-1]
+</pre>
+
+# --hints--
+
+`gray` should be a function.
+
+```js
+assert(typeof gray == 'function');
+```
+
+`gray(true,177)` should return a number.
+
+```js
+assert(typeof gray(true, 177) == 'number');
+```
+
+`gray(true,177)` should return `233`.
+
+```js
+assert.equal(gray(true, 177), 233);
+```
+
+`gray(true,425)` should return `381`.
+
+```js
+assert.equal(gray(true, 425), 381);
+```
+
+`gray(true,870)` should return `725`.
+
+```js
+assert.equal(gray(true, 870), 725);
+```
+
+`gray(false,233)` should return `177`.
+
+```js
+assert.equal(gray(false, 233), 177);
+```
+
+`gray(false,381)` should return `425`.
+
+```js
+assert.equal(gray(false, 381), 425);
+```
+
+`gray(false,725)` should return `870`.
+
+```js
+assert.equal(gray(false, 725), 870);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gray(enc, number) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gray(enc, number){
+  if(enc){
+      return number ^ (number >> 1);
+  }else{
+      let n = number;
+
+      while (number >>= 1) {
+          n ^= number;
+      }
+      return n;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
new file mode 100644
index 0000000000..60b9675018
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc7e82
+title: Greatest common divisor
+challengeType: 5
+forumTopicId: 302277
+dashedName: greatest-common-divisor
+---
+
+# --description--
+
+Write a function that returns the greatest common divisor of two integers.
+
+# --hints--
+
+`gcd` should be a function.
+
+```js
+assert(typeof gcd == 'function');
+```
+
+`gcd(24,36)` should return a number.
+
+```js
+assert(typeof gcd(24, 36) == 'number');
+```
+
+`gcd(24,36)` should return `12`.
+
+```js
+assert.equal(gcd(24, 36), 12);
+```
+
+`gcd(30,48)` should return `6`.
+
+```js
+assert.equal(gcd(30, 48), 6);
+```
+
+`gcd(10,15)` should return `5`.
+
+```js
+assert.equal(gcd(10, 15), 5);
+```
+
+`gcd(100,25)` should return `25`.
+
+```js
+assert.equal(gcd(100, 25), 25);
+```
+
+`gcd(13,250)` should return `1`.
+
+```js
+assert.equal(gcd(13, 250), 1);
+```
+
+`gcd(1300,250)` should return `50`.
+
+```js
+assert.equal(gcd(1300, 250), 50);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gcd(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+  return b==0 ? Math.abs(a):gcd(b, a % b);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
new file mode 100644
index 0000000000..4a90c111fe
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
@@ -0,0 +1,113 @@
+---
+id: 5a23c84252665b21eecc7e84
+title: Greatest subsequential sum
+challengeType: 5
+forumTopicId: 302278
+dashedName: greatest-subsequential-sum
+---
+
+# --description--
+
+Given a sequence of integers, find a continuous subsequence which maximizes the sum of its elements, that is, the elements of no other single subsequence add up to a value larger than this one.
+
+An empty subsequence is considered to have the sum of \\( 0 \\); thus if all elements are negative, the result must be the empty sequence.
+
+# --hints--
+
+`maximumSubsequence` should be a function.
+
+```js
+assert(typeof maximumSubsequence == 'function');
+```
+
+`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return an array.
+
+```js
+assert(Array.isArray(maximumSubsequence([1, 2, -1, 3, 10, -10])));
+```
+
+`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return `[ 1, 2, -1, 3, 10 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([1, 2, -1, 3, 10, -10]), [1, 2, -1, 3, 10]);
+```
+
+`maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ])` should return `[ 0, 8, 10 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [
+  0,
+  8,
+  10
+]);
+```
+
+`maximumSubsequence([ 9, 9, -10, 1 ])` should return `[ 9, 9 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([9, 9, -10, 1]), [9, 9]);
+```
+
+`maximumSubsequence([ 7, 1, -5, -3, -8, 1 ])` should return `[ 7, 1 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([7, 1, -5, -3, -8, 1]), [7, 1]);
+```
+
+`maximumSubsequence([ -3, 6, -1, 4, -4, -6 ])` should return `[ 6, -1, 4 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([-3, 6, -1, 4, -4, -6]), [6, -1, 4]);
+```
+
+`maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ])` should return `[ 3, 5, 6, -2, -1, 4 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]), [
+  3,
+  5,
+  6,
+  -2,
+  -1,
+  4
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function maximumSubsequence(population) {
+
+}
+```
+
+# --solutions--
+
+```js
+function maximumSubsequence(population) {
+  function sumValues(arr) {
+      var result = 0;
+      for (var i = 0, len = arr.length; i < len; i++) {
+          result += arr[i];
+      }
+      return result;
+  }
+  var greatest;
+  var maxValue = 0;
+
+  for (var i = 0, len = population.length; i < len; i++) {
+      for (var j = i; j <= len; j++) {
+          var subsequence = population.slice(i, j);
+          var value = sumValues(subsequence);
+          if (value > maxValue) {
+              maxValue = value;
+              greatest = subsequence;
+          };
+      }
+  }
+
+  return greatest;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hailstone-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
new file mode 100644
index 0000000000..37768d8cd3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
@@ -0,0 +1,98 @@
+---
+id: 595608ff8bcd7a50bd490181
+title: Hailstone sequence
+challengeType: 5
+forumTopicId: 302279
+dashedName: hailstone-sequence
+---
+
+# --description--
+
+The Hailstone sequence of numbers can be generated from a starting positive integer, `n` by:
+
+- If `n` is `1` then the sequence ends
+- If `n` is `even` then the next `n` of the sequence `= n/2`
+- If `n` is `odd` then the next `n` of the sequence `= (3 * n) + 1`
+
+The (unproven) Collatz conjecture is that the hailstone sequence for any starting number always terminates.
+
+The hailstone sequence is also known as hailstone numbers (because the values are usually subject to multiple descents and ascents like hailstones in a cloud), or as the Collatz sequence.
+
+# --instructions--
+
+1. Create a routine to generate the hailstone sequence for a number
+2. Your function should return an array with the number less than `limit` which has the longest hailstone sequence and that sequence's length. (But don't show the actual sequence!)
+
+# --hints--
+
+`hailstoneSequence` should be a function.
+
+```js
+assert(typeof hailstoneSequence === 'function');
+```
+
+`hailstoneSequence(30)` should return an array.
+
+```js
+assert(Array.isArray(hailstoneSequence(30)));
+```
+
+`hailstoneSequence(30)` should return `[27, 112]`.
+
+```js
+assert.deepEqual(hailstoneSequence(30), [27, 112]);
+```
+
+`hailstoneSequence(50000)` should return `[35655, 324]`.
+
+```js
+assert.deepEqual(hailstoneSequence(50000), [35655, 324]);
+```
+
+`hailstoneSequence(100000)` should return `[77031, 351]`.
+
+```js
+assert.deepEqual(hailstoneSequence(100000), [77031, 351]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function hailstoneSequence(limit) {
+  const res = [];
+
+
+  return res;
+}
+```
+
+# --solutions--
+
+```js
+function hailstoneSequence (limit) {
+  function hailstone(n) {
+    const seq = [n];
+    while (n > 1) {
+      n = n % 2 ? 3 * n + 1 : n / 2;
+      seq.push(n);
+    }
+    return seq;
+  }
+
+  let n = 0;
+  let max = 0;
+  for (let i = limit; --i;) {
+    const seq = hailstone(i);
+    const sLen = seq.length;
+
+    if (sLen > max) {
+      n = i;
+      max = sLen;
+    }
+  }
+
+  return [n, max];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/happy-numbers.md
new file mode 100644
index 0000000000..6cb33dbcaf
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -0,0 +1,129 @@
+---
+id: 594810f028c0303b75339ad1
+title: Happy numbers
+challengeType: 5
+forumTopicId: 302280
+dashedName: happy-numbers
+---
+
+# --description--
+
+A [happy number](https://en.wikipedia.org/wiki/Happy_number) is defined by the following process:
+
+Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals `1` (where it will stay), or it loops endlessly in a cycle which does not include `1`. Those numbers for which this process ends in `1` are happy numbers, while those that do not end in `1` are unhappy numbers.
+
+# --instructions--
+
+Implement a function that returns true if the number is happy, or false if not.
+
+# --hints--
+
+`happy` should be a function.
+
+```js
+assert(typeof happy === 'function');
+```
+
+`happy(1)` should return a boolean.
+
+```js
+assert(typeof happy(1) === 'boolean');
+```
+
+`happy(1)` should return `true`.
+
+```js
+assert(happy(1));
+```
+
+`happy(2)` should return `false`.
+
+```js
+assert(!happy(2));
+```
+
+`happy(7)` should return `true`.
+
+```js
+assert(happy(7));
+```
+
+`happy(10)` should return `true`.
+
+```js
+assert(happy(10));
+```
+
+`happy(13)` should return `true`.
+
+```js
+assert(happy(13));
+```
+
+`happy(19)` should return `true`.
+
+```js
+assert(happy(19));
+```
+
+`happy(23)` should return `true`.
+
+```js
+assert(happy(23));
+```
+
+`happy(28)` should return `true`.
+
+```js
+assert(happy(28));
+```
+
+`happy(31)` should return `true`.
+
+```js
+assert(happy(31));
+```
+
+`happy(32)` should return `true`.
+
+```js
+assert(happy(32));
+```
+
+`happy(33)` should return `false`.
+
+```js
+assert(!happy(33));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function happy(number) {
+
+}
+```
+
+# --solutions--
+
+```js
+function happy (number) {
+  let m;
+  let digit;
+  const cycle = [];
+
+  while (number !== 1 && cycle[number] !== true) {
+    cycle[number] = true;
+    m = 0;
+    while (number > 0) {
+      digit = number % 10;
+      m += Math.pow(digit, 2);
+      number = (number - digit) / 10;
+    }
+    number = m;
+  }
+  return (number === 1);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
new file mode 100644
index 0000000000..400e951334
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
@@ -0,0 +1,87 @@
+---
+id: 595668ca4cfe1af2fb9818d4
+title: Harshad or Niven series
+challengeType: 5
+forumTopicId: 302281
+dashedName: harshad-or-niven-series
+---
+
+# --description--
+
+The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits.
+
+For example, `42` is a Harshad number as `42` is divisible by `(4 + 2)` without remainder.
+
+Assume that the series is defined as the numbers in increasing order.
+
+# --instructions--
+
+Implement a function to generate successive members of the Harshad sequence.
+
+Use it to return an array with ten members of the sequence, starting with first Harshad number greater than `n`.
+
+# --hints--
+
+`isHarshadOrNiven` should be a function.
+
+```js
+assert(typeof isHarshadOrNiven === 'function');
+```
+
+`isHarshadOrNiven(10)` should return `[12, 18, 20, 21, 24, 27, 30, 36, 40, 42]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(10), [12, 18, 20, 21, 24, 27, 30, 36, 40, 42]);
+```
+
+`isHarshadOrNiven(400)` should return `[402, 405, 407, 408, 410, 414, 420, 423, 432, 440]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(400), [402, 405, 407, 408, 410, 414, 420, 423, 432, 440]);
+```
+
+`isHarshadOrNiven(1000)` should return `[1002, 1008, 1010, 1011, 1012, 1014, 1015, 1016, 1017, 1020]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(1000), [1002, 1008, 1010, 1011, 1012, 1014, 1015, 1016, 1017, 1020]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isHarshadOrNiven(n) {
+  const res = [];
+
+  return res;
+}
+```
+
+# --solutions--
+
+```js
+function isHarshadOrNiven(n) {
+  function isHarshad(num) {
+    let s = 0;
+    const nStr = num.toString();
+    for (let i = 0; i < nStr.length; ++i) {
+      s += parseInt(nStr.charAt(i), 10);
+    }
+    return n % s === 0;
+  }
+
+  const res = [];
+  let count = 0;
+
+  while (count < 10) {
+    n++;
+    if (isHarshad(n)) {
+      count++;
+      res.push(n);
+    }
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
new file mode 100644
index 0000000000..d5a9a396bb
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -0,0 +1,105 @@
+---
+id: 595671d4d2cdc305f0d5b36f
+title: Hash from two arrays
+challengeType: 5
+forumTopicId: 302283
+dashedName: hash-from-two-arrays
+---
+
+# --description--
+
+Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
+
+**Related task:**
+
+<ul>
+  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Associative arrays/Creation' target='_blank'>Associative arrays/Creation</a></li>
+</ul>
+
+# --hints--
+
+`arrToObj` should be a function.
+
+```js
+assert(typeof arrToObj === 'function');
+```
+
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: "e" }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[0]), res[0]);
+```
+
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: undefined }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[1]), res[1]);
+```
+
+`arrToObj([1, 2, 3], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c" }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[2]), res[2]);
+```
+
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": 5 }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[3]), res[3]);
+```
+
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": undefined }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[4]), res[4]);
+```
+
+`arrToObj(["a", "b", "c"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[5]), res[5]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  [[1, 2, 3, 4, 5], ['a', 'b', 'c', 'd', 'e']],
+  [[1, 2, 3, 4, 5], ['a', 'b', 'c', 'd']],
+  [[1, 2, 3], ['a', 'b', 'c', 'd', 'e']],
+  [['a', 'b', 'c', 'd', 'e'], [1, 2, 3, 4, 5]],
+  [['a', 'b', 'c', 'd', 'e'], [1, 2, 3, 4]],
+  [['a', 'b', 'c'], [1, 2, 3, 4, 5]]
+];
+
+const res = [
+  { 1: 'a', 2: 'b', 3: 'c', 4: 'd', 5: 'e' },
+  { 1: 'a', 2: 'b', 3: 'c', 4: 'd', 5: undefined },
+  { 1: 'a', 2: 'b', 3: 'c' },
+  { a: 1, b: 2, c: 3, d: 4, e: 5 },
+  { a: 1, b: 2, c: 3, d: 4, e: undefined },
+  { a: 1, b: 2, c: 3 }
+];
+```
+
+## --seed-contents--
+
+```js
+function arrToObj (keys, vals) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function arrToObj (keys, vals) {
+  return keys.reduce((map, key, index) => {
+    map[key] = vals[index];
+    return map;
+  }, {});
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-join.md
new file mode 100644
index 0000000000..d2d5cabf4f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -0,0 +1,237 @@
+---
+id: 5956795bc9e2c415eb244de1
+title: Hash join
+challengeType: 5
+forumTopicId: 302284
+dashedName: hash-join
+---
+
+# --description--
+
+An [inner join](https://en.wikipedia.org/wiki/Join_(SQL)#Inner_join "wp: Join\_(SQL)#Inner_join") is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the [nested loop join](<https://en.wikipedia.org/wiki/Nested loop join> "wp: Nested loop join") algorithm, but a more scalable alternative is the [hash join](<https://en.wikipedia.org/wiki/hash join> "wp: hash join") algorithm.
+
+The "hash join" algorithm consists of two steps:
+
+<ol>
+  <li><strong>Hash phase:</strong> Create a <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
+  <ul>
+    <li>The multimap must support hash-based lookup which scales better than a simple linear search, because that's the whole point of this algorithm.</li>
+    <li>Ideally we should create the multimap for the smaller table, thus minimizing its creation time and memory size.</li>
+  </ul>
+  <li><strong>Join phase:</strong> Scan the other table, and find matching rows by looking in the multimap created before.</li>
+</ol>
+
+In pseudo-code, the algorithm could be expressed as follows:
+
+<pre><strong>let</strong> <i>A</i> = the first input table (or ideally, the larger one)
+<strong>let</strong> <i>B</i> = the second input table (or ideally, the smaller one)
+<strong>let</strong> <i>j<sub>A</sub></i> = the join column ID of table <i>A</i>
+<strong>let</strong> <i>j<sub>B</sub></i> = the join column ID of table <i>B</i>
+<strong>let</strong> <i>M<sub>B</sub></i> = a multimap for mapping from single values to multiple rows of table <i>B</i> (starts out empty)
+<strong>let</strong> <i>C</i> = the output table (starts out empty)
+<strong>for each</strong> row <i>b</i> in table <i>B</i>:
+  <strong>place</strong> <i>b</i> in multimap <i>M<sub>B</sub></i> under key <i>b(j<sub>B</sub>)</i>
+<strong>for each</strong> row <i>a</i> in table <i>A</i>:
+  <strong>for each</strong> row <i>b</i> in multimap <i>M<sub>B</sub></i> under key <i>a(j<sub>A</sub>)</i>:
+    <strong>let</strong> <i>c</i> = the concatenation of row <i>a</i> and row <i>b</i>
+    <strong>place</strong> row <i>c</i> in table <i>C</i>
+</pre>
+
+# --instructions--
+
+Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
+
+**Input**
+
+<table>
+  <tr>
+    <td style="padding: 4px; margin: 5px;">
+      <table style="border:none; border-collapse:collapse;">
+        <tr>
+          <td style="border:none"><i>A =</i></td>
+          <td style="border:none">
+            <table>
+              <tr>
+                <th style="padding: 4px; margin: 5px;">Age</th>
+                <th style="padding: 4px; margin: 5px;">Name</th>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">27</td>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">18</td>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">28</td>
+                <td style="padding: 4px; margin: 5px;">Glory</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">18</td>
+                <td style="padding: 4px; margin: 5px;">Popeye</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">28</td>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+              </tr>
+            </table>
+          </td>
+          <td style="border:none; padding-left:1.5em;" rowspan="2"></td>
+          <td style="border:none"><i>B =</i></td>
+          <td style="border:none">
+            <table>
+              <tr>
+                <th style="padding: 4px; margin: 5px;">Character</th>
+                <th style="padding: 4px; margin: 5px;">Nemesis</th>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+                <td style="padding: 4px; margin: 5px;">Whales</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+                <td style="padding: 4px; margin: 5px;">Spiders</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+                <td style="padding: 4px; margin: 5px;">Ghosts</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+                <td style="padding: 4px; margin: 5px;">Zombies</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Glory</td>
+                <td style="padding: 4px; margin: 5px;">Buffy</td>
+              </tr>
+            </table>
+          </td>
+        </tr>
+        <tr>
+          <td style="border:none">
+            <i>j<sub>A</sub> =</i>
+          </td>
+          <td style="border:none">
+            <i><code>Name</code> (i.e. column 1)</i>
+          </td>
+          <td style="border:none">
+            <i>j<sub>B</sub> =</i>
+          </td>
+          <td style="border:none">
+            <i><code>Character</code> (i.e. column 0)</i>
+          </td>
+        </tr>
+      </table>
+    </td>
+  </tr>
+</table>
+
+**Output**
+
+| A_age | A_name | B_character | B_nemesis |
+| ----- | ------ | ----------- | --------- |
+| 27    | Jonah  | Jonah       | Whales    |
+| 27    | Jonah  | Jonah       | Spiders   |
+| 18    | Alan   | Alan        | Ghosts    |
+| 18    | Alan   | Alan        | Zombies   |
+| 28    | Glory  | Glory       | Buffy     |
+| 28    | Alan   | Alan        | Ghosts    |
+| 28    | Alan   | Alan        | Zombies   |
+
+The order of the rows in the output table is not significant.
+
+# --hints--
+
+`hashJoin` should be a function.
+
+```js
+assert(typeof hashJoin === 'function');
+```
+
+`hashJoin([{ age: 27, name: "Jonah" }, { age: 18, name: "Alan" }, { age: 28, name: "Glory" }, { age: 18, name: "Popeye" }, { age: 28, name: "Alan" }], [{ character: "Jonah", nemesis: "Whales" }, { character: "Jonah", nemesis: "Spiders" }, { character: "Alan", nemesis: "Ghosts" }, { character:"Alan", nemesis: "Zombies" }, { character: "Glory", nemesis: "Buffy" }, { character: "Bob", nemesis: "foo" }])` should return `[{"A_age": 27,"A_name": "Jonah", "B_character": "Jonah", "B_nemesis": "Whales"}, {"A_age": 27,"A_name": "Jonah", "B_character": "Jonah", "B_nemesis": "Spiders"}, {"A_age": 18,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Ghosts"}, {"A_age": 18,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Zombies"}, {"A_age": 28,"A_name": "Glory", "B_character": "Glory", "B_nemesis": "Buffy"}, {"A_age": 28,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Ghosts"}, {"A_age": 28,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Zombies"}]`
+
+```js
+assert.deepEqual(hashJoin(hash1, hash2), res);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const hash1 = [
+    { age: 27, name: 'Jonah' },
+    { age: 18, name: 'Alan' },
+    { age: 28, name: 'Glory' },
+    { age: 18, name: 'Popeye' },
+    { age: 28, name: 'Alan' }
+];
+
+const hash2 = [
+    { character: 'Jonah', nemesis: 'Whales' },
+    { character: 'Jonah', nemesis: 'Spiders' },
+    { character: 'Alan', nemesis: 'Ghosts' },
+    { character: 'Alan', nemesis: 'Zombies' },
+    { character: 'Glory', nemesis: 'Buffy' },
+    { character: 'Bob', nemesis: 'foo' }
+];
+
+const res = [
+    { A_age: 27, A_name: 'Jonah', B_character: 'Jonah', B_nemesis: 'Whales' },
+    { A_age: 27, A_name: 'Jonah', B_character: 'Jonah', B_nemesis: 'Spiders' },
+    { A_age: 18, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Ghosts' },
+    { A_age: 18, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Zombies' },
+    { A_age: 28, A_name: 'Glory', B_character: 'Glory', B_nemesis: 'Buffy' },
+    { A_age: 28, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Ghosts' },
+    { A_age: 28, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Zombies' }
+];
+
+const bench1 = [{ name: 'u2v7v', num: 1 }, { name: 'n53c8', num: 10 }, { name: 'oysce', num: 9 }, { name: '0mto2s', num: 1 }, { name: 'vkh5id', num: 4 }, { name: '5od0cf', num: 8 }, { name: 'uuulue', num: 10 }, { name: '3rgsbi', num: 9 }, { name: 'kccv35r', num: 4 }, { name: '80un74', num: 9 }, { name: 'h4pp3', num: 6 }, { name: '51bit', num: 7 }, { name: 'j9ndf', num: 8 }, { name: 'vf3u1', num: 10 }, { name: 'g0bw0om', num: 10 }, { name: 'j031x', num: 7 }, { name: 'ij3asc', num: 9 }, { name: 'byv83y', num: 8 }, { name: 'bjzp4k', num: 4 }, { name: 'f3kbnm', num: 10 }];
+const bench2 = [{ friend: 'o8b', num: 8 }, { friend: 'ye', num: 2 }, { friend: '32i', num: 5 }, { friend: 'uz', num: 3 }, { friend: 'a5k', num: 4 }, { friend: 'uad', num: 7 }, { friend: '3w5', num: 10 }, { friend: 'vw', num: 10 }, { friend: 'ah', num: 4 }, { friend: 'qv', num: 7 }, { friend: 'ozv', num: 2 }, { friend: '9ri', num: 10 }, { friend: '7nu', num: 4 }, { friend: 'w3', num: 9 }, { friend: 'tgp', num: 8 }, { friend: 'ibs', num: 1 }, { friend: 'ss7', num: 6 }, { friend: 'g44', num: 9 }, { friend: 'tab', num: 9 }, { friend: 'zem', num: 10 }];
+```
+
+## --seed-contents--
+
+```js
+function hashJoin(hash1, hash2) {
+
+  return [];
+}
+```
+
+# --solutions--
+
+```js
+function hashJoin(hash1, hash2) {
+  const hJoin = (tblA, tblB, strJoin) => {
+    const [jA, jB] = strJoin.split('=');
+    const M = tblB.reduce((a, x) => {
+      const id = x[jB];
+      return (
+        a[id] ? a[id].push(x) : (a[id] = [x]),
+        a
+      );
+    }, {});
+
+    return tblA.reduce((a, x) => {
+      const match = M[x[jA]];
+      return match ? (
+                a.concat(match.map(row => dictConcat(x, row)))
+            ) : a;
+    }, []);
+  };
+
+  const dictConcat = (dctA, dctB) => {
+    const ok = Object.keys;
+    return ok(dctB).reduce(
+            (a, k) => (a[`B_${k}`] = dctB[k]) && a,
+            ok(dctA).reduce(
+                (a, k) => (a[`A_${k}`] = dctA[k]) && a, {}
+            )
+        );
+  };
+
+  return hJoin(hash1, hash2, 'name=character');
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
new file mode 100644
index 0000000000..7cfd2e6caa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -0,0 +1,155 @@
+---
+id: 595b98f8b5a2245e243aa831
+title: Heronian triangles
+challengeType: 5
+forumTopicId: 302285
+dashedName: heronian-triangles
+---
+
+# --description--
+
+[Hero's formula](<https://en.wikipedia.org/wiki/Heron's formula> "wp: Heron's formula") for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
+
+$A = \\sqrt{s(s-a)(s-b)(s-c)},$
+
+where `s` is half the perimeter of the triangle; that is,
+
+$s=\\frac{a+b+c}{2}.$
+
+Heronian triangles are triangles whose sides and area are all integers.
+
+An example is the triangle with sides `3, 4, 5` whose area is `6` (and whose perimeter is `12`).
+
+Note that any triangle whose sides are all an integer multiple of `3, 4, 5`; such as `6, 8, 10,` will also be a Heronian triangle.
+
+Define a Primitive Heronian triangle as a Heronian triangle where the greatest common divisor
+
+of all three sides is `1` (unity).
+
+This will exclude, for example, triangle `6, 8, 10.`
+
+# --instructions--
+
+Implement a function based on Hero's formula that returns the first <code>n<sub>th</sub></code> ordered triangles in an array of arrays.
+
+# --hints--
+
+`heronianTriangle` should be a function.
+
+```js
+assert(typeof heronianTriangle === 'function');
+```
+
+`heronianTriangle(10)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17]]`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[0]), res[0]);
+```
+
+`heronianTriangle(15)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15]],`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[1]), res[1]);
+```
+
+`heronianTriangle(20)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53]],`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[2]), res[2]);
+```
+
+`heronianTriangle(25)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53], [19, 20, 37],[16, 17, 17], [17, 17, 30], [16, 25, 39], [13, 20, 21]]`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[3]), res[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [10, 15, 20, 25];
+
+const res = [
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53], [19, 20, 37], [16, 17, 17], [17, 17, 30], [16, 25, 39], [13, 20, 21]]
+];
+```
+
+## --seed-contents--
+
+```js
+function heronianTriangle(n) {
+
+
+  return [];
+}
+```
+
+# --solutions--
+
+```js
+function heronianTriangle(n) {
+  const list = [];
+  const result = [];
+
+  let j = 0;
+  for (let c = 1; c <= 200; c++) {
+    for (let b = 1; b <= c; b++) {
+      for (let a = 1; a <= b; a++) {
+        if (gcd(gcd(a, b), c) === 1 && isHeron(heronArea(a, b, c))) {
+          list[j++] = new Array(a, b, c, heronArea(a, b, c));
+        }
+      }
+    }
+  }
+
+  sort(list);
+
+  for (let i = 0; i < n; i++) {
+    result[i] = [list[i][0], list[i][1], list[i][2]];
+  }
+
+  return result;
+
+  function heronArea(a, b, c) {
+    const s = (a + b + c) / 2;
+    return Math.sqrt(s * (s - a) * (s - b) * (s - c));
+  }
+
+  function isHeron(h) { return h % 1 === 0 && h > 0; }
+
+  function gcd(a, b) {
+    let leftover = 1;
+    let dividend = a > b ? a : b;
+    let divisor = a > b ? b : a;
+    while (leftover !== 0) {
+      leftover = dividend % divisor;
+      if (leftover > 0) {
+        dividend = divisor;
+        divisor = leftover;
+      }
+    }
+    return divisor;
+  }
+
+  function sort(arg) {
+    let swapped = true;
+    let temp = [];
+    while (swapped) {
+      swapped = false;
+      for (let i = 1; i < arg.length; i++) {
+        if (arg[i][4] < arg[i - 1][4] || arg[i][4] === arg[i - 1][4] && arg[i][3] < arg[i - 1][3]) {
+          temp = arg[i];
+          arg[i] = arg[i - 1];
+          arg[i - 1] = temp;
+          swapped = true;
+        }
+      }
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
new file mode 100644
index 0000000000..1b5b864eda
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -0,0 +1,166 @@
+---
+id: 59622f89e4e137560018a40e
+title: Hofstadter Figure-Figure sequences
+challengeType: 5
+forumTopicId: 302286
+dashedName: hofstadter-figure-figure-sequences
+---
+
+# --description--
+
+These two sequences of positive integers are defined as:
+
+$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+
+The sequence $S(n)$ is further defined as the sequence of positive integers not present in $R(n)$.
+
+Sequence $R$ starts:
+
+<pre>1, 3, 7, 12, 18, ...</pre>
+
+Sequence $S$ starts:
+
+<pre>2, 4, 5, 6, 8, ...</pre>
+
+# --instructions--
+
+Create two functions named `ffr` and `ffs` that when given `n` return `R(n)` or `S(n)` respectively. (Note that R(1) = 1 and S(1) = 2 to avoid off-by-one errors).
+
+No maximum value for `n` should be assumed.
+
+**References**
+
+<ul>
+  <li>
+    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> and <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
+  </li>
+  <li>
+    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
+  </li>
+</ul>
+
+# --hints--
+
+`ffr` should be a function.
+
+```js
+assert(typeof ffr === 'function');
+```
+
+`ffs` should be a function.
+
+```js
+assert(typeof ffs === 'function');
+```
+
+`ffr` should return integer.
+
+```js
+assert(Number.isInteger(ffr(1)));
+```
+
+`ffs` should return integer.
+
+```js
+assert(Number.isInteger(ffs(1)));
+```
+
+`ffr(10)` should return `69`
+
+```js
+assert.equal(ffr(ffrParamRes[0][0]), ffrParamRes[0][1]);
+```
+
+`ffr(50)` should return `1509`
+
+```js
+assert.equal(ffr(ffrParamRes[1][0]), ffrParamRes[1][1]);
+```
+
+`ffr(100)` should return `5764`
+
+```js
+assert.equal(ffr(ffrParamRes[2][0]), ffrParamRes[2][1]);
+```
+
+`ffr(1000)` should return `526334`
+
+```js
+assert.equal(ffr(ffrParamRes[3][0]), ffrParamRes[3][1]);
+```
+
+`ffs(10)` should return `14`
+
+```js
+assert.equal(ffs(ffsParamRes[0][0]), ffsParamRes[0][1]);
+```
+
+`ffs(50)` should return `59`
+
+```js
+assert.equal(ffs(ffsParamRes[1][0]), ffsParamRes[1][1]);
+```
+
+`ffs(100)` should return `112`
+
+```js
+assert.equal(ffs(ffsParamRes[2][0]), ffsParamRes[2][1]);
+```
+
+`ffs(1000)` should return `1041`
+
+```js
+assert.equal(ffs(ffsParamRes[3][0]), ffsParamRes[3][1]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ffrParamRes = [[10, 69], [50, 1509], [100, 5764], [1000, 526334]];
+const ffsParamRes = [[10, 14], [50, 59], [100, 112], [1000, 1041]];
+```
+
+## --seed-contents--
+
+```js
+function ffr(n) {
+  return n;
+}
+
+function ffs(n) {
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+const R = [null, 1];
+const S = [null, 2];
+
+function extendSequences (n) {
+  let current = Math.max(R[R.length - 1], S[S.length - 1]);
+  let i;
+  while (R.length <= n || S.length <= n) {
+    i = Math.min(R.length, S.length) - 1;
+    current += 1;
+    if (current === R[i] + S[i]) {
+      R.push(current);
+    } else {
+      S.push(current);
+    }
+  }
+}
+
+function ffr (n) {
+  extendSequences(n);
+  return R[n];
+}
+
+function ffs (n) {
+  extendSequences(n);
+  return S[n];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
new file mode 100644
index 0000000000..06d4fb69b2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -0,0 +1,92 @@
+---
+id: 59637c4d89f6786115efd814
+title: Hofstadter Q sequence
+challengeType: 5
+forumTopicId: 302287
+dashedName: hofstadter-q-sequence
+---
+
+# --description--
+
+The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
+
+$Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
+
+It is defined like the [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence> "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+
+# --instructions--
+
+Implement the Hofstadter Q Sequence equation as a function. The function should accept number, `n`, and return an integer.
+
+# --hints--
+
+`hofstadterQ` should be a function.
+
+```js
+assert(typeof hofstadterQ === 'function');
+```
+
+`hofstadterQ()` should return `integer`
+
+```js
+assert(Number.isInteger(hofstadterQ(1000)));
+```
+
+`hofstadterQ(1000)` should return `502`
+
+```js
+assert.equal(hofstadterQ(testCase[0]), res[0]);
+```
+
+`hofstadterQ(1500)` should return `755`
+
+```js
+assert.equal(hofstadterQ(testCase[1]), res[1]);
+```
+
+`hofstadterQ(2000)` should return `1005`
+
+```js
+assert.equal(hofstadterQ(testCase[2]), res[2]);
+```
+
+`hofstadterQ(2500)` should return `1261`
+
+```js
+assert.equal(hofstadterQ(testCase[3]), res[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCase = [1000, 1500, 2000, 2500];
+const res = [502, 755, 1005, 1261];
+```
+
+## --seed-contents--
+
+```js
+function hofstadterQ(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function hofstadterQ (n) {
+  const memo = [1, 1, 1];
+  const Q = function (i) {
+    let result = memo[i];
+    if (typeof result !== 'number') {
+      result = Q(i - Q(i - 1)) + Q(i - Q(i - 2));
+      memo[i] = result;
+    }
+    return result;
+  };
+  return Q(n);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
new file mode 100644
index 0000000000..9fd1d6f6f6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -0,0 +1,101 @@
+---
+id: 5a23c84252665b21eecc7eb0
+title: I before E except after C
+challengeType: 5
+forumTopicId: 302288
+dashedName: i-before-e-except-after-c
+---
+
+# --description--
+
+The phrase ["I before E, except after C"](<https://en.wikipedia.org/wiki/I before E except after C>) is a widely known mnemonic which is supposed to help when spelling English words.
+
+Using the words provided, check if the two sub-clauses of the phrase are plausible individually:
+
+<ol>
+  <li>
+    <i>"I before E when not preceded by C".</i>
+  </li>
+  <li>
+    <i>"E before I when preceded by C".</i>
+  </li>
+</ol>
+
+If both sub-phrases are plausible then the original phrase can be said to be plausible.
+
+# --instructions--
+
+Write a function that accepts a word and check if the word follows this rule. The function should return true if the word follows the rule and false if it does not.
+
+# --hints--
+
+`IBeforeExceptC` should be a function.
+
+```js
+assert(typeof IBeforeExceptC == 'function');
+```
+
+`IBeforeExceptC("receive")` should return a boolean.
+
+```js
+assert(typeof IBeforeExceptC('receive') == 'boolean');
+```
+
+`IBeforeExceptC("receive")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('receive'), true);
+```
+
+`IBeforeExceptC("science")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('science'), false);
+```
+
+`IBeforeExceptC("imperceivable")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('imperceivable'), true);
+```
+
+`IBeforeExceptC("inconceivable")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('inconceivable'), true);
+```
+
+`IBeforeExceptC("insufficient")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('insufficient'), false);
+```
+
+`IBeforeExceptC("omniscient")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('omniscient'), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function IBeforeExceptC(word) {
+
+}
+```
+
+# --solutions--
+
+```js
+function IBeforeExceptC(word)
+{
+    if(word.indexOf("c")==-1 && word.indexOf("ie")!=-1)
+        return true;
+    else if(word.indexOf("cei")!=-1)
+        return true;
+    return false;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iban.md
new file mode 100644
index 0000000000..666c50a6be
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iban.md
@@ -0,0 +1,104 @@
+---
+id: 5a23c84252665b21eecc7eaf
+title: IBAN
+challengeType: 5
+forumTopicId: 302289
+dashedName: iban
+---
+
+# --description--
+
+The [International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+
+The IBAN consists of up to 34 alphanumeric characters:
+
+<ul>
+  <li>first the two-letter ISO 3166-1 alpha-2 country code</li>
+  <li>then two check digits, and</li>
+  <li>finally a country-specific Basic Bank Account Number (BBAN).</li>
+</ul>
+
+The check digits enable a sanity check of the bank account number to confirm its integrity even before submitting a transaction.
+
+# --instructions--
+
+Write a function that takes IBAN string as parameter. If it is valid return true. Otherwise, return false.
+
+# --hints--
+
+`isValid` should be a function.
+
+```js
+assert(typeof isValid == 'function');
+```
+
+`isValid("GB82 WEST 1234 5698 7654 32")` should return a boolean.
+
+```js
+assert(typeof isValid('GB82 WEST 1234 5698 7654 32') == 'boolean');
+```
+
+`isValid("GB82 WEST 1234 5698 7654 32")` should return `true`.
+
+```js
+assert.equal(isValid('GB82 WEST 1234 5698 7654 32'), true);
+```
+
+`isValid("GB82 WEST 1.34 5698 7654 32")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 WEST 1.34 5698 7654 32'), false);
+```
+
+`isValid("GB82 WEST 1234 5698 7654 325")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 WEST 1234 5698 7654 325'), false);
+```
+
+`isValid("GB82 TEST 1234 5698 7654 32")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 TEST 1234 5698 7654 32'), false);
+```
+
+`isValid("SA03 8000 0000 6080 1016 7519")` should return `true`.
+
+```js
+assert.equal(isValid('SA03 8000 0000 6080 1016 7519'), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isValid(iban) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isValid(iban) {
+  var ibanLen = {
+    NO:15, BE:16, DK:18, FI:18, FO:18, GL:18, NL:18, MK:19,
+    SI:19, AT:20, BA:20, EE:20, KZ:20, LT:20, LU:20, CR:21,
+    CH:21, HR:21, LI:21, LV:21, BG:22, BH:22, DE:22, GB:22,
+    GE:22, IE:22, ME:22, RS:22, AE:23, GI:23, IL:23, AD:24,
+    CZ:24, ES:24, MD:24, PK:24, RO:24, SA:24, SE:24, SK:24,
+    VG:24, TN:24, PT:25, IS:26, TR:26, FR:27, GR:27, IT:27,
+    MC:27, MR:27, SM:27, AL:28, AZ:28, CY:28, DO:28, GT:28,
+    HU:28, LB:28, PL:28, BR:29, PS:29, KW:30, MU:30, MT:31
+  }
+    iban = __helpers.removeWhiteSpace(iban)
+    if (!iban.match(/^[\dA-Z]+$/)) return false
+    var len = iban.length
+    if (len != ibanLen[iban.substr(0,2)]) return false
+    iban = iban.substr(4) + iban.substr(0,4)
+    for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
+    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    return m == 1
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/identity-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/identity-matrix.md
new file mode 100644
index 0000000000..a8465da648
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/identity-matrix.md
@@ -0,0 +1,88 @@
+---
+id: 5a23c84252665b21eecc7eb1
+title: Identity matrix
+challengeType: 5
+forumTopicId: 302290
+dashedName: identity-matrix
+---
+
+# --description--
+
+An *identity matrix* is a square matrix of size \\( n \\times n \\), where the diagonal elements are all `1`s (ones), and all the other elements are all `0`s (zeroes).
+
+<ul>
+  <li style='list-style: none;'>\(\displaystyle I_{n}=\begin{bmatrix} 1 &#x26; 0 &#x26; 0 \cr 0 &#x26; 1 &#x26; 0 \cr 0 &#x26; 0 &#x26; 1 \cr \end{bmatrix}\)</li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a number `n` as a parameter and returns the identity matrix of order \\( n \\times n \\).
+
+# --hints--
+
+`idMatrix` should be a function.
+
+```js
+assert(typeof idMatrix == 'function');
+```
+
+`idMatrix(1)` should return an array.
+
+```js
+assert(Array.isArray(idMatrix(1)));
+```
+
+`idMatrix(1)` should return `[ [ 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(1), results[0]);
+```
+
+`idMatrix(2)` should return `[ [ 1, 0 ], [ 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(2), results[1]);
+```
+
+`idMatrix(3)` should return `[ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(3), results[2]);
+```
+
+`idMatrix(4)` should return `[ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(4), results[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let results=[[ [ 1 ] ],
+[ [ 1, 0 ], [ 0, 1 ] ],
+[ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
+[ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ]]
+```
+
+## --seed-contents--
+
+```js
+function idMatrix(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function idMatrix(n) {
+    return Array.apply(null, new Array(n)).map(function (x, i, xs) {
+        return xs.map(function (_, k) {
+            return i === k ? 1 : 0;
+        })
+    });
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
new file mode 100644
index 0000000000..bbed591151
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
@@ -0,0 +1,96 @@
+---
+id: 5a23c84252665b21eecc7ec1
+title: Iterated digits squaring
+challengeType: 5
+forumTopicId: 302291
+dashedName: iterated-digits-squaring
+---
+
+# --description--
+
+If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89:
+
+<pre>15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89
+7 -> 49 -> 97 -> 130 -> 10 -> 1
+</pre>
+
+# --instructions--
+
+Write a function that takes a number as a parameter and returns 1 or 89 after performing the mentioned process.
+
+# --hints--
+
+`iteratedSquare` should be a function.
+
+```js
+assert(typeof iteratedSquare == 'function');
+```
+
+`iteratedSquare(4)` should return a number.
+
+```js
+assert(typeof iteratedSquare(4) == 'number');
+```
+
+`iteratedSquare(4)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(4), 89);
+```
+
+`iteratedSquare(7)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(7), 1);
+```
+
+`iteratedSquare(15)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(15), 89);
+```
+
+`iteratedSquare(20)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(20), 89);
+```
+
+`iteratedSquare(70)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(70), 1);
+```
+
+`iteratedSquare(100)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(100), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function iteratedSquare(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function iteratedSquare(n) {
+    var total;
+    while (n != 89 && n != 1) {
+        total = 0;
+        while (n > 0) {
+            total += Math.pow(n % 10, 2);
+            n = Math.floor(n/10);
+        }
+        n = total;
+    }
+    return n;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jaro-distance.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jaro-distance.md
new file mode 100644
index 0000000000..d348acaee7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jaro-distance.md
@@ -0,0 +1,146 @@
+---
+id: 5a23c84252665b21eecc7ec2
+title: Jaro distance
+challengeType: 5
+forumTopicId: 302292
+dashedName: jaro-distance
+---
+
+# --description--
+
+The Jaro distance is a measure of similarity between two strings. The higher the Jaro distance for two strings is, the more similar the strings are. The score is normalized such that `0` equates to no similarity and `1` is an exact match.
+
+**Definition**
+
+The Jaro distance \\( d_j \\) of two given strings \\(s_1\\) and \\(s_2\\) is
+
+\\begin{align}d_j = \\begin{cases}0& & \\text{if }m=0 \\\\\\\\{\\frac {1}{3}}\\left({\\frac {m}{|s\_{1}|}}+{\\frac {m}{|s\_{2}|}}+{\\frac {m-t}{m}}\\right)& & \\text{otherwise}\\end{cases}\\end{align}
+
+Where:
+
+<ul>
+  <li>\(m\) is the number of <i>matching characters</i>;</li>
+  <li> \(t\) is half the number of <i>transpositions</i>.</li>
+</ul>
+
+Two characters from \\(s_1\\) and \\(s_2\\) respectively, are considered *matching* only if they are the same and not farther than \\(\\left\\lfloor\\frac{\\max(|s_1|,|s_2|)}{2}\\right\\rfloor-1\\).
+
+Each character of \\(s_1\\) is compared with all its matching characters in \\(s_2\\) . The number of matching (but different sequence order) characters divided by 2 defines the number of *transpositions*.
+
+**Example**
+
+Given the strings \\(s_1\\) *DWAYNE* and \\(s_2\\) *DUANE* we find:
+
+<ul>
+  <li>\(m = 4\)</li>
+  <li>\(|s_1| = 6\)</li>
+  <li>\(|s_2| = 5\)</li>
+  <li>\(t = 0\)</li>
+</ul>
+
+We find a Jaro score of: \\(d_j = \\frac{1}{3}\\left(\\frac{4}{6} + \\frac{4}{5} + \\frac{4-0}{4}\\right) = 0.822\\).
+
+# --instructions--
+
+Write a function a that takes two strings as parameters and returns the associated Jaro distance.
+
+# --hints--
+
+`jaro` should be a function.
+
+```js
+assert(typeof jaro == 'function');
+```
+
+`jaro("MARTHA", "MARHTA")` should return a number.
+
+```js
+assert(typeof jaro('MARTHA', 'MARHTA') == 'number');
+```
+
+`jaro("MARTHA", "MARHTA")` should return `0.9444444444444445`.
+
+```js
+assert.equal(jaro('MARTHA', 'MARHTA'), 0.9444444444444445);
+```
+
+`jaro("DIXON", "DICKSONX")` should return `0.7666666666666666`.
+
+```js
+assert.equal(jaro('DIXON', 'DICKSONX'), 0.7666666666666666);
+```
+
+`jaro("JELLYFISH", "SMELLYFISH")` should return `0.8962962962962964`.
+
+```js
+assert.equal(jaro('JELLYFISH', 'SMELLYFISH'), 0.8962962962962964);
+```
+
+`jaro("HELLOS", "CHELLO")` should return `0.888888888888889`.
+
+```js
+assert.equal(jaro('HELLOS', 'CHELLO'), 0.888888888888889);
+```
+
+`jaro("ABCD", "BCDA")` should return `0.8333333333333334`.
+
+```js
+assert.equal(jaro('ABCD', 'BCDA'), 0.8333333333333334);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function jaro(s, t) {
+
+}
+```
+
+# --solutions--
+
+```js
+function jaro(s, t) {
+  var s_len = s.length;
+  var t_len = t.length;
+
+  if (s_len == 0 && t_len == 0) return 1;
+
+  var match_distance = Math.max(s_len, t_len) / 2 - 1;
+
+  var s_matches = new Array(s_len);
+  var t_matches = new Array(t_len);
+
+  var matches = 0;
+  var transpositions = 0;
+
+  for (var i = 0; i < s_len; i++) {
+    var start = Math.max(0, i - match_distance);
+    var end = Math.min(i + match_distance + 1, t_len);
+
+    for (var j = start; j < end; j++) {
+      if (t_matches[j]) continue;
+      if (s.charAt(i) != t.charAt(j)) continue;
+      s_matches[i] = true;
+      t_matches[j] = true;
+      matches++;
+      break;
+    }
+  }
+
+  if (matches == 0) return 0;
+
+  var k = 0;
+  for (var i = 0; i < s_len; i++) {
+    if (!s_matches[i]) continue;
+    while (!t_matches[k]) k++;
+    if (s.charAt(i) != t.charAt(k)) transpositions++;
+    k++;
+  }
+
+  return ((matches / s_len) +
+    (matches / t_len) +
+    ((matches - transpositions / 2.0) / matches)) / 3.0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jortsort.md
new file mode 100644
index 0000000000..0f121b99ee
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -0,0 +1,90 @@
+---
+id: 5a23c84252665b21eecc7ec4
+title: JortSort
+challengeType: 5
+forumTopicId: 302293
+dashedName: jortsort
+---
+
+# --description--
+
+jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+
+jortSort should be a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
+
+# --hints--
+
+`jortsort` should be a function.
+
+```js
+assert(typeof jortsort == 'function');
+```
+
+`jortsort([1,2,3,4,5])` should return a boolean.
+
+```js
+assert(typeof jortsort([1, 2, 3, 4, 5]) == 'boolean');
+```
+
+`jortsort([1,2,3,4,5])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 2, 3, 4, 5]), true);
+```
+
+`jortsort([1,2,13,4,5])` should return `false`.
+
+```js
+assert.equal(jortsort([1, 2, 13, 4, 5]), false);
+```
+
+`jortsort([12,4,51,2,4])` should return `false`.
+
+```js
+assert.equal(jortsort([12, 4, 51, 2, 4]), false);
+```
+
+`jortsort([1,2])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 2]), true);
+```
+
+`jortsort([5,4,3,2,1])` should return `false`.
+
+```js
+assert.equal(jortsort([5, 4, 3, 2, 1]), false);
+```
+
+`jortsort([1,1,1,1,1])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 1, 1, 1, 1]), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function jortsort(array) {
+
+}
+```
+
+# --solutions--
+
+```js
+function jortsort(array) {
+  // sort the array
+  var originalArray = array.slice(0);
+  array.sort( function(a,b){return a - b} );
+
+  // compare to see if it was originally sorted
+  for (var i = 0; i < originalArray.length; ++i) {
+    if (originalArray[i] !== array[i]) return false;
+  }
+
+  return true;
+};
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/josephus-problem.md
new file mode 100644
index 0000000000..245b3ed352
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -0,0 +1,98 @@
+---
+id: 5a23c84252665b21eecc7ec5
+title: Josephus problem
+challengeType: 5
+forumTopicId: 302294
+dashedName: josephus-problem
+---
+
+# --description--
+
+[Josephus problem](<https://en.wikipedia.org/wiki/Josephus problem>) is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
+
+An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him.
+
+As the process goes on, the circle becomes smaller and smaller, until only one prisoner remains, who is then freed.
+
+For example, if there are $n=5$ prisoners and $k=2$, the order the prisoners are killed in (let's call it the "killing sequence") will be 1, 3, 0, and 4, and the survivor will be #2.
+
+Given any $n, k > 0$, find out which prisoner will be the final survivor.
+
+In one such incident, there were 41 prisoners and every 3<sup>rd</sup> prisoner was being killed ($k=3$).
+
+Among them was a clever chap name Josephus who worked out the problem, stood at the surviving position, and lived on to tell the tale.
+
+Which number was he?
+
+# --instructions--
+
+Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
+
+# --hints--
+
+`josephus` should be a function.
+
+```js
+assert(typeof josephus == 'function');
+```
+
+`josephus(30,3)` should return a number.
+
+```js
+assert(typeof josephus(30, 3) == 'number');
+```
+
+`josephus(30,3)` should return `28`.
+
+```js
+assert.equal(josephus(30, 3), 28);
+```
+
+`josephus(30,5)` should return `2`.
+
+```js
+assert.equal(josephus(30, 5), 2);
+```
+
+`josephus(20,2)` should return `8`.
+
+```js
+assert.equal(josephus(20, 2), 8);
+```
+
+`josephus(17,6)` should return `1`.
+
+```js
+assert.equal(josephus(17, 6), 1);
+```
+
+`josephus(29,4)` should return `1`.
+
+```js
+assert.equal(josephus(29, 4), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function josephus(init, kill) {
+
+}
+```
+
+# --solutions--
+
+```js
+function josephus(init, kill) {
+  const arr = Array.from(Array(init).keys());
+  let curr = -1
+  while (arr.length > 1) {
+    curr = (curr + kill) % arr.length;
+    arr.splice(curr, 1);
+    curr--;
+  }
+  return arr[0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/k-d-tree.md
new file mode 100644
index 0000000000..5cb0e1f78f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -0,0 +1,469 @@
+---
+id: 5a23c84252665b21eecc7ecb
+title: K-d tree
+challengeType: 5
+forumTopicId: 302295
+dashedName: k-d-tree
+---
+
+# --description--
+
+A k-d tree (short for *k*-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees. k-d trees are not suitable, however, for efficiently finding the nearest neighbor in high dimensional spaces. As a general rule, if the dimensionality is *k*, the number of points in the data, *N*, should be *N* ≫ 2<sup><i>k</i></sup>. Otherwise, when k-d trees are used with high-dimensional data, most of the points in the tree will be evaluated and the efficiency is no better than exhaustive search, and other methods such as approximate nearest-neighbor are used instead.
+
+# --instructions--
+
+Write a function to perform a nearest neighbour search using k-d tree. The function takes two parameters: an array of k-dimensional points, and a single k-dimensional point whose nearest neighbour should be returned by the function. A k-dimensional point will be given as an array of k elements.
+
+# --hints--
+
+`kdNN` should be a function.
+
+```js
+assert(typeof kdNN == 'function');
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [9, 2])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    kdNN(
+      [
+        [2, 3],
+        [5, 4],
+        [9, 6],
+        [4, 7],
+        [8, 1],
+        [7, 2]
+      ],
+      [9, 2]
+    )
+  )
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [9, 2])` should return `[ 8, 1 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [9, 2]
+  ),
+  [8, 1]
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [7, 1])` should return `[ 8, 1 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [7, 1]
+  ),
+  [8, 1]
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [3, 2])` should return `[ 2, 3 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [3, 2]
+  ),
+  [2, 3]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [1, 2, 3])` should return `[ 1, 2, 5 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [1, 2, 3]
+  ),
+  [1, 2, 5]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [4, 5, 6])` should return `[ 4, 6, 7 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [4, 5, 6]
+  ),
+  [4, 6, 7]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [8, 8, 8])` should return `[ 7, 8, 9 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [8, 8, 8]
+  ),
+  [7, 8, 9]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function kdNN(fpoints, fpoint) {
+
+}
+```
+
+# --solutions--
+
+```js
+function kdNN(fpoints, fpoint) {
+  function Node(obj, dimension, parent) {
+    this.obj = obj;
+    this.left = null;
+    this.right = null;
+    this.parent = parent;
+    this.dimension = dimension;
+  }
+
+  function kdTree(points, metric, dimensions) {
+    var self = this;
+
+    function buildTree(points, depth, parent) {
+      var dim = depth % dimensions.length,
+        median,
+        node;
+
+      if (points.length === 0) {
+        return null;
+      }
+      if (points.length === 1) {
+        return new Node(points[0], dim, parent);
+      }
+
+      points.sort(function(a, b) {
+        return a[dimensions[dim]] - b[dimensions[dim]];
+      });
+
+      median = Math.floor(points.length / 2);
+      node = new Node(points[median], dim, parent);
+      node.left = buildTree(points.slice(0, median), depth + 1, node);
+      node.right = buildTree(points.slice(median + 1), depth + 1, node);
+
+      return node;
+    }
+
+    this.root = buildTree(points, 0, null);
+
+    this.insert = function(point) {
+      function innerSearch(node, parent) {
+        if (node === null) {
+          return parent;
+        }
+
+        var dimension = dimensions[node.dimension];
+        if (point[dimension] < node.obj[dimension]) {
+          return innerSearch(node.left, node);
+        } else {
+          return innerSearch(node.right, node);
+        }
+      }
+
+      var insertPosition = innerSearch(this.root, null),
+        newNode,
+        dimension;
+
+      if (insertPosition === null) {
+        this.root = new Node(point, 0, null);
+        return;
+      }
+
+      newNode = new Node(
+        point,
+        (insertPosition.dimension + 1) % dimensions.length,
+        insertPosition
+      );
+      dimension = dimensions[insertPosition.dimension];
+
+      if (point[dimension] < insertPosition.obj[dimension]) {
+        insertPosition.left = newNode;
+      } else {
+        insertPosition.right = newNode;
+      }
+    };
+
+    this.nearest = function(point, maxNodes, maxDistance) {
+      var i, result, bestNodes;
+
+      bestNodes = new BinaryHeap(function(e) {
+        return -e[1];
+      });
+
+      function nearestSearch(node) {
+        var bestChild,
+          dimension = dimensions[node.dimension],
+          ownDistance = metric(point, node.obj),
+          linearPoint = {},
+          linearDistance,
+          otherChild,
+          i;
+
+        function saveNode(node, distance) {
+          bestNodes.push([node, distance]);
+          if (bestNodes.size() > maxNodes) {
+            bestNodes.pop();
+          }
+        }
+
+        for (i = 0; i < dimensions.length; i += 1) {
+          if (i === node.dimension) {
+            linearPoint[dimensions[i]] = point[dimensions[i]];
+          } else {
+            linearPoint[dimensions[i]] = node.obj[dimensions[i]];
+          }
+        }
+
+        linearDistance = metric(linearPoint, node.obj);
+
+        if (node.right === null && node.left === null) {
+          if (
+            bestNodes.size() < maxNodes ||
+            ownDistance < bestNodes.peek()[1]
+          ) {
+            saveNode(node, ownDistance);
+          }
+          return;
+        }
+
+        if (node.right === null) {
+          bestChild = node.left;
+        } else if (node.left === null) {
+          bestChild = node.right;
+        } else {
+          if (point[dimension] < node.obj[dimension]) {
+            bestChild = node.left;
+          } else {
+            bestChild = node.right;
+          }
+        }
+
+        nearestSearch(bestChild);
+
+        if (bestNodes.size() < maxNodes || ownDistance < bestNodes.peek()[1]) {
+          saveNode(node, ownDistance);
+        }
+
+        if (
+          bestNodes.size() < maxNodes ||
+          Math.abs(linearDistance) < bestNodes.peek()[1]
+        ) {
+          if (bestChild === node.left) {
+            otherChild = node.right;
+          } else {
+            otherChild = node.left;
+          }
+          if (otherChild !== null) {
+            nearestSearch(otherChild);
+          }
+        }
+      }
+
+      if (maxDistance) {
+        for (i = 0; i < maxNodes; i += 1) {
+          bestNodes.push([null, maxDistance]);
+        }
+      }
+
+      if (self.root) nearestSearch(self.root);
+
+      result = [];
+
+      for (i = 0; i < Math.min(maxNodes, bestNodes.content.length); i += 1) {
+        if (bestNodes.content[i][0]) {
+          result.push([bestNodes.content[i][0].obj, bestNodes.content[i][1]]);
+        }
+      }
+      return result;
+    };
+  }
+
+  function BinaryHeap(scoreFunction) {
+    this.content = [];
+    this.scoreFunction = scoreFunction;
+  }
+
+  BinaryHeap.prototype = {
+    push: function(element) {
+      // Add the new element to the end of the array.
+      this.content.push(element);
+      // Allow it to bubble up.
+      this.bubbleUp(this.content.length - 1);
+    },
+
+    pop: function() {
+      // Store the first element so we can return it later.
+      var result = this.content[0];
+      // Get the element at the end of the array.
+      var end = this.content.pop();
+      // If there are any elements left, put the end element at the
+      // start, and let it sink down.
+      if (this.content.length > 0) {
+        this.content[0] = end;
+        this.sinkDown(0);
+      }
+      return result;
+    },
+
+    peek: function() {
+      return this.content[0];
+    },
+
+    size: function() {
+      return this.content.length;
+    },
+
+    bubbleUp: function(n) {
+      // Fetch the element that has to be moved.
+      var element = this.content[n];
+      // When at 0, an element can not go up any further.
+      while (n > 0) {
+        // Compute the parent element's index, and fetch it.
+        var parentN = Math.floor((n + 1) / 2) - 1,
+          parent = this.content[parentN];
+        // Swap the elements if the parent is greater.
+        if (this.scoreFunction(element) < this.scoreFunction(parent)) {
+          this.content[parentN] = element;
+          this.content[n] = parent;
+          // Update 'n' to continue at the new position.
+          n = parentN;
+        }
+        // Found a parent that is less, no need to move it further.
+        else {
+          break;
+        }
+      }
+    },
+
+    sinkDown: function(n) {
+      // Look up the target element and its score.
+      var length = this.content.length,
+        element = this.content[n],
+        elemScore = this.scoreFunction(element);
+
+      while (true) {
+        // Compute the indices of the child elements.
+        var child2N = (n + 1) * 2,
+          child1N = child2N - 1;
+        // This is used to store the new position of the element,
+        // if any.
+        var swap = null;
+        // If the first child exists (is inside the array)...
+        if (child1N < length) {
+          // Look it up and compute its score.
+          var child1 = this.content[child1N],
+            child1Score = this.scoreFunction(child1);
+          // If the score is less than our element's, we need to swap.
+          if (child1Score < elemScore) swap = child1N;
+        }
+        // Do the same checks for the other child.
+        if (child2N < length) {
+          var child2 = this.content[child2N],
+            child2Score = this.scoreFunction(child2);
+          if (child2Score < (swap == null ? elemScore : child1Score)) {
+            swap = child2N;
+          }
+        }
+
+        // If the element needs to be moved, swap it, and continue.
+        if (swap != null) {
+          this.content[n] = this.content[swap];
+          this.content[swap] = element;
+          n = swap;
+        }
+        // Otherwise, we are done.
+        else {
+          break;
+        }
+      }
+    }
+  };
+
+  var dims = [];
+
+  for (var i = 0; i < fpoint.length; i++) dims.push(i);
+
+  var tree = new kdTree(
+    fpoints,
+    function(e1, e2) {
+      var d = 0;
+      var e3 = e1;
+      if (!Array.isArray(e1)) {
+        e3 = [];
+        for (var key in e1) e3.push(e1[key]);
+
+        e1 = e3;
+      }
+      e1.forEach(function(e, i) {
+        var sqd = e1[i] - e2[i];
+        d += sqd * sqd;
+      });
+      return d;
+    },
+    dims
+  );
+
+  return tree.nearest(fpoint, 1, 1000)[0][0];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
new file mode 100644
index 0000000000..59e368bc52
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -0,0 +1,110 @@
+---
+id: 5a23c84252665b21eecc7eca
+title: Kaprekar numbers
+challengeType: 5
+forumTopicId: 302296
+dashedName: kaprekar-numbers
+---
+
+# --description--
+
+A positive integer is a [Kaprekar number](<https://en.wikipedia.org/wiki/Kaprekar number>) if:
+
+<ul>
+  <li>It is 1, or,</li>
+  <li>The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. </li>
+</ul>
+
+Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.Example
+
+Kaprekar numbers:
+
+<ul>
+  <li><code>2223</code> is a Kaprekar number, as <code>2223 * 2223 = 4941729</code>, <code>4941729</code> may be split to <code>494</code> and <code>1729</code>, and <code>494 + 1729 = 2223</code></li>
+  <li>The series of Kaprekar numbers is known as <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, and begins as <code>1, 9, 45, 55, ...</code></li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a number $n$, a base $bs$, and returns true if the number is a Kaprekar number for the given base. Otherwise, the function returns false.
+
+# --hints--
+
+`isKaprekar` should be a function.
+
+```js
+assert(typeof isKaprekar == 'function');
+```
+
+`isKaprekar(1, 10)` should return a boolean.
+
+```js
+assert(typeof isKaprekar(1, 10) == 'boolean');
+```
+
+`isKaprekar(1, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(1, 10), true);
+```
+
+`isKaprekar(9, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(9, 10), true);
+```
+
+`isKaprekar(2223, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(2223, 10), true);
+```
+
+`isKaprekar(22823, 10)` should return `false`.
+
+```js
+assert.equal(isKaprekar(22823, 10), false);
+```
+
+`isKaprekar(9, 17)` should return `false`.
+
+```js
+assert.equal(isKaprekar(9, 17), false);
+```
+
+`isKaprekar(225, 17)` should return `true`.
+
+```js
+assert.equal(isKaprekar(225, 17), true);
+```
+
+`isKaprekar(999, 17)` should return `false`.
+
+```js
+assert.equal(isKaprekar(999, 17), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isKaprekar(n, bs) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isKaprekar(n, bs) {
+  if (n < 1) return false;
+  if (n == 1) return true;
+  for (var a = n * n, b = 0, s = 1; a; s *= bs) {
+    b += (a % bs) * s;
+    a = Math.floor(a / bs);
+    if (b && a + b == n) return true;
+  }
+  return false;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
new file mode 100644
index 0000000000..4112f63fb2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
@@ -0,0 +1,255 @@
+---
+id: 5a23c84252665b21eecc7ed1
+title: Knapsack problem/0-1
+challengeType: 5
+forumTopicId: 323649
+dashedName: knapsack-problem0-1
+---
+
+# --description--
+
+The 0-1 knapsack problem is defined as follows:
+
+You are given an array of objects representing items to be put in a knapsack. The objects have 3 attributes: name, weight, and value. The items need to be selected so that the total weight does not exceed the maximum weight and the value is maximized.
+
+# --instructions--
+
+Write a function to solve the knapsack problem. The function is given the array of objects and the maximum weight as parameters. It should return the maximum total value possible.
+
+# --hints--
+
+`knapsack([{ name:'map', weight:9, value:150 }, { name:'compass', weight:13, value:35 }, { name:'water', weight:153, value:200 }, { name:'sandwich', weight:50, value:160 }, { name:'glucose', weight:15, value:60 }, { name:'tin', weight:68, value:45 }, { name:'banana', weight:27, value:60 }, { name:'apple', weight:39, value:40 }], 100)` should return `405`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'map', weight: 9, value: 150 },
+      { name: 'compass', weight: 13, value: 35 },
+      { name: 'water', weight: 153, value: 200 },
+      { name: 'sandwich', weight: 50, value: 160 },
+      { name: 'glucose', weight: 15, value: 60 },
+      { name: 'tin', weight: 68, value: 45 },
+      { name: 'banana', weight: 27, value: 60 },
+      { name: 'apple', weight: 39, value: 40 }
+    ],
+    100
+  ),
+  405
+);
+```
+
+`knapsack([{ name:'map', weight:9, value:150 }, { name:'compass', weight:13, value:35 }, { name:'water', weight:153, value:200 }, { name:'sandwich', weight:50, value:160 }, { name:'glucose', weight:15, value:60 }, { name:'tin', weight:68, value:45 }, { name:'banana', weight:27, value:60 }, { name:'apple', weight:39, value:40 }], 200)` should return `510`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'map', weight: 9, value: 150 },
+      { name: 'compass', weight: 13, value: 35 },
+      { name: 'water', weight: 153, value: 200 },
+      { name: 'sandwich', weight: 50, value: 160 },
+      { name: 'glucose', weight: 15, value: 60 },
+      { name: 'tin', weight: 68, value: 45 },
+      { name: 'banana', weight: 27, value: 60 },
+      { name: 'apple', weight: 39, value: 40 }
+    ],
+    200
+  ),
+  510
+);
+```
+
+`knapsack([{ name:'cheese', weight:23, value:30 }, { name:'beer', weight:52, value:10 }, { name:'suntan cream', weight:11, value:70 }, { name:'camera', weight:32, value:30 }, { name:'T-shirt', weight:24, value:15 }, { name:'trousers', weight:48, value:10 }, { name:'umbrella', weight:73, value:40 }], 100)` should return `145`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'cheese', weight: 23, value: 30 },
+      { name: 'beer', weight: 52, value: 10 },
+      { name: 'suntan cream', weight: 11, value: 70 },
+      { name: 'camera', weight: 32, value: 30 },
+      { name: 'T-shirt', weight: 24, value: 15 },
+      { name: 'trousers', weight: 48, value: 10 },
+      { name: 'umbrella', weight: 73, value: 40 }
+    ],
+    100
+  ),
+  145
+);
+```
+
+`knapsack([{ name:'cheese', weight:23, value:30 }, { name:'beer', weight:52, value:10 }, { name:'suntan cream', weight:11, value:70 }, { name:'camera', weight:32, value:30 }, { name:'T-shirt', weight:24, value:15 }, { name:'trousers', weight:48, value:10 }, { name:'umbrella', weight:73, value:40 }], 200)` should return `185`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'cheese', weight: 23, value: 30 },
+      { name: 'beer', weight: 52, value: 10 },
+      { name: 'suntan cream', weight: 11, value: 70 },
+      { name: 'camera', weight: 32, value: 30 },
+      { name: 'T-shirt', weight: 24, value: 15 },
+      { name: 'trousers', weight: 48, value: 10 },
+      { name: 'umbrella', weight: 73, value: 40 }
+    ],
+    200
+  ),
+  185
+);
+```
+
+`knapsack([{ name:'waterproof trousers', weight:42, value:70 }, { name:'waterproof overclothes', weight:43, value:75 }, { name:'note-case', weight:22, value:80 }, { name:'sunglasses', weight:7, value:20 }, { name:'towel', weight:18, value:12 }, { name:'socks', weight:4, value:50 }, { name:'book', weight:30, value:10 }], 100)` should return `237`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'waterproof trousers', weight: 42, value: 70 },
+      { name: 'waterproof overclothes', weight: 43, value: 75 },
+      { name: 'note-case', weight: 22, value: 80 },
+      { name: 'sunglasses', weight: 7, value: 20 },
+      { name: 'towel', weight: 18, value: 12 },
+      { name: 'socks', weight: 4, value: 50 },
+      { name: 'book', weight: 30, value: 10 }
+    ],
+    100
+  ),
+  237
+);
+```
+
+`knapsack([{ name:'waterproof trousers', weight:42, value:70 }, { name:'waterproof overclothes', weight:43, value:75 }, { name:'note-case', weight:22, value:80 }, { name:'sunglasses', weight:7, value:20 }, { name:'towel', weight:18, value:12 }, { name:'socks', weight:4, value:50 }, { name:'book', weight:30, value:10 }], 200)` should return `317`.'
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'waterproof trousers', weight: 42, value: 70 },
+      { name: 'waterproof overclothes', weight: 43, value: 75 },
+      { name: 'note-case', weight: 22, value: 80 },
+      { name: 'sunglasses', weight: 7, value: 20 },
+      { name: 'towel', weight: 18, value: 12 },
+      { name: 'socks', weight: 4, value: 50 },
+      { name: 'book', weight: 30, value: 10 }
+    ],
+    200
+  ),
+  317
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapsack(items, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapsack(items, maxweight) {
+  var _ = {
+    max: function(e) {
+      var mx = e[0];
+      e.forEach(function(f) {
+        if (mx < f) mx = f;
+      });
+      return mx;
+    },
+    map: function(array, func) {
+      return array.map(func);
+    },
+    isUndefined: function(a) {
+      if (a) {
+        return false;
+      }
+      return true;
+    },
+    range: function(start, end, step) {
+      var a = [];
+      var f = (f = (i, end) => i < end);
+      if (start > end) f = (i, end) => i > end;
+
+      for (var i = start; f(i, end); i += step) a.push(i);
+      return a;
+    }
+  };
+
+  var valuefn = e => e.value;
+  var weightfn = e => e.weight;
+  var _epsilon = 0.01;
+  var _p = _.max(_.map(items, valuefn));
+  var _k = (_epsilon * _p) / items.length;
+
+  var _memo = (function() {
+    var _mem = {};
+    var _key = function(i, w) {
+      return i + '::' + w;
+    };
+    return {
+      get: function(i, w) {
+        return _mem[_key(i, w)];
+      },
+      put: function(i, w, r) {
+        _mem[_key(i, w)] = r;
+        return r;
+      }
+    };
+  })();
+
+  var _m = function(i, w) {
+    i = Math.round(i);
+    w = Math.round(w);
+
+    if (i < 0 || w === 0) {
+      // empty base case
+      return { items: [], totalWeight: 0, totalValue: 0 };
+    }
+
+    var mm = _memo.get(i, w);
+    if (!_.isUndefined(mm)) {
+      return mm;
+    }
+
+    var item = items[i];
+    if (weightfn(item) > w) {
+      //item does not fit, try the next item
+      return _memo.put(i, w, _m(i - 1, w));
+    }
+    // this item could fit.
+    // are we better off excluding it?
+    var excluded = _m(i - 1, w);
+    // or including it?
+    var included = _m(i - 1, w - weightfn(item));
+    if (
+      included.totalValue + Math.floor(valuefn(item) / _k) >
+      excluded.totalValue
+    ) {
+      // better off including it
+      // make a copy of the list
+      var i1 = included.items.slice();
+      i1.push(item);
+      return _memo.put(i, w, {
+        items: i1,
+        totalWeight: included.totalWeight + weightfn(item),
+        totalValue: included.totalValue + Math.floor(valuefn(item) / _k)
+      });
+    }
+    //better off excluding it
+    return _memo.put(i, w, excluded);
+  };
+  var scaled = _m(items.length - 1, maxweight);
+
+  var val = 0;
+  scaled.items.forEach(function(e) {
+    val += e.value;
+  });
+  return val;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
new file mode 100644
index 0000000000..dfcde45510
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
@@ -0,0 +1,212 @@
+---
+id: 5a23c84252665b21eecc7ed2
+title: Knapsack problem/Bounded
+challengeType: 5
+forumTopicId: 323652
+dashedName: knapsack-problembounded
+---
+
+# --description--
+
+The bounded knapsack problem is defined as follows:
+
+You are given an array of objects representing items to be put in a knapsack. The objects have 4 attributes: name, pieces (the number of the particular item), weight, and value. The items need to be selected so that the total weight does not exceed the maximum weight and the value is maximized. Keep in mind that each item can appear between 0 and `pieces` times.
+
+# --instructions--
+
+Write a function to solve the knapsack problem. The function is given the array of objects and the maximum weight as parameters. It should return the maximum total value possible.
+
+# --hints--
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 300)` should return `755`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    300
+  ),
+  755
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 400)` should return `875`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    400
+  ),
+  875
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 500)` should return `1015`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    500
+  ),
+  1015
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 600)` should return `1120`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    600
+  ),
+  1120
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 700)` should return `1225`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    700
+  ),
+  1225
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findBestPack(data, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findBestPack(data, maxweight) {
+  var m = [[0]]; // maximum pack value found so far
+  var b = [[0]]; // best combination found so far
+  var opts = [0]; // item index for 0 of item 0
+  var P = [1]; // item encoding for 0 of item 0
+  var choose = 0;
+  for (var j = 0; j < data.length; j++) {
+    opts[j + 1] = opts[j] + data[j].pieces; // item index for 0 of item j+1
+    P[j + 1] = P[j] * (1 + data[j].pieces); // item encoding for 0 of item j+1
+  }
+  for (var j = 0; j < opts[data.length]; j++) {
+    m[0][j + 1] = b[0][j + 1] = 0; // best values and combos for empty pack: nothing
+  }
+  for (var w = 1; w <= maxweight; w++) {
+    m[w] = [0];
+    b[w] = [0];
+    for (var j = 0; j < data.length; j++) {
+      var N = data[j].pieces; // how many of these can we have?
+      var base = opts[j]; // what is the item index for 0 of these?
+      for (var n = 1; n <= N; n++) {
+        var W = n * data[j].weight; // how much do these items weigh?
+        var s = w >= W ? 1 : 0; // can we carry this many?
+        var v = s * n * data[j].value; // how much are they worth?
+        var I = base + n; // what is the item number for this many?
+        var wN = w - s * W; // how much other stuff can we be carrying?
+        var C = n * P[j] + b[wN][base]; // encoded combination
+        m[w][I] = Math.max(m[w][I - 1], v + m[wN][base]); // best value
+        choose = b[w][I] = m[w][I] > m[w][I - 1] ? C : b[w][I - 1];
+      }
+    }
+  }
+
+  var best = [];
+  for (var j = data.length - 1; j >= 0; j--) {
+    best[j] = Math.floor(choose / P[j]);
+    choose -= best[j] * P[j];
+  }
+
+  var wgt = 0;
+  var val = 0;
+  for (var i = 0; i < best.length; i++) {
+    if (0 == best[i]) continue;
+    wgt += best[i] * data[i].weight;
+    val += best[i] * data[i].value;
+  }
+
+  return val;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
new file mode 100644
index 0000000000..c106a4a743
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
@@ -0,0 +1,169 @@
+---
+id: 5a23c84252665b21eecc7ed3
+title: Knapsack problem/Continuous
+challengeType: 5
+forumTopicId: 323654
+dashedName: knapsack-problemcontinuous
+---
+
+# --description--
+
+A thief burgles a butcher's shop, where he can select from some items.
+
+The thief knows the weights and prices of each items. Because he has a knapsack with a limit on the maximum weight that it can carry, he wants to select the items such that he would have his profit maximized. He may cut the items; the item has a reduced price after cutting that is proportional to the original price by the ratio of masses. That means: half of an item has half the price of the original.
+
+# --instructions--
+
+Write a function that takes an array of objects representing the items available in the shop. Each object has 3 attributes: name, weight, and value. The function also takes the maximum weight as a parameter. The function should return the maximum value possible, and the total weight of the selected items should not exceed the maximum weight.
+
+# --hints--
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 10)` should return `257.875`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    10
+  ),
+  257.875
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 12)` should return `295.05405405405406`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    12
+  ),
+  295.05405405405406
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 15)` should return `349.3783783783784`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    15
+  ),
+  349.3783783783784
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 22)` should return `459.5263157894737`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    22
+  ),
+  459.5263157894737
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 24)` should return `478.4736842105263`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    24
+  ),
+  478.4736842105263
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapContinuous(items, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapContinuous(items, maxweight) {
+  function item_cmp(a, b) {
+    const ua = a.unitVal,
+      ub = b.unitVal;
+    return ua < ub ? 1 : ua > ub ? -1 : 0;
+  }
+  items = items.map(({ value, weight }) => ({
+    unitVal: value / weight,
+    weight
+  }));
+  items.sort(item_cmp);
+
+  let val = 0;
+  let wt = 0;
+  for (let { unitVal, weight } of items) {
+    var portion = Math.min(maxweight - wt, weight);
+    wt += portion;
+    var addVal = portion * unitVal;
+    val += addVal;
+    if (wt >= maxweight) {
+      break;
+    }
+  }
+  return val;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
new file mode 100644
index 0000000000..74e1ad8916
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
@@ -0,0 +1,185 @@
+---
+id: 5a23c84252665b21eecc7ed4
+title: Knapsack problem/Unbounded
+challengeType: 5
+forumTopicId: 323655
+dashedName: knapsack-problemunbounded
+---
+
+# --description--
+
+A traveler gets diverted and has to make an unscheduled stop in what turns out to be Shangri-La. Opting to leave, he is allowed to take as much as he likes of the items available there, so long as it will fit in his knapsack, and he can carry it.
+
+He knows that he can carry no more than a particular value of maximum weight in total; and that the capacity of his knapsack has a limited volume.
+
+Looking just above the bar codes on the items he finds their weights and volumes. He digs out his recent copy of a financial paper and gets the value of each item.
+
+He can only take whole units of any item, but there is much more of any item than he could ever carry.
+
+# --instructions--
+
+Write a function that takes an array of objects, maximum weight, and maximum volume as parameters. Each object has 4 attributes: name, value, weight, and volume. The function should return the maximum value of items the traveller can take with him.
+
+# --hints--
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 25, 0.25)` should return `54500`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    25,
+    0.25
+  ),
+  54500
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 55, 0.25)` should return `88400`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    55,
+    0.25
+  ),
+  88400
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 25, 0.15)` should return `42500`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    25,
+    0.15
+  ),
+  42500
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 35, 0.35)` should return `75900`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    35,
+    0.35
+  ),
+  75900
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 15, 0.25)` should return `43200`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    15,
+    0.25
+  ),
+  43200
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapsackUnbounded(items, maxweight, maxvolume) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapsackUnbounded(items, maxWeight, maxVolume) {
+  function getPickTotals(items, pick) {
+    let totalValue = 0;
+    let totalWeight = 0;
+    let totalVolume = 0;
+    for (let i = 0; i < items.length; i++) {
+      totalValue += pick[i] * items[i].value;
+      totalWeight += pick[i] * items[i].weight;
+      totalVolume += pick[i] * items[i].volume;
+    }
+    return [totalValue, totalWeight, totalVolume];
+  }
+
+  function getMaxes(items, maxWeight, maxVolume) {
+    const maxes = [];
+    for (let i = 0; i < items.length; i++) {
+      const maxUnitsInWeight = Math.floor(maxWeight / items[i].weight);
+      const maxUnitsInVolume = Math.floor(maxVolume / items[i].volume);
+      const maxUnitsInLimit = Math.min(maxUnitsInWeight, maxUnitsInVolume);
+      maxes.push(maxUnitsInLimit);
+    }
+    return maxes;
+  }
+
+  function isInLimit(value, limit) {
+    return value <= limit;
+  }
+
+  function getCombinations(maxValues, curPicks, combinations) {
+    if (maxValues.length === 0) {
+      combinations.push(curPicks);
+    }
+
+    const curMax = maxValues[0];
+    const leftMaxValues = maxValues.slice(1);
+    for (let i = 0; i <= curMax; i++) {
+      getCombinations(leftMaxValues, curPicks.concat(i), combinations);
+    }
+    return combinations;
+  }
+
+  let bestValue = 0;
+  let bestPick = [];
+  const maxes = getMaxes(items, maxWeight, maxVolume);
+  const combinations = getCombinations(maxes, [], []);
+  for (let i = 0; i < combinations.length; i++) {
+    const curPick = combinations[i];
+    const [curValue, curWeight, curVolume] = getPickTotals(items, curPick);
+    if (!isInLimit(curWeight, maxWeight) || !isInLimit(curVolume, maxVolume)) {
+      continue;
+    }
+
+    if (curValue > bestValue) {
+      bestValue = curValue;
+      bestPick = [curPick];
+    } else if (curValue === bestValue) {
+      bestPick.push(curPick);
+    }
+  }
+
+  return bestValue;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knights-tour.md
new file mode 100644
index 0000000000..c7a4b0693d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -0,0 +1,225 @@
+---
+id: 5a23c84252665b21eecc7ed5
+title: Knight's tour
+challengeType: 5
+forumTopicId: 302297
+dashedName: knights-tour
+---
+
+# --description--
+
+[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Problem: You have an empty `w` \* `h` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
+
+# --instructions--
+
+Write a function that takes `w` and `h` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
+
+# --hints--
+
+`knightTour` should be a function.
+
+```js
+assert(typeof knightTour == 'function');
+```
+
+`knightTour(6, 6)` should return a number.
+
+```js
+assert(typeof knightTour(6, 6) == 'number');
+```
+
+`knightTour(6, 6)` should return `36`.
+
+```js
+assert.equal(knightTour(6, 6), 36);
+```
+
+`knightTour(5, 6)` should return `30`.
+
+```js
+assert.equal(knightTour(5, 6), 30);
+```
+
+`knightTour(4, 6)` should return `12`.
+
+```js
+assert.equal(knightTour(4, 6), 12);
+```
+
+`knightTour(7, 3)` should return `10`.
+
+```js
+assert.equal(knightTour(7, 3), 10);
+```
+
+`knightTour(8, 6)` should return `48`.
+
+```js
+assert.equal(knightTour(8, 6), 48);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knightTour(w, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knightTour(w, h) {
+  function createBoards(rows, columns) {
+    const board = [];
+    const visited = [];
+    for (let i = 0; i < rows; i++) {
+      board.push(new Array(columns).fill(-1));
+      visited.push(new Array(columns).fill(false));
+    }
+    return [board, visited];
+  }
+
+  function copyBoard(board) {
+    const copied = [];
+    for (let i = 0; i < board.length; i++) {
+      copied.push([...board[i]]);
+    }
+    return copied;
+  }
+
+  function isOnBoard(value, limit) {
+    return value >= 0 && value < limit;
+  }
+
+  function markVisited(board, visited, row, column) {
+    visited[row][column] = true;
+    board[row][column] = -1;
+  }
+
+  function areAllVisited(visited) {
+    return (
+      visited.filter(row => row.filter(column => column === false).length !== 0)
+        .length === 0
+    );
+  }
+
+  function getMovesFrom(board, row, column) {
+    const possibleMoves = [];
+    for (let i = 0; i < moves.length; i++) {
+      const [rowChange, colChange] = moves[i];
+      const [rowN, colN] = [row + rowChange, column + colChange];
+      if (!isOnBoard(rowN, board.length) || !isOnBoard(colN, board[0].length)) {
+        continue;
+      }
+      possibleMoves.push([rowN, colN]);
+    }
+    return possibleMoves;
+  }
+
+  function fillAllowedMovesCounts(board) {
+    for (let row = 0; row < board.length; row++) {
+      for (let column = 0; column < board[0].length; column++) {
+        board[row][column] = getMovesFrom(board, row, column).length;
+      }
+    }
+  }
+
+  function updateAllowedMovesCounts(board, possibleMoves) {
+    for (let i = 0; i < possibleMoves.length; i++) {
+      const [row, column] = possibleMoves[i];
+      if (board[row][column] > 0) {
+        board[row][column]--;
+      }
+    }
+  }
+
+  function getBestNextMoves(board, allowedMoves) {
+    let bestMoves = [];
+    let fewestNextMoves = Infinity;
+    let zeroMove = [];
+    for (let i = 0; i < allowedMoves.length; i++) {
+      const [moveRow, moveCol] = allowedMoves[i];
+      const numMoves = board[moveRow][moveCol];
+      if (numMoves === -1) {
+        continue;
+      }
+      if (numMoves === 0) {
+        zeroMove.push(allowedMoves[i]);
+      }
+      if (numMoves < fewestNextMoves) {
+        bestMoves = [allowedMoves[i]];
+        fewestNextMoves = numMoves;
+      } else if (numMoves === fewestNextMoves) {
+        bestMoves.push(allowedMoves[i]);
+      }
+    }
+
+    if (bestMoves.length > 0) {
+      return bestMoves;
+    }
+    return zeroMove;
+  }
+
+  function solve(board, visited, lastRow, lastColumn) {
+    if (areAllVisited(visited)) {
+      return true;
+    }
+    const nextMoves = getMovesFrom(board, lastRow, lastColumn);
+    updateAllowedMovesCounts(board, nextMoves);
+    const allowedMoves = nextMoves.filter(
+      ([row, column]) => !visited[row][column]
+    );
+
+    const bestMoves = getBestNextMoves(board, allowedMoves);
+    const restMoves = allowedMoves.filter(
+      move => bestMoves.indexOf(move) === -1
+    );
+    const possibleMoves = [...bestMoves];
+    possibleMoves.push(...getBestNextMoves(board, restMoves));
+
+    for (let i = 0; i < possibleMoves.length; i++) {
+      const [moveRow, moveCol] = possibleMoves[i];
+      const newBoard = copyBoard(board);
+      const newVisited = copyBoard(visited);
+      markVisited(newBoard, newVisited, moveRow, moveCol);
+      if (solve(newBoard, newVisited, moveRow, moveCol)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  function solveStart(board, visited, startRow, startColumn) {
+    const newBoard = copyBoard(board);
+    const newVisited = copyBoard(visited);
+    markVisited(newBoard, newVisited, startRow, startColumn);
+    return solve(newBoard, newVisited, startRow, startColumn);
+  }
+
+  const moves = [
+    [-1, -2],
+    [-2, -1],
+    [-2, 1],
+    [-1, 2],
+    [1, 2],
+    [2, 1],
+    [2, -1],
+    [1, -2]
+  ];
+
+  const [baseBoard, baseVisited] = createBoards(h, w);
+  fillAllowedMovesCounts(baseBoard);
+  let solvedCount = 0;
+  for (let row = 0; row < h; row++) {
+    for (let column = 0; column < w; column++) {
+      if (solveStart(baseBoard, baseVisited, row, column)) {
+        solvedCount++;
+      }
+    }
+  }
+  return solvedCount;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
new file mode 100644
index 0000000000..f8938faa66
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
@@ -0,0 +1,85 @@
+---
+id: 5a23c84252665b21eecc7edb
+title: Largest int from concatenated ints
+challengeType: 5
+forumTopicId: 302298
+dashedName: largest-int-from-concatenated-ints
+---
+
+# --description--
+
+Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer.
+
+# --hints--
+
+`maxCombine` should be a function.
+
+```js
+assert(typeof maxCombine == 'function');
+```
+
+`maxCombine([1, 3, 3, 4, 55])` should return a number.
+
+```js
+assert(typeof maxCombine([1, 3, 3, 4, 55]) == 'number');
+```
+
+`maxCombine([1, 3, 3, 4, 55])` should return `554331`.
+
+```js
+assert.equal(maxCombine([1, 3, 3, 4, 55]), 554331);
+```
+
+`maxCombine([71, 45, 23, 4, 5])` should return `71545423`.
+
+```js
+assert.equal(maxCombine([71, 45, 23, 4, 5]), 71545423);
+```
+
+`maxCombine([14, 43, 53, 114, 55])` should return `55534314114`.
+
+```js
+assert.equal(maxCombine([14, 43, 53, 114, 55]), 55534314114);
+```
+
+`maxCombine([1, 34, 3, 98, 9, 76, 45, 4])` should return `998764543431`.
+
+```js
+assert.equal(maxCombine([1, 34, 3, 98, 9, 76, 45, 4]), 998764543431);
+```
+
+`maxCombine([54, 546, 548, 60])` should return `6054854654`.
+
+```js
+assert.equal(maxCombine([54, 546, 548, 60]), 6054854654);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function maxCombine(xs) {
+
+}
+```
+
+# --solutions--
+
+```js
+function maxCombine(xs) {
+  return parseInt(
+    xs
+      .sort(function(x, y) {
+        var a = x.toString(),
+          b = y.toString(),
+          ab = parseInt(a + b),
+          ba = parseInt(b + a);
+
+        return ab > ba ? -1 : ab < ba ? 1 : 0;
+      })
+      .join(''),
+    10
+  );
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
new file mode 100644
index 0000000000..e8a6170f54
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
@@ -0,0 +1,99 @@
+---
+id: 5a23c84252665b21eecc7edc
+title: Last Friday of each month
+challengeType: 5
+forumTopicId: 302299
+dashedName: last-friday-of-each-month
+---
+
+# --description--
+
+Write a function that returns the date of the last Friday of a given month for a given year.
+
+# --hints--
+
+`lastFriday` should be a function.
+
+```js
+assert(typeof lastFriday == 'function');
+```
+
+`lastFriday(2018, 1)` should return a number.
+
+```js
+assert(typeof lastFriday(2018, 1) == 'number');
+```
+
+`lastFriday(2018, 1)` should return `26`.
+
+```js
+assert.equal(lastFriday(2018, 1), 26);
+```
+
+`lastFriday(2017, 2)` should return `24`.
+
+```js
+assert.equal(lastFriday(2017, 2), 24);
+```
+
+`lastFriday(2012, 3)` should return `30`.
+
+```js
+assert.equal(lastFriday(2012, 3), 30);
+```
+
+`lastFriday(1900, 4)` should return `27`.
+
+```js
+assert.equal(lastFriday(1900, 4), 27);
+```
+
+`lastFriday(2000, 5)` should return `26`.
+
+```js
+assert.equal(lastFriday(2000, 5), 26);
+```
+
+`lastFriday(2006, 6)` should return `30`.
+
+```js
+assert.equal(lastFriday(2006, 6), 30);
+```
+
+`lastFriday(2010, 7)` should return `30`.
+
+```js
+assert.equal(lastFriday(2010, 7), 30);
+```
+
+`lastFriday(2005, 8)` should return `26`.
+
+```js
+assert.equal(lastFriday(2005, 8), 26);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lastFriday(year, month) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lastFriday(year, month) {
+  var i, last_day;
+  i = 0;
+  while (true) {
+    last_day = new Date(year, month, i);
+    if (last_day.getDay() === 5) {
+      return last_day.getDate();
+    }
+    i -= 1;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
new file mode 100644
index 0000000000..a20f5b4df3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
@@ -0,0 +1,211 @@
+---
+id: 5e4ce2b6ac708cc68c1df25e
+title: Last letter-first letter
+challengeType: 5
+forumTopicId: 385256
+dashedName: last-letter-first-letter
+---
+
+# --description--
+
+A certain children's game involves starting with a word in a particular category. Each participant in turn says a word, but that word must begin with the final letter of the previous word. Once a word has been given, it cannot be repeated. If an opponent cannot give a word in the category, they fall out of the game.
+
+For example, with "animals" as the category,
+
+<pre>Child 1: dog
+Child 2: goldfish
+Child 1: hippopotamus
+Child 2: snake
+...
+</pre>
+
+# --instructions--
+
+Write a function that takes an input array of words. The function should return an array of words where the first letter of each word is the same as the last letter of the previous word. Only use the words in the input array, and once a word is used it cannot be repeated. The words in the return array should be selected and sequenced so that that its length is maximized.
+
+# --hints--
+
+`findLongestChain` should be a function.
+
+```js
+assert(typeof findLongestChain == 'function');
+```
+
+`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    findLongestChain([
+      'certain',
+      'each',
+      'game',
+      'involves',
+      'starting',
+      'with',
+      'word'
+    ])
+  )
+);
+```
+
+`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return `["involves", "starting", "game", "each"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'certain',
+    'each',
+    'game',
+    'involves',
+    'starting',
+    'with',
+    'word'
+  ]),
+  ['involves', 'starting', 'game', 'each']
+);
+```
+
+`findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"])` should return `["braviary", "yamask", "kangaskhan"]`
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'audino',
+    'bagon',
+    'kangaskhan',
+    'banette',
+    'bidoof',
+    'braviary',
+    'exeggcute',
+    'yamask'
+  ]),
+  ['braviary', 'yamask', 'kangaskhan']
+);
+```
+
+`findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"])` should return `["poliwrath", "harp", "poochyena", "archana"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'harp',
+    'poliwrath',
+    'poochyena',
+    'porygon2',
+    'porygonz',
+    'archana'
+  ]),
+  ['poliwrath', 'harp', 'poochyena', 'archana']
+);
+```
+
+`findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"])` should return `["scolipede", "elephant", "tigers", "sealeo"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'scolipede',
+    'elephant',
+    'zeaking',
+    'sealeo',
+    'silcoon',
+    'tigers'
+  ]),
+  ['scolipede', 'elephant', 'tigers', 'sealeo']
+);
+```
+
+`findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"])` should return `["machamp", "petilil", "lumineon", "nosepass"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'loudred',
+    'lumineon',
+    'lunatone',
+    'machamp',
+    'magnezone',
+    'nosepass',
+    'petilil',
+    'pidgeotto',
+    'pikachu'
+  ]),
+  ['machamp', 'petilil', 'lumineon', 'nosepass']
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findLongestChain(items) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findLongestChain(items) {
+  function Ref(index, first_char, last_char) {
+    this.index = index;
+    this.first_char = first_char;
+    this.last_char = last_char;
+  }
+
+  var items_len = items.length
+  var refs_len = items_len;
+  var refs = []
+
+  // enough space for all items
+  var longest_path_refs_len = 0;
+  var longest_path_refs = new Array(items_len);
+
+  function search(curr_len) {
+    if (curr_len > longest_path_refs_len) {
+      longest_path_refs_len = curr_len;
+
+      for (var i = 0; i < curr_len; i++) {
+        longest_path_refs[i] = refs[i];
+      }
+    }
+
+    // recursive search
+    var last_char = refs[curr_len - 1].last_char;
+    for (var i = curr_len; i < refs_len; i++)
+      if (refs[i].first_char == last_char) {
+        var aux = refs[curr_len];
+        refs[curr_len] = refs[i];
+        refs[i] = aux;
+        search(curr_len + 1);
+        refs[i] = refs[curr_len];
+        refs[curr_len] = aux;
+      }
+  }
+
+  for (var i = 0; i < items_len; i++) {
+    var itemsi_len = items[i].length;
+    refs.push(new Ref(i, items[i][0], items[i][itemsi_len - 1]));
+  }
+
+  // try each item as possible start
+  for (var i = 0; i < items_len; i++) {
+    var aux = refs[0];
+    refs[0] = refs[i];
+    refs[i] = aux;
+    search(1);
+    refs[i] = refs[0];
+    refs[0] = aux;
+  }
+
+  var longest_path_len = longest_path_refs_len;
+  var longest_path = new Array(longest_path_len);
+
+  for (var i = 0; i < longest_path_len; i++)
+    longest_path[i] = items[longest_path_refs[i].index];
+
+  return longest_path;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/leap-year.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/leap-year.md
new file mode 100644
index 0000000000..cf41748dba
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/leap-year.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc7ede
+title: Leap year
+challengeType: 5
+forumTopicId: 302300
+dashedName: leap-year
+---
+
+# --description--
+
+Determine whether a given year is a leap year in the Gregorian calendar.
+
+# --hints--
+
+`isLeapYear` should be a function.
+
+```js
+assert(typeof isLeapYear == 'function');
+```
+
+`isLeapYear()` should return a boolean.
+
+```js
+assert(typeof isLeapYear(2018) == 'boolean');
+```
+
+`isLeapYear(2018)` should return `false`.
+
+```js
+assert.equal(isLeapYear(2018), false);
+```
+
+`isLeapYear(2016)` should return `true`.
+
+```js
+assert.equal(isLeapYear(2016), true);
+```
+
+`isLeapYear(2000)` should return `true`.
+
+```js
+assert.equal(isLeapYear(2000), true);
+```
+
+`isLeapYear(1900)` should return `false`.
+
+```js
+assert.equal(isLeapYear(1900), false);
+```
+
+`isLeapYear(1996)` should return `true`.
+
+```js
+assert.equal(isLeapYear(1996), true);
+```
+
+`isLeapYear(1800)` should return `false`.
+
+```js
+assert.equal(isLeapYear(1800), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLeapYear(year) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isLeapYear(year) {
+  return year % 100 === 0 ? year % 400 === 0 : year % 4 === 0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
new file mode 100644
index 0000000000..403e448d2f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -0,0 +1,87 @@
+---
+id: 5a23c84252665b21eecc7edf
+title: Least common multiple
+challengeType: 5
+forumTopicId: 302301
+dashedName: least-common-multiple
+---
+
+# --description--
+
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either *m* or *n* is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of *m*, until you find one that is also a multiple of *n*. If you already have *gcd* for [greatest common divisor](<https://rosettacode.org/wiki/greatest common divisor>), then this formula calculates *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+
+# --instructions--
+
+Compute the least common multiple of an array of integers. Given *m* and *n*, the least common multiple is the smallest positive integer that has both *m* and *n* as factors.
+
+# --hints--
+
+`LCM` should be a function.
+
+```js
+assert(typeof LCM == 'function');
+```
+
+`LCM([2, 4, 8])` should return a number.
+
+```js
+assert(typeof LCM([2, 4, 8]) == 'number');
+```
+
+`LCM([2, 4, 8])` should return `8`.
+
+```js
+assert.equal(LCM([2, 4, 8]), 8);
+```
+
+`LCM([4, 8, 12])` should return `24`.
+
+```js
+assert.equal(LCM([4, 8, 12]), 24);
+```
+
+`LCM([3, 4, 5, 12, 40])` should return `120`.
+
+```js
+assert.equal(LCM([3, 4, 5, 12, 40]), 120);
+```
+
+`LCM([11, 33, 90])` should return `990`.
+
+```js
+assert.equal(LCM([11, 33, 90]), 990);
+```
+
+`LCM([-50, 25, -45, -18, 90, 447])` should return `67050`.
+
+```js
+assert.equal(LCM([-50, 25, -45, -18, 90, 447]), 67050);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function LCM(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function LCM(A) {
+  var n = A.length,
+    a = Math.abs(A[0]);
+  for (var i = 1; i < n; i++) {
+    var b = Math.abs(A[i]),
+      c = a;
+    while (a && b) {
+      a > b ? (a %= b) : (b %= a);
+    }
+    a = Math.abs(c * A[i]) / (a + b);
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/left-factorials.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/left-factorials.md
new file mode 100644
index 0000000000..36c2761d93
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/left-factorials.md
@@ -0,0 +1,115 @@
+---
+id: 5a23c84252665b21eecc7ee0
+title: Left factorials
+challengeType: 5
+forumTopicId: 302302
+dashedName: left-factorials
+---
+
+# --description--
+
+**Left factorials**, $ !n $, may refer to either *subfactorials* or to *factorial sums*. The same notation can be confusingly seen used for the two different definitions. Sometimes, *subfactorials* (also known as *derangements*) may use any of the notations:
+
+<ul>
+  <li>$!n`$</li>
+  <li>$!n$</li>
+  <li>$n¡$</li>
+</ul>
+
+(It may not be visually obvious, but the last example uses an upside-down exclamation mark.) This task will be using this formula for **left factorial**:
+
+$ !n = \\sum\_{k=0}^{n-1} k! $
+
+where $!0 = 0$
+
+# --instructions--
+
+Write a function to calculate the left factorial of a given number.
+
+# --hints--
+
+`leftFactorial` should be a function.
+
+```js
+assert(typeof leftFactorial == 'function');
+```
+
+`leftFactorial(0)` should return a number.
+
+```js
+assert(typeof leftFactorial(0) == 'number');
+```
+
+`leftFactorial(0)` should return `0`.
+
+```js
+assert.equal(leftFactorial(0), 0);
+```
+
+`leftFactorial(1)` should return `1`.
+
+```js
+assert.equal(leftFactorial(1), 1);
+```
+
+`leftFactorial(2)` should return `2`.
+
+```js
+assert.equal(leftFactorial(2), 2);
+```
+
+`leftFactorial(3)` should return `4`.
+
+```js
+assert.equal(leftFactorial(3), 4);
+```
+
+`leftFactorial(10)` should return `409114`.
+
+```js
+assert.equal(leftFactorial(10), 409114);
+```
+
+`leftFactorial(17)` should return `22324392524314`.
+
+```js
+assert.equal(leftFactorial(17), 22324392524314);
+```
+
+`leftFactorial(19)` should return `6780385526348314`.
+
+```js
+assert.equal(leftFactorial(19), 6780385526348314);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function leftFactorial(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function leftFactorial(n) {
+  if (n == 0) return 0;
+  if (n == 1) return 1;
+
+  // Note: for n>=20, the result may not be correct.
+  // This is because JavaScript uses 53 bit integers and
+  // for n>=20 result becomes too large.
+
+  let res = 2,
+    fact = 2;
+  for (var i = 2; i < n; i++) {
+    res += fact;
+    fact *= i + 1;
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/letter-frequency.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/letter-frequency.md
new file mode 100644
index 0000000000..d7c0a30349
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/letter-frequency.md
@@ -0,0 +1,209 @@
+---
+id: 5e4ce2bbac708cc68c1df25f
+title: Letter frequency
+challengeType: 5
+forumTopicId: 385263
+dashedName: letter-frequency
+---
+
+# --description--
+
+Given a string, calculate the frequency of each character.
+
+All characters should be counted. This includes lower and upper case letters, digits, whitespace, special characters, or any other distinct characters.
+
+# --instructions--
+
+Write a function to count the occurrences of each character in a given string.
+
+The function should return a 2D array with each of the elements in the following form: `['char', freq]`. The character should be a string with a length of 1, and frequency is a number denoting the count.
+
+For example, given the string "ab", your function should return `[['a', 1], ['b', 1]]`.
+
+# --hints--
+
+`letterFrequency` should be a function.
+
+```js
+assert(typeof letterFrequency == 'function');
+```
+
+`letterFrequency("Not all that Mrs. Bennet, however")` should return an array.
+
+```js
+assert(Array.isArray(letterFrequency('Not all that Mrs. Bennet, however')));
+```
+
+`letterFrequency("Not all that Mrs. Bennet, however")` should return `[[" ", 5], [",", 1], [".", 1], ["B", 1], ["M", 1], ["N", 1], ["a", 2], ["e", 4], ["h", 2], ["l", 2], ["n", 2], ["o", 2], ["r", 2], ["s", 1], ["t", 4], ["v", 1], ["w", 1]]`.
+
+```js
+assert.deepEqual(letterFrequency('Not all that Mrs. Bennet, however'), [
+  [' ', 5],
+  [',', 1],
+  ['.', 1],
+  ['B', 1],
+  ['M', 1],
+  ['N', 1],
+  ['a', 2],
+  ['e', 4],
+  ['h', 2],
+  ['l', 2],
+  ['n', 2],
+  ['o', 2],
+  ['r', 2],
+  ['s', 1],
+  ['t', 4],
+  ['v', 1],
+  ['w', 1]
+]);
+```
+
+`letterFrequency("daughters, could ask on the ")` should return `[[" ", 5],[",", 1],["a", 2],["c", 1],["d", 2],["e", 2],["g", 1],["h", 2],["k", 1],["l", 1],["n", 1],["o", 2],["r", 1],["s", 2],["t", 2],["u", 2]]`.
+
+```js
+assert.deepEqual(letterFrequency('daughters, could ask on the '), [
+  [' ', 5],
+  [',', 1],
+  ['a', 2],
+  ['c', 1],
+  ['d', 2],
+  ['e', 2],
+  ['g', 1],
+  ['h', 2],
+  ['k', 1],
+  ['l', 1],
+  ['n', 1],
+  ['o', 2],
+  ['r', 1],
+  ['s', 2],
+  ['t', 2],
+  ['u', 2]
+]);
+```
+
+`letterFrequency("husband any satisfactory description")` should return `[[" ", 3], ["a", 4], ["b", 1], ["c", 2], ["d", 2], ["e", 1], ["f", 1], ["h", 1], ["i", 3], ["n", 3], ["o", 2], ["p", 1], ["r", 2], ["s", 4], ["t", 3], ["u", 1], ["y", 2]]`.
+
+```js
+assert.deepEqual(letterFrequency('husband any satisfactory description'), [
+  [' ', 3],
+  ['a', 4],
+  ['b', 1],
+  ['c', 2],
+  ['d', 2],
+  ['e', 1],
+  ['f', 1],
+  ['h', 1],
+  ['i', 3],
+  ['n', 3],
+  ['o', 2],
+  ['p', 1],
+  ['r', 2],
+  ['s', 4],
+  ['t', 3],
+  ['u', 1],
+  ['y', 2]
+]);
+```
+
+`letterFrequency("in various ways--with barefaced")` should return `[[" ", 3], ["-", 2], ["a", 4], ["b", 1], ["c", 1], ["d", 1], ["e", 2], ["f", 1], ["h", 1], ["i", 3], ["n", 1], ["o", 1], ["r", 2], ["s", 2], ["t", 1], ["u", 1], ["v", 1], ["w", 2], ["y", 1]]`.
+
+```js
+assert.deepEqual(letterFrequency('in various ways--with barefaced'), [
+  [' ', 3],
+  ['-', 2],
+  ['a', 4],
+  ['b', 1],
+  ['c', 1],
+  ['d', 1],
+  ['e', 2],
+  ['f', 1],
+  ['h', 1],
+  ['i', 3],
+  ['n', 1],
+  ['o', 1],
+  ['r', 2],
+  ['s', 2],
+  ['t', 1],
+  ['u', 1],
+  ['v', 1],
+  ['w', 2],
+  ['y', 1]
+]);
+```
+
+`letterFrequency("distant surmises; but he eluded")` should return `[[" ", 4], [";", 1], ["a", 1], ["b", 1], ["d", 3], ["e", 4], ["h", 1], ["i", 2], ["l", 1], ["m", 1], ["n", 1], ["r", 1], ["s", 4], ["t", 3], ["u", 3]]`.
+
+```js
+assert.deepEqual(letterFrequency('distant surmises; but he eluded'), [
+  [' ', 4],
+  [';', 1],
+  ['a', 1],
+  ['b', 1],
+  ['d', 3],
+  ['e', 4],
+  ['h', 1],
+  ['i', 2],
+  ['l', 1],
+  ['m', 1],
+  ['n', 1],
+  ['r', 1],
+  ['s', 4],
+  ['t', 3],
+  ['u', 3]
+]);
+```
+
+`letterFrequency("last obliged to accept the second-hand,")` should return `[[" ", 5], [",", 1], ["-", 1], ["a", 3], ["b", 1], ["c", 3], ["d", 3], ["e", 4], ["g", 1], ["h", 2], ["i", 1], ["l", 2], ["n", 2], ["o", 3], ["p", 1], ["s", 2], ["t", 4]]`.
+
+```js
+assert.deepEqual(letterFrequency('last obliged to accept the second-hand,'), [
+  [' ', 5],
+  [',', 1],
+  ['-', 1],
+  ['a', 3],
+  ['b', 1],
+  ['c', 3],
+  ['d', 3],
+  ['e', 4],
+  ['g', 1],
+  ['h', 2],
+  ['i', 1],
+  ['l', 2],
+  ['n', 2],
+  ['o', 3],
+  ['p', 1],
+  ['s', 2],
+  ['t', 4]
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function letterFrequency(txt) {
+
+}
+```
+
+# --solutions--
+
+```js
+function letterFrequency(txt) {
+    var cs = txt.split(''),
+        i = cs.length,
+        dct =  {},
+        c = '',
+        keys;
+
+    while (i--) {
+        c = cs[i];
+        dct[c] = (dct[c] || 0) + 1;
+    }
+
+    keys = Object.keys(dct);
+    keys.sort();
+    return keys.map(function (c) { return [c, dct[c]]; });
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
new file mode 100644
index 0000000000..104543d9d0
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -0,0 +1,105 @@
+---
+id: 5e4ce2eaac708cc68c1df260
+title: Levenshtein distance
+challengeType: 5
+forumTopicId: 385264
+dashedName: levenshtein-distance
+---
+
+# --description--
+
+In information theory and computer science, the **Levenshtein distance** is a [metric](<https://en.wikipedia.org/wiki/string metric>) for measuring the amount of difference between two sequences (i.e. an [edit distance](<https://en.wikipedia.org/wiki/edit distance>)). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
+
+Example:
+
+The Levenshtein distance between "**kitten**" and "**sitting**" is 3, since the following three edits change one into the other, and there isn't a way to do it with fewer than three edits:
+
+<ul>
+  <li><strong>k</strong>itten   <strong>s</strong>itten    (substitution of 'k' with 's')</li>
+  <li>sitt<strong>e</strong>n   sitt<strong>i</strong>n    (substitution of 'e' with 'i')</li>
+  <li>sittin   sittin<strong>g</strong>    (insert 'g' at the end).</li>
+</ul>
+
+*The Levenshtein distance between "**rosettacode**", "**raisethysword**" is **8**.*
+
+*The distance between two strings is same as that when both strings are reversed.*
+
+# --instructions--
+
+Write a function that returns the Levenshtein distance between two strings given as parameters.
+
+# --hints--
+
+`levenshtein` should be a function.
+
+```js
+assert(typeof levenshtein == 'function');
+```
+
+`levenshtein("mist", "dist")` should return a number.
+
+```js
+assert(typeof levenshtein('mist', 'dist') == 'number');
+```
+
+`levenshtein("mist", "dist")` should return `1`.
+
+```js
+assert.equal(levenshtein('mist', 'dist'), 1);
+```
+
+`levenshtein("tier", "tor")` should return `2`.
+
+```js
+assert.equal(levenshtein('tier', 'tor'), 2);
+```
+
+`levenshtein("kitten", "sitting")` should return `3`.
+
+```js
+assert.equal(levenshtein('kitten', 'sitting'), 3);
+```
+
+`levenshtein("stop", "tops")` should return `2`.
+
+```js
+assert.equal(levenshtein('stop', 'tops'), 2);
+```
+
+`levenshtein("rosettacode", "raisethysword")` should return `8`.
+
+```js
+assert.equal(levenshtein('rosettacode', 'raisethysword'), 8);
+```
+
+`levenshtein("mississippi", "swiss miss")` should return `8`.
+
+```js
+assert.equal(levenshtein('mississippi', 'swiss miss'), 8);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function levenshtein(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function levenshtein(a, b) {
+  var t = [], u, i, j, m = a.length, n = b.length;
+  if (!m) { return n; }
+  if (!n) { return m; }
+  for (j = 0; j <= n; j++) { t[j] = j; }
+  for (i = 1; i <= m; i++) {
+    for (u = [i], j = 1; j <= n; j++) {
+      u[j] = a[i - 1] === b[j - 1] ? t[j - 1] : Math.min(t[j - 1], t[j], u[j - 1]) + 1;
+    } t = u;
+  } return u[n];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
new file mode 100644
index 0000000000..96bf1cf079
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -0,0 +1,97 @@
+---
+id: 5e4ce2f5ac708cc68c1df261
+title: Linear congruential generator
+challengeType: 5
+forumTopicId: 385266
+dashedName: linear-congruential-generator
+---
+
+# --description--
+
+The [linear congruential generator](<https://en.wikipedia.org/wiki/linear congruential generator>) is a very simple example of a [random number generator](<http://rosettacode.org/wiki/random number generator>). All linear congruential generators use this formula:
+
+$$r_{n + 1} = (a \times r_n + c) \bmod m$$
+
+Where:
+
+<ul>
+<li>$ r_0 $ is a seed.</li>
+<li>$r_1$, $r_2$, $r_3$, ..., are the random numbers.</li>
+<li>$a$, $c$, $m$ are constants.</li>
+</ul>
+
+If one chooses the values of $a$, $c$ and $m$ with care, then the generator produces a uniform distribution of integers from $0$ to $m - 1$.
+
+LCG numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore LCG is not cryptographically secure. The LCG is still good enough for simple tasks like [Miller-Rabin primality test](<http://rosettacode.org/wiki/Miller-Rabin primality test>), or [FreeCell deals](<http://rosettacode.org/wiki/deal cards for FreeCell>). Among the benefits of the LCG, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
+
+# --instructions--
+
+Write a function that takes $r_0,a,c,m,n$ as parameters and returns $r_n$.
+
+# --hints--
+
+`linearCongGenerator` should be a function.
+
+```js
+assert(typeof linearCongGenerator == 'function');
+```
+
+`linearCongGenerator(324, 1145, 177, 2148, 3)` should return a number.
+
+```js
+assert(typeof linearCongGenerator(324, 1145, 177, 2148, 3) == 'number');
+```
+
+`linearCongGenerator(324, 1145, 177, 2148, 3)` should return `855`.
+
+```js
+assert.equal(linearCongGenerator(324, 1145, 177, 2148, 3), 855);
+```
+
+`linearCongGenerator(234, 11245, 145, 83648, 4)` should return `1110`.
+
+```js
+assert.equal(linearCongGenerator(234, 11245, 145, 83648, 4), 1110);
+```
+
+`linearCongGenerator(85, 11, 1234, 214748, 5)` should return `62217`.
+
+```js
+assert.equal(linearCongGenerator(85, 11, 1234, 214748, 5), 62217);
+```
+
+`linearCongGenerator(0, 1103515245, 12345, 2147483648, 1)` should return `12345`.
+
+```js
+assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 1), 12345);
+```
+
+`linearCongGenerator(0, 1103515245, 12345, 2147483648, 2)` should return `1406932606`.
+
+```js
+assert.equal(
+  linearCongGenerator(0, 1103515245, 12345, 2147483648, 2),
+  1406932606
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function linearCongGenerator(r0, a, c, m, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function linearCongGenerator(r0, a, c, m, n) {
+    for (let i = 0; i < n; i++) {
+        r0 = (a * r0 + c) % m;
+    }
+    return r0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/long-multiplication.md
new file mode 100644
index 0000000000..431f88eeb8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -0,0 +1,111 @@
+---
+id: 5e4ce2a1ac708cc68c1df25d
+title: Long multiplication
+challengeType: 5
+forumTopicId: 385269
+dashedName: long-multiplication
+---
+
+# --description--
+
+Explicitly implement [long multiplication](<https://en.wikipedia.org/wiki/long multiplication>).
+
+This is one possible approach to arbitrary-precision integer algebra.
+
+# --instructions--
+
+Write a function that takes two strings of large numbers as parameters. Your function should return the product of these two large numbers as a string.
+
+**Note:** In JavaScript, arithmetic operations are inaccurate with large numbers, so you will have to implement precise multiplication yourself.
+
+# --hints--
+
+`mult` should be a function.
+
+```js
+assert(typeof mult == 'function');
+```
+
+`mult("18446744073709551616", "18446744073709551616")` should return a string.
+
+```js
+assert(typeof mult('18446744073709551616', '18446744073709551616') == 'string');
+```
+
+`mult("18446744073709551616", "18446744073709551616")` should return `"340282366920938463463374607431768211456"`.
+
+```js
+assert.equal(
+  mult('18446744073709551616', '18446744073709551616'),
+  '340282366920938463463374607431768211456'
+);
+```
+
+`mult("31844674073709551616", "1844674407309551616")` should return `"58743055272886011737990786529368211456"`.
+
+```js
+assert.equal(
+  mult('31844674073709551616', '1844674407309551616'),
+  '58743055272886011737990786529368211456'
+);
+```
+
+`mult("1846744073709551616", "44844644073709551616")` should return `"82816580680737279241781007431768211456"`.
+
+```js
+assert.equal(
+  mult('1846744073709551616', '44844644073709551616'),
+  '82816580680737279241781007431768211456'
+);
+```
+
+`mult("1844674407370951616", "1844674407709551616")` should return `"3402823669833978308014392742590611456"`.
+
+```js
+assert.equal(
+  mult('1844674407370951616', '1844674407709551616'),
+  '3402823669833978308014392742590611456'
+);
+```
+
+`mult("2844674407370951616", "1844674407370955616")` should return `"5247498076580334548376218009219475456"`.
+
+```js
+assert.equal(
+  mult('2844674407370951616', '1844674407370955616'),
+  '5247498076580334548376218009219475456'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mult(strNum1, strNum2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function mult(strNum1, strNum2) {
+    var a1 = strNum1.split("").reverse();
+    var a2 = strNum2.toString().split("").reverse();
+    var aResult = new Array;
+
+    for ( var iterNum1 = 0; iterNum1 < a1.length; iterNum1++ ) {
+        for ( var iterNum2 = 0; iterNum2 < a2.length; iterNum2++ ) {
+            var idxIter = iterNum1 + iterNum2;    // Get the current array position.
+            aResult[idxIter] = a1[iterNum1] * a2[iterNum2] + ( idxIter >= aResult.length ? 0 : aResult[idxIter] );
+
+            if ( aResult[idxIter] > 9 ) {    // Carrying
+                aResult[idxIter + 1] = Math.floor( aResult[idxIter] / 10 ) + ( idxIter + 1 >= aResult.length ? 0 : aResult[idxIter + 1] );
+                aResult[idxIter] %= 10;
+            }
+        }
+    }
+    return aResult.reverse().join("");
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
new file mode 100644
index 0000000000..b027a10f5e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -0,0 +1,102 @@
+---
+id: 5e6dd1278e6ca105cde40ea9
+title: Longest common subsequence
+challengeType: 5
+forumTopicId: 385271
+dashedName: longest-common-subsequence
+---
+
+# --description--
+
+The **longest common subsequence** (or [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
+
+***1234***
+
+***12***245***3***332***4***
+
+For a string example, consider the sequences "thisisatest" and "testing123testing". An LCS would be "tsitest":
+
+***t***hi***si***sa***test***
+
+***t***e***s***t***i***ng123***test***ing.
+
+Your code only needs to deal with strings.
+
+For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
+
+# --instructions--
+
+Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
+
+# --hints--
+
+`lcs` should be a function.
+
+```js
+assert(typeof lcs == 'function');
+```
+
+`lcs("thisisatest", "testing123testing")` should return a string.
+
+```js
+assert(typeof lcs('thisisatest', 'testing123testing') == 'string');
+```
+
+`lcs("thisisatest", "testing123testing")` should return `"tsitest"`.
+
+```js
+assert.equal(lcs('thisisatest', 'testing123testing'), 'tsitest');
+```
+
+`lcs("ABCDGH", "AEDFHR")` should return `"ADH"`.
+
+```js
+assert.equal(lcs('ABCDGH', 'AEDFHR'), 'ADH');
+```
+
+`lcs("AGGTAB", "GXTXAYB")` should return `"GTAB"`.
+
+```js
+assert.equal(lcs('AGGTAB', 'GXTXAYB'), 'GTAB');
+```
+
+`lcs("BDACDB", "BDCB")` should return `"BDCB"`.
+
+```js
+assert.equal(lcs('BDACDB', 'BDCB'), 'BDCB');
+```
+
+`lcs("ABAZDC", "BACBAD")` should return `"ABAD"`.
+
+```js
+assert.equal(lcs('ABAZDC', 'BACBAD'), 'ABAD');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lcs(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lcs(a, b) {
+  var aSub = a.substr(0, a.length - 1);
+  var bSub = b.substr(0, b.length - 1);
+
+  if (a.length === 0 || b.length === 0) {
+    return '';
+  } else if (a.charAt(a.length - 1) === b.charAt(b.length - 1)) {
+    return lcs(aSub, bSub) + a.charAt(a.length - 1);
+  } else {
+    var x = lcs(a, bSub);
+    var y = lcs(aSub, b);
+    return (x.length > y.length) ? x : y;
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
new file mode 100644
index 0000000000..4de5521d55
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -0,0 +1,120 @@
+---
+id: 5e6dd139859c290b6ab80292
+title: Longest increasing subsequence
+challengeType: 5
+forumTopicId: 385272
+dashedName: longest-increasing-subsequence
+---
+
+# --description--
+
+The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. An example:
+
+For the following array:
+
+$\\{3, 10, 2, 1, 20\\}$
+
+Longest increasing sequence is:
+
+$\\{3, 10, 20\\}$
+
+For more information on this problem please see [Wikipedia](<https://en.wikipedia.org/wiki/Longest increasing subsequence>).
+
+# --instructions--
+
+Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
+
+It is guaranteed that every array will have a longest increasing subsequence.
+
+# --hints--
+
+`findSequence` should be a function.
+
+```js
+assert(typeof findSequence == 'function');
+```
+
+`findSequence([3, 10, 2, 1, 20])` should return a array.
+
+```js
+assert(Array.isArray(findSequence([3, 10, 2, 1, 20])));
+```
+
+`findSequence([3, 10, 2, 1, 20])` should return `[3, 10, 20]`.
+
+```js
+assert.deepEqual(findSequence([3, 10, 2, 1, 20]), [3, 10, 20]);
+```
+
+`findSequence([2, 7, 3, 5, 8])` should return `[2, 3, 5, 8]`.
+
+```js
+assert.deepEqual(findSequence([2, 7, 3, 5, 8]), [2, 3, 5, 8]);
+```
+
+`findSequence([2, 6, 4, 5, 1])` should return `[2, 4, 5]`.
+
+```js
+assert.deepEqual(findSequence([2, 6, 4, 5, 1]), [2, 4, 5]);
+```
+
+`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` should return `[10, 22, 33, 50, 60, 80]`.
+
+```js
+assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
+  10,
+  22,
+  33,
+  50,
+  60,
+  80
+]);
+```
+
+`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` should return `[0, 2, 6, 9, 11, 15`.
+
+```js
+assert.deepEqual(
+  findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]),
+  [0, 2, 6, 9, 11, 15]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findSequence(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findSequence(input) {
+    var len = input.length;
+    var result = []
+    for (var i = 0; i < len; i++) result.push(1)
+
+    for (var i = 0; i < len; i++)
+        for (var j = i - 1; j >= 0; j--)
+            if (input[i] > input[j] && result[j] >= result[i])
+                result[i] = result[j] + 1;
+
+    var maxValue = Math.max.apply(null, result);
+    var maxIndex = result.indexOf(Math.max.apply(Math, result));
+    var output = [];
+    output.push(input[maxIndex]);
+    for (var i = maxIndex; i >= 0; i--) {
+        if (maxValue == 0) break;
+        if (input[maxIndex] > input[i] && result[i] == maxValue - 1) {
+            output.push(input[i]);
+            maxValue--;
+        }
+    }
+    output.reverse();
+    return output;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
new file mode 100644
index 0000000000..06a0c9d550
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -0,0 +1,101 @@
+---
+id: 5e6dd14192286d95fc43046e
+title: Longest string challenge
+challengeType: 5
+forumTopicId: 385275
+dashedName: longest-string-challenge
+---
+
+# --description--
+
+In this challenge, you have to find the strings that are the longest among the given strings.
+
+# --instructions--
+
+Write a function that takes an array of strings and returns the strings that have a length equal to the longest length.
+
+# --hints--
+
+`longestString` should be a function.
+
+```js
+assert(typeof longestString == 'function');
+```
+
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return a array.
+
+```js
+assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
+```
+
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]'`.
+
+```js
+assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
+  'ccc',
+  'ggg'
+]);
+```
+
+`longestString(["afedg", "bb", "sdccc", "efdee", "f", "geegg"])` should return `["afedg", "sdccc", "efdee", "geegg"]`.
+
+```js
+assert.deepEqual(
+  longestString(['afedg', 'bb', 'sdccc', 'efdee', 'f', 'geegg']),
+  ['afedg', 'sdccc', 'efdee', 'geegg']
+);
+```
+
+`longestString(["a", "bhghgb", "ccc", "efde", "fssdrr", "ggg"])` should return `["bhghgb", "fssdrr"]`.
+
+```js
+assert.deepEqual(
+  longestString(['a', 'bhghgb', 'ccc', 'efde', 'fssdrr', 'ggg']),
+  ['bhghgb', 'fssdrr']
+);
+```
+
+`longestString(["ahgfhg", "bdsfsb", "ccc", "ee", "f", "ggdsfg"])` should return `["ahgfhg", "bdsfsb", "ggdsfg"]`.
+
+```js
+assert.deepEqual(
+  longestString(['ahgfhg', 'bdsfsb', 'ccc', 'ee', 'f', 'ggdsfg']),
+  ['ahgfhg', 'bdsfsb', 'ggdsfg']
+);
+```
+
+`longestString(["a", "bbdsf", "ccc", "edfe", "gzzzgg"])` should return `["gzzzgg"]`.
+
+```js
+assert.deepEqual(longestString(['a', 'bbdsf', 'ccc', 'edfe', 'gzzzgg']), [
+  'gzzzgg'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function longestString(strings) {
+
+}
+```
+
+# --solutions--
+
+```js
+function longestString(strings) {
+    var mx = 0;
+    var result = []
+    strings.forEach(function (e) {
+        if (e.length > mx) {
+            mx = e.length
+            result = [e]
+        } else if (e.length == mx)
+            result.push(e)
+    })
+
+    return result
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
new file mode 100644
index 0000000000..073e41920d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -0,0 +1,92 @@
+---
+id: 5e6dd14797f5ce267c2f19d0
+title: Look-and-say sequence
+challengeType: 5
+forumTopicId: 385277
+dashedName: look-and-say-sequence
+---
+
+# --description--
+
+The [Look and say sequence](<https://en.wikipedia.org/wiki/Look and say sequence>) is a recursively defined sequence of numbers.
+
+Sequence Definition
+
+<ul><li>Take a decimal number</li>
+<li><span>Look</span> at the number, visually grouping consecutive runs of the same digit.</li>
+<li><span>Say</span> the number, from left to right, group by group; as how many of that digit there are - followed by the digit grouped.</li></ul><span> This becomes the next number of the sequence.</span>
+
+An example:
+
+<ul><li>Starting with the number 1, you have <span>one</span> 1 which produces 11</li>
+<li>Starting with 11, you have <span>two</span> 1's. I.E.: 21</li>
+<li>Starting with 21, you have <span>one</span> 2, then <span>one</span> 1. I.E.: (12)(11) which becomes 1211</li>
+<li>Starting with 1211, you have <span>one</span> 1, <span>one</span> 2, then <span>two</span> 1's. I.E.: (11)(12)(21) which becomes 111221</li></ul>
+
+# --instructions--
+
+Write a function that accepts a string as a parameter, processes it, and returns the resultant string.
+
+# --hints--
+
+`lookAndSay` should be a function.
+
+```js
+assert(typeof lookAndSay == 'function');
+```
+
+`lookAndSay("1")` should return a string.
+
+```js
+assert(typeof lookAndSay('1') == 'string');
+```
+
+`lookAndSay("1")` should return `"11"`.
+
+```js
+assert.equal(lookAndSay('1'), '11');
+```
+
+`lookAndSay("11")` should return `"21"`.
+
+```js
+assert.equal(lookAndSay('11'), '21');
+```
+
+`lookAndSay("21")` should return `"1211"`.
+
+```js
+assert.equal(lookAndSay('21'), '1211');
+```
+
+`lookAndSay("1211")` should return `"111221"`.
+
+```js
+assert.equal(lookAndSay('1211'), '111221');
+```
+
+`lookAndSay("3542")` should return `"13151412"`.
+
+```js
+assert.equal(lookAndSay('3542'), '13151412');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lookAndSay(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lookAndSay(str) {
+    return str.replace(/(.)\1*/g, function(seq, p1) {
+      return seq.length.toString() + p1;
+    });
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
new file mode 100644
index 0000000000..e8924ccd28
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
@@ -0,0 +1,139 @@
+---
+id: 5e6dd15004c88cf00d2a78b3
+title: Loop over multiple arrays simultaneously
+challengeType: 5
+forumTopicId: 385279
+dashedName: loop-over-multiple-arrays-simultaneously
+---
+
+# --description--
+
+Loop over multiple arrays and create a new array whose $i^{th}$ element is the concatenation of $i^{th}$ element of each of the given.
+
+For this example, if you are given this array of arrays:
+
+```js
+[ ["a", "b", "c"], ["A", "B", "C"], [1, 2, 3] ]
+```
+
+the output should be:
+
+```js
+["aA1","bB2","cC3"]
+```
+
+# --instructions--
+
+Write a function that takes an array of arrays as a parameter and returns an array of strings satisfying the given description.
+
+# --hints--
+
+`loopSimult` should be a function.
+
+```js
+assert(typeof loopSimult == 'function');
+```
+
+`loopSimult([["a", "b", "c"], ["A", "B", "C"], [1, 2, 3]])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    loopSimult([
+      ['a', 'b', 'c'],
+      ['A', 'B', 'C'],
+      [1, 2, 3]
+    ])
+  )
+);
+```
+
+`loopSimult([["a", "b", "c"], ["A", "B", "C"], [1, 2, 3]])` should return `["aA1", "bB2", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b', 'c'],
+    ['A', 'B', 'C'],
+    [1, 2, 3]
+  ]),
+  ['aA1', 'bB2', 'cC3']
+);
+```
+
+`loopSimult([["c", "b", "c"], ["4", "5", "C"], [7, 7, 3]])` should return `["c47", "b57", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['c', 'b', 'c'],
+    ['4', '5', 'C'],
+    [7, 7, 3]
+  ]),
+  ['c47', 'b57', 'cC3']
+);
+```
+
+`loopSimult([["a", "b", "c", "d"], ["A", "B", "C", "d"], [1, 2, 3, 4]])` should return `["aA1", "bB2", "cC3", "dd4"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b', 'c', 'd'],
+    ['A', 'B', 'C', 'd'],
+    [1, 2, 3, 4]
+  ]),
+  ['aA1', 'bB2', 'cC3', 'dd4']
+);
+```
+
+`loopSimult([["a", "b"], ["A", "B"], [1, 2]])` should return `["aA1", "bB2"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b'],
+    ['A', 'B'],
+    [1, 2]
+  ]),
+  ['aA1', 'bB2']
+);
+```
+
+`loopSimult([["b", "c"], ["B", "C"], [2, 3]])` should return `["bB2", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['b', 'c'],
+    ['B', 'C'],
+    [2, 3]
+  ]),
+  ['bB2', 'cC3']
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function loopSimult(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function loopSimult(A) {
+    var res = [], output;
+    for (var i = 0; i < A[0].length; i += 1) {
+        output = "";
+        for (var j = 0; j < A.length; j++)
+            output += A[j][i];
+        res.push(output);
+    }
+    return res;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
new file mode 100644
index 0000000000..f7a900174e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -0,0 +1,318 @@
+---
+id: 5e6decd8ec8d7db960950d1c
+title: LU decomposition
+challengeType: 5
+forumTopicId: 385280
+dashedName: lu-decomposition
+---
+
+# --description--
+
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$, as described in [LU decomposition](<https://en.wikipedia.org/wiki/LU decomposition>).
+
+$A = LU$
+
+It is a modified form of Gaussian elimination.
+
+While the [Cholesky decomposition](<http://rosettacode.org/wiki/Cholesky decomposition>) only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
+
+There are several algorithms for calculating $L$ and $U$.
+
+To derive *Crout's algorithm* for a 3x3 example, we have to solve the following system:
+
+\\begin{align}A = \\begin{pmatrix} a\_{11} & a\_{12} & a\_{13}\\\\ a\_{21} & a\_{22} & a\_{23}\\\\ a\_{31} & a\_{32} & a\_{33}\\\\ \\end{pmatrix}= \\begin{pmatrix} l\_{11} & 0 & 0 \\\\ l\_{21} & l\_{22} & 0 \\\\ l\_{31} & l\_{32} & l\_{33}\\\\ \\end{pmatrix} \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ 0 & u\_{22} & u\_{23} \\\\ 0 & 0 & u\_{33} \\end{pmatrix} = LU\\end{align}
+
+We now would have to solve 9 equations with 12 unknowns. To make the system uniquely solvable, usually the diagonal elements of $L$ are set to 1
+
+$l\_{11}=1$
+
+$l\_{22}=1$
+
+$l\_{33}=1$
+
+so we get a solvable system of 9 unknowns and 9 equations.
+
+\\begin{align}A = \\begin{pmatrix} a\_{11} & a\_{12} & a\_{13}\\\\ a\_{21} & a\_{22} & a\_{23}\\\\ a\_{31} & a\_{32} & a\_{33}\\\\ \\end{pmatrix} = \\begin{pmatrix} 1 & 0 & 0 \\\\ l\_{21} & 1 & 0 \\\\ l\_{31} & l\_{32} & 1\\\\ \\end{pmatrix} \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ 0 & u\_{22} & u\_{23} \\\\ 0 & 0 & u\_{33} \\end{pmatrix} = \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ u\_{11}l\_{21} & u\_{12}l\_{21}+u\_{22} & u\_{13}l\_{21}+u\_{23} \\\\ u\_{11}l\_{31} & u\_{12}l\_{31}+u\_{22}l\_{32} & u\_{13}l\_{31} + u\_{23}l\_{32}+u\_{33} \\end{pmatrix} = LU\\end{align}
+
+Solving for the other $l$ and $u$, we get the following equations:
+
+$u\_{11}=a\_{11}$
+
+$u\_{12}=a\_{12}$
+
+$u\_{13}=a\_{13}$
+
+$u\_{22}=a\_{22} - u\_{12}l\_{21}$
+
+$u\_{23}=a\_{23} - u\_{13}l\_{21}$
+
+$u\_{33}=a\_{33} - (u\_{13}l\_{31} + u\_{23}l\_{32})$
+
+and for $l$:
+
+$l\_{21}=\\frac{1}{u\_{11}} a\_{21}$
+
+$l\_{31}=\\frac{1}{u\_{11}} a\_{31}$
+
+$l\_{32}=\\frac{1}{u\_{22}} (a\_{32} - u\_{12}l\_{31})$
+
+We see that there is a calculation pattern, which can be expressed as the following formulas, first for $U$
+
+$u\_{ij} = a\_{ij} - \\sum\_{k=1}^{i-1} u\_{kj}l\_{ik}$
+
+and then for $L$
+
+$l\_{ij} = \\frac{1}{u\_{jj}} (a\_{ij} - \\sum\_{k=1}^{j-1} u\_{kj}l\_{ik})$
+
+We see in the second formula that to get the $l\_{ij}$ below the diagonal, we have to divide by the diagonal element (pivot) $u\_{jj}$, so we get problems when $u\_{jj}$ is either 0 or very small, which leads to numerical instability.
+
+The solution to this problem is *pivoting* $A$, which means rearranging the rows of $A$, prior to the $LU$ decomposition, in a way that the largest element of each column gets onto the diagonal of $A$. Rearranging the rows means to multiply $A$ by a permutation matrix $P$:
+
+$PA \\Rightarrow A'$
+
+Example:
+
+\\begin{align} \\begin{pmatrix} 0 & 1 \\\\ 1 & 0 \\end{pmatrix} \\begin{pmatrix} 1 & 4 \\\\ 2 & 3 \\end{pmatrix} \\Rightarrow \\begin{pmatrix} 2 & 3 \\\\ 1 & 4 \\end{pmatrix} \\end{align}
+
+The decomposition algorithm is then applied on the rearranged matrix so that
+
+$PA = LU$
+
+# --instructions--
+
+The task is to implement a routine which will take a square nxn matrix $A$ and return a lower triangular matrix $L$, a upper triangular matrix $U$ and a permutation matrix $P$, so that the above equation is fullfilled. The returned value should be in the form `[L, U, P]`.
+
+# --hints--
+
+`luDecomposition` should be a function.
+
+```js
+assert(typeof luDecomposition == 'function');
+```
+
+`luDecomposition([[1, 3, 5], [2, 4, 7], [1, 1, 0]])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    luDecomposition([
+      [1, 3, 5],
+      [2, 4, 7],
+      [1, 1, 0]
+    ])
+  )
+);
+```
+
+`luDecomposition([[1, 3, 5], [2, 4, 7], [1, 1, 0]])` should return `[[[1, 0, 0], [0.5, 1, 0], [0.5, -1, 1]], [[2, 4, 7], [0, 1, 1.5], [0, 0, -2]], [[0, 1, 0], [1, 0, 0], [0, 0, 1]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, 3, 5],
+    [2, 4, 7],
+    [1, 1, 0]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0.5, 1, 0],
+      [0.5, -1, 1]
+    ],
+    [
+      [2, 4, 7],
+      [0, 1, 1.5],
+      [0, 0, -2]
+    ],
+    [
+      [0, 1, 0],
+      [1, 0, 0],
+      [0, 0, 1]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]])` should return `[[[1, 0, 0, 0], [0.2727272727272727, 1, 0, 0], [0.09090909090909091, 0.2875, 1, 0], [0.18181818181818182, 0.23124999999999996, 0.0035971223021580693, 1]], [[11, 9, 24, 2], [0, 14.545454545454547, 11.454545454545455, 0.4545454545454546], [0, 0, -3.4749999999999996, 5.6875], [0, 0, 0, 0.510791366906476]], [[1, 0, 0, 0], [0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 1]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [11, 9, 24, 2],
+    [1, 5, 2, 6],
+    [3, 17, 18, 1],
+    [2, 5, 7, 1]
+  ]),
+  [
+    [
+      [1, 0, 0, 0],
+      [0.2727272727272727, 1, 0, 0],
+      [0.09090909090909091, 0.2875, 1, 0],
+      [0.18181818181818182, 0.23124999999999996, 0.0035971223021580693, 1]
+    ],
+    [
+      [11, 9, 24, 2],
+      [0, 14.545454545454547, 11.454545454545455, 0.4545454545454546],
+      [0, 0, -3.4749999999999996, 5.6875],
+      [0, 0, 0, 0.510791366906476]
+    ],
+    [
+      [1, 0, 0, 0],
+      [0, 0, 1, 0],
+      [0, 1, 0, 0],
+      [0, 0, 0, 1]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[1, 1, 1], [4, 3, -1], [3, 5, 3]])` should return `[[[1, 0, 0], [0.75, 1, 0], [0.25, 0.09090909090909091, 1]], [[4, 3, -1], [0, 2.75, 3.75], [0, 0, 0.9090909090909091]], [[0, 1, 0], [0, 0, 1], [1, 0, 0]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, 1, 1],
+    [4, 3, -1],
+    [3, 5, 3]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0.75, 1, 0],
+      [0.25, 0.09090909090909091, 1]
+    ],
+    [
+      [4, 3, -1],
+      [0, 2.75, 3.75],
+      [0, 0, 0.9090909090909091]
+    ],
+    [
+      [0, 1, 0],
+      [0, 0, 1],
+      [1, 0, 0]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[1, -2, 3], [2, -5, 12], [0, 2, -10]])` should return `[[[1, 0, 0], [0, 1, 0], [0.5, 0.25, 1]], [[2, -5, 12], [0, 2, -10], [0, 0, -0.5]], [[0, 1, 0], [0, 0, 1], [1, 0, 0]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, -2, 3],
+    [2, -5, 12],
+    [0, 2, -10]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0, 1, 0],
+      [0.5, 0.25, 1]
+    ],
+    [
+      [2, -5, 12],
+      [0, 2, -10],
+      [0, 0, -0.5]
+    ],
+    [
+      [0, 1, 0],
+      [0, 0, 1],
+      [1, 0, 0]
+    ]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function luDecomposition(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function luDecomposition(A) {
+
+    function dotProduct(a, b) {
+        var sum = 0;
+        for (var i = 0; i < a.length; i++)
+            sum += a[i] * b[i]
+        return sum;
+    }
+
+    function matrixMul(A, B) {
+        var result = new Array(A.length);
+        for (var i = 0; i < A.length; i++)
+            result[i] = new Array(B[0].length)
+        var aux = new Array(B.length);
+
+        for (var j = 0; j < B[0].length; j++) {
+
+            for (var k = 0; k < B.length; k++)
+                aux[k] = B[k][j];
+
+            for (var i = 0; i < A.length; i++)
+                result[i][j] = dotProduct(A[i], aux);
+        }
+        return result;
+    }
+
+    function pivotize(m) {
+        var n = m.length;
+        var id = new Array(n);
+        for (var i = 0; i < n; i++) {
+            id[i] = new Array(n);
+            id[i].fill(0)
+            id[i][i] = 1;
+        }
+
+        for (var i = 0; i < n; i++) {
+            var maxm = m[i][i];
+            var row = i;
+            for (var j = i; j < n; j++)
+                if (m[j][i] > maxm) {
+                    maxm = m[j][i];
+                    row = j;
+                }
+
+            if (i != row) {
+                var tmp = id[i];
+                id[i] = id[row];
+                id[row] = tmp;
+            }
+        }
+        return id;
+    }
+
+    var n = A.length;
+    var L = new Array(n);
+    for (var i = 0; i < n; i++) { L[i] = new Array(n); L[i].fill(0) }
+    var U = new Array(n);
+    for (var i = 0; i < n; i++) { U[i] = new Array(n); U[i].fill(0) }
+    var P = pivotize(A);
+    var A2 = matrixMul(P, A);
+
+    for (var j = 0; j < n; j++) {
+        L[j][j] = 1;
+        for (var i = 0; i < j + 1; i++) {
+            var s1 = 0;
+            for (var k = 0; k < i; k++)
+                s1 += U[k][j] * L[i][k];
+            U[i][j] = A2[i][j] - s1;
+        }
+        for (var i = j; i < n; i++) {
+            var s2 = 0;
+            for (var k = 0; k < j; k++)
+                s2 += U[k][j] * L[i][k];
+            L[i][j] = (A2[i][j] - s2) / U[j][j];
+        }
+    }
+    return [L, U, P];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
new file mode 100644
index 0000000000..83d3d2bbfa
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
@@ -0,0 +1,109 @@
+---
+id: 5e6dee7749a0b85a3f1fc7d5
+title: Lucas-Lehmer test
+challengeType: 5
+forumTopicId: 385281
+dashedName: lucas-lehmer-test
+---
+
+# --description--
+
+Lucas-Lehmer Test: for $p$ an odd prime, the Mersenne number $2^p-1$ is prime if and only if $2^p-1$ divides $S(p-1)$ where $S(n+1)=(S(n))^2-2$, and $S(1)=4$.
+
+# --instructions--
+
+Write a function that returns whether the given Mersenne number is prime or not.
+
+# --hints--
+
+`lucasLehmer` should be a function.
+
+```js
+assert(typeof lucasLehmer == 'function');
+```
+
+`lucasLehmer(11)` should return a boolean.
+
+```js
+assert(typeof lucasLehmer(11) == 'boolean');
+```
+
+`lucasLehmer(11)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(11), false);
+```
+
+`lucasLehmer(15)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(15), false);
+```
+
+`lucasLehmer(13)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(13), true);
+```
+
+`lucasLehmer(17)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(17), true);
+```
+
+`lucasLehmer(19)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(19), true);
+```
+
+`lucasLehmer(21)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(21), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lucasLehmer(p) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lucasLehmer(p) {
+    function isPrime(p) {
+        if (p == 2)
+            return true;
+        else if (p <= 1 || p % 2 == 0)
+            return false;
+        else {
+            var to = Math.sqrt(p);
+            for (var i = 3; i <= to; i += 2)
+                if (p % i == 0)
+                    return false;
+            return true;
+        }
+    }
+
+    function isMersennePrime(p) {
+        if (p == 2)
+            return true;
+        else {
+            var m_p = Math.pow(2, p) - 1
+            var s = 4;
+            for (var i = 3; i <= p; i++)
+                s = (s * s - 2) % m_p
+            return s == 0;
+        }
+    }
+
+    return isPrime(p) && isMersennePrime(p)
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
new file mode 100644
index 0000000000..0e7be774f5
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -0,0 +1,129 @@
+---
+id: 5ea281203167d2b0bdefca00
+title: Ludic numbers
+challengeType: 5
+forumTopicId: 385282
+dashedName: ludic-numbers
+---
+
+# --description--
+
+[Ludic numbers](https://oeis.org/wiki/Ludic_numbers) are related to prime numbers as they are generated by a sieve quite like the [Sieve of Eratosthenes](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) is used to generate prime numbers.
+
+The first ludic number is 1.
+
+To generate succeeding ludic numbers create an array of increasing integers starting from 2.
+
+<code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'>2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>
+
+(Loop)
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>2</span>.</li>
+  <li>Remove every <strong>2<sup>nd</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold;'><s>2</s></span> 3 <s>4</s> 5 <s>6</s> 7 <s>8</s> 9 <s>10</s> 11 <s>12</s> 13 <s>14</s> 15 <s>16</s> 17 <s>18</s> 19 <s>20</s> 21 <s>22</s> 23 <s>24</s> 25 <s>26</s> ...</code>
+</ul>
+
+<ul>
+  <li>(Unrolling a few loops...)</li>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>3</span>.</li>
+  <li>Remove every <strong>3<sup>rd</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>3</s></span> 5 7 <s>9</s> 11 13 <s>15</s> 17 19 <s>21</s> 23 25 <s>27</s> 29 31 <s>33</s> 35 37 <s>39</s> 41 43 <s>45</s> 47 49 <s>51</s> ...</code>
+</ul>
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>5</span>.</li>
+  <li>Remove every <strong>5<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>5</s></span> 7 11 13 17 <s>19</s> 23 25 29 31 <s>35</s> 37 41 43 47 <s>49</s> 53 55 59 61 <s>65</s> 67 71 73 77 ...</code>
+</ul>
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>7</span>.</li>
+  <li>Remove every <strong>7<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>7</s></span> 11 13 17 23 25 29 <s>31</s> 37 41 43 47 53 55 <s>59</s> 61 67 71 73 77 83 <s>85</s> 89 91 97 ...</code>
+</ul>
+
+<ul>
+  <li><big><b> ... </b></big></li>
+  <li>Take the first member of the current array as the next ludic number <span style='color:blue;font-weight:bold'>L</span>.</li>
+  <li>Remove every <strong>L<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <li><big><b> ... </b></big></li>
+</ul>
+
+# --instructions--
+
+Write a function that returns all the ludic numbers less than or equal to the given number.
+
+# --hints--
+
+`ludic` should be a function.
+
+```js
+assert(typeof ludic === 'function', '<code>ludic</code> should be a function.');
+```
+
+`ludic(2)` should return a array.
+
+```js
+assert(Array.isArray(ludic(2)));
+```
+
+`ludic(2)` should return `[1, 2]`.
+
+```js
+assert.deepEqual(ludic(2), [1, 2]);
+```
+
+`ludic(3)` should return `[1, 2, 3]`.
+
+```js
+assert.deepEqual(ludic(3), [1, 2, 3]);
+```
+
+`ludic(5)` should return `[1, 2, 3, 5]`.
+
+```js
+assert.deepEqual(ludic(5), [1, 2, 3, 5]);
+```
+
+`ludic(20)` should return `[1, 2, 3, 5, 7, 11, 13, 17]`.
+
+```js
+assert.deepEqual(ludic(20), [1, 2, 3, 5, 7, 11, 13, 17]);
+```
+
+`ludic(26)` should return `[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
+
+```js
+assert.deepEqual(ludic(26), [1, 2, 3, 5, 7, 11, 13, 17, 23, 25]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function ludic(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function ludic(n) {
+  const makeArr = (s, e) => new Array(e + 1 - s).fill(s).map((e, i) => e + i);
+
+  const filterAtInc = (arr, n) => arr.filter((e, i) => (i + 1) % n);
+
+  const makeLudic = (arr, result) => {
+    const iter = arr.shift();
+    result.push(iter);
+    return arr.length ? makeLudic(filterAtInc(arr, iter), result) : result;
+  };
+
+  const ludicResult = makeLudic(makeArr(2, n), [1]);
+
+  return ludicResult;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
new file mode 100644
index 0000000000..0a44e1da79
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -0,0 +1,125 @@
+---
+id: 5ea28156e79528a9ab248f27
+title: Luhn test of credit card numbers
+challengeType: 5
+forumTopicId: 385284
+dashedName: luhn-test-of-credit-card-numbers
+---
+
+# --description--
+
+The [Luhn test](<https://en.wikipedia.org/wiki/Luhn algorithm>) is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
+
+Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:
+
+<ol>
+  <li> Reverse the order of the digits in the number.</li>
+  <li> Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1</li>
+  <li> Taking the second, fourth ... and every other even digit in the reversed digits:</li>
+    <ol>
+      <li>Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits.</li>
+      <li>Sum the partial sums of the even digits to form s2.</li>
+    </ol>
+  <li>If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.</li>
+</ol>
+
+For example, if the trial number is 49927398716:
+
+```bash
+Reverse the digits:
+  61789372994
+Sum the odd digits:
+  6 + 7 + 9 + 7 + 9 + 4 = 42 = s1
+The even digits:
+    1, 8, 3, 2, 9
+  Two times each even digit:
+    2, 16, 6, 4, 18
+  Sum the digits of each multiplication:
+    2, 7, 6, 4, 9
+  Sum the last:
+    2 + 7 + 6 + 4 + 9 = 28 = s2
+
+s1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn test.
+```
+
+# --instructions--
+
+Write a function that will validate a number with the Luhn test. Return true if it's a valid number. Otherwise, return false.
+
+# --hints--
+
+`luhnTest` should be a function.
+
+```js
+assert(typeof luhnTest === 'function');
+```
+
+`luhnTest("4111111111111111")` should return a boolean.
+
+```js
+assert(typeof luhnTest('4111111111111111') === 'boolean');
+```
+
+`luhnTest("4111111111111111")` should return `true`.
+
+```js
+assert.equal(luhnTest('4111111111111111'), true);
+```
+
+`luhnTest("4111111111111112")` should return `false`.
+
+```js
+assert.equal(luhnTest('4111111111111112'), false);
+```
+
+`luhnTest("49927398716")` should return `true`.
+
+```js
+assert.equal(luhnTest('49927398716'), true);
+```
+
+`luhnTest("49927398717")` should return `false`.
+
+```js
+assert.equal(luhnTest('49927398717'), false);
+```
+
+`luhnTest("1234567812345678")` should return `false`.
+
+```js
+assert.equal(luhnTest('1234567812345678'), false);
+```
+
+`luhnTest("1234567812345670")` should return `true`.
+
+```js
+assert.equal(luhnTest('1234567812345670'), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function luhnTest(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function luhnTest(str) {
+  var luhnArr = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9];
+  var counter = 0;
+  var incNum;
+  var odd = false;
+  var temp = String(str).replace(/[^\d]/g, '');
+  if (temp.length == 0) return false;
+  for (var i = temp.length - 1; i >= 0; --i) {
+    incNum = parseInt(temp.charAt(i), 10);
+    counter += (odd = !odd) ? incNum : luhnArr[incNum];
+  }
+  return counter % 10 == 0;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lychrel-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
new file mode 100644
index 0000000000..5ffc202ebd
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
@@ -0,0 +1,151 @@
+---
+id: 5ea2815a8640bcc6cb7dab3c
+title: Lychrel numbers
+challengeType: 5
+forumTopicId: 385287
+dashedName: lychrel-numbers
+---
+
+# --description--
+
+<ol>
+  <li>Take an integer <code>n₀</code>, greater than zero.</li>
+  <li>Form the next number <code>n</code> of the series by reversing <code>n₀</code> and adding it to <code>n₀</code></li>
+  <li>Stop when <code>n</code> becomes palindromic - i.e. the digits of <code>n</code> in reverse order == <code>n</code>.</li>
+</ol>
+
+The above recurrence relation when applied to most starting numbers `n` = 1, 2, ... terminates in a palindrome quite quickly.
+
+For example if `n₀` = 12 we get:
+
+```bash
+12
+12 + 21 = 33,  a palindrome!
+```
+
+And if `n₀` = 55 we get:
+
+```bash
+55
+55 + 55 = 110
+110 + 011 = 121,  a palindrome!
+```
+
+Notice that the check for a palindrome happens *after* an addition.
+
+Some starting numbers seem to go on forever; the recurrence relation for 196 has been calculated for millions of repetitions forming numbers with millions of digits, without forming a palindrome. These numbers that do not end in a palindrome are called **Lychrel numbers**.
+
+For the purposes of this task a Lychrel number is any starting number that does not form a palindrome within 500 (or more) iterations.
+
+**Seed and related Lychrel numbers:**
+
+Any integer produced in the sequence of a Lychrel number is also a Lychrel number.
+
+In general, any sequence from one Lychrel number *might* converge to join the sequence from a prior Lychrel number candidate; for example the sequences for the numbers 196 and then 689 begin:
+
+```bash
+    196
+    196 + 691 = 887
+    887 + 788 = 1675
+    1675 + 5761 = 7436
+    7436 + 6347 = 13783
+    13783 + 38731 = 52514
+    52514 + 41525 = 94039
+    ...
+    689
+    689 + 986 = 1675
+    1675 + 5761 = 7436
+    ...
+```
+
+So we see that the sequence starting with 689 converges to, and continues with the same numbers as that for 196.
+
+Because of this we can further split the Lychrel numbers into true **Seed** Lychrel number candidates, and **Related** numbers that produce no palindromes but have integers in their sequence seen as part of the sequence generated from a lower Lychrel number.
+
+# --instructions--
+
+Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. Otherwise, return false. Remember that the iteration limit is 500.
+
+# --hints--
+
+`isLychrel` should be a function.
+
+```js
+assert(typeof isLychrel === 'function');
+```
+
+`isLychrel(12)` should return a boolean.
+
+```js
+assert(typeof isLychrel(12) === 'boolean');
+```
+
+`isLychrel(12)` should return `false`.
+
+```js
+assert.equal(isLychrel(12), false);
+```
+
+`isLychrel(55)` should return `false`.
+
+```js
+assert.equal(isLychrel(55), false);
+```
+
+`isLychrel(196)` should return `true`.
+
+```js
+assert.equal(isLychrel(196), true);
+```
+
+`isLychrel(879)` should return `true`.
+
+```js
+assert.equal(isLychrel(879), true);
+```
+
+`isLychrel(44987)` should return `false`.
+
+```js
+assert.equal(isLychrel(44987), false);
+```
+
+`isLychrel(7059)` should return `true`.
+
+```js
+assert.equal(isLychrel(7059), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLychrel(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isLychrel(n) {
+  function reverse(num) {
+    return parseInt(
+      num
+        .toString()
+        .split('')
+        .reverse()
+        .join('')
+    );
+  }
+
+  var i;
+  for (i = 0; i < 500; i++) {
+    n = n + reverse(n);
+    if (n == reverse(n)) break;
+  }
+
+  return i == 500;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lzw-compression.md
new file mode 100644
index 0000000000..ccde98aa94
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -0,0 +1,239 @@
+---
+id: 5ea2815e364d9a2222ea55f8
+title: LZW compression
+challengeType: 5
+forumTopicId: 385288
+dashedName: lzw-compression
+---
+
+# --description--
+
+The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.
+
+You can read a complete description of it in the [Wikipedia article](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) on the subject.
+
+# --instructions--
+
+Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
+
+# --hints--
+
+`LZW` should be a function.
+
+```js
+assert(typeof LZW === 'function');
+```
+
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return a array.
+
+```js
+assert(Array.isArray(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT')));
+```
+
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return a string.
+
+```js
+assert(
+  typeof LZW(false, [
+    84,
+    79,
+    66,
+    69,
+    79,
+    82,
+    78,
+    79,
+    84,
+    256,
+    258,
+    260,
+    265,
+    259,
+    261,
+    263
+  ]) === 'string'
+);
+```
+
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return `[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]`.
+
+```js
+assert.deepEqual(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT'), [
+  84,
+  79,
+  66,
+  69,
+  79,
+  82,
+  78,
+  79,
+  84,
+  256,
+  258,
+  260,
+  265,
+  259,
+  261,
+  263
+]);
+```
+
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return `"TOBEORNOTTOBEORTOBEORNOT"`.
+
+```js
+assert.equal(
+  LZW(false, [
+    84,
+    79,
+    66,
+    69,
+    79,
+    82,
+    78,
+    79,
+    84,
+    256,
+    258,
+    260,
+    265,
+    259,
+    261,
+    263
+  ]),
+  'TOBEORNOTTOBEORTOBEORNOT'
+);
+```
+
+`LZW(true, "0123456789")` should return `[48, 49, 50, 51, 52, 53, 54, 55, 56, 57]`.
+
+```js
+assert.deepEqual(LZW(true, '0123456789'), [
+  48,
+  49,
+  50,
+  51,
+  52,
+  53,
+  54,
+  55,
+  56,
+  57
+]);
+```
+
+`LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57])` should return `"0123456789"`.
+
+```js
+assert.equal(
+  LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57]),
+  '0123456789'
+);
+```
+
+`LZW(true, "BABAABAAA")` should return `[66, 65, 256, 257, 65, 260]`.
+
+```js
+assert.deepEqual(LZW(true, 'BABAABAAA'), [66, 65, 256, 257, 65, 260]);
+```
+
+`LZW(false, [66, 65, 256, 257, 65, 260])` should return `"BABAABAAA"`.
+
+```js
+assert.equal(LZW(false, [66, 65, 256, 257, 65, 260]), 'BABAABAAA');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function LZW (compressData, input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function LZW (compressData, input) {
+  function compress(uncompressed) {
+    // Build the dictionary.
+    var i,
+      dictionary = {},
+      c,
+      wc,
+      w = "",
+      result = [],
+      dictSize = 256;
+    for (i = 0; i < 256; i += 1) {
+      dictionary[String.fromCharCode(i)] = i;
+    }
+
+    for (i = 0; i < uncompressed.length; i += 1) {
+      c = uncompressed.charAt(i);
+      wc = w + c;
+      //Do not use dictionary[wc] because javascript arrays
+      //will return values for array['pop'], array['push'] etc
+      // if (dictionary[wc]) {
+      if (dictionary.hasOwnProperty(wc)) {
+        w = wc;
+      } else {
+        result.push(dictionary[w]);
+        // Add wc to the dictionary.
+        dictionary[wc] = dictSize++;
+        w = String(c);
+      }
+    }
+
+    // Output the code for w.
+    if (w !== "") {
+      result.push(dictionary[w]);
+    }
+    return result;
+  }
+
+
+  function decompress(compressed) {
+    // Build the dictionary.
+    var i,
+      dictionary = [],
+      w,
+      result,
+      k,
+      entry = "",
+      dictSize = 256;
+    for (i = 0; i < 256; i += 1) {
+      dictionary[i] = String.fromCharCode(i);
+    }
+
+    w = String.fromCharCode(compressed[0]);
+    result = w;
+    for (i = 1; i < compressed.length; i += 1) {
+      k = compressed[i];
+      if (dictionary[k]) {
+        entry = dictionary[k];
+      } else {
+        if (k === dictSize) {
+          entry = w + w.charAt(0);
+        } else {
+          return null;
+        }
+      }
+
+      result += entry;
+
+      // Add w+entry[0] to the dictionary.
+      dictionary[dictSize++] = w + entry.charAt(0);
+
+      w = entry;
+    }
+    return result;
+  }
+
+  if(compressData){
+    return compress(input)
+  }else{
+    return decompress(input)
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/s-expressions.md
new file mode 100644
index 0000000000..19304897ae
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -0,0 +1,96 @@
+---
+id: 59667989bf71cf555dd5d2ff
+title: S-Expressions
+challengeType: 5
+forumTopicId: 302303
+dashedName: s-expressions
+---
+
+# --description--
+
+[S-Expressions](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") are one convenient way to parse and store data.
+
+# --instructions--
+
+Write a simple reader/parser for S-Expressions that handles quoted and unquoted strings, integers and floats.
+
+The function should read a single but nested S-Expression from a string and return it as a (nested) array.
+
+Newlines and other whitespace may be ignored unless contained within a quoted string.
+
+"`()`" inside quoted strings are not interpreted, but treated as part of the string.
+
+Handling escaped quotes inside a string is optional; thus "`(foo"bar)`" may be treated as a string "`foo"bar`", or as an error.
+
+For this, the reader need not recognize `\` for escaping, but should, in addition, recognize numbers if the language has appropriate data types.
+
+Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. Anything else is allowed without quotes.
+
+The reader should be able to read the following input
+
+<pre>((data "quoted data" 123 4.5)
+(data (!@# (4.5) "(more" "data)")))
+</pre>
+
+and turn it into a native data structure. (See the [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations for examples of native data structures.)
+
+# --hints--
+
+`parseSexpr` should be a function.
+
+```js
+assert(typeof parseSexpr === 'function');
+```
+
+`parseSexpr('(data1 data2 data3)')` should return `['data1', 'data2', 'data3']`
+
+```js
+assert.deepEqual(parseSexpr(simpleSExpr), simpleSolution);
+```
+
+`parseSexpr('((data "quoted data" 123 4.5) (data (!@# (4.5) "(more" "data)")))')` should return `[['data', '"quoted data"', 123, 4.5], ['data', ['!@#', [4.5], '"(more"', '"data)"']]]`.
+
+```js
+assert.deepEqual(parseSexpr(basicSExpr), basicSolution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const simpleSExpr = '(data1 data2 data3)';
+const simpleSolution = ['data1', 'data2', 'data3'];
+
+const basicSExpr = '((data "quoted data" 123 4.5) (data (!@# (4.5) "(more" "data)")))';
+const basicSolution = [["data","\"quoted data\"",123,4.5],["data",["!@#",[4.5],"\"(more\"","\"data)\""]]];
+```
+
+## --seed-contents--
+
+```js
+function parseSexpr(str) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function parseSexpr(str) {
+  const t = str.match(/\s*("[^"]*"|\(|\)|"|[^\s()"]+)/g);
+  for (var o, c = 0, i = t.length - 1; i >= 0; i--) {
+    var n,
+      ti = t[i].trim();
+    if (ti == '"') return;
+    else if (ti == '(') t[i] = '[', c += 1;
+    else if (ti == ')') t[i] = ']', c -= 1;
+    else if ((n = +ti) == ti) t[i] = n;
+    else t[i] = `'${ti.replace('\'', '\\\'')}'`;
+    if (i > 0 && ti != ']' && t[i - 1].trim() != '(') t.splice(i, 0, ',');
+    if (!c) if (!o) o = true; else return;
+  }
+  return c ? undefined : eval(t.join(''));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
new file mode 100644
index 0000000000..ec8a0c6e2d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -0,0 +1,90 @@
+---
+id: 59da22823d04c95919d46269
+title: 'Sailors, coconuts and a monkey problem'
+challengeType: 5
+forumTopicId: 302304
+dashedName: sailors-coconuts-and-a-monkey-problem
+---
+
+# --description--
+
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey. In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
+
+# --instructions--
+
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any amount of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect the mathematics. **C.f:**
+
+<ul>
+  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (Video) Analytical solution.</li>
+  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> The On-Line Encyclopedia of Integer Sequences. (Although some of its references may use the alternate form of the tale).</li>
+</ul>
+
+# --hints--
+
+`splitCoconuts` should be a function.
+
+```js
+assert(typeof splitCoconuts === 'function');
+```
+
+`splitCoconuts(5)` should return 3121.
+
+```js
+assert(splitCoconuts(5) === 3121);
+```
+
+`splitCoconuts(6)` should return 233275.
+
+```js
+assert(splitCoconuts(6) === 233275);
+```
+
+`splitCoconuts(7)` should return 823537.
+
+```js
+assert(splitCoconuts(7) === 823537);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function splitCoconuts(intSailors) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function splitCoconuts(intSailors) {
+  let intNuts = intSailors;
+  let result = splitCoconutsHelper(intNuts, intSailors);
+  while (!result) {
+    intNuts += 1;
+    result = splitCoconutsHelper(intNuts, intSailors);
+  }
+
+  return intNuts;
+}
+
+function splitCoconutsHelper(intNuts, intSailors, intDepth) {
+  const nDepth = intDepth !== undefined ? intDepth : intSailors;
+  const portion = Math.floor(intNuts / intSailors);
+  const remain = intNuts % intSailors;
+
+  if (portion <= 0 || remain !== (nDepth ? 1 : 0)) {
+    return null;
+  }
+
+  if (nDepth) {
+    return splitCoconutsHelper(
+      intNuts - portion - remain, intSailors, nDepth - 1
+    );
+  }
+
+  return intNuts;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
new file mode 100644
index 0000000000..f4fa1a4452
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
@@ -0,0 +1,103 @@
+---
+id: 5eb3e497b8d6d7f63c5517ea
+title: Search a list of records
+challengeType: 5
+forumTopicId: 385315
+dashedName: search-a-list-of-records
+---
+
+# --description--
+
+A record consists of attributes that describe an entity. Each attribute has a name and a value. For example, a person can have an attribute `age` with a value of 25. An important operation on a list of records is to find a record with a particular attribute value.
+
+# --instructions--
+
+Write a function that takes a string as a parameter. The function should return the index of the item in `list` for which the value of the `name` attribute matches the given string.
+
+# --hints--
+
+`searchCity` should be a function.
+
+```js
+assert(typeof searchCity === 'function');
+```
+
+`searchCity("Dar Es Salaam")` should return a number.
+
+```js
+assert(typeof searchCity('Dar Es Salaam') === 'number');
+```
+
+`searchCity("Dar Es Salaam")` should return `6`.
+
+```js
+assert.equal(searchCity('Dar Es Salaam'), 6);
+```
+
+`searchCity("Casablanca")` should return `9`.
+
+```js
+assert.equal(searchCity('Casablanca'), 9);
+```
+
+`searchCity("Cairo")` should return `1`.
+
+```js
+assert.equal(searchCity('Cairo'), 1);
+```
+
+`searchCity("Mogadishu")` should return `4`.
+
+```js
+assert.equal(searchCity('Mogadishu'), 4);
+```
+
+`searchCity("Lagos")` should return `0`.
+
+```js
+assert.equal(searchCity('Lagos'), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function searchCity(name) {
+
+}
+
+const list = [
+  { name: 'Lagos', population: 21.0 },
+  { name: 'Cairo', population: 15.2 },
+  { name: 'Kinshasa-Brazzaville', population: 11.3 },
+  { name: 'Greater Johannesburg', population: 7.55 },
+  { name: 'Mogadishu', population: 5.85 },
+  { name: 'Khartoum-Omdurman', population: 4.98 },
+  { name: 'Dar Es Salaam', population: 4.7 },
+  { name: 'Alexandria', population: 4.58 },
+  { name: 'Abidjan', population: 4.4 },
+  { name: 'Casablanca', population: 3.98 }
+];
+```
+
+# --solutions--
+
+```js
+function searchCity(name) {
+  return list.findIndex(item => item.name === name);
+}
+
+const list = [
+  { name: 'Lagos', population: 21.0 },
+  { name: 'Cairo', population: 15.2 },
+  { name: 'Kinshasa-Brazzaville', population: 11.3 },
+  { name: 'Greater Johannesburg', population: 7.55 },
+  { name: 'Mogadishu', population: 5.85 },
+  { name: 'Khartoum-Omdurman', population: 4.98 },
+  { name: 'Dar Es Salaam', population: 4.7 },
+  { name: 'Alexandria', population: 4.58 },
+  { name: 'Abidjan', population: 4.4 },
+  { name: 'Casablanca', population: 3.98 }
+];
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sedols.md
new file mode 100644
index 0000000000..9d5ce33e9d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sedols.md
@@ -0,0 +1,96 @@
+---
+id: 59d9c6bc214c613ba73ff012
+title: SEDOLs
+challengeType: 5
+forumTopicId: 302305
+dashedName: sedols
+---
+
+# --description--
+
+For each number list of 6-digit [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
+
+<pre>
+710889 => 7108899
+B0YBKJ => B0YBKJ7
+406566 => 4065663
+B0YBLH => B0YBLH2
+228276 => 2282765
+B0YBKL => B0YBKL9
+557910 => 5579107
+B0YBKR => B0YBKR5
+585284 => 5852842
+B0YBKT => B0YBKT7
+B00030 => B000300
+</pre>
+
+Check that each input is correctly formed, especially with respect to valid characters allowed in a SEDOL string. Your function should return `null` on an invalid input.
+
+# --hints--
+
+`sedol` should be a function.
+
+```js
+assert(typeof sedol === 'function');
+```
+
+`sedol('a')` should return null.
+
+```js
+assert(sedol('a') === null);
+```
+
+`sedol('710889')` should return '7108899'.
+
+```js
+assert(sedol('710889') === '7108899');
+```
+
+`sedol('BOATER')` should return null.
+
+```js
+assert(sedol('BOATER') === null);
+```
+
+`sedol('228276')` should return '2282765'.
+
+```js
+assert(sedol('228276') === '2282765');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sedol(input) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function sedol(input) {
+  const checkDigit = sedolCheckDigit(input);
+  if (checkDigit !== null) {
+    return input + checkDigit;
+  }
+  return null;
+}
+
+const weight = [1, 3, 1, 7, 3, 9, 1];
+function sedolCheckDigit(char6) {
+  if (char6.search(/^[0-9BCDFGHJKLMNPQRSTVWXYZ]{6}$/) === -1) {
+    return null;
+  }
+
+  let sum = 0;
+  for (let i = 0; i < char6.length; i++) {
+    sum += weight[i] * parseInt(char6.charAt(i), 36);
+  }
+  const check = (10 - (sum % 10)) % 10;
+  return check.toString();
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
new file mode 100644
index 0000000000..5ff2f5c992
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -0,0 +1,100 @@
+---
+id: 5eaf48389ee512d4d103684b
+title: Self Describing Numbers
+challengeType: 5
+forumTopicId: 385289
+dashedName: self-describing-numbers
+---
+
+# --description--
+
+There are several so-called "self describing" or ["self-descriptive"](https://en.wikipedia.org/wiki/Self-descriptive_number) integers.
+
+An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number.
+
+For example, **2020** is a four-digit self describing number:
+
+<ul>
+    <li> position 0 has value 2 and there are two 0s in the number; </li>
+    <li> position 1 has value 0 and there are no 1s in the number; </li>
+    <li> position 2 has value 2 and there are two 2s; </li>
+    <li> position 3 has value 0 and there are zero 3s; </li>
+</ul>
+
+Self-describing numbers &lt; 100,000,000 are: 1210, 2020, 21200, 3211000, 42101000.
+
+# --instructions--
+
+Write a function that takes a positive integer as a parameter. If it is self-describing return true. Otherwise, return false.
+
+# --hints--
+
+`isSelfDescribing` should be a function.
+
+```js
+assert(typeof isSelfDescribing == 'function');
+```
+
+`isSelfDescribing()` should return a boolean.
+
+```js
+assert(typeof isSelfDescribing(2020) == 'boolean');
+```
+
+`isSelfDescribing(2020)` should return `true`.
+
+```js
+assert.equal(isSelfDescribing(2020), true);
+```
+
+`isSelfDescribing(3021)` should return `false`.
+
+```js
+assert.equal(isSelfDescribing(3021), false);
+```
+
+`isSelfDescribing(3211000)` should return `true`.
+
+```js
+assert.equal(isSelfDescribing(3211000), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSelfDescribing(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isSelfDescribing(n) {
+    let digits = String(n).split("");
+    digits = digits.map(function(e) {return parseInt(e)});
+    let count = digits.map((x) => {return 0})
+    digits.forEach((d) =>{
+        if (d >= count.length) {
+            return false
+        }
+        count[d] += 1;
+    });
+
+     if (digits === count) {
+        return true;
+    }
+    if (digits.length != count.length) {
+        return false;
+    }
+    
+    for (let i=0; i< digits.length; i++){
+      if (digits[i] !== count[i]) {
+        return false;
+      }
+    }
+    return true;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
new file mode 100644
index 0000000000..0cc45a42ff
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -0,0 +1,202 @@
+---
+id: 5eb3e4a21f462f409d656c73
+title: Self-referential sequence
+challengeType: 5
+forumTopicId: 385317
+dashedName: self-referential-sequence
+---
+
+# --description--
+
+There are several ways to generate a self-referential sequence. One very common one (the [Look-and-say sequence](<https://rosettacode.org/wiki/Look-and-say sequence>)) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
+
+<pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
+
+The terms generated grow in length geometrically and never converge.
+
+Another way to generate a self-referential sequence is to summarize the previous term.
+
+Count how many of each alike digit there is, then concatenate the sum and digit for each of the sorted enumerated digits. Note that the first five terms are the same as for the previous sequence.
+
+<pre>0, 10, 1110, 3110, 132110, 13123110, 23124110 ...</pre>
+
+Sort the digits largest to smallest. Do not include counts of digits that do not appear in the previous term.
+
+Depending on the seed value, series generated this way always either converge to a stable value or to a short cyclical pattern. (For our purposes, converge means that an element matches a previously seen element.) The sequence shown, with a seed value of 0, converges to a stable value of 1433223110 after 11 iterations. The seed value that converges most quickly is 22. It goes stable after the first element. (The next element is 22, which has been seen before.)
+
+# --instructions--
+
+Write a function that takes the seed value as parameter, generates a self referential sequence until it converges, and returns it as an array.
+
+# --hints--
+
+`selfReferential` should be a function.
+
+```js
+assert(typeof selfReferential === 'function');
+```
+
+`selfReferential(40)` should return a array.
+
+```js
+assert(Array.isArray(selfReferential(40)));
+```
+
+`selfReferential(40)` should return `["40", "1410", "142110", "14123110", "1413124110", "2413125110", "151413224110", "152413225110", "251413324110", "152423224110", "152413423110"]`.
+
+```js
+assert.deepEqual(selfReferential(40), [
+  '40',
+  '1410',
+  '142110',
+  '14123110',
+  '1413124110',
+  '2413125110',
+  '151413224110',
+  '152413225110',
+  '251413324110',
+  '152423224110',
+  '152413423110'
+]);
+```
+
+`selfReferential(132110)` should return `["132110", "13123110", "23124110", "1413223110", "1423224110", "2413323110", "1433223110"]`.
+
+```js
+assert.deepEqual(selfReferential(132110), [
+  '132110',
+  '13123110',
+  '23124110',
+  '1413223110',
+  '1423224110',
+  '2413323110',
+  '1433223110'
+]);
+```
+
+`selfReferential(132211)` should return `["132211", "132231", "232221", "134211", "14131231", "14231241", "24132231", "14233221"]`.
+
+```js
+assert.deepEqual(selfReferential(132211), [
+  '132211',
+  '132231',
+  '232221',
+  '134211',
+  '14131231',
+  '14231241',
+  '24132231',
+  '14233221'
+]);
+```
+
+`selfReferential(1413223110)` should return `["1413223110", "1423224110", "2413323110", "1433223110"]`.
+
+```js
+assert.deepEqual(selfReferential(1413223110), [
+  '1413223110',
+  '1423224110',
+  '2413323110',
+  '1433223110'
+]);
+```
+
+`selfReferential(251413126110)` should return `["251413126110", "16151413225110", "16251413226110", "26151413325110", "16251423225110", "16251413424110", "16153413225110"]`.
+
+```js
+assert.deepEqual(selfReferential(251413126110), [
+  '251413126110',
+  '16151413225110',
+  '16251413226110',
+  '26151413325110',
+  '16251423225110',
+  '16251413424110',
+  '16153413225110'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function selfReferential(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function selfReferential(n) {
+  var descending,
+    i,
+    incr,
+    j,
+    max_i,
+    max_len,
+    max_seq,
+    seq,
+    sequence,
+    indexOf =
+      [].indexOf ||
+      function(item) {
+        for (var i = 0, l = this.length; i < l; i++) {
+          if (i in this && this[i] === item) return i;
+        }
+        return -1;
+      };
+
+  sequence = function(n) {
+    var c, cnt, cnts, d, digit, i, j, l, len, new_cnts, ref, s, seq;
+    cnts = {};
+    ref = n.toString();
+    for (j = 0, len = ref.length; j < len; j++) {
+      c = ref[j];
+      d = parseInt(c);
+      incr(cnts, d);
+    }
+    seq = [ref];
+    while (true) {
+      s = '';
+      for (i = l = 9; l >= 0; i = --l) {
+        if (cnts[i]) {
+          s += '' + cnts[i] + i;
+        }
+      }
+      if (indexOf.call(seq, s) >= 0) {
+        break;
+      }
+      seq.push(s);
+      new_cnts = {};
+      for (digit in cnts) {
+        cnt = cnts[digit];
+        incr(new_cnts, cnt);
+        incr(new_cnts, digit);
+      }
+      cnts = new_cnts;
+    }
+    return seq;
+  };
+
+  incr = function(h, k) {
+    if (h[k] == null) {
+      h[k] = 0;
+    }
+    return (h[k] += 1);
+  };
+
+  descending = function(n) {
+    var tens;
+    if (n < 10) {
+      return true;
+    }
+    tens = n / 10;
+    if (n % 10 > tens % 10) {
+      return false;
+    }
+    return descending(tens);
+  };
+
+  return sequence(n);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/semiprime.md
new file mode 100644
index 0000000000..961f13632f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -0,0 +1,146 @@
+---
+id: 5eb3e4aa847216613aa81983
+title: Semiprime
+challengeType: 5
+forumTopicId: 385318
+dashedName: semiprime
+---
+
+# --description--
+
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) [prime numbers](https://rosettacode.org/wiki/prime_number).
+
+<pre>1679  =  23 x 73</pre>
+
+# --instructions--
+
+Write a function that returns true if a number is semiprime, or false if it is not.
+
+# --hints--
+
+`isSemiPrime` should be a function.
+
+```js
+assert(typeof isSemiPrime === 'function');
+```
+
+`isSemiPrime(100)` should return a boolean.
+
+```js
+assert(typeof isSemiPrime(100) === 'boolean');
+```
+
+`isSemiPrime(100)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(100), false);
+```
+
+`isSemiPrime(504)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(504), false);
+```
+
+`isSemiPrime(4)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(4), true);
+```
+
+`isSemiPrime(46)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(46), true);
+```
+
+`isSemiPrime(13)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(13), false);
+```
+
+`isSemiPrime(74)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(74), true);
+```
+
+`isSemiPrime(1679)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(1679), true);
+```
+
+`isSemiPrime(2)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(2), false);
+```
+
+`isSemiPrime(95)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(95), true);
+```
+
+`isSemiPrime(124)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(124), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSemiPrime(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isSemiPrime(n) {
+  if (n <= 3) return false;
+
+  var ans = [];
+  var done = false;
+  while (!done) {
+    if (n % 2 === 0) {
+      ans.push(2);
+      n /= 2;
+      continue;
+    }
+    if (n % 3 === 0) {
+      ans.push(3);
+      n /= 3;
+      continue;
+    }
+    if (n === 1) return ans.length == 2;
+    var sr = Math.sqrt(n);
+    done = true;
+    // try to divide the checked number by all numbers till its square root.
+    for (var i = 6; i <= sr; i += 6) {
+      if (n % (i - 1) === 0) {
+        // is n divisible by i-1?
+        ans.push(i - 1);
+        n /= i - 1;
+        done = false;
+        break;
+      }
+      if (n % (i + 1) === 0) {
+        // is n divisible by i+1?
+        ans.push(i + 1);
+        n /= i + 1;
+        done = false;
+        break;
+      }
+    }
+  }
+  ans.push(n);
+  return ans.length == 2;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-consolidation.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-consolidation.md
new file mode 100644
index 0000000000..3a97b090b3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-consolidation.md
@@ -0,0 +1,196 @@
+---
+id: 5eb3e4af7d0e7b760b46cedc
+title: Set consolidation
+challengeType: 5
+forumTopicId: 385319
+dashedName: set-consolidation
+---
+
+# --description--
+
+Given two sets of items then if any item is common to any set then the result of applying *consolidation* to those sets is a set of sets whose contents is:
+
+<ul>
+  <li>The two input sets if no common item exists between the two input sets of items.</li>
+  <li>The single set that is the union of the two input sets if they share a common item.</li>
+</ul>
+
+Given N sets of items where N > 2 then the result is the same as repeatedly replacing all combinations of two sets by their consolidation until no further consolidation between set pairs is possible. If N &lt; 2 then consolidation has no strict meaning and the input can be returned.
+
+Here are some examples:
+
+**Example 1:**
+
+Given the two sets `{A,B}` and `{C,D}` then there is no common element between the sets and the result is the same as the input.
+
+**Example 2:**
+
+Given the two sets `{A,B}` and `{B,D}` then there is a common element `B` between the sets and the result is the single set `{B,D,A}`. (Note that order of items in a set is immaterial: `{A,B,D}` is the same as `{B,D,A}` and `{D,A,B}`, etc).
+
+**Example 3:**
+
+Given the three sets `{A,B}` and `{C,D}` and `{D,B}` then there is no common element between the sets `{A,B}` and `{C,D}` but the sets `{A,B}` and `{D,B}` do share a common element that consolidates to produce the result `{B,D,A}`. On examining this result with the remaining set, `{C,D}`, they share a common element and so consolidate to the final output of the single set `{A,B,C,D}`
+
+**Example 4:**
+
+The consolidation of the five sets:
+
+`{H,I,K}`, `{A,B}`, `{C,D}`, `{D,B}`, and `{F,G,H}`
+
+Is the two sets:
+
+`{A, C, B, D}`, and `{G, F, I, H, K}`
+
+# --instructions--
+
+Write a function that takes an array of strings as a parameter. Each string is represents a set with the characters representing the set elements. The function should return a 2D array containing the consolidated sets. Note: Each set should be sorted.
+
+# --hints--
+
+`setConsolidation` should be a function.
+
+```js
+assert(typeof setConsolidation === 'function');
+```
+
+`setConsolidation(["AB", "CD"])` should return a array.
+
+```js
+assert(Array.isArray(setConsolidation(['AB', 'CD'])));
+```
+
+`setConsolidation(["AB", "CD"])` should return `[["C", "D"], ["A", "B"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'CD']), [
+  ['C', 'D'],
+  ['A', 'B']
+]);
+```
+
+`setConsolidation(["AB", "BD"])` should return `[["A", "B", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'BD']), [['A', 'B', 'D']]);
+```
+
+`setConsolidation(["AB", "CD", "DB"])` should return `[["A", "B", "C", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'CD', 'DB']), [['A', 'B', 'C', 'D']]);
+```
+
+`setConsolidation(["HIK", "AB", "CD", "DB", "FGH"])` should return `[["F", "G", "H", "I", "K"], ["A", "B", "C", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['HIK', 'AB', 'CD', 'DB', 'FGH']), [
+  ['F', 'G', 'H', 'I', 'K'],
+  ['A', 'B', 'C', 'D']
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function setConsolidation(sets) {
+
+}
+```
+
+# --solutions--
+
+```js
+function setConsolidation(sets) {
+  function addAll(l1, l2) {
+    l2.forEach(function(e) {
+      if (l1.indexOf(e) == -1) l1.push(e);
+    });
+  }
+
+  function consolidate(sets) {
+    var r = [];
+    for (var i = 0; i < sets.length; i++) {
+      var s = sets[i];
+      {
+        var new_r = [];
+        new_r.push(s);
+        for (var j = 0; j < r.length; j++) {
+          var x = r[j];
+          {
+            if (
+              !(function(c1, c2) {
+                for (var i = 0; i < c1.length; i++) {
+                  if (c2.indexOf(c1[i]) >= 0) return false;
+                }
+                return true;
+              })(s, x)
+            ) {
+              (function(l1, l2) {
+                addAll(l1, l2);
+              })(s, x);
+            } else {
+              new_r.push(x);
+            }
+          }
+        }
+        r = new_r;
+      }
+    }
+    return r;
+  }
+
+  function consolidateR(sets) {
+    if (sets.length < 2) return sets;
+    var r = [];
+    r.push(sets[0]);
+    {
+      var arr1 = consolidateR(sets.slice(1, sets.length));
+      for (var i = 0; i < arr1.length; i++) {
+        var x = arr1[i];
+        {
+          if (
+            !(function(c1, c2) {
+              for (var i = 0; i < c1.length; i++) {
+                if (c2.indexOf(c1[i]) >= 0) return false;
+              }
+              return true;
+            })(r[0], x)
+          ) {
+            (function(l1, l2) {
+              return l1.push.apply(l1, l2);
+            })(r[0], x);
+          } else {
+            r.push(x);
+          }
+        }
+      }
+    }
+    return r;
+  }
+
+  function hashSetList(set) {
+    var r = [];
+    for (var i = 0; i < set.length; i++) {
+      r.push([]);
+      for (var j = 0; j < set[i].length; j++)
+        (function(s, e) {
+          if (s.indexOf(e) == -1) {
+            s.push(e);
+            return true;
+          } else {
+            return false;
+          }
+        })(r[i], set[i].charAt(j));
+    }
+    return r;
+  }
+
+  var h1 = consolidate(hashSetList(sets)).map(function(e) {
+    e.sort();
+    return e;
+  });
+  return h1;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
new file mode 100644
index 0000000000..7633b59b8a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
@@ -0,0 +1,239 @@
+---
+id: 5eb3e4b20aa93c437f9e9717
+title: Set of real numbers
+challengeType: 5
+forumTopicId: 385322
+dashedName: set-of-real-numbers
+---
+
+# --description--
+
+All real numbers form the uncountable set ℝ. Among its subsets, relatively simple are the convex sets, each expressed as a range between two real numbers *a* and *b* where *a* ≤ *b*. There are actually four cases for the meaning of "between", depending on open or closed boundary:
+
+<ul>
+  <li>[<i>a</i>, <i>b</i>]: {<i>x</i> | <i>a</i> ≤ <i>x</i> and <i>x</i> ≤ <i>b</i> }</li>
+  <li>(<i>a</i>, <i>b</i>): {<i>x</i> | <i>a</i> < <i>x</i> and <i>x</i> < <i>b</i> }</li>
+  <li>[<i>a</i>, <i>b</i>): {<i>x</i> | <i>a</i> ≤ <i>x</i> and <i>x</i> < <i>b</i> }</li>
+  <li>(<i>a</i>, <i>b</i>]: {<i>x</i> | <i>a</i> < <i>x</i> and <i>x</i> ≤ <i>b</i> }</li>
+</ul>
+
+Note that if *a* = *b*, of the four only \[*a*, *a*] would be non-empty.
+
+**Task**
+
+<ul>
+  <li>Devise a way to represent any set of real numbers, for the definition of "any" in the implementation notes below.</li>
+  <li>Provide methods for these common set operations (<i>x</i> is a real number; <i>A</i> and <i>B</i> are sets):</li>
+  <ul>
+    <li>
+      <i>x</i> ∈ <i>A</i>: determine if <i>x</i> is an element of <i>A</i><br>
+      example: 1 is in [1, 2), while 2, 3, ... are not.
+    </li>
+    <li>
+      <i>A</i> ∪ <i>B</i>: union of <i>A</i> and <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> or <i>x</i> ∈ <i>B</i>}<br>
+      example: [0, 2) ∪ (1, 3) = [0, 3); [0, 1) ∪ (2, 3] = well, [0, 1) ∪ (2, 3]
+    </li>
+    <li>
+      <i>A</i> ∩ <i>B</i>: intersection of <i>A</i> and <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> and <i>x</i> ∈ <i>B</i>}<br>
+      example: [0, 2) ∩ (1, 3) = (1, 2); [0, 1) ∩ (2, 3] = empty set
+    </li>
+    <li>
+      <i>A</i> - <i>B</i>: difference between <i>A</i> and <i>B</i>, also written as <i>A</i> \ <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> and <i>x</i> ∉ <i>B</i>}<br>
+      example: [0, 2) − (1, 3) = [0, 1]
+    </li>
+  </ul>
+</ul>
+
+# --instructions--
+
+Write a function that takes 2 objects, a string and an array as parameters. The objects represents the set and have attributes: `low`, `high` and `rangeType`.
+
+The `rangeType` can have values 0, 1, 2 and 3 for `CLOSED`, `BOTH_OPEN`, `LEFT_OPEN` and `RIGHT_OPEN`, respectively. The function should implement a set using this information.
+
+The string represents the operation to be performed on the sets. It can be: `"union"`, `"intersect"` and `"subtract"` (difference).
+
+After performing the operation, the function should check if the values in the array are present in the resultant set and store a corresponding boolean value to an array. The function should return this array.
+
+# --hints--
+
+`realSet` should be a function.
+
+```js
+assert(typeof realSet == 'function');
+```
+
+`realSet({"low":0, "high":1, "rangeType":2}, {"low":0, "high":2, "rangeType":3}, "union", [1, 2, 3])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    realSet(
+      { low: 0, high: 1, rangeType: 2 },
+      { low: 0, high: 2, rangeType: 3 },
+      'union',
+      [1, 2, 3]
+    )
+  )
+);
+```
+
+`realSet({"low":0, "high":1, "rangeType":2}, {"low":0, "high":2, "rangeType":3}, "union", [1, 2, 3])` should return `[true, false, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 1, rangeType: 2 },
+    { low: 0, high: 2, rangeType: 3 },
+    'union',
+    [1, 2, 3]
+  ),
+  [true, false, false]
+);
+```
+
+`realSet({"low":0, "high":2, "rangeType":3}, {"low":1, "high":2, "rangeType":2}, "intersect", [0, 1, 2])` should return `[false, false, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 2, rangeType: 3 },
+    { low: 1, high: 2, rangeType: 2 },
+    'intersect',
+    [0, 1, 2]
+  ),
+  [false, false, false]
+);
+```
+
+`realSet({"low":0, "high":3, "rangeType":3}, {"low":0, "high":1, "rangeType":1}, "subtract", [0, 1, 2])` should return `[true, true, true]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 3, rangeType: 3 },
+    { low: 0, high: 1, rangeType: 1 },
+    'subtract',
+    [0, 1, 2]
+  ),
+  [true, true, true]
+);
+```
+
+`realSet({"low":0, "high":3, "rangeType":3}, {"low":0, "high":1, "rangeType":0}, "subtract", [0, 1, 2])` should return `[false, false, true]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 3, rangeType: 3 },
+    { low: 0, high: 1, rangeType: 0 },
+    'subtract',
+    [0, 1, 2]
+  ),
+  [false, false, true]
+);
+```
+
+`realSet({"low":0, "high":33, "rangeType":1}, {"low":30, "high":31, "rangeType":0}, "intersect", [30, 31, 32])` should return `[true, true, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 33, rangeType: 1 },
+    { low: 30, high: 31, rangeType: 0 },
+    'intersect',
+    [30, 31, 32]
+  ),
+  [true, true, false]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function realSet(set1, set2, operation, values) {
+
+}
+```
+
+# --solutions--
+
+```js
+function realSet(set1, set2, operation, values) {
+  const RangeType = {
+    CLOSED: 0,
+    BOTH_OPEN: 1,
+    LEFT_OPEN: 2,
+    RIGHT_OPEN: 3
+  };
+
+  function Predicate(test) {
+    this.test = test;
+    this.or = function(other) {
+      return new Predicate(t => this.test(t) || other.test(t));
+    };
+    this.and = function(other) {
+      return new Predicate(t => this.test(t) && other.test(t));
+    };
+    this.negate = function() {
+      return new Predicate(t => !this.test(t));
+    };
+  }
+
+  function RealSet(start, end, rangeType, predF) {
+    this.low = start;
+    this.high = end;
+
+    if (predF) {
+      this.predicate = new Predicate(predF);
+    } else {
+      this.predicate = new Predicate(d => {
+        switch (rangeType) {
+          case RangeType.CLOSED:
+            return start <= d && d <= end;
+          case RangeType.BOTH_OPEN:
+            return start < d && d < end;
+          case RangeType.LEFT_OPEN:
+            return start < d && d <= end;
+          case RangeType.RIGHT_OPEN:
+            return start <= d && d < end;
+        }
+      });
+    }
+
+    this.contains = function(d) {
+      return this.predicate.test(d);
+    };
+
+    this.union = function(other) {
+      var low2 = Math.min(this.low, other.low);
+      var high2 = Math.max(this.high, other.high);
+      return new RealSet(low2, high2, null, d =>
+        this.predicate.or(other.predicate).test(d)
+      );
+    };
+
+    this.intersect = function(other) {
+      var low2 = Math.min(this.low, other.low);
+      var high2 = Math.max(this.high, other.high);
+      return new RealSet(low2, high2, null, d =>
+        this.predicate.and(other.predicate).test(d)
+      );
+    };
+
+    this.subtract = function(other) {
+      return new RealSet(this.low, this.high, null, d =>
+        this.predicate.and(other.predicate.negate()).test(d)
+      );
+    };
+  }
+  set1 = new RealSet(set1.low, set1.high, set1.rangeType);
+  set2 = new RealSet(set2.low, set2.high, set2.rangeType);
+  var result = [];
+  values.forEach(function(value) {
+    result.push(set1[operation](set2).contains(value));
+  });
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-1.md
new file mode 100644
index 0000000000..dfdbce67dc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -0,0 +1,180 @@
+---
+id: 5eb3e4b5f629b9a07429a5d2
+title: SHA-1
+challengeType: 5
+forumTopicId: 385326
+dashedName: sha-1
+---
+
+# --description--
+
+**SHA-1** or **SHA1** is a one-way hash function; it computes a 160-bit message digest.
+
+SHA-1 often appears in security protocols; for example, many HTTPS websites use RSA with SHA-1 to secure their connections.
+
+BitTorrent uses SHA-1 to verify downloads.
+
+Git and Mercurial use SHA-1 digests to identify commits.
+
+A US government standard, [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1), defines SHA-1.
+
+# --instructions--
+
+Write a function that returns the SHA-1 message digest for a given string.
+
+# --hints--
+
+`SHA1` should be a function.
+
+```js
+assert(typeof SHA1 === 'function');
+```
+
+`SHA1("abc")` should return a string.
+
+```js
+assert(typeof SHA1('abc') === 'string');
+```
+
+`SHA1("abc")` should return `"a9993e364706816aba3e25717850c26c9cd0d89d"`.
+
+```js
+assert.equal(SHA1('abc'), 'a9993e364706816aba3e25717850c26c9cd0d89d');
+```
+
+`SHA1("Rosetta Code")` should return `"48c98f7e5a6e736d790ab740dfc3f51a61abe2b5"`.
+
+```js
+assert.equal(SHA1('Rosetta Code'), '48c98f7e5a6e736d790ab740dfc3f51a61abe2b5');
+```
+
+`SHA1("Hello world")` should return `"7b502c3a1f48c8609ae212cdfb639dee39673f5e"`.
+
+```js
+assert.equal(SHA1('Hello world'), '7b502c3a1f48c8609ae212cdfb639dee39673f5e');
+```
+
+`SHA1("Programming")` should return `"d1a946bf8b2f2a7292c250063ee28989d742cd4b"`.
+
+```js
+assert.equal(SHA1('Programming'), 'd1a946bf8b2f2a7292c250063ee28989d742cd4b');
+```
+
+`SHA1("is Awesome")` should return `"6537205da59c72b57ed3881843c2d24103d683a3"`.
+
+```js
+assert.equal(SHA1('is Awesome'), '6537205da59c72b57ed3881843c2d24103d683a3');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function SHA1(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function SHA1(input) {
+  var hexcase = 0;
+  var b64pad = '';
+  var chrsz = 8;
+
+  function hex_sha1(s) {
+    return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
+  }
+
+  function core_sha1(x, len) {
+    x[len >> 5] |= 0x80 << (24 - (len % 32));
+    x[(((len + 64) >> 9) << 4) + 15] = len;
+
+    var w = Array(80);
+    var a = 1732584193;
+    var b = -271733879;
+    var c = -1732584194;
+    var d = 271733878;
+    var e = -1009589776;
+
+    for (var i = 0; i < x.length; i += 16) {
+      var olda = a;
+      var oldb = b;
+      var oldc = c;
+      var oldd = d;
+      var olde = e;
+
+      for (var j = 0; j < 80; j++) {
+        if (j < 16) w[j] = x[i + j];
+        else w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
+        var t = safe_add(
+          safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
+          safe_add(safe_add(e, w[j]), sha1_kt(j))
+        );
+        e = d;
+        d = c;
+        c = rol(b, 30);
+        b = a;
+        a = t;
+      }
+
+      a = safe_add(a, olda);
+      b = safe_add(b, oldb);
+      c = safe_add(c, oldc);
+      d = safe_add(d, oldd);
+      e = safe_add(e, olde);
+    }
+    return Array(a, b, c, d, e);
+  }
+
+  function sha1_ft(t, b, c, d) {
+    if (t < 20) return (b & c) | (~b & d);
+    if (t < 40) return b ^ c ^ d;
+    if (t < 60) return (b & c) | (b & d) | (c & d);
+    return b ^ c ^ d;
+  }
+
+  function sha1_kt(t) {
+    return t < 20
+      ? 1518500249
+      : t < 40
+      ? 1859775393
+      : t < 60
+      ? -1894007588
+      : -899497514;
+  }
+
+  function safe_add(x, y) {
+    var lsw = (x & 0xffff) + (y & 0xffff);
+    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+    return (msw << 16) | (lsw & 0xffff);
+  }
+
+  function rol(num, cnt) {
+    return (num << cnt) | (num >>> (32 - cnt));
+  }
+
+  function str2binb(str) {
+    var bin = Array();
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < str.length * chrsz; i += chrsz)
+      bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - (i % 32));
+    return bin;
+  }
+
+  function binb2hex(binarray) {
+    var hex_tab = hexcase ? '0123456789ABCDEF' : '0123456789abcdef';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i++) {
+      str +=
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8 + 4)) & 0xf) +
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8)) & 0xf);
+    }
+    return str;
+  }
+
+  return hex_sha1(input);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-256.md
new file mode 100644
index 0000000000..ba3af1f527
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sha-256.md
@@ -0,0 +1,436 @@
+---
+id: 5eb3e4c3a894c333d2811a3f
+title: SHA-256
+challengeType: 5
+forumTopicId: 385328
+dashedName: sha-256
+---
+
+# --description--
+
+The `SHA-2` family is a stronger alternative to `SHA-1`. The main difference between them is the length of the hash.
+Meaning `SHA-1` provides a shorter code with fewer possibilities for unique combinations. `SHA-2` or `SHA-256` creates a longer and thus more complex hash with more possibilities.
+
+# --instructions--
+
+Research implemenation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
+
+# --hints--
+
+`SHA256` should be a function.
+
+```js
+assert(typeof SHA256 === 'function');
+```
+
+`SHA256("Rosetta code")` should return a string.
+
+```js
+assert(typeof SHA256('Rosetta code') === 'string');
+```
+
+`SHA256("Rosetta code")` should return `"764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf"`.
+
+```js
+assert.equal(
+  SHA256('Rosetta code'),
+  '764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf'
+);
+```
+
+`SHA256("SHA-256 Hash")` should return `"bee8c0cabdcf8c7835f40217dd35a8b0dba9134520e633f1c57285f35ca7ee3e"`.
+
+```js
+assert.equal(
+  SHA256('SHA-256 Hash'),
+  'bee8c0cabdcf8c7835f40217dd35a8b0dba9134520e633f1c57285f35ca7ee3e'
+);
+```
+
+`SHA256("implementation")` should return `"da31012c40330e7e21538e7dd57503b16e8a0839159e96137090cccc9910b171"`.
+
+```js
+assert.equal(
+  SHA256('implementation'),
+  'da31012c40330e7e21538e7dd57503b16e8a0839159e96137090cccc9910b171'
+);
+```
+
+`SHA256("algorithm")` should return `"b1eb2ec8ac9f31ff7918231e67f96e6deda83a9ff33ed2c67443f1df81e5ed14"`.
+
+```js
+assert.equal(
+  SHA256('algorithm'),
+  'b1eb2ec8ac9f31ff7918231e67f96e6deda83a9ff33ed2c67443f1df81e5ed14'
+);
+```
+
+`SHA256("language")` should return `"a4ef304ba42a200bafd78b046e0869af9183f6eee5524aead5dcb3a5ab5f8f3f"`.
+
+```js
+assert.equal(
+  SHA256('language'),
+  'a4ef304ba42a200bafd78b046e0869af9183f6eee5524aead5dcb3a5ab5f8f3f'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function SHA256(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function SHA256(input) {
+  var chrsz = 8;
+  var hexcase = 0;
+
+  function safe_add(x, y) {
+    var lsw = (x & 0xffff) + (y & 0xffff);
+    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+    return (msw << 16) | (lsw & 0xffff);
+  }
+
+  function S(X, n) {
+    return (X >>> n) | (X << (32 - n));
+  }
+
+  function R(X, n) {
+    return X >>> n;
+  }
+
+  function Ch(x, y, z) {
+    return (x & y) ^ (~x & z);
+  }
+
+  function Maj(x, y, z) {
+    return (x & y) ^ (x & z) ^ (y & z);
+  }
+
+  function Sigma0256(x) {
+    return S(x, 2) ^ S(x, 13) ^ S(x, 22);
+  }
+
+  function Sigma1256(x) {
+    return S(x, 6) ^ S(x, 11) ^ S(x, 25);
+  }
+
+  function Gamma0256(x) {
+    return S(x, 7) ^ S(x, 18) ^ R(x, 3);
+  }
+
+  function Gamma1256(x) {
+    return S(x, 17) ^ S(x, 19) ^ R(x, 10);
+  }
+
+  function Sigma0512(x) {
+    return S(x, 28) ^ S(x, 34) ^ S(x, 39);
+  }
+
+  function Sigma1512(x) {
+    return S(x, 14) ^ S(x, 18) ^ S(x, 41);
+  }
+
+  function Gamma0512(x) {
+    return S(x, 1) ^ S(x, 8) ^ R(x, 7);
+  }
+
+  function Gamma1512(x) {
+    return S(x, 19) ^ S(x, 61) ^ R(x, 6);
+  }
+
+  function core_sha256(m, l) {
+    var K = new Array(
+      0x428a2f98,
+      0x71374491,
+      0xb5c0fbcf,
+      0xe9b5dba5,
+      0x3956c25b,
+      0x59f111f1,
+      0x923f82a4,
+      0xab1c5ed5,
+      0xd807aa98,
+      0x12835b01,
+      0x243185be,
+      0x550c7dc3,
+      0x72be5d74,
+      0x80deb1fe,
+      0x9bdc06a7,
+      0xc19bf174,
+      0xe49b69c1,
+      0xefbe4786,
+      0xfc19dc6,
+      0x240ca1cc,
+      0x2de92c6f,
+      0x4a7484aa,
+      0x5cb0a9dc,
+      0x76f988da,
+      0x983e5152,
+      0xa831c66d,
+      0xb00327c8,
+      0xbf597fc7,
+      0xc6e00bf3,
+      0xd5a79147,
+      0x6ca6351,
+      0x14292967,
+      0x27b70a85,
+      0x2e1b2138,
+      0x4d2c6dfc,
+      0x53380d13,
+      0x650a7354,
+      0x766a0abb,
+      0x81c2c92e,
+      0x92722c85,
+      0xa2bfe8a1,
+      0xa81a664b,
+      0xc24b8b70,
+      0xc76c51a3,
+      0xd192e819,
+      0xd6990624,
+      0xf40e3585,
+      0x106aa070,
+      0x19a4c116,
+      0x1e376c08,
+      0x2748774c,
+      0x34b0bcb5,
+      0x391c0cb3,
+      0x4ed8aa4a,
+      0x5b9cca4f,
+      0x682e6ff3,
+      0x748f82ee,
+      0x78a5636f,
+      0x84c87814,
+      0x8cc70208,
+      0x90befffa,
+      0xa4506ceb,
+      0xbef9a3f7,
+      0xc67178f2
+    );
+    var HASH = new Array(
+      0x6a09e667,
+      0xbb67ae85,
+      0x3c6ef372,
+      0xa54ff53a,
+      0x510e527f,
+      0x9b05688c,
+      0x1f83d9ab,
+      0x5be0cd19
+    );
+    var W = new Array(64);
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+
+    m[l >> 5] |= 0x80 << (24 - (l % 32));
+    m[(((l + 64) >> 9) << 4) + 15] = l;
+
+    for (var i = 0; i < m.length; i += 16) {
+      a = HASH[0];
+      b = HASH[1];
+      c = HASH[2];
+      d = HASH[3];
+      e = HASH[4];
+      f = HASH[5];
+      g = HASH[6];
+      h = HASH[7];
+
+      for (var j = 0; j < 64; j++) {
+        if (j < 16) W[j] = m[j + i];
+        else
+          W[j] = safe_add(
+            safe_add(
+              safe_add(Gamma1256(W[j - 2]), W[j - 7]),
+              Gamma0256(W[j - 15])
+            ),
+            W[j - 16]
+          );
+
+        T1 = safe_add(
+          safe_add(safe_add(safe_add(h, Sigma1256(e)), Ch(e, f, g)), K[j]),
+          W[j]
+        );
+        T2 = safe_add(Sigma0256(a), Maj(a, b, c));
+
+        h = g;
+        g = f;
+        f = e;
+        e = safe_add(d, T1);
+        d = c;
+        c = b;
+        b = a;
+        a = safe_add(T1, T2);
+      }
+
+      HASH[0] = safe_add(a, HASH[0]);
+      HASH[1] = safe_add(b, HASH[1]);
+      HASH[2] = safe_add(c, HASH[2]);
+      HASH[3] = safe_add(d, HASH[3]);
+      HASH[4] = safe_add(e, HASH[4]);
+      HASH[5] = safe_add(f, HASH[5]);
+      HASH[6] = safe_add(g, HASH[6]);
+      HASH[7] = safe_add(h, HASH[7]);
+    }
+    return HASH;
+  }
+
+  function core_sha512(m, l) {
+    var K = new Array(
+      0x428a2f98d728ae22,
+      0x7137449123ef65cd,
+      0xb5c0fbcfec4d3b2f,
+      0xe9b5dba58189dbbc,
+      0x3956c25bf348b538,
+      0x59f111f1b605d019,
+      0x923f82a4af194f9b,
+      0xab1c5ed5da6d8118,
+      0xd807aa98a3030242,
+      0x12835b0145706fbe,
+      0x243185be4ee4b28c,
+      0x550c7dc3d5ffb4e2,
+      0x72be5d74f27b896f,
+      0x80deb1fe3b1696b1,
+      0x9bdc06a725c71235,
+      0xc19bf174cf692694,
+      0xe49b69c19ef14ad2,
+      0xefbe4786384f25e3,
+      0x0fc19dc68b8cd5b5,
+      0x240ca1cc77ac9c65,
+      0x2de92c6f592b0275,
+      0x4a7484aa6ea6e483,
+      0x5cb0a9dcbd41fbd4,
+      0x76f988da831153b5,
+      0x983e5152ee66dfab,
+      0xa831c66d2db43210,
+      0xb00327c898fb213f,
+      0xbf597fc7beef0ee4,
+      0xc6e00bf33da88fc2,
+      0xd5a79147930aa725,
+      0x06ca6351e003826f,
+      0x142929670a0e6e70,
+      0x27b70a8546d22ffc,
+      0x2e1b21385c26c926,
+      0x4d2c6dfc5ac42aed,
+      0x53380d139d95b3df,
+      0x650a73548baf63de,
+      0x766a0abb3c77b2a8,
+      0x81c2c92e47edaee6,
+      0x92722c851482353b,
+      0xa2bfe8a14cf10364,
+      0xa81a664bbc423001,
+      0xc24b8b70d0f89791,
+      0xc76c51a30654be30,
+      0xd192e819d6ef5218,
+      0xd69906245565a910,
+      0xf40e35855771202a,
+      0x106aa07032bbd1b8,
+      0x19a4c116b8d2d0c8,
+      0x1e376c085141ab53,
+      0x2748774cdf8eeb99,
+      0x34b0bcb5e19b48a8,
+      0x391c0cb3c5c95a63,
+      0x4ed8aa4ae3418acb,
+      0x5b9cca4f7763e373,
+      0x682e6ff3d6b2b8a3,
+      0x748f82ee5defb2fc,
+      0x78a5636f43172f60,
+      0x84c87814a1f0ab72,
+      0x8cc702081a6439ec,
+      0x90befffa23631e28,
+      0xa4506cebde82bde9,
+      0xbef9a3f7b2c67915,
+      0xc67178f2e372532b,
+      0xca273eceea26619c,
+      0xd186b8c721c0c207,
+      0xeada7dd6cde0eb1e,
+      0xf57d4f7fee6ed178,
+      0x06f067aa72176fba,
+      0x0a637dc5a2c898a6,
+      0x113f9804bef90dae,
+      0x1b710b35131c471b,
+      0x28db77f523047d84,
+      0x32caab7b40c72493,
+      0x3c9ebe0a15c9bebc,
+      0x431d67c49c100d4c,
+      0x4cc5d4becb3e42b6,
+      0x597f299cfc657e2a,
+      0x5fcb6fab3ad6faec,
+      0x6c44198c4a475817
+    );
+    var HASH = new Array(
+      0x6a09e667f3bcc908,
+      0xbb67ae8584caa73b,
+      0x3c6ef372fe94f82b,
+      0xa54ff53a5f1d36f1,
+      0x510e527fade682d1,
+      0x9b05688c2b3e6c1f,
+      0x1f83d9abfb41bd6b,
+      0x5be0cd19137e2179
+    );
+    var W = new Array(80);
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+  }
+
+  function str2binb(str) {
+    var bin = Array();
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < str.length * chrsz; i += chrsz)
+      bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - (i % 32));
+    return bin;
+  }
+
+  function binb2str(bin) {
+    var str = '';
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < bin.length * 32; i += chrsz)
+      str += String.fromCharCode((bin[i >> 5] >>> (24 - (i % 32))) & mask);
+    return str;
+  }
+
+  function binb2hex(binarray) {
+    var hex_tab = hexcase ? '0123456789ABCDEF' : '0123456789abcdef';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i++) {
+      str +=
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8 + 4)) & 0xf) +
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8)) & 0xf);
+    }
+    return str;
+  }
+
+  function binb2b64(binarray) {
+    var tab =
+      'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i += 3) {
+      var triplet =
+        (((binarray[i >> 2] >> (8 * (3 - (i % 4)))) & 0xff) << 16) |
+        (((binarray[(i + 1) >> 2] >> (8 * (3 - ((i + 1) % 4)))) & 0xff) << 8) |
+        ((binarray[(i + 2) >> 2] >> (8 * (3 - ((i + 2) % 4)))) & 0xff);
+      for (var j = 0; j < 4; j++) {
+        if (i * 8 + j * 6 > binarray.length * 32) str += '';
+        else str += tab.charAt((triplet >> (6 * (3 - j))) & 0x3f);
+      }
+    }
+    return str;
+  }
+
+  function hex_sha2(s) {
+    return binb2hex(core_sha256(str2binb(s), s.length * chrsz));
+  }
+
+  function b64_sha2(s) {
+    return binb2b64(core_sha256(str2binb(s), s.length * chrsz));
+  }
+
+  function str_sha2(s) {
+    return binb2str(core_sha256(str2binb(s), s.length * chrsz));
+  }
+  return hex_sha2(input);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
new file mode 100644
index 0000000000..e2a4065371
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
@@ -0,0 +1,116 @@
+---
+id: 5a23c84252665b21eecc7ffe
+title: Sort an array of composite structures
+challengeType: 5
+forumTopicId: 302306
+dashedName: sort-an-array-of-composite-structures
+---
+
+# --description--
+
+Write a function that takes an array of objects as a parameter. The function should sort the array according to the 'key' attribute of the objects and return the sorted array.
+
+# --hints--
+
+`sortByKey` should be a function.
+
+```js
+assert(typeof sortByKey == 'function');
+```
+
+`sortByKey([{key: 3, value: "foo"}, {key: 2, value: "bar"}, {key: 4, value: "baz"}, {key: 1, value: 42}, {key: 5, value: "another string"}])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    sortByKey([
+      { key: 3, value: 'foo' },
+      { key: 2, value: 'bar' },
+      { key: 4, value: 'baz' },
+      { key: 1, value: 42 },
+      { key: 5, value: 'another string' }
+    ])
+  )
+);
+```
+
+`sortByKey([{key: 3, value: "foo"}, {key: 2, value: "bar"}, {key: 4, value: "baz"}, {key: 1, value: 42}, {key: 5, value: "another string"}])` should return `[{key: 1, value: 42}, {key: 2, value: "bar"}, {key: 3, value: "foo"}, {key: 4, value: "baz"}, {key: 5, value: "another string"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 3, value: 'foo' },
+    { key: 2, value: 'bar' },
+    { key: 4, value: 'baz' },
+    { key: 1, value: 42 },
+    { key: 5, value: 'another string' }
+  ]),
+  [
+    { key: 1, value: 42 },
+    { key: 2, value: 'bar' },
+    { key: 3, value: 'foo' },
+    { key: 4, value: 'baz' },
+    { key: 5, value: 'another string' }
+  ]
+);
+```
+
+`sortByKey([{key: 3, name: "Joe"}, {key: 4, name: "Bill"}, {key: 20, name: "Alice"}, {key: 5, name: "Harry"}])` should return `[{key: 3, name: "Joe"}, {key: 4, name: "Bill"}, {key: 5, name: "Harry"}, {key: 20, name: "Alice"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 3, name: 'Joe' },
+    { key: 4, name: 'Bill' },
+    { key: 20, name: 'Alice' },
+    { key: 5, name: 'Harry' }
+  ]),
+  [
+    { key: 3, name: 'Joe' },
+    { key: 4, name: 'Bill' },
+    { key: 5, name: 'Harry' },
+    { key: 20, name: 'Alice' }
+  ]
+);
+```
+
+`sortByKey([{key: 2341, name: "Adam"}, {key: 122, name: "Bernie"}, {key: 19, name: "David"}, {key: 5531, name: "Joe"}, {key: 1234, name: "Walter"}])` should return `[{key: 19, name: "David"}, {key: 122, name: "Bernie"}, {key: 1234, name: "Walter"}, {key: 2341, name: "Adam"}, {key: 5531, name: "Joe"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 2341, name: 'Adam' },
+    { key: 122, name: 'Bernie' },
+    { key: 19, name: 'David' },
+    { key: 5531, name: 'Joe' },
+    { key: 1234, name: 'Walter' }
+  ]),
+  [
+    { key: 19, name: 'David' },
+    { key: 122, name: 'Bernie' },
+    { key: 1234, name: 'Walter' },
+    { key: 2341, name: 'Adam' },
+    { key: 5531, name: 'Joe' }
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sortByKey(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sortByKey (arr) {
+  return arr.sort(function(a, b) {
+    return a.key - b.key
+  });
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
new file mode 100644
index 0000000000..b6647f2824
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -0,0 +1,147 @@
+---
+id: 5a23c84252665b21eecc8000
+title: Sort disjoint sublist
+challengeType: 5
+forumTopicId: 302307
+dashedName: sort-disjoint-sublist
+---
+
+# --description--
+
+Given a list of values and a set of integer indices into that value list, the task is to sort the values at the given indices, but preserving the values at indices outside the set of those to be sorted.
+
+Make your function work with the following list of values and set of indices:
+
+<code>values: [7, <b>6</b>, 5, 4, 3, 2, <b>1</b>, <b>0</b>]</code>
+
+```js
+indices(0-based): {6, 1, 7}
+```
+
+Where the correct result would be:
+
+<code>[7, <b>0</b>, 5, 4, 3, 2, <b>1</b>, <b>6</b>]</code>.
+
+# --hints--
+
+`sortDisjoint` should be a function.
+
+```js
+assert(typeof sortDisjoint == 'function');
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])` should return an array.
+
+```js
+assert(Array.isArray(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])));
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])` should return `[7, 0, 5, 4, 3, 2, 1, 6]`.
+
+```js
+assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7]), [
+  7,
+  0,
+  5,
+  4,
+  3,
+  2,
+  1,
+  6
+]);
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6])` should return `[7, 1, 2, 4, 3, 5, 6, 0]`.
+
+```js
+assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6]), [
+  7,
+  1,
+  2,
+  4,
+  3,
+  5,
+  6,
+  0
+]);
+```
+
+`sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7])` should return `[8, 1, 6, 5, 4, 3, 2, 7]`.
+
+```js
+assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7]), [
+  8,
+  1,
+  6,
+  5,
+  4,
+  3,
+  2,
+  7
+]);
+```
+
+`sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6])` should return `[8, 2, 6, 3, 4, 5, 7, 1]`.
+
+```js
+assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6]), [
+  8,
+  2,
+  6,
+  3,
+  4,
+  5,
+  7,
+  1
+]);
+```
+
+`sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4])` should return `[6, 1, 7, 1, 3, 5, 6]`.
+
+```js
+assert.deepEqual(sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4]), [
+  6,
+  1,
+  7,
+  1,
+  3,
+  5,
+  6
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sortDisjoint(values, indices) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sortDisjoint(values, indices) {
+  let sublist = [];
+
+  indices.sort(function(a, b) {
+    return a - b;
+  });
+
+  for (let i = 0; i < indices.length; i++) {
+    sublist.push(values[indices[i]]);
+  }
+
+  sublist.sort((a, b) => {
+    return a - b;
+  });
+
+  for (let i = 0; i < indices.length; i++) {
+    values[indices[i]] = sublist[i];
+  }
+
+  return values;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-stability.md
new file mode 100644
index 0000000000..3f57407b6a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -0,0 +1,168 @@
+---
+id: 5a23c84252665b21eecc8014
+title: Sort stability
+challengeType: 5
+forumTopicId: 302308
+dashedName: sort-stability
+---
+
+# --description--
+
+When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+
+For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).
+
+<pre>UK  London
+US  New York
+US  Birmingham
+UK  Birmingham
+</pre>
+
+Similarly, stable sorting on just the first column would generate "UK London" as the first item and "US Birmingham" as the last item (since the order of the elements having the same first word – "UK" or "US" – would be maintained).
+
+# --instructions--
+
+Write a function that takes a 2D array as a parameter. Each element has 2 elements similar to the above example. The function should sort the array as mentioned previously and return the sorted array.
+
+# --hints--
+
+`stableSort` should be a function.
+
+```js
+assert(typeof stableSort == 'function');
+```
+
+`stableSort([["UK", "London"], ["US", "New York"], ["US", "Birmingham"], ["UK", "Birmingham"]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    stableSort([
+      ['UK', 'London'],
+      ['US', 'New York'],
+      ['US', 'Birmingham'],
+      ['UK', 'Birmingham']
+    ])
+  )
+);
+```
+
+`stableSort([["UK", "London"], ["US", "New York"], ["US", "Birmingham"], ["UK", "Birmingham"]])` should return `[["US", "Birmingham"], ["UK", "Birmingham"], ["UK", "London"], ["US", "New York"]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    ['UK', 'London'],
+    ['US', 'New York'],
+    ['US', 'Birmingham'],
+    ['UK', 'Birmingham']
+  ]),
+  [
+    ['US', 'Birmingham'],
+    ['UK', 'Birmingham'],
+    ['UK', 'London'],
+    ['US', 'New York']
+  ]
+);
+```
+
+`stableSort([[2, 2], [1, 2], [1, 4], [1, 5]])` should return `[[2, 2], [1, 2], [1, 4], [1, 5]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [2, 2],
+    [1, 2],
+    [1, 4],
+    [1, 5]
+  ]),
+  [
+    [2, 2],
+    [1, 2],
+    [1, 4],
+    [1, 5]
+  ]
+);
+```
+
+`stableSort([[11, 55], [12, 45], [11, 45], [32, 45]])` should return `[[12, 45], [11, 45], [32, 45], [11, 55]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [11, 55],
+    [12, 45],
+    [11, 45],
+    [32, 45]
+  ]),
+  [
+    [12, 45],
+    [11, 45],
+    [32, 45],
+    [11, 55]
+  ]
+);
+```
+
+`stableSort([[10, 22], [1, 2], [1, 4], [1, 5], [10, 9]])` should return `[[1, 2], [1, 4], [1, 5], [10, 9], [10, 22]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [10, 22],
+    [1, 2],
+    [1, 4],
+    [1, 5],
+    [10, 9]
+  ]),
+  [
+    [1, 2],
+    [1, 4],
+    [1, 5],
+    [10, 9],
+    [10, 22]
+  ]
+);
+```
+
+`stableSort([[55, 54], [12, 22], [31, 43], [31, 54], [10, 49]])` should return `[[12, 22], [31, 43], [10, 49], [55, 54], [31, 54]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [55, 54],
+    [12, 22],
+    [31, 43],
+    [31, 54],
+    [10, 49]
+  ]),
+  [
+    [12, 22],
+    [31, 43],
+    [10, 49],
+    [55, 54],
+    [31, 54]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function stableSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function stableSort(arr) {
+  arr.sort(function(a, b) {
+    return a[1] < b[1] ? -1 : a[1] > b[1] ? 1 : 0;
+  });
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
new file mode 100644
index 0000000000..e7e7919d0b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
@@ -0,0 +1,121 @@
+---
+id: 5a23c84252665b21eecc8016
+title: Sort using a custom comparator
+challengeType: 5
+forumTopicId: 302309
+dashedName: sort-using-a-custom-comparator
+---
+
+# --description--
+
+Write a function to sort an array (or list) of strings in order of descending length, and in ascending lexicographic order for strings of equal length.
+
+# --hints--
+
+`lengthSorter` should be a function.
+
+```js
+assert(typeof lengthSorter == 'function');
+```
+
+`lengthSorter(["Here", "are", "some", "sample", "strings", "to", "be", "sorted"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    lengthSorter([
+      'Here',
+      'are',
+      'some',
+      'sample',
+      'strings',
+      'to',
+      'be',
+      'sorted'
+    ])
+  )
+);
+```
+
+`lengthSorter(["Here", "are", "some", "sample", "strings", "to", "be", "sorted"])` should return `["strings", "sample", "sorted", "Here", "some", "are", "be", "to"]`.
+
+```js
+assert.deepEqual(
+  lengthSorter([
+    'Here',
+    'are',
+    'some',
+    'sample',
+    'strings',
+    'to',
+    'be',
+    'sorted'
+  ]),
+  ['strings', 'sample', 'sorted', 'Here', 'some', 'are', 'be', 'to']
+);
+```
+
+`lengthSorter(["I", "hope", "your", "day", "is", "going", "good", "?"])` should return `["going", "good", "hope", "your", "day", "is", "?","I"]`.
+
+```js
+assert.deepEqual(
+  lengthSorter(['I', 'hope', 'your', 'day', 'is', 'going', 'good', '?']),
+  ['going', 'good', 'hope', 'your', 'day', 'is', '?', 'I']
+);
+```
+
+`lengthSorter(["Mine", "is", "going", "great"])` should return `["going", "great", "Mine", "is"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Mine', 'is', 'going', 'great']), [
+  'going',
+  'great',
+  'Mine',
+  'is'
+]);
+```
+
+`lengthSorter(["Have", "fun", "sorting", "!!"])` should return `["sorting", "Have", "fun", "!!"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Have', 'fun', 'sorting', '!!']), [
+  'sorting',
+  'Have',
+  'fun',
+  '!!'
+]);
+```
+
+`lengthSorter(["Everything", "is", "good", "!!"])` should return `["Everything", "good", "!!", "is"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Everything', 'is', 'good', '!!']), [
+  'Everything',
+  'good',
+  '!!',
+  'is'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lengthSorter(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lengthSorter(arr) {
+  arr.sort(function(a, b) {
+    var result = b.length - a.length;
+    if (result == 0) result = a.localeCompare(b);
+    return result;
+  });
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
new file mode 100644
index 0000000000..02b836f4de
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -0,0 +1,129 @@
+---
+id: 5a23c84252665b21eecc8001
+title: Sorting algorithms/Bead sort
+challengeType: 5
+forumTopicId: 302310
+dashedName: sorting-algorithmsbead-sort
+---
+
+# --description--
+
+Sort an array of positive integers using the [Bead Sort Algorithm](https://en.wikipedia.org/wiki/Bead_sort).
+
+A *bead sort* is also known as a *gravity sort*.
+
+The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.
+
+This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.
+
+# --hints--
+
+`beadSort` should be a function.
+
+```js
+assert(typeof beadSort == 'function');
+```
+
+`beadSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(beadSort([25, 32, 12, 7, 20])));
+```
+
+`beadSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(beadSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`beadSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(beadSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`beadSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(beadSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`beadSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(beadSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`beadSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(beadSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function beadSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function beadSort(arr) {
+  var max = 0;
+  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  var grid = new Array(arr.length);
+  for (var i = 0; i < grid.length; i++) {
+    grid[i] = new Array(max);
+  }
+  var levelcount = new Array(max);
+  levelcount.fill(0);
+  for (var i = 0; i < max; i++) {
+    levelcount[i] = 0;
+    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+  }
+  for (var i = 0; i < arr.length; i++) {
+    var num = arr[i];
+    for (var j = 0; num > 0; j++) {
+      grid[levelcount[j]++][j] = '*';
+      num--;
+    }
+  }
+  var sorted = new Array(arr.length);
+  sorted.fill(0);
+  for (var i = 0; i < arr.length; i++) {
+    var putt = 0;
+    for (
+      var j = 0;
+      j < max &&
+      (function(c) {
+        return c.charCodeAt == null ? c : c.charCodeAt(0);
+      })(grid[arr.length - 1 - i][j]) == '*'.charCodeAt(0);
+      j++
+    )
+      putt++;
+    sorted[i] = putt;
+  }
+  return sorted;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
new file mode 100644
index 0000000000..2a7b74b5e3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -0,0 +1,126 @@
+---
+id: 5a23c84252665b21eecc8002
+title: Sorting algorithms/Bogosort
+challengeType: 5
+forumTopicId: 302311
+dashedName: sorting-algorithmsbogosort
+---
+
+# --description--
+
+[Bogosort](https://en.wikipedia.org/wiki/Bogosort) a list of numbers.
+
+Bogosort simply shuffles a collection randomly until it is sorted.
+
+"Bogosort" is a perversely inefficient algorithm only used as an in-joke.
+
+Its average run-time is O(n!) because the chance that any given shuffle of a set will end up in sorted order is about one in *n* factorial, and the worst case is infinite since there's no guarantee that a random shuffling will ever produce a sorted sequence.
+
+Its best case is O(n) since a single pass through the elements may suffice to order them.
+
+Pseudocode:
+
+<pre><b>while not</b> InOrder(list) <b>do</b>
+  Shuffle(list)
+<b>done</b>
+</pre>
+
+# --hints--
+
+`bogosort` should be a function.
+
+```js
+assert(typeof bogosort == 'function');
+```
+
+`bogosort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(bogosort([25, 32, 12, 7, 20])));
+```
+
+`bogosort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(bogosort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`bogosort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(bogosort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`bogosort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(bogosort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`bogosort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(bogosort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`bogosort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(bogosort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function bogosort(v) {
+
+}
+```
+
+# --solutions--
+
+```js
+function bogosort(v) {
+  function shuffle(v) {
+    for (
+      var j, x, i = v.length;
+      i;
+      j = Math.floor(Math.random() * i), x = v[--i], v[i] = v[j], v[j] = x
+    );
+    return v;
+  }
+
+  function isSorted(v) {
+    for (var i = 1; i < v.length; i++) {
+      if (v[i - 1] > v[i]) {
+        return false;
+      }
+    }
+    return true;
+  }
+  var sorted = false;
+  while (sorted == false) {
+    v = shuffle(v);
+    sorted = isSorted(v);
+  }
+  return v;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
new file mode 100644
index 0000000000..86aeeda4c8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -0,0 +1,140 @@
+---
+id: 5a23c84252665b21eecc8004
+title: Sorting algorithms/Cocktail sort
+challengeType: 5
+forumTopicId: 302312
+dashedName: sorting-algorithmscocktail-sort
+---
+
+# --description--
+
+The cocktail shaker sort is an improvement on the [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>). The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from [wikipedia](<https://en.wikipedia.org/wiki/Cocktail sort>)):
+
+<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
+  <b>do</b>
+    swapped := false
+    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
+      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
+                                <i>// elements are in the wrong</i>
+                                <i>// order</i>
+        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
+                                 <i>// change places</i>
+        swapped := true;
+    <b>if</b> swapped = false <b>then</b>
+      <i>// we can exit the outer loop here if no swaps occurred.</i>
+      <b>break do-while loop</b>;
+    swapped := false
+    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
+      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
+        swap( A[ i ], A[ i+1 ] )
+        swapped := true;
+  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
+                <i>// then the list is sorted</i>
+</pre>
+
+# --instructions--
+
+Write a function that sorts a given array using cocktail sort.
+
+# --hints--
+
+`cocktailSort` should be a function.
+
+```js
+assert(typeof cocktailSort == 'function');
+```
+
+`cocktailSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(cocktailSort([25, 32, 12, 7, 20])));
+```
+
+`cocktailSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(cocktailSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`cocktailSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(cocktailSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`cocktailSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(cocktailSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`cocktailSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(cocktailSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`cocktailSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(cocktailSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cocktailSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function cocktailSort(arr) {
+  let isSorted = true;
+  while (isSorted) {
+    for (let i = 0; i < arr.length - 1; i++) {
+      if (arr[i] > arr[i + 1]) {
+        let temp = arr[i];
+        arr[i] = arr[i + 1];
+        arr[i + 1] = temp;
+        isSorted = true;
+      }
+    }
+
+    if (!isSorted) break;
+
+    isSorted = false;
+
+    for (let j = arr.length - 1; j > 0; j--) {
+      if (arr[j - 1] > arr[j]) {
+        let temp = arr[j];
+        arr[j] = arr[j - 1];
+        arr[j - 1] = temp;
+        isSorted = true;
+      }
+    }
+  }
+
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
new file mode 100644
index 0000000000..2b31fb98db
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -0,0 +1,179 @@
+---
+id: 5a23c84252665b21eecc8005
+title: Sorting algorithms/Comb sort
+challengeType: 5
+forumTopicId: 302313
+dashedName: sorting-algorithmscomb-sort
+---
+
+# --description--
+
+Implement a *comb sort*.
+
+The **Comb Sort** is a variant of the [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>).
+
+Like the [Shell sort](<https://rosettacode.org/wiki/Shell sort>), the Comb Sort increases the gap used in comparisons and exchanges.
+
+Dividing the gap by $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ works best, but 1.3 may be more practical.
+
+Some implementations use the insertion sort once the gap is less than a certain amount.
+
+**Also see**
+
+<ul>
+  <li>the Wikipedia article: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Comb sort</a>.</li>
+</ul>
+
+Variants:
+
+<ul>
+  <li>Combsort11 makes sure the gap ends in (11, 8, 6, 4, 3, 2, 1), which is significantly faster than the other two possible endings.</li>
+  <li>Combsort with different endings changes to a more efficient sort when the data is almost sorted (when the gap is small). Comb sort with a low gap isn't much better than the Bubble Sort.</li>
+</ul>
+
+Pseudocode:
+
+<pre><b>function</b> combsort(<b>array</b> input)
+  gap := input<b>.size</b> <i>//initialize gap size</i>
+  <b>loop until</b> gap = 1 <b>and</b> swaps = 0
+    <i>//update the gap value for a next comb. Below is an example</i>
+    gap := int(gap / 1.25)
+    <b>if</b> gap &#x3C; 1 
+      <i>//minimum gap is 1</i>
+      gap := 1
+    <b>end if</b>
+    i := 0
+    swaps := 0 <i>//see <a href='https://rosettacode.org/wiki/Sorting_algorithms/Bubble_sort' target='_blank'>Bubble Sort</a> for an explanation</i>
+    <i>//a single "comb" over the input list</i>
+    <b>loop until</b> i + gap >= input<b>.size</b> <i>//see <a href='https://rosettacode.org/wiki/Sorting_algorithms/Shell_sort' target='_blank'>Shell sort</a> for similar idea</i>
+      <b>if</b> input[i] > input[i+gap]
+        <b>swap</b>(input[i], input[i+gap])
+        swaps := 1 <i>// Flag a swap has occurred, so the</i>
+            <i>// list is not guaranteed sorted</i>
+      <b>end if</b>
+      i := i + 1
+    <b>end loop</b>
+  <b>end loop</b>
+<b>end function</b>
+</pre>
+
+# --instructions--
+
+Write a function that sorts a given array using Comb sort.
+
+# --hints--
+
+`combSort` should be a function.
+
+```js
+assert(typeof combSort == 'function');
+```
+
+`combSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(combSort([25, 32, 12, 7, 20])));
+```
+
+`combSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(combSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`combSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(combSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`combSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(combSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`combSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(combSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`combSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(combSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function combSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function combSort(arr) {
+  function is_array_sorted(arr) {
+    var sorted = true;
+    for (var i = 0; i < arr.length - 1; i++) {
+      if (arr[i] > arr[i + 1]) {
+        sorted = false;
+        break;
+      }
+    }
+    return sorted;
+  }
+  var iteration_count = 0;
+  var gap = arr.length - 2;
+  var decrease_factor = 1.25;
+
+  // Until array is not sorted, repeat iterations
+  while (!is_array_sorted(arr)) {
+    // If not first gap
+    if (iteration_count > 0)
+      // Calculate gap
+      gap = gap == 1 ? gap : Math.floor(gap / decrease_factor);
+
+    // Set front and back elements and increment to a gap
+    var front = 0;
+    var back = gap;
+    while (back <= arr.length - 1) {
+      // If elements are not ordered swap them
+      if (arr[front] > arr[back]) {
+        var temp = arr[front];
+        arr[front] = arr[back];
+        arr[back] = temp;
+      }
+
+      // Increment and re-run swapping
+      front += 1;
+      back += 1;
+    }
+    iteration_count += 1;
+  }
+
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
new file mode 100644
index 0000000000..4aebdd0fe8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -0,0 +1,124 @@
+---
+id: 5a23c84252665b21eecc8007
+title: Sorting algorithms/Gnome sort
+challengeType: 5
+forumTopicId: 302314
+dashedName: sorting-algorithmsgnome-sort
+---
+
+# --description--
+
+Gnome sort is a sorting algorithm which is similar to [Insertion sort](<https://rosettacode.org/wiki/Insertion sort>), except that moving an element to its proper place is accomplished by a series of swaps, as in [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>).
+
+The pseudocode for the algorithm is:
+
+<pre><b>function</b> <i>gnomeSort</i>(a[0..size-1])
+  i := 1
+  j := 2
+  <b>while</b> i &#x3C; size <b>do</b>
+    <b>if</b> a[i-1] &#x3C;= a[i] <b>then</b>
+      <i>/// for descending sort, use >= for comparison</i>
+      i := j
+      j := j + 1
+    <b>else</b>
+      <b>swap</b> a[i-1] <b>and</b> a[i]
+      i := i - 1
+      <b>if</b> i = 0 <b>then</b>
+        i := j
+        j := j + 1
+      <b>endif</b>
+    <b>endif</b>
+  <b>done</b>
+</pre>
+
+# --instructions--
+
+Write a function to implement the above pseudo code. The function should return the sorted array.
+
+# --hints--
+
+`gnomeSort` should be a function.
+
+```js
+assert(typeof gnomeSort == 'function');
+```
+
+`gnomeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(gnomeSort([25, 32, 12, 7, 20])));
+```
+
+`gnomeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(gnomeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`gnomeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(gnomeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`gnomeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(gnomeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`gnomeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(gnomeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`gnomeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(gnomeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gnomeSort(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gnomeSort(a) {
+  function moveBack(i) {
+    for (; i > 0 && a[i - 1] > a[i]; i--) {
+      var t = a[i];
+      a[i] = a[i - 1];
+      a[i - 1] = t;
+    }
+  }
+  for (var i = 1; i < a.length; i++) {
+    if (a[i - 1] > a[i]) moveBack(i);
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
new file mode 100644
index 0000000000..1a4a28928c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -0,0 +1,124 @@
+---
+id: 5a23c84252665b21eecc800b
+title: Sorting algorithms/Pancake sort
+challengeType: 5
+forumTopicId: 302315
+dashedName: sorting-algorithmspancake-sort
+---
+
+# --description--
+
+Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](<https://en.wikipedia.org/wiki/Pancake sorting>). The function should return the sorted array.
+
+In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so:
+
+<pre>Before:
+<b>6 7 8 9</b> 2 5 3 4 1<br>
+After:
+<b>9 8 7 6</b> 2 5 3 4 1
+</pre>
+
+Only one end of the list can be flipped; this should be the low end, but the high end is okay if it's easier to code or works better, but it **must** be the same end for the entire solution. (The end flipped can't be arbitrarily changed.)
+
+# --hints--
+
+`pancakeSort` should be a function.
+
+```js
+assert(typeof pancakeSort == 'function');
+```
+
+`pancakeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(pancakeSort([25, 32, 12, 7, 20])));
+```
+
+`pancakeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(pancakeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`pancakeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(pancakeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`pancakeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(pancakeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`pancakeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(pancakeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`pancakeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(pancakeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pancakeSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function pancakeSort(arr) {
+  for (var i = arr.length - 1; i >= 1; i--) {
+    // find the index of the largest element not yet sorted
+    var max_idx = 0;
+    var max = arr[0];
+    for (var j = 1; j <= i; j++) {
+      if (arr[j] > max) {
+        max = arr[j];
+        max_idx = j;
+      }
+    }
+
+    if (max_idx == i) continue; // element already in place
+
+    var new_slice;
+
+    // flip arr max element to index 0
+    if (max_idx > 0) {
+      new_slice = arr.slice(0, max_idx + 1).reverse();
+      for (var j = 0; j <= max_idx; j++) arr[j] = new_slice[j];
+    }
+
+    // then flip the max element to its place
+    new_slice = arr.slice(0, i + 1).reverse();
+    for (var j = 0; j <= i; j++) arr[j] = new_slice[j];
+  }
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
new file mode 100644
index 0000000000..d5fc1e3b08
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
@@ -0,0 +1,131 @@
+---
+id: 5a23c84252665b21eecc800c
+title: Sorting algorithms/Permutation sort
+challengeType: 5
+forumTopicId: 302316
+dashedName: sorting-algorithmspermutation-sort
+---
+
+# --description--
+
+Write a function to implement a permutation sort, which proceeds by generating the possible permutations of the input array until discovering the sorted one. The function should return the sorted array.
+
+Pseudocode:
+
+<pre><b>while not</b> InOrder(list) <b>do</b>
+  nextPermutation(list)
+<b>done</b>
+</pre>
+
+# --hints--
+
+`permutationSort` should be a function.
+
+```js
+assert(typeof permutationSort == 'function');
+```
+
+`permutationSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(permutationSort([25, 32, 12, 7, 20])));
+```
+
+`permutationSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(permutationSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`permutationSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(permutationSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`permutationSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(permutationSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`permutationSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(permutationSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`permutationSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(permutationSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permutationSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function permutationSort(arr) {
+  function pSort(a) {
+    var list = [];
+    permute(a, a.length, list);
+    for (var i = 0; i < list.length; i++) {
+      var x = list[i];
+      if (isSorted(x)) return x;
+    }
+    return a;
+  }
+
+  function permute(a, n, list) {
+    if (n === 1) {
+      var b = a.slice();
+      list.push(b);
+      return;
+    }
+    for (var i = 0; i < n; i++) {
+      swap(a, i, n - 1);
+      permute(a, n - 1, list);
+      swap(a, i, n - 1);
+    }
+  }
+
+  function isSorted(a){
+    for(let i = 0; i < a.length - 1; i++)
+      if(a[i] > a[i + 1])
+        return false;
+    return true;
+  }
+
+  function swap(arr, i, j) {
+    var temp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = temp;
+  }
+  return pSort(arr);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
new file mode 100644
index 0000000000..3d69051f4d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -0,0 +1,106 @@
+---
+id: 5a23c84252665b21eecc8010
+title: Sorting algorithms/Shell sort
+challengeType: 5
+forumTopicId: 302317
+dashedName: sorting-algorithmsshell-sort
+---
+
+# --description--
+
+Write a function to sort an array of elements using the [Shell sort](<https://en.wikipedia.org/wiki/Shell sort>) algorithm, a diminishing increment sort. The function should return the sorted array.
+
+The Shell sort (also known as Shellsort or Shell's method) is named after its inventor, Donald Shell, who published the algorithm in 1959.
+
+Shell sort is a sequence of interleaved insertion sorts based on an increment sequence. The increment size is reduced after each pass until the increment size is 1.
+
+With an increment size of 1, the sort is a basic insertion sort, but by this time the data is guaranteed to be almost sorted, which is insertion sort's "best case".
+
+Any sequence will sort the data as long as it ends in 1, but some work better than others.
+
+Empirical studies have shown a geometric increment sequence with a ratio of about 2.2 work well in practice.
+
+# --hints--
+
+`shellSort` should be a function.
+
+```js
+assert(typeof shellSort == 'function');
+```
+
+`shellSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(shellSort([25, 32, 12, 7, 20])));
+```
+
+`shellSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(shellSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`shellSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(shellSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`shellSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(shellSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`shellSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(shellSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`shellSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(shellSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function shellSort(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function shellSort(a) {
+  for (var h = a.length; h > 0; h = parseInt(h / 2)) {
+    for (var i = h; i < a.length; i++) {
+      var k = a[i];
+      for (var j = i; j >= h && k < a[j - h]; j -= h) a[j] = a[j - h];
+      a[j] = k;
+    }
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
new file mode 100644
index 0000000000..04dee734ea
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -0,0 +1,125 @@
+---
+id: 5a23c84252665b21eecc8012
+title: Sorting algorithms/Stooge sort
+challengeType: 5
+forumTopicId: 302318
+dashedName: sorting-algorithmsstooge-sort
+---
+
+# --description--
+
+Write a function to perform [Stooge Sort](<https://en.wikipedia.org/wiki/Stooge sort>) on an array of integers. The function should return a sorted array.
+
+The Stooge Sort algorithm is as follows:
+
+<pre><b>algorithm</b> stoogesort(<b>array</b> L, i = 0, j = <b>length</b>(L)-1)
+  <b>if</b> L[j] &#x3C; L[i] <b>then</b>
+    L[i] <b>↔</b> L[j]
+  <b>if</b> j - i > 1 <b>then</b>
+    t <b>:=</b> (j - i + 1)/3
+    stoogesort(L, i , j-t)
+    stoogesort(L, i+t, j )
+    stoogesort(L, i , j-t)
+  <b>return</b> L
+</pre>
+
+# --hints--
+
+`stoogeSort` should be a function.
+
+```js
+assert(typeof stoogeSort == 'function');
+```
+
+`stoogeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(stoogeSort([25, 32, 12, 7, 20])));
+```
+
+`stoogeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(stoogeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`stoogeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(stoogeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`stoogeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(stoogeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`stoogeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(stoogeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`stoogeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(stoogeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function stoogeSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function stoogeSort(arr) {
+  function stoogeSortRecurse(array, i, j) {
+    if (j === undefined) {
+      j = array.length - 1;
+    }
+
+    if (i === undefined) {
+      i = 0;
+    }
+
+    if (array[j] < array[i]) {
+      var aux = array[i];
+      array[i] = array[j];
+      array[j] = aux;
+    }
+
+    if (j - i > 1) {
+      var t = Math.floor((j - i + 1) / 3);
+      stoogeSortRecurse(array, i, j - t);
+      stoogeSortRecurse(array, i + t, j);
+      stoogeSortRecurse(array, i, j - t);
+    }
+  }
+  stoogeSortRecurse(arr);
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
new file mode 100644
index 0000000000..a603bbab95
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -0,0 +1,118 @@
+---
+id: 5a23c84252665b21eecc8013
+title: Sorting algorithms/Strand sort
+challengeType: 5
+forumTopicId: 302319
+dashedName: sorting-algorithmsstrand-sort
+---
+
+# --description--
+
+Write a function to sort an array using the [Strand sort](<https://en.wikipedia.org/wiki/Strand sort>). The function should return the sorted array.
+
+This is a way of sorting numbers by extracting shorter sequences of already sorted numbers from an unsorted list.
+
+# --hints--
+
+`strandSort` should be a function.
+
+```js
+assert(typeof strandSort == 'function');
+```
+
+`strandSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(strandSort([25, 32, 12, 7, 20])));
+```
+
+`strandSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(strandSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`strandSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(strandSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`strandSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(strandSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`strandSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`strandSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(strandSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function strandSort(list) {
+
+}
+```
+
+# --solutions--
+
+```js
+function strandSort(list) {
+  function merge(left, right) {
+    var result = [];
+    while (left.length != 0 && right.length != 0) {
+      if (left[0] <= right[0]) result.push(left.shift());
+      else result.push(right.shift());
+    }
+    result.push.apply(result, left);
+    result.push.apply(result, right);
+    return result;
+  }
+
+  if (list.length <= 1) return list;
+  var result = [];
+  while (list.length > 0) {
+    var sorted = [];
+    sorted.push(list.shift());
+    var len = list.length;
+    for (var i = 1; i < len; i++) {
+      var elem = list[i];
+      if (sorted[i - 1] <= elem) {
+        sorted.push(elem);
+        sorted.splice(i, 1);
+      }
+    }
+
+    result = merge(result, sorted);
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/soundex.md
new file mode 100644
index 0000000000..b7574b3837
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/soundex.md
@@ -0,0 +1,151 @@
+---
+id: 5a23c84252665b21eecc8017
+title: Soundex
+challengeType: 5
+forumTopicId: 302320
+dashedName: soundex
+---
+
+# --description--
+
+Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+
+<ul>
+  <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
+  <li>If "H" or "W" separate two consonants that have the same soundex code, the consonant to the right of the vowel is not coded. Example: Ashcraft is coded A-261 (A, 2 for the S, C ignored, 6 for the R, 1 for the F). It is not coded A-226.</li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a string as a parameter and returns the encoded string.
+
+# --hints--
+
+`soundex` should be a function.
+
+```js
+assert(typeof soundex == 'function');
+```
+
+`soundex("Soundex")` should return a string.
+
+```js
+assert(typeof soundex('Soundex') == 'string');
+```
+
+`soundex("Soundex")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Soundex'), 'S532');
+```
+
+`soundex("Example")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Example'), 'E251');
+```
+
+`soundex("Sownteks")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Sownteks'), 'S532');
+```
+
+`soundex("Ekzampul")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Ekzampul'), 'E251');
+```
+
+`soundex("Euler")` should return `"E460"`.
+
+```js
+assert.equal(soundex('Euler'), 'E460');
+```
+
+`soundex("Gauss")` should return `"G200"`.
+
+```js
+assert.equal(soundex('Gauss'), 'G200');
+```
+
+`soundex("Hilbert")` should return `"H416"`.
+
+```js
+assert.equal(soundex('Hilbert'), 'H416');
+```
+
+`soundex("Knuth")` should return `"K530"`.
+
+```js
+assert.equal(soundex('Knuth'), 'K530');
+```
+
+`soundex("Lloyd")` should return `"L300"`.
+
+```js
+assert.equal(soundex('Lloyd'), 'L300');
+```
+
+`soundex("Lukasiewicz")` should return `"L222"`.
+
+```js
+assert.equal(soundex('Lukasiewicz'), 'L222');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function soundex(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function soundex(s) {
+  var a = s.toLowerCase().split('');
+  var f = a.shift(),
+    r = '',
+    codes = {
+      a: '',
+      e: '',
+      i: '',
+      o: '',
+      u: '',
+      b: 1,
+      f: 1,
+      p: 1,
+      v: 1,
+      c: 2,
+      g: 2,
+      j: 2,
+      k: 2,
+      q: 2,
+      s: 2,
+      x: 2,
+      z: 2,
+      d: 3,
+      t: 3,
+      l: 4,
+      m: 5,
+      n: 5,
+      r: 6
+    };
+  r =
+    f +
+    a
+      .map(function(v, i, a) {
+        return codes[v];
+      })
+      .filter(function(v, i, a) {
+        return i === 0 ? v !== codes[f] : v !== a[i - 1];
+      })
+      .join('');
+
+  return (r + '000').slice(0, 4).toUpperCase();
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/spiral-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/spiral-matrix.md
new file mode 100644
index 0000000000..14da95f5a2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/spiral-matrix.md
@@ -0,0 +1,109 @@
+---
+id: 5a23c84252665b21eecc801c
+title: Spiral matrix
+challengeType: 5
+forumTopicId: 302321
+dashedName: spiral-matrix
+---
+
+# --description--
+
+Produce a spiral array. A *spiral array* is a square arrangement of the first N<sup>2</sup> natural numbers, where the numbers increase sequentially as you go around the edges of the array spiraling inwards. For example, given **5**, produce this array:
+
+<pre>
+0  1  2  3  4
+15 16 17 18 5
+14 23 24 19 6
+13 22 21 20 7
+12 11 10  9 8
+</pre>
+
+# --hints--
+
+`spiralArray` should be a function.
+
+```js
+assert(typeof spiralArray == 'function');
+```
+
+`spiralArray(3)` should return an array.
+
+```js
+assert(Array.isArray(spiralArray(3)));
+```
+
+`spiralArray(3)` should return `[[0, 1, 2],[7, 8, 3],[6, 5, 4]]`.
+
+```js
+assert.deepEqual(spiralArray(3), [
+  [0, 1, 2],
+  [7, 8, 3],
+  [6, 5, 4]
+]);
+```
+
+`spiralArray(4)` should return `[[0, 1, 2, 3],[11, 12, 13, 4],[10, 15, 14, 5],[9, 8, 7, 6]]`.
+
+```js
+assert.deepEqual(spiralArray(4), [
+  [0, 1, 2, 3],
+  [11, 12, 13, 4],
+  [10, 15, 14, 5],
+  [9, 8, 7, 6]
+]);
+```
+
+`spiralArray(5)` should return `[[0, 1, 2, 3, 4],[15, 16, 17, 18, 5],[14, 23, 24, 19, 6],[13, 22, 21, 20, 7],[12, 11, 10, 9, 8]]`.
+
+```js
+assert.deepEqual(spiralArray(5), [
+  [0, 1, 2, 3, 4],
+  [15, 16, 17, 18, 5],
+  [14, 23, 24, 19, 6],
+  [13, 22, 21, 20, 7],
+  [12, 11, 10, 9, 8]
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralArray(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function spiralArray(n) {
+  var arr = Array(n),
+    x = 0,
+    y = n,
+    total = n * n--,
+    dx = 1,
+    dy = 0,
+    i = 0,
+    j = 0;
+  while (y) arr[--y] = [];
+  while (i < total) {
+    arr[y][x] = i++;
+    x += dx;
+    y += dy;
+    if (++j == n) {
+      if (dy < 0) {
+        x++;
+        y++;
+        n -= 2;
+      }
+      j = dx;
+      dx = -dy;
+      dy = j;
+      j = 0;
+    }
+  }
+  return arr;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
new file mode 100644
index 0000000000..4bb28fba9a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
@@ -0,0 +1,145 @@
+---
+id: 5a23c84252665b21eecc801d
+title: Split a character string based on change of character
+challengeType: 5
+forumTopicId: 302322
+dashedName: split-a-character-string-based-on-change-of-character
+---
+
+# --description--
+
+Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Blanks should be treated as any other character (except they are problematic to display clearly). The same applies to commas. For instance, the string:
+
+<pre>
+"gHHH5YY++///\\"
+</pre>
+
+should be split as:
+
+<pre>
+["g", "HHH", "5", "YY", "++", "///", "\\" ];
+</pre>
+
+# --hints--
+
+`split` should be a function.
+
+```js
+assert(typeof split == 'function');
+```
+
+`split("hello")` should return an array.
+
+```js
+assert(Array.isArray(split('hello')));
+```
+
+`split("hello")` should return `["h", "e", "ll", "o"]`.
+
+```js
+assert.deepEqual(split('hello'), ['h', 'e', 'll', 'o']);
+```
+
+`split("commission")` should return `["c", "o", "mm", "i", "ss", "i", "o", "n"]`.
+
+```js
+assert.deepEqual(split('commission'), [
+  'c',
+  'o',
+  'mm',
+  'i',
+  'ss',
+  'i',
+  'o',
+  'n'
+]);
+```
+
+`split("ssss----====llloooo")` should return `["ssss", "----", "====", "lll", "oooo"]`.
+
+```js
+assert.deepEqual(split('ssss----====llloooo'), [
+  'ssss',
+  '----',
+  '====',
+  'lll',
+  'oooo'
+]);
+```
+
+`split("sssmmmaaammmaaat")` should return `["sss", "mmm", "aaa", "mmm", "aaa", "t"]`.
+
+```js
+assert.deepEqual(split('sssmmmaaammmaaat'), [
+  'sss',
+  'mmm',
+  'aaa',
+  'mmm',
+  'aaa',
+  't'
+]);
+```
+
+`split("gHHH5YY++///\\")` should return `["g", "HHH", "5", "YY", "++", "///", "\\"]`.
+
+```js
+assert.deepEqual(split('gHHH5YY++///\\'), [
+  'g',
+  'HHH',
+  '5',
+  'YY',
+  '++',
+  '///',
+  '\\'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function split(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function split(str) {
+  const concat = xs =>
+    xs.length > 0
+      ? (() => {
+          const unit = typeof xs[0] === 'string' ? '' : [];
+          return unit.concat.apply(unit, xs);
+        })()
+      : [];
+
+  const group = xs => groupBy((a, b) => a === b, xs);
+
+  const groupBy = (f, xs) => {
+    const dct = xs.slice(1).reduce(
+      (a, x) => {
+        const h = a.active.length > 0 ? a.active[0] : undefined,
+          blnGroup = h !== undefined && f(h, x);
+        return {
+          active: blnGroup ? a.active.concat([x]) : [x],
+          sofar: blnGroup ? a.sofar : a.sofar.concat([a.active])
+        };
+      },
+      {
+        active: xs.length > 0 ? [xs[0]] : [],
+        sofar: []
+      }
+    );
+    return dct.sofar.concat(dct.active.length > 0 ? [dct.active] : []);
+  };
+
+  const map = (f, xs) => xs.map(f);
+
+  const stringChars = s => s.split('');
+
+  return map(concat, group(stringChars(str)));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
new file mode 100644
index 0000000000..d22ef19220
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -0,0 +1,159 @@
+---
+id: 5a23c84252665b21eecc8024
+title: State name puzzle
+challengeType: 5
+forumTopicId: 302323
+dashedName: state-name-puzzle
+---
+
+# --description--
+
+This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two *different* U.S. States (so that all four state names differ from one another). What states are these? The problem was reissued on [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to [Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering), [equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation), and [equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes). The basic merits of these were discussed in the Unicon Discussion Web. A second challenge in the form of a set of fictitious new states was also presented.
+
+# --instructions--
+
+Write a function to solve the challenge for the given array of names of states. The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The "from" array should contain the original names and the "to" array should contain the resultant names.
+
+# --hints--
+
+`solve` should be a function.
+
+```js
+assert(typeof solve == 'function');
+```
+
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    solve([
+      'New Mexico',
+      'New York',
+      'North Carolina ',
+      'North Dakota',
+      'Ohio',
+      'Oklahoma',
+      'Oregon',
+      'Pennsylvania',
+      'Rhode Island',
+      'South Carolina',
+      'South Dakota'
+    ])
+  )
+);
+```
+
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]`.
+
+```js
+assert.deepEqual(
+  solve([
+    'New Mexico',
+    'New York',
+    'North Carolina ',
+    'North Dakota',
+    'Ohio',
+    'Oklahoma',
+    'Oregon',
+    'Pennsylvania',
+    'Rhode Island',
+    'South Carolina',
+    'South Dakota'
+  ]),
+  [
+    {
+      from: ['North Carolina ', 'South Dakota'],
+      to: ['North Dakota', 'South Carolina']
+    }
+  ]
+);
+```
+
+`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` should return `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]`.
+
+```js
+assert.deepEqual(
+  solve([
+    'New York',
+    'New Kory',
+    'Wen Kory',
+    'York New',
+    'Kory New',
+    'New Kory'
+  ]),
+  [
+    { from: ['New Kory', 'New York'], to: ['Wen Kory', 'York New'] },
+    { from: ['New Kory', 'New York'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['New Kory', 'New York'], to: ['Kory New', 'York New'] },
+    { from: ['New York', 'Wen Kory'], to: ['New Kory', 'York New'] },
+    { from: ['New York', 'Wen Kory'], to: ['Kory New', 'New Kory'] },
+    { from: ['New York', 'Wen Kory'], to: ['Kory New', 'York New'] },
+    { from: ['New York', 'York New'], to: ['New Kory', 'Wen Kory'] },
+    { from: ['New York', 'York New'], to: ['Kory New', 'New Kory'] },
+    { from: ['New York', 'York New'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['Kory New', 'New York'], to: ['New Kory', 'Wen Kory'] },
+    { from: ['Kory New', 'New York'], to: ['New Kory', 'York New'] },
+    { from: ['Kory New', 'New York'], to: ['Wen Kory', 'York New'] },
+    { from: ['New Kory', 'Wen Kory'], to: ['Kory New', 'York New'] },
+    { from: ['New Kory', 'York New'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['Kory New', 'New Kory'], to: ['Wen Kory', 'York New'] }
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function solve(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function solve(input) {
+  var orig = {};
+  input.forEach(function(e) {
+    orig[__helpers.removeWhiteSpace(e).toLowerCase()] = e;
+  });
+
+  input = Object.keys(orig);
+  var map = {};
+  for (var i = 0; i < input.length - 1; i++) {
+    var pair0 = input[i];
+    for (var j = i + 1; j < input.length; j++) {
+      var pair = [pair0, input[j]];
+      var s = pair0 + pair[1];
+      var key = s.split('').sort();
+
+      var val = map[key] ? map[key] : [];
+      val.push(pair);
+      map[key] = val;
+    }
+  }
+
+  var result = [];
+  Object.keys(map).forEach(key => {
+    for (var i = 0; i < map[key].length - 1; i++) {
+      var a = map[key][i];
+      for (var j = i + 1; j < map[key].length; j++) {
+        var b = map[key][j];
+
+        if (new Set([a[0], b[0], a[1], b[1]]).size < 4) continue;
+        var from = [orig[a[0]], orig[a[1]]].sort();
+        var to = [orig[b[0]], orig[b[1]]].sort();
+        result.push({
+          from,
+          to
+        });
+      }
+    }
+  });
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
new file mode 100644
index 0000000000..219db4002c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -0,0 +1,114 @@
+---
+id: 5a23c84252665b21eecc8028
+title: Stern-Brocot sequence
+challengeType: 5
+forumTopicId: 302324
+dashedName: stern-brocot-sequence
+---
+
+# --description--
+
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence>).
+
+<ol>
+  <li>The first and second members of the sequence are both 1:</li>
+    <ul><li>1, 1</li></ul>
+  <li>Start by considering the second member of the sequence</li>
+  <li>Sum the considered member of the sequence and its precedent, (1 + 1) = 2, and append it to the end of the
+    sequence:</li>
+    <ul><li>1, 1, 2</li></ul>
+  <li>Append the considered member of the sequence to the end of the sequence:</li>
+    <ul><li>1, 1, 2, 1</li></ul>
+  <li>Consider the next member of the series, (the third member i.e. 2)</li>
+  <li>GOTO 3 </li>
+    <ul>
+      <li></li>
+      <li> ─── Expanding another loop we get: ───</li>
+      <li></li>
+    </ul>
+  <li>Sum the considered member of the sequence and its precedent, (2 + 1) = 3, and append it to the end of the
+    sequence:</li>
+    <ul><li>1, 1, 2, 1, 3</li></ul>
+  <li>Append the considered member of the sequence to the end of the sequence:</li>
+    <ul><li>1, 1, 2, 1, 3, 2</li></ul>
+  <li>Consider the next member of the series, (the fourth member i.e. 1)</li>
+</ol>
+
+# --instructions--
+
+Create a function that returns the position in the Stern-Brocot sequence at which $ n $ is first encountered, where the sequence is generated with the method outlined above. Note that this sequence uses 1 based indexing.
+
+# --hints--
+
+`sternBrocot` should be a function.
+
+```js
+assert(typeof sternBrocot == 'function');
+```
+
+`sternBrocot(2)` should return a number.
+
+```js
+assert(typeof sternBrocot(2) == 'number');
+```
+
+`sternBrocot(2)` should return `3`.
+
+```js
+assert.equal(sternBrocot(2), 3);
+```
+
+`sternBrocot(3)` should return `5`.
+
+```js
+assert.equal(sternBrocot(3), 5);
+```
+
+`sternBrocot(5)` should return `11`.
+
+```js
+assert.equal(sternBrocot(5), 11);
+```
+
+`sternBrocot(7)` should return `19`.
+
+```js
+assert.equal(sternBrocot(7), 19);
+```
+
+`sternBrocot(10)` should return `39`.
+
+```js
+assert.equal(sternBrocot(10), 39);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sternBrocot(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sternBrocot(num) {
+  function f(n) {
+    return n < 2
+      ? n
+      : n & 1
+      ? f(Math.floor(n / 2)) + f(Math.floor(n / 2 + 1))
+      : f(Math.floor(n / 2));
+  }
+
+  function gcd(a, b) {
+    return a ? (a < b ? gcd(b % a, a) : gcd(a % b, b)) : b;
+  }
+  var n;
+  for (n = 1; f(n) != num; n++);
+  return n;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
new file mode 100644
index 0000000000..e89ca872e6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -0,0 +1,186 @@
+---
+id: 5a23c84252665b21eecc8029
+title: Straddling checkerboard
+challengeType: 5
+forumTopicId: 302325
+dashedName: straddling-checkerboard
+---
+
+# --description--
+
+Implement functions to encrypt and decrypt a message using the [straddling checkerboard](https://en.wikipedia.org/wiki/Straddling_checkerboard) method. The functions will take a string and an array as parameters. The array has 3 strings representing the 3 rows of the checkerboard. The output will be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit unencrypted. This should be reversed for decryption.
+
+# --hints--
+
+`straddle` should be a function.
+
+```js
+assert(typeof straddle == 'function');
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
+
+```js
+assert(
+  typeof straddle(
+    'One night-it was on the twentieth of March, 1888-I was returning.',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ) == 'string'
+);
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"34045747525284613427502840425027537379697175891898898898584619028294547488"`.
+
+```js
+assert.equal(
+  straddle(
+    'One night-it was on the twentieth of March, 1888-I was returning.',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ),
+  '34045747525284613427502840425027537379697175891898898898584619028294547488'
+);
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"`.
+
+```js
+assert.equal(
+  straddle('One night-it was on the twentieth of March, 1888-I was returning', [
+    'HOL MES RT',
+    'ABCDFGIJKN',
+    'PQUVWXYZ./'
+  ]),
+  '139539363509369743061399059745399365901344308320791798798798367430685972839363935'
+);
+```
+
+`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"`.
+
+```js
+assert.equal(
+  straddle('Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.', [
+    'ET AON RIS',
+    'BCDFGHJKLM',
+    'PQ/UVWXYZ.'
+  ]),
+  '125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769'
+);
+```
+
+`unstraddle` should be a function.
+
+```js
+assert(typeof unstraddle == 'function');
+```
+
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
+
+```js
+assert(
+  typeof unstraddle(
+    '34045747525284613427502840425027537379697175891898898898584619028294547488',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ) == 'string'
+);
+```
+
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."`.
+
+```js
+assert.equal(
+  unstraddle(
+    '34045747525284613427502840425027537379697175891898898898584619028294547488',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ),
+  'ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING.'
+);
+```
+
+`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"`.
+
+```js
+assert.equal(
+  unstraddle(
+    '139539363509369743061399059745399365901344308320791798798798367430685972839363935',
+    ['HOL MES RT', 'ABCDFGIJKN', 'PQUVWXYZ./']
+  ),
+  'ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING'
+);
+```
+
+`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."`.
+
+```js
+assert.equal(
+  unstraddle(
+    '125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769',
+    ['ET AON RIS', 'BCDFGHJKLM', 'PQ/UVWXYZ.']
+  ),
+  'THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR.'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function straddle(message, alphabet) {
+
+}
+
+function unstraddle(message, alphabet) {
+
+}
+```
+
+# --solutions--
+
+```js
+function straddle(message, alphabet) {
+  var prefixes = new Array(
+    '',
+    alphabet[0].indexOf(' '),
+    alphabet[0].lastIndexOf(' ')
+  );
+
+  var out = '';
+  message = message.toUpperCase();
+  message = message.replace(/([0-9])/g, '/$1'); // dumb way to escape numbers
+  for (var i = 0; i < message.length; i++) {
+    var chr = message[i];
+    if (chr == ' ') continue;
+    for (var j = 0; j < 3; j++) {
+      var k = alphabet[j].indexOf(chr);
+      if (k < 0) continue;
+      out += prefixes[j].toString() + k;
+    }
+    if (chr == '/') out += message[++i];
+  }
+  return out;
+}
+function unstraddle(message, alphabet) {
+  var prefixes = new Array(
+    '',
+    alphabet[0].indexOf(' '),
+    alphabet[0].lastIndexOf(' ')
+  );
+  var out = '';
+  var n, o;
+  for (var i = 0; i < message.length; i++) {
+    n = message[i] * 1;
+    switch (n) {
+      case prefixes[1]:
+        o = alphabet[1][message[++i]];
+        break;
+      case prefixes[2]:
+        o = alphabet[2][message[++i]];
+        break;
+      default:
+        o = alphabet[0][n];
+    }
+    o == '/' ? (out += message[++i]) : (out += o);
+  }
+  return out;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stream-merge.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stream-merge.md
new file mode 100644
index 0000000000..234158bb50
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/stream-merge.md
@@ -0,0 +1,140 @@
+---
+id: 5a23c84252665b21eecc802a
+title: Stream Merge
+challengeType: 5
+forumTopicId: 302326
+dashedName: stream-merge
+---
+
+# --description--
+
+Write a function that takes multiple sorted arrays of items, and returns one array of sorted items.
+
+# --hints--
+
+`mergeLists` should be a function.
+
+```js
+assert(typeof mergeLists == 'function');
+```
+
+`mergeLists([[1, 3, 5, 9, 10], [2, 4, 6, 7, 8]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    mergeLists([
+      [1, 3, 5, 9, 10],
+      [2, 4, 6, 7, 8]
+    ])
+  )
+);
+```
+
+`mergeLists([[1, 3, 5, 9, 10], [2, 4, 6, 7, 8]])` should return `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 3, 5, 9, 10],
+    [2, 4, 6, 7, 8]
+  ]),
+  [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+);
+```
+
+`mergeLists([[1, 4, 7, 10], [2, 5, 8, 11], [3, 6, 9, 12]])` should return `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 4, 7, 10],
+    [2, 5, 8, 11],
+    [3, 6, 9, 12]
+  ]),
+  [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
+);
+```
+
+`mergeLists([[1, 3, 9, 14, 15, 17, 28], [7, 8, 14, 14, 23, 26, 28, 29, 30], [9, 23, 25, 29]])` should return `[1, 3, 7, 8, 9, 9, 14, 14, 14, 15, 17, 23, 23, 25, 26, 28, 28, 29, 29, 30]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 3, 9, 14, 15, 17, 28],
+    [7, 8, 14, 14, 23, 26, 28, 29, 30],
+    [9, 23, 25, 29]
+  ]),
+  [1, 3, 7, 8, 9, 9, 14, 14, 14, 15, 17, 23, 23, 25, 26, 28, 28, 29, 29, 30]
+);
+```
+
+`mergeLists([[3, 14, 15], [2, 17, 18], [], [2, 3, 5, 7]])` should return `[2, 2, 3, 3, 5, 7, 14, 15, 17, 18]`.
+
+```js
+assert.deepEqual(mergeLists([[3, 14, 15], [2, 17, 18], [], [2, 3, 5, 7]]), [
+  2,
+  2,
+  3,
+  3,
+  5,
+  7,
+  14,
+  15,
+  17,
+  18
+]);
+```
+
+`mergeLists([[1, 19, 1999], [17, 33, 2999, 3000], [8, 500, 3999]])` should return `[1, 8, 17, 19, 33, 500, 1999, 2999, 3000, 3999]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 19, 1999],
+    [17, 33, 2999, 3000],
+    [8, 500, 3999]
+  ]),
+  [1, 8, 17, 19, 33, 500, 1999, 2999, 3000, 3999]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mergeLists(lists) {
+
+}
+```
+
+# --solutions--
+
+```js
+function mergeLists(lists) {
+  function merge(l1, l2) {
+    var result = [],
+      i = 0,
+      j = 0;
+    while (l1.length && l2.length) {
+      if (l1[i] <= l2[j]) {
+        result.push(l1.shift());
+      } else {
+        result.push(l2.shift());
+      }
+    }
+
+    result.push.apply(result, l1);
+    result.push.apply(result, l2);
+    return result;
+  }
+
+  var result = lists[0];
+  for (var i = 1; i < lists.length; i++) {
+    result = merge(result, lists[i]);
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
new file mode 100644
index 0000000000..317f9dd7b7
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
@@ -0,0 +1,80 @@
+---
+id: 5a23c84252665b21eecc8036
+title: Strip control codes and extended characters from a string
+challengeType: 5
+forumTopicId: 302327
+dashedName: strip-control-codes-and-extended-characters-from-a-string
+---
+
+# --description--
+
+The task is to strip control codes and extended characters from a string. The solution should demonstrate how to achieve each of the following results: A string with control codes and extended characters stripped. In ASCII, the control codes have decimal codes 0 through to 31 and 127. On an ASCII based system, if the control codes are stripped, the resultant string would have all of its characters within the range of 32 to 126 decimal on the ASCII table. On a non-ASCII based system, we consider characters that do not have a corresponding glyph on the ASCII table (within the ASCII range of 32 to 126 decimal) to be an extended character for the purpose of this task.
+
+# --hints--
+
+`strip` should be a function.
+
+```js
+assert(typeof strip == 'function');
+```
+
+`strip("abc")` should return a string.
+
+```js
+assert(typeof strip('abc') == 'string');
+```
+
+`strip("\ba\x00b\n\rc\fd\xc3")` should return `"abcd"`.
+
+```js
+assert.equal(strip('\ba\x00b\n\rc\fd\xc3'), 'abcd');
+```
+
+`strip("\u0000\n abc\u00E9def\u007F")` should return `" abcdef"`.
+
+```js
+assert.equal(strip('\u0000\n abc\u00E9def\u007F'), ' abcdef');
+```
+
+`strip("a\n\tb\u2102d\u2147f")` should return `"abdf"`.
+
+```js
+assert.equal(strip('a\n\tb\u2102d\u2147f'), 'abdf');
+```
+
+`strip("Français.")` should return `"Franais."`.
+
+```js
+assert.equal(strip('Français.'), 'Franais.');
+```
+
+`strip("123\tabc\u0007DEF\u007F+-*/€æŧðłþ")` should return `"123abcDEF+-*/"`.
+
+```js
+assert.equal(strip('123\tabc\u0007DEF\u007F+-*/€æŧðłþ'), '123abcDEF+-*/');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function strip(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function strip(s) {
+  return s
+    .split('')
+    .filter(function(x) {
+      var n = x.charCodeAt(0);
+
+      return 31 < n && 127 > n;
+    })
+    .join('');
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/subleq.md
new file mode 100644
index 0000000000..d302bb9f99
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/subleq.md
@@ -0,0 +1,196 @@
+---
+id: 5a23c84252665b21eecc8038
+title: Subleq
+challengeType: 5
+forumTopicId: 302328
+dashedName: subleq
+---
+
+# --description--
+
+[Subleq](https://rosettacode.org/wiki/eso:Subleq) is an example of a [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+
+It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual
+
+to zero.
+
+Your task is to create an interpreter which emulates such a machine.
+
+The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be
+
+able to hold negative as well as positive numbers.
+
+Execution begins with the instruction pointer aimed at the first word, which is address 0. It proceeds as follows:
+
+<ol>
+  <li>Let A, B, and C be the value stored in the three consecutive words in memory starting at the instruction pointer.</li>
+  <li>Advance the instruction pointer 3 words to point at the address after the one containing C.</li>
+  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C
+    is unused.</li>
+  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the
+    corresponding character output. C is again unused.</li>
+  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address
+    given by A is subtracted from the number at the address given by B (and the result stored back in address B). If
+    the result is zero or negative, the value C becomes the new instruction pointer.</li>
+  <li>If the instruction pointer becomes negative, execution halts.</li>
+</ol>
+
+Other negative addresses besides -1 may be treated as equivalent to -1, or generate an error, as you see fit.
+
+Your solution should accept a program to execute on the machine, separately from the input fed to the program itself.
+
+This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or
+
+other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when
+
+fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N
+
+character sets or Unicode. You may translate it into another character set if your implementation is on a
+
+non-ASCiI-compatible environment.)
+
+<pre>15 17 -1 17 -1 -1 16 1 -1 16 3 -1 15 15 0 0 -1 72 101 108 108 111 44 32 119 111 114 108 100 33 10 0</pre>
+
+Which corresponds to something like this in a hypothetical assembler language:
+
+<pre>start:
+    zero, message, -1
+    message, -1, -1
+    neg1, start+1, -1
+    neg1, start+3, -1
+    zero, zero, start
+zero: 0
+neg1: -1
+message: "Hello, world!\n\0"
+</pre>
+
+# --instructions--
+
+Write a function that takes an array of integers as a parameter. This represents the memory elements. The function
+
+should interpret the sequence and return the output string. For this task, assume that there is no standard input.
+
+# --hints--
+
+`Subleq` should be a function.
+
+```js
+assert(typeof Subleq == 'function');
+```
+
+`Subleq([15, 17, -1, 17, -1, -1, 16, 1, -1, 16, 3, -1, 15, 15, 0, 0, -1, 72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33, 0])` should return a string.
+
+```js
+assert(
+  typeof Subleq([
+    15,
+    17,
+    -1,
+    17,
+    -1,
+    -1,
+    16,
+    1,
+    -1,
+    16,
+    3,
+    -1,
+    15,
+    15,
+    0,
+    0,
+    -1,
+    72,
+    101,
+    108,
+    108,
+    111,
+    44,
+    32,
+    119,
+    111,
+    114,
+    108,
+    100,
+    33,
+    0
+  ]) == 'string'
+);
+```
+
+`Subleq([15, 17, -1, 17, -1, -1, 16, 1, -1, 16, 3, -1, 15, 15, 0, 0, -1, 72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33, 0])` should return `"Hello, world!"`.
+
+```js
+assert.equal(
+  Subleq([
+    15,
+    17,
+    -1,
+    17,
+    -1,
+    -1,
+    16,
+    1,
+    -1,
+    16,
+    3,
+    -1,
+    15,
+    15,
+    0,
+    0,
+    -1,
+    72,
+    101,
+    108,
+    108,
+    111,
+    44,
+    32,
+    119,
+    111,
+    114,
+    108,
+    100,
+    33,
+    0
+  ]),
+  'Hello, world!'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Subleq(mem) {
+
+}
+```
+
+# --solutions--
+
+```js
+function Subleq(mem) {
+  var out = '';
+  var instructionPointer = 0;
+  do {
+    var a = mem[instructionPointer];
+    var b = mem[instructionPointer + 1];
+    if (a === -1) {
+    } else if (b === -1) {
+      out += String.fromCharCode(mem[a]);
+    } else {
+      mem[b] -= mem[a];
+      if (mem[b] < 1) {
+        instructionPointer = mem[instructionPointer + 2];
+        continue;
+      }
+    }
+    instructionPointer += 3;
+  } while (instructionPointer >= 0);
+
+  return out;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sudoku.md
new file mode 100644
index 0000000000..e0f6864a89
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -0,0 +1,321 @@
+---
+id: 5a23c84252665b21eecc803c
+title: Sudoku
+challengeType: 5
+forumTopicId: 302329
+dashedName: sudoku
+---
+
+# --description--
+
+Write a function to solve a partially filled-in normal 9x9 [Sudoku](https://en.wikipedia.org/wiki/Sudoku) grid and return the result. The blank fields are represented by `-1`. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+
+# --hints--
+
+`solveSudoku` should be a function.
+
+```js
+assert(typeof solveSudoku == 'function');
+```
+
+`solveSudoku([[8, 1, 9, -1, -1, 5, -1, -1, -1],[-1, -1, 2, -1, -1, -1, 7, 5, -1],[-1, 3, 7, 1, -1, 4, -1, 6, -1],[4, -1, -1, 5, 9, -1, 1, -1, -1],[7, -1, -1, 3, -1, 8, -1, -1, 2],[-1, -1, 3, -1, 6, 2, -1, -1, 7],[-1, 5, -1, 7, -1, 9, 2, 1, -1],[-1, 6, 4, -1, -1, -1, 9, -1, -1],[-1, -1, -1, 2, -1, -1, 4, 3, 8]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    solveSudoku([
+      [8, 1, 9, -1, -1, 5, -1, -1, -1],
+      [-1, -1, 2, -1, -1, -1, 7, 5, -1],
+      [-1, 3, 7, 1, -1, 4, -1, 6, -1],
+      [4, -1, -1, 5, 9, -1, 1, -1, -1],
+      [7, -1, -1, 3, -1, 8, -1, -1, 2],
+      [-1, -1, 3, -1, 6, 2, -1, -1, 7],
+      [-1, 5, -1, 7, -1, 9, 2, 1, -1],
+      [-1, 6, 4, -1, -1, -1, 9, -1, -1],
+      [-1, -1, -1, 2, -1, -1, 4, 3, 8]
+    ])
+  )
+);
+```
+
+`solveSudoku([[8, 1, 9, -1, -1, 5, -1, -1, -1],[-1, -1, 2, -1, -1, -1, 7, 5, -1],[-1, 3, 7, 1, -1, 4, -1, 6, -1],[4, -1, -1, 5, 9, -1, 1, -1, -1],[7, -1, -1, 3, -1, 8, -1, -1, 2],[-1, -1, 3, -1, 6, 2, -1, -1, 7],[-1, 5, -1, 7, -1, 9, 2, 1, -1],[-1, 6, 4, -1, -1, -1, 9, -1, -1],[-1, -1, -1, 2, -1, -1, 4, 3, 8]])` should return `[[8, 1, 9, 6, 7, 5, 3, 2, 4],[6, 4, 2, 9, 8, 3, 7, 5, 1],[5, 3, 7, 1, 2, 4, 8, 6, 9],[4, 2, 6, 5, 9, 7, 1, 8, 3],[7, 9, 5, 3, 1, 8, 6, 4, 2],[1, 8, 3, 4, 6, 2, 5, 9, 7],[3, 5, 8, 7, 4, 9, 2, 1, 6],[2, 6, 4, 8, 3, 1, 9, 7, 5],[9, 7, 1, 2, 5, 6, 4, 3, 8]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [8, 1, 9, -1, -1, 5, -1, -1, -1],
+    [-1, -1, 2, -1, -1, -1, 7, 5, -1],
+    [-1, 3, 7, 1, -1, 4, -1, 6, -1],
+    [4, -1, -1, 5, 9, -1, 1, -1, -1],
+    [7, -1, -1, 3, -1, 8, -1, -1, 2],
+    [-1, -1, 3, -1, 6, 2, -1, -1, 7],
+    [-1, 5, -1, 7, -1, 9, 2, 1, -1],
+    [-1, 6, 4, -1, -1, -1, 9, -1, -1],
+    [-1, -1, -1, 2, -1, -1, 4, 3, 8]
+  ]),
+  [
+    [8, 1, 9, 6, 7, 5, 3, 2, 4],
+    [6, 4, 2, 9, 8, 3, 7, 5, 1],
+    [5, 3, 7, 1, 2, 4, 8, 6, 9],
+    [4, 2, 6, 5, 9, 7, 1, 8, 3],
+    [7, 9, 5, 3, 1, 8, 6, 4, 2],
+    [1, 8, 3, 4, 6, 2, 5, 9, 7],
+    [3, 5, 8, 7, 4, 9, 2, 1, 6],
+    [2, 6, 4, 8, 3, 1, 9, 7, 5],
+    [9, 7, 1, 2, 5, 6, 4, 3, 8]
+  ]
+);
+```
+
+`solveSudoku([[5, 3, -1, -1, 2, 4, 7, -1, -1],[-1, -1, 2, -1, -1, -1, 8, -1, -1],[1, -1, -1, 7, -1, 3, 9, -1, 2],[-1, -1, 8, -1, 7, 2, -1, 4, 9],[-1, 2, -1, 9, 8, -1, -1, 7, -1],[7, 9, -1, -1, -1, -1, -1, 8, -1],[-1, -1, -1, -1, 3, -1, 5, -1, 6],[9, 6, -1, -1, 1, -1, 3, -1, -1],[-1, 5, -1, 6, 9, -1, -1, 1, -1]])` should return `[[5, 3, 9, 8, 2, 4, 7, 6, 1],[6, 7, 2, 1, 5, 9, 8, 3, 4],[1, 8, 4, 7, 6, 3, 9, 5, 2],[3, 1, 8, 5, 7, 2, 6, 4, 9],[4, 2, 5, 9, 8, 6, 1, 7, 3],[7, 9, 6, 3, 4, 1, 2, 8, 5],[8, 4, 1, 2, 3, 7, 5, 9, 6],[9, 6, 7, 4, 1, 5, 3, 2, 8],[2, 5, 3, 6, 9, 8, 4, 1, 7]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [5, 3, -1, -1, 2, 4, 7, -1, -1],
+    [-1, -1, 2, -1, -1, -1, 8, -1, -1],
+    [1, -1, -1, 7, -1, 3, 9, -1, 2],
+    [-1, -1, 8, -1, 7, 2, -1, 4, 9],
+    [-1, 2, -1, 9, 8, -1, -1, 7, -1],
+    [7, 9, -1, -1, -1, -1, -1, 8, -1],
+    [-1, -1, -1, -1, 3, -1, 5, -1, 6],
+    [9, 6, -1, -1, 1, -1, 3, -1, -1],
+    [-1, 5, -1, 6, 9, -1, -1, 1, -1]
+  ]),
+  [
+    [5, 3, 9, 8, 2, 4, 7, 6, 1],
+    [6, 7, 2, 1, 5, 9, 8, 3, 4],
+    [1, 8, 4, 7, 6, 3, 9, 5, 2],
+    [3, 1, 8, 5, 7, 2, 6, 4, 9],
+    [4, 2, 5, 9, 8, 6, 1, 7, 3],
+    [7, 9, 6, 3, 4, 1, 2, 8, 5],
+    [8, 4, 1, 2, 3, 7, 5, 9, 6],
+    [9, 6, 7, 4, 1, 5, 3, 2, 8],
+    [2, 5, 3, 6, 9, 8, 4, 1, 7]
+  ]
+);
+```
+
+`solveSudoku([[-1, -1, 3, -1, 2, -1, 6, -1, -1],[9, -1, -1, 3, -1, 5, -1, -1, 1],[-1, -1, 1, 8, -1, 6, 4, -1, -1],[-1, -1, 8, 1, -1, 2, 9, -1, -1],[7, -1, -1, -1, -1, -1, -1, -1, 8],[-1, -1, 6, 7, -1, 8, 2, -1, -1],[-1, -1, 2, 6, -1, 9, 5, -1, -1],[8, -1, -1, 2, -1, 3, -1, -1, 9],[-1, -1, 5, -1, 1, -1, 3, -1, -1]])` should return `[[4, 8, 3, 9, 2, 1, 6, 5, 7],[9, 6, 7, 3, 4, 5, 8, 2, 1],[2, 5, 1, 8, 7, 6, 4, 9, 3],[5, 4, 8, 1, 3, 2, 9, 7, 6],[7, 2, 9, 5, 6, 4, 1, 3, 8],[1, 3, 6, 7, 9, 8, 2, 4, 5],[3, 7, 2, 6, 8, 9, 5, 1, 4],[8, 1, 4, 2, 5, 3, 7, 6, 9],[6, 9, 5, 4, 1, 7, 3, 8, 2]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [-1, -1, 3, -1, 2, -1, 6, -1, -1],
+    [9, -1, -1, 3, -1, 5, -1, -1, 1],
+    [-1, -1, 1, 8, -1, 6, 4, -1, -1],
+    [-1, -1, 8, 1, -1, 2, 9, -1, -1],
+    [7, -1, -1, -1, -1, -1, -1, -1, 8],
+    [-1, -1, 6, 7, -1, 8, 2, -1, -1],
+    [-1, -1, 2, 6, -1, 9, 5, -1, -1],
+    [8, -1, -1, 2, -1, 3, -1, -1, 9],
+    [-1, -1, 5, -1, 1, -1, 3, -1, -1]
+  ]),
+  [
+    [4, 8, 3, 9, 2, 1, 6, 5, 7],
+    [9, 6, 7, 3, 4, 5, 8, 2, 1],
+    [2, 5, 1, 8, 7, 6, 4, 9, 3],
+    [5, 4, 8, 1, 3, 2, 9, 7, 6],
+    [7, 2, 9, 5, 6, 4, 1, 3, 8],
+    [1, 3, 6, 7, 9, 8, 2, 4, 5],
+    [3, 7, 2, 6, 8, 9, 5, 1, 4],
+    [8, 1, 4, 2, 5, 3, 7, 6, 9],
+    [6, 9, 5, 4, 1, 7, 3, 8, 2]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function solveSudoku(puzzle) {
+
+}
+```
+
+# --solutions--
+
+```js
+function solveSudoku(puzzle) {
+  var solution;
+
+  class DoX {
+    constructor(V, H) {
+      this.V = V;
+      this.L = this;
+      this.R = this;
+      this.U = this;
+      this.D = this;
+      this.S = 1;
+      this.H = H || this;
+      H && (H.S += 1);
+    }
+  }
+
+  const addRight = (e, n) => {
+    n.R = e.R;
+    n.L = e;
+    e.R.L = n;
+    return (e.R = n);
+  };
+
+  const addBelow = (e, n) => {
+    n.D = e.D;
+    n.U = e;
+    e.D.U = n;
+    return (e.D = n);
+  };
+
+  const search = function(h, s) {
+    if (h.R == h) {
+      printSol(s);
+    } else {
+      let c = chooseColumn(h);
+      cover(c);
+      for (let r = c.D; r != c; r = r.D) {
+        s.push(r);
+        for (let j = r.R; r != j; j = j.R) {
+          cover(j.H);
+        }
+        search(h, s);
+        r = s.pop();
+        for (let j = r.R; j != r; j = j.R) {
+          uncover(j.H);
+        }
+      }
+      uncover(c);
+    }
+  };
+
+  const chooseColumn = h => {
+    let s = Number.POSITIVE_INFINITY;
+    let c = h;
+    for (let j = h.R; j != h; j = j.R) {
+      if (j.S < s) {
+        c = j;
+        s = j.S;
+      }
+    }
+    return c;
+  };
+
+  const cover = c => {
+    c.L.R = c.R;
+    c.R.L = c.L;
+    for (let i = c.D; i != c; i = i.D) {
+      for (let j = i.R; j != i; j = j.R) {
+        j.U.D = j.D;
+        j.D.U = j.U;
+        j.H.S = j.H.S - 1;
+      }
+    }
+  };
+
+  const uncover = c => {
+    for (let i = c.U; i != c; i = i.U) {
+      for (let j = i.L; i != j; j = j.L) {
+        j.H.S = j.H.S + 1;
+        j.U.D = j;
+        j.D.U = j;
+      }
+    }
+    c.L.R = c;
+    c.R.L = c;
+  };
+
+  const printSol = a => {
+    solution = a.reduce((p, c) => {
+      let [i, v] = c.V.split(':');
+      p[i * 1] = v;
+      return p;
+    }, new Array(a.length).fill('.'));
+  };
+
+  const gridMeta = s => {
+    const g = s.split('');
+    const cellCount = g.length;
+    const tokenCount = Math.sqrt(cellCount);
+    const N = Math.sqrt(tokenCount);
+    const g2D = g.map(e =>
+      isNaN(e * 1)
+        ? new Array(tokenCount).fill(1).map((_, i) => i + 1)
+        : [e * 1]
+    );
+    return [cellCount, N, tokenCount, g2D];
+  };
+
+  const indexesN = n => i => {
+    let c = Math.floor(i / (n * n));
+    i %= n * n;
+    return [c, i, Math.floor(c / n) * n + Math.floor(i / n)];
+  };
+
+  const reduceGrid = puzString => {
+    const [
+      numCells, // The total number of cells in a grid (81 for a 9x9 grid)
+      N, // the 'n' value of the grid. (3 for a 9x9 grid)
+      U, // The total number of unique tokens to be placed.
+      g2D // A 2D array representation of the grid, with each element
+      // being an array of candidates for a cell. Known cells are
+      // single element arrays.
+    ] = gridMeta(puzString);
+
+    const getIndex = indexesN(N);
+
+    const headRow = new Array(4 * numCells)
+      .fill('')
+      .map((_, i) => new DoX(`H${i}`));
+
+    let H = new DoX('ROOT');
+    headRow.reduce((p, c) => addRight(p, c), H);
+
+    for (let i = 0; i < numCells; i++) {
+      const [ri, ci, bi] = getIndex(i);
+      g2D[i].forEach(num => {
+        let id = `${i}:${num}`;
+        let candIdx = num - 1;
+
+        // The 4 columns that we will populate.
+        const A = headRow[i];
+        const B = headRow[numCells + candIdx + ri * U];
+        const C = headRow[numCells * 2 + candIdx + ci * U];
+        const D = headRow[numCells * 3 + candIdx + bi * U];
+
+        // The Row-Column Constraint
+        let rcc = addBelow(A.U, new DoX(id, A));
+
+        // The Row-Number Constraint
+        let rnc = addBelow(B.U, addRight(rcc, new DoX(id, B)));
+
+        // The Column-Number Constraint
+        let cnc = addBelow(C.U, addRight(rnc, new DoX(id, C)));
+
+        // The Block-Number Constraint
+        addBelow(D.U, addRight(cnc, new DoX(id, D)));
+      });
+    }
+    search(H, []);
+  };
+
+  var stringPuzzle = '';
+
+  for (var i = 0; i < puzzle.length; i++) {
+    puzzle[i].forEach(function(e) {
+      if (e == -1) stringPuzzle += '.';
+      else stringPuzzle += e;
+    });
+  }
+
+  reduceGrid(stringPuzzle);
+
+  var result = [];
+
+  for (var i = 0; i < 9; i++) {
+    result.push(solution.slice(i * 9, (i + 1) * 9).map(e => parseInt(e)));
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
new file mode 100644
index 0000000000..d13a1bdb03
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
@@ -0,0 +1,89 @@
+---
+id: 5a23c84252665b21eecc803f
+title: Sum digits of an integer
+challengeType: 5
+forumTopicId: 302331
+dashedName: sum-digits-of-an-integer
+---
+
+# --description--
+
+Write a function that takes a string as a parameter. This string represents a number that can be in any base (less than 37) and return the sum of its digits.
+
+<ul>
+  <li><b>1</b><sub>10</sub> sums to <b>1</b></li>
+  <li><b>1234</b><sub>10</sub> sums to <b>10</b></li>
+  <li><b>fe</b><sub>16</sub> sums to <b>29</b></li>
+  <li><b>f0e</b><sub>16</sub> sums to <b>29</b></li>
+</ul>
+
+# --hints--
+
+`sumDigits` should be a function.
+
+```js
+assert(typeof sumDigits == 'function');
+```
+
+`sumDigits("1")` should return a number.
+
+```js
+assert(typeof sumDigits('1') == 'number');
+```
+
+`sumDigits("1")` should return `1`.
+
+```js
+assert.equal(sumDigits('1'), 1);
+```
+
+`sumDigits("12345")` should return `15`.
+
+```js
+assert.equal(sumDigits('12345'), 15);
+```
+
+`sumDigits("254")` should return `11`.
+
+```js
+assert.equal(sumDigits('254'), 11);
+```
+
+`sumDigits("fe")` should return `29`.
+
+```js
+assert.equal(sumDigits('fe'), 29);
+```
+
+`sumDigits("f0e")` should return `29`.
+
+```js
+assert.equal(sumDigits('f0e'), 29);
+```
+
+`sumDigits("999ABCXYZ")` should return `162`.
+
+```js
+assert.equal(sumDigits('999ABCXYZ'), 162);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumDigits(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumDigits(n) {
+  n += '';
+  for (var s = 0, i = 0, e = n.length; i < e; i += 1)
+    s += parseInt(n.charAt(i), 36);
+  return s;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
new file mode 100644
index 0000000000..f92d5b9d21
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
@@ -0,0 +1,77 @@
+---
+id: 5a23c84252665b21eecc8040
+title: Sum multiples of 3 and 5
+challengeType: 5
+forumTopicId: 302332
+dashedName: sum-multiples-of-3-and-5
+---
+
+# --description--
+
+The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below *n*.
+
+# --hints--
+
+`sumMults` should be a function.
+
+```js
+assert(typeof sumMults == 'function');
+```
+
+`sumMults(10)` should return a number.
+
+```js
+assert(typeof sumMults(10) == 'number');
+```
+
+`sumMults(10)` should return `23`.
+
+```js
+assert.equal(sumMults(10), 23);
+```
+
+`sumMults(100)` should return `2318`.
+
+```js
+assert.equal(sumMults(100), 2318);
+```
+
+`sumMults(1000)` should return `233168`.
+
+```js
+assert.equal(sumMults(1000), 233168);
+```
+
+`sumMults(10000)` should return `23331668`.
+
+```js
+assert.equal(sumMults(10000), 23331668);
+```
+
+`sumMults(100000)` should return `2333316668`.
+
+```js
+assert.equal(sumMults(100000), 2333316668);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumMults(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumMults(n) {
+  var sum = 0;
+  for (var i = 1; i < n; i++) {
+    if (i % 3 == 0 || i % 5 == 0) sum += i;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
new file mode 100644
index 0000000000..3e7e0b4e4f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -0,0 +1,82 @@
+---
+id: 5a23c84252665b21eecc8041
+title: Sum of a series
+challengeType: 5
+forumTopicId: 302333
+dashedName: sum-of-a-series
+---
+
+# --description--
+
+Compute the **n**<sup>th</sup> term of a [series](<https://en.wikipedia.org/wiki/Series (mathematics)>), i.e. the sum of the **n** first terms of the corresponding [sequence](https://en.wikipedia.org/wiki/sequence). Informally this value, or its limit when **n** tends to infinity, is also called the *sum of the series*, thus the title of this task. For this task, use: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+
+# --instructions--
+
+Write a function that take $a$ and $b$ as parameters and returns the sum of $a^{th}$ to $b^{th}$ members of the sequence.
+
+# --hints--
+
+`sum` should be a function.
+
+```js
+assert(typeof sum == 'function');
+```
+
+`sum(1, 100)` should return a number.
+
+```js
+assert(typeof sum(1, 100) == 'number');
+```
+
+`sum(1, 100)` should return `1.6349839001848923`.
+
+```js
+assert.equal(sum(1, 100), 1.6349839001848923);
+```
+
+`sum(33, 46)` should return `0.009262256361481223`.
+
+```js
+assert.equal(sum(33, 46), 0.009262256361481223);
+```
+
+`sum(21, 213)` should return `0.044086990748706555`.
+
+```js
+assert.equal(sum(21, 213), 0.044086990748706555);
+```
+
+`sum(11, 111)` should return `0.08619778593108679`.
+
+```js
+assert.equal(sum(11, 111), 0.08619778593108679);
+```
+
+`sum(1, 10)` should return `1.5497677311665408`.
+
+```js
+assert.equal(sum(1, 10), 1.5497677311665408);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sum(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sum(a, b) {
+  function fn(x) {
+    return 1 / (x * x);
+  }
+  var s = 0;
+  for (; a <= b; a++) s += fn(a);
+  return s;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-squares.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-squares.md
new file mode 100644
index 0000000000..d211cbc165
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-of-squares.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc8042
+title: Sum of squares
+challengeType: 5
+forumTopicId: 302334
+dashedName: sum-of-squares
+---
+
+# --description--
+
+Write a function to find the sum of squares of an array of integers.
+
+# --hints--
+
+`sumsq` should be a function.
+
+```js
+assert(typeof sumsq == 'function');
+```
+
+`sumsq([1, 2, 3, 4, 5])` should return a number.
+
+```js
+assert(typeof sumsq([1, 2, 3, 4, 5]) == 'number');
+```
+
+`sumsq([1, 2, 3, 4, 5])` should return `55`.
+
+```js
+assert.equal(sumsq([1, 2, 3, 4, 5]), 55);
+```
+
+`sumsq([25, 32, 12, 7, 20])` should return `2242`.
+
+```js
+assert.equal(sumsq([25, 32, 12, 7, 20]), 2242);
+```
+
+`sumsq([38, 45, 35, 8, 13])` should return `4927`.
+
+```js
+assert.equal(sumsq([38, 45, 35, 8, 13]), 4927);
+```
+
+`sumsq([43, 36, 20, 34, 24])` should return `5277`.
+
+```js
+assert.equal(sumsq([43, 36, 20, 34, 24]), 5277);
+```
+
+`sumsq([12, 33, 26, 18, 1, 16, 3])` should return `2499`.
+
+```js
+assert.equal(sumsq([12, 33, 26, 18, 1, 16, 3]), 2499);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumsq(array) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumsq(array) {
+  var sum = 0;
+  var i, iLen;
+
+  for (i = 0, iLen = array.length; i < iLen; i++) {
+    sum += array[i] * array[i];
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-to-100.md
new file mode 100644
index 0000000000..f30b422ba8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -0,0 +1,180 @@
+---
+id: 5a23c84252665b21eecc8043
+title: Sum to 100
+challengeType: 5
+forumTopicId: 302335
+dashedName: sum-to-100
+---
+
+# --description--
+
+Find solutions to the *sum to one hundred* puzzle.
+
+Add (insert) the mathematical operators **+** or **─** (plus or minus) before any of the digits in the decimal numeric string **123456789** such that the resulting mathematical expression adds up to a particular sum (in this iconic case, **100**).
+
+Example:
+
+<pre><b>123 + 4 - 5 + 67 - 89   =   100</b></pre>
+
+# --instructions--
+
+Write a function that takes a number as parameter. The function should return an array containing all solutions for the given number. The solutions should be strings representing the expressions. For example: "1+23-456+78-9". Sort the array before returning it.
+
+# --hints--
+
+`sumTo100` should be a function.
+
+```js
+assert(typeof sumTo100 == 'function');
+```
+
+`sumTo100(199)` should return an array.
+
+```js
+assert(Array.isArray(sumTo100(199)));
+```
+
+`sumTo100(199)` should return `["-1+2-3+45+67+89", "123-4+5+6+78-9", "123-4+56+7+8+9"]`.
+
+```js
+assert.deepEqual(sumTo100(199), [
+  '-1+2-3+45+67+89',
+  '123-4+5+6+78-9',
+  '123-4+56+7+8+9'
+]);
+```
+
+`sumTo100(209)` should return `["1+234+56+7-89"]`.
+
+```js
+assert.deepEqual(sumTo100(209), ['1+234+56+7-89']);
+```
+
+`sumTo100(243)` should return `["-1-234+567-89", "-12+345+6-7-89", "123+45+6+78-9"]`.
+
+```js
+assert.deepEqual(sumTo100(243), [
+  '-1-234+567-89',
+  '-12+345+6-7-89',
+  '123+45+6+78-9'
+]);
+```
+
+`sumTo100(197)` should return `["1-2-3+45+67+89", "12+34-5+67+89", "123+4-5+6+78-9"]`.
+
+```js
+assert.deepEqual(sumTo100(197), [
+  '1-2-3+45+67+89',
+  '12+34-5+67+89',
+  '123+4-5+6+78-9'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumTo100(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumTo100(n) {
+  var permutationsWithRepetition = function(n, as) {
+    return as.length > 0
+      ? foldl1(curry(cartesianProduct)(as), replicate(n, as))
+      : [];
+  };
+
+  var cartesianProduct = function(xs, ys) {
+    return [].concat.apply(
+      [],
+      xs.map(function(x) {
+        return [].concat.apply(
+          [],
+          ys.map(function(y) {
+            return [[x].concat(y)];
+          })
+        );
+      })
+    );
+  };
+
+  var curry = function(f) {
+    return function(a) {
+      return function(b) {
+        return f(a, b);
+      };
+    };
+  };
+
+  var flip = function(f) {
+    return function(a, b) {
+      return f.apply(null, [b, a]);
+    };
+  };
+
+  var foldl1 = function(f, xs) {
+    return xs.length > 0 ? xs.slice(1).reduce(f, xs[0]) : [];
+  };
+
+  var replicate = function(n, a) {
+    var v = [a],
+      o = [];
+    if (n < 1) return o;
+    while (n > 1) {
+      if (n & 1) o = o.concat(v);
+      n >>= 1;
+      v = v.concat(v);
+    }
+    return o.concat(v);
+  };
+
+  var asSum = function(xs) {
+    var dct = xs.reduceRight(
+      function(a, sign, i) {
+        var d = i + 1; //  zero-based index to [1-9] positions
+        if (sign !== 0) {
+          // Sum increased, digits cleared
+          return {
+            digits: [],
+            n: a.n + sign * parseInt([d].concat(a.digits).join(''), 10)
+          };
+        } else
+          return {
+            // Digits extended, sum unchanged
+            digits: [d].concat(a.digits),
+            n: a.n
+          };
+      },
+      {
+        digits: [],
+        n: 0
+      }
+    );
+    return (
+      dct.n + (dct.digits.length > 0 ? parseInt(dct.digits.join(''), 10) : 0)
+    );
+  };
+
+  var asString = function(xs) {
+    var ns = xs.reduce(function(a, sign, i) {
+      var d = (i + 1).toString();
+      return sign === 0 ? a + d : a + (sign > 0 ? '+' : '-') + d;
+    }, '');
+
+    return ns[0] === '+' ? tail(ns) : ns;
+  };
+
+  var universe = permutationsWithRepetition(9, [0, 1, -1])
+    .filter(function(x) {
+      return x[0] !== 1 && asSum(x) === n;
+    })
+    .map(asString);
+  return universe.sort();
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
new file mode 100644
index 0000000000..c3b671bf5a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -0,0 +1,199 @@
+---
+id: 5a23c84252665b21eecc8045
+title: Sutherland-Hodgman polygon clipping
+challengeType: 5
+forumTopicId: 302336
+dashedName: sutherland-hodgman-polygon-clipping
+---
+
+# --description--
+
+The [Sutherland-Hodgman clipping algorithm](<https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm>) finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
+
+<pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
+
+and clip it by the rectangle defined by the points:
+
+<pre>[(100, 100), (300, 100), (300, 300), (100, 300)]</pre>
+
+# --instructions--
+
+Write a function that takes 2 arrays as parameters. The first array contains the points of the subject polygon and the second array contains the points of the clipping polygon. The function should return an array containing the points of the clipped polygon. Each number should be rounded to 3 decimal places.
+
+# --hints--
+
+`clip` should be a function.
+
+```js
+assert(typeof clip == 'function');
+```
+
+`clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    clip(
+      [
+        [50, 150],
+        [200, 50],
+        [350, 150],
+        [350, 300],
+        [250, 300],
+        [200, 250],
+        [150, 350],
+        [100, 250],
+        [100, 200]
+      ],
+      [
+        [100, 100],
+        [300, 100],
+        [300, 300],
+        [100, 300]
+      ]
+    )
+  )
+);
+```
+
+`clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])` should return `[[100, 116.667], [125, 100], [275, 100], [300, 116.667], [300, 300], [250, 300], [200, 250], [175, 300], [125, 300], [100, 250]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [50, 150],
+      [200, 50],
+      [350, 150],
+      [350, 300],
+      [250, 300],
+      [200, 250],
+      [150, 350],
+      [100, 250],
+      [100, 200]
+    ],
+    [
+      [100, 100],
+      [300, 100],
+      [300, 300],
+      [100, 300]
+    ]
+  ),
+  [
+    [100, 116.667],
+    [125, 100],
+    [275, 100],
+    [300, 116.667],
+    [300, 300],
+    [250, 300],
+    [200, 250],
+    [175, 300],
+    [125, 300],
+    [100, 250]
+  ]
+);
+```
+
+`clip([[150, 200], [400, 450], [30, 50]], [[10, 10], [300, 200], [400, 600], [100, 300]])` should return `[[150, 200], [350, 400], [348.611, 394.444], [30, 50]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [150, 200],
+      [400, 450],
+      [30, 50]
+    ],
+    [
+      [10, 10],
+      [300, 200],
+      [400, 600],
+      [100, 300]
+    ]
+  ),
+  [
+    [150, 200],
+    [350, 400],
+    [348.611, 394.444],
+    [30, 50]
+  ]
+);
+```
+
+`clip([[250, 200], [100, 450], [130, 250]], [[50, 60], [100, 230], [400, 600], [100, 300]])` should return `[[129.167, 329.167], [119.565, 319.565], [121.854, 304.305]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [250, 200],
+      [100, 450],
+      [130, 250]
+    ],
+    [
+      [50, 60],
+      [100, 230],
+      [400, 600],
+      [100, 300]
+    ]
+  ),
+  [
+    [129.167, 329.167],
+    [119.565, 319.565],
+    [121.854, 304.305]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function clip(subjectPolygon, clipPolygon) {
+
+}
+```
+
+# --solutions--
+
+```js
+function clip(subjectPolygon, clipPolygon) {
+  var cp1, cp2, s, e, i, j;
+  var inside = function(p) {
+    return (
+      (cp2[0] - cp1[0]) * (p[1] - cp1[1]) > (cp2[1] - cp1[1]) * (p[0] - cp1[0])
+    );
+  };
+  var intersection = function() {
+    var dc = [cp1[0] - cp2[0], cp1[1] - cp2[1]],
+      dp = [s[0] - e[0], s[1] - e[1]],
+      n1 = cp1[0] * cp2[1] - cp1[1] * cp2[0],
+      n2 = s[0] * e[1] - s[1] * e[0],
+      n3 = 1.0 / (dc[0] * dp[1] - dc[1] * dp[0]);
+    return [(n1 * dp[0] - n2 * dc[0]) * n3, (n1 * dp[1] - n2 * dc[1]) * n3];
+  };
+  var outputList = subjectPolygon;
+  cp1 = clipPolygon[clipPolygon.length - 1];
+  for (j in clipPolygon) {
+    var cp2 = clipPolygon[j];
+    var inputList = outputList;
+    outputList = [];
+    s = inputList[inputList.length - 1]; //last on the input list
+    for (i in inputList) {
+      var e = inputList[i];
+      if (inside(e)) {
+        if (!inside(s)) {
+          outputList.push(intersection());
+        }
+        outputList.push(e);
+      } else if (inside(s)) {
+        outputList.push(intersection());
+      }
+      s = e;
+    }
+    cp1 = cp2;
+  }
+  return outputList.map(e => e.map(f => Math.round(f * 1000) / 1000));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
new file mode 100644
index 0000000000..422cb77cc2
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -0,0 +1,121 @@
+---
+id: 5a23c84252665b21eecc8046
+title: Symmetric difference
+challengeType: 5
+forumTopicId: 16086
+dashedName: symmetric-difference
+---
+
+# --description--
+
+Given two [set](https://rosettacode.org/wiki/set)s *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the [symmetric difference](<https://en.wikipedia.org/wiki/Symmetric difference>) of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+
+# --instructions--
+
+Write a function that takes two arrays as parameters and returns the symmetric difference. Sort the resultant array before returning it.
+
+# --hints--
+
+`symmetricDifference` should be a function.
+
+```js
+assert(typeof symmetricDifference == 'function');
+```
+
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    symmetricDifference(
+      ['John', 'Bob', 'Mary', 'Serena'],
+      ['Jim', 'Mary', 'John', 'Bob']
+    )
+  )
+);
+```
+
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return `["Jim", "Serena"]`.
+
+```js
+assert.deepEqual(
+  symmetricDifference(
+    ['John', 'Bob', 'Mary', 'Serena'],
+    ['Jim', 'Mary', 'John', 'Bob']
+  ),
+  ['Jim', 'Serena']
+);
+```
+
+`symmetricDifference([1, 2, 3], [3, 4])` should return `[1, 2, 4]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 3], [3, 4]), [1, 2, 4]);
+```
+
+`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` should return `[1, 2, 5, 7, 8]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
+  1,
+  2,
+  5,
+  7,
+  8
+]);
+```
+
+`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` should return `[2, 4, 9]`.
+
+```js
+assert.deepEqual(
+  symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9]),
+  [2, 4, 9]
+);
+```
+
+`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` should return `[1, 3, 4, 8]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9]), [
+  1,
+  3,
+  4,
+  8
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function symmetricDifference(A, B) {
+
+}
+```
+
+# --solutions--
+
+```js
+function symmetricDifference(A, B) {
+  function relative_complement(A, B) {
+    return A.filter(function(elem) {
+      return B.indexOf(elem) == -1;
+    });
+  }
+
+  function unique(ary) {
+    var u = ary.concat().sort();
+    for (var i = 1; i < u.length; ) {
+      if (u[i - 1] === u[i]) u.splice(i, 1);
+      else i++;
+    }
+    return u;
+  }
+
+  return unique(
+    relative_complement(A, B).concat(relative_complement(B, A))
+  ).sort();
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
new file mode 100644
index 0000000000..54a2aa0e7f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -0,0 +1,140 @@
+---
+id: 594ecc0d9a8cf816e3340187
+title: Taxicab numbers
+challengeType: 5
+forumTopicId: 302337
+dashedName: taxicab-numbers
+---
+
+# --description--
+
+A [taxicab number](<https://en.wikipedia.org/wiki/Hardy–Ramanujan number> "wp: Hardy–Ramanujan number") (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
+
+The first taxicab number is `1729`, which is:
+
+1<sup>3</sup> + 12<sup>3</sup> and
+
+9<sup>3</sup> + 10<sup>3</sup>.
+
+Taxicab numbers are also known as:
+
+<ul>
+  <li>taxi numbers</li>
+  <li>taxi-cab numbers</li>
+  <li>taxi cab numbers</li>
+  <li>Hardy-Ramanujan numbers</li>
+</ul>
+
+# --instructions--
+
+Write a function that returns the lowest `n` taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
+
+**See also:**
+
+<ul>
+  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 taxicab numbers</a> on The On-Line Encyclopedia of Integer Sequences.</li>
+  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>taxicab number</a> on Wikipedia.</li>
+</ul>
+
+# --hints--
+
+`taxicabNumbers` should be a function.
+
+```js
+assert(typeof taxicabNumbers === 'function');
+```
+
+`taxicabNumbers` should return an array.
+
+```js
+assert(typeof taxicabNumbers(2) === 'object');
+```
+
+`taxicabNumbers` should return an array of numbers.
+
+```js
+assert(typeof taxicabNumbers(100)[0] === 'number');
+```
+
+`taxicabNumbers(4)` should return [1729, 4104, 13832, 20683].
+
+```js
+assert.deepEqual(taxicabNumbers(4), res4);
+```
+
+`taxicabNumbers(25)` should return [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]
+
+```js
+assert.deepEqual(taxicabNumbers(25), res25);
+```
+
+`taxicabNumbers(39)` resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].
+
+```js
+assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const res4 = [1729, 4104, 13832, 20683];
+const res25 = [
+  1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656,
+  110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763,
+  373464, 402597
+];
+
+const res39From20To29 = [314496, 320264, 327763, 373464, 402597, 439101, 443889, 513000, 513856];
+```
+
+## --seed-contents--
+
+```js
+function taxicabNumbers(n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function taxicabNumbers(nNumbers) {
+  const cubeN = [];
+  const s3s = {};
+
+  const e = 100;
+  for (let n = 1; n < e; n += 1) {
+    cubeN[n] = n * n * n;
+  }
+
+  for (let a = 1; a < e - 1; a += 1) {
+    const a3 = cubeN[a];
+    for (let b = a; b < e; b += 1) {
+      const b3 = cubeN[b];
+      const s3 = a3 + b3;
+
+      let abs = s3s[s3];
+      if (!abs) {
+        s3s[s3] = abs = [];
+      }
+      abs.push([a, b]);
+    }
+  }
+
+  let i = 0;
+  const res = [];
+  Object.keys(s3s).forEach(s3 => {
+    const abs = s3s[s3];
+    if (abs.length >= 2) { // No two cube pairs found
+      i += 1;
+      if (i <= nNumbers) {
+        res.push(s3);
+      }
+    }
+  });
+  return res.map(item => parseInt(item, 10));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
new file mode 100644
index 0000000000..24a65a163e
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
@@ -0,0 +1,124 @@
+---
+id: 594faaab4e2a8626833e9c3d
+title: Tokenize a string with escaping
+challengeType: 5
+forumTopicId: 302338
+dashedName: tokenize-a-string-with-escaping
+---
+
+# --description--
+
+Write a function or program that can split a string at each non-escaped occurrence of a separator character.
+
+It should accept three input parameters:
+
+<ul>
+  <li>The <strong>string</strong></li>
+  <li>The <strong>separator character</strong></li>
+  <li>The <strong>escape character</strong></li>
+</ul>
+
+It should output a list of strings.
+
+Rules for splitting:
+
+<ul>
+  <li>The fields that were separated by the separators, become the elements of the output list.</li>
+  <li>Empty fields should be preserved, even at the start and end.</li>
+</ul>
+
+Rules for escaping:
+
+<ul>
+  <li>"Escaped" means preceded by an occurrence of the escape character that is not already escaped itself.</li>
+  <li>When the escape character precedes a character that has no special meaning, it still counts as an escape (but does not do anything special).</li>
+  <li>Each occurrences of the escape character that was used to escape something, should not become part of the output.</li>
+</ul>
+
+Demonstrate that your function satisfies the following test-case:
+
+Given the string
+
+<pre>one^|uno||three^^^^|four^^^|^cuatro|</pre>
+
+and using `|` as a separator and `^` as escape character, your function should output the following array:
+
+<pre>  ['one|uno', '', 'three^^', 'four^|cuatro', '']
+</pre>
+
+# --hints--
+
+`tokenize` should be a function.
+
+```js
+assert(typeof tokenize === 'function');
+```
+
+`tokenize` should return an array.
+
+```js
+assert(typeof tokenize('a', 'b', 'c') === 'object');
+```
+
+`tokenize('one^|uno||three^^^^|four^^^|^cuatro|', '|', '^')` should return `['one|uno', '', 'three^^', 'four^|cuatro', '']`
+
+```js
+assert.deepEqual(tokenize(testStr1, '|', '^'), res1);
+```
+
+`tokenize('a@&bcd&ef&&@@hi', '&', '@')` should return `['a&bcd', 'ef', '', '@hi']`
+
+```js
+assert.deepEqual(tokenize(testStr2, '&', '@'), res2);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testStr1 = 'one^|uno||three^^^^|four^^^|^cuatro|';
+const res1 = ['one|uno', '', 'three^^', 'four^|cuatro', ''];
+
+// TODO add more tests
+const testStr2 = 'a@&bcd&ef&&@@hi';
+const res2 = ['a&bcd', 'ef', '', '@hi'];
+```
+
+## --seed-contents--
+
+```js
+function tokenize(str, sep, esc) {
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// tokenize :: String -> Character -> Character -> [String]
+function tokenize(str, charDelim, charEsc) {
+  const dctParse = str.split('')
+    .reduce((a, x) => {
+      const blnEsc = a.esc;
+      const blnBreak = !blnEsc && x === charDelim;
+      const blnEscChar = !blnEsc && x === charEsc;
+
+      return {
+        esc: blnEscChar,
+        token: blnBreak ? '' : (
+          a.token + (blnEscChar ? '' : x)
+        ),
+        list: a.list.concat(blnBreak ? a.token : [])
+      };
+    }, {
+      esc: false,
+      token: '',
+      list: []
+    });
+
+  return dctParse.list.concat(
+    dctParse.token
+  );
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/top-rank-per-group.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
new file mode 100644
index 0000000000..56cd284379
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
@@ -0,0 +1,192 @@
+---
+id: 595011cba5a81735713873bd
+title: Top rank per group
+challengeType: 5
+forumTopicId: 302339
+dashedName: top-rank-per-group
+---
+
+# --description--
+
+Find the top `n` ranked data in each group, where `n` is provided as a parameter. Name of the rank and the group are also provided as parameter.
+
+Given the following data:
+
+```js
+testData1 = [
+  { name: 'Tyler Bennett', id: 'E10297', salary: 32000, dept: 'D101' },
+  { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050' },
+  { name: 'George Woltman', id: 'E00127', salary: 53500, dept: 'D101' },
+  { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' },
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D202' },
+  { name: 'David McClellan', id: 'E04242', salary: 41500, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D202' },
+  { name: 'Nathan Adams', id: 'E41298', salary: 21900, dept: 'D050' },
+  { name: 'Richard Potter', id: 'E43128', salary: 15900, dept: 'D101' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D202' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
+];
+```
+
+One could rank top 10 employees in each department by calling:
+
+```js
+topRankPerGroup(10, testData1, 'dept', 'salary')
+```
+
+Given the following data:
+
+```js
+testData2 = [
+  { name: 'Friday 13th', genre: 'horror', rating: 9.9 },
+  { name: "Nightmare on Elm's Street", genre: 'horror', rating: 5.7 },
+  { name: 'Titanic', genre: 'drama', rating: 7.3 },
+  { name: 'Maze Runner', genre: 'scifi', rating: 7.1 },
+  { name: 'Blade runner', genre: 'scifi', rating: 8.9 }
+];
+```
+
+One could rank the top-rated movie in each genre by calling:
+
+```js
+topRankPerGroup(1, testData2, 'genre', 'rating')
+```
+
+The function should return an array with an array for each group containing the top `n` objects.
+
+For example, given data:
+
+```js
+[
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D050' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D050' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D050' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D101' }
+];
+```
+
+Top two ranking employees in each department by salary would be:
+
+```js
+[ [ { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D050' },
+    { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D050' } ],
+  [ { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D101' },
+    { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D101' } ] ]
+```
+
+# --hints--
+
+`topRankPerGroup` should be a function.
+
+```js
+assert(typeof topRankPerGroup === 'function');
+```
+
+`topRankPerGroup` should return undefined on negative n values.
+
+```js
+assert(typeof topRankPerGroup(-1, []) === 'undefined');
+```
+
+For `topRankPerGroup(10, testData1, 'dept', 'salary')`, the first result in the first group should be `{ name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050'}`.
+
+```js
+assert.deepEqual(res1[0][0], { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050'});
+```
+
+For `topRankPerGroup(10, testData1, 'dept', 'salary')`, the last result in the last group should be `{ name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' }`.
+
+```js
+assert.deepEqual(res1[3][3], { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' });
+```
+
+`topRankPerGroup(1, ...)` should return only top ranking result per group.
+
+```js
+assert.equal(res2[2].length, 1);
+```
+
+`topRankPerGroup(2, ...)` should return two ranking results per group.
+
+```js
+assert.equal(res3[2][1].name, 'Maze Runner');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testData1 = [
+  { name: 'Tyler Bennett', id: 'E10297', salary: 32000, dept: 'D101' },
+  { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050' },
+  { name: 'George Woltman', id: 'E00127', salary: 53500, dept: 'D101' },
+  { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' },
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D202' },
+  { name: 'David McClellan', id: 'E04242', salary: 41500, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D202' },
+  { name: 'Nathan Adams', id: 'E41298', salary: 21900, dept: 'D050' },
+  { name: 'Richard Potter', id: 'E43128', salary: 15900, dept: 'D101' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D202' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
+];
+
+const res1 = topRankPerGroup(10, testData1, 'dept', 'salary');
+
+const testData2 = [
+  { name: 'Friday 13th', genre: 'horror', rating: 9.9 },
+  { name: "Nightmare on Elm's Street", genre: 'horror', rating: 5.7 },
+  { name: 'Titanic', genre: 'drama', rating: 7.3 },
+  { name: 'Maze Runner', genre: 'scifi', rating: 7.1 },
+  { name: 'Blade runner', genre: 'scifi', rating: 8.9 }
+];
+
+const res2 = topRankPerGroup(1, testData2, 'genre', 'rating');
+const res3 = topRankPerGroup(2, testData2, 'genre', 'rating');
+```
+
+## --seed-contents--
+
+```js
+function topRankPerGroup(n, data, groupName, rankName) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const collectDept = function (arrOfObj, groupName) {
+  const collect = arrOfObj.reduce((rtnObj, obj) => {
+    if (rtnObj[obj[groupName]] === undefined) {
+      rtnObj[obj[groupName]] = [];
+    }
+    rtnObj[obj[groupName]].push(obj);
+    return rtnObj;
+  }, {} // initial value to reduce
+  );
+
+  return Object.keys(collect).sort().map(key => collect[key]);
+};
+
+const sortRank = function (arrOfRankArrs, rankName) {
+  return arrOfRankArrs.map(item => item.sort((a, b) => {
+    if (a[rankName] > b[rankName]) { return -1; }
+    if (a[rankName] < b[rankName]) { return 1; }
+    return 0;
+  }));
+};
+
+function topRankPerGroup(n, data, groupName, rankName) {
+  if (n < 0) { return; }
+  return sortRank(collectDept(data, groupName),
+    rankName).map(list => list.slice(0, n));
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/topological-sort.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/topological-sort.md
new file mode 100644
index 0000000000..f57d218e66
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/topological-sort.md
@@ -0,0 +1,185 @@
+---
+id: 594fa2746886f41f7d8bf225
+title: Topological sort
+challengeType: 5
+forumTopicId: 302340
+dashedName: topological-sort
+---
+
+# --description--
+
+Given a mapping between items, and items they depend on, a topological sort orders items so that no item precedes an item it depends upon. There are two popular algorithms for topological sorting: Kahn's (1962) topological sort and depth-first search.
+
+# --instructions--
+
+Write a function that will return a list with valid compile order of libraries from their dependencies.
+
+- Assume library names are single words.
+- Items mentioned as only dependents have no dependents of their own, but their order of compiling must be given.
+- Any self dependencies should be ignored.
+- Any un-orderable dependencies should be ignored.
+
+Use the following data as an example:
+
+<pre>
+LIBRARY          LIBRARY DEPENDENCIES
+=======          ====================
+des_system_lib   std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee
+dw01             ieee dw01 dware gtech
+dw02             ieee dw02 dware
+dw03             std synopsys dware dw03 dw02 dw01 ieee gtech
+dw04             dw04 ieee dw01 dware gtech
+dw05             dw05 ieee dware
+dw06             dw06 ieee dware
+dw07             ieee dware
+dware            ieee dware
+gtech            ieee gtech
+ramlib           std ieee
+std_cell_lib     ieee std_cell_lib
+synopsys
+</pre>
+
+The compiling of a library in the VHDL language has the constraint that a library must be compiled after any library it depends on. The above data would be un-orderable if, for example, `dw04` is added to the list of dependencies of `dw01`.
+
+The input of the function will be a multiline string, each line will consist of the name of the library, followed by its dependencies (if exist).
+
+For example:
+
+```js
+const libsSimple =
+  `aaa bbb
+  bbb`;
+```
+
+# --hints--
+
+`topologicalSort` should be a function.
+
+```js
+assert(typeof topologicalSort === 'function');
+```
+
+`topologicalSort(libsSimple)` should return an array.
+
+```js
+assert(Array.isArray(topologicalSort(libsSimple)));
+```
+
+`topologicalSort(libsSimple)` should return `['bbb', 'aaa']`.
+
+```js
+assert.deepEqual(topologicalSort(libsSimple), ['bbb', 'aaa']);
+```
+
+`topologicalSort(libsVHDL)` should return `['ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06', 'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys', 'dw03', 'des_system_lib']`.
+
+```js
+assert.deepEqual(topologicalSort(libsVHDL), ['ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06', 'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys', 'dw03', 'des_system_lib']);
+```
+
+`topologicalSort(libsCustom)` should return `['base', 'c', 'd', 'b', 'a']`.
+
+```js
+assert.deepEqual(topologicalSort(libsCustom), ['base', 'c', 'd', 'b', 'a']);
+```
+
+`topologicalSort` should ignore unorderable dependencies.
+
+```js
+assert.deepEqual(topologicalSort(libsUnorderable), ['Base']);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const libsSimple =
+  `aaa bbb
+  bbb`;
+
+const libsVHDL =
+  `des_system_lib   std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee
+  dw01             ieee dw01 dware gtech
+  dw02             ieee dw02 dware
+  dw03             std synopsys dware dw03 dw02 dw01 ieee gtech
+  dw04             dw04 ieee dw01 dware gtech
+  dw05             dw05 ieee dware
+  dw06             dw06 ieee dware
+  dw07             ieee dware
+  dware            ieee dware
+  gtech            ieee gtech
+  ramlib           std ieee
+  std_cell_lib     ieee std_cell_lib
+  synopsys`;
+
+const libsCustom =
+  `a b c d
+  b c d
+  d c
+  c base
+  base`;
+
+const libsUnorderable =
+  `TestLib Base MainLib
+  MainLib TestLib
+  Base`;
+```
+
+## --seed-contents--
+
+```js
+function topologicalSort(libs) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function topologicalSort(libs) {
+  // A map of the input data, with the keys as the packages, and the values as
+  // and array of packages on which it depends.
+  const D = libs
+    .split('\n')
+    .map(e => e.split(' ').filter(ep => ep !== ''))
+    .reduce((p, c) =>
+      p.set(c[0], c.filter((e, i) => (i > 0 && e !== c[0] ? e : null))), new Map());
+  [].concat(...D.values()).forEach(e => {
+    D.set(e, D.get(e) || []);
+  });
+
+  // The above map rotated so that it represents a DAG of the form
+  // Map {
+  //    A => [ A, B, C],
+  //    B => [C],
+  //    C => []
+  // }
+  // where each key represents a node, and the array contains the edges.
+  const G = [...D.keys()].reduce((p, c) =>
+    p.set(
+      c,
+      [...D.keys()].filter(e => D.get(e).includes(c))),
+    new Map()
+  );
+
+  // An array of leaf nodes; nodes with 0 in degrees.
+  const Q = [...D.keys()].filter(e => D.get(e).length === 0);
+
+  // The result array.
+  const S = [];
+  while (Q.length) {
+    const u = Q.pop();
+    S.push(u);
+    G.get(u).forEach(v => {
+      D.set(v, D.get(v).filter(e => e !== u));
+      if (D.get(v).length === 0) {
+        Q.push(v);
+      }
+    });
+  }
+
+  return S;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
new file mode 100644
index 0000000000..4de9c851ba
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -0,0 +1,87 @@
+---
+id: 5951ed8945deab770972ae56
+title: Towers of Hanoi
+challengeType: 5
+forumTopicId: 302341
+dashedName: towers-of-hanoi
+---
+
+# --description--
+
+Solve the [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") problem.
+
+Your solution should accept the number of discs as the first parameters, and three string used to identify each of the three stacks of discs, for example `towerOfHanoi(4, 'A', 'B', 'C')`. The function should return an array of arrays containing the list of moves, source -> destination.
+
+For example, the array `[['A', 'C'], ['B', 'A']]` indicates that the 1st move was to move a disc from stack A to C, and the 2nd move was to move a disc from stack B to A.
+
+<p></p>
+
+# --hints--
+
+`towerOfHanoi` should be a function.
+
+```js
+assert(typeof towerOfHanoi === 'function');
+```
+
+`towerOfHanoi(3, ...)` should return 7 moves.
+
+```js
+assert(res3.length === 7);
+```
+
+`towerOfHanoi(3, 'A', 'B', 'C')` should return `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]`.
+
+```js
+assert.deepEqual(towerOfHanoi(3, 'A', 'B', 'C'), res3Moves);
+```
+
+`towerOfHanoi(5, "X", "Y", "Z")` 10th move should be Y -> X.
+
+```js
+assert.deepEqual(res5[9], ['Y', 'X']);
+```
+
+`towerOfHanoi(7, 'A', 'B', 'C')` first ten moves should be `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]`
+
+```js
+assert.deepEqual(towerOfHanoi(7, 'A', 'B', 'C').slice(0, 10), res7First10Moves);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const res3 = towerOfHanoi(3, 'A', 'B', 'C');
+const res3Moves = [['A', 'B'], ['A', 'C'], ['B', 'C'], ['A', 'B'], ['C', 'A'], ['C', 'B'], ['A', 'B']];
+const res5 = towerOfHanoi(5, 'X', 'Y', 'Z');
+const res7First10Moves = [['A', 'B'], ['A', 'C'], ['B', 'C'], ['A', 'B'], ['C', 'A'], ['C', 'B'], ['A', 'B'], ['A', 'C'], ['B', 'C'], ['B', 'A']];
+```
+
+## --seed-contents--
+
+```js
+function towerOfHanoi(n, a, b, c) {
+
+  return [[]];
+}
+```
+
+# --solutions--
+
+```js
+function towerOfHanoi(n, a, b, c) {
+  const res = [];
+  towerOfHanoiHelper(n, a, c, b, res);
+  return res;
+}
+
+function towerOfHanoiHelper(n, a, b, c, res) {
+  if (n > 0) {
+    towerOfHanoiHelper(n - 1, a, c, b, res);
+    res.push([a, c]);
+    towerOfHanoiHelper(n - 1, b, a, c, res);
+  }
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-cross-product.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-cross-product.md
new file mode 100644
index 0000000000..4dab99b445
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-cross-product.md
@@ -0,0 +1,75 @@
+---
+id: 594810f028c0303b75339ad2
+title: Vector cross product
+challengeType: 5
+forumTopicId: 302342
+dashedName: vector-cross-product
+---
+
+# --description--
+
+A vector is defined as having three dimensions as being represented by an ordered collection of three numbers: (X, Y, Z).
+
+# --instructions--
+
+Write a function that takes two vectors (arrays) as input and computes their cross product. Your function should return `null` on invalid inputs such as vectors of different lengths.
+
+# --hints--
+
+`crossProduct` should be a function.
+
+```js
+assert.equal(typeof crossProduct, 'function');
+```
+
+`crossProduct()` should return null.
+
+```js
+assert.equal(crossProduct(), null);
+```
+
+`crossProduct([1, 2, 3], [4, 5, 6])` should return `[-3, 6, -3]`.
+
+```js
+assert.deepEqual(res12, exp12);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const tv1 = [1, 2, 3];
+const tv2 = [4, 5, 6];
+const res12 = crossProduct(tv1, tv2);
+const exp12 = [-3, 6, -3];
+```
+
+## --seed-contents--
+
+```js
+function crossProduct(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function crossProduct(a, b) {
+  if (!a || !b) {
+    return null;
+  }
+
+  // Check lengths
+  if (a.length !== 3 || b.length !== 3) {
+    return null;
+  }
+
+  return [
+    (a[1] * b[2]) - (a[2] * b[1]),
+    (a[2] * b[0]) - (a[0] * b[2]),
+    (a[0] * b[1]) - (a[1] * b[0])
+  ];
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-dot-product.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-dot-product.md
new file mode 100644
index 0000000000..fb8ae242ae
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/vector-dot-product.md
@@ -0,0 +1,96 @@
+---
+id: 594810f028c0303b75339ad3
+title: Vector dot product
+challengeType: 5
+forumTopicId: 302343
+dashedName: vector-dot-product
+---
+
+# --description--
+
+A vector can have one or more values represented by an ordered collection. Examples could be (x), (x, y), or (x, y, z).
+
+# --instructions--
+
+Write a function that takes two vectors (represented as one-dimensional arrays) as input and computes their dot product. Your function should return `null` on invalid inputs such as vectors of different lengths or passing anything other than two vectors.
+
+# --hints--
+
+`dotProduct` should be a function.
+
+```js
+assert.equal(typeof dotProduct, 'function');
+```
+
+`dotProduct()` should return `null`.
+
+```js
+assert.equal(dotProduct(), null);
+```
+
+`dotProduct([1], [1])` should return `1`.
+
+```js
+assert.equal(dotProduct([1], [1]), 1);
+```
+
+`dotProduct([1], [1, 2])` should return `null`.
+
+```js
+assert.equal(dotProduct([1], [1, 2]), null);
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return `3`.
+
+```js
+assert.equal(dotProduct([1, 3, -5], [4, -2, -1]), 3);
+```
+
+`dotProduct([3, 2, 1], [2, 4, 2], [5, 3, 1])` should return `null`.
+
+```js
+assert.equal(dotProduct([3, 2, 1], [2, 4, 2], [5, 3, 1]), null);
+```
+
+`dotProduct([ 0, 3, 6, 9, 12 ], [ 0, 4, 8, 12, 16 ])` should return `360`.
+
+```js
+assert.equal(dotProduct([ 0, 3, 6, 9, 12 ], [ 0, 4, 8, 12, 16 ]), 360);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function dotProduct(...vectors) {
+
+}
+```
+
+# --solutions--
+
+```js
+function dotProduct(...vectors) {
+  if (!vectors || !vectors.length || vectors.length > 2 || vectors[0].length !== vectors[1].length) {
+    return null;
+  }
+  const vectorLen = vectors[0].length;
+
+  let prod = 0;
+  let sum = 0;
+  let j = vectorLen;
+  let i = 2;
+  // Sum terms
+  while (j--) {
+    i = 2;
+    prod = 1;
+
+    while (i--) {
+      prod *= vectors[i][j];
+    }
+    sum += prod;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-frequency.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-frequency.md
new file mode 100644
index 0000000000..70d2d054dc
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-frequency.md
@@ -0,0 +1,136 @@
+---
+id: 5e94a54cc7b022105bf0fd2c
+title: Word frequency
+challengeType: 5
+forumTopicId: 393913
+dashedName: word-frequency
+---
+
+# --description--
+
+Given a text string and an integer n, return the n most common words in the file (and the number of their occurrences) in decreasing frequency.
+
+# --instructions--
+
+Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurences in decreasing frequency.
+
+The function should return a 2D array with each of the elements in the following form: `[word, freq]`. `word` should be the lowercase version of the word and `freq` the number denoting the count.
+
+The function should return an empty array, if no string is provided.
+
+The function should be case insensitive, for example, the strings "Hello" and "hello" should be treated the same.
+
+You can treat words that have special characters such as underscores, dashes, apostrophes, commas, etc., as distinct words.
+
+For example, given the string "Hello hello goodbye", your function should return `[['hello', 2], ['goodbye', 1]]`.
+
+# --hints--
+
+`wordFrequency` should be a function.
+
+```js
+assert(typeof wordFrequency == 'function');
+```
+
+`wordFrequency` should return an array.
+
+```js
+assert(Array.isArray(wordFrequency('test')));
+```
+
+`wordFrequency("Hello hello world", 2)` should return `[['hello', 2], ['world', 1]]`
+
+```js
+assert.deepEqual(wordFrequency(example_1, 2), example_1_solution);
+```
+
+`wordFrequency("The quick brown fox jumped over the lazy dog", 1)` should return `[['the', 2]]`
+
+```js
+assert.deepEqual(wordFrequency(example_2, 1), example_2_solution);
+```
+
+`wordFrequency("Opensource opensource open-source open source", 1)` should return `[['opensource', 2]]`
+
+```js
+assert.deepEqual(wordFrequency(example_3, 1), example_3_solution);
+```
+
+`wordFrequency("Apple App apply aPP aPPlE", 3)` should return `[['app', 2], ['apple', 2], ['apply', 1]]` or `[['apple', 2], ['app', 2], ['apply', 1]]`
+
+```js
+const arr = JSON.stringify(wordFrequency(example_4, 3));
+assert(arr === example_4_solution_a || arr === example_4_solution_b);
+```
+
+`wordFrequency("c d a d c a b d d c", 4)` should return `[['d', 4], ['c', 3], ['a', 2], ['b', 1]]`
+
+```js
+assert.deepEqual(wordFrequency(example_5, 4), example_5_solution);
+```
+
+`wordFrequency("", 5)` should return `[]`
+
+```js
+assert.deepEqual(wordFrequency(example_6, 5), example_6_solution);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+var example_1 = 'Hello hello world';
+var example_1_solution = [['hello', 2], ['world', 1]];
+var example_2 = 'The quick brown fox jumped over the lazy dog';
+var example_2_solution = [['the', 2]];
+var example_3 = 'Opensource opensource open-source open source';
+var example_3_solution = [['opensource', 2]];
+var example_4 = 'Apple App apply aPP aPPlE';
+var example_4_solution_a = "[[\"app\",2],[\"apple\",2],[\"apply\",1]]";
+var example_4_solution_b = "[[\"apple\",2],[\"app\",2],[\"apply\",1]]";
+var example_5 = 'c d a d c a b d d c';
+var example_5_solution = [['d', 4], ['c', 3], ['a', 2], ['b', 1]];
+var example_6 = '';
+var example_6_solution = [];
+```
+
+## --seed-contents--
+
+```js
+function wordFrequency(txt, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function wordFrequency(txt, n) {
+  var words = txt.split(/\s+/);
+  var wordCount = {};
+  words.forEach(word => {
+    if (word == '') {
+      return;
+    }
+    const lowerWord = word.toLowerCase();
+    wordCount[lowerWord] =
+      lowerWord in wordCount ? wordCount[lowerWord] + 1 : 1;
+  });
+
+  var wordsArray = [];
+  for (let [word, count] of Object.entries(wordCount)) {
+    wordsArray.push([word, count]);
+  }
+
+  wordsArray.sort((a, b) => {
+    if (a[1] !== b[1]) {
+      return b[1] - a[1];
+    } else if (a[0] !== b[0]) {
+      return a[0] < b[0] ? -1 : 1;
+    }
+    return 0;
+  });
+  return wordsArray.slice(0, n);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-wrap.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-wrap.md
new file mode 100644
index 0000000000..344be87802
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/word-wrap.md
@@ -0,0 +1,106 @@
+---
+id: 594810f028c0303b75339ad4
+title: Word wrap
+challengeType: 5
+forumTopicId: 302344
+dashedName: word-wrap
+---
+
+# --description--
+
+Even today, with proportional fonts and complex layouts, there are still cases where you need to wrap text at a specified column. The basic task is to wrap a paragraph of text in a simple way.
+
+# --instructions--
+
+Write a function that can wrap this text to any number of characters. As an example, the text wrapped to 80 characters should look like the following:
+
+<pre>
+Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX
+algorithm. If your language provides this, you get easy extra credit, but you
+must reference documentation indicating that the algorithm is something better
+than a simple minimum length algorithm.
+</pre>
+
+# --hints--
+
+wrap should be a function.
+
+```js
+assert.equal(typeof wrap, 'function');
+```
+
+wrap should return a string.
+
+```js
+assert.equal(typeof wrap('abc', 10), 'string');
+```
+
+wrap(80) should return 4 lines.
+
+```js
+assert(wrapped80.split('\n').length === 4);
+```
+
+Your `wrap` function should return our expected text.
+
+```js
+assert.equal(wrapped80.split('\n')[0], firstRow80);
+```
+
+wrap(42) should return 7 lines.
+
+```js
+assert(wrapped42.split('\n').length === 7);
+```
+
+Your `wrap` function should return our expected text.
+
+```js
+assert.equal(wrapped42.split('\n')[0], firstRow42);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const text =
+`Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX algorithm.
+If your language provides this, you get easy extra credit,
+but you ''must reference documentation'' indicating that the algorithm
+is something better than a simple minimum length algorithm.`;
+
+const wrapped80 = wrap(text, 80);
+const wrapped42 = wrap(text, 42);
+
+const firstRow80 =
+    'Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX';
+
+const firstRow42 = 'Wrap text using a more sophisticated';
+```
+
+## --seed-contents--
+
+```js
+function wrap(text, limit) {
+  return text;
+}
+```
+
+# --solutions--
+
+```js
+function wrap(text, limit) {
+  const noNewlines = text.replace('\n', '');
+  if (noNewlines.length > limit) {
+    // find the last space within limit
+    const edge = noNewlines.slice(0, limit).lastIndexOf(' ');
+    if (edge > 0) {
+      const line = noNewlines.slice(0, edge);
+      const remainder = noNewlines.slice(edge + 1);
+      return line + '\n' + wrap(remainder, limit);
+    }
+  }
+  return text;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/y-combinator.md
new file mode 100644
index 0000000000..690e647586
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -0,0 +1,87 @@
+---
+id: 594810f028c0303b75339ad5
+title: Y combinator
+challengeType: 5
+forumTopicId: 302345
+dashedName: y-combinator
+---
+
+# --description--
+
+In strict [functional programming](<https://en.wikipedia.org/wiki/Functional programming> "wp: functional programming") and the [lambda calculus](<https://en.wikipedia.org/wiki/lambda calculus> "wp: lambda calculus"), functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. The [Y combinator](https://mvanier.livejournal.com/2897.html) is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called [fixed-point combinators](<https://en.wikipedia.org/wiki/Fixed-point combinator> "wp: fixed-point combinator").
+
+# --instructions--
+
+Define the stateless Y combinator function and use it to compute [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). The `factorial(N)` function is already given to you. **See also:**
+
+<ul>
+  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
+</ul>
+
+# --hints--
+
+Y should return a function.
+
+```js
+assert.equal(typeof Y((f) => (n) => n), 'function');
+```
+
+factorial(1) should return 1.
+
+```js
+assert.equal(factorial(1), 1);
+```
+
+factorial(2) should return 2.
+
+```js
+assert.equal(factorial(2), 2);
+```
+
+factorial(3) should return 6.
+
+```js
+assert.equal(factorial(3), 6);
+```
+
+factorial(4) should return 24.
+
+```js
+assert.equal(factorial(4), 24);
+```
+
+factorial(10) should return 3628800.
+
+```js
+assert.equal(factorial(10), 3628800);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+var factorial = Y(f => n => (n > 1 ? n * f(n - 1) : 1));
+```
+
+## --seed-contents--
+
+```js
+function Y(f) {
+  return function() {
+
+  };
+}
+
+var factorial = Y(function(f) {
+  return function (n) {
+    return n > 1 ? n * f(n - 1) : 1;
+  };
+});
+```
+
+# --solutions--
+
+```js
+var Y = f => (x => x(x))(y => f(x => y(y)(x)));
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
new file mode 100644
index 0000000000..7794021986
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
@@ -0,0 +1,205 @@
+---
+id: 594810f028c0303b75339ad6
+title: Zeckendorf number representation
+challengeType: 5
+forumTopicId: 302346
+dashedName: zeckendorf-number-representation
+---
+
+# --description--
+
+Just as numbers can be represented in a positional notation as sums of multiples of the powers of ten (decimal) or two (binary); all the positive integers can be represented as the sum of one or zero times the distinct members of the Fibonacci series. Recall that the first six distinct Fibonacci numbers are: `1, 2, 3, 5, 8, 13`.
+
+The decimal number eleven can be written as `0*13 + 1*8 + 0*5 + 1*3 + 0*2 + 0*1` or `010100` in positional notation where the columns represent multiplication by a particular member of the sequence. Leading zeroes are dropped so that 11 decimal becomes `10100`. 10100 is not the only way to make 11 from the Fibonacci numbers however `0*13 + 1*8 + 0*5 + 0*3 + 1*2 + 1*1` or 010011 would also represent decimal 11. For a true Zeckendorf number there is the added restriction that *no two consecutive Fibonacci numbers can be used* which leads to the former unique solution.
+
+# --instructions--
+
+Write a function that generates and returns the Zeckendorf number representation of `n`.
+
+# --hints--
+
+`zeckendorf` should be a function.
+
+```js
+assert.equal(typeof zeckendorf, 'function');
+```
+
+`zeckendorf(0)` should return `0`.
+
+```js
+assert.equal(zeckendorf(0), 0);
+
+```
+
+`zeckendorf(1)` should return `1`.
+
+```js
+assert.equal(zeckendorf(1), 1);
+```
+
+`zeckendorf(2)` should return `10`.
+
+```js
+assert.equal(zeckendorf(2), 10);
+```
+
+`zeckendorf(3)` should return `100`.
+
+```js
+assert.equal(zeckendorf(3), 100);
+```
+
+`zeckendorf(4)` should return `101`.
+
+```js
+assert.equal(zeckendorf(4), 101);
+```
+
+`zeckendorf(5)` should return `1000`.
+
+```js
+assert.equal(zeckendorf(5), 1000);
+```
+
+`zeckendorf(6)` should return `1001`.
+
+```js
+assert.equal(zeckendorf(6), 1001);
+```
+
+`zeckendorf(7)` should return `1010`.
+
+```js
+assert.equal(zeckendorf(7), 1010);
+```
+
+`zeckendorf(8)` should return `10000`.
+
+```js
+assert.equal(zeckendorf(8), 10000);
+```
+
+`zeckendorf(9)` should return `10001`.
+
+```js
+assert.equal(zeckendorf(9), 10001);
+```
+
+`zeckendorf(10)` should return `10010`.
+
+```js
+assert.equal(zeckendorf(10), 10010);
+```
+
+`zeckendorf(11)` should return `10100`.
+
+```js
+assert.equal(zeckendorf(11), 10100);
+```
+
+`zeckendorf(12)` should return `10101`.
+
+```js
+assert.equal(zeckendorf(12), 10101);
+```
+
+`zeckendorf(13)` should return `100000`.
+
+```js
+assert.equal(zeckendorf(13), 100000);
+```
+
+`zeckendorf(14)` should return `100001`.
+
+```js
+assert.equal(zeckendorf(14), 100001);
+```
+
+`zeckendorf(15)` should return `100010`.
+
+```js
+assert.equal(zeckendorf(15), 100010);
+```
+
+`zeckendorf(16)` should return `100100`.
+
+```js
+assert.equal(zeckendorf(16), 100100);
+```
+
+`zeckendorf(17)` should return `100101`.
+
+```js
+assert.equal(zeckendorf(17), 100101);
+```
+
+`zeckendorf(18)` should return `101000`.
+
+```js
+assert.equal(zeckendorf(18), 101000);
+```
+
+`zeckendorf(19)` should return `101001`.
+
+```js
+assert.equal(zeckendorf(19), 101001);
+```
+
+`zeckendorf(20)` should return `101010`.
+
+```js
+assert.equal(zeckendorf(20), 101010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function zeckendorf(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+// zeckendorf :: Int -> Int
+function zeckendorf(n) {
+  const f = (m, x) => (m < x ? [m, 0] : [m - x, 1]);
+  return parseInt((n === 0 ? ([0]) :
+    mapAccumL(f, n, reverse(
+      tail(fibUntil(n))
+    ))[1]).join(''));
+}
+
+// fibUntil :: Int -> [Int]
+let fibUntil = n => {
+  const xs = [];
+  until(
+      ([a]) => a > n,
+      ([a, b]) => (xs.push(a), [b, a + b]), [1, 1]
+  );
+  return xs;
+};
+
+let mapAccumL = (f, acc, xs) => (
+  xs.reduce((a, x) => {
+    const pair = f(a[0], x);
+
+    return [pair[0], a[1].concat(pair[1])];
+  }, [acc, []])
+);
+
+let until = (p, f, x) => {
+  let v = x;
+  while (!p(v)) v = f(v);
+  return v;
+};
+
+const tail = xs => (
+   xs.length ? xs.slice(1) : undefined
+);
+
+const reverse = xs => xs.slice(0).reverse();
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
new file mode 100644
index 0000000000..64d4e8b5d4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -0,0 +1,321 @@
+---
+id: 594810f028c0303b75339ad7
+title: Zhang-Suen thinning algorithm
+challengeType: 5
+forumTopicId: 302347
+dashedName: zhang-suen-thinning-algorithm
+---
+
+# --description--
+
+This is an algorithm used to thin a black and white i.e. one bit per pixel images. For example, with an input image of:
+
+<!-- TODO write fully in markdown>
+<!-- markdownlint-disable -->
+
+<pre>
+ #################                   #############
+ ##################               ################
+ ###################            ##################
+ ########     #######          ###################
+   ######     #######         #######       ######
+   ######     #######        #######
+   #################         #######
+   ################          #######
+   #################         #######
+   ######     #######        #######
+   ######     #######        #######
+   ######     #######         #######       ######
+ ########     #######          ###################
+ ########     ####### ######    ################## ######
+ ########     ####### ######      ################ ######
+ ########     ####### ######         ############# ######
+</pre>
+
+It produces the thinned output:
+
+<pre>
+
+    # ##########                       #######
+     ##        #                   ####       #
+     #          #                 ##
+     #          #                #
+     #          #                #
+     #          #                #
+     ############               #
+     #          #               #
+     #          #                #
+     #          #                #
+     #          #                #
+     #                            ##
+     #                             ############
+                       ###                          ###
+
+</pre>
+
+<h2>Algorithm</h2>
+
+Assume black pixels are one and white pixels zero, and that the input image is a rectangular N by M array of ones and zeroes. The algorithm operates on all black pixels P1 that can have eight neighbours. The neighbours are, in order, arranged as:
+
+<table border="3">
+  <tr><td style="text-align: center;">P9</td><td style="text-align: center;">P2</td><td style="text-align: center;">P3</td></tr>
+  <tr><td style="text-align: center;">P8</td><td style="text-align: center;"><strong>P1</strong></td><td style="text-align: center;">P4</td></tr>
+  <tr><td style="text-align: center;">P7</td><td style="text-align: center;">P6</td><td style="text-align: center;">P5</td></tr>
+</table>
+
+Obviously the boundary pixels of the image cannot have the full eight neighbours.
+
+<ul>
+  <li>Define $A(P1)$ = the number of transitions from white to black, (0 -> 1) in the sequence P2, P3, P4, P5, P6, P7, P8, P9, P2. (Note the extra P2 at the end - it is circular).</li>
+  <li>Define $B(P1)$ = the number of black pixel neighbours of P1. ( = sum(P2 .. P9) )</li>
+</ul>
+
+**Step 1:**
+
+All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
+
+  <ol>
+    <li>The pixel is black and has eight neighbours</li>
+    <li>$2 <= B(P1) <= 6$</li>
+    <li>$A(P1) = 1$</li>
+    <li>At least one of <strong>P2, P4 and P6</strong> is white</li>
+    <li>At least one of <strong>P4, P6 and P8</strong> is white</li>
+  </ol>
+
+After iterating over the image and collecting all the pixels satisfying all step 1 conditions, all these condition satisfying pixels are set to white.
+
+**Step 2:**
+
+All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
+
+  <ol>
+    <li>The pixel is black and has eight neighbours</li>
+    <li>$2 <= B(P1) <= 6$</li>
+    <li>$A(P1) = 1$</li>
+    <li>At least one of <strong>P2, P4 and P8</strong> is white</li>
+    <li>At least one of <strong>P2, P6 and P8</strong> is white</li>
+  </ol>
+  
+After iterating over the image and collecting all the pixels satisfying all step 2 conditions, all these condition satisfying pixels are again set to white.
+
+**Iteration:**
+
+If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.
+
+# --instructions--
+
+Write a routine to perform Zhang-Suen thinning on the provided image matrix.
+
+# --hints--
+
+`thinImage` should be a function.
+
+```js
+assert.equal(typeof thinImage, 'function');
+```
+
+`thinImage` should return an array.
+
+```js
+assert(Array.isArray(result));
+```
+
+`thinImage` should return an array of strings.
+
+```js
+assert.equal(typeof result[0], 'string');
+```
+
+`thinImage` should return an array of strings.
+
+```js
+assert.deepEqual(result, expected);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const imageForTests = [
+  '                                                          ',
+  ' #################                   #############        ',
+  ' ##################               ################        ',
+  ' ###################            ##################        ',
+  ' ########     #######          ###################        ',
+  '   ######     #######         #######       ######        ',
+  '   ######     #######        #######                      ',
+  '   #################         #######                      ',
+  '   ################          #######                      ',
+  '   #################         #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######         #######       ######        ',
+  ' ########     #######          ###################        ',
+  ' ########     ####### ######    ################## ###### ',
+  ' ########     ####### ######      ################ ###### ',
+  ' ########     ####### ######         ############# ###### ',
+  '                                                          '];
+const expected = [
+  '                                                          ',
+  '                                                          ',
+  '    # ##########                       #######            ',
+  '     ##        #                   ####       #           ',
+  '     #          #                 ##                      ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     ############               #                         ',
+  '     #          #               #                         ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #                            ##                      ',
+  '     #                             ############           ',
+  '                       ###                          ###   ',
+  '                                                          ',
+  '                                                          '
+];
+const result = thinImage(imageForTests);
+```
+
+## --seed-contents--
+
+```js
+const testImage = [
+  '                                                          ',
+  ' #################                   #############        ',
+  ' ##################               ################        ',
+  ' ###################            ##################        ',
+  ' ########     #######          ###################        ',
+  '   ######     #######         #######       ######        ',
+  '   ######     #######        #######                      ',
+  '   #################         #######                      ',
+  '   ################          #######                      ',
+  '   #################         #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######         #######       ######        ',
+  ' ########     #######          ###################        ',
+  ' ########     ####### ######    ################## ###### ',
+  ' ########     ####### ######      ################ ###### ',
+  ' ########     ####### ######         ############# ###### ',
+  '                                                          '];
+
+function thinImage(image) {
+
+}
+```
+
+# --solutions--
+
+```js
+function Point(x, y) {
+  this.x = x;
+  this.y = y;
+}
+
+const ZhangSuen = (function () {
+  function ZhangSuen() {
+  }
+
+  ZhangSuen.nbrs = [[0, -1], [1, -1], [1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1]];
+
+  ZhangSuen.nbrGroups = [[[0, 2, 4], [2, 4, 6]], [[0, 2, 6], [0, 4, 6]]];
+
+  ZhangSuen.toWhite = [];
+
+  ZhangSuen.main = function (image) {
+    ZhangSuen.grid = new Array(image);
+    for (let r = 0; r < image.length; r++) {
+      ZhangSuen.grid[r] = image[r].split('');
+    }
+    ZhangSuen.thinImage();
+    return ZhangSuen.getResult();
+  };
+
+  ZhangSuen.thinImage = function () {
+    let firstStep = false;
+    let hasChanged;
+    do {
+      hasChanged = false;
+      firstStep = !firstStep;
+      for (let r = 1; r < ZhangSuen.grid.length - 1; r++) {
+        for (let c = 1; c < ZhangSuen.grid[0].length - 1; c++) {
+          if (ZhangSuen.grid[r][c] !== '#') {
+            continue;
+          }
+          const nn = ZhangSuen.numNeighbors(r, c);
+          if (nn < 2 || nn > 6) {
+            continue;
+          }
+          if (ZhangSuen.numTransitions(r, c) !== 1) {
+            continue;
+          }
+          if (!ZhangSuen.atLeastOneIsWhite(r, c, firstStep ? 0 : 1)) {
+            continue;
+          }
+          ZhangSuen.toWhite.push(new Point(c, r));
+          hasChanged = true;
+        }
+      }
+      for (let i = 0; i < ZhangSuen.toWhite.length; i++) {
+        const p = ZhangSuen.toWhite[i];
+        ZhangSuen.grid[p.y][p.x] = ' ';
+      }
+      ZhangSuen.toWhite = [];
+    } while ((firstStep || hasChanged));
+  };
+
+  ZhangSuen.numNeighbors = function (r, c) {
+    let count = 0;
+    for (let i = 0; i < ZhangSuen.nbrs.length - 1; i++) {
+      if (ZhangSuen.grid[r + ZhangSuen.nbrs[i][1]][c + ZhangSuen.nbrs[i][0]] === '#') {
+        count++;
+      }
+    }
+    return count;
+  };
+
+  ZhangSuen.numTransitions = function (r, c) {
+    let count = 0;
+    for (let i = 0; i < ZhangSuen.nbrs.length - 1; i++) {
+      if (ZhangSuen.grid[r + ZhangSuen.nbrs[i][1]][c + ZhangSuen.nbrs[i][0]] === ' ') {
+        if (ZhangSuen.grid[r + ZhangSuen.nbrs[i + 1][1]][c + ZhangSuen.nbrs[i + 1][0]] === '#') {
+          count++;
+        }
+      }
+    }
+    return count;
+  };
+
+  ZhangSuen.atLeastOneIsWhite = function (r, c, step) {
+    let count = 0;
+    const group = ZhangSuen.nbrGroups[step];
+    for (let i = 0; i < 2; i++) {
+      for (let j = 0; j < group[i].length; j++) {
+        const nbr = ZhangSuen.nbrs[group[i][j]];
+        if (ZhangSuen.grid[r + nbr[1]][c + nbr[0]] === ' ') {
+          count++;
+          break;
+        }
+      }
+    }
+    return count > 1;
+  };
+
+  ZhangSuen.getResult = function () {
+    const result = [];
+    for (let i = 0; i < ZhangSuen.grid.length; i++) {
+      const row = ZhangSuen.grid[i].join('');
+      result.push(row);
+    }
+    return result;
+  };
+  return ZhangSuen;
+}());
+
+function thinImage(image) {
+  return ZhangSuen.main(image);
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
new file mode 100644
index 0000000000..4f5277c28a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -0,0 +1,117 @@
+---
+id: 594810f028c0303b75339ad8
+title: Zig-zag matrix
+challengeType: 5
+forumTopicId: 302348
+dashedName: zig-zag-matrix
+---
+
+# --description--
+
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's [anti-diagonals](https://en.wiktionary.org/wiki/antidiagonal).
+
+For example, for the input `5`, the following result should be produced:
+
+<pre>
+ 0  1  5  6 14
+ 2  4  7 13 15
+ 3  8 12 16 21
+ 9 11 17 20 22
+10 18 19 23 24
+</pre>
+
+# --instructions--
+
+Write a function that takes the size of the zig-zag matrix, and returns the corresponding matrix as two-dimensional array.
+
+# --hints--
+
+ZigZagMatrix should be a function.
+
+```js
+assert.equal(typeof ZigZagMatrix, 'function');
+```
+
+ZigZagMatrix should return array.
+
+```js
+assert.equal(typeof ZigZagMatrix(1), 'object');
+```
+
+ZigZagMatrix should return an array of nested arrays.
+
+```js
+assert.equal(typeof ZigZagMatrix(1)[0], 'object');
+```
+
+ZigZagMatrix(1) should return \[[0]].
+
+```js
+assert.deepEqual(ZigZagMatrix(1), zm1);
+```
+
+ZigZagMatrix(2) should return \[[0, 1], [2, 3]].
+
+```js
+assert.deepEqual(ZigZagMatrix(2), zm2);
+```
+
+ZigZagMatrix(5) should return specified matrix.
+
+```js
+assert.deepEqual(ZigZagMatrix(5), zm5);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const zm1 = [[0]];
+const zm2 = [[0, 1], [2, 3]];
+const zm5 = [
+  [0, 1, 5, 6, 14],
+  [2, 4, 7, 13, 15],
+  [3, 8, 12, 16, 21],
+  [9, 11, 17, 20, 22],
+  [10, 18, 19, 23, 24]
+];
+```
+
+## --seed-contents--
+
+```js
+function ZigZagMatrix(n) {
+
+  return [[], []];
+}
+```
+
+# --solutions--
+
+```js
+function ZigZagMatrix(n) {
+  const mtx = [];
+  for (let i = 0; i < n; i++) {
+    mtx[i] = [];
+  }
+
+  let i = 1;
+  let j = 1;
+  for (let e = 0; e < n * n; e++) {
+    mtx[i - 1][j - 1] = e;
+    if ((i + j) % 2 === 0) {
+      // Even stripes
+      if (j < n) j++;
+      else i += 2;
+      if (i > 1) i--;
+    } else {
+      // Odd stripes
+      if (i < n) i++;
+      else j += 2;
+      if (j > 1) j--;
+    }
+  }
+  return mtx;
+}
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
new file mode 100644
index 0000000000..35f9887785
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -0,0 +1,31 @@
+---
+id: bd7156d8c242eddfaeb5bd13
+title: Build a freeCodeCamp Forum Homepage
+challengeType: 3
+forumTopicId: 302349
+dashedName: build-a-freecodecamp-forum-homepage
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
+
+**User Story:** For each topic, I can see the title and a list of links to users who have recently posted in it.
+
+**User Story:** I can see the number of replies and views that each topic has had, and a timestamp of when the topic was last active.
+
+**Hint:** To get the 30 most recent forum posts: <https://forum-proxy.freecodecamp.rocks/latest>.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
new file mode 100644
index 0000000000..5cf03cdd2a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -0,0 +1,37 @@
+---
+id: 5a5d02bd919fcf9ca8cf46cb
+title: Build a Light-Bright App
+challengeType: 3
+forumTopicId: 302350
+dashedName: build-a-light-bright-app
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can click or drag the mouse cursor to color the circles.
+
+**User Story:** I can double-click on a colored circle to remove the color.
+
+**User Story:** I can click on a colored circle to change its color.
+
+**User Story:** I should get a circle of different color on each click.
+
+**User Story:** I can click on the 'Reset' button to remove the recent color.
+
+**User Story:** I can click on the 'Reset All' button to remove all the colors from the circles.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
new file mode 100644
index 0000000000..5d39e057a6
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -0,0 +1,31 @@
+---
+id: bd7158d8c443eddfaeb5bdff
+title: Build a Nightlife Coordination App
+challengeType: 4
+forumTopicId: 302351
+dashedName: build-a-nightlife-coordination-app
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://yoyo44.herokuapp.com/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** As an unauthenticated user, you can view all bars in my area.
+
+**User Story:** As an authenticated user, you can add myself to a bar to indicate you am going there tonight.
+
+**User Story:** As an authenticated user, you can remove myself from a bar if you no longer want to go there.
+
+**User Story:** As an unauthenticated user, when you login you should not have to search again.
+
+**Hint:** Try using the [Yelp API](https://www.yelp.com/developers/documentation/v3) to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
new file mode 100644
index 0000000000..bd190875b3
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -0,0 +1,37 @@
+---
+id: bd7158d8c443eddfaeb5bdee
+title: Build a Pinterest Clone
+challengeType: 4
+forumTopicId: 302352
+dashedName: build-a-pinterest-clone
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** As an unauthenticated user, I can login with GitHub.
+
+**User Story:** As an authenticated user, I can link to images.
+
+**User Story:** As an authenticated user, I can delete images that I've linked to.
+
+**User Story:** As an authenticated user, I can see a Pinterest-style wall of all the images I've linked to.
+
+**User Story:** As an unauthenticated user, I can browse other users' walls of images.
+
+**User Story:** 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)
+
+**Hint:** [Masonry.js](https://masonry.desandro.com/) is a library that allows for Pinterest-style image grids.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
new file mode 100644
index 0000000000..cfa0cc598b
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -0,0 +1,33 @@
+---
+id: 5a4b7fcdb66f799f199e11db
+title: Build a Pong Game
+challengeType: 3
+forumTopicId: 302353
+dashedName: build-a-pong-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can control a paddle.
+
+**User Story:** The computer can control the other paddle.
+
+**User Story:** The computer's paddle is unbeatable. It should never miss the ball.
+
+**User Story:** The game keeps track of the player and computer's score.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
new file mode 100644
index 0000000000..7817e26951
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -0,0 +1,37 @@
+---
+id: bd7155d8c242eddfaeb5bd13
+title: Build a Recipe Box
+challengeType: 3
+forumTopicId: 302354
+dashedName: build-a-recipe-box
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can create recipes that have names and ingredients.
+
+**User Story:** I can see an index view where the names of all the recipes are visible.
+
+**User Story:** I can click into any of those recipes to view it.
+
+**User Story:** I can edit these recipes.
+
+**User Story:** I can delete these recipes.
+
+**User Story:** All new recipes I add are saved in my browser's local storage. If I refresh the page, these recipes will still be there.
+
+**Hint:** You should prefix your local storage keys on CodePen, i.e. `_username_recipes`
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
new file mode 100644
index 0000000000..de57859782
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -0,0 +1,41 @@
+---
+id: bd7153d8c242eddfaeb5bd13
+title: Build a Roguelike Dungeon Crawler Game
+challengeType: 3
+forumTopicId: 302355
+dashedName: build-a-roguelike-dungeon-crawler-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
+
+**User Story:** All the items and enemies on the map are arranged at random.
+
+**User Story:** I can move throughout a map, discovering items.
+
+**User Story:** I can move anywhere within the map's boundaries, but I can't move through an enemy until I've beaten it.
+
+**User Story:** 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.
+
+**User Story:** When I beat an enemy, the enemy goes away and I get XP, which eventually increases my level.
+
+**User Story:** When I fight an enemy, we take turns damaging each other until one of us loses. I do damage based off of my level and my weapon. The enemy does damage based off of its level. Damage is somewhat random within a range.
+
+**User Story:** When I find and beat the boss, I win.
+
+**User Story:** The game should be challenging, but theoretically winnable.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
new file mode 100644
index 0000000000..9de29f1566
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -0,0 +1,41 @@
+---
+id: bd7158d8c442eddfaeb5bd1c
+title: Build a Simon Game
+challengeType: 3
+forumTopicId: 302357
+dashedName: build-a-simon-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: [https://codepen.io/freeCodeCamp/full/obYBjE](https://codepen.io/Em-Ant/full/QbRyqq/).
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I am presented with a random series of button presses.
+
+**User Story:** Each time I input a series of button presses correctly, I see the same series of button presses but with an additional step.
+
+**User Story:** I hear a sound that corresponds to each button both when the series of button presses plays, and when I personally press a button.
+
+**User Story:** 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.
+
+**User Story:** I can see how many steps are in the current series of button presses.
+
+**User Story:** If I want to restart, I can hit a button to do so, and the game will return to a single step.
+
+**User Story:** I can play in strict mode where if I get a button press wrong, it notifies me that I have done so, and the game restarts at a new random series of button presses.
+
+**User Story:** I can win the game by getting a series of 20 steps correct. I am notified of my victory, then the game starts over.
+
+**Hint:** Here are mp3s you can use for each button: `https://s3.amazonaws.com/freecodecamp/simonSound1.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound2.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound3.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound4.mp3`.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
new file mode 100644
index 0000000000..bf79eae711
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -0,0 +1,29 @@
+---
+id: bd7158d8c442eedfaeb5bd1c
+title: Build a Tic Tac Toe Game
+challengeType: 3
+forumTopicId: 302358
+dashedName: build-a-tic-tac-toe-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KzXQgy/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can play a game of Tic Tac Toe with the computer.
+
+**User Story:** My game will reset as soon as it's over so I can play again.
+
+**User Story:** I can choose whether I want to play as X or O.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
new file mode 100644
index 0000000000..3e6e257ce8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -0,0 +1,37 @@
+---
+id: bd7158d8c443eddfaeb5bdef
+title: Build a Voting App
+challengeType: 4
+forumTopicId: 302359
+dashedName: build-a-voting-app
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://voting-app.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** As an authenticated user, you can keep my polls and come back later to access them.
+
+**User Story:** As an authenticated user, you can share my polls with my friends.
+
+**User Story:** As an authenticated user, you can see the aggregate results of my polls.
+
+**User Story:** As an authenticated user, you can delete polls that I decide I don't want anymore.
+
+**User Story:** As an authenticated user, you can create a poll with any number of possible items.
+
+**User Story:** As an unauthenticated or authenticated user, you can see and vote on everyone's polls.
+
+**User Story:** As an unauthenticated or authenticated user, you can see the results of polls in chart form. (This could be implemented using Chart.js or Google Charts.)
+
+**User Story:** As an authenticated user, if you don't like the options on a poll, you can create a new option.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
new file mode 100644
index 0000000000..d4cf3b350f
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -0,0 +1,33 @@
+---
+id: bd7158d8c442eddfaeb5bd19
+title: Build a Wikipedia Viewer
+challengeType: 3
+forumTopicId: 302360
+dashedName: build-a-wikipedia-viewer
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wGqEga/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
+
+**User Story:** I can click a button to see a random Wikipedia entry.
+
+Hint #1: Here's a URL you can use to get a random Wikipedia article: `https://en.wikipedia.org/wiki/Special:Random`.
+
+Hint #2: Here's an entry on using Wikipedia's API: `https://www.mediawiki.org/wiki/API:Main_page`.
+
+Hint #3: Use this [link](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm) to experiment with Wikipedia's API.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
new file mode 100644
index 0000000000..a17732de47
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -0,0 +1,27 @@
+---
+id: bd7158d8c443edefaeb5bdee
+title: Build an Image Search Abstraction Layer
+challengeType: 4
+forumTopicId: 302361
+dashedName: build-an-image-search-abstraction-layer
+---
+
+# --description--
+
+Build a full stack JavaScript app that allows you to search for images like this: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> and browse recent search queries like this: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** You can get the image URLs, description and page URLs for a set of images relating to a given search string.
+
+**User Story:** You can paginate through the responses by adding a `?page=2` parameter to the URL.
+
+**User Story:** You can get a list of the most recently submitted search strings.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
new file mode 100644
index 0000000000..10998f981d
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -0,0 +1,39 @@
+---
+id: bd7154d8c242eddfaeb5bd13
+title: Build the Game of Life
+challengeType: 3
+forumTopicId: 302362
+dashedName: build-the-game-of-life
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/BpwMZv/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
+
+**User Story:** I can start and stop the board.
+
+**User Story:** I can set up the board.
+
+**User Story:** I can clear the board.
+
+**User Story:** When I press start, the game will play out.
+
+**User Story:** Each time the board changes, I can see how many generations have gone by.
+
+**Hint:** Here's an explanation of Conway's Game of Life from John Conway himself: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+
+**Hint:** Here's an overview of Conway's Game of Life with rules for your reference: <https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life>
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
new file mode 100644
index 0000000000..fbae3e461a
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -0,0 +1,29 @@
+---
+id: bd7158d8c443eddfaeb5bd0e
+title: Chart the Stock Market
+challengeType: 4
+forumTopicId: 302363
+dashedName: chart-the-stock-market
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://chart-the-stock-market.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** You can view a graph displaying the recent trend lines for each added stock.
+
+**User Story:** You can add new stocks by their symbol name.
+
+**User Story:** You can remove stocks.
+
+**User Story:** You can see changes in real-time when any other user adds or removes a stock. For this you will need to use Web Sockets.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
new file mode 100644
index 0000000000..5a5420d771
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -0,0 +1,31 @@
+---
+id: bd7158d8c443eddfaeb5bd0f
+title: Manage a Book Trading Club
+challengeType: 4
+forumTopicId: 302364
+dashedName: manage-a-book-trading-club
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can view all books posted by every user.
+
+**User Story:** I can add a new book.
+
+**User Story:** I can update my settings to store my full name, city, and state.
+
+**User Story:** I can propose a trade and wait for the other user to accept the trade.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
new file mode 100644
index 0000000000..aa1dcc3a84
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -0,0 +1,31 @@
+---
+id: bd7108d8c242eddfaeb5bd13
+title: Map Data Across the Globe
+challengeType: 3
+forumTopicId: 302365
+dashedName: map-data-across-the-globe
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
+
+Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see where all Meteorites landed on a world map.
+
+**User Story:** I can tell the relative size of the meteorite, just by looking at the way it's represented on the map.
+
+**User Story:** I can mouse over the meteorite's data point for additional data.
+
+**Hint:** Here's a dataset you can use to build this: <https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json>
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
new file mode 100644
index 0000000000..6070f83ea8
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -0,0 +1,41 @@
+---
+id: bd7150d8c442eddfafb5bd1c
+title: P2P Video Chat Application
+challengeType: 4
+forumTopicId: 302366
+dashedName: p2p-video-chat-application
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://p2p-video-chat-application.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** Upon arriving, the browser will prompt me to access my camera and microphone.
+
+**User Story:** After I give it permission, I am prompted to type in a room name.
+
+**User Story:** Once I type in the room name, a room will be created if no room of that name existed before.
+
+**User Story:** 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.
+
+**User Story:** 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.
+
+**User Story:** Anyone can create or join any room. And there can be any number of rooms, but all of them must have unique names.
+
+**User Story:** I can choose to not permit the site to access my microphone and webcam. If I choose not to do this, or if some other driver problem occurs, I see an error message saying these are required.
+
+**User Story:** 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.
+
+**User Story:** If one of the two people in the room get disconnected, they can reconnect to the same room and continue chatting.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
new file mode 100644
index 0000000000..9e83b937f4
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -0,0 +1,31 @@
+---
+id: bd7198d8c242eddfaeb5bd13
+title: Show National Contiguity with a Force Directed Graph
+challengeType: 3
+forumTopicId: 302367
+dashedName: show-national-contiguity-with-a-force-directed-graph
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+
+Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see a Force-directed Graph that shows which countries share borders.
+
+**User Story:** I can see each country's flag on its node.
+
+**Hint:** Here's a dataset you can use to build this: <https://raw.githubusercontent.com/DealPete/forceDirected/master/countries.json>
+
+**Hint:** You can create a spritesheet of national flags at <https://www.flag-sprites.com>.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
new file mode 100644
index 0000000000..9d470d6b1c
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -0,0 +1,33 @@
+---
+id: bd7158d8c442eddfaeb5bd10
+title: Show the Local Weather
+challengeType: 3
+forumTopicId: 302368
+dashedName: show-the-local-weather
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see the weather in my current location.
+
+**User Story:** I can see a different icon or background image (e.g. snowy mountain, hot desert) depending on the weather.
+
+**User Story:** I can push a button to toggle between Fahrenheit and Celsius.
+
+**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <https://weather-proxy.freecodecamp.rocks/> which uses an HTTP Secure connection for the weather. Also, be sure to connect to [CodePen.io](https://codepen.io) via `https://`.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
new file mode 100644
index 0000000000..55d17b1745
--- /dev/null
+++ b/curriculum/challenges/italian/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -0,0 +1,35 @@
+---
+id: bd7158d8c442eddfaeb5bd1f
+title: Use the Twitch JSON API
+challengeType: 3
+forumTopicId: 19541
+dashedName: use-the-twitch-json-api
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/Myvqmo/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
+
+**User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
+
+**User Story:** if a Twitch user is currently streaming, I can see additional details about what they are streaming.
+
+**Hint:** The relevant documentation about Twitch.tv's JSON API is here: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+
+**Hint:** Here's an array of the Twitch.tv usernames of people who regularly stream: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
+
+**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <https://twitch-proxy.freecodecamp.rocks/> instead of Twitch's API base URL (i.e. `https://api.twitch.tv/helix` ) and you'll still be able to get account information, without needing to sign up for an API key.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
new file mode 100644
index 0000000000..7d7338ee65
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
@@ -0,0 +1,34 @@
+---
+id: 5e9a0e9ef99a403d019610cc
+title: Deep Learning Demystified
+challengeType: 11
+videoId: bejQ-W9BGJg
+dashedName: deep-learning-demystified
+---
+
+# --question--
+
+## --text--
+
+How should you assign weights to input neurons before training your network for the first time?
+
+## --answers--
+
+From smallest to largest.
+
+---
+
+Completely randomly.
+
+---
+
+Alphabetically.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
new file mode 100644
index 0000000000..b06b2fbed8
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610cd
+title: How Convolutional Neural Networks work
+challengeType: 11
+videoId: Y5M7KH4A4n4
+dashedName: how-convolutional-neural-networks-work
+---
+
+# --question--
+
+## --text--
+
+When are Convolutional Neural Networks not useful?
+
+## --answers--
+
+If your data can't be made to look like an image, or if you can rearrange elements of your data and it's still just as useful.
+
+---
+
+If your data is made up of different 2D or 3D images.
+
+---
+
+If your data is text or sound based.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
new file mode 100644
index 0000000000..ae41c9be52
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610ca
+title: How Deep Neural Networks Work
+challengeType: 11
+videoId: zvalnHWGtx4
+dashedName: how-deep-neural-networks-work
+---
+
+# --question--
+
+## --text--
+
+Why is it better to calculate the gradient (slope) directly rather than numerically?
+
+## --answers--
+
+It is computationally expensive to go back through the entire neural network and adjust the weights for each layer of the neural network.
+
+---
+
+It is more accurate.
+
+---
+
+There is no difference between the two methods.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
new file mode 100644
index 0000000000..ab702e9b66
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610cb
+title: Recurrent Neural Networks RNN and Long Short Term Memory LSTM
+challengeType: 11
+videoId: UVimlsy9eW0
+dashedName: recurrent-neural-networks-rnn-and-long-short-term-memory-lstm
+---
+
+# --question--
+
+## --text--
+
+What are the main neural network components that make up a Long Short Term Memory network?
+
+## --answers--
+
+New information and prediction.
+
+---
+
+Prediction, collected possibilities, and selection.
+
+---
+
+Prediction, ignoring, forgetting, and selection.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
new file mode 100644
index 0000000000..b61ec6d5d1
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -0,0 +1,35 @@
+---
+id: 5e46f8e3ac417301a38fb92f
+title: Book Recommendation Engine using KNN
+challengeType: 10
+forumTopicId: 462378
+dashedName: book-recommendation-engine-using-knn
+---
+
+# --description--
+
+In this challenge, you will create a book recommendation algorithm using K-Nearest Neighbors.
+
+You will use the Book-Crossings dataset. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
new file mode 100644
index 0000000000..07288906ad
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8dcac417301a38fb92e
+title: Cat and Dog Image Classifier
+challengeType: 10
+forumTopicId: 462377
+dashedName: cat-and-dog-image-classifier
+---
+
+# --description--
+
+For this challenge, you will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs with at least 63% accuracy.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
new file mode 100644
index 0000000000..56b993d65c
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -0,0 +1,35 @@
+---
+id: 5e46f8edac417301a38fb930
+title: Linear Regression Health Costs Calculator
+challengeType: 10
+forumTopicId: 462379
+dashedName: linear-regression-health-costs-calculator
+---
+
+# --description--
+
+In this challenge, you will predict healthcare costs using a regression algorithm.
+
+You are given a dataset that contains information about different people including their healthcare costs. Use the data to predict healthcare costs based on new data.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
new file mode 100644
index 0000000000..c5919ba470
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8edac417301a38fb931
+title: Neural Network SMS Text Classifier
+challengeType: 10
+forumTopicId: 462380
+dashedName: neural-network-sms-text-classifier
+---
+
+# --description--
+
+In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
new file mode 100644
index 0000000000..d2d0410e52
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8d6ac417301a38fb92d
+title: Rock Paper Scissors
+challengeType: 10
+forumTopicId: 462376
+dashedName: rock-paper-scissors
+---
+
+# --description--
+
+For this challenge, you will create a program to play Rock, Paper, Scissors. A program that picks at random will usually win 50% of the time. To pass this challenge your program must play matches against four different bots, winning at least 60% of the games in each match.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the machine learning curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/conclusion.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/conclusion.md
new file mode 100644
index 0000000000..b87ca8022b
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/conclusion.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da6
+title: Conclusion
+challengeType: 11
+videoId: LMNub5frQi4
+dashedName: conclusion
+---
+
+# --question--
+
+## --text--
+
+Most people that are experts in AI or machine learning usually...:
+
+## --answers--
+
+have one specialization.
+
+---
+
+have many specializations.
+
+---
+
+have a deep understanding of many different frameworks.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
new file mode 100644
index 0000000000..71a466e2b5
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d99
+title: 'Convolutional Neural Networks: Evaluating the Model'
+challengeType: 11
+videoId: eCATNvwraXg
+dashedName: convolutional-neural-networks-evaluating-the-model
+---
+
+# --question--
+
+## --text--
+
+What is **not** a good way to increase the accuracy of a convolutional neural network?
+
+## --answers--
+
+Augmenting the data you already have.
+
+---
+
+Using a pre-trained model.
+
+---
+
+Using your test data to retrain the model.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
new file mode 100644
index 0000000000..9d34c0b25a
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
@@ -0,0 +1,49 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9a
+title: 'Convolutional Neural Networks: Picking a Pretrained Model'
+challengeType: 11
+videoId: h1XUt1AgIOI
+dashedName: convolutional-neural-networks-picking-a-pretrained-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to use Google's pre-trained MobileNet V2 model as a base for a convolutional neural network:
+
+```py
+base_model = tf.__A__.applications.__B__(input_shape=(160, 160, 3),
+                                               include_top=__C__,
+                                               weights='imagenet'
+                                               )
+```
+
+## --answers--
+
+A: `keras`
+
+B: `MobileNetV2`
+
+C: `False`
+
+---
+
+A: `Keras`
+
+B: `MobileNetV2`
+
+C: `True`
+
+---
+
+A: `keras`
+
+B: `mobile_net_v2`
+
+C: `False`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
new file mode 100644
index 0000000000..87c0b9ef9b
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d97
+title: 'Convolutional Neural Networks: The Convolutional Layer'
+challengeType: 11
+videoId: LrdmcQpTyLw
+dashedName: convolutional-neural-networks-the-convolutional-layer
+---
+
+# --question--
+
+## --text--
+
+What are the three main properties of each convolutional layer?
+
+## --answers--
+
+Input size, the number of filters, and the sample size of the filters.
+
+---
+
+Input size, input dimensions, and the color values of the input.
+
+---
+
+Input size, input padding, and stride.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
new file mode 100644
index 0000000000..616ef13476
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d96
+title: Convolutional Neural Networks
+challengeType: 11
+videoId: _1kTP7uoU9E
+dashedName: convolutional-neural-networks
+---
+
+# --question--
+
+## --text--
+
+Dense neural networks analyze input on a global scale and recognize patterns in specific areas. Convolutional neural networks...:
+
+## --answers--
+
+also analyze input globally and extract features from specific areas.
+
+---
+
+do not work well for image classification or object detection.
+
+---
+
+scan through the entire input a little at a time and learn local patterns.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
new file mode 100644
index 0000000000..4b792df4cd
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8e
+title: 'Core Learning Algorithms: Building the Model'
+challengeType: 11
+videoId: 5wHw8BTd2ZQ
+dashedName: core-learning-algorithms-building-the-model
+---
+
+# --question--
+
+## --text--
+
+What kind of estimator/model does TensorFlow recommend using for classification?
+
+## --answers--
+
+`LinearClassifier`
+
+---
+
+`DNNClassifier`
+
+---
+
+`BoostedTreesClassifier`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
new file mode 100644
index 0000000000..245cf7febe
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8d
+title: 'Core Learning Algorithms: Classification'
+challengeType: 11
+videoId: qFF7ZQNvK9E
+dashedName: core-learning-algorithms-classification
+---
+
+# --question--
+
+## --text--
+
+What is classification?
+
+## --answers--
+
+The process of separating data points into different classes.
+
+---
+
+Predicting a numeric value or forecast based on independent and dependent variables.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
new file mode 100644
index 0000000000..0f8065dedc
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
@@ -0,0 +1,38 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8f
+title: 'Core Learning Algorithms: Clustering'
+challengeType: 11
+videoId: 8sqIaHc9Cz4
+dashedName: core-learning-algorithms-clustering
+---
+
+# --question--
+
+## --text--
+
+Which of the following steps is **not** part of the K-Means algorithm?
+
+## --answers--
+
+Randomly pick K points to place K centeroids.
+
+---
+
+Assign each K point to the closest K centeroid.
+
+---
+
+Move each K centeroid into the middle of all of their data points.
+
+---
+
+Shuffle the K points so they're redistributed randomly.
+
+---
+
+Reassign each K point to the closest K centeroid.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
new file mode 100644
index 0000000000..b829085f33
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d90
+title: 'Core Learning Algorithms: Hidden Markov Models'
+challengeType: 11
+videoId: IZg24y4wEPY
+dashedName: core-learning-algorithms-hidden-markov-models
+---
+
+# --question--
+
+## --text--
+
+What makes a Hidden Markov model different than linear regression or classification?
+
+## --answers--
+
+It uses probability distributions to predict future events or states.
+
+---
+
+It analyzes the relationship between independent and dependent variables to make predictions.
+
+---
+
+It separates data points into separate categories.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
new file mode 100644
index 0000000000..29ca4b4896
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8c
+title: 'Core Learning Algorithms: The Training Process'
+challengeType: 11
+videoId: _cEwvqVoBhI
+dashedName: core-learning-algorithms-the-training-process
+---
+
+# --question--
+
+## --text--
+
+What are epochs?
+
+## --answers--
+
+The number of times the model will see the same data.
+
+---
+
+A type of graph.
+
+---
+
+The number of elements you feed to the model at once.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
new file mode 100644
index 0000000000..d31d7425eb
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8b
+title: 'Core Learning Algorithms: Training and Testing Data'
+challengeType: 11
+videoId: wz9J1slsi7I
+dashedName: core-learning-algorithms-training-and-testing-data
+---
+
+# --question--
+
+## --text--
+
+What is categorical data?
+
+## --answers--
+
+Another term for one-hot encoding.
+
+---
+
+Any data that is not numeric.
+
+---
+
+Any data that is represented numerically.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
new file mode 100644
index 0000000000..2f77b3c6ea
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d91
+title: 'Core Learning Algorithms: Using Probabilities to make Predictions'
+challengeType: 11
+videoId: fYAYvLUawnc
+dashedName: core-learning-algorithms-using-probabilities-to-make-predictions
+---
+
+# --question--
+
+## --text--
+
+What TensorFlow module should you import to implement `.HiddenMarkovModel()`?
+
+## --answers--
+
+`tensorflow.keras`
+
+---
+
+`tensorflow_gpu`
+
+---
+
+`tensorflow_probability`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
new file mode 100644
index 0000000000..bd2c0c44f1
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8a
+title: 'Core Learning Algorithms: Working with Data'
+challengeType: 11
+videoId: u85IOSsJsPI
+dashedName: core-learning-algorithms-working-with-data
+---
+
+# --question--
+
+## --text--
+
+What does the pandas `.head()` function do?
+
+## --answers--
+
+Returns the number of entries in a data frame.
+
+---
+
+Returns the number of columns in a data frame.
+
+---
+
+By default, shows the first five rows or entries in a data frame.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
new file mode 100644
index 0000000000..470a5db663
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
@@ -0,0 +1,36 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d89
+title: Core Learning Algorithms
+challengeType: 11
+videoId: u5lZURgcWnU
+dashedName: core-learning-algorithms
+---
+
+# --question--
+
+## --text--
+
+Which type of analysis would be best suited for the following problem?:
+
+You have the average temperature in the month of March for the last 100 years. Using this data, you want to predict the average temperature in the month of March 5 years from now.
+
+## --answers--
+
+Multiple regression
+
+---
+
+Correlation
+
+---
+
+Decision tree
+
+---
+
+Linear regression
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
new file mode 100644
index 0000000000..68999197b2
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
@@ -0,0 +1,52 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d98
+title: Creating a Convolutional Neural Network
+challengeType: 11
+videoId: kfv0K8MtkIc
+dashedName: creating-a-convolutional-neural-network
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to complete the architecture for a convolutional neural network:
+
+```py
+model = models.__A__()
+model.add(layers.__B__(32, (3, 3), activation='relu', input_shape=(32, 32, 3)))
+model.add(layers.__C__(2, 2))
+model.add(layers.__B__(64, (3, 3), activation='relu'))
+model.add(layers.__C__(2, 2))
+model.add(layers.__B__(32, (3, 3), activation='relu'))
+model.add(layers.__C__(2, 2))
+```
+
+## --answers--
+
+A: `Sequential`
+
+B: `add`
+
+C: `Wrapper`
+
+---
+
+A: `keras`
+
+B: `Cropping2D`
+
+C: `AlphaDropout`
+
+---
+
+A: `Sequential`
+
+B: `Conv2D`
+
+C: `MaxPooling2D`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
new file mode 100644
index 0000000000..185278bb1e
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d87
+title: 'Introduction: Machine Learning Fundamentals'
+challengeType: 11
+videoId: KwL1qTR5MT8
+dashedName: introduction-machine-learning-fundamentals
+---
+
+# --question--
+
+## --text--
+
+Which statement below is **false**?
+
+## --answers--
+
+Neural networks are modeled after the way the human brain works.
+
+---
+
+Computer programs that play tic-tac-toe or chess against human players are examples of simple artificial intelligence.
+
+---
+
+Machine learning is a subset of artificial intelligence.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
new file mode 100644
index 0000000000..cefca2bfe2
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
@@ -0,0 +1,38 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d88
+title: Introduction to TensorFlow
+challengeType: 11
+videoId: r9hRyGGjOgQ
+dashedName: introduction-to-tensorflow
+---
+
+# --question--
+
+## --text--
+
+Which of the following is **not** a type of tensor?
+
+## --answers--
+
+Variable
+
+---
+
+Flowing
+
+---
+
+Placeholder
+
+---
+
+SparseTensor
+
+---
+
+Constant
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
new file mode 100644
index 0000000000..7b7546ba33
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
@@ -0,0 +1,62 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da1
+title: 'Natural Language Processing With RNNs: Building the Model'
+challengeType: 11
+videoId: 32WBFS7lfsw
+dashedName: natural-language-processing-with-rnns-building-the-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to complete the `build_model` function:
+
+```py
+def build_mode(vocab_size, embedding_dim, rnn_units, batch_size):
+    model = tf.keras.Sequential([
+        tf.keras.layers.Embedding(vocab_size,
+                                  embedding_dim,
+                                  batch_input_shape=[batch_size, None]),
+        tf.keras.layers.__A__(rnn_units,
+                              return_sequences=__B__,
+                              recurrent_initializer='glorot_uniform),
+        tf.keras.layers.Dense(__C__)
+    ])
+    __D__
+```
+
+## --answers--
+
+A: `ELU`
+
+B: `True`
+
+C: `vocab_size`
+
+D: `return model`
+
+---
+
+A: `LSTM`
+
+B: `False`
+
+C: `batch_size`
+
+D: `return model`
+
+---
+
+A: `LSTM`
+
+B: `True`
+
+C: `vocab_size`
+
+D: `return model`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
new file mode 100644
index 0000000000..f3a22f813d
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
@@ -0,0 +1,40 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da0
+title: 'Natural Language Processing With RNNs: Create a Play Generator'
+challengeType: 11
+videoId: j5xsxjq_Xk8
+dashedName: natural-language-processing-with-rnns-create-a-play-generator
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to create the training examples for the RNN:
+
+```py
+char_dataset = tf.data.__A__.__B__(text_as_int)
+```
+
+## --answers--
+
+A: `Dataset`
+
+B: `from_tensor_slices`
+
+---
+
+A: `data`
+
+B: `from_tensors`
+
+---
+
+A: `DataSet`
+
+B: `from_generator`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
new file mode 100644
index 0000000000..29dbc05f8d
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9f
+title: 'Natural Language Processing With RNNs: Making Predictions'
+challengeType: 11
+videoId: WO1hINnBj20
+dashedName: natural-language-processing-with-rnns-making-predictions
+---
+
+# --question--
+
+## --text--
+
+Before you make a prediction with your own review, you should...:
+
+## --answers--
+
+decode the training dataset and compare the results to the test data.
+
+---
+
+use the encodings from the training dataset to encode your review.
+
+---
+
+assign random values between 0 and the maximum number of vocabulary in your dataset to each word in your review.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
new file mode 100644
index 0000000000..c572d154e1
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9c
+title: 'Natural Language Processing With RNNs: Part 2'
+challengeType: 11
+videoId: mUU9YXOFbZg
+dashedName: natural-language-processing-with-rnns-part-2
+---
+
+# --question--
+
+## --text--
+
+Word embeddings are...:
+
+## --answers--
+
+an unordered group of encoded words that describes the frequency of words in a given document.
+
+---
+
+a group of encoded words that preserves the original order of the words in a given document.
+
+---
+
+a vectorized representation of words in a given document that places words with similar meanings near each other.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
new file mode 100644
index 0000000000..e3d8d7e263
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
@@ -0,0 +1,34 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9d
+title: 'Natural Language Processing With RNNs: Recurring Neural Networks'
+challengeType: 11
+videoId: bX5681NPOcA
+dashedName: natural-language-processing-with-rnns-recurring-neural-networks
+---
+
+# --question--
+
+## --text--
+
+What is true about Recurrent Neural Networks?
+
+## --answers--
+
+1: They are a type of feed-forward neural network.
+
+---
+
+2: They maintain an internal memory/state of the input that was already processed.
+
+---
+
+3: RNN's contain a loop and process one piece of input at a time.
+
+---
+
+4: Both 2 and 3.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
new file mode 100644
index 0000000000..60118b25c8
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
@@ -0,0 +1,50 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9e
+title: 'Natural Language Processing With RNNs: Sentiment Analysis'
+challengeType: 11
+videoId: lYeLtu8Nq7c
+dashedName: natural-language-processing-with-rnns-sentiment-analysis
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to create the model for the RNN:
+
+```py
+model = __A__.keras.Sequential([
+    __A__.keras.layers.__B__(88584, 32),
+    __A__.keras.layers.__C__(32),
+    __A__.keras.layers.DENSE(1, activation='sigmoid')
+])
+```
+
+## --answers--
+
+A: `tensor_flow`
+
+B: `embedding`
+
+C: `LSTM`
+
+---
+
+A: `tf`
+
+B: `Embedding`
+
+C: `AlphaDropout`
+
+---
+
+A: `tf`
+
+B: `Embedding`
+
+C: `LSTM`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
new file mode 100644
index 0000000000..2ae0cab5b7
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
@@ -0,0 +1,54 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da2
+title: 'Natural Language Processing With RNNs: Training the Model'
+challengeType: 11
+videoId: hEUiK7j9UI8
+dashedName: natural-language-processing-with-rnns-training-the-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to save your model's checkpoints in the `./checkpoints` directory and call the latest checkpoint for training:
+
+```py
+checkpoint_dir = __A__
+checkpoint_prefix = os.path.join(checkpoint_dir, 'ckpt_{epoch}')
+
+checkpoint_callback = tf.keras.callbacks.__B__(
+    filepath=checkpoint_prefix,
+    save_weights_only=True
+)
+
+history = model.fit(data, epochs=2, callbacks=[__C__])
+```
+
+## --answers--
+
+A: `'./training_checkpoints'`
+
+B: `ModelCheckpoint`
+
+C: `checkpoint_prefix`
+
+---
+
+A: `'./checkpoints'`
+
+B: `ModelCheckpoint`
+
+C: `checkpoint_callback`
+
+---
+
+A: `'./checkpoints'`
+
+B: `BaseLogger`
+
+C: `checkpoint_callback`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
new file mode 100644
index 0000000000..f4bde45483
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9b
+title: Natural Language Processing With RNNs
+challengeType: 11
+videoId: ZyCaF5S-lKg
+dashedName: natural-language-processing-with-rnns
+---
+
+# --question--
+
+## --text--
+
+Natural Language Processing is a branch of artificial intelligence that...:
+
+## --answers--
+
+deals with how computers understand and process natural/human languages.
+
+---
+
+translates image data into natural/human languages.
+
+---
+
+is focused on translating computer languages into natural/human languages.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
new file mode 100644
index 0000000000..635e29a35d
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d93
+title: 'Neural Networks: Activation Functions'
+challengeType: 11
+videoId: S45tqW6BqRs
+dashedName: neural-networks-activation-functions
+---
+
+# --question--
+
+## --text--
+
+Which activation function switches values between -1 and 1?
+
+## --answers--
+
+ReLU (Rectified Linear Unit)
+
+---
+
+Tanh (Hyperbolic Tangent)
+
+---
+
+Sigmoid
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
new file mode 100644
index 0000000000..05b3df57e0
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
@@ -0,0 +1,50 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d95
+title: 'Neural Networks: Creating a Model'
+challengeType: 11
+videoId: K8bz1bmOCTw
+dashedName: neural-networks-creating-a-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to build a sequential model of dense layers:
+
+```py
+model = __A__.__B__([
+    __A__.layers.Flatten(input_shape=(28, 28)),
+    __A__.layers.__C__(128, activation='relu'),
+    __A__.layers.__C__(10, activation='softmax')
+])
+```
+
+## --answers--
+
+A: `keras`
+
+B: `Sequential`
+
+C: `Dense`
+
+---
+
+A: `tf`
+
+B: `Sequential`
+
+C: `Categorical`
+
+---
+
+A: `keras`
+
+B: `sequential`
+
+C: `dense`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
new file mode 100644
index 0000000000..216b851ab5
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d94
+title: 'Neural Networks: Optimizers'
+challengeType: 11
+videoId: hdOtRPQe1o4
+dashedName: neural-networks-optimizers
+---
+
+# --question--
+
+## --text--
+
+What is an optimizer function?
+
+## --answers--
+
+A function that increases the accuracy of a model's predictions.
+
+---
+
+A function that implements the gradient descent and backpropagation algorithms for you.
+
+---
+
+A function that reduces the time a model needs to train.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
new file mode 100644
index 0000000000..d9d07b00fc
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d92
+title: Neural Networks with TensorFlow
+challengeType: 11
+videoId: uisdfrNrZW4
+dashedName: neural-networks-with-tensorflow
+---
+
+# --question--
+
+## --text--
+
+A densely connected neural network is one in which...:
+
+## --answers--
+
+all the neurons in the current layer are connected to one neuron in the previous layer.
+
+---
+
+all the neurons in each layer are connected randomly.
+
+---
+
+all the neurons in the current layer are connected to every neuron in the previous layer.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
new file mode 100644
index 0000000000..1b9f6923a9
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
@@ -0,0 +1,46 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da5
+title: 'Reinforcement Learning With Q-Learning: Example'
+challengeType: 11
+videoId: RBBSNta234s
+dashedName: reinforcement-learning-with-q-learning-example
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks to complete the following Q-Learning equation:
+
+```py
+Q[__A__, __B__] = Q[__A__, __B__] + LEARNING_RATE * (reward + GAMMA * np.max(Q[__C__, :]) - Q[__A__, __B__])
+```
+
+## --answers--
+
+A: `state`
+
+B: `action`
+
+C: `next_state`
+
+---
+
+A: `state`
+
+B: `action`
+
+C: `prev_state`
+
+---
+
+A: `state`
+
+B: `reaction`
+
+C: `next_state`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
new file mode 100644
index 0000000000..089f144038
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
@@ -0,0 +1,26 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da4
+title: 'Reinforcement Learning With Q-Learning: Part 2'
+challengeType: 11
+videoId: DX7hJuaUZ7o
+dashedName: reinforcement-learning-with-q-learning-part-2
+---
+
+# --question--
+
+## --text--
+
+What can happen if the agent does not have a good balance of taking random actions and using learned actions?
+
+## --answers--
+
+The agent will always try to minimize its reward for the current state/action, leading to local minima.
+
+---
+
+The agent will always try to maximize its reward for the current state/action, leading to local maxima.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
new file mode 100644
index 0000000000..3cbeedcfb3
--- /dev/null
+++ b/curriculum/challenges/italian/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da3
+title: Reinforcement Learning With Q-Learning
+challengeType: 11
+videoId: Cf7DSU0gVb4
+dashedName: reinforcement-learning-with-q-learning
+---
+
+# --question--
+
+## --text--
+
+The key components of reinforcement learning are...
+
+## --answers--
+
+environment, representative, state, reaction, and reward.
+
+---
+
+environment, agent, state, action, and reward.
+
+---
+
+habitat, agent, state, action, and punishment.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who.md
new file mode 100644
index 0000000000..23b048b60c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who.md
@@ -0,0 +1,97 @@
+---
+id: a77dbc43c33f39daa4429b4f
+title: Boo who
+challengeType: 5
+forumTopicId: 16000
+dashedName: boo-who
+---
+
+# --description--
+
+Check if a value is classified as a boolean primitive. Return `true` or `false`.
+
+Boolean primitives are `true` and `false`.
+
+# --hints--
+
+`booWho(true)` should return `true`.
+
+```js
+assert.strictEqual(booWho(true), true);
+```
+
+`booWho(false)` should return `true`.
+
+```js
+assert.strictEqual(booWho(false), true);
+```
+
+`booWho([1, 2, 3])` should return `false`.
+
+```js
+assert.strictEqual(booWho([1, 2, 3]), false);
+```
+
+`booWho([].slice)` should return `false`.
+
+```js
+assert.strictEqual(booWho([].slice), false);
+```
+
+`booWho({ "a": 1 })` should return `false`.
+
+```js
+assert.strictEqual(booWho({ a: 1 }), false);
+```
+
+`booWho(1)` should return `false`.
+
+```js
+assert.strictEqual(booWho(1), false);
+```
+
+`booWho(NaN)` should return `false`.
+
+```js
+assert.strictEqual(booWho(NaN), false);
+```
+
+`booWho("a")` should return `false`.
+
+```js
+assert.strictEqual(booWho('a'), false);
+```
+
+`booWho("true")` should return `false`.
+
+```js
+assert.strictEqual(booWho('true'), false);
+```
+
+`booWho("false")` should return `false`.
+
+```js
+assert.strictEqual(booWho('false'), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function booWho(bool) {
+  return bool;
+}
+
+booWho(null);
+```
+
+# --solutions--
+
+```js
+function booWho(bool) {
+  return typeof bool === "boolean";
+}
+
+booWho(null);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey.md
new file mode 100644
index 0000000000..9abbde07ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey.md
@@ -0,0 +1,110 @@
+---
+id: a9bd25c716030ec90084d8a1
+title: Chunky Monkey
+challengeType: 5
+forumTopicId: 16005
+dashedName: chunky-monkey
+---
+
+# --description--
+
+Write a function that splits an array (first argument) into groups the length of `size` (second argument) and returns them as a two-dimensional array.
+
+# --hints--
+
+`chunkArrayInGroups(["a", "b", "c", "d"], 2)` should return `[["a", "b"], ["c", "d"]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups(['a', 'b', 'c', 'd'], 2), [
+  ['a', 'b'],
+  ['c', 'd']
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3)` should return `[[0, 1, 2], [3, 4, 5]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3), [
+  [0, 1, 2],
+  [3, 4, 5]
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2)` should return `[[0, 1], [2, 3], [4, 5]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2), [
+  [0, 1],
+  [2, 3],
+  [4, 5]
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4)` should return `[[0, 1, 2, 3], [4, 5]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4), [
+  [0, 1, 2, 3],
+  [4, 5]
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3)` should return `[[0, 1, 2], [3, 4, 5], [6]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3), [
+  [0, 1, 2],
+  [3, 4, 5],
+  [6]
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4)` should return `[[0, 1, 2, 3], [4, 5, 6, 7], [8]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4), [
+  [0, 1, 2, 3],
+  [4, 5, 6, 7],
+  [8]
+]);
+```
+
+`chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2)` should return `[[0, 1], [2, 3], [4, 5], [6, 7], [8]]`.
+
+```js
+assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2), [
+  [0, 1],
+  [2, 3],
+  [4, 5],
+  [6, 7],
+  [8]
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function chunkArrayInGroups(arr, size) {
+  return arr;
+}
+
+chunkArrayInGroups(["a", "b", "c", "d"], 2);
+```
+
+# --solutions--
+
+```js
+function chunkArrayInGroups(arr, size) {
+  let out = [];
+
+  for (let i = 0; i < arr.length; i += size) {
+    out.push(arr.slice(i, i + size));
+  }
+
+  return out;
+}
+
+chunkArrayInGroups(["a", "b", "c", "d"], 2);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending.md
new file mode 100644
index 0000000000..a793811b43
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending.md
@@ -0,0 +1,113 @@
+---
+id: acda2fb1324d9b0fa741e6b5
+title: Confirm the Ending
+challengeType: 5
+forumTopicId: 16006
+dashedName: confirm-the-ending
+---
+
+# --description--
+
+Check if a string (first argument, `str`) ends with the given target string (second argument, `target`).
+
+This challenge *can* be solved with the `.endsWith()` method, which was introduced in ES2015. But for the purpose of this challenge, we would like you to use one of the JavaScript substring methods instead.
+
+# --hints--
+
+`confirmEnding("Bastian", "n")` should return `true`.
+
+```js
+assert(confirmEnding('Bastian', 'n') === true);
+```
+
+`confirmEnding("Congratulation", "on")` should return `true`.
+
+```js
+assert(confirmEnding('Congratulation', 'on') === true);
+```
+
+`confirmEnding("Connor", "n")` should return `false`.
+
+```js
+assert(confirmEnding('Connor', 'n') === false);
+```
+
+`confirmEnding("Walking on water and developing software from a specification are easy if both are frozen", "specification")` should return `false`.
+
+```js
+assert(
+  confirmEnding(
+    'Walking on water and developing software from a specification are easy if both are frozen',
+    'specification'
+  ) === false
+);
+```
+
+`confirmEnding("He has to give me a new name", "name")` should return `true`.
+
+```js
+assert(confirmEnding('He has to give me a new name', 'name') === true);
+```
+
+`confirmEnding("Open sesame", "same")` should return `true`.
+
+```js
+assert(confirmEnding('Open sesame', 'same') === true);
+```
+
+`confirmEnding("Open sesame", "sage")` should return `false`.
+
+```js
+assert(confirmEnding('Open sesame', 'sage') === false);
+```
+
+`confirmEnding("Open sesame", "game")` should return `false`.
+
+```js
+assert(confirmEnding('Open sesame', 'game') === false);
+```
+
+`confirmEnding("If you want to save our world, you must hurry. We dont know how much longer we can withstand the nothing", "mountain")` should return `false`.
+
+```js
+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
+);
+```
+
+`confirmEnding("Abstraction", "action")` should return `true`.
+
+```js
+assert(confirmEnding('Abstraction', 'action') === true);
+```
+
+Your code should not use the built-in method `.endsWith()` to solve the challenge.
+
+```js
+assert(!/\.endsWith\(.*?\)\s*?;?/.test(code) && !/\['endsWith'\]/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function confirmEnding(str, target) {
+  return str;
+}
+
+confirmEnding("Bastian", "n");
+```
+
+# --solutions--
+
+```js
+function confirmEnding(str, target) {
+  return str.substring(str.length - target.length) === target;
+}
+
+confirmEnding("Bastian", "n");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/convert-celsius-to-fahrenheit.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/convert-celsius-to-fahrenheit.md
new file mode 100644
index 0000000000..616f44a987
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/convert-celsius-to-fahrenheit.md
@@ -0,0 +1,76 @@
+---
+id: 56533eb9ac21ba0edf2244b3
+title: Convert Celsius to Fahrenheit
+challengeType: 1
+forumTopicId: 16806
+dashedName: convert-celsius-to-fahrenheit
+---
+
+# --description--
+
+The algorithm to convert from Celsius to Fahrenheit is the temperature in Celsius times `9/5`, plus `32`.
+
+You are given a variable `celsius` representing a temperature in Celsius. Use the variable `fahrenheit` 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.
+
+# --hints--
+
+`convertToF(0)` should return a number
+
+```js
+assert(typeof convertToF(0) === 'number');
+```
+
+`convertToF(-30)` should return a value of `-22`
+
+```js
+assert(convertToF(-30) === -22);
+```
+
+`convertToF(-10)` should return a value of `14`
+
+```js
+assert(convertToF(-10) === 14);
+```
+
+`convertToF(0)` should return a value of `32`
+
+```js
+assert(convertToF(0) === 32);
+```
+
+`convertToF(20)` should return a value of `68`
+
+```js
+assert(convertToF(20) === 68);
+```
+
+`convertToF(30)` should return a value of `86`
+
+```js
+assert(convertToF(30) === 86);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertToF(celsius) {
+  let fahrenheit;
+  return fahrenheit;
+}
+
+convertToF(30);
+```
+
+# --solutions--
+
+```js
+function convertToF(celsius) {
+  let fahrenheit = celsius * 9/5 + 32;
+
+  return fahrenheit;
+}
+
+convertToF(30);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number.md
new file mode 100644
index 0000000000..5a884cff9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number.md
@@ -0,0 +1,73 @@
+---
+id: a302f7aae1aa3152a5b413bc
+title: Factorialize a Number
+challengeType: 5
+forumTopicId: 16013
+dashedName: 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 `n!`
+
+For example: `5! = 1 * 2 * 3 * 4 * 5 = 120`
+
+Only integers greater than or equal to zero will be supplied to the function.
+
+# --hints--
+
+`factorialize(5)` should return a number.
+
+```js
+assert(typeof factorialize(5) === 'number');
+```
+
+`factorialize(5)` should return `120`.
+
+```js
+assert(factorialize(5) === 120);
+```
+
+`factorialize(10)` should return `3628800`.
+
+```js
+assert(factorialize(10) === 3628800);
+```
+
+`factorialize(20)` should return `2432902008176640000`.
+
+```js
+assert(factorialize(20) === 2432902008176640000);
+```
+
+`factorialize(0)` should return `1`.
+
+```js
+assert(factorialize(0) === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function factorialize(num) {
+  return num;
+}
+
+factorialize(5);
+```
+
+# --solutions--
+
+```js
+function factorialize(num) {
+  return num < 1 ? 1 : num * factorialize(num - 1);
+}
+
+factorialize(5);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
new file mode 100644
index 0000000000..32ef7c3901
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer.md
@@ -0,0 +1,63 @@
+---
+id: adf08ec01beb4f99fc7a68f2
+title: Falsy Bouncer
+challengeType: 5
+forumTopicId: 16014
+dashedName: falsy-bouncer
+---
+
+# --description--
+
+Remove all falsy values from an array.
+
+Falsy values in JavaScript are `false`, `null`, `0`, `""`, `undefined`, and `NaN`.
+
+Hint: Try converting each value to a Boolean.
+
+# --hints--
+
+`bouncer([7, "ate", "", false, 9])` should return `[7, "ate", 9]`.
+
+```js
+assert.deepEqual(bouncer([7, 'ate', '', false, 9]), [7, 'ate', 9]);
+```
+
+`bouncer(["a", "b", "c"])` should return `["a", "b", "c"]`.
+
+```js
+assert.deepEqual(bouncer(['a', 'b', 'c']), ['a', 'b', 'c']);
+```
+
+`bouncer([false, null, 0, NaN, undefined, ""])` should return `[]`.
+
+```js
+assert.deepEqual(bouncer([false, null, 0, NaN, undefined, '']), []);
+```
+
+`bouncer([null, NaN, 1, 2, undefined])` should return `[1, 2]`.
+
+```js
+assert.deepEqual(bouncer([null, NaN, 1, 2, undefined]), [1, 2]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function bouncer(arr) {
+  return arr;
+}
+
+bouncer([7, "ate", "", false, 9]);
+```
+
+# --solutions--
+
+```js
+function bouncer(arr) {
+  return arr.filter(e => e);
+}
+
+bouncer([7, "ate", "", false, 9]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string.md
new file mode 100644
index 0000000000..cc62bb4c9f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string.md
@@ -0,0 +1,87 @@
+---
+id: a26cbbe9ad8655a977e1ceb5
+title: Find the Longest Word in a String
+challengeType: 5
+forumTopicId: 16015
+dashedName: 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.
+
+# --hints--
+
+`findLongestWordLength("The quick brown fox jumped over the lazy dog")` should return a number.
+
+```js
+assert(
+  typeof findLongestWordLength(
+    'The quick brown fox jumped over the lazy dog'
+  ) === 'number'
+);
+```
+
+`findLongestWordLength("The quick brown fox jumped over the lazy dog")` should return `6`.
+
+```js
+assert(
+  findLongestWordLength('The quick brown fox jumped over the lazy dog') === 6
+);
+```
+
+`findLongestWordLength("May the force be with you")` should return `5`.
+
+```js
+assert(findLongestWordLength('May the force be with you') === 5);
+```
+
+`findLongestWordLength("Google do a barrel roll")` should return `6`.
+
+```js
+assert(findLongestWordLength('Google do a barrel roll') === 6);
+```
+
+`findLongestWordLength("What is the average airspeed velocity of an unladen swallow")` should return `8`.
+
+```js
+assert(
+  findLongestWordLength(
+    'What is the average airspeed velocity of an unladen swallow'
+  ) === 8
+);
+```
+
+`findLongestWordLength("What if we try a super-long word such as otorhinolaryngology")` should return `19`.
+
+```js
+assert(
+  findLongestWordLength(
+    'What if we try a super-long word such as otorhinolaryngology'
+  ) === 19
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findLongestWordLength(str) {
+  return str.length;
+}
+
+findLongestWordLength("The quick brown fox jumped over the lazy dog");
+```
+
+# --solutions--
+
+```js
+function findLongestWordLength(str) {
+  return str.split(' ').sort((a, b) => b.length - a.length)[0].length;
+}
+
+findLongestWordLength("The quick brown fox jumped over the lazy dog");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/finders-keepers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/finders-keepers.md
new file mode 100644
index 0000000000..6bfd7139fc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/finders-keepers.md
@@ -0,0 +1,58 @@
+---
+id: a6e40f1041b06c996f7b2406
+title: Finders Keepers
+challengeType: 5
+forumTopicId: 16016
+dashedName: finders-keepers
+---
+
+# --description--
+
+Create a function that looks through an array `arr` and returns the first element in it that passes a 'truth test'. This means that given an element `x`, the 'truth test' is passed if `func(x)` is `true`. If no element passes the test, return `undefined`.
+
+# --hints--
+
+`findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; })` should return `8`.
+
+```js
+assert.strictEqual(
+  findElement([1, 3, 5, 8, 9, 10], function (num) {
+    return num % 2 === 0;
+  }),
+  8
+);
+```
+
+`findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; })` should return `undefined`.
+
+```js
+assert.strictEqual(
+  findElement([1, 3, 5, 9], function (num) {
+    return num % 2 === 0;
+  }),
+  undefined
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findElement(arr, func) {
+  let num = 0;
+  return num;
+}
+
+findElement([1, 2, 3, 4], num => num % 2 === 0);
+```
+
+# --solutions--
+
+```js
+function findElement(arr, func) {
+  return arr.filter(func)[0];
+}
+
+findElement([1, 2, 3, 4], num => num % 2 === 0);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations.md
new file mode 100644
index 0000000000..99da5fd90b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations.md
@@ -0,0 +1,117 @@
+---
+id: af2170cad53daa0770fabdea
+title: Mutations
+challengeType: 5
+forumTopicId: 16025
+dashedName: 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, `["hello", "Hello"]`, should return `true` because all of the letters in the second string are present in the first, ignoring case.
+
+The arguments `["hello", "hey"]` should return `false` because the string `hello` does not contain a `y`.
+
+Lastly, `["Alien", "line"]`, should return `true` because all of the letters in `line` are present in `Alien`.
+
+# --hints--
+
+`mutation(["hello", "hey"])` should return `false`.
+
+```js
+assert(mutation(['hello', 'hey']) === false);
+```
+
+`mutation(["hello", "Hello"])` should return `true`.
+
+```js
+assert(mutation(['hello', 'Hello']) === true);
+```
+
+`mutation(["zyxwvutsrqponmlkjihgfedcba", "qrstu"])` should return `true`.
+
+```js
+assert(mutation(['zyxwvutsrqponmlkjihgfedcba', 'qrstu']) === true);
+```
+
+`mutation(["Mary", "Army"])` should return `true`.
+
+```js
+assert(mutation(['Mary', 'Army']) === true);
+```
+
+`mutation(["Mary", "Aarmy"])` should return `true`.
+
+```js
+assert(mutation(['Mary', 'Aarmy']) === true);
+```
+
+`mutation(["Alien", "line"])` should return `true`.
+
+```js
+assert(mutation(['Alien', 'line']) === true);
+```
+
+`mutation(["floor", "for"])` should return `true`.
+
+```js
+assert(mutation(['floor', 'for']) === true);
+```
+
+`mutation(["hello", "neo"])` should return `false`.
+
+```js
+assert(mutation(['hello', 'neo']) === false);
+```
+
+`mutation(["voodoo", "no"])` should return `false`.
+
+```js
+assert(mutation(['voodoo', 'no']) === false);
+```
+
+`mutation(["ate", "date"])` should return `false`.
+
+```js
+assert(mutation(['ate', 'date']) === false);
+```
+
+`mutation(["Tiger", "Zebra"])` should return `false`.
+
+```js
+assert(mutation(['Tiger', 'Zebra']) === false);
+```
+
+`mutation(["Noel", "Ole"])` should return `true`.
+
+```js
+assert(mutation(['Noel', 'Ole']) === true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mutation(arr) {
+  return arr;
+}
+
+mutation(["hello", "hey"]);
+```
+
+# --solutions--
+
+```js
+function mutation(arr) {
+  let hash = Object.create(null);
+
+  arr[0].toLowerCase().split('').forEach(c => hash[c] = true);
+
+  return !arr[1].toLowerCase().split('').filter(c => !hash[c]).length;
+}
+
+mutation(["hello", "hey"]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string.md
new file mode 100644
index 0000000000..d7349722c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string.md
@@ -0,0 +1,84 @@
+---
+id: afcc8d540bea9ea2669306b6
+title: Repeat a String Repeat a String
+challengeType: 5
+forumTopicId: 16041
+dashedName: repeat-a-string-repeat-a-string
+---
+
+# --description--
+
+Repeat a given string `str` (first argument) for `num` times (second argument). Return an empty string if `num` is not a positive number. For the purpose of this challenge, do *not* use the built-in `.repeat()` method.
+
+# --hints--
+
+`repeatStringNumTimes("*", 3)` should return the string `***`.
+
+```js
+assert(repeatStringNumTimes('*', 3) === '***');
+```
+
+`repeatStringNumTimes("abc", 3)` should return the string `abcabcabc`.
+
+```js
+assert(repeatStringNumTimes('abc', 3) === 'abcabcabc');
+```
+
+`repeatStringNumTimes("abc", 4)` should return the string `abcabcabcabc`.
+
+```js
+assert(repeatStringNumTimes('abc', 4) === 'abcabcabcabc');
+```
+
+`repeatStringNumTimes("abc", 1)` should return the string `abc`.
+
+```js
+assert(repeatStringNumTimes('abc', 1) === 'abc');
+```
+
+`repeatStringNumTimes("*", 8)` should return the string `********`.
+
+```js
+assert(repeatStringNumTimes('*', 8) === '********');
+```
+
+`repeatStringNumTimes("abc", -2)` should return an empty string (`""`).
+
+```js
+assert(repeatStringNumTimes('abc', -2) === '');
+```
+
+The built-in `repeat()` method should not be used.
+
+```js
+assert(!/\.repeat/g.test(code));
+```
+
+`repeatStringNumTimes("abc", 0)` should return `""`.
+
+```js
+assert(repeatStringNumTimes('abc', 0) === '');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function repeatStringNumTimes(str, num) {
+  return str;
+}
+
+repeatStringNumTimes("abc", 3);
+```
+
+# --solutions--
+
+```js
+function repeatStringNumTimes(str, num) {
+  if (num < 1) return '';
+  return num === 1 ? str : str + repeatStringNumTimes(str, num-1);
+}
+
+repeatStringNumTimes("abc", 3);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays.md
new file mode 100644
index 0000000000..2148b0cbd2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays.md
@@ -0,0 +1,92 @@
+---
+id: a789b3483989747d63b0e427
+title: Return Largest Numbers in Arrays
+challengeType: 5
+forumTopicId: 16042
+dashedName: 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 `arr[i]`.
+
+# --hints--
+
+`largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]])` should return an array.
+
+```js
+assert(
+  largestOfFour([
+    [4, 5, 1, 3],
+    [13, 27, 18, 26],
+    [32, 35, 37, 39],
+    [1000, 1001, 857, 1]
+  ]).constructor === Array
+);
+```
+
+`largestOfFour([[13, 27, 18, 26], [4, 5, 1, 3], [32, 35, 37, 39], [1000, 1001, 857, 1]])` should return `[27, 5, 39, 1001]`.
+
+```js
+assert.deepEqual(
+  largestOfFour([
+    [13, 27, 18, 26],
+    [4, 5, 1, 3],
+    [32, 35, 37, 39],
+    [1000, 1001, 857, 1]
+  ]),
+  [27, 5, 39, 1001]
+);
+```
+
+`largestOfFour([[4, 9, 1, 3], [13, 35, 18, 26], [32, 35, 97, 39], [1000000, 1001, 857, 1]])` should return `[9, 35, 97, 1000000]`.
+
+```js
+assert.deepEqual(
+  largestOfFour([
+    [4, 9, 1, 3],
+    [13, 35, 18, 26],
+    [32, 35, 97, 39],
+    [1000000, 1001, 857, 1]
+  ]),
+  [9, 35, 97, 1000000]
+);
+```
+
+`largestOfFour([[17, 23, 25, 12], [25, 7, 34, 48], [4, -10, 18, 21], [-72, -3, -17, -10]])` should return `[25, 48, 21, -3]`.
+
+```js
+assert.deepEqual(
+  largestOfFour([
+    [17, 23, 25, 12],
+    [25, 7, 34, 48],
+    [4, -10, 18, 21],
+    [-72, -3, -17, -10]
+  ]),
+  [25, 48, 21, -3]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestOfFour(arr) {
+  return arr;
+}
+
+largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);
+```
+
+# --solutions--
+
+```js
+function largestOfFour(arr) {
+  return arr.map(subArr => Math.max.apply(null, subArr));
+}
+
+largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/reverse-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/reverse-a-string.md
new file mode 100644
index 0000000000..0e948fbe9f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/reverse-a-string.md
@@ -0,0 +1,63 @@
+---
+id: a202eed8fc186c8434cb6d61
+title: Reverse a String
+challengeType: 5
+forumTopicId: 16043
+dashedName: 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.
+
+# --hints--
+
+`reverseString("hello")` should return a string.
+
+```js
+assert(typeof reverseString('hello') === 'string');
+```
+
+`reverseString("hello")` should return the string `olleh`.
+
+```js
+assert(reverseString('hello') === 'olleh');
+```
+
+`reverseString("Howdy")` should return the string `ydwoH`.
+
+```js
+assert(reverseString('Howdy') === 'ydwoH');
+```
+
+`reverseString("Greetings from Earth")` should return the string `htraE morf sgniteerG`.
+
+```js
+assert(reverseString('Greetings from Earth') === 'htraE morf sgniteerG');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function reverseString(str) {
+  return str;
+}
+
+reverseString("hello");
+```
+
+# --solutions--
+
+```js
+function reverseString(str) {
+  return str.split('').reverse().join('');
+}
+
+reverseString("hello");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice.md
new file mode 100644
index 0000000000..aa06a9e5fa
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice.md
@@ -0,0 +1,98 @@
+---
+id: 579e2a2c335b9d72dd32e05c
+title: Slice and Splice
+challengeType: 5
+forumTopicId: 301148
+dashedName: slice-and-splice
+---
+
+# --description--
+
+You are given two arrays and an index.
+
+Copy each element of the first array into the second array, in order.
+
+Begin inserting elements at index `n` of the second array.
+
+Return the resulting array. The input arrays should remain the same after the function runs.
+
+# --hints--
+
+`frankenSplice([1, 2, 3], [4, 5], 1)` should return `[4, 1, 2, 3, 5]`.
+
+```js
+assert.deepEqual(frankenSplice([1, 2, 3], [4, 5], 1), [4, 1, 2, 3, 5]);
+```
+
+`frankenSplice([1, 2], ["a", "b"], 1)` should return `["a", 1, 2, "b"]`.
+
+```js
+assert.deepEqual(frankenSplice(testArr1, testArr2, 1), ['a', 1, 2, 'b']);
+```
+
+`frankenSplice(["claw", "tentacle"], ["head", "shoulders", "knees", "toes"], 2)` should return `["head", "shoulders", "claw", "tentacle", "knees", "toes"]`.
+
+```js
+assert.deepEqual(
+  frankenSplice(
+    ['claw', 'tentacle'],
+    ['head', 'shoulders', 'knees', 'toes'],
+    2
+  ),
+  ['head', 'shoulders', 'claw', 'tentacle', 'knees', 'toes']
+);
+```
+
+All elements from the first array should be added to the second array in their original order.
+
+```js
+assert.deepEqual(frankenSplice([1, 2, 3, 4], [], 0), [1, 2, 3, 4]);
+```
+
+The first array should remain the same after the function runs.
+
+```js
+frankenSplice(testArr1, testArr2, 1);
+assert.deepEqual(testArr1, [1, 2]);
+```
+
+The second array should remain the same after the function runs.
+
+```js
+frankenSplice(testArr1, testArr2, 1);
+assert.deepEqual(testArr2, ['a', 'b']);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let testArr1 = [1, 2];
+let testArr2 = ["a", "b"];
+```
+
+## --seed-contents--
+
+```js
+function frankenSplice(arr1, arr2, n) {
+  return arr2;
+}
+
+frankenSplice([1, 2, 3], [4, 5, 6], 1);
+```
+
+# --solutions--
+
+```js
+function frankenSplice(arr1, arr2, n) {
+  // It's alive. It's alive!
+  let result = arr2.slice();
+  for (let i = 0; i < arr1.length; i++) {
+    result.splice(n+i, 0, arr1[i]);
+  }
+  return result;
+}
+
+frankenSplice([1, 2, 3], [4, 5], 1);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence.md
new file mode 100644
index 0000000000..0dc778c8a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence.md
@@ -0,0 +1,64 @@
+---
+id: ab6137d4e35944e21037b769
+title: Title Case a Sentence
+challengeType: 5
+forumTopicId: 16088
+dashedName: 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`.
+
+# --hints--
+
+`titleCase("I'm a little tea pot")` should return a string.
+
+```js
+assert(typeof titleCase("I'm a little tea pot") === 'string');
+```
+
+`titleCase("I'm a little tea pot")` should return the string `I'm A Little Tea Pot`.
+
+```js
+assert(titleCase("I'm a little tea pot") === "I'm A Little Tea Pot");
+```
+
+`titleCase("sHoRt AnD sToUt")` should return the string `Short And Stout`.
+
+```js
+assert(titleCase('sHoRt AnD sToUt') === 'Short And Stout');
+```
+
+`titleCase("HERE IS MY HANDLE HERE IS MY SPOUT")` should return the string `Here Is My Handle Here Is My Spout`.
+
+```js
+assert(
+  titleCase('HERE IS MY HANDLE HERE IS MY SPOUT') ===
+    'Here Is My Handle Here Is My Spout'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function titleCase(str) {
+  return str;
+}
+
+titleCase("I'm a little tea pot");
+```
+
+# --solutions--
+
+```js
+function titleCase(str) {
+  return str.split(' ').map(word => word.charAt(0).toUpperCase() + word.substring(1).toLowerCase()).join(' ');
+}
+
+titleCase("I'm a little tea pot");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string.md
new file mode 100644
index 0000000000..bb6270d4a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string.md
@@ -0,0 +1,91 @@
+---
+id: ac6993d51946422351508a41
+title: Truncate a String
+challengeType: 5
+forumTopicId: 16089
+dashedName: 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 `...` ending.
+
+# --hints--
+
+`truncateString("A-tisket a-tasket A green and yellow basket", 8)` should return the string `A-tisket...`.
+
+```js
+assert(
+  truncateString('A-tisket a-tasket A green and yellow basket', 8) ===
+    'A-tisket...'
+);
+```
+
+`truncateString("Peter Piper picked a peck of pickled peppers", 11)` should return the string `Peter Piper...`.
+
+```js
+assert(
+  truncateString('Peter Piper picked a peck of pickled peppers', 11) ===
+    'Peter Piper...'
+);
+```
+
+`truncateString("A-tisket a-tasket A green and yellow basket", "A-tisket a-tasket A green and yellow basket".length)` should return the string `A-tisket a-tasket A green and yellow basket`.
+
+```js
+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'
+);
+```
+
+`truncateString("A-tisket a-tasket A green and yellow basket", "A-tisket a-tasket A green and yellow basket".length + 2)` should return the string `A-tisket a-tasket A green and yellow basket`.
+
+```js
+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'
+);
+```
+
+`truncateString("A-", 1)` should return the string `A...`.
+
+```js
+assert(truncateString('A-', 1) === 'A...');
+```
+
+`truncateString("Absolutely Longer", 2)` should return the string `Ab...`.
+
+```js
+assert(truncateString('Absolutely Longer', 2) === 'Ab...');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function truncateString(str, num) {
+  return str;
+}
+
+truncateString("A-tisket a-tasket A green and yellow basket", 8);
+```
+
+# --solutions--
+
+```js
+function truncateString(str, num) {
+  if (num >= str.length) {
+    return str;
+  }
+
+  return str.slice(0, num) + '...';
+}
+
+truncateString("A-tisket a-tasket A green and yellow basket", 8);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong.md
new file mode 100644
index 0000000000..20f9427e64
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong.md
@@ -0,0 +1,143 @@
+---
+id: a24c1a4622e3c05097f71d67
+title: Where do I Belong
+challengeType: 5
+forumTopicId: 16094
+dashedName: 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, `getIndexToIns([1,2,3,4], 1.5)` should return `1` because it is greater than `1` (index 0), but less than `2` (index 1).
+
+Likewise, `getIndexToIns([20,3,5], 19)` should return `2` because once the array has been sorted it will look like `[3,5,20]` and `19` is less than `20` (index 2) and greater than `5` (index 1).
+
+# --hints--
+
+`getIndexToIns([10, 20, 30, 40, 50], 35)` should return `3`.
+
+```js
+assert(getIndexToIns([10, 20, 30, 40, 50], 35) === 3);
+```
+
+`getIndexToIns([10, 20, 30, 40, 50], 35)` should return a number.
+
+```js
+assert(typeof getIndexToIns([10, 20, 30, 40, 50], 35) === 'number');
+```
+
+`getIndexToIns([10, 20, 30, 40, 50], 30)` should return `2`.
+
+```js
+assert(getIndexToIns([10, 20, 30, 40, 50], 30) === 2);
+```
+
+`getIndexToIns([10, 20, 30, 40, 50], 30)` should return a number.
+
+```js
+assert(typeof getIndexToIns([10, 20, 30, 40, 50], 30) === 'number');
+```
+
+`getIndexToIns([40, 60], 50)` should return `1`.
+
+```js
+assert(getIndexToIns([40, 60], 50) === 1);
+```
+
+`getIndexToIns([40, 60], 50)` should return a number.
+
+```js
+assert(typeof getIndexToIns([40, 60], 50) === 'number');
+```
+
+`getIndexToIns([3, 10, 5], 3)` should return `0`.
+
+```js
+assert(getIndexToIns([3, 10, 5], 3) === 0);
+```
+
+`getIndexToIns([3, 10, 5], 3)` should return a number.
+
+```js
+assert(typeof getIndexToIns([3, 10, 5], 3) === 'number');
+```
+
+`getIndexToIns([5, 3, 20, 3], 5)` should return `2`.
+
+```js
+assert(getIndexToIns([5, 3, 20, 3], 5) === 2);
+```
+
+`getIndexToIns([5, 3, 20, 3], 5)` should return a number.
+
+```js
+assert(typeof getIndexToIns([5, 3, 20, 3], 5) === 'number');
+```
+
+`getIndexToIns([2, 20, 10], 19)` should return `2`.
+
+```js
+assert(getIndexToIns([2, 20, 10], 19) === 2);
+```
+
+`getIndexToIns([2, 20, 10], 19)` should return a number.
+
+```js
+assert(typeof getIndexToIns([2, 20, 10], 19) === 'number');
+```
+
+`getIndexToIns([2, 5, 10], 15)` should return `3`.
+
+```js
+assert(getIndexToIns([2, 5, 10], 15) === 3);
+```
+
+`getIndexToIns([2, 5, 10], 15)` should return a number.
+
+```js
+assert(typeof getIndexToIns([2, 5, 10], 15) === 'number');
+```
+
+`getIndexToIns([], 1)` should return `0`.
+
+```js
+assert(getIndexToIns([], 1) === 0);
+```
+
+`getIndexToIns([], 1)` should return a number.
+
+```js
+assert(typeof getIndexToIns([], 1) === 'number');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function getIndexToIns(arr, num) {
+  return num;
+}
+
+getIndexToIns([40, 60], 50);
+```
+
+# --solutions--
+
+```js
+function getIndexToIns(arr, num) {
+  arr = arr.sort((a, b) => a - b);
+
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] >= num) {
+      return i;
+    }
+  }
+
+  return arr.length;
+}
+
+getIndexToIns([40, 60], 50);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-an-arrays-contents-using-bracket-notation.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-an-arrays-contents-using-bracket-notation.md
new file mode 100644
index 0000000000..4f03872562
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-an-arrays-contents-using-bracket-notation.md
@@ -0,0 +1,82 @@
+---
+id: 5a661e0f1068aca922b3ef17
+title: Access an Array's Contents Using Bracket Notation
+challengeType: 1
+forumTopicId: 301149
+dashedName: access-an-arrays-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:
+
+```js
+let ourArray = ["a", "b", "c"];
+```
+
+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 ***zeroth*** 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 `a` from `ourArray` and assign it to a variable, we can do so with the following code:
+
+```js
+let ourVariable = ourArray[0];
+```
+
+Now `ourVariable` has the value of `a`.
+
+In addition to accessing the value associated with an index, you can also *set* an index to a value using the same notation:
+
+```js
+ourArray[1] = "not b anymore";
+```
+
+Using bracket notation, we have now reset the item at index 1 from the string `b`, to `not b anymore`. Now `ourArray` is `["a", "not b anymore", "c"]`.
+
+# --instructions--
+
+In order to complete this challenge, set the 2nd position (index `1`) of `myArray` to anything you want, besides the letter `b`.
+
+# --hints--
+
+`myArray[0]` should be equal to the letter `a`
+
+```js
+assert.strictEqual(myArray[0], 'a');
+```
+
+`myArray[1]` should not be equal to the letter `b`
+
+```js
+assert.notStrictEqual(myArray[1], 'b');
+```
+
+`myArray[2]` should be equal to the letter `c`
+
+```js
+assert.strictEqual(myArray[2], 'c');
+```
+
+`myArray[3]` should be equal to the letter `d`
+
+```js
+assert.strictEqual(myArray[3], 'd');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myArray = ["a", "b", "c", "d"];
+// Only change code below this line
+
+// Only change code above this line
+console.log(myArray);
+```
+
+# --solutions--
+
+```js
+let myArray = ["a", "b", "c", "d"];
+myArray[1] = "e";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-property-names-with-bracket-notation.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-property-names-with-bracket-notation.md
new file mode 100644
index 0000000000..32bf0bb356
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/access-property-names-with-bracket-notation.md
@@ -0,0 +1,101 @@
+---
+id: 587d7b7c367417b2b2512b1a
+title: Access Property Names with Bracket Notation
+challengeType: 1
+forumTopicId: 301150
+dashedName: 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 `foods` object is being used in a program for a supermarket cash register. We have some function that sets the `selectedFood` and we want to check our `foods` object for the presence of that food. This might look like:
+
+```js
+let selectedFood = getCurrentFood(scannedItem);
+let inventory = foods[selectedFood];
+```
+
+This code will evaluate the value stored in the `selectedFood` variable and return the value of that key in the `foods` object, or `undefined` 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.
+
+# --instructions--
+
+We've defined a function, `checkInventory`, which receives a scanned item as an argument. Return the current value of the `scannedItem` key in the `foods` object. You can assume that only valid keys will be provided as an argument to `checkInventory`.
+
+# --hints--
+
+`checkInventory` should be a function.
+
+```js
+assert.strictEqual(typeof checkInventory, 'function');
+```
+
+The `foods` object should have only the following key-value pairs: `apples: 25`, `oranges: 32`, `plums: 28`, `bananas: 13`, `grapes: 35`, `strawberries: 27`.
+
+```js
+assert.deepEqual(foods, {
+  apples: 25,
+  oranges: 32,
+  plums: 28,
+  bananas: 13,
+  grapes: 35,
+  strawberries: 27
+});
+```
+
+`checkInventory("apples")` should return `25`.
+
+```js
+assert.strictEqual(checkInventory('apples'), 25);
+```
+
+`checkInventory("bananas")` should return `13`.
+
+```js
+assert.strictEqual(checkInventory('bananas'), 13);
+```
+
+`checkInventory("strawberries")` should return `27`.
+
+```js
+assert.strictEqual(checkInventory('strawberries'), 27);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28,
+  bananas: 13,
+  grapes: 35,
+  strawberries: 27
+};
+
+function checkInventory(scannedItem) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+
+console.log(checkInventory("apples"));
+```
+
+# --solutions--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28,
+  bananas: 13,
+  grapes: 35,
+  strawberries: 27
+};
+
+function checkInventory(scannedItem) {
+  return foods[scannedItem];
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-to-an-array-with-push-and-unshift.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-to-an-array-with-push-and-unshift.md
new file mode 100644
index 0000000000..81963c6d7e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-to-an-array-with-push-and-unshift.md
@@ -0,0 +1,87 @@
+---
+id: 587d78b2367417b2b2512b0e
+title: Add Items to an Array with push() and unshift()
+challengeType: 1
+forumTopicId: 301151
+dashedName: 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: `Array.push()` and `Array.unshift()`.
+
+Both methods take one or more elements as parameters and add those elements to the array the method is being called on; the `push()` method adds elements to the end of an array, and `unshift()` adds elements to the beginning. Consider the following:
+
+```js
+let twentyThree = 'XXIII';
+let romanNumerals = ['XXI', 'XXII'];
+
+romanNumerals.unshift('XIX', 'XX');
+```
+
+`romanNumerals` would have the value `['XIX', 'XX', 'XXI', 'XXII']`.
+
+```js
+romanNumerals.push(twentyThree);
+```
+
+`romanNumerals` would have the value `['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.
+
+# --instructions--
+
+We have defined a function, `mixedNumbers`, which we are passing an array as an argument. Modify the function by using `push()` and `unshift()` to add `'I', 2, 'three'` to the beginning of the array and `7, 'VIII', 9` to the end so that the returned array contains representations of the numbers 1-9 in order.
+
+# --hints--
+
+`mixedNumbers(["IV", 5, "six"])` should now return `["I", 2, "three", "IV", 5, "six", 7, "VIII", 9]`
+
+```js
+assert.deepEqual(mixedNumbers(['IV', 5, 'six']), [
+  'I',
+  2,
+  'three',
+  'IV',
+  5,
+  'six',
+  7,
+  'VIII',
+  9
+]);
+```
+
+The `mixedNumbers` function should utilize the `push()` method
+
+```js
+assert(mixedNumbers.toString().match(/\.push/));
+```
+
+The `mixedNumbers` function should utilize the `unshift()` method
+
+```js
+assert(mixedNumbers.toString().match(/\.unshift/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mixedNumbers(arr) {
+  // Only change code below this line
+
+  // Only change code above this line
+  return arr;
+}
+
+console.log(mixedNumbers(['IV', 5, 'six']));
+```
+
+# --solutions--
+
+```js
+function mixedNumbers(arr) {
+  arr.push(7,'VIII',9);
+  arr.unshift('I',2,'three');
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-using-splice.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-using-splice.md
new file mode 100644
index 0000000000..ec9575f325
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-items-using-splice.md
@@ -0,0 +1,93 @@
+---
+id: 587d78b3367417b2b2512b11
+title: Add Items Using splice()
+challengeType: 1
+forumTopicId: 301152
+dashedName: add-items-using-splice
+---
+
+# --description--
+
+Remember in the last challenge we mentioned that `splice()` can take up to three parameters? Well, you can use the third parameter, comprised of one or more element(s), to add to the array. This can be incredibly useful for quickly switching out an element, or a set of elements, for another.
+
+```js
+const numbers = [10, 11, 12, 12, 15];
+const startIndex = 3;
+const amountToDelete = 1;
+
+numbers.splice(startIndex, amountToDelete, 13, 14);
+console.log(numbers);
+```
+
+The second occurrence of `12` is removed, and we add `13` and `14` at the same index. The `numbers` array would now be `[ 10, 11, 12, 13, 14, 15 ]`.
+
+Here, we begin with an array of numbers. Then, we pass the following to `splice()`: The index at which to begin deleting elements (3), the number of elements to be deleted (1), and the remaining arguments (13, 14) will be inserted starting at that same index. Note that there can be any number of elements (separated by commas) following `amountToDelete`, each of which gets inserted.
+
+# --instructions--
+
+We have defined a function, `htmlColorNames`, which takes an array of HTML colors as an argument. Modify the function using `splice()` to remove the first two elements of the array and add `'DarkSalmon'` and `'BlanchedAlmond'` in their respective places.
+
+# --hints--
+
+`htmlColorNames` should return `["DarkSalmon", "BlanchedAlmond", "LavenderBlush", "PaleTurquoise", "FireBrick"]`
+
+```js
+assert.deepEqual(
+  htmlColorNames([
+    'DarkGoldenRod',
+    'WhiteSmoke',
+    'LavenderBlush',
+    'PaleTurquoise',
+    'FireBrick'
+  ]),
+  [
+    'DarkSalmon',
+    'BlanchedAlmond',
+    'LavenderBlush',
+    'PaleTurquoise',
+    'FireBrick'
+  ]
+);
+```
+
+The `htmlColorNames` function should utilize the `splice()` method
+
+```js
+assert(/.splice/.test(code));
+```
+
+You should not use `shift()` or `unshift()`.
+
+```js
+assert(!/shift|unshift/.test(code));
+```
+
+You should not use array bracket notation.
+
+```js
+assert(!/\[\d\]\s*=/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function htmlColorNames(arr) {
+  // Only change code below this line
+
+  // Only change code above this line
+  return arr;
+}
+
+console.log(htmlColorNames(['DarkGoldenRod', 'WhiteSmoke', 'LavenderBlush', 'PaleTurquoise', 'FireBrick']));
+```
+
+# --solutions--
+
+```js
+function htmlColorNames(arr) {
+  arr.splice(0,2,'DarkSalmon', 'BlanchedAlmond');
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-key-value-pairs-to-javascript-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-key-value-pairs-to-javascript-objects.md
new file mode 100644
index 0000000000..5bec1202db
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/add-key-value-pairs-to-javascript-objects.md
@@ -0,0 +1,124 @@
+---
+id: 587d7b7c367417b2b2512b18
+title: Add Key-Value Pairs to JavaScript Objects
+challengeType: 1
+forumTopicId: 301153
+dashedName: add-key-value-pairs-to-javascript-objects
+---
+
+# --description--
+
+At their most basic, objects are just collections of <dfn>key-value</dfn> pairs. In other words, they are pieces of data (<dfn>values</dfn>) mapped to unique identifiers called <dfn>properties</dfn> (<dfn>keys</dfn>). Take a look at an example:
+
+```js
+const tekkenCharacter = {
+  player: 'Hwoarang',
+  fightingStyle: 'Tae Kwon Doe',
+  human: true
+};
+```
+
+The above code defines a Tekken video game character object called `tekkenCharacter`. It has three properties, each of which map to a specific value. If you want to add an additional property, such as "origin", it can be done by assigning `origin` to the object:
+
+```js
+tekkenCharacter.origin = 'South Korea';
+```
+
+This uses dot notation. If you were to observe the `tekkenCharacter` object, it will now include the `origin` property. Hwoarang also had distinct orange hair. You can add this property with bracket notation by doing:
+
+```js
+tekkenCharacter['hair color'] = 'dyed orange';
+```
+
+Bracket notation is required if your property has a space in it or if you want to use a variable to name the property. In the above case, the property is enclosed in quotes to denote it as a string and will be added exactly as shown. Without quotes, it will be evaluated as a variable and the name of the property will be whatever value the variable is. Here's an example with a variable:
+
+```js
+const eyes = 'eye color';
+
+tekkenCharacter[eyes] = 'brown';
+```
+
+After adding all the examples, the object will look like this:
+
+```js
+{
+  player: 'Hwoarang',
+  fightingStyle: 'Tae Kwon Doe',
+  human: true,
+  origin: 'South Korea',
+  'hair color': 'dyed orange',
+  'eye color': 'brown'
+};
+```
+
+# --instructions--
+
+A `foods` object has been created with three entries. Using the syntax of your choice, add three more entries to it: `bananas` with a value of `13`, `grapes` with a value of `35`, and `strawberries` with a value of `27`.
+
+# --hints--
+
+`foods` should be an object.
+
+```js
+assert(typeof foods === 'object');
+```
+
+The `foods` object should have a key `bananas` with a value of `13`.
+
+```js
+assert(foods.bananas === 13);
+```
+
+The `foods` object should have a key `grapes` with a value of `35`.
+
+```js
+assert(foods.grapes === 35);
+```
+
+The `foods` object should have a key `strawberries` with a value of `27`.
+
+```js
+assert(foods.strawberries === 27);
+```
+
+The key-value pairs should be set using dot or bracket notation.
+
+```js
+assert(
+  code.search(/bananas:/) === -1 &&
+    code.search(/grapes:/) === -1 &&
+    code.search(/strawberries:/) === -1
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28
+};
+
+// Only change code below this line
+
+// Only change code above this line
+
+console.log(foods);
+```
+
+# --solutions--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28
+};
+
+foods['bananas'] = 13;
+foods['grapes']  = 35;
+foods['strawberries'] = 27;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-for-the-presence-of-an-element-with-indexof.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-for-the-presence-of-an-element-with-indexof.md
new file mode 100644
index 0000000000..e9a2f2dbb1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-for-the-presence-of-an-element-with-indexof.md
@@ -0,0 +1,93 @@
+---
+id: 587d7b7b367417b2b2512b14
+title: Check For The Presence of an Element With indexOf()
+challengeType: 1
+forumTopicId: 301154
+dashedName: check-for-the-presence-of-an-element-with-indexof
+---
+
+# --description--
+
+Since arrays can be changed, or *mutated*, 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, `indexOf()`, that allows us to quickly and easily check for the presence of an element on an array. `indexOf()` takes an element as a parameter, and when called, it returns the position, or index, of that element, or `-1` if the element does not exist on the array.
+
+For example:
+
+```js
+let fruits = ['apples', 'pears', 'oranges', 'peaches', 'pears'];
+
+fruits.indexOf('dates');
+fruits.indexOf('oranges');
+fruits.indexOf('pears');
+```
+
+`indexOf('dates')` returns `-1`, `indexOf('oranges')` returns `2`, and `indexOf('pears')` returns `1` (the first index at which each element exists).
+
+# --instructions--
+
+`indexOf()` can be incredibly useful for quickly checking for the presence of an element on an array. We have defined a function, `quickCheck`, that takes an array and an element as arguments. Modify the function using `indexOf()` so that it returns `true` if the passed element exists on the array, and `false` if it does not.
+
+# --hints--
+
+The `quickCheck` function should return a boolean (`true` or `false`), not a string (`"true"` or `"false"`)
+
+```js
+assert.isBoolean(quickCheck(['squash', 'onions', 'shallots'], 'mushrooms'));
+```
+
+`quickCheck(["squash", "onions", "shallots"], "mushrooms")` should return `false`
+
+```js
+assert.strictEqual(
+  quickCheck(['squash', 'onions', 'shallots'], 'mushrooms'),
+  false
+);
+```
+
+`quickCheck(["onions", "squash", "shallots"], "onions")` should return `true`
+
+```js
+assert.strictEqual(
+  quickCheck(['onions', 'squash', 'shallots'], 'onions'),
+  true
+);
+```
+
+`quickCheck([3, 5, 9, 125, 45, 2], 125)` should return `true`
+
+```js
+assert.strictEqual(quickCheck([3, 5, 9, 125, 45, 2], 125), true);
+```
+
+`quickCheck([true, false, false], undefined)` should return `false`
+
+```js
+assert.strictEqual(quickCheck([true, false, false], undefined), false);
+```
+
+The `quickCheck` function should utilize the `indexOf()` method
+
+```js
+assert.notStrictEqual(quickCheck.toString().search(/\.indexOf\(/), -1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function quickCheck(arr, elem) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+
+console.log(quickCheck(['squash', 'onions', 'shallots'], 'mushrooms'));
+```
+
+# --solutions--
+
+```js
+function quickCheck(arr, elem) {
+  return arr.indexOf(elem) >= 0; 
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-if-an-object-has-a-property.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-if-an-object-has-a-property.md
new file mode 100644
index 0000000000..cbc206b8ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/check-if-an-object-has-a-property.md
@@ -0,0 +1,161 @@
+---
+id: 587d7b7d367417b2b2512b1c
+title: Check if an Object has a Property
+challengeType: 1
+forumTopicId: 301155
+dashedName: 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 `hasOwnProperty()` method and the other uses the `in` keyword. If we have an object `users` with a property of `Alan`, we could check for its presence in either of the following ways:
+
+```js
+users.hasOwnProperty('Alan');
+'Alan' in users;
+```
+
+Both of these would return `true`.
+
+# --instructions--
+
+Finish writing the function so that it returns true if the object passed to it contains all four names, `Alan`, `Jeff`, `Sarah` and `Ryan` and returns false otherwise.
+
+# --hints--
+
+The `users` object should not be accessed directly
+
+```js 
+
+assert(code.match(/users/gm).length <= 2)
+
+```
+
+The `users` object should only contain the keys `Alan`, `Jeff`, `Sarah`, and `Ryan`
+
+```js
+assert(
+  'Alan' in users &&
+    'Jeff' in users &&
+    'Sarah' in users &&
+    'Ryan' in users &&
+    Object.keys(users).length === 4
+);
+```
+
+The function `isEveryoneHere` should return `true` if `Alan`, `Jeff`, `Sarah`, and `Ryan` are properties on the object passed to it. 
+
+```js
+assert(isEveryoneHere(users) === true);
+```
+
+The function `isEveryoneHere` should return `false` if `Alan` is not a property on the object passed to it.
+
+```js
+assert(
+  (function () {
+    delete users.Alan;
+    return isEveryoneHere(users);
+  })() === false
+);
+```
+
+The function `isEveryoneHere` should return `false` if `Jeff` is not a property on the object passed to it.
+
+```js
+assert(
+  (function () {
+    delete users.Jeff;
+    return isEveryoneHere(users);
+  })() === false
+);
+```
+
+The function `isEveryoneHere` should return `false` if `Sarah` is not a property on the object passed to it.
+
+```js
+assert(
+  (function () {
+    delete users.Sarah;
+    return isEveryoneHere(users);
+  })() === false
+);
+```
+
+The function `isEveryoneHere` should return `false` if `Ryan` is not a property on the object passed to it.
+
+```js
+assert(
+  (function () {
+    delete users.Ryan;
+    return isEveryoneHere(users);
+  })() === false
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let users = {
+  Alan: {
+    age: 27,
+    online: true
+  },
+  Jeff: {
+    age: 32,
+    online: true
+  },
+  Sarah: {
+    age: 48,
+    online: true
+  },
+  Ryan: {
+    age: 19,
+    online: true
+  }
+};
+
+function isEveryoneHere(userObj) {
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+
+console.log(isEveryoneHere(users));
+```
+
+# --solutions--
+
+```js
+let users = {
+  Alan: {
+    age: 27,
+    online: true
+  },
+  Jeff: {
+    age: 32,
+    online: true
+  },
+  Sarah: {
+    age: 48,
+    online: true
+  },
+  Ryan: {
+    age: 19,
+    online: true
+  }
+};
+
+function isEveryoneHere(userObj) {
+  return [
+    'Alan',
+    'Jeff',
+    'Sarah',
+    'Ryan'
+  ].every(user => userObj.hasOwnProperty(user));
+}
+
+console.log(isEveryoneHere(users));
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/combine-arrays-with-the-spread-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/combine-arrays-with-the-spread-operator.md
new file mode 100644
index 0000000000..6cec90e34d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/combine-arrays-with-the-spread-operator.md
@@ -0,0 +1,63 @@
+---
+id: 587d7b7b367417b2b2512b17
+title: Combine Arrays with the Spread Operator
+challengeType: 1
+forumTopicId: 301156
+dashedName: 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:
+
+```js
+let thisArray = ['sage', 'rosemary', 'parsley', 'thyme'];
+
+let thatArray = ['basil', 'cilantro', ...thisArray, 'coriander'];
+```
+
+`thatArray` would have the value `['basil', 'cilantro', 'sage', 'rosemary', 'parsley', 'thyme', 'coriander']`.
+
+Using spread syntax, we have just achieved an operation that would have been more complex and more verbose had we used traditional methods.
+
+# --instructions--
+
+We have defined a function `spreadOut` that returns the variable `sentence`. Modify the function using the <dfn>spread</dfn> operator so that it returns the array `['learning', 'to', 'code', 'is', 'fun']`.
+
+# --hints--
+
+`spreadOut` should return `["learning", "to", "code", "is", "fun"]`
+
+```js
+assert.deepEqual(spreadOut(), ['learning', 'to', 'code', 'is', 'fun']);
+```
+
+The `spreadOut` function should utilize spread syntax
+
+```js
+assert.notStrictEqual(spreadOut.toString().search(/[...]/), -1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spreadOut() {
+  let fragment = ['to', 'code'];
+  let sentence; // Change this line
+  return sentence;
+}
+
+console.log(spreadOut());
+```
+
+# --solutions--
+
+```js
+function spreadOut() {
+  let fragment = ['to', 'code'];
+  let sentence = ['learning', ...fragment, 'is', 'fun'];
+  return sentence;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-an-array-with-the-spread-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-an-array-with-the-spread-operator.md
new file mode 100644
index 0000000000..9029b1b14b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-an-array-with-the-spread-operator.md
@@ -0,0 +1,102 @@
+---
+id: 587d7b7b367417b2b2512b13
+title: Copy an Array with the Spread Operator
+challengeType: 1
+forumTopicId: 301157
+dashedName: copy-an-array-with-the-spread-operator
+---
+
+# --description--
+
+While `slice()` 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 *all* of an array's elements, in order, with a simple and highly readable syntax. The spread syntax simply looks like this: `...`
+
+In practice, we can use the spread operator to copy an array like so:
+
+```js
+let thisArray = [true, true, undefined, false, null];
+let thatArray = [...thisArray];
+```
+
+`thatArray` equals `[true, true, undefined, false, null]`. `thisArray` remains unchanged and `thatArray` contains the same elements as `thisArray`.
+
+# --instructions--
+
+We have defined a function, `copyMachine` which takes `arr` (an array) and `num` (a number) as arguments. The function is supposed to return a new array made up of `num` copies of `arr`. 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!).
+
+# --hints--
+
+`copyMachine([true, false, true], 2)` should return `[[true, false, true], [true, false, true]]`
+
+```js
+assert.deepEqual(copyMachine([true, false, true], 2), [
+  [true, false, true],
+  [true, false, true]
+]);
+```
+
+`copyMachine([1, 2, 3], 5)` should return `[[1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3]]`
+
+```js
+assert.deepEqual(copyMachine([1, 2, 3], 5), [
+  [1, 2, 3],
+  [1, 2, 3],
+  [1, 2, 3],
+  [1, 2, 3],
+  [1, 2, 3]
+]);
+```
+
+`copyMachine([true, true, null], 1)` should return `[[true, true, null]]`
+
+```js
+assert.deepEqual(copyMachine([true, true, null], 1), [[true, true, null]]);
+```
+
+`copyMachine(["it works"], 3)` should return `[["it works"], ["it works"], ["it works"]]`
+
+```js
+assert.deepEqual(copyMachine(['it works'], 3), [
+  ['it works'],
+  ['it works'],
+  ['it works']
+]);
+```
+
+The `copyMachine` function should utilize the `spread operator` with array `arr`
+
+```js
+assert(code.match(/\.\.\.arr/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function copyMachine(arr, num) {
+  let newArr = [];
+  while (num >= 1) {
+    // Only change code below this line
+
+    // Only change code above this line
+    num--;
+  }
+  return newArr;
+}
+
+console.log(copyMachine([true, false, true], 2));
+```
+
+# --solutions--
+
+```js
+function copyMachine(arr,num){
+    let newArr=[];
+    while(num >=1){
+    newArr.push([...arr]);
+    num--;
+    }
+    return newArr;
+}
+console.log(copyMachine([true, false, true], 2));
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-array-items-using-slice.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-array-items-using-slice.md
new file mode 100644
index 0000000000..325439ea9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/copy-array-items-using-slice.md
@@ -0,0 +1,65 @@
+---
+id: 587d7b7a367417b2b2512b12
+title: Copy Array Items Using slice()
+challengeType: 1
+forumTopicId: 301158
+dashedName: copy-array-items-using-slice
+---
+
+# --description--
+
+The next method we will cover is `slice()`. Rather than modifying an array, `slice()` copies or *extracts* a given number of elements to a new array, leaving the array it is called upon untouched. `slice()` takes only 2 parameters — 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:
+
+```js
+let weatherConditions = ['rain', 'snow', 'sleet', 'hail', 'clear'];
+
+let todaysWeather = weatherConditions.slice(1, 3);
+```
+
+`todaysWeather` would have the value `['snow', 'sleet']`, while `weatherConditions` would still have `['rain', 'snow', 'sleet', 'hail', 'clear']`.
+
+In effect, we have created a new array by extracting elements from an existing array.
+
+# --instructions--
+
+We have defined a function, `forecast`, that takes an array as an argument. Modify the function using `slice()` to extract information from the argument array and return a new array that contains the string elements `warm` and `sunny`.
+
+# --hints--
+
+`forecast` should return `["warm", "sunny"]`
+
+```js
+assert.deepEqual(
+  forecast(['cold', 'rainy', 'warm', 'sunny', 'cool', 'thunderstorms']),
+  ['warm', 'sunny']
+);
+```
+
+The `forecast` function should utilize the `slice()` method
+
+```js
+assert(/\.slice\(/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function forecast(arr) {
+  // Only change code below this line
+
+  return arr;
+}
+
+// Only change code above this line
+console.log(forecast(['cold', 'rainy', 'warm', 'sunny', 'cool', 'thunderstorms']));
+```
+
+# --solutions--
+
+```js
+function forecast(arr) {
+  return arr.slice(2,4);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/create-complex-multi-dimensional-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/create-complex-multi-dimensional-arrays.md
new file mode 100644
index 0000000000..4f33c93637
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/create-complex-multi-dimensional-arrays.md
@@ -0,0 +1,218 @@
+---
+id: 587d7b7b367417b2b2512b16
+title: Create complex multi-dimensional arrays
+challengeType: 1
+forumTopicId: 301159
+dashedName: 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:
+
+```js
+let nestedArray = [
+  ['deep'],
+  [
+    ['deeper'], ['deeper'] 
+  ],
+  [
+    [
+      ['deepest'], ['deepest']
+    ],
+    [
+      [
+        ['deepest-est?']
+      ]
+    ]
+  ]
+];
+```
+
+The `deep` array is nested 2 levels deep. The `deeper` arrays are 3 levels deep. The `deepest` arrays are 4 levels, and the `deepest-est?` is 5.
+
+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:
+
+```js
+console.log(nestedArray[2][1][0][0][0]);
+```
+
+This logs the string `deepest-est?`. And now that we know where that piece of data is, we can reset it if we need to:
+
+```js
+nestedArray[2][1][0][0][0] = 'deeper still';
+
+console.log(nestedArray[2][1][0][0][0]);
+```
+
+Now it logs `deeper still`.
+
+# --instructions--
+
+We have defined a variable, `myNestedArray`, set equal to an array. Modify `myNestedArray`, 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 `deep`, on the fourth level, include the string `deeper`, and on the fifth level, include the string `deepest`.
+
+# --hints--
+
+`myNestedArray` should contain only numbers, booleans, and strings as data elements
+
+```js
+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
+);
+```
+
+`myNestedArray` should have exactly 5 levels of depth
+
+```js
+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
+);
+```
+
+`myNestedArray` should contain exactly one occurrence of the string `deep` on an array nested 3 levels deep
+
+```js
+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
+);
+```
+
+`myNestedArray` should contain exactly one occurrence of the string `deeper` on an array nested 4 levels deep
+
+```js
+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
+);
+```
+
+`myNestedArray` should contain exactly one occurrence of the string `deepest` on an array nested 5 levels deep
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myNestedArray = [
+  // Only 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']
+  // Only change code above this line
+];
+```
+
+# --solutions--
+
+```js
+let myNestedArray = [
+  ['unshift', ['deep', ['deeper', ['deepest']]],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']
+];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/generate-an-array-of-all-object-keys-with-object.keys.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/generate-an-array-of-all-object-keys-with-object.keys.md
new file mode 100644
index 0000000000..df6c8f9996
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/generate-an-array-of-all-object-keys-with-object.keys.md
@@ -0,0 +1,111 @@
+---
+id: 587d7b7d367417b2b2512b1e
+title: Generate an Array of All Object Keys with Object.keys()
+challengeType: 1
+forumTopicId: 301160
+dashedName: 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 `Object.keys()` 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.
+
+# --instructions--
+
+Finish writing the `getArrayOfUsers` function so that it returns an array containing all the properties in the object it receives as an argument.
+
+# --hints--
+
+The `users` object should only contain the keys `Alan`, `Jeff`, `Sarah`, and `Ryan`
+
+```js
+assert(
+  'Alan' in users &&
+    'Jeff' in users &&
+    'Sarah' in users &&
+    'Ryan' in users &&
+    Object.keys(users).length === 4
+);
+```
+
+The `getArrayOfUsers` function should return an array which contains all the keys in the `users` object
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+
+console.log(getArrayOfUsers(users));
+```
+
+# --solutions--
+
+```js
+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) {
+  return Object.keys(obj);
+}
+
+console.log(getArrayOfUsers(users));
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
new file mode 100644
index 0000000000..25a7f5363c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-all-an-arrays-items-using-for-loops.md
@@ -0,0 +1,138 @@
+---
+id: 587d7b7b367417b2b2512b15
+title: Iterate Through All an Array's Items Using For Loops
+challengeType: 1
+forumTopicId: 301161
+dashedName: iterate-through-all-an-arrays-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 `every()`, `forEach()`, `map()`, etc.), however the technique which is most flexible and offers us the greatest amount of control is a simple `for` loop.
+
+Consider the following:
+
+```js
+function greaterThanTen(arr) {
+  let newArr = [];
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] > 10) {
+      newArr.push(arr[i]);
+    }
+  }
+  return newArr;
+}
+
+greaterThanTen([2, 12, 8, 14, 80, 0, 1]);
+```
+
+Using a `for` 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 `10`, and returned a new array, `[12, 14, 80]`, containing those items.
+
+# --instructions--
+
+We have defined a function, `filteredArray`, which takes `arr`, a nested array, and `elem` as arguments, and returns a new array. `elem` represents an element that may or may not be present on one or more of the arrays nested within `arr`. Modify the function, using a `for` loop, to return a filtered version of the passed array such that any array nested within `arr` containing `elem` has been removed.
+
+# --hints--
+
+`filteredArray([[10, 8, 3], [14, 6, 23], [3, 18, 6]], 18)` should return `[[10, 8, 3], [14, 6, 23]]`
+
+```js
+assert.deepEqual(
+  filteredArray(
+    [
+      [10, 8, 3],
+      [14, 6, 23],
+      [3, 18, 6]
+    ],
+    18
+  ),
+  [
+    [10, 8, 3],
+    [14, 6, 23]
+  ]
+);
+```
+
+`filteredArray([["trumpets", 2], ["flutes", 4], ["saxophones", 2]], 2)` should return `[["flutes", 4]]`
+
+```js
+assert.deepEqual(
+  filteredArray(
+    [
+      ['trumpets', 2],
+      ['flutes', 4],
+      ['saxophones', 2]
+    ],
+    2
+  ),
+  [['flutes', 4]]
+);
+```
+
+`filteredArray([["amy", "beth", "sam"], ["dave", "sean", "peter"]], "peter")` should return `[["amy", "beth", "sam"]]`
+
+```js
+assert.deepEqual(
+  filteredArray(
+    [
+      ['amy', 'beth', 'sam'],
+      ['dave', 'sean', 'peter']
+    ],
+    'peter'
+  ),
+  [['amy', 'beth', 'sam']]
+);
+```
+
+`filteredArray([[3, 2, 3], [1, 6, 3], [3, 13, 26], [19, 3, 9]], 3)` should return `[]`
+
+```js
+assert.deepEqual(
+  filteredArray(
+    [
+      [3, 2, 3],
+      [1, 6, 3],
+      [3, 13, 26],
+      [19, 3, 9]
+    ],
+    3
+  ),
+  []
+);
+```
+
+The `filteredArray` function should utilize a `for` loop
+
+```js
+assert.notStrictEqual(filteredArray.toString().search(/for/), -1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function filteredArray(arr, elem) {
+  let newArr = [];
+  // Only change code below this line
+
+  // Only change code above this line
+  return newArr;
+}
+
+console.log(filteredArray([[3, 2, 3], [1, 6, 3], [3, 13, 26], [19, 3, 9]], 3));
+```
+
+# --solutions--
+
+```js
+function filteredArray(arr, elem) {
+  let newArr = [];
+  for (let i = 0; i<arr.length; i++) {
+    if (arr[i].indexOf(elem) < 0) {
+      newArr.push(arr[i]);
+    }
+  }
+  return newArr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md
new file mode 100644
index 0000000000..5f2b085b6b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/iterate-through-the-keys-of-an-object-with-a-for...in-statement.md
@@ -0,0 +1,138 @@
+---
+id: 587d7b7d367417b2b2512b1d
+title: Iterate Through the Keys of an Object with a for...in Statement
+challengeType: 1
+forumTopicId: 301162
+dashedName: 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 `users` object, this could look like:
+
+```js
+for (let user in users) {
+  console.log(user);
+}
+```
+
+This would log `Alan`, `Jeff`, `Sarah`, and `Ryan` - each value on its own line.
+
+In this statement, we defined a variable `user`, 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.
+
+**NOTE:** Objects do not maintain an ordering to stored keys like arrays do; thus a key's position on an object, or the relative order in which it appears, is irrelevant when referencing or accessing that key.
+
+# --instructions--
+
+We've defined a function `countOnline` which accepts one argument (a users object). Use a <dfn>for...in</dfn> statement within this function to loop through the users object passed into the function and return the number of users whose `online` property is set to `true`. An example of a users object which could be passed to `countOnline` is shown below. Each user will have an `online` property with either a `true` or `false` value.
+
+```js
+{
+  Alan: {
+    online: false
+  },
+  Jeff: {
+    online: true
+  },
+  Sarah: {
+    online: false
+  }
+}
+```
+
+# --hints--
+
+The function `countOnline` should use a `for in` statement to iterate through the object keys of the object passed to it.
+
+```js
+assert(
+  code.match(
+    /for\s*\(\s*(var|let|const)\s+[a-zA-Z_$]\w*\s+in\s+[a-zA-Z_$]\w*\s*\)/
+  )
+);
+```
+
+The function `countOnline` should return `1` when the object `{ Alan: { online: false }, Jeff: { online: true }, Sarah: { online: false } }` is passed to it
+
+```js
+assert(countOnline(usersObj1) === 1);
+```
+
+The function `countOnline` should return `2` when the object `{ Alan: { online: true }, Jeff: { online: false }, Sarah: { online: true } }` is passed to it
+
+```js
+assert(countOnline(usersObj2) === 2);
+```
+
+The function `countOnline` should return `0` when the object `{ Alan: { online: false }, Jeff: { online: false }, Sarah: { online: false } }` is passed to it
+
+```js
+assert(countOnline(usersObj3) === 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const usersObj1 = {
+  Alan: {
+    online: false
+  },
+  Jeff: {
+    online: true
+  },
+  Sarah: {
+    online: false
+  }
+}
+
+const usersObj2 = {
+  Alan: {
+    online: true
+  },
+  Jeff: {
+    online: false
+  },
+  Sarah: {
+    online: true
+  }
+}
+
+
+const usersObj3 = {
+  Alan: {
+    online: false
+  },
+  Jeff: {
+    online: false
+  },
+  Sarah: {
+    online: false
+  }
+}
+```
+
+## --seed-contents--
+
+```js
+function countOnline(usersObj) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function countOnline(usersObj) {
+  let online = 0;
+  for(let user in usersObj){
+    if(usersObj[user].online) {
+      online++;
+    }
+  }
+  return online;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-array-stored-in-an-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-array-stored-in-an-object.md
new file mode 100644
index 0000000000..c3e256070e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-array-stored-in-an-object.md
@@ -0,0 +1,112 @@
+---
+id: 587d7b7d367417b2b2512b1f
+title: Modify an Array Stored in an Object
+challengeType: 1
+forumTopicId: 301163
+dashedName: 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 Data Structures lessons located in the Coding Interview Prep section of 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!
+
+# --instructions--
+
+Take a look at the object we've provided in the code editor. The `user` object contains three keys. The `data` key contains five keys, one of which contains an array of `friends`. From this, you can see how flexible objects are as data structures. We've started writing a function `addFriend`. Finish writing it so that it takes a `user` object and adds the name of the `friend` argument to the array stored in `user.data.friends` and returns that array.
+
+# --hints--
+
+The `user` object should have `name`, `age`, and `data` keys.
+
+```js
+assert('name' in user && 'age' in user && 'data' in user);
+```
+
+The `addFriend` function should accept a `user` object and a `friend` string as arguments and add the friend to the array of `friends` in the `user` object.
+
+```js
+assert(
+  (function () {
+    let L1 = user.data.friends.length;
+    addFriend(user, 'Sean');
+    let L2 = user.data.friends.length;
+    return L2 === L1 + 1;
+  })()
+);
+```
+
+`addFriend(user, "Pete")` should return `["Sam", "Kira", "Tomo", "Pete"]`.
+
+```js
+assert.deepEqual(
+  (function () {
+    delete user.data.friends;
+    user.data.friends = ['Sam', 'Kira', 'Tomo'];
+    return addFriend(user, 'Pete');
+  })(),
+  ['Sam', 'Kira', 'Tomo', 'Pete']
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+
+console.log(addFriend(user, 'Pete'));
+```
+
+# --solutions--
+
+```js
+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) {
+  userObj.data.friends.push(friend);
+  return userObj.data.friends;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-object-nested-within-an-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-object-nested-within-an-object.md
new file mode 100644
index 0000000000..731f95ff6a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/modify-an-object-nested-within-an-object.md
@@ -0,0 +1,101 @@
+---
+id: 587d7b7c367417b2b2512b19
+title: Modify an Object Nested Within an Object
+challengeType: 1
+forumTopicId: 301164
+dashedName: 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:
+
+```js
+let nestedObject = {
+  id: 28802695164,
+  date: 'December 31, 2016',
+  data: {
+    totalUsers: 99,
+    online: 80,
+    onlineStatus: {
+      active: 67,
+      away: 13,
+      busy: 8
+    }
+  }
+};
+```
+
+`nestedObject` has three properties: `id` (value is a number), `date` (value is a string), and `data` (value is an object with its nested structure). While structures can quickly become complex, we can still use the same notations to access the information we need. To assign the value `10` to the `busy` property of the nested `onlineStatus` object, we use dot notation to reference the property:
+
+```js
+nestedObject.data.onlineStatus.busy = 10;
+```
+
+# --instructions--
+
+Here we've defined an object `userActivity`, which includes another object nested within it. Set the value of the `online` key to `45`.
+
+# --hints--
+
+`userActivity` should have `id`, `date` and `data` properties.
+
+```js
+assert(
+  'id' in userActivity && 'date' in userActivity && 'data' in userActivity
+);
+```
+
+`userActivity` should have a `data` key set to an object with keys `totalUsers` and `online`.
+
+```js
+assert('totalUsers' in userActivity.data && 'online' in userActivity.data);
+```
+
+The `online` property nested in the `data` key of `userActivity` should be set to `45`
+
+```js
+assert(userActivity.data.online === 45);
+```
+
+The `online` property should be set using dot or bracket notation.
+
+```js
+assert.strictEqual(code.search(/online: 45/), -1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let userActivity = {
+  id: 23894201352,
+  date: 'January 1, 2017',
+  data: {
+    totalUsers: 51,
+    online: 42
+  }
+};
+
+// Only change code below this line
+
+// Only change code above this line
+
+console.log(userActivity);
+```
+
+# --solutions--
+
+```js
+let userActivity = {
+  id: 23894201352,
+  date: 'January 1, 2017',
+  data: {
+    totalUsers: 51,
+    online: 42
+  }
+};
+
+userActivity.data.online = 45;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-from-an-array-with-pop-and-shift.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-from-an-array-with-pop-and-shift.md
new file mode 100644
index 0000000000..4c19f1418d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-from-an-array-with-pop-and-shift.md
@@ -0,0 +1,86 @@
+---
+id: 587d78b2367417b2b2512b0f
+title: Remove Items from an Array with pop() and shift()
+challengeType: 1
+forumTopicId: 301165
+dashedName: remove-items-from-an-array-with-pop-and-shift
+---
+
+# --description--
+
+Both `push()` and `unshift()` have corresponding methods that are nearly functional opposites: `pop()` and `shift()`. As you may have guessed by now, instead of adding, `pop()` *removes* an element from the end of an array, while `shift()` removes an element from the beginning. The key difference between `pop()` and `shift()` and their cousins `push()` and `unshift()`, 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:
+
+```js
+let greetings = ['whats up?', 'hello', 'see ya!'];
+
+greetings.pop();
+```
+
+`greetings` would have the value `['whats up?', 'hello']`.
+
+```js
+greetings.shift();
+```
+
+`greetings` would have the value `['hello']`.
+
+We can also return the value of the removed element with either method like this:
+
+```js
+let popped = greetings.pop();
+```
+
+`greetings` would have the value `[]`, and `popped` would have the value `hello`.
+
+# --instructions--
+
+We have defined a function, `popShift`, which takes an array as an argument and returns a new array. Modify the function, using `pop()` and `shift()`, 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.
+
+# --hints--
+
+`popShift(["challenge", "is", "not", "complete"])` should return `["challenge", "complete"]`
+
+```js
+assert.deepEqual(popShift(['challenge', 'is', 'not', 'complete']), [
+  'challenge',
+  'complete'
+]);
+```
+
+The `popShift` function should utilize the `pop()` method
+
+```js
+assert.notStrictEqual(popShift.toString().search(/\.pop\(/), -1);
+```
+
+The `popShift` function should utilize the `shift()` method
+
+```js
+assert.notStrictEqual(popShift.toString().search(/\.shift\(/), -1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function popShift(arr) {
+  let popped; // Change this line
+  let shifted; // Change this line
+  return [shifted, popped];
+}
+
+console.log(popShift(['challenge', 'is', 'not', 'complete']));
+```
+
+# --solutions--
+
+```js
+function popShift(arr) {
+  let popped = arr.pop(); // Change this line
+  let shifted = arr.shift(); // Change this line
+  return [shifted, popped];
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-using-splice.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-using-splice.md
new file mode 100644
index 0000000000..d1a989882d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/remove-items-using-splice.md
@@ -0,0 +1,87 @@
+---
+id: 587d78b2367417b2b2512b10
+title: Remove Items Using splice()
+challengeType: 1
+forumTopicId: 301166
+dashedName: remove-items-using-splice
+---
+
+# --description--
+
+Ok, so we've learned how to remove elements from the beginning and end of arrays using `shift()` and `pop()`, 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 `splice()` comes in. `splice()` allows us to do just that: **remove any number of consecutive elements** from anywhere in an array.
+
+`splice()` can take up to 3 parameters, but for now, we'll focus on just the first 2. The first two parameters of `splice()` are integers which represent indexes, or positions, of the array that `splice()` is being called upon. And remember, arrays are *zero-indexed*, so to indicate the first element of an array, we would use `0`. `splice()`'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:
+
+```js
+let array = ['today', 'was', 'not', 'so', 'great'];
+
+array.splice(2, 2);
+```
+
+Here we remove 2 elements, beginning with the third element (at index 2). `array` would have the value `['today', 'was', 'great']`.
+
+`splice()` not only modifies the array it's being called on, but it also returns a new array containing the value of the removed elements:
+
+```js
+let array = ['I', 'am', 'feeling', 'really', 'happy'];
+
+let newArray = array.splice(3, 2);
+```
+
+`newArray` has the value `['really', 'happy']`.
+
+# --instructions--
+
+We've initialized an array `arr`. Use `splice()` to remove elements from `arr`, so that it only contains elements that sum to the value of `10`.
+
+# --hints--
+
+You should not change the original line of `const arr = [2, 4, 5, 1, 7, 5, 2, 1];`.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/constarr=\[2,4,5,1,7,5,2,1\];?/)
+);
+```
+
+`arr` should only contain elements that sum to `10`.
+
+```js
+assert.strictEqual(
+  arr.reduce((a, b) => a + b),
+  10
+);
+```
+
+Your code should utilize the `splice()` method on `arr`.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/arr\.splice\(/));
+```
+
+The splice should only remove elements from `arr` and not add any additional elements to `arr`.
+
+```js
+assert(
+  !__helpers.removeWhiteSpace(code).match(/arr\.splice\(\d+,\d+,\d+.*\)/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const arr = [2, 4, 5, 1, 7, 5, 2, 1];
+// Only change code below this line
+
+// Only change code above this line
+console.log(arr);
+```
+
+# --solutions--
+
+```js
+const arr = [2, 4, 5, 1, 7, 5, 2, 1];
+arr.splice(1, 4);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-an-array-to-store-a-collection-of-data.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-an-array-to-store-a-collection-of-data.md
new file mode 100644
index 0000000000..4fdbdbdb29
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-an-array-to-store-a-collection-of-data.md
@@ -0,0 +1,95 @@
+---
+id: 587d7b7e367417b2b2512b20
+title: Use an Array to Store a Collection of Data
+challengeType: 1
+forumTopicId: 301167
+dashedName: 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:
+
+```js
+let simpleArray = ['one', 2, 'three', true, false, undefined, null];
+console.log(simpleArray.length);
+```
+
+The `console.log` call displays `7`.
+
+All arrays have a length property, which as shown above, can be very easily accessed with the syntax `Array.length`. 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.
+
+```js
+let complexArray = [
+  [
+    {
+      one: 1,
+      two: 2
+    },
+    {
+      three: 3,
+      four: 4
+    }
+  ],
+  [
+    {
+      a: "a",
+      b: "b"
+    },
+    {
+      c: "c",
+      d: "d"
+    }
+  ]
+];
+```
+
+# --instructions--
+
+We have defined a variable called `yourArray`. Complete the statement by assigning an array of at least 5 elements in length to the `yourArray` variable. Your array should contain at least one <dfn>string</dfn>, one <dfn>number</dfn>, and one <dfn>boolean</dfn>.
+
+# --hints--
+
+`yourArray` should be an array.
+
+```js
+assert.strictEqual(Array.isArray(yourArray), true);
+```
+
+`yourArray` should be at least 5 elements long.
+
+```js
+assert.isAtLeast(yourArray.length, 5);
+```
+
+`yourArray` should contain at least one `boolean`.
+
+```js
+assert(yourArray.filter((el) => typeof el === 'boolean').length >= 1);
+```
+
+`yourArray` should contain at least one `number`.
+
+```js
+assert(yourArray.filter((el) => typeof el === 'number').length >= 1);
+```
+
+`yourArray` should contain at least one `string`.
+
+```js
+assert(yourArray.filter((el) => typeof el === 'string').length >= 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let yourArray; // Change this line
+```
+
+# --solutions--
+
+```js
+let yourArray = ['a string', 100, true, ['one', 2], 'another string'];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-the-delete-keyword-to-remove-object-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-the-delete-keyword-to-remove-object-properties.md
new file mode 100644
index 0000000000..575e41f90a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-data-structures/use-the-delete-keyword-to-remove-object-properties.md
@@ -0,0 +1,86 @@
+---
+id: 587d7b7c367417b2b2512b1b
+title: Use the delete Keyword to Remove Object Properties
+challengeType: 1
+forumTopicId: 301168
+dashedName: 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, ***and***, 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 *remove* a key-value pair from an object.
+
+Let's revisit our `foods` object example one last time. If we wanted to remove the `apples` key, we can remove it by using the `delete` keyword like this:
+
+```js
+delete foods.apples;
+```
+
+# --instructions--
+
+Use the delete keyword to remove the `oranges`, `plums`, and `strawberries` keys from the `foods` object.
+
+# --hints--
+
+The `foods` object should only have three keys: `apples`, `grapes`, and `bananas`.
+
+```js
+assert(
+  !foods.hasOwnProperty('oranges') &&
+    !foods.hasOwnProperty('plums') &&
+    !foods.hasOwnProperty('strawberries') &&
+    Object.keys(foods).length === 3
+);
+```
+
+The `oranges`, `plums`, and `strawberries` keys should be removed using `delete`.
+
+```js
+assert(
+  code.search(/oranges:/) !== -1 &&
+    code.search(/plums:/) !== -1 &&
+    code.search(/strawberries:/) !== -1
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28,
+  bananas: 13,
+  grapes: 35,
+  strawberries: 27
+};
+
+// Only change code below this line
+
+// Only change code above this line
+
+console.log(foods);
+```
+
+# --solutions--
+
+```js
+let foods = {
+  apples: 25,
+  oranges: 32,
+  plums: 28,
+  bananas: 13,
+  grapes: 35,
+  strawberries: 27
+};
+
+delete foods.oranges;
+delete foods.plums;
+delete foods.strawberries;
+
+console.log(foods);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-001.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-001.md
new file mode 100644
index 0000000000..a50816dd7c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-001.md
@@ -0,0 +1,113 @@
+---
+id: 5d5a813321b9e3db6c106a46
+title: Part 1
+challengeType: 0
+dashedName: part-1
+---
+
+# --description--
+
+To keep track of the player's experience points, we've declared a variable called `xp` and assigned it the starting value of 0.
+
+Create another variable to keep track of health and start it at 100.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(health === 100);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+var xp = 0;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-002.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-002.md
new file mode 100644
index 0000000000..0127056186
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-002.md
@@ -0,0 +1,113 @@
+---
+id: 5d5a8dd907f328a948d398ce
+title: Part 2
+challengeType: 0
+dashedName: part-2
+---
+
+# --description--
+
+Create a variable called `gold` and set it to the value 50.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(gold === 50);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+var gold = 50;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-003.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-003.md
new file mode 100644
index 0000000000..5e416ceb17
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-003.md
@@ -0,0 +1,117 @@
+---
+id: 5d5a8f1c07f328a948d398cf
+title: Part 3
+challengeType: 0
+dashedName: part-3
+---
+
+# --description--
+
+Create a variable called `currentWeapon` and set it to 0. When a name has two words, the convention is to use so-called "lowerCamelCase". The first word is all lowercase, and then the first letter of every preceding word is uppercased.
+
+When a name has two words, the convention is to use so-called "lowerCamelCase". The variable name should look like this: currentWeapon.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(currentWeapon === 0);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+var gold = 50;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+var gold = 50;
+var currentWeapon = 0;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-004.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-004.md
new file mode 100644
index 0000000000..01e3ae0136
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-004.md
@@ -0,0 +1,123 @@
+---
+id: 5d5a903507f328a948d398d0
+title: Part 4
+challengeType: 0
+dashedName: part-4
+---
+
+# --description--
+
+We've been declaring variables with the `var` keyword. However, in modern JavaScript, it's better to use `let` instead of `var` because it fixes a number of unusual behaviors with `var` that make it difficult to reason about.
+
+Change every `var` to `let`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /let\s+xp\s*\=\s*0\;?/.test(code) &&
+    /let\s+health\s*\=\s*100\;?/.test(code) &&
+    /let\s+gold\s*\=\s*50\;?/.test(code) &&
+    /let\s+currentWeapon\s*\=\s*0\;?/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+var xp = 0;
+var health = 100;
+var gold = 50;
+var currentWeapon = 0;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-005.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-005.md
new file mode 100644
index 0000000000..952c282390
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-005.md
@@ -0,0 +1,119 @@
+---
+id: 5d5aaa5807f328a948d398d1
+title: Part 5
+challengeType: 0
+dashedName: part-5
+---
+
+# --description--
+
+Now you will declare a variable without initializing it.
+
+Using the `let` keyword, declare a variable called `fighting` but don't set it equal to anything. Just end the line with a semicolon right after the variable name.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/let\s+fighting\s*;?/.test(code) && fighting === undefined);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-006.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-006.md
new file mode 100644
index 0000000000..1ee50c18f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-006.md
@@ -0,0 +1,120 @@
+---
+id: 5d5aab5d07f328a948d398d2
+title: Part 6
+challengeType: 0
+dashedName: part-6
+---
+
+# --description--
+
+Declare variables named `monsterHealth` and `inventory` without initializing them.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(monsterHealth === undefined && inventory === undefined);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-007.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-007.md
new file mode 100644
index 0000000000..2053d6cc09
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-007.md
@@ -0,0 +1,124 @@
+---
+id: 5d5aac9c07f328a948d398d3
+title: Part 7
+challengeType: 0
+dashedName: part-7
+---
+
+# --description--
+
+Now set the inventory to equal the string "stick".
+
+Strings must be surrounded with double quotes `"`, single quotes `'`, or backticks `` ` ``.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(inventory === 'stick');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = "stick";
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-008.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-008.md
new file mode 100644
index 0000000000..7a4a0040ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-008.md
@@ -0,0 +1,132 @@
+---
+id: 5d5aad2307f328a948d398d4
+title: Part 8
+challengeType: 0
+dashedName: part-8
+---
+
+# --description--
+
+Since the inventory can store multiple items, change the value of `inventory` to an array with the items stick, dagger, and sword.
+
+Here is an example of a variable sandwich that equals a three-item array:
+
+```js
+let sandwich = ["peanut butter", "jelly", "bread"];
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  inventory.includes('stick') &&
+    inventory.includes('dagger') &&
+    inventory.includes('sword')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = "stick";
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick", "dagger", "sword"];
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-009.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-009.md
new file mode 100644
index 0000000000..95c7682998
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-009.md
@@ -0,0 +1,122 @@
+---
+id: 5d5aae1207f328a948d398d5
+title: Part 9
+challengeType: 0
+dashedName: part-9
+---
+
+# --description--
+
+For now, let's start the player with just the stick. Delete the dagger and sword items in the array. More items will be added to the array during game play.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(inventory[0] === 'stick' && inventory.length === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick", "dagger", "sword"];
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-010.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-010.md
new file mode 100644
index 0000000000..fe8783aa45
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-010.md
@@ -0,0 +1,131 @@
+---
+id: 5d5ab57f07f328a948d398d6
+title: Part 10
+challengeType: 0
+dashedName: part-10
+---
+
+# --description--
+
+In order to update HTML elements on the page, you need to get references to them in your JavaScript code. The code `let el = document.querySelector("#el");` gets a reference to an HTML element with an `id` of `el` and assigns it to the variable `el`.
+
+Get a reference to the HTML element with the `id` of `button1` and assign it to a variable with the name `button1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /let\s+button1\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#button1\s*[\'\"\`]\s*\);?/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+let button1 = document.querySelector('#button1');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-011.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-011.md
new file mode 100644
index 0000000000..33b03c9c92
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-011.md
@@ -0,0 +1,126 @@
+---
+id: 5d5b66ce07f328a948d398d7
+title: Part 11
+challengeType: 0
+dashedName: part-11
+---
+
+# --description--
+
+You can also declare variables with the `const` key word. Since `button1` is a constant that will never change, switch the `let` keyword that declares the variable to `const`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/const\s+button1\s*/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+let button1 = document.querySelector('#button1');
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-012.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-012.md
new file mode 100644
index 0000000000..9f6aba13f8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-012.md
@@ -0,0 +1,165 @@
+---
+id: 5d64cf8f853b56a21cd16319
+title: Part 12
+challengeType: 0
+dashedName: part-12
+---
+
+# --description--
+
+Here are the ids of the other HTML elements that we want a reference to in the JavaScript code: `button2`, `button3`, `text`, `xpText`, `healthText`, `goldText`, `monsterStats`, `monsterNameText`, `monsterHealthText`.
+
+Just like you did with `storeButton`, create variables and set them equal to the element references.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s+button2\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#button2\s*[\'\"\`]\s*\);?/.test(
+    code
+  ) &&
+    /const\s+button3\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#button3\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+text\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#text\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+xpText\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#xpText\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+healthText\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#healthText\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+goldText\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#goldText\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+monsterStats\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#monsterStats\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+monsterNameText|monsterName\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#monsterName\s*[\'\"\`]\s*\);?/.test(
+      code
+    ) &&
+    /const\s+monsterHealthText|monsterHealth\s*\=\s*document.querySelector\(\s*[\'\"\`]\s*\#monsterHealth\s*[\'\"\`]\s*\);?/.test(
+      code
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-013.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-013.md
new file mode 100644
index 0000000000..fa6cc172bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-013.md
@@ -0,0 +1,148 @@
+---
+id: 5d651ee1ee291f75bbd738ee
+title: Part 13
+challengeType: 0
+dashedName: part-13
+---
+
+# --description--
+
+Make a comment to describe what the next few lines of code will do. Comments can be written with either two forward-slashes `//` or with a multi-line sequence `/* */`. For example, here is a single line comment that says "hello world": `// hello world`.
+
+Write a single line comment that says "initialize buttons".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/\/\/\s*[iI]nitialize buttons/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-014.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-014.md
new file mode 100644
index 0000000000..5e5a71ca5c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-014.md
@@ -0,0 +1,150 @@
+---
+id: 5d652e5a6e6bf7a6a27aa80a
+title: Part 14
+challengeType: 0
+dashedName: part-14
+---
+
+# --description--
+
+Designate what the first button in the HTML does by setting the `onclick` property of `button1` to the function name `goStore`. You will create the `goStore` function later. For example, in `button.onclick = openProgram;`, the `onclick` property of `button` is set to `openProgram`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/button1\.onclick\s*\=\s*goStore\;?/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-015.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-015.md
new file mode 100644
index 0000000000..ef4c717e72
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-015.md
@@ -0,0 +1,155 @@
+---
+id: 5d653b2d6e6bf7a6a27aa80b
+title: Part 15
+challengeType: 0
+dashedName: part-15
+---
+
+# --description--
+
+Now set the `onclick` property of `button2` and `button3`. The second button should be set to `goCave` and the third button should be set to `fightDragon`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /button2\.onclick\s*\=\s*goCave\;?/.test(code) &&
+    /button3\.onclick\s*\=\s*fightDragon\;?/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-016.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-016.md
new file mode 100644
index 0000000000..a3b657d461
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-016.md
@@ -0,0 +1,162 @@
+---
+id: 5d653c4d6e6bf7a6a27aa80c
+title: Part 16
+challengeType: 0
+dashedName: part-16
+---
+
+# --description--
+
+Create the `goStore` function to hold the code that runs whenever the player goes to the store. Here is an example of an empty function called `functionName` (Note the opening curly brace at the end of the first line and the closing curly brace on the second line):
+
+```js
+function functionName() {
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof goStore === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-017.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-017.md
new file mode 100644
index 0000000000..d5b5e39ed6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-017.md
@@ -0,0 +1,171 @@
+---
+id: 5d6542826e6bf7a6a27aa80d
+title: Part 17
+challengeType: 0
+dashedName: part-17
+---
+
+# --description--
+
+For now, make the `goStore` function output the message "Going to store." to the web console. For example, here is a function that outputs the message "Hello World" to the web console (Note that code inside a function should be indented):
+
+```js
+function functionName() {
+  console.log("Hello World");
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  goStore
+    .toString()
+    .match(/console\.log\(\s*[\"\'\`]Going to store\.?[\"\'\`]\s*\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-018.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-018.md
new file mode 100644
index 0000000000..a889d272bc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-018.md
@@ -0,0 +1,170 @@
+---
+id: 5d65f2c62012114c7d7c57eb
+title: Part 18
+challengeType: 0
+dashedName: part-18
+---
+
+# --description--
+
+Similar to the `goStore` function, create a `goCave` function that prints "Going to cave." to the console.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  goCave
+    .toString()
+    .match(/console\.log\(\s*[\"\'\`]Going to cave\.?[\"\'\`]\s*\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.")
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.")
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-019.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-019.md
new file mode 100644
index 0000000000..57ab5c69cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-019.md
@@ -0,0 +1,180 @@
+---
+id: 5d65f4cd2012114c7d7c57ec
+title: Part 19
+challengeType: 0
+dashedName: part-19
+---
+
+# --description--
+
+Also, create a `fightDragon` function that prints "Fighting dragon." to the console.
+
+When you are finished, you can test out your program in the browser.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  fightDragon
+    .toString()
+    .match(/console\.log\(\s*[\"\'\`]Fighting dragon\.?[\"\'\`]\s*\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.")
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.")
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-020.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-020.md
new file mode 100644
index 0000000000..ad137d4786
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-020.md
@@ -0,0 +1,185 @@
+---
+id: 5d65f6392012114c7d7c57ed
+title: Part 20
+challengeType: 0
+dashedName: part-20
+---
+
+# --description--
+
+When a player clicks the 'Go to store' button, the buttons and text in the game should change. Remove the code inside the `goStore` function. Add a new line of code inside the function that updates the text of `button1` so that it says "Buy 10 health (10 gold)".
+
+For example, this code updates the text of `button` to say "Click Me": `button.innerText = "Click Me";`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    goStore();
+    return button1.innerText === 'Buy 10 health (10 gold)';
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  console.log("Going to store.");
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-021.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-021.md
new file mode 100644
index 0000000000..a2672d2934
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-021.md
@@ -0,0 +1,189 @@
+---
+id: 5d6606634bab337fbb433884
+title: Part 21
+challengeType: 0
+dashedName: part-21
+---
+
+# --description--
+
+After the line that updates `button1`, update the text of `button2` to say "Buy weapon (30 gold)" and update the text of `button3` to say "Go to town square".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    goStore();
+    return (
+      button1.innerText === 'Buy 10 health (10 gold)' &&
+      button2.innerText === 'Buy weapon (30 gold)' &&
+      button3.innerText === 'Go to town square'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-022.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-022.md
new file mode 100644
index 0000000000..6fd39fc853
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-022.md
@@ -0,0 +1,189 @@
+---
+id: 5d66093c4bab337fbb433885
+title: Part 22
+challengeType: 0
+dashedName: part-22
+---
+
+# --description--
+
+Now that the text on the buttons have changed, the `onclick` properties on the buttons should change. Inside the goStore function, update the `onclick` property of all three buttons. The new functions should be `buyHealth`, `buyWeapon`, and `goTown`. If you have trouble, look at how the buttons were initialized.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  goStore.toString().match(/button1\.onclick\s*\=\s*buyHealth\;?/) &&
+    goStore.toString().match(/button2\.onclick\s*\=\s*buyWeapon\;?/) &&
+    goStore.toString().match(/button3\.onclick\s*\=\s*goTown\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-023.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-023.md
new file mode 100644
index 0000000000..4a6293348b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-023.md
@@ -0,0 +1,193 @@
+---
+id: 5d660a32e0696bdec46938d5
+title: Part 23
+challengeType: 0
+dashedName: part-23
+---
+
+# --description--
+
+Right after the `onclick` properties are updated, change the `innerText` property of `text` to "You enter the store."
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  goStore
+    .toString()
+    .match(/text\.innerText\s*\=\s*[\'\"\`]You enter the store\.?[\'\"\`]/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-024.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-024.md
new file mode 100644
index 0000000000..abdd465afc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-024.md
@@ -0,0 +1,203 @@
+---
+id: 5d6616d8e0696bdec46938d6
+title: Part 24
+challengeType: 0
+dashedName: part-24
+---
+
+# --description--
+
+At the end of the current code, add three new empty functions called `buyHealth`, `buyWeapon`, and `goTown`. After this step, you can test out the game by clicking the "Go to store" button.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  typeof buyHealth === 'function' &&
+    typeof buyWeapon === 'function' &&
+    typeof goTown === 'function'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+function goTown() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-025.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-025.md
new file mode 100644
index 0000000000..a0a3a5a021
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-025.md
@@ -0,0 +1,228 @@
+---
+id: 5d661814e0696bdec46938d7
+title: Part 25
+challengeType: 0
+dashedName: part-25
+---
+
+# --description--
+
+Move the `goTown` function to above the `goStore` function. Then, copy and paste the contents of the `goStore` function into the `goTown` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    goTown();
+    return (
+      button1.innerText === 'Buy 10 health (10 gold)' &&
+      button2.innerText === 'Buy weapon (30 gold)' &&
+      button3.innerText === 'Go to town square' &&
+      text.innerText === 'You enter the store.' &&
+      goTown.toString().match(/button1\.onclick\s*\=\s*buyHealth\;?/) &&
+      goTown.toString().match(/button2\.onclick\s*\=\s*buyWeapon\;?/) &&
+      goTown.toString().match(/button3\.onclick\s*\=\s*goTown\;?/)
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+function goTown() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goTown() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-026.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-026.md
new file mode 100644
index 0000000000..ee955fc993
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-026.md
@@ -0,0 +1,230 @@
+---
+id: 5d66198de0696bdec46938d8
+title: Part 26
+challengeType: 0
+dashedName: part-26
+---
+
+# --description--
+
+Add double quote marks around the word "Store" in the line "You see a sign that says Store." Before each quotation mark add a `\` to signal that the following quote is not the end of the string, but should instead appear inside the string. This is called escaping.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    goTown();
+    return (
+      text.innerText ===
+      'You are in the town square. You see a sign that says "Store".'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says Store.";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-027.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-027.md
new file mode 100644
index 0000000000..adfd7d0a56
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-027.md
@@ -0,0 +1,235 @@
+---
+id: 5d661bc6e0696bdec46938d9
+title: Part 27
+challengeType: 0
+dashedName: part-27
+---
+
+# --description--
+
+There is repetition in the `goTown` and `goStore` functions. When you have repetition in code, it is a sign that you need a new function.
+
+Above the `goTown` function, create an empty function called `update`. This time the function should take a parameter named `location` so data can be passed into the function when it is called.
+
+Here is an example of a function named `testFun` that accepts a parameter named `param`:
+
+```js
+function testFun(param) {
+  console.log(param);
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(update.toString().match(/function update\(\s*location\)\s*\{\s*\}/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-028.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-028.md
new file mode 100644
index 0000000000..ba513bd6d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-028.md
@@ -0,0 +1,230 @@
+---
+id: 5d6653d5e0696bdec46938da
+title: Part 28
+challengeType: 0
+dashedName: part-28
+---
+
+# --description--
+
+Below the list of `const` variables, create a new `const` variable called `locations`. Set it to equal an empty array. This will be used to store all the data for the locations in the game.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(Array.isArray(locations) && locations.length === 0);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-029.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-029.md
new file mode 100644
index 0000000000..6944af320f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-029.md
@@ -0,0 +1,236 @@
+---
+id: 5d665983e0696bdec46938dc
+title: Part 29
+challengeType: 0
+dashedName: part-29
+---
+
+# --description--
+
+Arrays can store any data type, including objects. Objects are similar to arrays, except that instead of using indexes to access and modify their data, you access the data in objects through what are called properties.
+
+Inside the `locations` array add an empty object using curly braces.
+
+Here is an example of an array named `arr` with an empty object inside: `const arr = [{}];`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(JSON.stringify(locations), `[{}]`);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [{}];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-030.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-030.md
new file mode 100644
index 0000000000..f9c6d55fd8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-030.md
@@ -0,0 +1,246 @@
+---
+id: 5d674fd9e0696bdec46938dd
+title: Part 30
+challengeType: 0
+dashedName: part-30
+---
+
+# --description--
+
+Inside the object you just added, create a property called `name` with the value of "town square".
+
+For example, here is an example of an array with an object inside that has a property called `name` with a value of "Quincy Larson" (new lines are used only for the purpose of making the code more readable):
+
+```js
+const arr = [
+  {
+    name: "Quincy Larson"
+  }
+]
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(locations[0].name === 'town square');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [{}];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-031.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-031.md
new file mode 100644
index 0000000000..ac1796c49b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-031.md
@@ -0,0 +1,252 @@
+---
+id: 5d6752e3e0696bdec46938de
+title: Part 31
+challengeType: 0
+dashedName: part-31
+---
+
+# --description--
+
+After the `name` property put a comma. On the next line add a property named `"button text"` that has a value of an empty array. Since the property name has more than one word, there must be quotes around it.
+
+Here is an example:
+
+```js
+const arr = [
+  {
+    name: "Quincy Larson",
+    "favorite colors": []
+  }
+]
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[0]['button text'], []);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": []
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-032.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-032.md
new file mode 100644
index 0000000000..d358864c5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-032.md
@@ -0,0 +1,248 @@
+---
+id: 5d6755fce0696bdec46938df
+title: Part 32
+challengeType: 0
+dashedName: part-32
+---
+
+# --description--
+
+Inside the `"button text"` array, add three string elements. Use the three stings assigned to the buttons inside the `goTown` function.
+
+Here is an example array with three strings: `const arr = ["one", "two", "three"];`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[0]['button text'], [
+  'Go to store',
+  'Go to cave',
+  'Fight dragon'
+]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": []
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"]
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-033.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-033.md
new file mode 100644
index 0000000000..7604f0b7a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-033.md
@@ -0,0 +1,247 @@
+---
+id: 5d675726e0696bdec46938e0
+title: Part 33
+challengeType: 0
+dashedName: part-33
+---
+
+# --description--
+
+Add another property in the object with the name `"button functions"`. The value should be an array containing the three `onclick` functions from the `goTown` function. It should look like this: `[goStore, goCave, fightDragon]`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[0]['button functions'], [
+  goStore,
+  goCave,
+  fightDragon
+]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"]
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon]
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-034.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-034.md
new file mode 100644
index 0000000000..53e94ec05c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-034.md
@@ -0,0 +1,248 @@
+---
+id: 5d678366e0696bdec46938e1
+title: Part 34
+challengeType: 0
+dashedName: part-34
+---
+
+# --description--
+
+Add one final property to the object named `text`. The value should be the final text from the `goTown` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  locations[0].text ===
+    'You are in the town square. You see a sign that says "Store."'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon]
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-035.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-035.md
new file mode 100644
index 0000000000..6e9549b0e8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-035.md
@@ -0,0 +1,261 @@
+---
+id: 5d67845ee0696bdec46938e2
+title: Part 35
+challengeType: 0
+dashedName: part-35
+---
+
+# --description--
+
+The `locations` array currently has one element which is an object. Within the array, and after the object's final curly brace, add a comma. On the next line within the array, add another object with all the same properties as the first object. Keep the property names the same on the second object, but change all the property values to the information from the `goStore` function. Also, set the `name` property to `store`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[1], {
+  name: 'store',
+  'button text': [
+    'Buy 10 health (10 gold)',
+    'Buy weapon (30 gold)',
+    'Go to town square'
+  ],
+  'button functions': [buyHealth, buyWeapon, goTown],
+  text: 'You enter the store.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-036.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-036.md
new file mode 100644
index 0000000000..76823a417f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-036.md
@@ -0,0 +1,267 @@
+---
+id: 5d67880ee0696bdec46938e3
+title: Part 36
+challengeType: 0
+dashedName: part-36
+---
+
+# --description--
+
+Now we are can consolidate the code inside the `goTown` and `goStore` functions. Copy the code inside the `goTown` function and paste it in the `update` function. Then delete all the code inside the `goTown` and `goStore` functions.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    update();
+    return (
+      goTown.toString() === 'function goTown() {}' &&
+      goStore.toString() === 'function goStore() {}' &&
+      button1.innerText === 'Go to store' &&
+      button2.innerText === 'Go to cave' &&
+      button3.innerText === 'Fight dragon' &&
+      text.innerText ===
+        'You are in the town square. You see a sign that says "Store".' &&
+      update.toString().match(/button1\.onclick\s*\=\s*goStore\;?/) &&
+      update.toString().match(/button2\.onclick\s*\=\s*goCave\;?/) &&
+      update.toString().match(/button3\.onclick\s*\=\s*fightDragon\;?/)
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+}
+
+function goTown() {
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goStore() {
+  button1.innerText = "Buy 10 health (10 gold)";
+  button2.innerText = "Buy weapon (30 gold)";
+  button3.innerText = "Go to town square";
+  button1.onclick = buyHealth;
+  button2.onclick = buyWeapon;
+  button3.onclick = goTown;
+  text.innerText = "You enter the store.";
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-037.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-037.md
new file mode 100644
index 0000000000..996d05d8b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-037.md
@@ -0,0 +1,247 @@
+---
+id: 5d67ad3de0696bdec46938e4
+title: Part 37
+challengeType: 0
+dashedName: part-37
+---
+
+# --description--
+
+Instead of assigning the `innerText` and `onClick` properties to specific strings and functions like it does now, the `update` function will use data from the `location` that is passed into it. First, data needs to be passed into the `update` function. Inside the `goTown` function, call the `update` function.
+
+Here is how you would call a function named `exampleFunction`: `exampleFunction();`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goTown.toString().match(/update\(\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update();
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-038.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-038.md
new file mode 100644
index 0000000000..8b8100d9c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-038.md
@@ -0,0 +1,248 @@
+---
+id: 5d67ae95e0696bdec46938e5
+title: Part 38
+challengeType: 0
+dashedName: part-38
+---
+
+# --description--
+
+Now change the code you just wrote to call the `update` function so the `locations` array is passed in as an argument.
+
+Here is how you would call a function named `exampleFunction` with an argument called `arg`: `exampleFunction(arg);`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goTown.toString().match(/update\(locations\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update();
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-039.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-039.md
new file mode 100644
index 0000000000..63f30c6b59
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-039.md
@@ -0,0 +1,246 @@
+---
+id: 5d67b284e0696bdec46938e6
+title: Part 39
+challengeType: 0
+dashedName: part-39
+---
+
+# --description--
+
+The `locations` array contains two locations: the town square and store. Currently the entire array with both locations is being passed in to the update function. Pass in only the first element of the locations array by adding `[0]` at the end of the name of the array. For example, `exampleFunction(arg[0]);`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goTown.toString().match(/update\(locations\[0\]\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-040.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-040.md
new file mode 100644
index 0000000000..c8e8a9857d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-040.md
@@ -0,0 +1,252 @@
+---
+id: 5d67b945e0696bdec46938e7
+title: Part 40
+challengeType: 0
+dashedName: part-40
+---
+
+# --description--
+
+Now that the `goTown` function calls the `update` function with the first element of the `locations` array, it is time to use that location information to update the `innerText` and `onclick` properties.
+
+Inside the `update` function, change `button1.innerText` to equal `location["button text"]`. That line gets the `"button text"` property of the `location` that was passed into the `update` function\`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  update
+    .toString()
+    .match(/button1\.innerText\s*\=\s*location\[[\'\"\`]button text[\'\"\`]\]/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = "Go to store";
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"];
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-041.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-041.md
new file mode 100644
index 0000000000..bba6e8fafc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-041.md
@@ -0,0 +1,252 @@
+---
+id: 5d68c3b1e0696bdec46938e8
+title: Part 41
+challengeType: 0
+dashedName: part-41
+---
+
+# --description--
+
+`location["button text"]` is an array with three elements. Use only the first element of the array by adding `[0]` at the end.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  update
+    .toString()
+    .match(
+      /button1\.innerText\s*\=\s*location\[[\'\"\`]button text[\'\"\`]\]\[0\]/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"];
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-042.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-042.md
new file mode 100644
index 0000000000..5c6517b2b6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-042.md
@@ -0,0 +1,257 @@
+---
+id: 5d68c51ee0696bdec46938e9
+title: Part 42
+challengeType: 0
+dashedName: part-42
+---
+
+# --description--
+
+Now update the `innerText` of the other two buttons. They should be set to equal the same thing as the first button, except the number inside the brackets should be 1 for the second button and 2 for the third button.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  update
+    .toString()
+    .match(
+      /button2\.innerText\s*\=\s*location\[[\'\"\`]button text[\'\"\`]\]\[1\]/
+    ) &&
+    update
+      .toString()
+      .match(
+        /button3\.innerText\s*\=\s*location\[[\'\"\`]button text[\'\"\`]\]\[2\]/
+      )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = "Go to cave";
+  button3.innerText = "Fight dragon";
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-043.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-043.md
new file mode 100644
index 0000000000..009d874188
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-043.md
@@ -0,0 +1,262 @@
+---
+id: 5d68c5efe0696bdec46938ea
+title: Part 43
+challengeType: 0
+dashedName: part-43
+---
+
+# --description--
+
+Now update the three `onclick` properties. These will look very similar to the `innerText` properties, except instead of using the `"button text"` part of the `location`, use `"button functions"`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  update
+    .toString()
+    .match(
+      /button1\.onclick\s*\=\s*location\[[\'\"\`]button functions[\'\"\`]\]\[0\]/
+    ) &&
+    update
+      .toString()
+      .match(
+        /button2\.onclick\s*\=\s*location\[[\'\"\`]button functions[\'\"\`]\]\[1\]/
+      ) &&
+    update
+      .toString()
+      .match(
+        /button3\.onclick\s*\=\s*location\[[\'\"\`]button functions[\'\"\`]\]\[2\]/
+      )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = goStore;
+  button2.onclick = goCave;
+  button3.onclick = fightDragon;
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-044.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-044.md
new file mode 100644
index 0000000000..491a31d4c1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-044.md
@@ -0,0 +1,248 @@
+---
+id: 5d68c758e0696bdec46938eb
+title: Part 44
+challengeType: 0
+dashedName: part-44
+---
+
+# --description--
+
+Finally, update `text.innerText` to equal the `text` from the location object.
+
+So far we have been accessing properties of the location object using bracket notation. This time use dot notation. Here is how to access a `name` property of an object called `obj` using dot notation: `obj.name`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(update.toString().match(/text\.innerText\s*\=\s*location\.text\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = "You are in the town square. You see a sign that says \"Store\".";
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-045.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-045.md
new file mode 100644
index 0000000000..cfcc6110ac
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-045.md
@@ -0,0 +1,247 @@
+---
+id: 5d68c947e0696bdec46938ec
+title: Part 45
+challengeType: 0
+dashedName: part-45
+---
+
+# --description--
+
+Now update the `goStore` function. The code should look just like the code inside the `goTown` function, except the number 0 should be changed to 1. After this step would be a good time to try out the game so far. You should be able to move between the store and the town square.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goStore.toString().match(/update\(locations\[1\]\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-046.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-046.md
new file mode 100644
index 0000000000..8880e9dbae
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-046.md
@@ -0,0 +1,266 @@
+---
+id: 5d68ca40e0696bdec46938ed
+title: Part 46
+challengeType: 0
+dashedName: part-46
+---
+
+# --description--
+
+Add a third object in the `locations` array with the same properties as the other two objects.
+
+Set `name` to "cave". Set the elements in the `"button text"` array to \["Fight slime", "Fight fanged beast", and "Go to town square". Set te elements in the `"button functions"` array to be "fightSlime", "fightBeast", and "goTown". Set the value of the `text` property to "You enter the cave. You see some monsters.".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[2], {
+  name: 'cave',
+  'button text': ['Fight slime', 'Fight fanged beast', 'Go to town square'],
+  'button functions': [fightSlime, fightBeast, goTown],
+  text: 'You enter the cave. You see some monsters.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+// Need to initialize for test
+function fightSlime() {}
+function fightBeast() {}
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-047.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-047.md
new file mode 100644
index 0000000000..f80a1a077e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-047.md
@@ -0,0 +1,265 @@
+---
+id: 5d68d3f7e0696bdec46938ee
+title: Part 47
+challengeType: 0
+dashedName: part-47
+---
+
+# --description--
+
+Now update the `goCave` function using the pattern from `goTown` and `goCave`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goCave.toString().match(/update\(locations\[2\]\)\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+// Need to initialize for test
+function fightSlime() {}
+function fightBeast() {}
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  console.log("Going to cave.");
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-048.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-048.md
new file mode 100644
index 0000000000..fe48b13995
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-048.md
@@ -0,0 +1,266 @@
+---
+id: 5d68d4fde0696bdec46938ef
+title: Part 48
+challengeType: 0
+dashedName: part-48
+---
+
+# --description--
+
+Create two more empty functions: `fightSlime` and `fightBeast`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof fightSlime === 'function' && typeof fightBeast === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-049.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-049.md
new file mode 100644
index 0000000000..ff7dfebe58
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-049.md
@@ -0,0 +1,275 @@
+---
+id: 5d68d631e0696bdec46938f0
+title: Part 49
+challengeType: 0
+dashedName: part-49
+---
+
+# --description--
+
+Now that the store and cave locations are complete, we'll code the actions at those locations. Inside the `buyHealth` function, set `gold` to equal `gold` minus 10.
+
+For example here is how you would set set `num` to equal 5 less than `num`: `num = num - 5;`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+buyHealth(), assert(gold === 40);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold = gold - 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-050.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-050.md
new file mode 100644
index 0000000000..d933dc407a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-050.md
@@ -0,0 +1,275 @@
+---
+id: 5d68dbf7e0696bdec46938f1
+title: Part 50
+challengeType: 0
+dashedName: part-50
+---
+
+# --description--
+
+After gold is subtracted, add ten to health.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+buyHealth(), assert(gold === 40 && health === 110);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold = gold - 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold = gold - 10;
+  health = health + 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-051.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-051.md
new file mode 100644
index 0000000000..5fcb7a9139
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-051.md
@@ -0,0 +1,281 @@
+---
+id: 5d6904b6e0696bdec46938f2
+title: Part 51
+challengeType: 0
+dashedName: part-51
+---
+
+# --description--
+
+There is a shorthand way to add or subtract from a variable called compound assignment. The long way to add to a variable is `num = num + 5`. The shorthand way is `num += 5`. It works the same way with subtraction.
+
+Update both lines inside the `buyHealth` function to use compound assignment.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyHealth.toString().match(/gold\s*\-\=\s*10\;?/) &&
+    buyHealth.toString().match(/health\s*\+\=\s*10\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold = gold - 10;
+  health = health + 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold -= 10;
+  health += 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-052.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-052.md
new file mode 100644
index 0000000000..ea3cf82bfa
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-052.md
@@ -0,0 +1,281 @@
+---
+id: 5d6905ace0696bdec46938f3
+title: Part 52
+challengeType: 0
+dashedName: part-52
+---
+
+# --description--
+
+Now that the gold and health variables have been updated, we need to update the values displayed on the screen. Inside the `buyHealth` function, add the line `goldText.innerText = gold;`. Then use the same pattern to update `healthText`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyHealth.toString().match(/goldText\.innerText\s*\=\s*gold\;?/) &&
+    buyHealth.toString().match(/healthText.innerText\s*\=\s*health\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold -= 10;
+  health += 10;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold -= 10;
+  health += 10;
+  goldText.innerText = gold;
+  healthText.innerText = health;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-053.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-053.md
new file mode 100644
index 0000000000..b9488436a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-053.md
@@ -0,0 +1,302 @@
+---
+id: 5d6f6bfc7c812010bf3327cc
+title: Part 53
+challengeType: 0
+dashedName: part-53
+---
+
+# --description--
+
+What if the player doesn't have enough gold to buy health? Put all the code in the `buyHealth` function inside an `if` statement. Here is an example of an `if` statement inside a function:
+
+```js
+function checkMoney() {
+  if (condition) {
+    console.log("You have money!");
+  }
+}
+```
+
+Note: For now you should use the word "condition" inside the `if` statement but we'll be changing that next.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyHealth
+    .toString()
+    .match(
+      /if\s*\(\s*condition\s*\)\s*\{\s*(gold|health|goldText|healthText)/
+    ) &&
+    buyHealth.toString().match(/gold\s*\-\=\s*10\;?/) &&
+    buyHealth.toString().match(/health\s*\+\=\s*10\;?/) &&
+    buyHealth.toString().match(/goldText\.innerText\s*\=\s*gold\;?/) &&
+    buyHealth.toString().match(/healthText\.innerText\s*\=\s*health\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  gold -= 10;
+  health += 10;
+  goldText.innerText = gold;
+  healthText.innerText = health;
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (condition) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-054.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-054.md
new file mode 100644
index 0000000000..e28f8fba0a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-054.md
@@ -0,0 +1,292 @@
+---
+id: 5d6f6e3c7c812010bf3327cd
+title: Part 54
+challengeType: 0
+dashedName: part-54
+---
+
+# --description--
+
+The word "condition" inside the if statement is just a placeholder. Change the condition to check if the amount of gold the player has is greater than or equal to 10.
+
+Here is an `if` statement that checks if `num` is greater than or equal to 5:
+
+```js
+if (num >= 5) {
+  console.log("Num is greater than or equal to five!");
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(buyHealth.toString().match(/if\s*\(\s*gold\s*\>\=\s*10\s*\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (condition) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-055.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-055.md
new file mode 100644
index 0000000000..1961a7c3bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-055.md
@@ -0,0 +1,295 @@
+---
+id: 5d6f6f747c812010bf3327ce
+title: Part 55
+challengeType: 0
+dashedName: part-55
+---
+
+# --description--
+
+Now when a player tries to buy health it will only work if they have enough money. If the player does not have enough money, nothing will happen. Add an `else` statement where you can put code to run if a player dees not have enough money.
+
+Here is an example of an empty `else` statement:
+
+```js
+if (num >= 5) {
+  console.log("Num is greater than or equal to five!");
+} else {
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(buyHealth.toString().match(/\}\s*else\s*\{\s*\}/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-056.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-056.md
new file mode 100644
index 0000000000..92734d76b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-056.md
@@ -0,0 +1,290 @@
+---
+id: 5d6f70937c812010bf3327cf
+title: Part 56
+challengeType: 0
+dashedName: part-56
+---
+
+# --description--
+
+Inside the `else` statement, set `text.innerText` to equal "You do not have enough gold to buy health."
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(gold = 5),
+  buyHealth(),
+  assert(text.innerText === 'You do not have enough gold to buy health.');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-057.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-057.md
new file mode 100644
index 0000000000..c125391b4d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-057.md
@@ -0,0 +1,290 @@
+---
+id: 5d6f72657c812010bf3327d0
+title: Part 57
+challengeType: 0
+dashedName: part-57
+---
+
+# --description--
+
+Before we write the code for the `buyWeapon` function, use `const` to create a `weapons` variable right above the `locations` array. Set it to equal an empty array.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(weapons, []);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-058.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-058.md
new file mode 100644
index 0000000000..d48d9e790d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-058.md
@@ -0,0 +1,314 @@
+---
+id: 5d6f736b7c812010bf3327d2
+title: Part 58
+challengeType: 0
+dashedName: part-58
+---
+
+# --description--
+
+Just like in the `locations` array, all the elements in `weapons` will be objects. Add four objects to the `weapons` array, each with two properties: `name` and `power`. The first should be the `name` "stick" with `power` set to 5. Then, "dagger" with set `power` to 30. Next, "claw hammer" with a `power` of 50. Finally, "sword" with a `power` of 100.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(weapons, [
+  { name: 'stick', power: 5 },
+  { name: 'dagger', power: 30 },
+  { name: 'claw hammer', power: 50 },
+  { name: 'sword', power: 100 }
+]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-059.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-059.md
new file mode 100644
index 0000000000..f24a62ffa5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-059.md
@@ -0,0 +1,329 @@
+---
+id: 5d6f776c7c812010bf3327d3
+title: Part 59
+challengeType: 0
+dashedName: part-59
+---
+
+# --description--
+
+Inside the `buyWeapon` function, add an `if` statement to check if gold is greater than or equal to 30.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(buyWeapon.toString().match(/if\s*\(\s*gold\s*\>\=\s*30\)\s*\{\s*\}/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-060.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-060.md
new file mode 100644
index 0000000000..a868276b9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-060.md
@@ -0,0 +1,332 @@
+---
+id: 5d6f785f7c812010bf3327d4
+title: Part 60
+challengeType: 0
+dashedName: part-60
+---
+
+# --description--
+
+Similar to in the `buyHealth` function, set `gold` to equal 30 less than its current value.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(gold = 50), buyWeapon(), assert(gold === 20);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-061.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-061.md
new file mode 100644
index 0000000000..5cee23ff5b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-061.md
@@ -0,0 +1,333 @@
+---
+id: 5d6f79667c812010bf3327d6
+title: Part 61
+challengeType: 0
+dashedName: part-61
+---
+
+# --description--
+
+The value of `currentWeapon` corresponds to an index in the `weapons` array. The player starts with a stick since `currentWeapon` starts at 0 and `weapons[0]` is the "stick" weapon. In the `buyWeapon` function, add one to `currentWeapon` since the user is buying the next weapon in the `weapons` array.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(currentWeapon = 0), buyWeapon(), assert(currentWeapon === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon += 1;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-062.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-062.md
new file mode 100644
index 0000000000..ee5a51bf97
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-062.md
@@ -0,0 +1,342 @@
+---
+id: 5d6f7b917c812010bf3327d7
+title: Part 62
+challengeType: 0
+dashedName: part-62
+---
+
+# --description--
+
+You can easily increment or add one to a variable with the `++` operator. All three of these statements add one to a number:
+
+```js
+num = num + 1;
+num += 1;
+num++;
+```
+
+Change the line `currentWeapon += 1;` to use the `++` operator.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(buyWeapon.toString().match(/currentWeapon\s*\+\+\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon += 1;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-063.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-063.md
new file mode 100644
index 0000000000..26bf3f78dc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-063.md
@@ -0,0 +1,340 @@
+---
+id: 5d6f82da7c812010bf3327d8
+title: Part 63
+challengeType: 0
+dashedName: part-63
+---
+
+# --description--
+
+Now update the `innerText` property of `goldText` and `text`. `text` should equal "You now have a new weapon.".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+buyWeapon(),
+  assert(
+    goldText.innerText === '20' &&
+      text.innerText === 'You now have a new weapon.'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-064.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-064.md
new file mode 100644
index 0000000000..8725a9fc6e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-064.md
@@ -0,0 +1,339 @@
+---
+id: 5d6f919f7c812010bf3327d9
+title: Part 64
+challengeType: 0
+dashedName: part-64
+---
+
+# --description--
+
+Let's tell the player what weapon they bought. In between the two lines you just wrote, use `let` to initialize a new variable called `newWeapon`. Set `newWeapon` to equal `weapons`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/let\s*newWeapon\s*\=\s*weapons\;?/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-065.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-065.md
new file mode 100644
index 0000000000..32764ac06a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-065.md
@@ -0,0 +1,340 @@
+---
+id: 5d6f94347c812010bf3327da
+title: Part 65
+challengeType: 0
+dashedName: part-65
+---
+
+# --description--
+
+Right after the word `weapons` (with no space between), add brackets `[]`. In between the brackets put `currentWeapon`, which is the index number of the weapon the player just bought.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/let\s*newWeapon\s*\=\s*weapons\s?\[currentWeapon\]\;?/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon];
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-066.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-066.md
new file mode 100644
index 0000000000..597e6d7aad
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-066.md
@@ -0,0 +1,342 @@
+---
+id: 5d6f96747c812010bf3327db
+title: Part 66
+challengeType: 0
+dashedName: part-66
+---
+
+# --description--
+
+Get just the name property of the current weapon by adding `.name` at the end of `weapons[currentWeapon]` (don't use a space).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /let\s*newWeapon\s*\=\s*weapons\s?\[currentWeapon\]\.name\;?/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon];
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-067.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-067.md
new file mode 100644
index 0000000000..5fd5f2e6f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-067.md
@@ -0,0 +1,351 @@
+---
+id: 5d6f98247c812010bf3327dc
+title: Part 67
+challengeType: 0
+dashedName: part-67
+---
+
+# --description--
+
+You can insert variables into a string with the concatenation (`+`) operator. Update the "You now have a new weapon." string so it says "You now have a " and then lists the name of the new weapon. Make sure to add a period at the end of the sentence.
+
+Here is an example that creates the string "Hello, our name is freeCodeCamp.":
+
+```js
+let ourName = "freeCodeCamp";
+let ourStr = "Hello, our name is " + ourName + ".";
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(/[\'\"\`]You now have a [\'\"\`]\s*\+\s*newWeapon\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a new weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-068.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-068.md
new file mode 100644
index 0000000000..9bd5e014cd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-068.md
@@ -0,0 +1,348 @@
+---
+id: 5d6f9a4c7c812010bf3327dd
+title: Part 68
+challengeType: 0
+dashedName: part-68
+---
+
+# --description--
+
+Way back at the beginning you created the `inventory` array. Push the `newWeapon` onto the end of the `inventory` array. Here is an example of pushing onto an array:
+
+```js
+let arr = ["first"];
+let next = "second";
+arr.push(next);
+// arr now equals ["first", "second"]
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+buyWeapon(), assert.deepStrictEqual(inventory, ['stick', 'dagger']);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-069.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-069.md
new file mode 100644
index 0000000000..ed7ac6e071
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-069.md
@@ -0,0 +1,349 @@
+---
+id: 5d70850e066dac7142a6d797
+title: Part 69
+challengeType: 0
+dashedName: part-69
+---
+
+# --description--
+
+Up to this point, anytime `text.innerText` was updated, the old text was erased. This time, use the `+=` operator instead of the `=` operator to add text to the end of `text.innerText`. Add the string " In your inventory you have: " (include the spaces at the beginning and end).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /text\.innerText\s*\+\=\s*[\'\"\`] In your inventory you have\: [\'\"\`]\;?/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: ";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-070.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-070.md
new file mode 100644
index 0000000000..0e64dbaded
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-070.md
@@ -0,0 +1,350 @@
+---
+id: 5d70862e066dac7142a6d798
+title: Part 70
+challengeType: 0
+dashedName: part-70
+---
+
+# --description--
+
+At the end of the string you just added after the ending quote mark, add `+ inventory` to add the contents of the inventory to the end of the string.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /text\.innerText\s*\+\=\s*[\'\"\`] In your inventory you have\: [\'\"\`]\s*\+\s*inventory\;?/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: ";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-071.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-071.md
new file mode 100644
index 0000000000..b2dfd7e4c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-071.md
@@ -0,0 +1,352 @@
+---
+id: 5d7086d4066dac7142a6d799
+title: Part 71
+challengeType: 0
+dashedName: part-71
+---
+
+# --description--
+
+At the end of the `if` statement inside the `buyWeapon` function, add an `else` statement. Inside the `else` statement, set `text.innerText` to equal "You do not have enough gold to buy a weapon.".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /\}\s*else\s*\{\s*text\.innerText\s*\=\s*[\'\"\`]You do not have enough gold to buy a weapon\.?[\'\"\`]\;?\s*\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-072.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-072.md
new file mode 100644
index 0000000000..6da16fae4d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-072.md
@@ -0,0 +1,361 @@
+---
+id: 5d7088d2066dac7142a6d79a
+title: Part 72
+challengeType: 0
+dashedName: part-72
+---
+
+# --description--
+
+Once a player has the best weapon, they can't buy another one. Wrap all the code in the `buyWeapon` function inside another `if` statement. The condition should check if `currentWeapon` is less than 3 (the index of the last weapon).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /if\s*\(\s*currentWeapon\s*\<\s*3\s*\)\s*\{\s*if\s*\(\s*gold\s*\>\=\s*30\s*\)\s*\{/
+    ) &&
+    buyWeapon
+      .toString()
+      .match(
+        /\}\s*else\s*\{\s*text\.innerText\s*\=\s*[\'\"\`]You do not have enough gold to buy a weapon\.?[\'\"\`]\;?\s*\}\s*\}/
+      )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < 3) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-073.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-073.md
new file mode 100644
index 0000000000..b2de94000c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-073.md
@@ -0,0 +1,358 @@
+---
+id: 5d708ab5066dac7142a6d79b
+title: Part 73
+challengeType: 0
+dashedName: part-73
+---
+
+# --description--
+
+At some point in the future, you may want to add more weapons. Instead of checking if `currentWeapon` is less than three, check if `currentWeapon` is less than the length of the `weapons` array. For example, here is how you would get the length of an array called `arr`: `arr.length`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /if\s*\(\s*currentWeapon\s*\<\s*weapons\.length\s*\)\s*\{\s*if\s*\(\s*gold\s*\>\=\s*30\s*\)\s*\{/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < 3) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-074.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-074.md
new file mode 100644
index 0000000000..ac6f24dc33
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-074.md
@@ -0,0 +1,358 @@
+---
+id: 5d708be9066dac7142a6d79c
+title: Part 74
+challengeType: 0
+dashedName: part-74
+---
+
+# --description--
+
+We have to fix an error. The `currentWeapon` variable is the array index. Array indexing starts at zero. The index of the last element in an array is one less than the length of the array. In the `if` condition you are working on, change `weapons.length` to `weapons.length - 1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /if\s*\(\s*currentWeapon\s*\<\s*weapons\.length\s*\-\s*1\s*\)\s*\{\s*if\s*\(\s*gold\s*\>\=\s*30\s*\)\s*\{/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-075.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-075.md
new file mode 100644
index 0000000000..d8745f0ce6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-075.md
@@ -0,0 +1,360 @@
+---
+id: 5d708c9a066dac7142a6d79d
+title: Part 75
+challengeType: 0
+dashedName: part-75
+---
+
+# --description--
+
+Add an `else` statement on the end of the outer `if` statement. Inside the `else` statement, set `text.innerText` to "You already have the most powerful weapon!".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /\}\s*else\s*\{\s*text\.innerText\s*\=\s*[\'\"\`]You do not have enough gold to buy a weapon\.?[\'\"\`]\;?\s*\}\s*\}\s*else\s*\{\s*text\.innerText\s*\=\s*[\'\"\`]You already have the most powerful weapon\![\'\"\`]\;?\s*\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-076.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-076.md
new file mode 100644
index 0000000000..9c9369715d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-076.md
@@ -0,0 +1,364 @@
+---
+id: 5d708dd7066dac7142a6d79e
+title: Part 76
+challengeType: 0
+dashedName: part-76
+---
+
+# --description--
+
+Once a player has the most powerful weapon, we'll give them the ability to sell their older weapons back. In the else statement, set `button2.innerText` to equal "Sell weapon for 15 gold". Also, set `button2.onclick` to the function name `sellWeapon`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  buyWeapon
+    .toString()
+    .match(
+      /else\s*\{\s*text\.innerText\s*\=\s*[\'\"\`]You already have the most powerful weapon\![\'\"\`]\;?\s*button2\.innerText\s*\=\s*[\'\"\`]Sell weapon for 15 gold\.?[\'\"\`]\;?\s*button2\.onclick\s*\=\s*sellWeapon\;?\s*\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-077.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-077.md
new file mode 100644
index 0000000000..2204991a58
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-077.md
@@ -0,0 +1,363 @@
+---
+id: 5d708fae066dac7142a6d79f
+title: Part 77
+challengeType: 0
+dashedName: part-77
+---
+
+# --description--
+
+After the `buyWeapon` function, create an empty function called `sellWeapon`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof sellWeapon === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-078.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-078.md
new file mode 100644
index 0000000000..cdb3492126
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-078.md
@@ -0,0 +1,373 @@
+---
+id: 5d709664066dac7142a6d7a0
+title: Part 78
+challengeType: 0
+dashedName: part-78
+---
+
+# --description--
+
+Players should not be able to sell their only weapon. Inside the `sellWeapon` function, add an `if` statement with a condition that checks if the length of the `inventory` array is greater than one.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  sellWeapon
+    .toString()
+    .match(/if\s*\(\s*inventory\.length\s*\>\s*1\s*\)\s*\{\s*\}/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-079.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-079.md
new file mode 100644
index 0000000000..adf7474dbd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-079.md
@@ -0,0 +1,386 @@
+---
+id: 5d709bbc066dac7142a6d7a2
+title: Part 79
+challengeType: 0
+dashedName: part-79
+---
+
+# --description--
+
+Inside the `if` statement, set `gold` equal to 15 more than its current value. Also, update `goldText.innerText` to the new value.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    gold = 50;
+    inventory = ['stick'];
+    sellWeapon();
+    return gold === 50 && goldText.innerText === '50';
+  })() &&
+    (() => {
+      gold = 50;
+      inventory = ['stick', 'dagger'];
+      sellWeapon();
+      return gold === 65 && goldText.innerText === '65';
+    })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-080.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-080.md
new file mode 100644
index 0000000000..cc10b5e0ee
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-080.md
@@ -0,0 +1,379 @@
+---
+id: 5d71b58b848f6914ab89897d
+title: Part 80
+challengeType: 0
+dashedName: part-80
+---
+
+# --description--
+
+Use the `let` keyword to create a variable named `currentWeapon`. Don't set it equal to anything yet. Notice that we already have a `currentWeapon` variable from earlier. Since the `let` keyword is used instead of `var`, this new version of `currentWeapon` is scoped only to this `if` statement. At the close of the `if` statement, the old version of `currentWeapon` will be used again.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.match(
+    /if\s*\(\s*inventory\.length\s*\>\s*1\s*\)\s*\{\s*(.\s*)*let\s*currentWeapon\;?/
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-081.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-081.md
new file mode 100644
index 0000000000..043a6e1b1e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-081.md
@@ -0,0 +1,388 @@
+---
+id: 5d71bdca848f6914ab89897e
+title: Part 81
+challengeType: 0
+dashedName: part-81
+---
+
+# --description--
+
+Use the `shift()` method on the `inventory` array to remove the first element and return that removed element. Set `currentWeapon` to equal returned element.
+
+Here is an example:
+
+```js
+let arr = ["one", "two", "three"];
+let firstElement = arr.shift();
+// arr now equals ["two", "three"] and firstElement now equals "one"
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.match(
+    /if\s*\(\s*inventory\.length\s*\>\s*1\s*\)\s*\{\s*(.\s*)*let\s*currentWeapon\s*\=\s*inventory\.shift\(\s*\)\;?/
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-082.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-082.md
new file mode 100644
index 0000000000..1c53103684
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-082.md
@@ -0,0 +1,380 @@
+---
+id: 5d71bfdf848f6914ab89897f
+title: Part 82
+challengeType: 0
+dashedName: part-82
+---
+
+# --description--
+
+After the line that creates the `currentWeapon` variable, set `text.innerText` to equal `"You sold a " + currentWeapon + "."`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(inventory = ['potato', 'carrot']),
+  sellWeapon(),
+  assert(text.innerText === 'You sold a potato.' && inventory[0] === 'carrot');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-083.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-083.md
new file mode 100644
index 0000000000..93d8b087fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-083.md
@@ -0,0 +1,384 @@
+---
+id: 5d71c20f848f6914ab898980
+title: Part 83
+challengeType: 0
+dashedName: part-83
+---
+
+# --description--
+
+Now use the `+=` operator to add to `text.innerText`. Add the string " In your inventory you have: " (with spaces at the beginning and end). Then add the `inventory` variable to the end of the string.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(inventory = ['potato', 'carrot']),
+  sellWeapon(),
+  assert(
+    text.innerText === 'You sold a potato. In your inventory you have: carrot'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-084.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-084.md
new file mode 100644
index 0000000000..3874c2eb17
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-084.md
@@ -0,0 +1,387 @@
+---
+id: 5d71c80e848f6914ab898981
+title: Part 84
+challengeType: 0
+dashedName: part-84
+---
+
+# --description--
+
+Add code so that if the length of the inventory is NOT more than one, then a text message appears that says "Don't sell your only weapon!".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(inventory = ['potato']),
+  sellWeapon(),
+  assert(
+    inventory[0] === 'potato' &&
+      text.innerText === "Don't sell your only weapon!"
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-085.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-085.md
new file mode 100644
index 0000000000..3bdde43e8f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-085.md
@@ -0,0 +1,408 @@
+---
+id: 5d71cab4f27e5122af9f1178
+title: Part 85
+challengeType: 0
+dashedName: part-85
+---
+
+# --description--
+
+Now we'll start working on fighting monsters. Organize your code by moving the `fightDragon` function to the bottom of the code near the other fight functions.
+
+Below where the `weapons` array is defined, define a `monsters` array. Set the contents of the `monsters` array to: `{ name: "slime", level: 2, health: 15 }, {name: "fanged beast", level: 8, health: 60 }, { name: "dragon", level: 20, health: 300 }`. Space out the code similar to the `weapons` array so that it is easier to read.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(monsters, [
+  { name: 'slime', level: 2, health: 15 },
+  { name: 'fanged beast', level: 8, health: 60 },
+  { name: 'dragon', level: 20, health: 300 }
+]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-086.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-086.md
new file mode 100644
index 0000000000..eb27db0455
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-086.md
@@ -0,0 +1,423 @@
+---
+id: 5d71ea30f27e5122af9f1179
+title: Part 86
+challengeType: 0
+dashedName: part-86
+---
+
+# --description--
+
+Fighting each type of monster will be very similar so all three fighting functions will call a function named `goFight`. At the end of the code, add an empty function named `goFight`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof goFight === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function goFight() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-087.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-087.md
new file mode 100644
index 0000000000..181b645c76
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-087.md
@@ -0,0 +1,430 @@
+---
+id: 5d71eb0bf27e5122af9f117a
+title: Part 87
+challengeType: 0
+dashedName: part-87
+---
+
+# --description--
+
+Inside the `fightSlime` function, set `fighting` to equal 0 (which is the index of the slime in the `monsters` array). On the next line, call the `goFight` function.
+
+As a reminder, here is how you would call a function named `myFunc`: `myFunc();`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(fightSlime.toString().match(/fighting\s*\=\s*0\;?\s*goFight\(\s*\)\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function goFight() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function goFight() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-088.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-088.md
new file mode 100644
index 0000000000..052627f864
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-088.md
@@ -0,0 +1,436 @@
+---
+id: 5d71f787e39bedcf8f0998ff
+title: Part 88
+challengeType: 0
+dashedName: part-88
+---
+
+# --description--
+
+Write the code for the `fightBeast` and `fightDragon` functions, using the `fightSlime` function as an example. Make sure to delete the line that is already in the `fightDragon` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  fightBeast.toString().match(/fighting\s*\=\s*1\;?\s*goFight\(\s*\)\;?/) &&
+    fightDragon.toString().match(/fighting\s*\=\s*2\;?\s*goFight\(\s*\)\;?/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+}
+
+function fightDragon() {
+  console.log("Fighting dragon.");
+}
+
+function goFight() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+    {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-089.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-089.md
new file mode 100644
index 0000000000..47c417e426
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-089.md
@@ -0,0 +1,452 @@
+---
+id: 5d71ed88f27e5122af9f117b
+title: Part 89
+challengeType: 0
+dashedName: part-89
+---
+
+# --description--
+
+Add a new object in the `locations` array with all the same properties as the other objects in the array. Set `name` to "fight". Set `"button text"` to `["Attack", "Dodge", "Run"]`. Set `"button functions"` to `[attack, dodge, goTown]`. And set `text` to "You are fighting a monster.".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[3], {
+  name: 'fight',
+  'button text': ['Attack', 'Dodge', 'Run'],
+  'button functions': [attack, dodge, goTown],
+  text: 'You are fighting a monster.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+// initialize for test
+const attack = () => {}
+const dodge = () => {}
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-090.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-090.md
new file mode 100644
index 0000000000..d84f61206f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-090.md
@@ -0,0 +1,454 @@
+---
+id: 5d71f217e39bedcf8f0998fd
+title: Part 90
+challengeType: 0
+dashedName: part-90
+---
+
+# --description--
+
+At the end of the code create empty functions named `attack` and `dodge`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof attack === 'function' && typeof dodge === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-091.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-091.md
new file mode 100644
index 0000000000..3dc950693b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-091.md
@@ -0,0 +1,461 @@
+---
+id: 5d71f669e39bedcf8f0998fe
+title: Part 91
+challengeType: 0
+dashedName: part-91
+---
+
+# --description--
+
+In the `goFight` function, call the `update` function and pass it `locations[3]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(goFight.toString().match(/update\(\s*locations\[\s*3\s*\]\s*\)\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-092.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-092.md
new file mode 100644
index 0000000000..f4a6a6eb3e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-092.md
@@ -0,0 +1,476 @@
+---
+id: 5d72027ce39bedcf8f099900
+title: Part 92
+challengeType: 0
+dashedName: part-92
+---
+
+# --description--
+
+Next in the `goFight` function, set `monsterHealth` to equal the health of the current monster. You can get the health of the current monster with `monsters[fighting].health`. Try to understand that line before continuing.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    fightSlime();
+    return monsterHealth === 15;
+  })() &&
+    (() => {
+      fightBeast();
+      return monsterHealth === 60;
+    })() &&
+    (() => {
+      fightDragon();
+      return monsterHealth === 300;
+    })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-093.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-093.md
new file mode 100644
index 0000000000..84e0290e3c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-093.md
@@ -0,0 +1,471 @@
+---
+id: 5d721925e39bedcf8f099901
+title: Part 93
+challengeType: 0
+dashedName: part-93
+---
+
+# --description--
+
+The HTML that shows the monster stats that has been hidden using CSS. Display the `monsterStats` HTML element by updating its CSS `display` property to equal `block`.
+
+Here is an example of updating the `display` property of an element named `myElement`: `myElement.style.display = "block";`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  goFight
+    .toString()
+    .match(/^\s*monsterStats\.style\.display\s*\=\s*[\'\"\`]block[\'\"\`]\;?/m)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-094.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-094.md
new file mode 100644
index 0000000000..3b804fc655
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-094.md
@@ -0,0 +1,483 @@
+---
+id: 5d7dea508360d21c6826a9af
+title: Part 94
+challengeType: 0
+dashedName: part-94
+---
+
+# --description--
+
+Now set the `innerText` property of `monsterNameText` to equal `monsters[fighting].name`. Also, set the `innerText` property of `monsterHealthText` to equal `monsterHealth`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  (() => {
+    fightBeast();
+    return (
+      monsterNameText.innerText === 'fanged beast' &&
+      monsterHealthText.innerText === '60'
+    );
+  })() &&
+    (() => {
+      fightDragon();
+      return (
+        monsterNameText.innerText === 'dragon' &&
+        monsterHealthText.innerText === '300'
+      );
+    })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-095.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-095.md
new file mode 100644
index 0000000000..0361edec43
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-095.md
@@ -0,0 +1,471 @@
+---
+id: 5d7deecc8360d21c6826a9b0
+title: Part 95
+challengeType: 0
+dashedName: part-95
+---
+
+# --description--
+
+We'll build out the `attack` function now. For the first line in the function, update the text message to say "The \[monster name] attacks." but replace "\[monster name]" with the actual name of the monster. Remember, you can get the monster name with `monsters[fighting].name`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+fightDragon(), attack(), assert(text.innerText === 'The dragon attacks.');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-096.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-096.md
new file mode 100644
index 0000000000..5b74ed5e58
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-096.md
@@ -0,0 +1,478 @@
+---
+id: 5d7df0458360d21c6826a9b1
+title: Part 96
+challengeType: 0
+dashedName: part-96
+---
+
+# --description--
+
+Now use the `+=` operator to append more text to `text.innerText`. Add the text " You attack it with your \[weapon name]." but replace "\[weapon name]" with the actual weapon name. Remember, you can get the weapon name with `weapons[currentWeapon].name`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(currentWeapon = 3),
+  fightDragon(),
+  attack(),
+  assert(
+    text.innerText === 'The dragon attacks. You attack it with your sword.'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-097.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-097.md
new file mode 100644
index 0000000000..6b15d33fda
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-097.md
@@ -0,0 +1,475 @@
+---
+id: 5d7df2a68360d21c6826a9b2
+title: Part 97
+challengeType: 0
+dashedName: part-97
+---
+
+# --description--
+
+Next, set `health` to equal `health` minus the monster's level. You can get the monster's level with `monsters[fighting].level`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(health = 50), fightDragon(), attack(), assert(health === 30);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-098.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-098.md
new file mode 100644
index 0000000000..f4683e6bc9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-098.md
@@ -0,0 +1,477 @@
+---
+id: 5d7df41a8360d21c6826a9b3
+title: Part 98
+challengeType: 0
+dashedName: part-98
+---
+
+# --description--
+
+Set `monsterHealth` to `monsterHealth` minus the power of the current weapon (`weapons[currentWeapon].power`).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+fightDragon(), (monsterHealth = 20), attack(), assert(monsterHealth === 15);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power;
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-099.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-099.md
new file mode 100644
index 0000000000..bd3cbd8d48
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-099.md
@@ -0,0 +1,484 @@
+---
+id: 5d7df75a8360d21c6826a9b4
+title: Part 99
+challengeType: 0
+dashedName: part-99
+---
+
+# --description--
+
+At the end of that line, add a random number between one and the value of `xp`. Here is the formula to get a random number between 1 and 5: `Math.floor(Math.random() * 5) + 1`.
+
+`Math.random()` returns a decimal or floating point number between 0 and 1, and `Math.floor()` rounds a given number down to the nearest integer.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(xp = 1),
+  fightDragon(),
+  (monsterHealth = 20),
+  attack(),
+  assert(monsterHealth === 14);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power;
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-100.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-100.md
new file mode 100644
index 0000000000..1f7732f04f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-100.md
@@ -0,0 +1,485 @@
+---
+id: 5d7dfb908360d21c6826a9b5
+title: Part 100
+challengeType: 0
+dashedName: part-100
+---
+
+# --description--
+
+Update `healthText.innerText` and `monsterHealthText.innerText` to equal `health` and `monsterHealth`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(xp = 1),
+  (health = 50),
+  fightDragon(),
+  (monsterHealth = 20),
+  attack(),
+  assert(monsterHealthText.innerText === '14' && healthText.innerText === '30');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-101.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-101.md
new file mode 100644
index 0000000000..60d5157b2b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-101.md
@@ -0,0 +1,489 @@
+---
+id: 5d7e02c88360d21c6826a9b7
+title: Part 101
+challengeType: 0
+dashedName: part-101
+---
+
+# --description--
+
+Check if health is less than or equal to zero. If it is, call the `lose()` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .match(/^\s*if\s*\(\s*health\s*\<\=\s*0\s*\)\s*\{\s*lose\(\s*\);?\s*\}/m)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  }
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-102.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-102.md
new file mode 100644
index 0000000000..47874a2616
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-102.md
@@ -0,0 +1,508 @@
+---
+id: 5d7e06728360d21c6826a9b8
+title: Part 102
+challengeType: 0
+dashedName: part-102
+---
+
+# --description--
+
+An `else` statement can be conditional with an `else if` statement. At the end of the `if` statement, add an `else if` statement to check if `monsterHealth` is less than or equal to zero. Inside the `else if` block, call the `defeatMonster()` function.
+
+Here is an example of an `if` statement with `else if` and `else`:
+
+```js
+if (num > 15) {
+  return "Bigger than 15";
+} else if (num < 5) {
+  return "Smaller than 5";
+} else {
+  return "Between 5 and 15";
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .match(
+      /^\s*if\s*\(\s*health\s*\<\=\s*0\s*\)\s*\{\s*lose\(\s*\);?\s*\}\s*else if\s*\(\s*monsterHealth\s*\<\=\s*0\s*\)\s*\{\s*defeatMonster\(\s*\)\;?\s*\}/m
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  }
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-103.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-103.md
new file mode 100644
index 0000000000..5df47c54bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-103.md
@@ -0,0 +1,498 @@
+---
+id: 5d7e077e8360d21c6826a9b9
+title: Part 103
+challengeType: 0
+dashedName: part-103
+---
+
+# --description--
+
+At the end of the code add two empty functions named `defeatMonster` and `lose`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof defeatMonster === 'function' && typeof lose === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+}
+
+function defeatMonster() {
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-104.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-104.md
new file mode 100644
index 0000000000..295fcda0c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-104.md
@@ -0,0 +1,507 @@
+---
+id: 5d7e13798360d21c6826a9bb
+title: Part 104
+challengeType: 0
+dashedName: part-104
+---
+
+# --description--
+
+Inside the `dodge` function, set `text.innerText` equal to "You dodge the attack from the \[monster's name]." Instead of "\[monster's name]", get the monster's name with `monsters[fighting].name`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+fightDragon(),
+  dodge(),
+  assert(text.innerText === 'You dodge the attack from the dragon.');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+}
+
+function defeatMonster() {
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-105.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-105.md
new file mode 100644
index 0000000000..dc57d38ff7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-105.md
@@ -0,0 +1,509 @@
+---
+id: 5d7f3b6c7c4263f469c36b17
+title: Part 105
+challengeType: 0
+dashedName: part-105
+---
+
+# --description--
+
+In the `defeatMonster` function, set `gold` to equal `gold` plus the monster's level times 6.7. You can get the monster's level with `monsters[fighting].level`.
+
+Here is how you would set `num` to equal `num` plus five times eight: `num += 5 * 8`. Remember that `Math.floor()` rounds any number passed to it down to the nearest whole number.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(gold = 10), fightSlime(), defeatMonster(), assert(gold === 23);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-106.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-106.md
new file mode 100644
index 0000000000..152059279f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-106.md
@@ -0,0 +1,509 @@
+---
+id: 5d7f405c7c4263f469c36b18
+title: Part 106
+challengeType: 0
+dashedName: part-106
+---
+
+# --description--
+
+Set `xp` to equal `xp` plus the monster's level.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(xp = 10), fightSlime(), defeatMonster(), assert(xp === 12);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-107.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-107.md
new file mode 100644
index 0000000000..b21cfd70ac
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-107.md
@@ -0,0 +1,516 @@
+---
+id: 5d7f410b7c4263f469c36b19
+title: Part 107
+challengeType: 0
+dashedName: part-107
+---
+
+# --description--
+
+Now set the `innerText` properties of `goldText` and `xpText` to the updated values.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(xp = 10),
+  (gold = 10),
+  fightSlime(),
+  defeatMonster(),
+  assert(goldText.innerText === '23' && xpText.innerText === '12');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-108.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-108.md
new file mode 100644
index 0000000000..a4f80d2ba5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-108.md
@@ -0,0 +1,518 @@
+---
+id: 5d7f41fa7c4263f469c36b1a
+title: Part 108
+challengeType: 0
+dashedName: part-108
+---
+
+# --description--
+
+Finish the `defeatMonster` function by calling the `update()` function and pass in `locations[4]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  defeatMonster.toString().match(/^\s*update\(\s*locations\[\s*4\s*\]\s*\)/m)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-109.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-109.md
new file mode 100644
index 0000000000..f686445b89
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-109.md
@@ -0,0 +1,532 @@
+---
+id: 5d7f43947c4263f469c36b1b
+title: Part 109
+challengeType: 0
+dashedName: part-109
+---
+
+# --description--
+
+Add a new object in the `locations` array with all the same properties as the other objects in the array. Set `name` to "kill monster". Set `"button text"` to `["Go to town square", "Go to town square", "Go to town square"]`. Set `"button functions"` to `[goTown, goTown, goTown]`. And set `text` to "The monster screams Arg! as it dies. You gain experience points and find gold.".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[4], {
+  name: 'kill monster',
+  'button text': [
+    'Go to town square',
+    'Go to town square',
+    'Go to town square'
+  ],
+  'button functions': [goTown, goTown, goTown],
+  text:
+    'The monster screams Arg! as it dies. You gain experience points and find gold.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: "The monster screams Arg! as it dies. You gain experience points and find gold."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-110.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-110.md
new file mode 100644
index 0000000000..0177434542
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-110.md
@@ -0,0 +1,538 @@
+---
+id: 5d7f44ac7c4263f469c36b1c
+title: Part 110
+challengeType: 0
+dashedName: part-110
+---
+
+# --description--
+
+The word "Arg!" should have quotes around it. Besides escaping quotes, there is another way you can include quote marks inside a quote. Change the double quotes to single quotes around the sentence, "The monster screams Arg! as it dies. You gain experience points and find gold". Then add double quotes around "Arg!"
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[4], {
+  name: 'kill monster',
+  'button text': [
+    'Go to town square',
+    'Go to town square',
+    'Go to town square'
+  ],
+  'button functions': [goTown, goTown, goTown],
+  text:
+    'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: "The monster screams Arg! as it dies. You gain experience points and find gold."
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-111.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-111.md
new file mode 100644
index 0000000000..2b1d5134cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-111.md
@@ -0,0 +1,542 @@
+---
+id: 5d7f459421b11cdaa3f6b15f
+title: Part 111
+challengeType: 0
+dashedName: part-111
+---
+
+# --description--
+
+While you're working in the `locations` array, add another object at the end. Set `name` to "lose". Set `"button text"` to `["REPLAY?", "REPLAY?", "REPLAY?"]`. Set `"button functions"` to `[restart, restart, restart]`. And set `text` to "You die. ☠️".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[5], {
+  name: 'lose',
+  'button text': ['REPLAY?', 'REPLAY?', 'REPLAY?'],
+  'button functions': [restart, restart, restart],
+  text: 'You die. ☠️'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+function restart() {} // Initialize for test
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-112.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-112.md
new file mode 100644
index 0000000000..4b2f082256
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-112.md
@@ -0,0 +1,544 @@
+---
+id: 5d7f4d9421b11cdaa3f6b160
+title: Part 112
+challengeType: 0
+dashedName: part-112
+---
+
+# --description--
+
+After a monster is defeated the monster stat box should no longer display. On the first line of the `update` function add: `monsterStats.style.display = "none";`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+fightSlime(), defeatMonster(), assert(monsterStats.style.display === 'none');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+function restart() {} // Initialize for test
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-113.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-113.md
new file mode 100644
index 0000000000..cd7d324d20
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-113.md
@@ -0,0 +1,546 @@
+---
+id: 5d80c1d821b11cdaa3f6b164
+title: Part 113
+challengeType: 0
+dashedName: part-113
+---
+
+# --description--
+
+In the `lose` function, call the `update` function and pass in `locations[5]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+update(locations[0]), lose(), assert(text.innerText === 'You die. ☠️');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+function restart() {} // Initialize for test
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-114.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-114.md
new file mode 100644
index 0000000000..f1bdeebb2e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-114.md
@@ -0,0 +1,575 @@
+---
+id: 5d80c3c021b11cdaa3f6b165
+title: Part 114
+challengeType: 0
+dashedName: part-114
+---
+
+# --description--
+
+At the end of the code, create a `restart` function. Inside the function, set `xp` to 0, set `health` to 100, set `gold` to 50, set `currentWeapon` to 0, and set `inventory` to `["stick"]`. Also, update the `innerText` properties of `goldText`, `healthText`, and `xpText` to their current values. Finally, call the `goTown()` function.
+
+After this step is a good time to test the game so far.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+(currentWeapon = 1),
+  (inventory = ['stick', 'dagger']),
+  fightSlime(),
+  attack(),
+  defeatMonster(),
+  restart(),
+  assert(
+    xp === 0 &&
+      gold === 50 &&
+      currentWeapon === 0 &&
+      inventory[0] === 'stick' &&
+      inventory.length === 1 &&
+      goldText.innerText === '50' &&
+      healthText.innerText === '100' &&
+      xpText.innerText === '0' &&
+      text.innerText ===
+        'You are in the town square. You see a sign that says "Store."'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-115.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-115.md
new file mode 100644
index 0000000000..2da91fb9a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-115.md
@@ -0,0 +1,578 @@
+---
+id: 5d80d20d21b11cdaa3f6b166
+title: Part 115
+challengeType: 0
+dashedName: part-115
+---
+
+# --description--
+
+Inside the `attack` function, update the contents of the `else if` statement. Instead of calling the `defeatMonster` function right away, create an `if` statement with an `else` statement. If the player is fighting the dragon (`fighting === 2`), then call the `winGame` function. Else, call the `defeatMonster` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .match(
+      /^\s*\}\s*else\s*if\s*\(\s*monsterHealth\s*\<\=\s*0\s*\)\s*\{\s*if\s*\(\s*fighting\s*===\s*2\)\s*\{\s*winGame\(\s*\)\;?\s*\}\s*else\s*\{\s*defeatMonster\(\s*\)\;?\s*\}\s*\}/m
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    if (fighting === 2) {
+      winGame();
+    } else {
+      defeatMonster();
+    }
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-116.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-116.md
new file mode 100644
index 0000000000..a648dc53a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-116.md
@@ -0,0 +1,592 @@
+---
+id: 5d80d67021b11cdaa3f6b167
+title: Part 116
+challengeType: 0
+dashedName: part-116
+---
+
+# --description--
+
+The conditional operator, also called the ternary operator, can be used as a one line if-else expression. The syntax is: `condition ? statement-if-true : statement-if-false;`.
+
+Change the if-else expression from the last challenge to use the ternary operator instead. Here is an example:
+
+```js
+if (age >= 18) {
+  adultFunction();
+} else {
+  kidFunction();
+}
+
+// The above if-else expression does the same thing as the following line
+
+age >= 18 ? adultFunction() : kidFunction();
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .match(
+      /^\s*\}\s*else\s*if\s*\(\s*monsterHealth\s*\<\=\s*0\s*\)\s*\{\s*fighting\s*\=\=\=\s*2\s*\?\s*winGame\(\s*\)\s*\:\s*defeatMonster\(\s*\)\;?\s*\}/m
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    if (fighting === 2) {
+    winGame();
+    } else {
+    defeatMonster();
+    }
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-117.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-117.md
new file mode 100644
index 0000000000..d2f4277b03
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-117.md
@@ -0,0 +1,572 @@
+---
+id: 5d80da7521b11cdaa3f6b168
+title: Part 117
+challengeType: 0
+dashedName: part-117
+---
+
+# --description--
+
+After the `lose` function, create a function called `winGame`. Inside the `winGame` function, call the `update` function and pass in `locations[6]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(winGame.toString().replace(/\s/g, '').includes('update(locations[6])'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-118.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-118.md
new file mode 100644
index 0000000000..5544e87fe0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-118.md
@@ -0,0 +1,587 @@
+---
+id: 5dbab6d36ef5fe3a704f848c
+title: Part 118
+challengeType: 0
+dashedName: part-118
+---
+
+# --description--
+
+Add another object in the `locations` array. Everything should be the same as the "lose" element, except the `name` should be "win" and the text should be "You defeat the dragon! YOU WIN THE GAME! 🎉"
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[6], {
+  name: 'win',
+  'button text': ['Fight slime', 'Fight fanged beast', 'Go to town square'],
+  'button functions': [restart, restart, restart],
+  text: 'You defeat the dragon! YOU WIN THE GAME! 🎉'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-119.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-119.md
new file mode 100644
index 0000000000..3e79f91c2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-119.md
@@ -0,0 +1,595 @@
+---
+id: 5dbabb746ef5fe3a704f848d
+title: Part 119
+challengeType: 0
+dashedName: part-119
+---
+
+# --description--
+
+The game could be complete now, but let's make it more interesting.
+
+Inside the `attack` function, change the line `health -= monsters[fighting].level;` to `health -= getMonsterAttackValue(monsters[fighting].level);` This sets `health` to equal `health` minus the return value of the `getMonsterAttackValue` function. Also, pass the level of the monster to `getMonsterAttackValue` as an argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .includes('health-=getMonsterAttackValue(monsters[fighting].level')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= monsters[fighting].level;
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-120.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-120.md
new file mode 100644
index 0000000000..9a1eb4d22d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-120.md
@@ -0,0 +1,594 @@
+---
+id: 5dbac08e6ef5fe3a704f848f
+title: Part 120
+challengeType: 0
+dashedName: part-120
+---
+
+# --description--
+
+Under the `attack` function, create a function with name `getMonsterAttackValue` that takes `level` as a parameter.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  getMonsterAttackValue.toString().replace(/\s/g, '') ===
+    'functiongetMonsterAttackValue(level){}'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-121.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-121.md
new file mode 100644
index 0000000000..50e8300f07
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-121.md
@@ -0,0 +1,601 @@
+---
+id: 5dbac0c86ef5fe3a704f8490
+title: Part 121
+challengeType: 0
+dashedName: part-121
+---
+
+# --description--
+
+The attack of the monster will be based on the monster's level and player's `xp`. In the `getMonsterAttackValue` function, use `const` to create a variable called `hit`. Set it to equal the equation `(level * 5) - (Math.floor(Math.random() * xp))`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  getMonsterAttackValue
+    .toString()
+    .replace(/\s/g, '')
+    .includes('varhit=level*5-Math.floor(Math.random()*xp)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-122.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-122.md
new file mode 100644
index 0000000000..2c8de55b40
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-122.md
@@ -0,0 +1,604 @@
+---
+id: 5dbac1f16ef5fe3a704f8491
+title: Part 122
+challengeType: 0
+dashedName: part-122
+---
+
+# --description--
+
+Log the value of `hit` to the console to use in debugging.
+
+Here is how to log the value of `num` to the console: `console.log(num);`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  getMonsterAttackValue
+    .toString()
+    .replace(/\s/g, '')
+    .includes('console.log(hit)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-123.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-123.md
new file mode 100644
index 0000000000..7ccf018a43
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-123.md
@@ -0,0 +1,611 @@
+---
+id: 5dbac2b06ef5fe3a704f8492
+title: Part 123
+challengeType: 0
+dashedName: part-123
+---
+
+# --description--
+
+Now return `hit` from the `getMonsterAttackValue` function. The return value of this function is used in the `attack` function.
+
+Here is an example of a function that returns a value:
+
+```js
+function plusThree(num) {
+  let numPlusThree = num + 3;
+  return numPlusThree;
+}
+
+const answer = plusThree(5); // 8
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  getMonsterAttackValue.toString().replace(/\s/g, '').includes('returnhit')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-124.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-124.md
new file mode 100644
index 0000000000..8f9d1b0f76
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-124.md
@@ -0,0 +1,614 @@
+---
+id: 5dbbb5076ef5fe3a704f849d
+title: Part 124
+challengeType: 0
+dashedName: part-124
+---
+
+# --description--
+
+If you play the game in its current state you might notice a bug. If your `xp` is high enough, the `getMonsterAttackValue` function will sometimes return a negative number, which will actually add to your total health when fighting a monster!
+
+In `getMonsterAttackValue`, change `return hit` to a ternary operator that returns `hit` if `hit` is greater than 0, or returns 0 if it is not.
+
+For example, here's a function that returns 5 if `tickets` is greater than 3, or returns 0 if it is not:
+
+```js
+function applyDiscount(tickets) {
+  return tickets > 2 : 5 : 0;
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  getMonsterAttackValue
+    .toString()
+    .replace(/\s/g, '')
+    .includes('returnhit>0?hit:0')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-125.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-125.md
new file mode 100644
index 0000000000..62d444f251
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-125.md
@@ -0,0 +1,609 @@
+---
+id: 5dbac6176ef5fe3a704f8493
+title: Part 125
+challengeType: 0
+dashedName: part-125
+---
+
+# --description--
+
+In the `attack` function after the line `health -= getMonsterAttackValue(monsters[fighting].level);`, create an empty if expression. For the condition, put the function call `isMonsterHit()`.
+
+Here is an example of an empty if expression with a function call as the condition:
+
+```js
+if (isTrue()) {
+
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(attack.toString().replace(/\s/g, '').includes('if(isMonsterHit()){}'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  if (isMonsterHit()) {
+  }
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-126.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-126.md
new file mode 100644
index 0000000000..b2107ec1f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-126.md
@@ -0,0 +1,620 @@
+---
+id: 5dbaca566ef5fe3a704f8494
+title: Part 126
+challengeType: 0
+dashedName: part-126
+---
+
+# --description--
+
+In the `attack` function, move the line `monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;` into the `if` block.
+
+Here is an example of code in an `if` block that logs a message to the console:
+
+```js
+if (isTrue()) {
+  console.log("It's true!");
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /if\(isMonsterHit\(\)\)\{monsterHealth\-\=weapons\[currentWeapon\]\.power\+Math\.floor\(Math\.random\(\)\*xp\)\+1;?\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  
+  if (isMonsterHit()) {
+
+  }
+  monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-127.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-127.md
new file mode 100644
index 0000000000..85efb551ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-127.md
@@ -0,0 +1,614 @@
+---
+id: 5dbae0446ef5fe3a704f8495
+title: Part 127
+challengeType: 0
+dashedName: part-127
+---
+
+# --description--
+
+Add an `else` expression to the `if` expression. Use the `+=` operator to add the text " You miss." onto the end of `text.innerText`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /if\(isMonsterHit\(\)\)\{monsterHealth\-\=weapons\[currentWeapon\]\.power\+Math\.floor\(Math\.random\(\)\*xp\)\+1;?\}else\{text\.innerText\+\=[\'\"\`]Youmiss.[\'\"\`]\;?\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-128.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-128.md
new file mode 100644
index 0000000000..5ded47315c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-128.md
@@ -0,0 +1,630 @@
+---
+id: 5dbae1f66ef5fe3a704f8496
+title: Part 128
+challengeType: 0
+dashedName: part-128
+---
+
+# --description--
+
+Now create the `isMonsterHit` function. It will return a boolean to be used in the `if` expression. Return the result of the comparison `Math.random() > .2`.
+
+Here is a function that returns the result of a comparison:
+
+```js
+function flipHeads() {
+  return Math.random() > .5;
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  isMonsterHit
+    .toString()
+    .replace(/\s/g, '')
+    .includes('returnMath.random()>.2') ||
+    isMonsterHit
+      .toString()
+      .replace(/\s/g, '')
+      .includes('returnMath.random()>0.2')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-129.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-129.md
new file mode 100644
index 0000000000..9fc1336bd5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-129.md
@@ -0,0 +1,628 @@
+---
+id: 5dbba5716ef5fe3a704f8497
+title: Part 129
+challengeType: 0
+dashedName: part-129
+---
+
+# --description--
+
+The player should hit if either `Math.random() > .2` OR if the player's health is less than 20. At the end of the return statement, add the "logical or" operator (`||`) and then check if `health` is less than 20.
+
+Here is an example that returns true if either a number is less than 10 or more than 20: `num < 10 || num > 20`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  isMonsterHit
+    .toString()
+    .replace(/\s/g, '')
+    .includes('returnMath.random()>.2||health<20') ||
+    isMonsterHit
+      .toString()
+      .replace(/\s/g, '')
+      .includes('returnMath.random()>0.2||health<20')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  }
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-130.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-130.md
new file mode 100644
index 0000000000..0d3f4e0a31
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-130.md
@@ -0,0 +1,625 @@
+---
+id: 5dbba70e6ef5fe3a704f8498
+title: Part 130
+challengeType: 0
+dashedName: part-130
+---
+
+# --description--
+
+On every attack, there should be a small chance that the player's weapon breaks. At the end of the `attack` function, add an empty `if` expression with the condition `Math.random() <= .1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack.toString().replace(/\s/g, '').includes('if(Math.random()<=.1){}') ||
+    isMonsterHit
+      .toString()
+      .replace(/\s/g, '')
+      .includes('if(Math.random()<=0.1){}')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1) {
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-131.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-131.md
new file mode 100644
index 0000000000..041946ae73
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-131.md
@@ -0,0 +1,646 @@
+---
+id: 5dbba89e6ef5fe3a704f8499
+title: Part 131
+challengeType: 0
+dashedName: part-131
+---
+
+# --description--
+
+Use the `+=` operator to add "Your \[last item in inventory array] breaks." to the end of `text.innerText`. Instead of the bracketed text, it should show the actual item name.
+
+Use `inventory.pop()` to both remove the last element from the array AND return that element. For example:
+
+```js
+let shoppingList = ["milk", "apples", "cereal"];
+console.log("I bought " + shoppingList.pop() + "."); // Logs "I bought cereal."
+// shoppingList now equals ["milk", "apples"]
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /if\(Math\.random\(\)\<\=0?\.1\)\{text\.innerText\+\=\"Your\"\+inventory\.pop\(\)\+\"breaks\.\"\;?\}/
+    ) ||
+    attack
+      .toString()
+      .replace(/\s/g, '')
+      .match(
+        /if\(Math\.random\(\)\<\=0?\.1\)\{text\.innerText\+\=\"Your\"\.concat\(inventory\.pop\(\)\,\"breaks\.\"\)\;?\}/
+      )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  
+  if (Math.random() <= .1) {
+
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-132.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-132.md
new file mode 100644
index 0000000000..307889edf7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-132.md
@@ -0,0 +1,632 @@
+---
+id: 5dbbaeb56ef5fe3a704f849a
+title: Part 132
+challengeType: 0
+dashedName: part-132
+---
+
+# --description--
+
+Decrement the value of `currentWeapon` using `--`. For example, say `num` equals 5. After running `num--`, `num` now equals 4.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /if\(Math\.random\(\)\<\=0?\.1\)\{text\.innerText\+\=\"Your\"\+inventory\.pop\(\)\+\"breaks\.\"\;?currentWeapon--\;?\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-133.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-133.md
new file mode 100644
index 0000000000..ea35840058
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-133.md
@@ -0,0 +1,643 @@
+---
+id: 5dbbb00e6ef5fe3a704f849b
+title: Part 133
+challengeType: 0
+dashedName: part-133
+---
+
+# --description--
+
+We don't want a player's only weapon to break.
+
+Use the "logical and" operator (`&&`) to add a second condition to the `if` expression you just wrote. A player's weapon should only be able to break if `inventory.length` does not equal (`!==`) one.
+
+Here is an example of an `if` expression with the conditions that `firstName` equals "Quincy" AND `lastName` does NOT equal "Larson". With `&&`, both conditions must be true or else the entire statement evaluates to false.
+
+```js
+if (firstName === "Quincy" && lastName !== "Larson") {
+  console.log("Cool name but not the creator of freeCodeCamp.org.")
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  attack
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /if\(Math\.random\(\)\<\=0?\.1\&\&inventory\.length\!\=\=1\)\{text\.innerText\+\=\"Your\"\+inventory\.pop\(\)\+\"breaks\.\"\;?currentWeapon--\;?\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-134.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-134.md
new file mode 100644
index 0000000000..d73015dadc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-134.md
@@ -0,0 +1,637 @@
+---
+id: 5dbbb1466ef5fe3a704f849c
+title: Part 134
+challengeType: 0
+dashedName: part-134
+---
+
+# --description--
+
+The only thing left to add is a mini-game easter egg (a hidden feature).
+
+Add a new function called `easterEgg` that calls the `update` function and passes in `locations[7]` as an argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  easterEgg
+    .toString()
+    .replace(/\s/g, '')
+    .match(/functioneasterEgg\(\)\{(return)?update\(locations\[7\]\)\;?}/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-135.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-135.md
new file mode 100644
index 0000000000..6c4fded964
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-135.md
@@ -0,0 +1,651 @@
+---
+id: 5dbbf3796ef5fe3a704f849e
+title: Part 135
+challengeType: 0
+dashedName: part-135
+---
+
+# --description--
+
+Add a new object to the `locations` array.
+
+Set `name` to "easter egg", `"button text"` to `["2", "8", "Go to town square?"]`, `"button functions"` to `[pickTwo, pickEight, goTown]`, and `text` to "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[7], {
+  name: 'easter egg',
+  'button text': ['2', '8', 'Go to town square?'],
+  'button functions': [pickTwo, pickEight, goTown],
+  text:
+    'You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+let pickTwo, pickEight; // initialize for test
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-136.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-136.md
new file mode 100644
index 0000000000..efd107afd6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-136.md
@@ -0,0 +1,662 @@
+---
+id: 5dbbf8d86ef5fe3a704f849f
+title: Part 136
+challengeType: 0
+dashedName: part-136
+---
+
+# --description--
+
+At the end of the code, add two new functions named `pickTwo` and `pickEight`.
+
+Inside each function call the `pick()` function. Pass either "2" or "8" as arguments to `pick` depending on the function name.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pickTwo.toString().replace(/\s/g, '').includes('pick(2)') &&
+    pickEight.toString().replace(/\s/g, '').includes('pick(8)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+<script>
+const pick = num => num; // Initialize for test
+</script>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-137.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-137.md
new file mode 100644
index 0000000000..3d42d7bf29
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-137.md
@@ -0,0 +1,664 @@
+---
+id: 5dbc23a66ef5fe3a704f84a0
+title: Part 137
+challengeType: 0
+dashedName: part-137
+---
+
+# --description--
+
+Add a `pick` function with a parameter named "guess".
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(pick.toString().replace(/\s/g, '').includes('functionpick(guess){}'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-138.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-138.md
new file mode 100644
index 0000000000..3f07a2a595
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-138.md
@@ -0,0 +1,675 @@
+---
+id: 5dbc2c506ef5fe3a704f84a1
+title: Part 138
+challengeType: 0
+dashedName: part-138
+---
+
+# --description--
+
+Inside `pick`, use `let` to initialize a variable named "numbers" and set it to an empty array.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .match(/functionpick\(guess\)\{varnumbers\=\[\]\;?\}/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-139.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-139.md
new file mode 100644
index 0000000000..67782d1950
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-139.md
@@ -0,0 +1,692 @@
+---
+id: 5dbc2d056ef5fe3a704f84a2
+title: Part 139
+challengeType: 0
+dashedName: part-139
+---
+
+# --description--
+
+Inside `pick`, create a `while` loop to run the same code multiple times. The code inside the `while` loop should keep repeating while `numbers.length` is less than 10 and stop once that condition is no longer true.
+
+Here is an example of a while loop that repeats code inside the loop while `i` is less than five.
+
+```js
+let ourArray = [];
+let i = 0;
+while(i < 5) {
+  ourArray.push(i);
+  i++;
+}
+// ourArray now equals [0,1,2,3,4]
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes(
+      'while(numbers.length<10){if(_LPC++%2000===0&&Date.now()-_LP>1500){'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-140.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-140.md
new file mode 100644
index 0000000000..85f93bb2c7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-140.md
@@ -0,0 +1,681 @@
+---
+id: 5dbc2f2d6ef5fe3a704f84a3
+title: Part 140
+challengeType: 0
+dashedName: part-140
+---
+
+# --description--
+
+Inside the `while` loop, push a random number between 0 and 10 onto the end of the `numbers` array. Get the random number with `Math.floor(Math.random() * 11)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes('numbers.push(Math.floor(Math.random()*11));}')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-141.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-141.md
new file mode 100644
index 0000000000..ad875cd5dc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-141.md
@@ -0,0 +1,679 @@
+---
+id: 5dbc33956ef5fe3a704f84a4
+title: Part 141
+challengeType: 0
+dashedName: part-141
+---
+
+# --description--
+
+After the `while` loop, set `text.innerText` to equal "You picked \[guess]. Here are the random numbers:". Replace \[guess] with the actual guess.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+pickTwo(),
+  assert(text.innerText === 'You picked 2. Here are the random numbers:');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:";
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-142.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-142.md
new file mode 100644
index 0000000000..a788245bf3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-142.md
@@ -0,0 +1,693 @@
+---
+id: 5dbc35326ef5fe3a704f84a5
+title: Part 142
+challengeType: 0
+dashedName: part-142
+---
+
+# --description--
+
+Before the final end quote in the string you just added, insert the new line escape sequence (`\n`). This will cause the next part you add to `text.innerText` to appear on a new line.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes(
+      'text.innerText="Youpicked"+guess+".Herearetherandomnumbers:\\n";'
+    ) ||
+    pick
+      .toString()
+      .replace(/\s/g, '')
+      .includes(
+        'text.innerText="Youpicked".concat(guess,".Herearetherandomnumbers:\\n");'
+      )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:";
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-143.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-143.md
new file mode 100644
index 0000000000..ddcf064846
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-143.md
@@ -0,0 +1,692 @@
+---
+id: 5dbfced07736e5ee7d235544
+title: Part 143
+challengeType: 0
+dashedName: part-143
+---
+
+# --description--
+
+A `for` loop runs "for" a specific number of times.
+
+We will go over how for loops work in the next several steps. In the meantime, just copy the for loop below and paste it at the end of the `pick` function:
+
+```js
+for (let x = 1; x < 5; x++) {
+
+}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(pick.toString().replace(/\s/g, '').includes('for(varx=1;x<5;x++){'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let x = 1; x < 5; x++) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-144.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-144.md
new file mode 100644
index 0000000000..876c77aa71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-144.md
@@ -0,0 +1,692 @@
+---
+id: 5dbfd4837736e5ee7d235545
+title: Part 144
+challengeType: 0
+dashedName: part-144
+---
+
+# --description--
+
+For loops are declared with three optional expressions separated by semicolons: `for ([initialization]; [condition]; [final-expression])`.
+
+The initialization statement is executed only one time before the loop starts and is often used to define and set up the loop variable. Think of it like declaring a variable to use as a counter in your `for` loop.
+
+Many `for` loops use `i` as an initializer and start from 0, so change `let x = 1;` to `let i = 0;`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(pick.toString().replace(/\s/g, '').includes('for(vari=0;x<5;x++){'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let x = 1; x < 5; x++) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; x < 5; x++) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-145.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-145.md
new file mode 100644
index 0000000000..2614aec51b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-145.md
@@ -0,0 +1,690 @@
+---
+id: 5dbfdb737736e5ee7d235546
+title: Part 145
+challengeType: 0
+dashedName: part-145
+---
+
+# --description--
+
+The second statement in a `for` loop, the condition statement, is evaluated at the beginning of every loop iteration. The loop will continue as long as it evaluates to true.
+
+We want the loop to run 10 times, so change `x < 5` to `i < 10`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(pick.toString().replace(/\s/g, '').includes('for(vari=0;i<10;x++){'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; x < 5; x++) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; x++) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-146.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-146.md
new file mode 100644
index 0000000000..e6593263c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-146.md
@@ -0,0 +1,690 @@
+---
+id: 5dbfdc377736e5ee7d235547
+title: Part 146
+challengeType: 0
+dashedName: part-146
+---
+
+# --description--
+
+The last statement in a `for` loop is the final-expression, and is executed at the end of each loop iteration.
+
+Since we changed the initializer from `x` to `i`, change `x++` to `i++`. This will iterate the initializer `i` by 1 after each loop.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(pick.toString().replace(/\s/g, '').includes('for(vari=0;i<10;i++){'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; x++) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-147.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-147.md
new file mode 100644
index 0000000000..4ba199d139
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-147.md
@@ -0,0 +1,693 @@
+---
+id: 5dbfe2f37736e5ee7d235548
+title: Part 147
+challengeType: 0
+dashedName: part-147
+---
+
+# --description--
+
+Inside the for loop, use the `+=` operator to add to the end of `text.innerText`. Add the the number at index `i` in the `numbers` array with `numbers[i]`. Then add a new line. So the entire line inside the for loop should look like: `text.innerText += numbers[i] + "\n";`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes('text.innerText+=numbers[i]+"\\n";}}')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-148.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-148.md
new file mode 100644
index 0000000000..fe8ebc1c01
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-148.md
@@ -0,0 +1,699 @@
+---
+id: 5dbfeffe7736e5ee7d235549
+title: Part 148
+challengeType: 0
+dashedName: part-148
+---
+
+# --description--
+
+The `indexOf()` array method returns the first index at which a given element can be found in the array, or -1 if it is not present.
+
+After the for loop, add an `if` expression to check if the guessed number is in the `numbers` array. The condition of the `if` expression should check if `numbers.indexOf(guess) !== -1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes('if(numbers.indexOf(guess)!==-1){}')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-149.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-149.md
new file mode 100644
index 0000000000..753caba8e7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-149.md
@@ -0,0 +1,705 @@
+---
+id: 5dbff18d7736e5ee7d23554a
+title: Part 149
+challengeType: 0
+dashedName: part-149
+---
+
+# --description--
+
+Inside the `if` expression, add the following string to the end of `text.innerText`: "Right! You win 20 gold!" Also, add 20 to the value of `gold` and update `goldText.innerText`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes('text.innerText+="Right!Youwin20gold!";') &&
+    pick.toString().replace(/\s/g, '').includes('gold+=20;') &&
+    pick.toString().replace(/\s/g, '').includes('goldText.innerText=gold;')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-150.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-150.md
new file mode 100644
index 0000000000..53d6a01dd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-150.md
@@ -0,0 +1,712 @@
+---
+id: 5dbff2d07736e5ee7d23554b
+title: Part 150
+challengeType: 0
+dashedName: part-150
+---
+
+# --description--
+
+Add an `else` expression. Inside add "Wrong! You lose 10 health!" to the end of `text.innerText`. Also, subtract 10 from `health` and update `healthText.innerText`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick.toString().replace(/\s/g, '').includes('else{') &&
+    pick
+      .toString()
+      .replace(/\s/g, '')
+      .includes('text.innerText+="Wrong!Youlose10health!";') &&
+    pick.toString().replace(/\s/g, '').includes('health-=10;') &&
+    pick.toString().replace(/\s/g, '').includes('healthText.innerText=health;')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-151.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-151.md
new file mode 100644
index 0000000000..20095d9bcd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-151.md
@@ -0,0 +1,718 @@
+---
+id: 5dbffd907736e5ee7d23554c
+title: Part 151
+challengeType: 0
+dashedName: part-151
+---
+
+# --description--
+
+At the end of the `else` statement, check if `health` is less than or equal to zero. If so, call the `lose()` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  pick
+    .toString()
+    .replace(/\s/g, '')
+    .includes(
+      'else{text.innerText+="Wrong!Youlose10health!";health-=10;healthText.innerText=health;if(health<=0){lose();}}'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+      gold -= 30;
+      currentWeapon++;
+      goldText.innerText = gold;
+      let newWeapon = weapons[currentWeapon].name;
+      text.innerText = "You now have a " + newWeapon + ".";
+      inventory.push(newWeapon);
+      text.innerText += " In your inventory you have: " + inventory;
+    } else {
+      text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+    if (health <= 0) {
+    lose();
+    }
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-152.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-152.md
new file mode 100644
index 0000000000..871a954431
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-152.md
@@ -0,0 +1,724 @@
+---
+id: 5dbffe887736e5ee7d23554d
+title: Part 152
+challengeType: 0
+dashedName: part-152
+---
+
+# --description--
+
+Inside the `locations` array, on the `kill monster` object, "button functions" is currently set to `[goTown, goTown, goTown]`. Change the third `goTown` to `easterEgg`. This is how a player will access the hidden feature of the game.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert.deepStrictEqual(locations[4], {
+  name: 'kill monster',
+  'button text': [
+    'Go to town square',
+    'Go to town square',
+    'Go to town square'
+  ],
+  'button functions': [goTown, goTown, easterEgg],
+  text:
+    'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+});
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, goTown],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+    if (health <= 0) {
+    lose();
+    }
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, easterEgg],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+    if (health <= 0) {
+    lose();
+    }
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-153.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-153.md
new file mode 100644
index 0000000000..deec67837f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript-rpg-game/part-153.md
@@ -0,0 +1,714 @@
+---
+id: 5dc01a727736e5ee7d23554f
+title: Part 153
+challengeType: 0
+dashedName: part-153
+---
+
+# --description--
+
+Congratulations! You are finished! Now try out the game.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en" >
+<head>
+  <meta charset="UTF-8">
+  <title>RPG - Dragon Repeller</title>
+  <style>
+    body {
+      background-color: darkblue;
+    }
+    #text {
+      background-color: black;
+      color: white;
+      padding: 10px;
+    }
+    #game {
+      max-width: 500px;
+      max-height: 400px;
+      background-color: lightgray;
+      color: white;
+      margin: 0 auto;
+      padding: 10px;
+    }
+    #controls {
+      border: 1px black solid;
+      padding: 5px;
+    }
+    #stats {
+      border: 1px black solid;
+      color: black;
+      padding: 5px;
+    }
+    #monsterStats {
+      display: none;
+      border: 1px black solid;
+      color: white;
+      padding: 5px;
+      background-color: red;
+    }
+    .stat {
+      padding-right: 10px;
+    }
+  </style>
+</head>
+<body>
+<div id="game">
+  <div id="stats">
+    <span class="stat">XP: <strong><span id="xpText">0</span></strong></span>
+    <span class="stat">Health: <strong><span id="healthText">100</span></strong></span>
+    <span class="stat">Gold: <strong><span id="goldText">50</span></strong></span>
+  </div>
+  <div id="controls">
+    <button id="button1">Go to store</button>
+    <button id="button2">Go to cave</button>
+    <button id="button3">Fight dragon</button>
+  </div>
+  <div id="monsterStats">
+    <span class="stat">Monster Name: <strong><span id="monsterName"></span></strong></span>
+    <span class="stat">Health: <strong><span id="monsterHealth"></span></strong></span>
+  </div>
+  <div id="text">Welcome to Dragon Repeller. You must defeat the dragon that is preventing people from leaving the town. You are in the town square. Where do you want to go? Use the buttons above.</div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, easterEgg],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  console.log(hit);
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+    if (health <= 0) {
+    lose();
+    }
+  }
+}
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+let xp = 0;
+let health = 100;
+let gold = 50;
+let currentWeapon = 0;
+let fighting;
+let monsterHealth;
+let inventory = ["stick"];
+
+const button1 = document.querySelector('#button1');
+const button2 = document.querySelector("#button2");
+const button3 = document.querySelector("#button3");
+const text = document.querySelector("#text");
+const xpText = document.querySelector("#xpText");
+const healthText = document.querySelector("#healthText");
+const goldText = document.querySelector("#goldText");
+const monsterStats = document.querySelector("#monsterStats");
+const monsterNameText = document.querySelector("#monsterName");
+const monsterHealthText = document.querySelector("#monsterHealth");
+
+const weapons = [
+  {
+    name: "stick",
+    power: 5
+  },
+  {
+    name: "dagger",
+    power: 30
+  },
+  {
+    name: "claw hammer",
+    power: 50
+  },
+  {
+    name: "sword",
+    power: 100
+  }
+];
+
+const monsters = [
+  {
+    name: "slime",
+    level: 2,
+    health: 15
+  },
+  {
+    name: "fanged beast",
+    level: 8,
+    health: 60
+  },
+  {
+    name: "dragon",
+    level: 20,
+    health: 300
+  }
+];
+
+const locations = [
+  {
+    name: "town square",
+    "button text": ["Go to store", "Go to cave", "Fight dragon"],
+    "button functions": [goStore, goCave, fightDragon],
+    text: "You are in the town square. You see a sign that says \"Store.\""
+  },
+  {
+    name: "store",
+    "button text": ["Buy 10 health (10 gold)", "Buy weapon (30 gold)", "Go to town square"],
+    "button functions": [buyHealth, buyWeapon, goTown],
+    text: "You enter the store."
+  },
+  {
+    name: "cave",
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"],
+    "button functions": [fightSlime, fightBeast, goTown],
+    text: "You enter the cave. You see some monsters."
+  },
+  {
+    name: "fight",
+    "button text": ["Attack", "Dodge", "Run"],
+    "button functions": [attack, dodge, goTown],
+    text: "You are fighting a monster."
+  },
+  {
+    name: "kill monster",
+    "button text": ["Go to town square", "Go to town square", "Go to town square"],
+    "button functions": [goTown, goTown, easterEgg],
+    text: 'The monster screams "Arg!" as it dies. You gain experience points and find gold.'
+  },
+  {
+    name: "lose",
+    "button text": ["REPLAY?", "REPLAY?", "REPLAY?"],
+    "button functions": [restart, restart, restart],
+    text: "You die. ☠️"
+  },
+  { 
+    name: "win", 
+    "button text": ["Fight slime", "Fight fanged beast", "Go to town square"], 
+    "button functions": [restart, restart, restart], 
+    text: "You defeat the dragon! YOU WIN THE GAME! 🎉" 
+  },
+  {
+    name: "easter egg",
+    "button text": ["2", "8", "Go to town square?"],
+    "button functions": [pickTwo, pickEight, goTown],
+    text: "You find a secret game. Pick a number above. Ten numbers will be randomly chosen between 0 and 10. If the number you choose matches one of the random numbers, you win!"
+  }
+];
+
+// initialize buttons
+button1.onclick = goStore;
+button2.onclick = goCave;
+button3.onclick = fightDragon;
+
+function update(location) {  
+  monsterStats.style.display = "none";
+  button1.innerText = location["button text"][0];
+  button2.innerText = location["button text"][1];
+  button3.innerText = location["button text"][2];
+  button1.onclick = location["button functions"][0];
+  button2.onclick = location["button functions"][1];
+  button3.onclick = location["button functions"][2];
+  text.innerText = location.text;
+}
+
+function goTown() {
+  update(locations[0]);
+}
+
+function goStore() {
+  update(locations[1]);
+}
+
+function goCave() {
+  update(locations[2]);
+}
+
+function buyHealth() {
+  if (gold >= 10) {
+    gold -= 10;
+    health += 10;
+    goldText.innerText = gold;
+    healthText.innerText = health;
+  } else {
+    text.innerText = "You do not have enough gold to buy health.";
+  }
+}
+
+function buyWeapon() {
+  if (currentWeapon < weapons.length - 1) {
+    if (gold >= 30) {
+    gold -= 30;
+    currentWeapon++;
+    goldText.innerText = gold;
+    let newWeapon = weapons[currentWeapon].name;
+    text.innerText = "You now have a " + newWeapon + ".";
+    inventory.push(newWeapon);
+    text.innerText += " In your inventory you have: " + inventory;
+    } else {
+    text.innerText = "You do not have enough gold to buy a weapon.";
+    }
+  } else {
+    text.innerText = "You already have the most powerful weapon!";
+    button2.innerText = "Sell weapon for 15 gold";
+    button2.onclick = sellWeapon;
+  }
+}
+
+function sellWeapon() {
+  if (inventory.length > 1) {
+    gold += 15;
+    goldText.innerText = gold;
+    let currentWeapon = inventory.shift();
+    text.innerText = "You sold a " + currentWeapon + ".";
+    text.innerText += " In your inventory you have: " + inventory;
+  } else {
+    text.innerText = "Don't sell your only weapon!";
+  }
+}
+
+function fightSlime() {
+  fighting = 0;
+  goFight();
+}
+
+function fightBeast() {
+  fighting = 1;
+  goFight();
+}
+
+function fightDragon() {
+  fighting = 2;
+  goFight();
+}
+
+function goFight() {
+  update(locations[3]);
+  monsterHealth = monsters[fighting].health;
+  monsterStats.style.display = "block";
+  monsterNameText.innerText = monsters[fighting].name;
+  monsterHealthText.innerText = monsterHealth;
+}
+
+function attack() {
+  text.innerText = "The " + monsters[fighting].name + " attacks.";
+  text.innerText += " You attack it with your " + weapons[currentWeapon].name + ".";
+  health -= getMonsterAttackValue(monsters[fighting].level);
+
+  if (isMonsterHit()) {
+    monsterHealth -= weapons[currentWeapon].power + Math.floor(Math.random() * xp) + 1;
+  } else {
+    text.innerText += " You miss.";
+  }
+  healthText.innerText = health;
+  monsterHealthText.innerText = monsterHealth;
+  if (health <= 0) {
+    lose();
+  } else if (monsterHealth <= 0) {
+    fighting === 2 ? winGame() : defeatMonster();
+  }
+  if (Math.random() <= .1 && inventory.length !== 1) {
+    text.innerText += " Your " +  inventory.pop() + " breaks.";
+    currentWeapon--;
+  }
+}
+
+function getMonsterAttackValue(level) {
+  const hit = (level * 5) - (Math.floor(Math.random() * xp));
+  return hit > 0 ? hit : 0;
+}
+
+function isMonsterHit() {
+  return Math.random() > .2 || health < 20;
+}
+
+function dodge() {
+  text.innerText = "You dodge the attack from the " + monsters[fighting].name + ".";
+}
+
+function defeatMonster() {
+  gold += Math.floor(monsters[fighting].level * 6.7);
+  xp += monsters[fighting].level;
+  goldText.innerText = gold;
+  xpText.innerText = xp;
+  update(locations[4]);
+}
+
+function lose() {
+  update(locations[5]);
+}
+
+function winGame() {
+  update(locations[6]);
+}
+
+function restart() {
+  xp = 0;
+  health = 100;
+  gold = 50;
+  currentWeapon = 0;
+  inventory = ["stick"];
+  goldText.innerText = gold;
+  healthText.innerText = health;
+  xpText.innerText = xp;
+  goTown();
+}
+
+function easterEgg() {
+  update(locations[7]);
+}
+
+function pickTwo() {
+  pick(2);
+}
+
+function pickEight() {
+  pick(8);
+}
+
+function pick(guess) {
+  let numbers = [];
+  while(numbers.length < 10) {
+    numbers.push(Math.floor(Math.random() * 11));
+  }
+
+  text.innerText = "You picked " + guess + ". Here are the random numbers:\n";
+  
+  for (let i = 0; i < 10; i++) {
+    text.innerText += numbers[i] + "\n";
+  }
+
+  if (numbers.indexOf(guess) !== -1) {
+    text.innerText += "Right! You win 20 gold!";
+    gold += 20;
+    goldText.innerText = gold;
+  } else {
+    text.innerText += "Wrong! You lose 10 health!";
+    health -= 10;
+    healthText.innerText = health;
+    if (health <= 0) {
+    lose();
+    }
+  }
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
new file mode 100644
index 0000000000..f50a82a580
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-array-data-with-indexes.md
@@ -0,0 +1,89 @@
+---
+id: 56bbb991ad1ed5201cd392ca
+title: Access Array Data with Indexes
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cBZQbTz'
+forumTopicId: 16158
+dashedName: access-array-data-with-indexes
+---
+
+# --description--
+
+We can access the data inside arrays using <dfn>indexes</dfn>.
+
+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 has an index of `0`.
+
+<br>
+
+**Example**
+
+```js
+var array = [50,60,70];
+array[0];
+var data = array[1];
+```
+
+`array[0]` is now `50`, and `data` has the value `60`.
+
+**Note:** There shouldn't be any spaces between the array name and the square brackets, like `array [0]`. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.
+
+# --instructions--
+
+Create a variable called `myData` and set it to equal the first value of `myArray` using bracket notation.
+
+# --hints--
+
+The variable `myData` should equal the first value of `myArray`.
+
+```js
+assert(
+  (function () {
+    if (
+      typeof myArray !== 'undefined' &&
+      typeof myData !== 'undefined' &&
+      myArray[0] === myData
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+The data in variable `myArray` should be accessed using bracket notation.
+
+```js
+assert(
+  (function () {
+    if (code.match(/\s*=\s*myArray\[0\]/g)) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined" && typeof myData !== "undefined"){(function(y,z){return 'myArray = ' + JSON.stringify(y) + ', myData = ' + JSON.stringify(z);})(myArray, myData);}
+```
+
+## --seed-contents--
+
+```js
+var myArray = [50,60,70];
+
+
+```
+
+# --solutions--
+
+```js
+var myArray = [50,60,70];
+var myData = myArray[0];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
new file mode 100644
index 0000000000..e56375d274
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/access-multi-dimensional-arrays-with-indexes.md
@@ -0,0 +1,71 @@
+---
+id: 56592a60ddddeae28f7aa8e1
+title: Access Multi-Dimensional Arrays With Indexes
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ckND4Cq'
+forumTopicId: 16159
+dashedName: access-multi-dimensional-arrays-with-indexes
+---
+
+# --description--
+
+One way to think of a <dfn>multi-dimensional</dfn> array, is as an *array of arrays*. 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.
+
+**Example**
+
+```js
+var arr = [
+  [1,2,3],
+  [4,5,6],
+  [7,8,9],
+  [[10,11,12], 13, 14]
+];
+arr[3];
+arr[3][0];
+arr[3][0][1];
+```
+
+`arr[3]` is `[[10, 11, 12], 13, 14]`, `arr[3][0]` is `[10, 11, 12]`, and `arr[3][0][1]` is `11`.
+
+**Note:** There shouldn't be any spaces between the array name and the square brackets, like `array [0][0]` and even this `array [0] [0]` is not allowed. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.
+
+# --instructions--
+
+Using bracket notation select an element from `myArray` such that `myData` is equal to `8`.
+
+# --hints--
+
+`myData` should be equal to `8`.
+
+```js
+assert(myData === 8);
+```
+
+You should be using bracket notation to read the correct value from `myArray`.
+
+```js
+assert(/myData=myArray\[2\]\[1\]/.test(__helpers.removeWhiteSpace(code)));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return "myData: " + myData + " myArray: " + JSON.stringify(myArray);})();}
+```
+
+## --seed-contents--
+
+```js
+var myArray = [[1,2,3], [4,5,6], [7,8,9], [[10,11,12], 13, 14]];
+
+var myData = myArray[0][0];
+```
+
+# --solutions--
+
+```js
+var myArray = [[1,2,3],[4,5,6], [7,8,9], [[10,11,12], 13, 14]];
+var myData = myArray[2][1];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-arrays.md
new file mode 100644
index 0000000000..3d16e1f9f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-arrays.md
@@ -0,0 +1,120 @@
+---
+id: 56533eb9ac21ba0edf2244cd
+title: Accessing Nested Arrays
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cLeGDtZ'
+forumTopicId: 16160
+dashedName: 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:
+
+```js
+var ourPets = [
+  {
+    animalType: "cat",
+    names: [
+      "Meowzer",
+      "Fluffy",
+      "Kit-Cat"
+    ]
+  },
+  {
+    animalType: "dog",
+    names: [
+      "Spot",
+      "Bowser",
+      "Frankie"
+    ]
+  }
+];
+ourPets[0].names[1];
+ourPets[1].names[0];
+```
+
+`ourPets[0].names[1]` would be the string `Fluffy`, and `ourPets[1].names[0]` would be the string `Spot`.
+
+# --instructions--
+
+Using dot and bracket notation, set the variable `secondTree` to the second item in the `trees` list from the `myPlants` object.
+
+# --hints--
+
+`secondTree` should equal the string `pine`.
+
+```js
+assert(secondTree === 'pine');
+```
+
+Your code should use dot and bracket notation to access `myPlants`.
+
+```js
+assert(/=\s*myPlants\[1\].list\[1\]/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(x) {
+  if(typeof x != 'undefined') {
+    return "secondTree = " + x;
+  }
+  return "secondTree is undefined";
+})(secondTree);
+```
+
+## --seed-contents--
+
+```js
+var myPlants = [
+  {
+    type: "flowers",
+    list: [
+      "rose",
+      "tulip",
+      "dandelion"
+    ]
+  },
+  {
+    type: "trees",
+    list: [
+      "fir",
+      "pine",
+      "birch"
+    ]
+  }
+];
+
+var secondTree = "";
+```
+
+# --solutions--
+
+```js
+var myPlants = [
+  {
+    type: "flowers",
+    list: [
+      "rose",
+      "tulip",
+      "dandelion"
+    ]
+  },
+  {
+    type: "trees",
+    list: [
+      "fir",
+      "pine",
+      "birch"
+    ]
+  }
+];
+
+var secondTree = myPlants[1].list[1];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-objects.md
new file mode 100644
index 0000000000..02d5c6daff
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-nested-objects.md
@@ -0,0 +1,99 @@
+---
+id: 56533eb9ac21ba0edf2244cc
+title: Accessing Nested Objects
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cRnRnfa'
+forumTopicId: 16161
+dashedName: 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:
+
+```js
+var ourStorage = {
+  "desk": {
+    "drawer": "stapler"
+  },
+  "cabinet": {
+    "top drawer": { 
+      "folder1": "a file",
+      "folder2": "secrets"
+    },
+    "bottom drawer": "soda"
+  }
+};
+ourStorage.cabinet["top drawer"].folder2;
+ourStorage.desk.drawer;
+```
+
+`ourStorage.cabinet["top drawer"].folder2` would be the string `secrets`, and `ourStorage.desk.drawer` would be the string `stapler`.
+
+# --instructions--
+
+Access the `myStorage` object and assign the contents of the `glove box` property to the `gloveBoxContents` variable. Use dot notation for all properties where possible, otherwise use bracket notation.
+
+# --hints--
+
+`gloveBoxContents` should equal the string `maps`.
+
+```js
+assert(gloveBoxContents === 'maps');
+```
+
+Your code should use dot and bracket notation to access `myStorage`.
+
+```js
+assert(/=\s*myStorage\.car\.inside\[\s*("|')glove box\1\s*\]/g.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(x) { 
+  if(typeof x != 'undefined') { 
+    return "gloveBoxContents = " + x;
+  }
+  return "gloveBoxContents is undefined";
+})(gloveBoxContents);
+```
+
+## --seed-contents--
+
+```js
+var myStorage = {
+  "car": {
+    "inside": {
+      "glove box": "maps",
+      "passenger seat": "crumbs"
+     },
+    "outside": {
+      "trunk": "jack"
+    }
+  }
+};
+
+var gloveBoxContents = undefined;
+```
+
+# --solutions--
+
+```js
+var myStorage = {
+  "car":{
+    "inside":{
+      "glove box":"maps",
+      "passenger seat":"crumbs"
+    },
+    "outside":{
+      "trunk":"jack"
+    }
+  }
+};
+var gloveBoxContents = myStorage.car.inside["glove box"];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-bracket-notation.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-bracket-notation.md
new file mode 100644
index 0000000000..5716362cf9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-bracket-notation.md
@@ -0,0 +1,103 @@
+---
+id: 56533eb9ac21ba0edf2244c8
+title: Accessing Object Properties with Bracket Notation
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cBvmEHP'
+forumTopicId: 16163
+dashedName: accessing-object-properties-with-bracket-notation
+---
+
+# --description--
+
+The second way to access the properties of an object is bracket notation (`[]`). If the property of the object you are trying to access has a space in its name, you will need to use bracket notation.
+
+However, you can still use bracket notation on object properties without spaces.
+
+Here is a sample of using bracket notation to read an object's property:
+
+```js
+var myObj = {
+  "Space Name": "Kirk",
+  "More Space": "Spock",
+  "NoSpace": "USS Enterprise"
+};
+myObj["Space Name"];
+myObj['More Space'];
+myObj["NoSpace"];
+```
+
+`myObj["Space Name"]` would be the string `Kirk`, `myObj['More Space']` would be the string `Spock`, and `myObj["NoSpace"]` would be the string `USS Enterprise`.
+
+Note that property names with spaces in them must be in quotes (single or double).
+
+# --instructions--
+
+Read the values of the properties `an entree` and `the drink` of `testObj` using bracket notation and assign them to `entreeValue` and `drinkValue` respectively.
+
+# --hints--
+
+`entreeValue` should be a string
+
+```js
+assert(typeof entreeValue === 'string');
+```
+
+The value of `entreeValue` should be the string `hamburger`
+
+```js
+assert(entreeValue === 'hamburger');
+```
+
+`drinkValue` should be a string
+
+```js
+assert(typeof drinkValue === 'string');
+```
+
+The value of `drinkValue` should be the string `water`
+
+```js
+assert(drinkValue === 'water');
+```
+
+You should use bracket notation twice
+
+```js
+assert(code.match(/testObj\s*?\[('|")[^'"]+\1\]/g).length > 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b) { return "entreeValue = '" + a + "', drinkValue = '" + b + "'"; })(entreeValue,drinkValue);
+```
+
+## --seed-contents--
+
+```js
+// 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
+```
+
+# --solutions--
+
+```js
+var testObj = {
+  "an entree": "hamburger",
+  "my side": "veggies",
+  "the drink": "water"
+};
+var entreeValue = testObj["an entree"];
+var drinkValue = testObj['the drink'];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-dot-notation.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-dot-notation.md
new file mode 100644
index 0000000000..d420ede372
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-dot-notation.md
@@ -0,0 +1,99 @@
+---
+id: 56533eb9ac21ba0edf2244c7
+title: Accessing Object Properties with Dot Notation
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cGryJs8'
+forumTopicId: 16164
+dashedName: accessing-object-properties-with-dot-notation
+---
+
+# --description--
+
+There are two ways to access the properties of an object: dot notation (`.`) and bracket notation (`[]`), similar to an array.
+
+Dot notation 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 dot notation (`.`) to read an object's property:
+
+```js
+var myObj = {
+  prop1: "val1",
+  prop2: "val2"
+};
+var prop1val = myObj.prop1;
+var prop2val = myObj.prop2;
+```
+
+`prop1val` would have a value of the string `val1`, and `prop2val` would have a value of the string `val2`.
+# --instructions--
+
+Read in the property values of `testObj` using dot notation. Set the variable `hatValue` equal to the object's property `hat` and set the variable `shirtValue` equal to the object's property `shirt`.
+
+# --hints--
+
+`hatValue` should be a string
+
+```js
+assert(typeof hatValue === 'string');
+```
+
+The value of `hatValue` should be the string `ballcap`
+
+```js
+assert(hatValue === 'ballcap');
+```
+
+`shirtValue` should be a string
+
+```js
+assert(typeof shirtValue === 'string');
+```
+
+The value of `shirtValue` should be the string `jersey`
+
+```js
+assert(shirtValue === 'jersey');
+```
+
+You should use dot notation twice
+
+```js
+assert(code.match(/testObj\.\w+/g).length > 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b) { return "hatValue = '" + a + "', shirtValue = '" + b + "'"; })(hatValue,shirtValue);
+```
+
+## --seed-contents--
+
+```js
+// 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
+```
+
+# --solutions--
+
+```js
+var testObj = {
+  "hat": "ballcap",
+  "shirt": "jersey",
+  "shoes": "cleats"
+};
+
+var hatValue = testObj.hat;
+var shirtValue = testObj.shirt;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
new file mode 100644
index 0000000000..2ec802ab59
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/accessing-object-properties-with-variables.md
@@ -0,0 +1,121 @@
+---
+id: 56533eb9ac21ba0edf2244c9
+title: Accessing Object Properties with Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cnQyKur'
+forumTopicId: 16165
+dashedName: accessing-object-properties-with-variables
+---
+
+# --description--
+
+Another use of bracket notation on objects is to access a property which is stored as the value of a variable. This can be very useful for iterating through an object's properties or when accessing a lookup table.
+
+Here is an example of using a variable to access a property:
+
+```js
+var dogs = {
+  Fido: "Mutt",  Hunter: "Doberman",  Snoopie: "Beagle"
+};
+var myDog = "Hunter";
+var myBreed = dogs[myDog];
+console.log(myBreed);
+```
+
+The string `Doberman` would be displayed in the console.
+
+Another way you can use this concept is when the property's name is collected dynamically during the program execution, as follows:
+
+```js
+var someObj = {
+  propName: "John"
+};
+function propPrefix(str) {
+  var s = "prop";
+  return s + str;
+}
+var someProp = propPrefix("Name");
+console.log(someObj[someProp]);
+```
+
+`someProp` would have a value of the string `propName`, and the string `John` would be displayed in the console.
+
+Note that we do *not* use quotes around the variable name when using it to access the property because we are using the *value* of the variable, not the *name*.
+
+# --instructions--
+
+Set the `playerNumber` variable to `16`. Then, use the variable to look up the player's name and assign it to `player`.
+
+# --hints--
+
+`playerNumber` should be a number
+
+```js
+assert(typeof playerNumber === 'number');
+```
+
+The variable `player` should be a string
+
+```js
+assert(typeof player === 'string');
+```
+
+The value of `player` should be the string `Montana`
+
+```js
+assert(player === 'Montana');
+```
+
+You should use bracket notation to access `testObj`
+
+```js
+assert(/testObj\s*?\[.*?\]/.test(code));
+```
+
+You should not assign the value `Montana` to the variable `player` directly.
+
+```js
+assert(!code.match(/player\s*=\s*"|\'\s*Montana\s*"|\'\s*;/gi));
+```
+
+You should be using the variable `playerNumber` in your bracket notation
+
+```js
+assert(/testObj\s*?\[\s*playerNumber\s*\]/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof player !== "undefined"){(function(v){return v;})(player);}
+```
+
+## --seed-contents--
+
+```js
+// 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
+```
+
+# --solutions--
+
+```js
+var testObj = {
+  12: "Namath",
+  16: "Montana",
+  19: "Unitas"
+};
+var playerNumber = 16;
+var player = testObj[playerNumber];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-new-properties-to-a-javascript-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-new-properties-to-a-javascript-object.md
new file mode 100644
index 0000000000..b73a21ef9f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-new-properties-to-a-javascript-object.md
@@ -0,0 +1,90 @@
+---
+id: 56bbb991ad1ed5201cd392d2
+title: Add New Properties to a JavaScript Object
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cQe38UD'
+forumTopicId: 301169
+dashedName: 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 `bark` property to `ourDog`:
+
+```js
+ourDog.bark = "bow-wow";
+```
+
+or
+
+```js
+ourDog["bark"] = "bow-wow";
+```
+
+Now when we evaluate `ourDog.bark`, we'll get his bark, `bow-wow`.
+
+Example:
+
+```js
+var ourDog = {
+  "name": "Camper",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["everything!"]
+};
+
+ourDog.bark = "bow-wow";
+```
+
+# --instructions--
+
+Add a `bark` property to `myDog` and set it to a dog sound, such as "woof". You may use either dot or bracket notation.
+
+# --hints--
+
+You should add the property `bark` to `myDog`.
+
+```js
+assert(myDog.bark !== undefined);
+```
+
+You should not add `bark` to the initialization of `myDog`.
+
+```js
+assert(!/bark[^\n]:/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return z;})(myDog);
+```
+
+## --seed-contents--
+
+```js
+var myDog = {
+  "name": "Happy Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"]
+};
+
+
+```
+
+# --solutions--
+
+```js
+var myDog = {
+  "name": "Happy Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"]
+};
+myDog.bark = "Woof Woof";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-two-numbers-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-two-numbers-with-javascript.md
new file mode 100644
index 0000000000..3703a18fb2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/add-two-numbers-with-javascript.md
@@ -0,0 +1,62 @@
+---
+id: cf1111c1c11feddfaeb3bdef
+title: Add Two Numbers with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cM2KBAG'
+forumTopicId: 16650
+dashedName: add-two-numbers-with-javascript
+---
+
+# --description--
+
+`Number` is a data type in JavaScript which represents numeric data.
+
+Now let's try to add two numbers using JavaScript.
+
+JavaScript uses the `+` symbol as an addition operator when placed between two numbers.
+
+**Example:**
+
+```js
+myVar = 5 + 10;
+```
+
+`myVar` now has the value `15`.
+
+# --instructions--
+
+Change the `0` so that sum will equal `20`.
+
+# --hints--
+
+`sum` should equal `20`.
+
+```js
+assert(sum === 20);
+```
+
+You should use the `+` operator.
+
+```js
+assert(/\+/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'sum = '+z;})(sum);
+```
+
+## --seed-contents--
+
+```js
+var sum = 10 + 0;
+```
+
+# --solutions--
+
+```js
+var sum = 10 + 10;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/adding-a-default-option-in-switch-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/adding-a-default-option-in-switch-statements.md
new file mode 100644
index 0000000000..dc1c62c6d4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/adding-a-default-option-in-switch-statements.md
@@ -0,0 +1,128 @@
+---
+id: 56533eb9ac21ba0edf2244de
+title: Adding a Default Option in Switch Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c3JvVfg'
+forumTopicId: 16653
+dashedName: adding-a-default-option-in-switch-statements
+---
+
+# --description--
+
+In a `switch` statement you may not be able to specify all possible values as `case` statements. Instead, you can add the `default` statement which will be executed if no matching `case` statements are found. Think of it like the final `else` statement in an `if/else` chain.
+
+A `default` statement should be the last case.
+
+```js
+switch (num) {
+  case value1:
+    statement1;
+    break;
+  case value2:
+    statement2;
+    break;
+...
+  default:
+    defaultStatement;
+    break;
+}
+```
+
+# --instructions--
+
+Write a switch statement to set `answer` for the following conditions:  
+`a` - `apple`  
+`b` - `bird`  
+`c` - `cat`  
+`default` - `stuff`
+
+# --hints--
+
+`switchOfStuff("a")` should return the string `apple`
+
+```js
+assert(switchOfStuff('a') === 'apple');
+```
+
+`switchOfStuff("b")` should return the string `bird`
+
+```js
+assert(switchOfStuff('b') === 'bird');
+```
+
+`switchOfStuff("c")` should return the string `cat`
+
+```js
+assert(switchOfStuff('c') === 'cat');
+```
+
+`switchOfStuff("d")` should return the string `stuff`
+
+```js
+assert(switchOfStuff('d') === 'stuff');
+```
+
+`switchOfStuff(4)` should return the string `stuff`
+
+```js
+assert(switchOfStuff(4) === 'stuff');
+```
+
+You should not use any `if` or `else` statements
+
+```js
+assert(!/else/g.test(code) || !/if/g.test(code));
+```
+
+You should use a `default` statement
+
+```js
+assert(switchOfStuff('string-to-trigger-default-case') === 'stuff');
+```
+
+You should have at least 3 `break` statements
+
+```js
+assert(code.match(/break/g).length > 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function switchOfStuff(val) {
+  var answer = "";
+  // Only change code below this line
+
+
+
+  // Only change code above this line
+  return answer;
+}
+
+switchOfStuff(1);
+```
+
+# --solutions--
+
+```js
+function switchOfStuff(val) {
+  var answer = "";
+
+  switch(val) {
+    case "a":
+      answer = "apple";
+      break;
+    case "b":
+      answer = "bird";
+      break;
+    case "c":
+      answer = "cat";
+      break;
+    default:
+      answer = "stuff";
+  }
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/appending-variables-to-strings.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/appending-variables-to-strings.md
new file mode 100644
index 0000000000..3ca8297b81
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/appending-variables-to-strings.md
@@ -0,0 +1,78 @@
+---
+id: 56533eb9ac21ba0edf2244ed
+title: Appending Variables to Strings
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cbQmZfa'
+forumTopicId: 16656
+dashedName: 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 (`+=`) operator.
+
+Example:
+
+```js
+var anAdjective = "awesome!";
+var ourStr = "freeCodeCamp is ";
+ourStr += anAdjective;
+```
+
+`ourStr` would have the value `freeCodeCamp is awesome!`.
+
+# --instructions--
+
+Set `someAdjective` to a string of at least 3 characters and append it to `myStr` using the `+=` operator.
+
+# --hints--
+
+`someAdjective` should be set to a string at least 3 characters long.
+
+```js
+assert(typeof someAdjective !== 'undefined' && someAdjective.length > 2);
+```
+
+You should append `someAdjective` to `myStr` using the `+=` operator.
+
+```js
+assert(code.match(/myStr\s*\+=\s*someAdjective\s*/).length > 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(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');
+})();
+```
+
+## --seed-contents--
+
+```js
+// Change code below this line
+
+var someAdjective;
+var myStr = "Learning to code is ";
+```
+
+# --solutions--
+
+```js
+var someAdjective = "neat";
+var myStr = "Learning to code is ";
+myStr += someAdjective;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assigning-the-value-of-one-variable-to-another.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assigning-the-value-of-one-variable-to-another.md
new file mode 100644
index 0000000000..ad5a0371ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assigning-the-value-of-one-variable-to-another.md
@@ -0,0 +1,86 @@
+---
+id: 5ee127a03c3b35dd45426493
+title: Assigning the Value of One Variable to Another
+challengeType: 1
+videoUrl: ''
+forumTopicId: 418265
+dashedName: assigning-the-value-of-one-variable-to-another
+---
+
+# --description--
+
+After a value is assigned to a variable using the <dfn>assignment</dfn> operator, you can assign the value of that variable to another variable using the <dfn>assignment</dfn> operator.
+
+```js
+var myVar;
+myVar = 5;
+var myNum;
+myNum = myVar;
+```
+
+The above declares a `myVar` variable with no value, then assigns it the value `5`. Next, a variable named `myNum` is declared with no value. Then, the contents of `myVar` (which is `5`) is assigned to the variable `myNum`. Now, `myNum` also has the value of `5`.
+
+# --instructions--
+
+Assign the contents of `a` to variable `b`.
+
+# --hints--
+
+You should not change code above the specified comment.
+
+```js
+assert(/var a;/.test(code) && /a = 7;/.test(code) && /var b;/.test(code));
+```
+
+`b` should have a value of `7`.
+
+```js
+assert(typeof b === 'number' && b === 7);
+```
+
+`a` should be assigned to `b` with `=`.
+
+```js
+assert(/b\s*=\s*a\s*/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+if (typeof a != 'undefined') {
+  a = undefined;
+}
+if (typeof b != 'undefined') {
+  b = undefined;
+}
+```
+
+## --after-user-code--
+
+```js
+(function(a, b) {
+  return 'a = ' + a + ', b = ' + b;
+})(a, b);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var a;
+a = 7;
+var b;
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var a;
+a = 7;
+var b;
+b = a;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
new file mode 100644
index 0000000000..cfdf53c228
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/assignment-with-a-returned-value.md
@@ -0,0 +1,71 @@
+---
+id: 56533eb9ac21ba0edf2244c3
+title: Assignment with a Returned Value
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ce2pEtB'
+forumTopicId: 16658
+dashedName: assignment-with-a-returned-value
+---
+
+# --description--
+
+If you'll recall from our discussion of [Storing Values with the Assignment Operator](/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator), 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 `sum` which adds two numbers together, then:
+
+```js
+ourSum = sum(5, 12);
+```
+
+will call `sum` function, which returns a value of `17` and assigns it to `ourSum` variable.
+
+# --instructions--
+
+Call the `processArg` function with an argument of `7` and assign its return value to the variable `processed`.
+
+# --hints--
+
+`processed` should have a value of `2`
+
+```js
+assert(processed === 2);
+```
+
+You should assign `processArg` to `processed`
+
+```js
+assert(/processed\s*=\s*processArg\(\s*7\s*\)/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){return "processed = " + processed})();
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var processed = 0;
+
+function processArg(num) {
+  return (num + 3) / 5;
+}
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var processed = 0;
+
+function processArg(num) {
+  return (num + 3) / 5;
+}
+
+processed = processArg(7);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/build-javascript-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/build-javascript-objects.md
new file mode 100644
index 0000000000..b67d8c4d52
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/build-javascript-objects.md
@@ -0,0 +1,159 @@
+---
+id: 56bbb991ad1ed5201cd392d0
+title: Build JavaScript Objects
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cWGkbtd'
+forumTopicId: 16769
+dashedName: build-javascript-objects
+---
+
+# --description--
+
+You may have heard the term `object` before.
+
+Objects are similar to `arrays`, except that instead of using indexes to access and modify their data, you access the data in objects through what are called `properties`.
+
+Objects are useful for storing data in a structured way, and can represent real world objects, like a cat.
+
+Here's a sample cat object:
+
+```js
+var cat = {
+  "name": "Whiskers",
+  "legs": 4,
+  "tails": 1,
+  "enemies": ["Water", "Dogs"]
+};
+```
+
+In this example, all the properties are stored as strings, such as - `name`, `legs`, and `tails`. However, you can also use numbers as properties. You can even omit the quotes for single-word string properties, as follows:
+
+```js
+var anotherObject = {
+  make: "Ford",
+  5: "five",
+  "model": "focus"
+};
+```
+
+However, if your object has any non-string properties, JavaScript will automatically typecast them as strings.
+
+# --instructions--
+
+Make an object that represents a dog called `myDog` which contains the properties `name` (a string), `legs`, `tails` and `friends`.
+
+You can set these object properties to whatever values you want, as long as `name` is a string, `legs` and `tails` are numbers, and `friends` is an array.
+
+# --hints--
+
+`myDog` should contain the property `name` and it should be a `string`.
+
+```js
+assert(
+  (function (z) {
+    if (
+      z.hasOwnProperty('name') &&
+      z.name !== undefined &&
+      typeof z.name === 'string'
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myDog)
+);
+```
+
+`myDog` should contain the property `legs` and it should be a `number`.
+
+```js
+assert(
+  (function (z) {
+    if (
+      z.hasOwnProperty('legs') &&
+      z.legs !== undefined &&
+      typeof z.legs === 'number'
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myDog)
+);
+```
+
+`myDog` should contain the property `tails` and it should be a `number`.
+
+```js
+assert(
+  (function (z) {
+    if (
+      z.hasOwnProperty('tails') &&
+      z.tails !== undefined &&
+      typeof z.tails === 'number'
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myDog)
+);
+```
+
+`myDog` should contain the property `friends` and it should be an `array`.
+
+```js
+assert(
+  (function (z) {
+    if (
+      z.hasOwnProperty('friends') &&
+      z.friends !== undefined &&
+      Array.isArray(z.friends)
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myDog)
+);
+```
+
+`myDog` should only contain all the given properties.
+
+```js
+assert(
+  (function (z) {
+    return Object.keys(z).length === 4;
+  })(myDog)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return z;})(myDog);
+```
+
+## --seed-contents--
+
+```js
+var myDog = {
+// Only change code below this line
+
+
+// Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+var myDog = {
+  "name": "Camper",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["everything!"]
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements.md
new file mode 100644
index 0000000000..608723120c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements.md
@@ -0,0 +1,149 @@
+---
+id: 56533eb9ac21ba0edf2244dc
+title: Chaining If Else Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/caeJgsw'
+forumTopicId: 16772
+dashedName: chaining-if-else-statements
+---
+
+# --description--
+
+`if/else` statements can be chained together for complex logic. Here is <dfn>pseudocode</dfn> of multiple chained `if` / `else if` statements:
+
+```js
+if (condition1) {
+  statement1
+} else if (condition2) {
+  statement2
+} else if (condition3) {
+  statement3
+. . .
+} else {
+  statementN
+}
+```
+
+# --instructions--
+
+Write chained `if`/`else if` statements to fulfill the following conditions:
+
+`num < 5` - return `Tiny`  
+`num < 10` - return `Small`  
+`num < 15` - return `Medium`  
+`num < 20` - return `Large`  
+`num >= 20` - return `Huge`
+
+# --hints--
+
+You should have at least four `else` statements
+
+```js
+assert(code.match(/else/g).length > 3);
+```
+
+You should have at least four `if` statements
+
+```js
+assert(code.match(/if/g).length > 3);
+```
+
+You should have at least one `return` statement
+
+```js
+assert(code.match(/return/g).length >= 1);
+```
+
+`testSize(0)` should return the string `Tiny`
+
+```js
+assert(testSize(0) === 'Tiny');
+```
+
+`testSize(4)` should return the string `Tiny`
+
+```js
+assert(testSize(4) === 'Tiny');
+```
+
+`testSize(5)` should return the string `Small`
+
+```js
+assert(testSize(5) === 'Small');
+```
+
+`testSize(8)` should return the string `Small`
+
+```js
+assert(testSize(8) === 'Small');
+```
+
+`testSize(10)` should return the string `Medium`
+
+```js
+assert(testSize(10) === 'Medium');
+```
+
+`testSize(14)` should return the string `Medium`
+
+```js
+assert(testSize(14) === 'Medium');
+```
+
+`testSize(15)` should return the string `Large`
+
+```js
+assert(testSize(15) === 'Large');
+```
+
+`testSize(17)` should return the string `Large`
+
+```js
+assert(testSize(17) === 'Large');
+```
+
+`testSize(20)` should return the string `Huge`
+
+```js
+assert(testSize(20) === 'Huge');
+```
+
+`testSize(25)` should return the string `Huge`
+
+```js
+assert(testSize(25) === 'Huge');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function testSize(num) {
+  // Only change code below this line
+
+
+  return "Change Me";
+  // Only change code above this line
+}
+
+testSize(7);
+```
+
+# --solutions--
+
+```js
+function testSize(num) {
+  if (num < 5) {
+    return "Tiny";
+  } else if (num < 10) {
+    return "Small";
+  } else if (num < 15) {
+    return "Medium";
+  } else if (num < 20) {
+    return "Large";
+  } else {
+    return "Huge";
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
new file mode 100644
index 0000000000..a5f59ff63f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comment-your-javascript-code.md
@@ -0,0 +1,63 @@
+---
+id: bd7123c9c441eddfaeb4bdef
+title: Comment Your JavaScript Code
+challengeType: 1
+removeComments: false
+videoUrl: 'https://scrimba.com/c/c7ynnTp'
+forumTopicId: 16783
+dashedName: 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 `//` will tell JavaScript to ignore the remainder of the text on the current line. This is an in-line comment:
+
+```js
+// This is an in-line comment.
+```
+
+You can make a multi-line comment beginning with `/*` and ending with `*/`. This is a multi-line comment:
+
+```js
+/* This is a
+multi-line comment */
+```
+
+**NOTE:** 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—both for others *and* for your future self.
+
+# --instructions--
+
+Try creating one of each type of comment.
+
+# --hints--
+
+You should create a `//` style comment that contains at least five letters.
+
+```js
+assert(code.match(/(\/\/)...../g));
+```
+
+You should create a `/* */` style comment that contains at least five letters.
+
+```js
+assert(code.match(/(\/\*)([^\/]{5,})(?=\*\/)/gm));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+// Fake Comment
+/* Another Comment */
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
new file mode 100644
index 0000000000..7bd40b179f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator.md
@@ -0,0 +1,91 @@
+---
+id: 56533eb9ac21ba0edf2244d0
+title: Comparison with the Equality Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cKyVMAL'
+forumTopicId: 16784
+dashedName: comparison-with-the-equality-operator
+---
+
+# --description--
+
+There are many <dfn>comparison operators</dfn> in JavaScript. All of these operators return a boolean `true` or `false` value.
+
+The most basic operator is the equality operator `==`. The equality operator compares two values and returns `true` if they're equivalent or `false` if they are not. Note that equality is different from assignment (`=`), which assigns the value on the right of the operator to a variable on the left.
+
+```js
+function equalityTest(myVal) {
+  if (myVal == 10) {
+     return "Equal";
+  }
+  return "Not Equal";
+}
+```
+
+If `myVal` is equal to `10`, the equality operator returns `true`, so the code in the curly braces will execute, and the function will return `Equal`. Otherwise, the function will return `Not Equal`. In order for JavaScript to compare two different <dfn>data types</dfn> (for example, `numbers` and `strings`), it must convert one type to another. This is known as Type Coercion. Once it does, however, it can compare terms as follows:
+
+```js
+1   ==  1
+1   ==  2
+1   == '1'
+"3" ==  3
+```
+
+In order, these expressions would evaluate to `true`, `false`, `true`, and `true`.
+
+# --instructions--
+
+Add the equality operator to the indicated line so that the function will return the string `Equal` when `val` is equivalent to `12`.
+
+# --hints--
+
+`testEqual(10)` should return the string `Not Equal`
+
+```js
+assert(testEqual(10) === 'Not Equal');
+```
+
+`testEqual(12)` should return the string `Equal`
+
+```js
+assert(testEqual(12) === 'Equal');
+```
+
+`testEqual("12")` should return the string `Equal`
+
+```js
+assert(testEqual('12') === 'Equal');
+```
+
+You should use the `==` operator
+
+```js
+assert(code.match(/==/g) && !code.match(/===/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+function testEqual(val) {
+  if (val) { // Change this line
+    return "Equal";
+  }
+  return "Not Equal";
+}
+
+testEqual(10);
+```
+
+# --solutions--
+
+```js
+function testEqual(val) {
+  if (val == 12) {
+    return "Equal";
+  }
+  return "Not Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
new file mode 100644
index 0000000000..63f28cd07a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-operator.md
@@ -0,0 +1,113 @@
+---
+id: 56533eb9ac21ba0edf2244d4
+title: Comparison with the Greater Than Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cp6GbH4'
+forumTopicId: 16786
+dashedName: comparison-with-the-greater-than-operator
+---
+
+# --description--
+
+The greater than operator (`>`) compares the values of two numbers. If the number to the left is greater than the number to the right, it returns `true`. Otherwise, it returns `false`.
+
+Like the equality operator, the greater than operator will convert data types of values while comparing.
+
+**Examples**
+
+```js
+5   >  3
+7   > '3'
+2   >  3
+'1' >  9
+```
+
+In order, these expressions would evaluate to `true`, `true`, `false`, and `false`.
+
+# --instructions--
+
+Add the greater than operator to the indicated lines so that the return statements make sense.
+
+# --hints--
+
+`testGreaterThan(0)` should return the string `10 or Under`
+
+```js
+assert(testGreaterThan(0) === '10 or Under');
+```
+
+`testGreaterThan(10)` should return the string `10 or Under`
+
+```js
+assert(testGreaterThan(10) === '10 or Under');
+```
+
+`testGreaterThan(11)` should return the string `Over 10`
+
+```js
+assert(testGreaterThan(11) === 'Over 10');
+```
+
+`testGreaterThan(99)` should return the string `Over 10`
+
+```js
+assert(testGreaterThan(99) === 'Over 10');
+```
+
+`testGreaterThan(100)` should return the string `Over 10`
+
+```js
+assert(testGreaterThan(100) === 'Over 10');
+```
+
+`testGreaterThan(101)` should return the string `Over 100`
+
+```js
+assert(testGreaterThan(101) === 'Over 100');
+```
+
+`testGreaterThan(150)` should return the string `Over 100`
+
+```js
+assert(testGreaterThan(150) === 'Over 100');
+```
+
+You should use the `>` operator at least twice
+
+```js
+assert(code.match(/val\s*>\s*('|")*\d+('|")*/g).length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function testGreaterThan(val) {
+  if (val) {  // Change this line
+    return "Over 100";
+  }
+
+  if (val) {  // Change this line
+    return "Over 10";
+  }
+
+  return "10 or Under";
+}
+
+testGreaterThan(10);
+```
+
+# --solutions--
+
+```js
+function testGreaterThan(val) {
+  if (val > 100) {  // Change this line
+    return "Over 100";
+  }
+  if (val > 10) {  // Change this line
+    return "Over 10";
+  }
+  return "10 or Under";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
new file mode 100644
index 0000000000..a4933c2f84
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-greater-than-or-equal-to-operator.md
@@ -0,0 +1,115 @@
+---
+id: 56533eb9ac21ba0edf2244d5
+title: Comparison with the Greater Than Or Equal To Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c6KBqtV'
+forumTopicId: 16785
+dashedName: comparison-with-the-greater-than-or-equal-to-operator
+---
+
+# --description--
+
+The greater than or equal to operator (`>=`) 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 `true`. Otherwise, it returns `false`.
+
+Like the equality operator, the greater than or equal to operator will convert data types while comparing.
+
+**Examples**
+
+```js
+6   >=  6
+7   >= '3'
+2   >=  3
+'7' >=  9
+```
+
+In order, these expressions would evaluate to `true`, `true`, `false`, and `false`.
+
+# --instructions--
+
+Add the greater than or equal to operator to the indicated lines so that the return statements make sense.
+
+# --hints--
+
+`testGreaterOrEqual(0)` should return the string `Less than 10`
+
+```js
+assert(testGreaterOrEqual(0) === 'Less than 10');
+```
+
+`testGreaterOrEqual(9)` should return the string `Less than 10`
+
+```js
+assert(testGreaterOrEqual(9) === 'Less than 10');
+```
+
+`testGreaterOrEqual(10)` should return the string `10 or Over`
+
+```js
+assert(testGreaterOrEqual(10) === '10 or Over');
+```
+
+`testGreaterOrEqual(11)` should return the string `10 or Over`
+
+```js
+assert(testGreaterOrEqual(11) === '10 or Over');
+```
+
+`testGreaterOrEqual(19)` should return the string `10 or Over`
+
+```js
+assert(testGreaterOrEqual(19) === '10 or Over');
+```
+
+`testGreaterOrEqual(100)` should return the string `20 or Over`
+
+```js
+assert(testGreaterOrEqual(100) === '20 or Over');
+```
+
+`testGreaterOrEqual(21)` should return the string `20 or Over`
+
+```js
+assert(testGreaterOrEqual(21) === '20 or Over');
+```
+
+You should use the `>=` operator at least twice
+
+```js
+assert(code.match(/val\s*>=\s*('|")*\d+('|")*/g).length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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";
+}
+
+testGreaterOrEqual(10);
+```
+
+# --solutions--
+
+```js
+function testGreaterOrEqual(val) {
+  if (val >= 20) {  // Change this line
+    return "20 or Over";
+  }
+
+  if (val >= 10) {  // Change this line
+    return "10 or Over";
+  }
+
+  return "Less than 10";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
new file mode 100644
index 0000000000..6b303c3517
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator.md
@@ -0,0 +1,93 @@
+---
+id: 56533eb9ac21ba0edf2244d2
+title: Comparison with the Inequality Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cdBm9Sr'
+forumTopicId: 16787
+dashedName: comparison-with-the-inequality-operator
+---
+
+# --description--
+
+The inequality operator (`!=`) is the opposite of the equality operator. It means not equal and returns `false` where equality would return `true` and *vice versa*. Like the equality operator, the inequality operator will convert data types of values while comparing.
+
+**Examples**
+
+```js
+1 !=  2
+1 != "1"
+1 != '1'
+1 != true
+0 != false
+```
+
+In order, these expressions would evaluate to `true`, `false`, `false`, `false`, and `false`.
+
+# --instructions--
+
+Add the inequality operator `!=` in the `if` statement so that the function will return the string `Not Equal` when `val` is not equivalent to `99`
+
+# --hints--
+
+`testNotEqual(99)` should return the string `Equal`
+
+```js
+assert(testNotEqual(99) === 'Equal');
+```
+
+`testNotEqual("99")` should return the string `Equal`
+
+```js
+assert(testNotEqual('99') === 'Equal');
+```
+
+`testNotEqual(12)` should return the string `Not Equal`
+
+```js
+assert(testNotEqual(12) === 'Not Equal');
+```
+
+`testNotEqual("12")` should return the string `Not Equal`
+
+```js
+assert(testNotEqual('12') === 'Not Equal');
+```
+
+`testNotEqual("bob")` should return the string `Not Equal`
+
+```js
+assert(testNotEqual('bob') === 'Not Equal');
+```
+
+You should use the `!=` operator
+
+```js
+assert(code.match(/(?!!==)!=/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+function testNotEqual(val) {
+  if (val) { // Change this line
+    return "Not Equal";
+  }
+  return "Equal";
+}
+
+testNotEqual(10);
+```
+
+# --solutions--
+
+```js
+function testNotEqual(val) {
+  if (val != 99) {
+    return "Not Equal";
+  }
+  return "Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
new file mode 100644
index 0000000000..578b5b80ee
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-operator.md
@@ -0,0 +1,108 @@
+---
+id: 56533eb9ac21ba0edf2244d6
+title: Comparison with the Less Than Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cNVRWtB'
+forumTopicId: 16789
+dashedName: comparison-with-the-less-than-operator
+---
+
+# --description--
+
+The less than operator (`<`) compares the values of two numbers. If the number to the left is less than the number to the right, it returns `true`. Otherwise, it returns `false`. Like the equality operator, the less than operator converts data types while comparing.
+
+**Examples**
+
+```js
+2   < 5
+'3' < 7
+5   < 5
+3   < 2
+'8' < 4
+```
+
+In order, these expressions would evaluate to `true`, `true`, `false`, `false`, and `false`.
+
+# --instructions--
+
+Add the less than operator to the indicated lines so that the return statements make sense.
+
+# --hints--
+
+`testLessThan(0)` should return the string `Under 25`
+
+```js
+assert(testLessThan(0) === 'Under 25');
+```
+
+`testLessThan(24)` should return the string `Under 25`
+
+```js
+assert(testLessThan(24) === 'Under 25');
+```
+
+`testLessThan(25)` should return the string `Under 55`
+
+```js
+assert(testLessThan(25) === 'Under 55');
+```
+
+`testLessThan(54)` should return the string `Under 55`
+
+```js
+assert(testLessThan(54) === 'Under 55');
+```
+
+`testLessThan(55)` should return the string `55 or Over`
+
+```js
+assert(testLessThan(55) === '55 or Over');
+```
+
+`testLessThan(99)` should return the string `55 or Over`
+
+```js
+assert(testLessThan(99) === '55 or Over');
+```
+
+You should use the `<` operator at least twice
+
+```js
+assert(code.match(/val\s*<\s*('|")*\d+('|")*/g).length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function testLessThan(val) {
+  if (val) {  // Change this line
+    return "Under 25";
+  }
+
+  if (val) {  // Change this line
+    return "Under 55";
+  }
+
+  return "55 or Over";
+}
+
+testLessThan(10);
+```
+
+# --solutions--
+
+```js
+function testLessThan(val) {
+  if (val < 25) {  // Change this line
+    return "Under 25";
+  }
+
+  if (val < 55) {  // Change this line
+    return "Under 55";
+  }
+
+  return "55 or Over";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
new file mode 100644
index 0000000000..0bc8945dc8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-less-than-or-equal-to-operator.md
@@ -0,0 +1,114 @@
+---
+id: 56533eb9ac21ba0edf2244d7
+title: Comparison with the Less Than Or Equal To Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cNVR7Am'
+forumTopicId: 16788
+dashedName: comparison-with-the-less-than-or-equal-to-operator
+---
+
+# --description--
+
+The less than or equal to operator (`<=`) 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 `true`. If the number on the left is greater than the number on the right, it returns `false`. Like the equality operator, the less than or equal to operator converts data types.
+
+**Examples**
+
+```js
+4   <= 5
+'7' <= 7
+5   <= 5
+3   <= 2
+'8' <= 4
+```
+
+In order, these expressions would evaluate to `true`, `true`, `true`, `false`, and `false`.
+
+# --instructions--
+
+Add the less than or equal to operator to the indicated lines so that the return statements make sense.
+
+# --hints--
+
+`testLessOrEqual(0)` should return the string `Smaller Than or Equal to 12`
+
+```js
+assert(testLessOrEqual(0) === 'Smaller Than or Equal to 12');
+```
+
+`testLessOrEqual(11)` should return the string `Smaller Than or Equal to 12`
+
+```js
+assert(testLessOrEqual(11) === 'Smaller Than or Equal to 12');
+```
+
+`testLessOrEqual(12)` should return the string `Smaller Than or Equal to 12`
+
+```js
+assert(testLessOrEqual(12) === 'Smaller Than or Equal to 12');
+```
+
+`testLessOrEqual(23)` should return the string `Smaller Than or Equal to 24`
+
+```js
+assert(testLessOrEqual(23) === 'Smaller Than or Equal to 24');
+```
+
+`testLessOrEqual(24)` should return the string `Smaller Than or Equal to 24`
+
+```js
+assert(testLessOrEqual(24) === 'Smaller Than or Equal to 24');
+```
+
+`testLessOrEqual(25)` should return the string `More Than 24`
+
+```js
+assert(testLessOrEqual(25) === 'More Than 24');
+```
+
+`testLessOrEqual(55)` should return the string `More Than 24`
+
+```js
+assert(testLessOrEqual(55) === 'More Than 24');
+```
+
+You should use the `<=` operator at least twice
+
+```js
+assert(code.match(/val\s*<=\s*('|")*\d+('|")*/g).length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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";
+}
+
+testLessOrEqual(10);
+```
+
+# --solutions--
+
+```js
+function testLessOrEqual(val) {
+  if (val <= 12) {  // Change this line
+    return "Smaller Than or Equal to 12";
+  }
+
+  if (val <= 24) {  // Change this line
+    return "Smaller Than or Equal to 24";
+  }
+
+  return "More Than 24";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
new file mode 100644
index 0000000000..6aa9ba3861
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-equality-operator.md
@@ -0,0 +1,82 @@
+---
+id: 56533eb9ac21ba0edf2244d1
+title: Comparison with the Strict Equality Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cy87atr'
+forumTopicId: 16790
+dashedName: comparison-with-the-strict-equality-operator
+---
+
+# --description--
+
+Strict equality (`===`) is the counterpart to the equality operator (`==`). However, unlike the equality operator, which attempts to convert both values being compared to a common type, the strict equality operator does not perform a type conversion.
+
+If the values being compared have different types, they are considered unequal, and the strict equality operator will return false.
+
+**Examples**
+
+```js
+3 ===  3
+3 === '3'
+```
+
+These conditions would return `true` and `false` respectively.
+
+In the second example, `3` is a `Number` type and `'3'` is a `String` type.
+
+# --instructions--
+
+Use the strict equality operator in the `if` statement so the function will return the string `Equal` when `val` is strictly equal to `7`
+
+# --hints--
+
+`testStrict(10)` should return the string `Not Equal`
+
+```js
+assert(testStrict(10) === 'Not Equal');
+```
+
+`testStrict(7)` should return the string `Equal`
+
+```js
+assert(testStrict(7) === 'Equal');
+```
+
+`testStrict("7")` should return the string `Not Equal`
+
+```js
+assert(testStrict('7') === 'Not Equal');
+```
+
+You should use the `===` operator
+
+```js
+assert(code.match(/(val\s*===\s*\d+)|(\d+\s*===\s*val)/g).length > 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+function testStrict(val) {
+  if (val) { // Change this line
+    return "Equal";
+  }
+  return "Not Equal";
+}
+
+testStrict(10);
+```
+
+# --solutions--
+
+```js
+function testStrict(val) {
+  if (val === 7) {
+    return "Equal";
+  }
+  return "Not Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
new file mode 100644
index 0000000000..4ab65c634b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-strict-inequality-operator.md
@@ -0,0 +1,85 @@
+---
+id: 56533eb9ac21ba0edf2244d3
+title: Comparison with the Strict Inequality Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cKekkUy'
+forumTopicId: 16791
+dashedName: comparison-with-the-strict-inequality-operator
+---
+
+# --description--
+
+The strict inequality operator (`!==`) is the logical opposite of the strict equality operator. It means "Strictly Not Equal" and returns `false` where strict equality would return `true` and *vice versa*. The strict inequality operator will not convert data types.
+
+**Examples**
+
+```js
+3 !==  3
+3 !== '3'
+4 !==  3
+```
+
+In order, these expressions would evaluate to `false`, `true`, and `true`.
+
+# --instructions--
+
+Add the strict inequality operator to the `if` statement so the function will return the string `Not Equal` when `val` is not strictly equal to `17`
+
+# --hints--
+
+`testStrictNotEqual(17)` should return the string `Equal`
+
+```js
+assert(testStrictNotEqual(17) === 'Equal');
+```
+
+`testStrictNotEqual("17")` should return the string `Not Equal`
+
+```js
+assert(testStrictNotEqual('17') === 'Not Equal');
+```
+
+`testStrictNotEqual(12)` should return the string `Not Equal`
+
+```js
+assert(testStrictNotEqual(12) === 'Not Equal');
+```
+
+`testStrictNotEqual("bob")` should return the string `Not Equal`
+
+```js
+assert(testStrictNotEqual('bob') === 'Not Equal');
+```
+
+You should use the `!==` operator
+
+```js
+assert(code.match(/(val\s*!==\s*\d+)|(\d+\s*!==\s*val)/g).length > 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+function testStrictNotEqual(val) {
+  if (val) { // Change this line
+    return "Not Equal";
+  }
+  return "Equal";
+}
+
+testStrictNotEqual(10);
+```
+
+# --solutions--
+
+```js
+function testStrictNotEqual(val) {
+  if (val !== 17) {
+    return "Not Equal";
+  }
+  return "Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md
new file mode 100644
index 0000000000..da1175e7c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator.md
@@ -0,0 +1,130 @@
+---
+id: 56533eb9ac21ba0edf2244d8
+title: Comparisons with the Logical And Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cvbRVtr'
+forumTopicId: 16799
+dashedName: 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 (`&&`) returns `true` 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:
+
+```js
+if (num > 5) {
+  if (num < 10) {
+    return "Yes";
+  }
+}
+return "No";
+```
+
+will only return `Yes` if `num` is greater than `5` and less than `10`. The same logic can be written as:
+
+```js
+if (num > 5 && num < 10) {
+  return "Yes";
+}
+return "No";
+```
+
+# --instructions--
+
+Replace the two if statements with one statement, using the `&&` operator, which will return the string `Yes` if `val` is less than or equal to `50` and greater than or equal to `25`. Otherwise, will return the string `No`.
+
+# --hints--
+
+You should use the `&&` operator once
+
+```js
+assert(code.match(/&&/g).length === 1);
+```
+
+You should only have one `if` statement
+
+```js
+assert(code.match(/if/g).length === 1);
+```
+
+`testLogicalAnd(0)` should return the string `No`
+
+```js
+assert(testLogicalAnd(0) === 'No');
+```
+
+`testLogicalAnd(24)` should return the string `No`
+
+```js
+assert(testLogicalAnd(24) === 'No');
+```
+
+`testLogicalAnd(25)` should return the string `Yes`
+
+```js
+assert(testLogicalAnd(25) === 'Yes');
+```
+
+`testLogicalAnd(30)` should return the string `Yes`
+
+```js
+assert(testLogicalAnd(30) === 'Yes');
+```
+
+`testLogicalAnd(50)` should return the string `Yes`
+
+```js
+assert(testLogicalAnd(50) === 'Yes');
+```
+
+`testLogicalAnd(51)` should return the string `No`
+
+```js
+assert(testLogicalAnd(51) === 'No');
+```
+
+`testLogicalAnd(75)` should return the string `No`
+
+```js
+assert(testLogicalAnd(75) === 'No');
+```
+
+`testLogicalAnd(80)` should return the string `No`
+
+```js
+assert(testLogicalAnd(80) === 'No');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function testLogicalAnd(val) {
+  // Only change code below this line
+
+  if (val) {
+    if (val) {
+      return "Yes";
+    }
+  }
+
+  // Only change code above this line
+  return "No";
+}
+
+testLogicalAnd(10);
+```
+
+# --solutions--
+
+```js
+function testLogicalAnd(val) {
+  if (val >= 25 && val <= 50) {
+    return "Yes";
+  }
+  return "No";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md
new file mode 100644
index 0000000000..3202c07163
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-or-operator.md
@@ -0,0 +1,135 @@
+---
+id: 56533eb9ac21ba0edf2244d9
+title: Comparisons with the Logical Or Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cEPrGTN'
+forumTopicId: 16800
+dashedName: comparisons-with-the-logical-or-operator
+---
+
+# --description--
+
+The <dfn>logical or</dfn> operator (`||`) returns `true` if either of the <dfn>operands</dfn> is `true`. Otherwise, it returns `false`.
+
+The <dfn>logical or</dfn> operator is composed of two pipe symbols: (`||`). This can typically be found between your Backspace and Enter keys.
+
+The pattern below should look familiar from prior waypoints:
+
+```js
+if (num > 10) {
+  return "No";
+}
+if (num < 5) {
+  return "No";
+}
+return "Yes";
+```
+
+will return `Yes` only if `num` is between `5` and `10` (5 and 10 included). The same logic can be written as:
+
+```js
+if (num > 10 || num < 5) {
+  return "No";
+}
+return "Yes";
+```
+
+# --instructions--
+
+Combine the two `if` statements into one statement which returns the string `Outside` if `val` is not between `10` and `20`, inclusive. Otherwise, return the string `Inside`.
+
+# --hints--
+
+You should use the `||` operator once
+
+```js
+assert(code.match(/\|\|/g).length === 1);
+```
+
+You should only have one `if` statement
+
+```js
+assert(code.match(/if/g).length === 1);
+```
+
+`testLogicalOr(0)` should return the string `Outside`
+
+```js
+assert(testLogicalOr(0) === 'Outside');
+```
+
+`testLogicalOr(9)` should return the string `Outside`
+
+```js
+assert(testLogicalOr(9) === 'Outside');
+```
+
+`testLogicalOr(10)` should return the string `Inside`
+
+```js
+assert(testLogicalOr(10) === 'Inside');
+```
+
+`testLogicalOr(15)` should return the string `Inside`
+
+```js
+assert(testLogicalOr(15) === 'Inside');
+```
+
+`testLogicalOr(19)` should return the string `Inside`
+
+```js
+assert(testLogicalOr(19) === 'Inside');
+```
+
+`testLogicalOr(20)` should return the string `Inside`
+
+```js
+assert(testLogicalOr(20) === 'Inside');
+```
+
+`testLogicalOr(21)` should return the string `Outside`
+
+```js
+assert(testLogicalOr(21) === 'Outside');
+```
+
+`testLogicalOr(25)` should return the string `Outside`
+
+```js
+assert(testLogicalOr(25) === 'Outside');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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";
+}
+
+testLogicalOr(15);
+```
+
+# --solutions--
+
+```js
+function testLogicalOr(val) {
+  if (val < 10 || val > 20) {
+    return "Outside";
+  }
+  return "Inside";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-addition.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-addition.md
new file mode 100644
index 0000000000..ca307a3375
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-addition.md
@@ -0,0 +1,101 @@
+---
+id: 56533eb9ac21ba0edf2244af
+title: Compound Assignment With Augmented Addition
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cDR6LCb'
+forumTopicId: 16661
+dashedName: 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:
+
+```js
+myVar = myVar + 5;
+```
+
+to add `5` to `myVar`. 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 `+=` operator.
+
+```js
+var myVar = 1;
+myVar += 5;
+console.log(myVar);
+```
+
+`6` would be displayed in the console.
+
+# --instructions--
+
+Convert the assignments for `a`, `b`, and `c` to use the `+=` operator.
+
+# --hints--
+
+`a` should equal `15`.
+
+```js
+assert(a === 15);
+```
+
+`b` should equal `26`.
+
+```js
+assert(b === 26);
+```
+
+`c` should equal `19`.
+
+```js
+assert(c === 19);
+```
+
+You should use the `+=` operator for each variable.
+
+```js
+assert(code.match(/\+=/g).length === 3);
+```
+
+You should not modify the code above the specified comment.
+
+```js
+assert(
+  /var a = 3;/.test(code) &&
+    /var b = 17;/.test(code) &&
+    /var c = 12;/.test(code)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b,c){ return "a = " + a + ", b = " + b + ", c = " + c; })(a,b,c);
+```
+
+## --seed-contents--
+
+```js
+var a = 3;
+var b = 17;
+var c = 12;
+
+// Only change code below this line
+a = a + 12;
+b = 9 + b;
+c = c + 7;
+```
+
+# --solutions--
+
+```js
+var a = 3;
+var b = 17;
+var c = 12;
+
+a += 12;
+b += 9;
+c += 7;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-division.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-division.md
new file mode 100644
index 0000000000..aa630acf60
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-division.md
@@ -0,0 +1,95 @@
+---
+id: 56533eb9ac21ba0edf2244b2
+title: Compound Assignment With Augmented Division
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2QvKT2'
+forumTopicId: 16659
+dashedName: compound-assignment-with-augmented-division
+---
+
+# --description--
+
+The `/=` operator divides a variable by another number.
+
+```js
+myVar = myVar / 5;
+```
+
+Will divide `myVar` by `5`. This can be rewritten as:
+
+```js
+myVar /= 5;
+```
+
+# --instructions--
+
+Convert the assignments for `a`, `b`, and `c` to use the `/=` operator.
+
+# --hints--
+
+`a` should equal `4`.
+
+```js
+assert(a === 4);
+```
+
+`b` should equal `27`.
+
+```js
+assert(b === 27);
+```
+
+`c` should equal `3`.
+
+```js
+assert(c === 3);
+```
+
+You should use the `/=` operator for each variable.
+
+```js
+assert(code.match(/\/=/g).length === 3);
+```
+
+You should not modify the code above the specified comment.
+
+```js
+assert(
+  /var a = 48;/.test(code) &&
+    /var b = 108;/.test(code) &&
+    /var c = 33;/.test(code)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b,c){ return "a = " + a + ", b = " + b + ", c = " + c; })(a,b,c);
+```
+
+## --seed-contents--
+
+```js
+var a = 48;
+var b = 108;
+var c = 33;
+
+// Only change code below this line
+a = a / 12;
+b = b / 4;
+c = c / 11;
+```
+
+# --solutions--
+
+```js
+var a = 48;
+var b = 108;
+var c = 33;
+
+a /= 12;
+b /= 4;
+c /= 11;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-multiplication.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-multiplication.md
new file mode 100644
index 0000000000..a12d59ef42
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-multiplication.md
@@ -0,0 +1,95 @@
+---
+id: 56533eb9ac21ba0edf2244b1
+title: Compound Assignment With Augmented Multiplication
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c83vrfa'
+forumTopicId: 16662
+dashedName: compound-assignment-with-augmented-multiplication
+---
+
+# --description--
+
+The `*=` operator multiplies a variable by a number.
+
+```js
+myVar = myVar * 5;
+```
+
+will multiply `myVar` by `5`. This can be rewritten as:
+
+```js
+myVar *= 5;
+```
+
+# --instructions--
+
+Convert the assignments for `a`, `b`, and `c` to use the `*=` operator.
+
+# --hints--
+
+`a` should equal `25`.
+
+```js
+assert(a === 25);
+```
+
+`b` should equal `36`.
+
+```js
+assert(b === 36);
+```
+
+`c` should equal `46`.
+
+```js
+assert(c === 46);
+```
+
+You should use the `*=` operator for each variable.
+
+```js
+assert(code.match(/\*=/g).length === 3);
+```
+
+You should not modify the code above the specified comment.
+
+```js
+assert(
+  /var a = 5;/.test(code) &&
+    /var b = 12;/.test(code) &&
+    /var c = 4\.6;/.test(code)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b,c){ return "a = " + a + ", b = " + b + ", c = " + c; })(a,b,c);
+```
+
+## --seed-contents--
+
+```js
+var a = 5;
+var b = 12;
+var c = 4.6;
+
+// Only change code below this line
+a = a * 5;
+b = 3 * b;
+c = c * 10;
+```
+
+# --solutions--
+
+```js
+var a = 5;
+var b = 12;
+var c = 4.6;
+
+a *= 5;
+b *= 3;
+c *= 10;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-subtraction.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-subtraction.md
new file mode 100644
index 0000000000..ae6388ad04
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/compound-assignment-with-augmented-subtraction.md
@@ -0,0 +1,93 @@
+---
+id: 56533eb9ac21ba0edf2244b0
+title: Compound Assignment With Augmented Subtraction
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2Qv7AV'
+forumTopicId: 16660
+dashedName: compound-assignment-with-augmented-subtraction
+---
+
+# --description--
+
+Like the `+=` operator, `-=` subtracts a number from a variable.
+
+```js
+myVar = myVar - 5;
+```
+
+will subtract `5` from `myVar`. This can be rewritten as:
+
+```js
+myVar -= 5;
+```
+
+# --instructions--
+
+Convert the assignments for `a`, `b`, and `c` to use the `-=` operator.
+
+# --hints--
+
+`a` should equal `5`.
+
+```js
+assert(a === 5);
+```
+
+`b` should equal `-6`.
+
+```js
+assert(b === -6);
+```
+
+`c` should equal `2`.
+
+```js
+assert(c === 2);
+```
+
+You should use the `-=` operator for each variable.
+
+```js
+assert(code.match(/-=/g).length === 3);
+```
+
+You should not modify the code above the specified comment.
+
+```js
+assert(
+  /var a = 11;/.test(code) && /var b = 9;/.test(code) && /var c = 3;/.test(code)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b,c){ return "a = " + a + ", b = " + b + ", c = " + c; })(a,b,c);
+```
+
+## --seed-contents--
+
+```js
+var a = 11;
+var b = 9;
+var c = 3;
+
+// Only change code below this line
+a = a - 6;
+b = b - 15;
+c = c - 1;
+```
+
+# --solutions--
+
+```js
+var a = 11;
+var b = 9;
+var c = 3;
+
+a -= 6;
+b -= 15;
+c -= 1;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
new file mode 100644
index 0000000000..4b9adc2615
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-plus-operator.md
@@ -0,0 +1,83 @@
+---
+id: 56533eb9ac21ba0edf2244b7
+title: Concatenating Strings with Plus Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cNpM8AN'
+forumTopicId: 16802
+dashedName: concatenating-strings-with-plus-operator
+---
+
+# --description--
+
+In JavaScript, when the `+` operator is used with a `String` 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.
+
+**Example**
+
+```js
+'My name is Alan,' + ' I concatenate.'
+```
+
+**Note:** Watch out for spaces. Concatenation does not add spaces between concatenated strings, so you'll need to add them yourself.
+
+Example:
+
+```js
+var ourStr = "I come first. " + "I come second.";
+```
+
+The string `I come first. I come second.` would be displayed in the console.
+# --instructions--
+
+Build `myStr` from the strings `This is the start. ` and `This is the end.` using the `+` operator.
+
+# --hints--
+
+`myStr` should have a value of the string `This is the start. This is the end.`
+
+```js
+assert(myStr === 'This is the start. This is the end.');
+```
+
+You should use the `+` operator to build `myStr`.
+
+```js
+assert(code.match(/(["']).*\1\s*\+\s*(["']).*\2/g));
+```
+
+`myStr` should be created using the `var` keyword.
+
+```js
+assert(/var\s+myStr/.test(code));
+```
+
+You should assign the result to the `myStr` variable.
+
+```js
+assert(/myStr\s*=/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){
+  if(typeof myStr === 'string') {
+    return 'myStr = "' + myStr + '"';
+  } else {
+    return 'myStr is not a string';
+  }
+})();
+```
+
+## --seed-contents--
+
+```js
+var myStr; // Change this line
+```
+
+# --solutions--
+
+```js
+var myStr = "This is the start. " + "This is the end.";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
new file mode 100644
index 0000000000..e3eeaef1c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/concatenating-strings-with-the-plus-equals-operator.md
@@ -0,0 +1,70 @@
+---
+id: 56533eb9ac21ba0edf2244b8
+title: Concatenating Strings with the Plus Equals Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cbQmmC4'
+forumTopicId: 16803
+dashedName: concatenating-strings-with-the-plus-equals-operator
+---
+
+# --description--
+
+We can also use the `+=` 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.
+
+**Note:** Watch out for spaces. Concatenation does not add spaces between concatenated strings, so you'll need to add them yourself.
+
+Example:
+
+```js
+var ourStr = "I come first. ";
+ourStr += "I come second.";
+```
+
+`ourStr` now has a value of the string `I come first. I come second.`.
+
+# --instructions--
+
+Build `myStr` over several lines by concatenating these two strings: `This is the first sentence. ` and `This is the second sentence.` using the `+=` operator. Use the `+=` operator similar to how it is shown in the example. Start by assigning the first string to `myStr`, then add on the second string.
+
+# --hints--
+
+`myStr` should have a value of the string `This is the first sentence. This is the second sentence.`
+
+```js
+assert(myStr === 'This is the first sentence. This is the second sentence.');
+```
+
+You should use the `+=` operator to build `myStr`.
+
+```js
+assert(code.match(/myStr\s*\+=\s*(["']).*\1/g));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){
+  if(typeof myStr === 'string') {
+    return 'myStr = "' + myStr + '"';
+  } else {
+    return 'myStr is not a string';
+  }
+})();
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+
+var myStr;
+```
+
+# --solutions--
+
+```js
+var myStr = "This is the first sentence. ";
+myStr += "This is the second sentence.";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
new file mode 100644
index 0000000000..a21e9753ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/constructing-strings-with-variables.md
@@ -0,0 +1,75 @@
+---
+id: 56533eb9ac21ba0edf2244b9
+title: Constructing Strings with Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cqk8rf4'
+forumTopicId: 16805
+dashedName: constructing-strings-with-variables
+---
+
+# --description--
+
+Sometimes you will need to build a string, [Mad Libs](https://en.wikipedia.org/wiki/Mad_Libs) style. By using the concatenation operator (`+`), you can insert one or more variables into a string you're building.
+
+Example:
+
+```js
+var ourName = "freeCodeCamp";
+var ourStr = "Hello, our name is " + ourName + ", how are you?";
+```
+
+`ourStr` would have a value of the string `Hello, our name is freeCodeCamp, how are you?`.
+
+# --instructions--
+
+Set `myName` to a string equal to your name and build `myStr` with `myName` between the strings `My name is ` and ` and I am well!`
+
+# --hints--
+
+`myName` should be set to a string at least 3 characters long.
+
+```js
+assert(typeof myName !== 'undefined' && myName.length > 2);
+```
+
+You should use two `+` operators to build `myStr` with `myName` inside it.
+
+```js
+assert(code.match(/["']\s*\+\s*myName\s*\+\s*["']/g).length > 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(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');
+})();
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+var myName;
+var myStr;
+```
+
+# --solutions--
+
+```js
+var myName = "Bob";
+var myStr = "My name is " + myName + " and I am well!";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/count-backwards-with-a-for-loop.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/count-backwards-with-a-for-loop.md
new file mode 100644
index 0000000000..d6c348a821
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/count-backwards-with-a-for-loop.md
@@ -0,0 +1,75 @@
+---
+id: 56105e7b514f539506016a5e
+title: Count Backwards With a For Loop
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2R6BHa'
+forumTopicId: 16808
+dashedName: 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 decrement by two each iteration, we'll need to change our initialization, condition, and final expression.
+
+We'll start at `i = 10` and loop while `i > 0`. We'll decrement `i` by 2 each loop with `i -= 2`.
+
+```js
+var ourArray = [];
+for (var i = 10; i > 0; i -= 2) {
+  ourArray.push(i);
+}
+```
+
+`ourArray` will now contain `[10,8,6,4,2]`. Let's change our initialization and final expression so we can count backwards by twos to create an array of descending odd numbers.
+
+# --instructions--
+
+Push the odd numbers from 9 through 1 to `myArray` using a `for` loop.
+
+# --hints--
+
+You should be using a `for` loop for this.
+
+```js
+assert(/for\s*\([^)]+?\)/.test(code));
+```
+
+You should be using the array method `push`.
+
+```js
+assert(code.match(/myArray.push/));
+```
+
+`myArray` should equal `[9,7,5,3,1]`.
+
+```js
+assert.deepEqual(myArray, [9, 7, 5, 3, 1]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [];
+for (var i = 9; i > 0; i -= 2) {
+  myArray.push(i);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
new file mode 100644
index 0000000000..fda982efbd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/counting-cards.md
@@ -0,0 +1,202 @@
+---
+id: 565bbe00e9cc8ac0725390f4
+title: Counting Cards
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c6KE7ty'
+forumTopicId: 16809
+dashedName: 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 [Card Counting](https://en.wikipedia.org/wiki/Card_counting).
+
+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 `card` parameter, which can be a number or a string, and increment or decrement the global `count` variable according to the card's value (see table). The function will then return a string with the current count and the string `Bet` if the count is positive, or `Hold` if the count is zero or negative. The current count and the player's decision (`Bet` or `Hold`) should be separated by a single space.
+
+**Example Outputs:** `-3 Hold` or `5 Bet`
+
+**Hint**  
+Do NOT reset `count` to 0 when value is 7, 8, or 9.  
+Do NOT return an array.  
+Do NOT include quotes (single or double) in the output.
+
+# --hints--
+
+Cards Sequence 2, 3, 4, 5, 6 should return `5 Bet`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(2);
+    cc(3);
+    cc(4);
+    cc(5);
+    var out = cc(6);
+    if (out === '5 Bet') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 7, 8, 9 should return the string `0 Hold`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(7);
+    cc(8);
+    var out = cc(9);
+    if (out === '0 Hold') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 10, J, Q, K, A should return the string `-5 Hold`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(10);
+    cc('J');
+    cc('Q');
+    cc('K');
+    var out = cc('A');
+    if (out === '-5 Hold') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 3, 7, Q, 8, A should return the string `-1 Hold`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(3);
+    cc(7);
+    cc('Q');
+    cc(8);
+    var out = cc('A');
+    if (out === '-1 Hold') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 2, J, 9, 2, 7 should return the string `1 Bet`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(2);
+    cc('J');
+    cc(9);
+    cc(2);
+    var out = cc(7);
+    if (out === '1 Bet') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 2, 2, 10 should return the string `1 Bet`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(2);
+    cc(2);
+    var out = cc(10);
+    if (out === '1 Bet') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+Cards Sequence 3, 2, A, 10, K should return the string `-1 Hold`
+
+```js
+assert(
+  (function () {
+    count = 0;
+    cc(3);
+    cc(2);
+    cc('A');
+    cc(10);
+    var out = cc('K');
+    if (out === '-1 Hold') {
+      return true;
+    }
+    return false;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var count = 0;
+
+function cc(card) {
+  // Only change code below this line
+
+
+  return "Change Me";
+  // Only change code above this line
+}
+
+cc(2); cc(3); cc(7); cc('K'); cc('A');
+```
+
+# --solutions--
+
+```js
+var count = 0;
+function cc(card) {
+  switch(card) {
+    case 2:
+    case 3:
+    case 4:
+    case 5:
+    case 6:
+      count++;
+      break;
+    case 10:
+    case 'J':
+    case 'Q':
+    case 'K':
+    case 'A':
+      count--;
+  }
+  if(count > 0) {
+    return count + " Bet";
+  } else {
+    return count + " Hold";
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
new file mode 100644
index 0000000000..49ca86fc2c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/create-decimal-numbers-with-javascript.md
@@ -0,0 +1,54 @@
+---
+id: cf1391c1c11feddfaeb4bdef
+title: Create Decimal Numbers with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ca8GEuW'
+forumTopicId: 16826
+dashedName: 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>.
+
+**Note:** Not all real numbers can accurately be represented in <dfn>floating point</dfn>. This can lead to rounding errors. [Details Here](https://en.wikipedia.org/wiki/Floating_point#Accuracy_problems).
+
+# --instructions--
+
+Create a variable `myDecimal` and give it a decimal value with a fractional part (e.g. `5.7`).
+
+# --hints--
+
+`myDecimal` should be a number.
+
+```js
+assert(typeof myDecimal === 'number');
+```
+
+`myDecimal` should have a decimal point
+
+```js
+assert(myDecimal % 1 != 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){if(typeof myDecimal !== "undefined"){return myDecimal;}})();
+```
+
+## --seed-contents--
+
+```js
+var ourDecimal = 5.7;
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myDecimal = 9.9;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-javascript-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-javascript-variables.md
new file mode 100644
index 0000000000..9d41fe9503
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-javascript-variables.md
@@ -0,0 +1,61 @@
+---
+id: bd7123c9c443eddfaeb5bdef
+title: Declare JavaScript Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cNanrHq'
+forumTopicId: 17556
+dashedName: declare-javascript-variables
+---
+
+# --description--
+
+In computer science, <dfn>data</dfn> is anything that is meaningful to the computer. JavaScript provides eight different <dfn>data types</dfn> which are `undefined`, `null`, `boolean`, `string`, `symbol`, `bigint`, `number`, and `object`.
+
+For example, computers distinguish between numbers, such as the number `12`, and `strings`, such as `"12"`, `"dog"`, or `"123 cats"`, 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 eight data types may be stored in a variable.
+
+Variables 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 variables 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 `var` in front of it, like so:
+
+```js
+var ourName;
+```
+
+creates a variable called `ourName`. In JavaScript we end statements with semicolons. Variable names can be made up of numbers, letters, and `$` or `_`, but may not contain spaces or start with a number.
+
+# --instructions--
+
+Use the `var` keyword to create a variable called `myName`.
+
+**Hint**  
+Look at the `ourName` example above if you get stuck.
+
+# --hints--
+
+You should declare `myName` with the `var` keyword, ending with a semicolon
+
+```js
+assert(/var\s+myName\s*;/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myName !== "undefined"){(function(v){return v;})(myName);}
+```
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+var myName;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-string-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-string-variables.md
new file mode 100644
index 0000000000..21bd4c62f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/declare-string-variables.md
@@ -0,0 +1,81 @@
+---
+id: bd7123c9c444eddfaeb5bdef
+title: Declare String Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2QvWU6'
+forumTopicId: 17557
+dashedName: declare-string-variables
+---
+
+# --description--
+
+Previously we have used the code
+
+```js
+var myName = "your name";
+```
+
+`"your name"` 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.
+
+# --instructions--
+
+Create two new string variables: `myFirstName` and `myLastName` and assign them the values of your first and last name, respectively.
+
+# --hints--
+
+`myFirstName` should be a string with at least one character in it.
+
+```js
+assert(
+  (function () {
+    if (
+      typeof myFirstName !== 'undefined' &&
+      typeof myFirstName === 'string' &&
+      myFirstName.length > 0
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+`myLastName` should be a string with at least one character in it.
+
+```js
+assert(
+  (function () {
+    if (
+      typeof myLastName !== 'undefined' &&
+      typeof myLastName === 'string' &&
+      myLastName.length > 0
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myFirstName !== "undefined" && typeof myLastName !== "undefined"){(function(){return myFirstName + ', ' + myLastName;})();}
+```
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+var myFirstName = "Alan";
+var myLastName = "Turing";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
new file mode 100644
index 0000000000..f80f5658d9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/decrement-a-number-with-javascript.md
@@ -0,0 +1,80 @@
+---
+id: 56533eb9ac21ba0edf2244ad
+title: Decrement a Number with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cM2KeS2'
+forumTopicId: 17558
+dashedName: decrement-a-number-with-javascript
+---
+
+# --description--
+
+You can easily <dfn>decrement</dfn> or decrease a variable by one with the `--` operator.
+
+```js
+i--;
+```
+
+is the equivalent of
+
+```js
+i = i - 1;
+```
+
+**Note:** The entire line becomes `i--;`, eliminating the need for the equal sign.
+
+# --instructions--
+
+Change the code to use the `--` operator on `myVar`.
+
+# --hints--
+
+`myVar` should equal `10`.
+
+```js
+assert(myVar === 10);
+```
+
+`myVar = myVar - 1;` should be changed.
+
+```js
+assert(
+  /var\s*myVar\s*=\s*11;\s*\/*.*\s*([-]{2}\s*myVar|myVar\s*[-]{2});/.test(code)
+);
+```
+
+You should use the `--` operator on `myVar`.
+
+```js
+assert(/[-]{2}\s*myVar|myVar\s*[-]{2}/.test(code));
+```
+
+You should not change code above the specified comment.
+
+```js
+assert(/var myVar = 11;/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'myVar = ' + z;})(myVar);
+```
+
+## --seed-contents--
+
+```js
+var myVar = 11;
+
+// Only change code below this line
+myVar = myVar - 1;
+```
+
+# --solutions--
+
+```js
+var myVar = 11;
+myVar--;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/delete-properties-from-a-javascript-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/delete-properties-from-a-javascript-object.md
new file mode 100644
index 0000000000..eff38c75a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/delete-properties-from-a-javascript-object.md
@@ -0,0 +1,95 @@
+---
+id: 56bbb991ad1ed5201cd392d3
+title: Delete Properties from a JavaScript Object
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cDqKdTv'
+forumTopicId: 17560
+dashedName: delete-properties-from-a-javascript-object
+---
+
+# --description--
+
+We can also delete properties from objects like this:
+
+```js
+delete ourDog.bark;
+```
+
+Example:
+
+```js
+var ourDog = {
+  "name": "Camper",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["everything!"],
+  "bark": "bow-wow"
+};
+
+delete ourDog.bark;
+```
+
+After the last line shown above, `ourDog` looks like:
+
+```js
+{
+  "name": "Camper",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["everything!"]
+}
+```
+
+# --instructions--
+
+Delete the `tails` property from `myDog`. You may use either dot or bracket notation.
+
+# --hints--
+
+You should delete the property `tails` from `myDog`.
+
+```js
+assert(typeof myDog === 'object' && myDog.tails === undefined);
+```
+
+You should not modify the `myDog` setup.
+
+```js
+assert(code.match(/"tails": 1/g).length > 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return z;})(myDog);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myDog = {
+  "name": "Happy Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"],
+  "bark": "woof"
+};
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myDog = {
+  "name": "Happy Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"],
+  "bark": "woof"
+};
+delete myDog.tails;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
new file mode 100644
index 0000000000..cb96b3ff71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-decimal-by-another-with-javascript.md
@@ -0,0 +1,56 @@
+---
+id: bd7993c9ca9feddfaeb7bdef
+title: Divide One Decimal by Another with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cBZe9AW'
+forumTopicId: 18255
+dashedName: divide-one-decimal-by-another-with-javascript
+---
+
+# --description--
+
+Now let's divide one decimal by another.
+
+# --instructions--
+
+Change the `0.0` so that `quotient` will equal to `2.2`.
+
+# --hints--
+
+The variable `quotient` should equal `2.2`
+
+```js
+assert(quotient === 2.2);
+```
+
+You should use the `/` operator to divide 4.4 by 2
+
+```js
+assert(/4\.40*\s*\/\s*2\.*0*/.test(code));
+```
+
+The quotient variable should only be assigned once
+
+```js
+assert(code.match(/quotient/g).length === 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y){return 'quotient = '+y;})(quotient);
+```
+
+## --seed-contents--
+
+```js
+var quotient = 0.0 / 2.0; // Change this line
+```
+
+# --solutions--
+
+```js
+var quotient = 4.4 / 2.0;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-number-by-another-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-number-by-another-with-javascript.md
new file mode 100644
index 0000000000..e0a3339e4e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/divide-one-number-by-another-with-javascript.md
@@ -0,0 +1,59 @@
+---
+id: cf1111c1c11feddfaeb6bdef
+title: Divide One Number by Another with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cqkbdAr'
+forumTopicId: 17566
+dashedName: divide-one-number-by-another-with-javascript
+---
+
+# --description--
+
+We can also divide one number by another.
+
+JavaScript uses the `/` symbol for division.
+
+**Example**
+
+```js
+myVar = 16 / 2;
+```
+
+`myVar` now has the value `8`.
+# --instructions--
+
+Change the `0` so that the `quotient` is equal to `2`.
+
+# --hints--
+
+The variable `quotient` should be equal to 2.
+
+```js
+assert(quotient === 2);
+```
+
+You should use the `/` operator.
+
+```js
+assert(/\d+\s*\/\s*\d+/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'quotient = '+z;})(quotient);
+```
+
+## --seed-contents--
+
+```js
+var quotient = 66 / 0;
+```
+
+# --solutions--
+
+```js
+var quotient = 66 / 33;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
new file mode 100644
index 0000000000..9906fc03da
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escape-sequences-in-strings.md
@@ -0,0 +1,99 @@
+---
+id: 56533eb9ac21ba0edf2244b6
+title: Escape Sequences in Strings
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cvmqRh6'
+forumTopicId: 17567
+dashedName: 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:
+
+1.  To allow you to use characters you may not otherwise be able to type out, such as a carriage return.
+2.  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>word boundary</td></tr><tr><td><code>\f</code></td><td>form feed</td></tr></tbody></table>
+
+*Note that the backslash itself must be escaped in order to display as a backslash.*
+
+# --instructions--
+
+Assign the following three lines of text into the single variable `myStr` using escape sequences.
+
+<blockquote>FirstLine<br>    \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.
+
+**Note:** The indentation for `SecondLine` is achieved with the tab escape character, not spaces.
+
+# --hints--
+
+`myStr` should not contain any spaces
+
+```js
+assert(!/ /.test(myStr));
+```
+
+`myStr` should contain the strings `FirstLine`, `SecondLine` and `ThirdLine` (remember case sensitivity)
+
+```js
+assert(
+  /FirstLine/.test(myStr) && /SecondLine/.test(myStr) && /ThirdLine/.test(myStr)
+);
+```
+
+`FirstLine` should be followed by the newline character `\n`
+
+```js
+assert(/FirstLine\n/.test(myStr));
+```
+
+`myStr` should contain a tab character `\t` which follows a newline character
+
+```js
+assert(/\n\t/.test(myStr));
+```
+
+`SecondLine` should be preceded by the backslash character `\`
+
+```js
+assert(/\\SecondLine/.test(myStr));
+```
+
+There should be a newline character between `SecondLine` and `ThirdLine`
+
+```js
+assert(/SecondLine\nThirdLine/.test(myStr));
+```
+
+`myStr` should only contain characters shown in the instructions
+
+```js
+assert(myStr === 'FirstLine\n\t\\SecondLine\nThirdLine');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){
+if (myStr !== undefined){
+console.log('myStr:\n' + myStr);}})();
+```
+
+## --seed-contents--
+
+```js
+var myStr; // Change this line
+```
+
+# --solutions--
+
+```js
+var myStr = "FirstLine\n\t\\SecondLine\nThirdLine";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
new file mode 100644
index 0000000000..4116092502
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/escaping-literal-quotes-in-strings.md
@@ -0,0 +1,72 @@
+---
+id: 56533eb9ac21ba0edf2244b5
+title: Escaping Literal Quotes in Strings
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2QvgSr'
+forumTopicId: 17568
+dashedName: 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: `"` or `'` 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> (`\`) in front of the quote.
+
+```js
+var sampleStr = "Alan said, \"Peter is learning JavaScript\".";
+```
+
+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:
+
+```js
+Alan said, "Peter is learning JavaScript".
+```
+
+# --instructions--
+
+Use <dfn>backslashes</dfn> to assign a string to the `myStr` variable so that if you were to print it to the console, you would see:
+
+```js
+I am a "double quoted" string inside "double quotes".
+```
+
+# --hints--
+
+You should use two double quotes (`"`) and four escaped double quotes (`\"`).
+
+```js
+assert(code.match(/\\"/g).length === 4 && code.match(/[^\\]"/g).length === 2);
+```
+
+Variable myStr should contain the string: `I am a "double quoted" string inside "double quotes".`
+
+```js
+assert(/I am a "double quoted" string inside "double quotes(\."|"\.)$/.test(myStr));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){
+  if(typeof myStr === 'string') {
+    console.log("myStr = \"" + myStr + "\"");
+  } else {
+    console.log("myStr is undefined");
+  }
+})();
+```
+
+## --seed-contents--
+
+```js
+var myStr = ""; // Change this line
+```
+
+# --solutions--
+
+```js
+var myStr = "I am a \"double quoted\" string inside \"double quotes\".";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
new file mode 100644
index 0000000000..00b57be875
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/find-the-length-of-a-string.md
@@ -0,0 +1,69 @@
+---
+id: bd7123c9c448eddfaeb5bdef
+title: Find the Length of a String
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cvmqEAd'
+forumTopicId: 18182
+dashedName: find-the-length-of-a-string
+---
+
+# --description--
+
+You can find the length of a `String` value by writing `.length` after the string variable or string literal.
+
+```js
+console.log("Alan Peter".length);
+```
+
+The value `10` would be displayed in the console.
+
+For example, if we created a variable `var firstName = "Ada"`, we could find out how long the string `Ada` is by using the `firstName.length` property.
+
+# --instructions--
+
+Use the `.length` property to count the number of characters in the `lastName` variable and assign it to `lastNameLength`.
+
+# --hints--
+
+You should not change the variable declarations in the `// Setup` section.
+
+```js
+assert(
+  code.match(/var lastNameLength = 0;/) &&
+    code.match(/var lastName = "Lovelace";/)
+);
+```
+
+`lastNameLength` should be equal to eight.
+
+```js
+assert(typeof lastNameLength !== 'undefined' && lastNameLength === 8);
+```
+
+You should be getting the length of `lastName` by using `.length` like this: `lastName.length`.
+
+```js
+assert(code.match(/=\s*lastName\.length/g) && !code.match(/lastName\s*=\s*8/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+var lastNameLength = 0;
+var lastName = "Lovelace";
+
+// Only change code below this line
+
+lastNameLength = lastName;
+```
+
+# --solutions--
+
+```js
+var lastNameLength = 0;
+var lastName = "Lovelace";
+lastNameLength = lastName.length;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/finding-a-remainder-in-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/finding-a-remainder-in-javascript.md
new file mode 100644
index 0000000000..c035c81b1d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/finding-a-remainder-in-javascript.md
@@ -0,0 +1,69 @@
+---
+id: 56533eb9ac21ba0edf2244ae
+title: Finding a Remainder in JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cWP24Ub'
+forumTopicId: 18184
+dashedName: finding-a-remainder-in-javascript
+---
+
+# --description--
+
+The <dfn>remainder</dfn> operator `%` gives the remainder of the division of two numbers.
+
+**Example**
+
+<blockquote>5 % 2 = 1 because<br>Math.floor(5 / 2) = 2 (Quotient)<br>2 * 2 = 4<br>5 - 4 = 1 (Remainder)</blockquote>
+
+**Usage**  
+In mathematics, a number can be checked to be even or odd by checking the remainder of the division of the number by `2`.
+
+<blockquote>17 % 2 = 1 (17 is Odd)<br>48 % 2 = 0 (48 is Even)</blockquote>
+
+**Note:** 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.
+
+# --instructions--
+
+Set `remainder` equal to the remainder of `11` divided by `3` using the <dfn>remainder</dfn> (`%`) operator.
+
+# --hints--
+
+The variable `remainder` should be initialized
+
+```js
+assert(/var\s+?remainder/.test(code));
+```
+
+The value of `remainder` should be `2`
+
+```js
+assert(remainder === 2);
+```
+
+You should use the `%` operator
+
+```js
+assert(/\s+?remainder\s*?=\s*?.*%.*;?/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y){return 'remainder = '+y;})(remainder);
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+
+var remainder;
+```
+
+# --solutions--
+
+```js
+var remainder =  11 % 3;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
new file mode 100644
index 0000000000..b538265afd
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-fractions-with-javascript.md
@@ -0,0 +1,69 @@
+---
+id: cf1111c1c11feddfaeb9bdef
+title: Generate Random Fractions with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cyWJJs3'
+forumTopicId: 18185
+dashedName: generate-random-fractions-with-javascript
+---
+
+# --description--
+
+Random numbers are useful for creating random behavior.
+
+JavaScript has a `Math.random()` function that generates a random decimal number between `0` (inclusive) and `1` (exclusive). Thus `Math.random()` can return a `0` but never return a `1`.
+
+**Note:** Like [Storing Values with the Assignment Operator](/learn/javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator), all function calls will be resolved before the `return` executes, so we can `return` the value of the `Math.random()` function.
+
+# --instructions--
+
+Change `randomFraction` to return a random number instead of returning `0`.
+
+# --hints--
+
+`randomFraction` should return a random number.
+
+```js
+assert(typeof randomFraction() === 'number');
+```
+
+The number returned by `randomFraction` should be a decimal.
+
+```js
+assert((randomFraction() + '').match(/\./g));
+```
+
+You should be using `Math.random` to generate the random decimal number.
+
+```js
+assert(code.match(/Math\.random/g).length >= 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){return randomFraction();})();
+```
+
+## --seed-contents--
+
+```js
+function randomFraction() {
+
+  // Only change code below this line
+
+  return 0;
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function randomFraction() {
+  return Math.random();
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-with-javascript.md
new file mode 100644
index 0000000000..6795eb0564
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-with-javascript.md
@@ -0,0 +1,90 @@
+---
+id: cf1111c1c12feddfaeb1bdef
+title: Generate Random Whole Numbers with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cRn6bfr'
+forumTopicId: 18186
+dashedName: 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 `Math.random()` can never quite return a `1` and, because we're rounding down, it's impossible to actually get `20`. This technique will give us a whole number between `0` and `19`.
+
+Putting everything together, this is what our code looks like:
+
+```js
+Math.floor(Math.random() * 20);
+```
+
+We are calling `Math.random()`, multiplying the result by 20, then passing the value to `Math.floor()` function to round the value down to the nearest whole number.
+
+# --instructions--
+
+Use this technique to generate and return a random whole number between `0` and `9`.
+
+# --hints--
+
+The result of `randomWholeNum` should be a whole number.
+
+```js
+assert(
+  typeof randomWholeNum() === 'number' &&
+    (function () {
+      var r = randomWholeNum();
+      return Math.floor(r) === r;
+    })()
+);
+```
+
+You should use `Math.random` to generate a random number.
+
+```js
+assert(code.match(/Math.random/g).length >= 1);
+```
+
+You should have multiplied the result of `Math.random` by 10 to make it a number that is between zero and nine.
+
+```js
+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)
+);
+```
+
+You should use `Math.floor` to remove the decimal part of the number.
+
+```js
+assert(code.match(/Math.floor/g).length >= 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){return randomWholeNum();})();
+```
+
+## --seed-contents--
+
+```js
+function randomWholeNum() {
+
+  // Only change code below this line
+
+  return Math.random();
+}
+```
+
+# --solutions--
+
+```js
+function randomWholeNum() {
+  return Math.floor(Math.random() * 10);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range.md
new file mode 100644
index 0000000000..d8e528a91a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range.md
@@ -0,0 +1,102 @@
+---
+id: cf1111c1c12feddfaeb2bdef
+title: Generate Random Whole Numbers within a Range
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cm83yu6'
+forumTopicId: 18187
+dashedName: generate-random-whole-numbers-within-a-range
+---
+
+# --description--
+
+Instead of generating a random whole number between zero and a given number like we did before, we can generate a random whole number that falls within a range of two specific numbers.
+
+To do this, we'll define a minimum number `min` and a maximum number `max`.
+
+Here's the formula we'll use. Take a moment to read it and try to understand what this code is doing:
+
+```js
+Math.floor(Math.random() * (max - min + 1)) + min
+```
+
+# --instructions--
+
+Create a function called `randomRange` that takes a range `myMin` and `myMax` and returns a random whole number that's greater than or equal to `myMin`, and is less than or equal to `myMax`, inclusive.
+
+# --hints--
+
+The lowest random number that can be generated by `randomRange` should be equal to your minimum number, `myMin`.
+
+```js
+assert(calcMin === 5);
+```
+
+The highest random number that can be generated by `randomRange` should be equal to your maximum number, `myMax`.
+
+```js
+assert(calcMax === 15);
+```
+
+The random number generated by `randomRange` should be an integer, not a decimal.
+
+```js
+assert(randomRange(0, 1) % 1 === 0);
+```
+
+`randomRange` should use both `myMax` and `myMin`, and return a random number in your range.
+
+```js
+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;
+    }
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+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";
+  }
+})()
+```
+
+## --seed-contents--
+
+```js
+function randomRange(myMin, myMax) {
+  // Only change code below this line
+  return 0;
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function randomRange(myMin, myMax) {
+  return Math.floor(Math.random() * (myMax - myMin + 1)) + myMin;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
new file mode 100644
index 0000000000..693ced55f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-scope-and-functions.md
@@ -0,0 +1,128 @@
+---
+id: 56533eb9ac21ba0edf2244be
+title: Global Scope and Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cQM7mCN'
+forumTopicId: 18193
+dashedName: 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 declared without the `var` keyword are automatically created in the `global` scope. This can create unintended consequences elsewhere in your code or when running a function again. You should always declare your variables with `var`.
+
+# --instructions--
+
+Using `var`, declare a global variable named `myGlobal` outside of any function. Initialize it with a value of `10`.
+
+Inside function `fun1`, assign `5` to `oopsGlobal` ***without*** using the `var` keyword.
+
+# --hints--
+
+`myGlobal` should be defined
+
+```js
+assert(typeof myGlobal != 'undefined');
+```
+
+`myGlobal` should have a value of `10`
+
+```js
+assert(myGlobal === 10);
+```
+
+`myGlobal` should be declared using the `var` keyword
+
+```js
+assert(/var\s+myGlobal/.test(code));
+```
+
+`oopsGlobal` should be a global variable and have a value of `5`
+
+```js
+assert(typeof oopsGlobal != 'undefined' && oopsGlobal === 5);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+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();
+```
+
+## --after-user-code--
+
+```js
+fun1();
+fun2();
+uncapture();
+(function() { return logOutput || "console.log never called"; })();
+```
+
+## --seed-contents--
+
+```js
+// Declare the myGlobal variable below this line
+
+
+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);
+}
+```
+
+# --solutions--
+
+```js
+var myGlobal = 10;
+
+function fun1() {
+  oopsGlobal = 5;
+}
+
+function fun2() {
+  var output = "";
+  if(typeof myGlobal != "undefined") {
+    output += "myGlobal: " + myGlobal;
+  }
+  if(typeof oopsGlobal != "undefined") {
+    output += " oopsGlobal: " + oopsGlobal;
+  }
+  console.log(output);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-vs.-local-scope-in-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-vs.-local-scope-in-functions.md
new file mode 100644
index 0000000000..a3ea78542a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/global-vs.-local-scope-in-functions.md
@@ -0,0 +1,78 @@
+---
+id: 56533eb9ac21ba0edf2244c0
+title: Global vs. Local Scope in Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c2QwKH2'
+forumTopicId: 18194
+dashedName: 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 local variable takes precedence over the global variable.
+
+In this example:
+
+```js
+var someVar = "Hat";
+function myFun() {
+  var someVar = "Head";
+  return someVar;
+}
+```
+
+The function `myFun` will return the string `Head` because the local version of the variable is present.
+
+# --instructions--
+
+Add a local variable to `myOutfit` function to override the value of `outerWear` with the string `sweater`.
+
+# --hints--
+
+You should not change the value of the global `outerWear`.
+
+```js
+assert(outerWear === 'T-Shirt');
+```
+
+`myOutfit` should return the string `sweater`.
+
+```js
+assert(myOutfit() === 'sweater');
+```
+
+You should not change the return statement.
+
+```js
+assert(/return outerWear/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+var outerWear = "T-Shirt";
+
+function myOutfit() {
+  // Only change code below this line
+
+
+
+  // Only change code above this line
+  return outerWear;
+}
+
+myOutfit();
+```
+
+# --solutions--
+
+```js
+var outerWear = "T-Shirt";
+function myOutfit() {
+  var outerWear = "sweater";
+  return outerWear;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
new file mode 100644
index 0000000000..cc1d2fa8bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/golf-code.md
@@ -0,0 +1,135 @@
+---
+id: 5664820f61c48e80c9fa476c
+title: Golf Code
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9ykNUR'
+forumTopicId: 18195
+dashedName: golf-code
+---
+
+# --description--
+
+In the game of [golf](https://en.wikipedia.org/wiki/Golf), each hole has a `par`, meaning, the average number of `strokes` a golfer is expected to make in order to sink the ball in the hole to complete the play. Depending on how far above or below `par` your `strokes` are, there is a different nickname.
+
+Your function will be passed `par` and `strokes` 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>&#x3C;= 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>>= par + 3</td><td>"Go Home!"</td></tr></tbody></table>
+
+`par` and `strokes` will always be numeric and positive. We have added an array of all the names for your convenience.
+
+# --hints--
+
+`golfScore(4, 1)` should return the string `Hole-in-one!`
+
+```js
+assert(golfScore(4, 1) === 'Hole-in-one!');
+```
+
+`golfScore(4, 2)` should return the string `Eagle`
+
+```js
+assert(golfScore(4, 2) === 'Eagle');
+```
+
+`golfScore(5, 2)` should return the string `Eagle`
+
+```js
+assert(golfScore(5, 2) === 'Eagle');
+```
+
+`golfScore(4, 3)` should return the string `Birdie`
+
+```js
+assert(golfScore(4, 3) === 'Birdie');
+```
+
+`golfScore(4, 4)` should return the string `Par`
+
+```js
+assert(golfScore(4, 4) === 'Par');
+```
+
+`golfScore(1, 1)` should return the string `Hole-in-one!`
+
+```js
+assert(golfScore(1, 1) === 'Hole-in-one!');
+```
+
+`golfScore(5, 5)` should return the string `Par`
+
+```js
+assert(golfScore(5, 5) === 'Par');
+```
+
+`golfScore(4, 5)` should return the string `Bogey`
+
+```js
+assert(golfScore(4, 5) === 'Bogey');
+```
+
+`golfScore(4, 6)` should return the string `Double Bogey`
+
+```js
+assert(golfScore(4, 6) === 'Double Bogey');
+```
+
+`golfScore(4, 7)` should return the string `Go Home!`
+
+```js
+assert(golfScore(4, 7) === 'Go Home!');
+```
+
+`golfScore(5, 9)` should return the string `Go Home!`
+
+```js
+assert(golfScore(5, 9) === 'Go Home!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+}
+
+golfScore(5, 4);
+```
+
+# --solutions--
+
+```js
+function golfScore(par, strokes) {
+  if (strokes === 1) {
+    return "Hole-in-one!";
+  }
+
+  if (strokes <= par - 2) {
+    return "Eagle";
+  }
+
+  if (strokes === par - 1) {
+    return "Birdie";
+  }
+
+  if (strokes === par) {
+    return "Par";
+  }
+
+  if (strokes === par + 1) {
+    return "Bogey";
+  }
+
+  if(strokes === par + 2) {
+    return "Double Bogey";
+  }
+
+  return "Go Home!";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/increment-a-number-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/increment-a-number-with-javascript.md
new file mode 100644
index 0000000000..7de50c056e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/increment-a-number-with-javascript.md
@@ -0,0 +1,80 @@
+---
+id: 56533eb9ac21ba0edf2244ac
+title: Increment a Number with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ca8GLT9'
+forumTopicId: 18201
+dashedName: increment-a-number-with-javascript
+---
+
+# --description--
+
+You can easily <dfn>increment</dfn> or add one to a variable with the `++` operator.
+
+```js
+i++;
+```
+
+is the equivalent of
+
+```js
+i = i + 1;
+```
+
+**Note:** The entire line becomes `i++;`, eliminating the need for the equal sign.
+
+# --instructions--
+
+Change the code to use the `++` operator on `myVar`.
+
+# --hints--
+
+`myVar` should equal `88`.
+
+```js
+assert(myVar === 88);
+```
+
+You should not use the assignment operator.
+
+```js
+assert(
+  /var\s*myVar\s*=\s*87;\s*\/*.*\s*([+]{2}\s*myVar|myVar\s*[+]{2});/.test(code)
+);
+```
+
+You should use the `++` operator.
+
+```js
+assert(/[+]{2}\s*myVar|myVar\s*[+]{2}/.test(code));
+```
+
+You should not change code above the specified comment.
+
+```js
+assert(/var myVar = 87;/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'myVar = ' + z;})(myVar);
+```
+
+## --seed-contents--
+
+```js
+var myVar = 87;
+
+// Only change code below this line
+myVar = myVar + 1;
+```
+
+# --solutions--
+
+```js
+var myVar = 87;
+myVar++;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
new file mode 100644
index 0000000000..83b498c3b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/initializing-variables-with-the-assignment-operator.md
@@ -0,0 +1,50 @@
+---
+id: 56533eb9ac21ba0edf2244a9
+title: Initializing Variables with the Assignment Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cWJ4Bfb'
+forumTopicId: 301171
+dashedName: 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.
+
+```js
+var myVar = 0;
+```
+
+Creates a new variable called `myVar` and assigns it an initial value of `0`.
+
+# --instructions--
+
+Define a variable `a` with `var` and initialize it to a value of `9`.
+
+# --hints--
+
+You should initialize `a` to a value of `9`.
+
+```js
+assert(/var\s+a\s*=\s*9(\s*;?\s*)$/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof a !== 'undefined') {(function(a){return "a = " + a;})(a);} else { (function() {return 'a is undefined';})(); }
+```
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+var a = 9;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements.md
new file mode 100644
index 0000000000..803a30f9c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements.md
@@ -0,0 +1,114 @@
+---
+id: 56533eb9ac21ba0edf2244db
+title: Introducing Else If Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/caeJ2hm'
+forumTopicId: 18206
+dashedName: introducing-else-if-statements
+---
+
+# --description--
+
+If you have multiple conditions that need to be addressed, you can chain `if` statements together with `else if` statements.
+
+```js
+if (num > 15) {
+  return "Bigger than 15";
+} else if (num < 5) {
+  return "Smaller than 5";
+} else {
+  return "Between 5 and 15";
+}
+```
+
+# --instructions--
+
+Convert the logic to use `else if` statements.
+
+# --hints--
+
+You should have at least two `else` statements
+
+```js
+assert(code.match(/else/g).length > 1);
+```
+
+You should have at least two `if` statements
+
+```js
+assert(code.match(/if/g).length > 1);
+```
+
+You should have closing and opening curly braces for each `if else` code block.
+
+```js
+assert(
+  code.match(
+    /if\s*\((.+)\)\s*\{[\s\S]+\}\s*else\s+if\s*\((.+)\)\s*\{[\s\S]+\}\s*else\s*\{[\s\S]+\s*\}/
+  )
+);
+```
+
+`testElseIf(0)` should return the string `Smaller than 5`
+
+```js
+assert(testElseIf(0) === 'Smaller than 5');
+```
+
+`testElseIf(5)` should return the string `Between 5 and 10`
+
+```js
+assert(testElseIf(5) === 'Between 5 and 10');
+```
+
+`testElseIf(7)` should return the string `Between 5 and 10`
+
+```js
+assert(testElseIf(7) === 'Between 5 and 10');
+```
+
+`testElseIf(10)` should return the string `Between 5 and 10`
+
+```js
+assert(testElseIf(10) === 'Between 5 and 10');
+```
+
+`testElseIf(12)` should return the string `Greater than 10`
+
+```js
+assert(testElseIf(12) === 'Greater than 10');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function testElseIf(val) {
+  if (val > 10) {
+    return "Greater than 10";
+  }
+
+  if (val < 5) {
+    return "Smaller than 5";
+  }
+
+  return "Between 5 and 10";
+}
+
+testElseIf(7);
+```
+
+# --solutions--
+
+```js
+function testElseIf(val) {
+  if(val > 10) {
+    return "Greater than 10";
+  } else if(val < 5) {
+    return "Smaller than 5";
+  } else {
+    return "Between 5 and 10";
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements.md
new file mode 100644
index 0000000000..d9dfef41b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements.md
@@ -0,0 +1,106 @@
+---
+id: 56533eb9ac21ba0edf2244da
+title: Introducing Else Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cek4Efq'
+forumTopicId: 18207
+dashedName: introducing-else-statements
+---
+
+# --description--
+
+When a condition for an `if` statement is true, the block of code following it is executed. What about when that condition is false? Normally nothing would happen. With an `else` statement, an alternate block of code can be executed.
+
+```js
+if (num > 10) {
+  return "Bigger than 10";
+} else {
+  return "10 or Less";
+}
+```
+
+# --instructions--
+
+Combine the `if` statements into a single `if/else` statement.
+
+# --hints--
+
+You should only have one `if` statement in the editor
+
+```js
+assert(code.match(/if/g).length === 1);
+```
+
+You should use an `else` statement
+
+```js
+assert(/else/g.test(code));
+```
+
+`testElse(4)` should return the string `5 or Smaller`
+
+```js
+assert(testElse(4) === '5 or Smaller');
+```
+
+`testElse(5)` should return the string `5 or Smaller`
+
+```js
+assert(testElse(5) === '5 or Smaller');
+```
+
+`testElse(6)` should return the string `Bigger than 5`
+
+```js
+assert(testElse(6) === 'Bigger than 5');
+```
+
+`testElse(10)` should return the string `Bigger than 5`
+
+```js
+assert(testElse(10) === 'Bigger than 5');
+```
+
+You should not change the code above or below the specified comments.
+
+```js
+assert(/var result = "";/.test(code) && /return result;/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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;
+}
+
+testElse(4);
+```
+
+# --solutions--
+
+```js
+function testElse(val) {
+  var result = "";
+  if(val > 5) {
+    result = "Bigger than 5";
+  } else {
+    result = "5 or Smaller";
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-odd-numbers-with-a-for-loop.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-odd-numbers-with-a-for-loop.md
new file mode 100644
index 0000000000..bbcc4049a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-odd-numbers-with-a-for-loop.md
@@ -0,0 +1,67 @@
+---
+id: 56104e9e514f539506016a5c
+title: Iterate Odd Numbers With a For Loop
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cm8n7T9'
+forumTopicId: 18212
+dashedName: iterate-odd-numbers-with-a-for-loop
+---
+
+# --description--
+
+For loops don't have to iterate one at a time. By changing our `final-expression`, we can count by even numbers.
+
+We'll start at `i = 0` and loop while `i < 10`. We'll increment `i` by 2 each loop with `i += 2`.
+
+```js
+var ourArray = [];
+for (var i = 0; i < 10; i += 2) {
+  ourArray.push(i);
+}
+```
+
+`ourArray` will now contain `[0,2,4,6,8]`. Let's change our `initialization` so we can count by odd numbers.
+
+# --instructions--
+
+Push the odd numbers from 1 through 9 to `myArray` using a `for` loop.
+
+# --hints--
+
+You should be using a `for` loop for this.
+
+```js
+assert(/for\s*\([^)]+?\)/.test(code));
+```
+
+`myArray` should equal `[1,3,5,7,9]`.
+
+```js
+assert.deepEqual(myArray, [1, 3, 5, 7, 9]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [];
+for (var i = 1; i < 10; i += 2) {
+  myArray.push(i);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-through-an-array-with-a-for-loop.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-through-an-array-with-a-for-loop.md
new file mode 100644
index 0000000000..8dbe697f60
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-through-an-array-with-a-for-loop.md
@@ -0,0 +1,79 @@
+---
+id: 5675e877dbd60be8ad28edc6
+title: Iterate Through an Array with a For Loop
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/caeR3HB'
+forumTopicId: 18216
+dashedName: 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 `for` loop. This code will output each element of the array `arr` to the console:
+
+```js
+var arr = [10, 9, 8, 7, 6];
+for (var i = 0; i < arr.length; i++) {
+   console.log(arr[i]);
+}
+```
+
+Remember that arrays have zero-based indexing, which means the last index of the array is `length - 1`. Our condition for this loop is `i < arr.length`, which stops the loop when `i` is equal to `length`. In this case the last iteration is `i === 4` i.e. when `i` becomes equal to `arr.length - 1` and outputs `6` to the console. Then `i` increases to `5`, and the loop terminates because `i < arr.length` is `false`.
+
+# --instructions--
+
+Declare and initialize a variable `total` to `0`. Use a `for` loop to add the value of each element of the `myArr` array to `total`.
+
+# --hints--
+
+`total` should be declared and initialized to 0.
+
+```js
+assert(code.match(/(var|let|const)\s*?total\s*=\s*0.*?;?/));
+```
+
+`total` should equal 20.
+
+```js
+assert(total === 20);
+```
+
+You should use a `for` loop to iterate through `myArr`.
+
+```js
+assert(/for\s*\(/g.test(code) && /myArr\s*\[/g.test(code));
+```
+
+You should not attempt to directly assign the value 20 to `total`.
+
+```js
+assert(!__helpers.removeWhiteSpace(code).match(/total[=+-]0*[1-9]+/gm));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(){if(typeof total !== 'undefined') { return "total = " + total; } else { return "total is undefined";}})()
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArr = [ 2, 3, 4, 5, 6];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArr = [ 2, 3, 4, 5, 6];
+var total = 0;
+
+for (var i = 0; i < myArr.length; i++) {
+  total += myArr[i];
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
new file mode 100644
index 0000000000..f4dfc98ba7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-do...while-loops.md
@@ -0,0 +1,102 @@
+---
+id: 5a2efd662fb457916e1fe604
+title: Iterate with JavaScript Do...While Loops
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cDqWGcp'
+forumTopicId: 301172
+dashedName: iterate-with-javascript-do---while-loops
+---
+
+# --description--
+
+The next type of loop you will learn is called a `do...while` loop. It is called a `do...while` loop because it will first `do` one pass of the code inside the loop no matter what, and then continue to run the loop `while` the specified condition evaluates to `true`.
+
+```js
+var ourArray = [];
+var i = 0;
+do {
+  ourArray.push(i);
+  i++;
+} while (i < 5);
+```
+
+The example above behaves similar to other types of loops, and the resulting array will look like `[0, 1, 2, 3, 4]`. However, what makes the `do...while` different from other loops is how it behaves when the condition fails on the first check. Let's see this in action: Here is a regular `while` loop that will run the code in the loop as long as `i < 5`:
+
+```js
+var ourArray = []; 
+var i = 5;
+while (i < 5) {
+  ourArray.push(i);
+  i++;
+}
+```
+
+In this example, we initialize the value of `ourArray` to an empty array and the value of `i` to 5. When we execute the `while` loop, the condition evaluates to `false` because `i` is not less than 5, so we do not execute the code inside the loop. The result is that `ourArray` will end up with no values added to it, and it will still look like `[]` when all of the code in the example above has completed running. Now, take a look at a `do...while` loop:
+
+```js
+var ourArray = []; 
+var i = 5;
+do {
+  ourArray.push(i);
+  i++;
+} while (i < 5);
+```
+
+In this case, we initialize the value of `i` to 5, just like we did with the `while` loop. When we get to the next line, there is no condition to evaluate, so we go to the code inside the curly braces and execute it. We will add a single element to the array and then increment `i` before we get to the condition check. When we finally evaluate the condition `i < 5` on the last line, we see that `i` is now 6, which fails the conditional check, so we exit the loop and are done. At the end of the above example, the value of `ourArray` is `[5]`. Essentially, a `do...while` loop ensures that the code inside the loop will run at least once. Let's try getting a `do...while` loop to work by pushing values to an array.
+
+# --instructions--
+
+Change the `while` loop in the code to a `do...while` loop so the loop will push only the number `10` to `myArray`, and `i` will be equal to `11` when your code has finished running.
+
+# --hints--
+
+You should be using a `do...while` loop for this exercise.
+
+```js
+assert(code.match(/do/g));
+```
+
+`myArray` should equal `[10]`.
+
+```js
+assert.deepEqual(myArray, [10]);
+```
+
+`i` should equal `11`
+
+```js
+assert.equal(i, 11);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [];
+var i = 10;
+
+// Only change code below this line
+while (i < 5) {
+  myArray.push(i);
+  i++;
+}
+```
+
+# --solutions--
+
+```js
+var myArray = [];
+var i = 10;
+do {
+  myArray.push(i);
+  i++;
+} while (i < 5)
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-for-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-for-loops.md
new file mode 100644
index 0000000000..a5a0a63719
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-for-loops.md
@@ -0,0 +1,79 @@
+---
+id: cf1111c1c11feddfaeb5bdef
+title: Iterate with JavaScript For Loops
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9yNVCe'
+forumTopicId: 18219
+dashedName: 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 `for` loop because it runs for a specific number of times.
+
+For loops are declared with three optional expressions separated by semicolons:
+
+`for (a; b; c)`, where `a` is the intialization statement, `b` is the condition statement, and `c` is the final expression.
+
+The initialization statement is executed one time only before the loop starts. It is typically used to define and setup your loop variable.
+
+The condition statement is evaluated at the beginning of every loop iteration and will continue as long as it evaluates to `true`. When the condition is `false` at the start of the iteration, the loop will stop executing. This means if the condition starts as false, your loop will never execute.
+
+The final expression is executed at the end of each loop iteration, prior to the next condition check and is usually used to increment or decrement your loop counter.
+
+In the following example we initialize with `i = 0` and iterate while our condition `i < 5` is true. We'll increment `i` by `1` in each loop iteration with `i++` as our final expression.
+
+```js
+var ourArray = [];
+for (var i = 0; i < 5; i++) {
+  ourArray.push(i);
+}
+```
+
+`ourArray` will now have the value `[0,1,2,3,4]`.
+
+# --instructions--
+
+Use a `for` loop to push the values 1 through 5 onto `myArray`.
+
+# --hints--
+
+You should be using a `for` loop for this.
+
+```js
+assert(/for\s*\([^)]+?\)/.test(code));
+```
+
+`myArray` should equal `[1,2,3,4,5]`.
+
+```js
+assert.deepEqual(myArray, [1, 2, 3, 4, 5]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if (typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [];
+for (var i = 1; i < 6; i++) {
+  myArray.push(i);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-while-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-while-loops.md
new file mode 100644
index 0000000000..1352d3e88d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/iterate-with-javascript-while-loops.md
@@ -0,0 +1,73 @@
+---
+id: cf1111c1c11feddfaeb1bdef
+title: Iterate with JavaScript While Loops
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c8QbnCM'
+forumTopicId: 18220
+dashedName: 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 `while` loop because it runs while a specified condition is true and stops once that condition is no longer true.
+
+```js
+var ourArray = [];
+var i = 0;
+while(i < 5) {
+  ourArray.push(i);
+  i++;
+}
+```
+
+In the code example above, the `while` loop will execute 5 times and append the numbers 0 through 4 to `ourArray`.
+
+Let's try getting a while loop to work by pushing values to an array.
+
+# --instructions--
+
+Add the numbers 5 through 0 (inclusive) in descending order to `myArray` using a `while` loop.
+
+# --hints--
+
+You should be using a `while` loop for this.
+
+```js
+assert(code.match(/while/g));
+```
+
+`myArray` should equal `[5,4,3,2,1,0]`.
+
+```js
+assert.deepEqual(myArray, [5, 4, 3, 2, 1, 0]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [];
+var i = 5;
+while(i >= 0) {
+  myArray.push(i);
+  i--;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
new file mode 100644
index 0000000000..21f992cdf6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/local-scope-and-functions.md
@@ -0,0 +1,86 @@
+---
+id: 56533eb9ac21ba0edf2244bf
+title: Local Scope and Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cd62NhM'
+forumTopicId: 18227
+dashedName: 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 `myTest` with a local variable called `loc`.
+
+```js
+function myTest() {
+  var loc = "foo";
+  console.log(loc);
+}
+myTest();
+console.log(loc);
+```
+
+The `myTest()` function call will display the string `foo` in the console. The `console.log(loc)` line will throw an error, as `loc` is not defined outside of the function.
+
+# --instructions--
+
+The editor has two `console.log`s to help you see what is happening. Check the console as you code to see how it changes. Declare a local variable `myVar` inside `myLocalScope` and run the tests.
+
+**Note:** The console will still display `ReferenceError: myVar is not defined`, but this will not cause the tests to fail.
+
+# --hints--
+
+The code should not contain a global `myVar` variable.
+
+```js
+function declared() {
+  myVar;
+}
+assert.throws(declared, ReferenceError);
+```
+
+You should add a local `myVar` variable.
+
+```js
+assert(
+  /functionmyLocalScope\(\)\{.*(var|let|const)myVar[\s\S]*}/.test(
+    __helpers.removeWhiteSpace(code)
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function myLocalScope() {
+
+  // Only change code below this line
+
+  console.log('inside myLocalScope', myVar);
+}
+myLocalScope();
+
+// Run and check the console
+// myVar is not defined outside of myLocalScope
+console.log('outside myLocalScope', myVar);
+```
+
+# --solutions--
+
+```js
+function myLocalScope() {
+
+  // Only change code below this line
+  var myVar;
+  console.log('inside myLocalScope', myVar);
+}
+myLocalScope();
+
+// Run and check the console
+// myVar is not defined outside of myLocalScope
+console.log('outside myLocalScope', myVar);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/logical-order-in-if-else-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/logical-order-in-if-else-statements.md
new file mode 100644
index 0000000000..c86a9a9a7c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/logical-order-in-if-else-statements.md
@@ -0,0 +1,109 @@
+---
+id: 5690307fddb111c6084545d7
+title: Logical Order in If Else Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cwNvMUV'
+forumTopicId: 18228
+dashedName: logical-order-in-if-else-statements
+---
+
+# --description--
+
+Order is important in `if`, `else if` 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:
+
+```js
+function foo(x) {
+  if (x < 1) {
+    return "Less than one";
+  } else if (x < 2) {
+    return "Less than two";
+  } else {
+    return "Greater than or equal to two";
+  }
+}
+```
+
+And the second just switches the order of the statements:
+
+```js
+function bar(x) {
+  if (x < 2) {
+    return "Less than two";
+  } else if (x < 1) {
+    return "Less than one";
+  } else {
+    return "Greater than or equal to two";
+  }
+}
+```
+
+While these two functions look nearly identical if we pass a number to both we get different outputs.
+
+```js
+foo(0)
+bar(0)
+```
+
+`foo(0)` will return the string `Less than one`, and `bar(0)` will return the string `Less than two`.
+
+# --instructions--
+
+Change the order of logic in the function so that it will return the correct statements in all cases.
+
+# --hints--
+
+`orderMyLogic(4)` should return the string `Less than 5`
+
+```js
+assert(orderMyLogic(4) === 'Less than 5');
+```
+
+`orderMyLogic(6)` should return the string `Less than 10`
+
+```js
+assert(orderMyLogic(6) === 'Less than 10');
+```
+
+`orderMyLogic(11)` should return the string `Greater than or equal to 10`
+
+```js
+assert(orderMyLogic(11) === 'Greater than or equal to 10');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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";
+  }
+}
+
+orderMyLogic(7);
+```
+
+# --solutions--
+
+```js
+function orderMyLogic(val) {
+  if(val < 5) {
+    return "Less than 5";
+  } else if (val < 10) {
+    return "Less than 10";
+  } else {
+    return "Greater than or equal to 10";
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-pop.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-pop.md
new file mode 100644
index 0000000000..0a0cfbe9d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-pop.md
@@ -0,0 +1,90 @@
+---
+id: 56bbb991ad1ed5201cd392cc
+title: Manipulate Arrays With pop()
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cRbVZAB'
+forumTopicId: 18236
+dashedName: manipulate-arrays-with-pop
+---
+
+# --description--
+
+Another way to change the data in an array is with the `.pop()` function.
+
+`.pop()` 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, `.pop()` 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.
+
+```js
+var threeArr = [1, 4, 6];
+var oneDown = threeArr.pop();
+console.log(oneDown);
+console.log(threeArr);
+```
+
+The first `console.log` will display the value `6`, and the second will display the value `[1, 4]`.
+
+# --instructions--
+
+Use the `.pop()` function to remove the last item from `myArray`, assigning the popped off value to `removedFromMyArray`.
+
+# --hints--
+
+`myArray` should only contain `[["John", 23]]`.
+
+```js
+assert(
+  (function (d) {
+    if (d[0][0] == 'John' && d[0][1] === 23 && d[1] == undefined) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myArray)
+);
+```
+
+You should use `pop()` on `myArray`.
+
+```js
+assert(/removedFromMyArray\s*=\s*myArray\s*.\s*pop\s*(\s*)/.test(code));
+```
+
+`removedFromMyArray` should only contain `["cat", 2]`.
+
+```js
+assert(
+  (function (d) {
+    if (d[0] == 'cat' && d[1] === 2 && d[2] == undefined) {
+      return true;
+    } else {
+      return false;
+    }
+  })(removedFromMyArray)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y, z){return 'myArray = ' + JSON.stringify(y) + ' & removedFromMyArray = ' + JSON.stringify(z);})(myArray, removedFromMyArray);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [["John", 23], ["cat", 2]];
+
+// Only change code below this line
+var removedFromMyArray;
+```
+
+# --solutions--
+
+```js
+var myArray = [["John", 23], ["cat", 2]];
+var removedFromMyArray = myArray.pop();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-push.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-push.md
new file mode 100644
index 0000000000..5770ab00a5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-push.md
@@ -0,0 +1,77 @@
+---
+id: 56bbb991ad1ed5201cd392cb
+title: Manipulate Arrays With push()
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cnqmVtJ'
+forumTopicId: 18237
+dashedName: manipulate-arrays-with-push
+---
+
+# --description--
+
+An easy way to append data to the end of an array is via the `push()` function.
+
+`.push()` takes one or more <dfn>parameters</dfn> and "pushes" them onto the end of the array.
+
+Examples:
+
+```js
+var arr1 = [1,2,3];
+arr1.push(4);
+
+var arr2 = ["Stimpson", "J", "cat"];
+arr2.push(["happy", "joy"]);
+```
+
+`arr1` now has the value `[1, 2, 3, 4]` and `arr2` has the value `["Stimpson", "J", "cat", ["happy", "joy"]]`.
+
+# --instructions--
+
+Push `["dog", 3]` onto the end of the `myArray` variable.
+
+# --hints--
+
+`myArray` should now equal `[["John", 23], ["cat", 2], ["dog", 3]]`.
+
+```js
+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)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'myArray = ' + JSON.stringify(z);})(myArray);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [["John", 23], ["cat", 2]];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [["John", 23], ["cat", 2]];
+myArray.push(["dog",3]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-shift.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-shift.md
new file mode 100644
index 0000000000..b2cfc4b051
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-shift.md
@@ -0,0 +1,88 @@
+---
+id: 56bbb991ad1ed5201cd392cd
+title: Manipulate Arrays With shift()
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cRbVETW'
+forumTopicId: 18238
+dashedName: manipulate-arrays-with-shift
+---
+
+# --description--
+
+`pop()` always removes the last element of an array. What if you want to remove the first?
+
+That's where `.shift()` comes in. It works just like `.pop()`, except it removes the first element instead of the last.
+
+Example:
+
+```js
+var ourArray = ["Stimpson", "J", ["cat"]];
+var removedFromOurArray = ourArray.shift();
+```
+
+`removedFromOurArray` would have a value of the string `Stimpson`, and `ourArray` would have `["J", ["cat"]]`.
+
+# --instructions--
+
+Use the `.shift()` function to remove the first item from `myArray`, assigning the "shifted off" value to `removedFromMyArray`.
+
+# --hints--
+
+`myArray` should now equal `[["dog", 3]]`.
+
+```js
+assert(
+  (function (d) {
+    if (d[0][0] == 'dog' && d[0][1] === 3 && d[1] == undefined) {
+      return true;
+    } else {
+      return false;
+    }
+  })(myArray)
+);
+```
+
+`removedFromMyArray` should contain `["John", 23]`.
+
+```js
+assert(
+  (function (d) {
+    if (
+      d[0] == 'John' &&
+      d[1] === 23 &&
+      typeof removedFromMyArray === 'object'
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })(removedFromMyArray)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y, z){return 'myArray = ' + JSON.stringify(y) + ' & removedFromMyArray = ' + JSON.stringify(z);})(myArray, removedFromMyArray);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [["John", 23], ["dog", 3]];
+
+// Only change code below this line
+var removedFromMyArray;
+```
+
+# --solutions--
+
+```js
+var myArray = [["John", 23], ["dog", 3]];
+
+// Only change code below this line
+var removedFromMyArray = myArray.shift();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-unshift.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-unshift.md
new file mode 100644
index 0000000000..cf5fd257b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulate-arrays-with-unshift.md
@@ -0,0 +1,78 @@
+---
+id: 56bbb991ad1ed5201cd392ce
+title: Manipulate Arrays With unshift()
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ckNDESv'
+forumTopicId: 18239
+dashedName: manipulate-arrays-with-unshift
+---
+
+# --description--
+
+Not only can you `shift` elements off of the beginning of an array, you can also `unshift` elements to the beginning of an array i.e. add elements in front of the array.
+
+`.unshift()` works exactly like `.push()`, but instead of adding the element at the end of the array, `unshift()` adds the element at the beginning of the array.
+
+Example:
+
+```js
+var ourArray = ["Stimpson", "J", "cat"];
+ourArray.shift();
+ourArray.unshift("Happy");
+```
+
+After the `shift`, `ourArray` would have the value `["J", "cat"]`. After the `unshift`, `ourArray` would have the value `["Happy", "J", "cat"]`.
+
+# --instructions--
+
+Add `["Paul",35]` to the beginning of the `myArray` variable using `unshift()`.
+
+# --hints--
+
+`myArray` should now have `[["Paul", 35], ["dog", 3]]`.
+
+```js
+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)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y, z){return 'myArray = ' + JSON.stringify(y);})(myArray);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [["John", 23], ["dog", 3]];
+myArray.shift();
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [["John", 23], ["dog", 3]];
+myArray.shift();
+myArray.unshift(["Paul", 35]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulating-complex-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulating-complex-objects.md
new file mode 100644
index 0000000000..2be10c422a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/manipulating-complex-objects.md
@@ -0,0 +1,179 @@
+---
+id: 56533eb9ac21ba0edf2244cb
+title: Manipulating Complex Objects
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9yNMfR'
+forumTopicId: 18208
+dashedName: 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:
+
+```js
+var ourMusic = [
+  {
+    "artist": "Daft Punk",
+    "title": "Homework",
+    "release_year": 1997,
+    "formats": [ 
+      "CD", 
+      "Cassette", 
+      "LP"
+    ],
+    "gold": true
+  }
+];
+```
+
+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 `formats` 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, `"artist": "Daft Punk"` is a property that has a key of `artist` and a value of `Daft Punk`. [JavaScript Object Notation](http://www.json.org/) or `JSON` is a related data interchange format used to store data.
+
+```json
+{
+  "artist": "Daft Punk",
+  "title": "Homework",
+  "release_year": 1997,
+  "formats": [ 
+    "CD",
+    "Cassette",
+    "LP"
+  ],
+  "gold": true
+}
+```
+
+**Note:** You will need to place a comma after every object in the array, unless it is the last object in the array.
+
+# --instructions--
+
+Add a new album to the `myMusic` array. Add `artist` and `title` strings, `release_year` number, and a `formats` array of strings.
+
+# --hints--
+
+`myMusic` should be an array
+
+```js
+assert(Array.isArray(myMusic));
+```
+
+`myMusic` should have at least two elements
+
+```js
+assert(myMusic.length > 1);
+```
+
+The elements in the `myMusic` array should be objects
+
+```js
+myMusic.forEach(object => {assert.typeOf(object, 'object')})
+```
+
+Your object in `myMusic` should have at least 4 properties
+
+```js
+myMusic.forEach(object => {assert(Object.keys(object).length > 3); });
+```
+
+Your object in `myMusic` should contain the property `artist` which is a string
+
+```js
+myMusic.forEach(object => {
+  assert.containsAllKeys(object, ['artist']);
+  assert.typeOf(object.artist, 'string')
+})
+```
+
+Your object in `myMusic` should contain the property `title` which is a string
+
+```js
+myMusic.forEach(object => {
+  assert.containsAllKeys(object, ['title']);
+  assert.typeOf(object.title, 'string')
+})
+```
+
+Your object in `myMusic` should contain the property `release_year` which is a number
+
+```js
+myMusic.forEach(object => {
+  assert.containsAllKeys(object, ['release_year']);
+  assert.typeOf(object.release_year, 'number')
+})
+```
+
+Your object in `myMusic` should contain a `formats` property which is an array
+
+```js
+myMusic.forEach(object => {
+  assert.containsAllKeys(object, ['formats']);
+  assert.typeOf(object.formats, 'array')
+})
+```
+
+`formats` should be an array of strings with at least two elements
+
+```js
+myMusic.forEach(object => {
+  object.formats.forEach(format => {
+    assert.typeOf(format, 'string')
+  });
+  assert.isAtLeast(object.formats.length, 2)
+})
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(x){ if (Array.isArray(x)) { return JSON.stringify(x); } return "myMusic is not an array"})(myMusic);
+```
+
+## --seed-contents--
+
+```js
+var myMusic = [
+  {
+    "artist": "Billy Joel",
+    "title": "Piano Man",
+    "release_year": 1973,
+    "formats": [
+      "CD",
+      "8T",
+      "LP"
+    ],
+    "gold": true
+  }
+];
+```
+
+# --solutions--
+
+```js
+var myMusic = [
+  {
+    "artist": "Billy Joel",
+    "title": "Piano Man",
+    "release_year": 1973,
+    "formats": [
+      "CS",
+      "8T",
+      "LP" ],
+    "gold": true
+  },
+  {
+    "artist": "ABBA",
+    "title": "Ring Ring",
+    "release_year": 1973,
+    "formats": [
+      "CS",
+      "8T",
+      "LP",
+    "CD",
+  ]
+  }
+];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/modify-array-data-with-indexes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/modify-array-data-with-indexes.md
new file mode 100644
index 0000000000..3c32397583
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/modify-array-data-with-indexes.md
@@ -0,0 +1,86 @@
+---
+id: cf1111c1c11feddfaeb8bdef
+title: Modify Array Data With Indexes
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/czQM4A8'
+forumTopicId: 18241
+dashedName: modify-array-data-with-indexes
+---
+
+# --description--
+
+Unlike strings, the entries of arrays are <dfn>mutable</dfn> and can be changed freely.
+
+**Example**
+
+```js
+var ourArray = [50,40,30];
+ourArray[0] = 15;
+```
+
+`ourArray` now has the value `[15, 40, 30]`.
+
+**Note:** There shouldn't be any spaces between the array name and the square brackets, like `array [0]`. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.
+
+# --instructions--
+
+Modify the data stored at index `0` of `myArray` to a value of `45`.
+
+# --hints--
+
+`myArray` should now be `[45,64,99]`.
+
+```js
+assert(
+  (function () {
+    if (
+      typeof myArray != 'undefined' &&
+      myArray[0] == 45 &&
+      myArray[1] == 64 &&
+      myArray[2] == 99
+    ) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+You should be using correct index to modify the value in `myArray`.
+
+```js
+assert(
+  (function () {
+    if (code.match(/myArray\[0\]\s*=\s*/g)) {
+      return true;
+    } else {
+      return false;
+    }
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myArray = [18,64,99];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myArray = [18,64,99];
+myArray[0] = 45;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements.md
new file mode 100644
index 0000000000..ad2c7e1643
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements.md
@@ -0,0 +1,149 @@
+---
+id: 56533eb9ac21ba0edf2244df
+title: Multiple Identical Options in Switch Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cdBKWCV'
+forumTopicId: 18242
+dashedName: multiple-identical-options-in-switch-statements
+---
+
+# --description--
+
+If the `break` statement is omitted from a `switch` statement's `case`, the following `case` statement(s) are executed until a `break` is encountered. If you have multiple inputs with the same output, you can represent them in a `switch` statement like this:
+
+```js
+var result = "";
+switch(val) {
+  case 1:
+  case 2:
+  case 3:
+    result = "1, 2, or 3";
+    break;
+  case 4:
+    result = "4 alone";
+}
+```
+
+Cases for 1, 2, and 3 will all produce the same result.
+
+# --instructions--
+
+Write a switch statement to set `answer` for the following ranges:  
+`1-3` - `Low`  
+`4-6` - `Mid`  
+`7-9` - `High`
+
+**Note:** You will need to have a `case` statement for each number in the range.
+
+# --hints--
+
+`sequentialSizes(1)` should return the string `Low`
+
+```js
+assert(sequentialSizes(1) === 'Low');
+```
+
+`sequentialSizes(2)` should return the string `Low`
+
+```js
+assert(sequentialSizes(2) === 'Low');
+```
+
+`sequentialSizes(3)` should return the string `Low`
+
+```js
+assert(sequentialSizes(3) === 'Low');
+```
+
+`sequentialSizes(4)` should return the string `Mid`
+
+```js
+assert(sequentialSizes(4) === 'Mid');
+```
+
+`sequentialSizes(5)` should return the string `Mid`
+
+```js
+assert(sequentialSizes(5) === 'Mid');
+```
+
+`sequentialSizes(6)` should return the string `Mid`
+
+```js
+assert(sequentialSizes(6) === 'Mid');
+```
+
+`sequentialSizes(7)` should return the string `High`
+
+```js
+assert(sequentialSizes(7) === 'High');
+```
+
+`sequentialSizes(8)` should return the string `High`
+
+```js
+assert(sequentialSizes(8) === 'High');
+```
+
+`sequentialSizes(9)` should return the string `High`
+
+```js
+assert(sequentialSizes(9) === 'High');
+```
+
+You should not use any `if` or `else` statements
+
+```js
+assert(!/else/g.test(code) || !/if/g.test(code));
+```
+
+You should have nine `case` statements
+
+```js
+assert(code.match(/case/g).length === 9);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sequentialSizes(val) {
+  var answer = "";
+  // Only change code below this line
+
+
+
+  // Only change code above this line
+  return answer;
+}
+
+sequentialSizes(1);
+```
+
+# --solutions--
+
+```js
+function sequentialSizes(val) {
+  var answer = "";
+
+  switch(val) {
+    case 1:
+    case 2:
+    case 3:
+      answer = "Low";
+      break;
+    case 4:
+    case 5:
+    case 6:
+      answer = "Mid";
+      break;
+    case 7:
+    case 8:
+    case 9:
+      answer = "High";
+  }
+
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-decimals-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-decimals-with-javascript.md
new file mode 100644
index 0000000000..2a502314bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-decimals-with-javascript.md
@@ -0,0 +1,52 @@
+---
+id: bd7993c9c69feddfaeb7bdef
+title: Multiply Two Decimals with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ce2GeHq'
+forumTopicId: 301173
+dashedName: 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.
+
+# --instructions--
+
+Change the `0.0` so that product will equal `5.0`.
+
+# --hints--
+
+The variable `product` should equal `5.0`.
+
+```js
+assert(product === 5.0);
+```
+
+You should use the `*` operator
+
+```js
+assert(/\*/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(y){return 'product = '+y;})(product);
+```
+
+## --seed-contents--
+
+```js
+var product = 2.0 * 0.0;
+```
+
+# --solutions--
+
+```js
+var product = 2.0 * 2.5;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-numbers-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-numbers-with-javascript.md
new file mode 100644
index 0000000000..a67c6a1d38
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/multiply-two-numbers-with-javascript.md
@@ -0,0 +1,60 @@
+---
+id: cf1231c1c11feddfaeb5bdef
+title: Multiply Two Numbers with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cP3y3Aq'
+forumTopicId: 18243
+dashedName: multiply-two-numbers-with-javascript
+---
+
+# --description--
+
+We can also multiply one number by another.
+
+JavaScript uses the `*` symbol for multiplication of two numbers.
+
+**Example**
+
+```js
+myVar = 13 * 13;
+```
+
+`myVar` would have the value `169`.
+
+# --instructions--
+
+Change the `0` so that product will equal `80`.
+
+# --hints--
+
+The variable `product` should be equal to 80.
+
+```js
+assert(product === 80);
+```
+
+You should use the `*` operator.
+
+```js
+assert(/\*/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'product = '+z;})(product);
+```
+
+## --seed-contents--
+
+```js
+var product = 8 * 0;
+```
+
+# --solutions--
+
+```js
+var product = 8 * 10;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nest-one-array-within-another-array.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nest-one-array-within-another-array.md
new file mode 100644
index 0000000000..e49ac053d0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nest-one-array-within-another-array.md
@@ -0,0 +1,51 @@
+---
+id: cf1111c1c11feddfaeb7bdef
+title: Nest one Array within Another Array
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/crZQZf8'
+forumTopicId: 18247
+dashedName: nest-one-array-within-another-array
+---
+
+# --description--
+
+You can also nest arrays within other arrays, like below:
+
+```js
+[["Bulls", 23], ["White Sox", 45]]
+```
+
+This is also called a <dfn>multi-dimensional array</dfn>.
+
+# --instructions--
+
+Create a nested array called `myArray`.
+
+# --hints--
+
+`myArray` should have at least one array nested within another array.
+
+```js
+assert(Array.isArray(myArray) && myArray.some(Array.isArray));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(typeof myArray !== "undefined"){(function(){return myArray;})();}
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+var myArray = [];
+```
+
+# --solutions--
+
+```js
+var myArray = [[1,2,3]];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nesting-for-loops.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nesting-for-loops.md
new file mode 100644
index 0000000000..8b9042e06f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/nesting-for-loops.md
@@ -0,0 +1,93 @@
+---
+id: 56533eb9ac21ba0edf2244e1
+title: Nesting For Loops
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cRn6GHM'
+forumTopicId: 18248
+dashedName: 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:
+
+```js
+var arr = [
+  [1,2], [3,4], [5,6]
+];
+for (var i=0; i < arr.length; i++) {
+  for (var j=0; j < arr[i].length; j++) {
+    console.log(arr[i][j]);
+  }
+}
+```
+
+This outputs each sub-element in `arr` one at a time. Note that for the inner loop, we are checking the `.length` of `arr[i]`, since `arr[i]` is itself an array.
+
+# --instructions--
+
+Modify function `multiplyAll` so that it returns the product of all the numbers in the sub-arrays of `arr`.
+
+# --hints--
+
+`multiplyAll([[1],[2],[3]])` should return `6`
+
+```js
+assert(multiplyAll([[1], [2], [3]]) === 6);
+```
+
+`multiplyAll([[1,2],[3,4],[5,6,7]])` should return `5040`
+
+```js
+assert(
+  multiplyAll([
+    [1, 2],
+    [3, 4],
+    [5, 6, 7]
+  ]) === 5040
+);
+```
+
+`multiplyAll([[5,1],[0.2, 4, 0.5],[3, 9]])` should return `54`
+
+```js
+assert(
+  multiplyAll([
+    [5, 1],
+    [0.2, 4, 0.5],
+    [3, 9]
+  ]) === 54
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function multiplyAll(arr) {
+  var product = 1;
+  // Only change code below this line
+
+  // Only change code above this line
+  return product;
+}
+
+multiplyAll([[1,2],[3,4],[5,6,7]]);
+```
+
+# --solutions--
+
+```js
+function multiplyAll(arr) {
+  var product = 1;
+  for (var i = 0; i < arr.length; i++) {
+    for (var j = 0; j < arr[i].length; j++) {
+      product *= arr[i][j];
+    }
+  }
+  return product;
+}
+
+multiplyAll([[1,2],[3,4],[5,6,7]]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/passing-values-to-functions-with-arguments.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/passing-values-to-functions-with-arguments.md
new file mode 100644
index 0000000000..62795ccd42
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/passing-values-to-functions-with-arguments.md
@@ -0,0 +1,120 @@
+---
+id: 56533eb9ac21ba0edf2244bd
+title: Passing Values to Functions with Arguments
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cy8rahW'
+forumTopicId: 18254
+dashedName: 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, `param1` and `param2`:
+
+```js
+function testFun(param1, param2) {
+  console.log(param1, param2);
+}
+```
+
+Then we can call `testFun` like this: `testFun("Hello", "World");`. We have passed two string arguments, `Hello` and `World`. Inside the function, `param1` will equal the string `Hello` and `param2` will equal the string `World`. Note that you could call `testFun` again with different arguments and the parameters would take on the value of the new arguments.
+
+# --instructions--
+
+<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>
+
+# --hints--
+
+`functionWithArgs` should be a function.
+
+```js
+assert(typeof functionWithArgs === 'function');
+```
+
+`functionWithArgs(1,2)` should output `3`.
+
+```js
+if (typeof functionWithArgs === 'function') {
+  capture();
+  functionWithArgs(1, 2);
+  uncapture();
+}
+assert(logOutput == 3);
+```
+
+`functionWithArgs(7,9)` should output `16`.
+
+```js
+if (typeof functionWithArgs === 'function') {
+  capture();
+  functionWithArgs(7, 9);
+  uncapture();
+}
+assert(logOutput == 16);
+```
+
+You should call `functionWithArgs` with two numbers after you define it.
+
+```js
+assert(
+  /functionWithArgs\([-+]?\d*\.?\d*,[-+]?\d*\.?\d*\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+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();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+
+if (typeof functionWithArgs !== "function") { 
+  (function() { return "functionWithArgs is not defined"; })();
+} else {
+  (function() { return logOutput || "console.log never called"; })();
+}
+```
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+function functionWithArgs(a, b) {
+  console.log(a + b);
+}
+functionWithArgs(10, 5);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
new file mode 100644
index 0000000000..020af1ac5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/practice-comparing-different-values.md
@@ -0,0 +1,78 @@
+---
+id: 599a789b454f2bbd91a3ff4d
+title: Practice comparing different values
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cm8PqCa'
+forumTopicId: 301174
+dashedName: practice-comparing-different-values
+---
+
+# --description--
+
+In the last two challenges, we learned about the equality operator (`==`) and the strict equality operator (`===`). Let's do a quick review and practice using these operators some more.
+
+If the values being compared are not of the same type, the equality operator will perform a type conversion, and then evaluate the values. However, the strict equality operator will compare both the data type and value as-is, without converting one type to the other.
+
+**Examples**
+
+`3 == '3'` returns `true` because JavaScript performs type conversion from string to number. `3 === '3'` returns false because the types are different and type conversion is not performed.
+
+**Note:** In JavaScript, you can determine the type of a variable or a value with the `typeof` operator, as follows:
+
+```js
+typeof 3
+typeof '3'
+```
+
+`typeof 3` returns the string `number`, and `typeof '3'` returns the string `string`.
+
+# --instructions--
+
+The `compareEquality` function in the editor compares two values using the equality operator. Modify the function so that it returns the string `Equal` only when the values are strictly equal.
+
+# --hints--
+
+`compareEquality(10, "10")` should return the string `Not Equal`
+
+```js
+assert(compareEquality(10, '10') === 'Not Equal');
+```
+
+`compareEquality("20", 20)` should return the string `Not Equal`
+
+```js
+assert(compareEquality('20', 20) === 'Not Equal');
+```
+
+You should use the `===` operator
+
+```js
+assert(code.match(/===/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+function compareEquality(a, b) {
+  if (a == b) { // Change this line
+    return "Equal";
+  }
+  return "Not Equal";
+}
+
+compareEquality(10, "10");
+```
+
+# --solutions--
+
+```js
+function compareEquality(a,b) {
+  if (a === b) {
+    return "Equal";
+  }
+  return "Not Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/profile-lookup.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/profile-lookup.md
new file mode 100644
index 0000000000..36cbecd62c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/profile-lookup.md
@@ -0,0 +1,151 @@
+---
+id: 5688e62ea601b2482ff8422b
+title: Profile Lookup
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cDqW2Cg'
+forumTopicId: 18259
+dashedName: profile-lookup
+---
+
+# --description--
+
+We have an array of objects representing different people in our contacts lists.
+
+A `lookUpProfile` function that takes `name` and a property (`prop`) as arguments has been pre-written for you.
+
+The function should check if `name` is an actual contact's `firstName` and the given property (`prop`) is a property of that contact.
+
+If both are true, then return the "value" of that property.
+
+If `name` does not correspond to any contacts then return the string `No such contact`.
+
+If `prop` does not correspond to any valid properties of a contact found to match `name` then return the string `No such property`.
+
+# --hints--
+
+`lookUpProfile("Kristian", "lastName")` should return the string `Vos`
+
+```js
+assert(lookUpProfile('Kristian', 'lastName') === 'Vos');
+```
+
+`lookUpProfile("Sherlock", "likes")` should return `["Intriguing Cases", "Violin"]`
+
+```js
+assert.deepEqual(lookUpProfile('Sherlock', 'likes'), [
+  'Intriguing Cases',
+  'Violin'
+]);
+```
+
+`lookUpProfile("Harry", "likes")` should return an array
+
+```js
+assert(typeof lookUpProfile('Harry', 'likes') === 'object');
+```
+
+`lookUpProfile("Bob", "number")` should return the string `No such contact`
+
+```js
+assert(lookUpProfile('Bob', 'number') === 'No such contact');
+```
+
+`lookUpProfile("Bob", "potato")` should return the string `No such contact`
+
+```js
+assert(lookUpProfile('Bob', 'potato') === 'No such contact');
+```
+
+`lookUpProfile("Akira", "address")` should return the string `No such property`
+
+```js
+assert(lookUpProfile('Akira', 'address') === 'No such property');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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
+}
+
+lookUpProfile("Akira", "likes");
+```
+
+# --solutions--
+
+```js
+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"]
+    },
+];
+
+
+//Write your function in between these comments
+function lookUpProfile(name, prop){
+    for(var i in contacts){
+      if(contacts[i].firstName === name) {
+        return contacts[i][prop] || "No such property";
+      }
+    }
+   return "No such contact";
+}
+//Write your function in between these comments
+
+lookUpProfile("Akira", "likes");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
new file mode 100644
index 0000000000..0947fbe41a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/quoting-strings-with-single-quotes.md
@@ -0,0 +1,81 @@
+---
+id: 56533eb9ac21ba0edf2244b4
+title: Quoting Strings with Single Quotes
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cbQmnhM'
+forumTopicId: 18260
+dashedName: quoting-strings-with-single-quotes
+---
+
+# --description--
+
+<dfn>String</dfn> values in JavaScript may be written with single or double quotes, as long as you start and end with the same type of quote. Unlike some other programming languages, single and double quotes work the same in JavaScript.
+
+```js
+doubleQuoteStr = "This is a string"; 
+singleQuoteStr = 'This is also a string';
+```
+
+The reason why you might want to use one type of quote over the other is if you want to use both in a string. This might happen if you want to save a conversation in a string and have the conversation in quotes. Another use for it would be saving an `<a>` tag with various attributes in quotes, all within a string.
+
+```js
+conversation = 'Finn exclaims to Jake, "Algebraic!"';
+```
+
+However, this becomes a problem if you need to use the outermost quotes within it. Remember, a string has the same kind of quote at the beginning and end. But if you have that same quote somewhere in the middle, the string will stop early and throw an error.
+
+```js
+goodStr = 'Jake asks Finn, "Hey, let\'s go on an adventure?"'; 
+badStr = 'Finn responds, "Let's go!"';
+```
+
+Here `badStr` will throw an error.
+
+In the <dfn>goodStr</dfn> above, you can use both quotes safely by using the backslash `\` as an escape character.
+
+**Note:** The backslash `\` should not be confused with the forward slash `/`. They do not do the same thing.
+
+# --instructions--
+
+Change the provided string to a string with single quotes at the beginning and end and no escape characters.
+
+Right now, the `<a>` tag in the string uses double quotes everywhere. You will need to change the outer quotes to single quotes so you can remove the escape characters.
+
+# --hints--
+
+You should remove all the backslashes (`\`).
+
+```js
+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*'
+    )
+);
+```
+
+You should have two single quotes `'` and four double quotes `"`.
+
+```js
+assert(code.match(/"/g).length === 4 && code.match(/'/g).length === 2);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function() { return "myStr = " + myStr; })();
+```
+
+## --seed-contents--
+
+```js
+var myStr = "<a href=\"http://www.example.com\" target=\"_blank\">Link</a>";
+```
+
+# --solutions--
+
+```js
+var myStr = '<a href="http://www.example.com" target="_blank">Link</a>';
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
new file mode 100644
index 0000000000..97c82e2e49
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/record-collection.md
@@ -0,0 +1,181 @@
+---
+id: 56533eb9ac21ba0edf2244cf
+title: Record Collection
+challengeType: 1
+forumTopicId: 18261
+dashedName: record-collection
+---
+
+# --description--
+
+You are given an object literal representing a part of your musical album collection. Each album has a unique id number as its key and several other properties. Not all albums have complete information.
+
+You start with an `updateRecords` function that takes an object literal, `records`, containing the musical album collection, an `id`, a `prop` (like `artist` or `tracks`), and a `value`. Complete the function using the rules below to modify the object passed to the function.
+
+-   Your function must always return the entire record collection object.
+-   If `prop` isn't `tracks` and `value` isn't an empty string, update or set that album's `prop` to `value`.
+-   If `prop` is `tracks` but the album doesn't have a `tracks` property, create an empty array and add `value` to it.
+-   If `prop` is `tracks` and `value` isn't an empty string, add `value` to the end of the album's existing `tracks` array.
+-   If `value` is an empty string, delete the given `prop` property from the album.
+
+**Note:** A copy of the `recordCollection` object is used for the tests.
+
+# --hints--
+
+After `updateRecords(recordCollection, 5439, "artist", "ABBA")`, `artist` should be the string `ABBA`
+
+```js
+assert(
+  updateRecords(_recordCollection, 5439, 'artist', 'ABBA')[5439]['artist'] ===
+    'ABBA'
+);
+```
+
+After `updateRecords(recordCollection, 5439, "tracks", "Take a Chance on Me")`, `tracks` should have the string `Take a Chance on Me` as the last element.
+
+```js
+assert(
+  updateRecords(_recordCollection, 5439, 'tracks', 'Take a Chance on Me')[5439][
+    'tracks'
+  ].pop() === 'Take a Chance on Me'
+);
+```
+
+After `updateRecords(recordCollection, 2548, "artist", "")`, `artist` should not be set
+
+```js
+updateRecords(_recordCollection, 2548, 'artist', '');
+assert(!_recordCollection[2548].hasOwnProperty('artist'));
+```
+
+After `updateRecords(recordCollection, 1245, "tracks", "Addicted to Love")`, `tracks` should have the string `Addicted to Love` as the last element.
+
+```js
+assert(
+  updateRecords(_recordCollection, 1245, 'tracks', 'Addicted to Love')[1245][
+    'tracks'
+  ].pop() === 'Addicted to Love'
+);
+```
+
+After `updateRecords(recordCollection, 2468, "tracks", "Free")`, `tracks` should have the string `1999` as the first element.
+
+```js
+assert(
+  updateRecords(_recordCollection, 2468, 'tracks', 'Free')[2468][
+    'tracks'
+  ][0] === '1999'
+);
+```
+
+After `updateRecords(recordCollection, 2548, "tracks", "")`, `tracks` should not be set
+
+```js
+updateRecords(_recordCollection, 2548, 'tracks', '');
+assert(!_recordCollection[2548].hasOwnProperty('tracks'));
+```
+
+After `updateRecords(recordCollection, 1245, "albumTitle", "Riptide")`, `albumTitle` should be the string `Riptide`
+
+```js
+assert(
+  updateRecords(_recordCollection, 1245, 'albumTitle', 'Riptide')[1245][
+    'albumTitle'
+  ] === 'Riptide'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const _recordCollection = {
+  2548: {
+    albumTitle: 'Slippery When Wet',
+    artist: 'Bon Jovi',
+    tracks: ['Let It Rock', 'You Give Love a Bad Name']
+  },
+  2468: {
+    albumTitle: '1999',
+    artist: 'Prince',
+    tracks: ['1999', 'Little Red Corvette']
+  },
+  1245: {
+    artist: 'Robert Palmer',
+    tracks: []
+  },
+  5439: {
+    albumTitle: 'ABBA Gold'
+  }
+};
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var recordCollection = {
+  2548: {
+    albumTitle: 'Slippery When Wet',
+    artist: 'Bon Jovi',
+    tracks: ['Let It Rock', 'You Give Love a Bad Name']
+  },
+  2468: {
+    albumTitle: '1999',
+    artist: 'Prince',
+    tracks: ['1999', 'Little Red Corvette']
+  },
+  1245: {
+    artist: 'Robert Palmer',
+    tracks: []
+  },
+  5439: {
+    albumTitle: 'ABBA Gold'
+  }
+};
+
+// Only change code below this line
+function updateRecords(records, id, prop, value) {
+  return records;
+}
+
+updateRecords(recordCollection, 5439, 'artist', 'ABBA');
+```
+
+# --solutions--
+
+```js
+var recordCollection = {
+  2548: {
+    albumTitle: 'Slippery When Wet',
+    artist: 'Bon Jovi',
+    tracks: ['Let It Rock', 'You Give Love a Bad Name']
+  },
+  2468: {
+    albumTitle: '1999',
+    artist: 'Prince',
+    tracks: ['1999', 'Little Red Corvette']
+  },
+  1245: {
+    artist: 'Robert Palmer',
+    tracks: []
+  },
+  5439: {
+    albumTitle: 'ABBA Gold'
+  }
+};
+
+// Only change code below this line
+function updateRecords(records, id, prop, value) {
+  if (value === '') delete records[id][prop];
+  else if (prop === 'tracks') {
+    records[id][prop] = records[id][prop] || [];
+    records[id][prop].push(value);
+  } else {
+    records[id][prop] = value;
+  }
+
+  return records;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion.md
new file mode 100644
index 0000000000..b7b76c9e4f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion.md
@@ -0,0 +1,105 @@
+---
+id: 5cfa3679138e7d9595b9d9d4
+title: Replace Loops using Recursion
+challengeType: 1
+videoUrl: >-
+  https://www.freecodecamp.org/news/how-recursion-works-explained-with-flowcharts-and-a-video-de61f40cb7f9/
+forumTopicId: 301175
+dashedName: replace-loops-using-recursion
+---
+
+# --description--
+
+Recursion is the concept that a function can be expressed in terms of itself. To help understand this, start by thinking about the following task: multiply the first `n` elements of an array to create the product of those elements. Using a `for` loop, you could do this:
+
+```js
+  function multiply(arr, n) {
+    var product = 1;
+    for (var i = 0; i < n; i++) {
+        product *= arr[i];
+    }
+    return product;
+  }
+```
+
+However, notice that `multiply(arr, n) == multiply(arr, n - 1) * arr[n - 1]`. That means you can rewrite `multiply` in terms of itself and never need to use a loop.
+
+```js
+  function multiply(arr, n) {
+    if (n <= 0) {
+      return 1;
+    } else {
+      return multiply(arr, n - 1) * arr[n - 1];
+    }
+  }
+```
+
+The recursive version of `multiply` breaks down like this. In the <dfn>base case</dfn>, where `n <= 0`, it returns 1. For larger values of `n`, it calls itself, but with `n - 1`. That function call is evaluated in the same way, calling `multiply` again until `n <= 0`. At this point, all the functions can return and the original `multiply` returns the answer.
+
+**Note:** Recursive functions must have a base case when they return without calling the function again (in this example, when `n <= 0`), otherwise they can never finish executing.
+
+# --instructions--
+
+Write a recursive function, `sum(arr, n)`, that returns the sum of the first `n` elements of an array `arr`.
+
+# --hints--
+
+`sum([1], 0)` should equal 0.
+
+```js
+assert.equal(sum([1], 0), 0);
+```
+
+`sum([2, 3, 4], 1)` should equal 2.
+
+```js
+assert.equal(sum([2, 3, 4], 1), 2);
+```
+
+`sum([2, 3, 4, 5], 3)` should equal 9.
+
+```js
+assert.equal(sum([2, 3, 4, 5], 3), 9);
+```
+
+Your code should not rely on any kind of loops (`for` or `while` or higher order functions such as `forEach`, `map`, `filter`, or `reduce`.).
+
+```js
+assert(
+  !code.match(/for|while|forEach|map|filter|reduce/g)
+);
+```
+
+You should use recursion to solve this problem.
+
+```js
+assert(
+  sum.toString().match(/sum\(.*\)/g).length > 1
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sum(arr, n) {
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function sum(arr, n) {
+  // Only change code below this line
+  if(n <= 0) {
+    return 0;
+  } else {
+    return sum(arr, n - 1) + arr[n - 1];
+  }
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replacing-if-else-chains-with-switch.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replacing-if-else-chains-with-switch.md
new file mode 100644
index 0000000000..02dc869675
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/replacing-if-else-chains-with-switch.md
@@ -0,0 +1,157 @@
+---
+id: 56533eb9ac21ba0edf2244e0
+title: Replacing If Else Chains with Switch
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c3JE8fy'
+forumTopicId: 18266
+dashedName: replacing-if-else-chains-with-switch
+---
+
+# --description--
+
+If you have many options to choose from, a `switch` statement can be easier to write than many chained `if`/`else if` statements. The following:
+
+```js
+if (val === 1) {
+  answer = "a";
+} else if (val === 2) {
+  answer = "b";
+} else {
+  answer = "c";
+}
+```
+
+can be replaced with:
+
+```js
+switch(val) {
+  case 1:
+    answer = "a";
+    break;
+  case 2:
+    answer = "b";
+    break;
+  default:
+    answer = "c";
+}
+```
+
+# --instructions--
+
+Change the chained `if`/`else if` statements into a `switch` statement.
+
+# --hints--
+
+You should not use any `else` statements anywhere in the editor
+
+```js
+assert(!/else/g.test(code));
+```
+
+You should not use any `if` statements anywhere in the editor
+
+```js
+assert(!/if/g.test(code));
+```
+
+You should have at least four `break` statements
+
+```js
+assert(code.match(/break/g).length >= 4);
+```
+
+`chainToSwitch("bob")` should be the string `Marley`
+
+```js
+assert(chainToSwitch('bob') === 'Marley');
+```
+
+`chainToSwitch(42)` should be the string `The Answer`
+
+```js
+assert(chainToSwitch(42) === 'The Answer');
+```
+
+`chainToSwitch(1)` should be the string `There is no #1`
+
+```js
+assert(chainToSwitch(1) === 'There is no #1');
+```
+
+`chainToSwitch(99)` should be the string `Missed me by this much!`
+
+```js
+assert(chainToSwitch(99) === 'Missed me by this much!');
+```
+
+`chainToSwitch(7)` should be the string `Ate Nine`
+
+```js
+assert(chainToSwitch(7) === 'Ate Nine');
+```
+
+`chainToSwitch("John")` should be `""` (empty string)
+
+```js
+assert(chainToSwitch('John') === '');
+```
+
+`chainToSwitch(156)` should be `""` (empty string)
+
+```js
+assert(chainToSwitch(156) === '');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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;
+}
+
+chainToSwitch(7);
+```
+
+# --solutions--
+
+```js
+function chainToSwitch(val) {
+  var answer = "";
+
+  switch(val) {
+    case "bob":
+      answer = "Marley";
+      break;
+    case 42:
+      answer = "The Answer";
+      break;
+    case 1:
+      answer = "There is no #1";
+      break;
+    case 99:
+      answer = "Missed me by this much!";
+      break;
+    case 7:
+      answer = "Ate Nine";
+  }
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-a-value-from-a-function-with-return.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-a-value-from-a-function-with-return.md
new file mode 100644
index 0000000000..7384c9b5cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-a-value-from-a-function-with-return.md
@@ -0,0 +1,72 @@
+---
+id: 56533eb9ac21ba0edf2244c2
+title: Return a Value from a Function with Return
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cy87wue'
+forumTopicId: 18271
+dashedName: return-a-value-from-a-function-with-return
+---
+
+# --description--
+
+We can pass values into a function with <dfn>arguments</dfn>. You can use a `return` statement to send a value back out of a function.
+
+**Example**
+
+```js
+function plusThree(num) {
+  return num + 3;
+}
+var answer = plusThree(5);
+```
+
+`answer` has the value `8`.
+
+`plusThree` takes an <dfn>argument</dfn> for `num` and returns a value equal to `num + 3`.
+
+# --instructions--
+
+Create a function `timesFive` that accepts one argument, multiplies it by `5`, and returns the new value.
+
+# --hints--
+
+`timesFive` should be a function
+
+```js
+assert(typeof timesFive === 'function');
+```
+
+`timesFive(5)` should return `25`
+
+```js
+assert(timesFive(5) === 25);
+```
+
+`timesFive(2)` should return `10`
+
+```js
+assert(timesFive(2) === 10);
+```
+
+`timesFive(0)` should return `0`
+
+```js
+assert(timesFive(0) === 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+function timesFive(num) {
+  return num * 5;
+}
+timesFive(10);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
new file mode 100644
index 0000000000..6cec2141cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/return-early-pattern-for-functions.md
@@ -0,0 +1,106 @@
+---
+id: 56533eb9ac21ba0edf2244c4
+title: Return Early Pattern for Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cQe39Sq'
+forumTopicId: 18272
+dashedName: return-early-pattern-for-functions
+---
+
+# --description--
+
+When a `return` statement is reached, the execution of the current function stops and control returns to the calling location.
+
+**Example**
+
+```js
+function myFun() {
+  console.log("Hello");
+  return "World";
+  console.log("byebye")
+}
+myFun();
+```
+
+The above will display the string `Hello` in the console, and return the string `World`. The string `byebye` will never display in the console, because the function exits at the `return` statement.
+
+# --instructions--
+
+Modify the function `abTest` so that if `a` or `b` are less than `0` the function will immediately exit with a value of `undefined`.
+
+**Hint**  
+Remember that [`undefined` is a keyword](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables), not a string.
+
+# --hints--
+
+`abTest(2,2)` should return a number
+
+```js
+assert(typeof abTest(2, 2) === 'number');
+```
+
+`abTest(2,2)` should return `8`
+
+```js
+assert(abTest(2, 2) === 8);
+```
+
+`abTest(-2,2)` should return `undefined`
+
+```js
+assert(abTest(-2, 2) === undefined);
+```
+
+`abTest(2,-2)` should return `undefined`
+
+```js
+assert(abTest(2, -2) === undefined);
+```
+
+`abTest(2,8)` should return `18`
+
+```js
+assert(abTest(2, 8) === 18);
+```
+
+`abTest(3,3)` should return `12`
+
+```js
+assert(abTest(3, 3) === 12);
+```
+
+`abTest(0,0)` should return `0`
+
+```js
+assert(abTest(0, 0) === 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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));
+}
+
+abTest(2,2);
+```
+
+# --solutions--
+
+```js
+function abTest(a, b) {
+  if(a < 0 || b < 0) {
+    return undefined;
+  }
+  return Math.round(Math.pow(Math.sqrt(a) + Math.sqrt(b), 2));
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
new file mode 100644
index 0000000000..93e720df7c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions.md
@@ -0,0 +1,82 @@
+---
+id: 5679ceb97cbaa8c51670a16b
+title: Returning Boolean Values from Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cp62qAQ'
+forumTopicId: 18273
+dashedName: returning-boolean-values-from-functions
+---
+
+# --description--
+
+You may recall from [Comparison with the Equality Operator](/learn/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator) that all comparison operators return a boolean `true` or `false` value.
+
+Sometimes people use an `if/else` statement to do a comparison, like this:
+
+```js
+function isEqual(a,b) {
+  if (a === b) {
+    return true;
+  } else {
+    return false;
+  }
+}
+```
+
+But there's a better way to do this. Since `===` returns `true` or `false`, we can return the result of the comparison:
+
+```js
+function isEqual(a,b) {
+  return a === b;
+}
+```
+
+# --instructions--
+
+Fix the function `isLess` to remove the `if/else` statements.
+
+# --hints--
+
+`isLess(10,15)` should return `true`
+
+```js
+assert(isLess(10, 15) === true);
+```
+
+`isLess(15,10)` should return `false`
+
+```js
+assert(isLess(15, 10) === false);
+```
+
+You should not use any `if` or `else` statements
+
+```js
+assert(!/if|else/g.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLess(a, b) {
+  // Only change code below this line
+  if (a < b) {
+    return true;
+  } else {
+    return false;
+  }
+  // Only change code above this line
+}
+
+isLess(10, 15);
+```
+
+# --solutions--
+
+```js
+function isLess(a, b) {
+  return a < b;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements.md
new file mode 100644
index 0000000000..81ea5ba048
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements.md
@@ -0,0 +1,114 @@
+---
+id: 56533eb9ac21ba0edf2244dd
+title: Selecting from Many Options with Switch Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c4mv4fm'
+forumTopicId: 18277
+dashedName: selecting-from-many-options-with-switch-statements
+---
+
+# --description--
+
+If you have many options to choose from, use a <dfn>switch</dfn> statement. A `switch` statement tests a value and can have many <dfn>case</dfn> statements which define various possible values. Statements are executed from the first matched `case` value until a `break` is encountered.
+
+Here is an example of a `switch` statement:
+
+```js
+switch(lowercaseLetter) {
+  case "a":
+    console.log("A");
+    break;
+  case "b":
+    console.log("B");
+    break;
+}
+```
+
+`case` values are tested with strict equality (`===`). The `break` tells JavaScript to stop executing statements. If the `break` is omitted, the next statement will be executed.
+
+# --instructions--
+
+Write a switch statement which tests `val` and sets `answer` for the following conditions:  
+`1` - `alpha`  
+`2` - `beta`  
+`3` - `gamma`  
+`4` - `delta`
+
+# --hints--
+
+`caseInSwitch(1)` should have a value of the string `alpha`
+
+```js
+assert(caseInSwitch(1) === 'alpha');
+```
+
+`caseInSwitch(2)` should have a value of the string `beta`
+
+```js
+assert(caseInSwitch(2) === 'beta');
+```
+
+`caseInSwitch(3)` should have a value of the string `gamma`
+
+```js
+assert(caseInSwitch(3) === 'gamma');
+```
+
+`caseInSwitch(4)` should have a value of the string `delta`
+
+```js
+assert(caseInSwitch(4) === 'delta');
+```
+
+You should not use any `if` or `else` statements
+
+```js
+assert(!/else/g.test(code) || !/if/g.test(code));
+```
+
+You should have at least 3 `break` statements
+
+```js
+assert(code.match(/break/g).length > 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function caseInSwitch(val) {
+  var answer = "";
+  // Only change code below this line
+
+
+
+  // Only change code above this line
+  return answer;
+}
+
+caseInSwitch(1);
+```
+
+# --solutions--
+
+```js
+function caseInSwitch(val) {
+  var answer = "";
+
+  switch(val) {
+    case 1:
+      answer = "alpha";
+      break;
+    case 2:
+      answer = "beta";
+      break;
+    case 3:
+      answer = "gamma";
+      break;
+    case 4:
+      answer = "delta";
+  }
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/shopping-list.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/shopping-list.md
new file mode 100644
index 0000000000..3652235f7a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/shopping-list.md
@@ -0,0 +1,97 @@
+---
+id: 56533eb9ac21ba0edf2244bc
+title: Shopping List
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9MEKHZ'
+forumTopicId: 18280
+dashedName: shopping-list
+---
+
+# --description--
+
+Create a shopping list in the variable `myList`. 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.
+
+```js
+["Chocolate Bar", 15]
+```
+
+There should be at least 5 sub-arrays in the list.
+
+# --hints--
+
+`myList` should be an array.
+
+```js
+assert(isArray);
+```
+
+The first elements in each of your sub-arrays should all be strings.
+
+```js
+assert(hasString);
+```
+
+The second elements in each of your sub-arrays should all be numbers.
+
+```js
+assert(hasNumber);
+```
+
+You should have at least 5 items in your list.
+
+```js
+assert(count > 4);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+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;
+      for (var elem of myList) {
+        if(!elem || !elem[0] || typeof elem[0] !== 'string') {
+          hasString = false;
+        }
+        if(!elem || typeof elem[1] !== 'number') {
+          hasNumber = false;
+        }
+      }
+    }
+    count = myList.length;
+    return JSON.stringify(myList);
+  } else {
+    return "myList is not an array";
+  }
+
+})(myList);
+```
+
+## --seed-contents--
+
+```js
+var myList = [];
+```
+
+# --solutions--
+
+```js
+var myList = [
+  ["Candy", 10],
+  ["Potatoes", 12],
+  ["Eggs", 12],
+  ["Catfood", 1],
+  ["Toads", 9]
+];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
new file mode 100644
index 0000000000..89076ed28c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/stand-in-line.md
@@ -0,0 +1,118 @@
+---
+id: 56533eb9ac21ba0edf2244c6
+title: Stand in Line
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ca8Q8tP'
+forumTopicId: 18307
+dashedName: 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 queue and old items are taken off from the front of the queue.
+
+Write a function `nextInLine` which takes an array (`arr`) and a number (`item`) as arguments.
+
+Add the number to the end of the array, then remove the first element of the array.
+
+The `nextInLine` function should then return the element that was removed.
+
+# --hints--
+
+`nextInLine([], 5)` should return a number.
+
+```js
+assert.isNumber(nextInLine([], 5));
+```
+
+`nextInLine([], 1)` should return `1`
+
+```js
+assert(nextInLine([], 1) === 1);
+```
+
+`nextInLine([2], 1)` should return `2`
+
+```js
+assert(nextInLine([2], 1) === 2);
+```
+
+`nextInLine([5,6,7,8,9], 1)` should return `5`
+
+```js
+assert(nextInLine([5, 6, 7, 8, 9], 1) === 5);
+```
+
+After `nextInLine(testArr, 10)`, `testArr[4]` should be `10`
+
+```js
+nextInLine(testArr, 10);
+assert(testArr[4] === 10);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+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();
+```
+
+## --after-user-code--
+
+```js
+uncapture();
+testArr = [1,2,3,4,5];
+(function() { return logOutput.join("\n");})();
+```
+
+## --seed-contents--
+
+```js
+function nextInLine(arr, item) {
+  // Only change code below this line
+  
+  return item;
+  // Only change code above this line
+  
+
+}
+
+// Setup
+var testArr = [1,2,3,4,5];
+
+// Display code
+console.log("Before: " + JSON.stringify(testArr));
+console.log(nextInLine(testArr, 6));
+console.log("After: " + JSON.stringify(testArr));
+```
+
+# --solutions--
+
+```js
+var testArr = [ 1,2,3,4,5];
+
+function nextInLine(arr, item) {
+    arr.push(item);
+    return arr.shift();
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/store-multiple-values-in-one-variable-using-javascript-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/store-multiple-values-in-one-variable-using-javascript-arrays.md
new file mode 100644
index 0000000000..cb67e6fa45
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/store-multiple-values-in-one-variable-using-javascript-arrays.md
@@ -0,0 +1,63 @@
+---
+id: bd7993c9c69feddfaeb8bdef
+title: Store Multiple Values in one Variable using JavaScript Arrays
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/crZQWAm'
+forumTopicId: 18309
+dashedName: store-multiple-values-in-one-variable-using-javascript-arrays
+---
+
+# --description--
+
+With JavaScript `array` 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:
+
+```js
+var sandwich = ["peanut butter", "jelly", "bread"]
+```
+
+# --instructions--
+
+Modify the new array `myArray` so that it contains both a string and a number (in that order).
+
+# --hints--
+
+`myArray` should be an array.
+
+```js
+assert(typeof myArray == 'object');
+```
+
+The first item in `myArray` should be a string.
+
+```js
+assert(typeof myArray[0] !== 'undefined' && typeof myArray[0] == 'string');
+```
+
+The second item in `myArray` should be a number.
+
+```js
+assert(typeof myArray[1] !== 'undefined' && typeof myArray[1] == 'number');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return z;})(myArray);
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+var myArray = [];
+```
+
+# --solutions--
+
+```js
+var myArray = ["The Answer", 42];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator.md
new file mode 100644
index 0000000000..8c946f1c2d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/storing-values-with-the-assignment-operator.md
@@ -0,0 +1,77 @@
+---
+id: 56533eb9ac21ba0edf2244a8
+title: Storing Values with the Assignment Operator
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cEanysE'
+forumTopicId: 18310
+dashedName: storing-values-with-the-assignment-operator
+---
+
+# --description--
+
+In JavaScript, you can store a value in a variable with the <dfn>assignment</dfn> operator (`=`).
+
+```js
+myVariable = 5;
+```
+
+This assigns the `Number` value `5` to `myVariable`.
+
+If there are any calculations to the right of the `=` operator, those are performed before the value is assigned to the variable on the left of the operator.
+
+```js
+var myVar;
+myVar = 5;
+```
+
+First, this code creates a variable named `myVar`. Then, the code assigns `5` to `myVar`. Now, if `myVar` appears again in the code, the program will treat it as if it is `5`.
+
+# --instructions--
+
+Assign the value `7` to variable `a`.
+
+# --hints--
+
+You should not change code above the specified comment.
+
+```js
+assert(/var a;/.test(code));
+```
+
+`a` should have a value of 7.
+
+```js
+assert(typeof a === 'number' && a === 7);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+if (typeof a != 'undefined') {
+  a = undefined;
+}
+```
+
+## --after-user-code--
+
+```js
+(function(a){return "a = " + a;})(a);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var a;
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var a;
+a = 7;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/subtract-one-number-from-another-with-javascript.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/subtract-one-number-from-another-with-javascript.md
new file mode 100644
index 0000000000..295cab9988
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/subtract-one-number-from-another-with-javascript.md
@@ -0,0 +1,59 @@
+---
+id: cf1111c1c11feddfaeb4bdef
+title: Subtract One Number from Another with JavaScript
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cP3yQtk'
+forumTopicId: 18314
+dashedName: subtract-one-number-from-another-with-javascript
+---
+
+# --description--
+
+We can also subtract one number from another.
+
+JavaScript uses the `-` symbol for subtraction.
+
+**Example**
+
+```js
+myVar = 12 - 6;
+```
+
+`myVar` would have the value `6`.
+# --instructions--
+
+Change the `0` so the difference is `12`.
+
+# --hints--
+
+The variable `difference` should be equal to 12.
+
+```js
+assert(difference === 12);
+```
+
+You should only subtract one number from 45.
+
+```js
+assert(/difference=45-33;?/.test(__helpers.removeWhiteSpace(code)));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return 'difference = '+z;})(difference);
+```
+
+## --seed-contents--
+
+```js
+var difference = 45 - 0;
+```
+
+# --solutions--
+
+```js
+var difference = 45 - 33;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md
new file mode 100644
index 0000000000..8266e86836
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/testing-objects-for-properties.md
@@ -0,0 +1,98 @@
+---
+id: 567af2437cbaa8c51670a16c
+title: Testing Objects for Properties
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c6Wz4ySr'
+forumTopicId: 18324
+dashedName: 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 `.hasOwnProperty(propname)` method of objects to determine if that object has the given property name. `.hasOwnProperty()` returns `true` or `false` if the property is found or not.
+
+**Example**
+
+```js
+var myObj = {
+  top: "hat",
+  bottom: "pants"
+};
+myObj.hasOwnProperty("top");
+myObj.hasOwnProperty("middle");
+```
+
+The first `hasOwnProperty` returns `true`, while the second returns `false`.
+
+# --instructions--
+
+Modify the function `checkObj` to test if an object passed to the function (`obj`) contains a specific property (`checkProp`). If the property is found, return that property's value. If not, return `"Not Found"`.
+
+# --hints--
+
+`checkObj({gift: "pony", pet: "kitten", bed: "sleigh"}, "gift")` should return the string `pony`.
+
+```js
+assert(
+  checkObj({ gift: 'pony', pet: 'kitten', bed: 'sleigh' }, 'gift') === 'pony'
+);
+```
+
+`checkObj({gift: "pony", pet: "kitten", bed: "sleigh"}, "pet")` should return the string `kitten`.
+
+```js
+assert(
+  checkObj({ gift: 'pony', pet: 'kitten', bed: 'sleigh' }, 'pet') === 'kitten'
+);
+```
+
+`checkObj({gift: "pony", pet: "kitten", bed: "sleigh"}, "house")` should return the string `Not Found`.
+
+```js
+assert(
+  checkObj({ gift: 'pony', pet: 'kitten', bed: 'sleigh' }, 'house') ===
+    'Not Found'
+);
+```
+
+`checkObj({city: "Seattle"}, "city")` should return the string `Seattle`.
+
+```js
+assert(checkObj({ city: 'Seattle' }, 'city') === 'Seattle');
+```
+
+`checkObj({city: "Seattle"}, "district")` should return the string `Not Found`.
+
+```js
+assert(checkObj({ city: 'Seattle' }, 'district') === 'Not Found');
+```
+
+`checkObj({pet: "kitten", bed: "sleigh"}, "gift")` should return the string `Not Found`.
+
+```js
+assert(checkObj({ pet: 'kitten', bed: 'sleigh' }, 'gift') === 'Not Found');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkObj(obj, checkProp) {
+  // Only change code below this line
+  return "Change Me!";
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function checkObj(obj, checkProp) {
+  if(obj.hasOwnProperty(checkProp)) {
+    return obj[checkProp];
+  } else {
+    return "Not Found";
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
new file mode 100644
index 0000000000..89597062f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understand-string-immutability.md
@@ -0,0 +1,70 @@
+---
+id: 56533eb9ac21ba0edf2244ba
+title: Understand String Immutability
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cWPVaUR'
+forumTopicId: 18331
+dashedName: understand-string-immutability
+---
+
+# --description--
+
+In JavaScript, `String` values are <dfn>immutable</dfn>, which means that they cannot be altered once created.
+
+For example, the following code:
+
+```js
+var myStr = "Bob";
+myStr[0] = "J";
+```
+
+cannot change the value of `myStr` to `Job`, because the contents of `myStr` cannot be altered. Note that this does *not* mean that `myStr` cannot be changed, just that the individual characters of a <dfn>string literal</dfn> cannot be changed. The only way to change `myStr` would be to assign it with a new string, like this:
+
+```js
+var myStr = "Bob";
+myStr = "Job";
+```
+
+# --instructions--
+
+Correct the assignment to `myStr` so it contains the string value of `Hello World` using the approach shown in the example above.
+
+# --hints--
+
+`myStr` should have a value of the string `Hello World`.
+
+```js
+assert(myStr === 'Hello World');
+```
+
+You should not change the code above the specified comment.
+
+```js
+assert(/myStr = "Jello World"/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(v){return "myStr = " + v;})(myStr);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myStr = "Jello World";
+
+// Only change code below this line
+myStr[0] = "H"; // Change this line
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+var myStr = "Jello World";
+myStr = "Hello World";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-boolean-values.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-boolean-values.md
new file mode 100644
index 0000000000..5086886e64
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-boolean-values.md
@@ -0,0 +1,61 @@
+---
+id: bd7123c9c441eddfaeb5bdef
+title: Understanding Boolean Values
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9Me8t4'
+forumTopicId: 301176
+dashedName: understanding-boolean-values
+---
+
+# --description--
+
+Another data type is the <dfn>Boolean</dfn>. Booleans may only be one of two values: `true` or `false`. They are basically little on-off switches, where `true` is on and `false` is off. These two states are mutually exclusive.
+
+**Note:** Boolean values are never written with quotes. The strings `"true"` and `"false"` are not Boolean and have no special meaning in JavaScript.
+
+# --instructions--
+
+Modify the `welcomeToBooleans` function so that it returns `true` instead of `false` when the run button is clicked.
+
+# --hints--
+
+The `welcomeToBooleans()` function should return a Boolean (`true` or `false`) value.
+
+```js
+assert(typeof welcomeToBooleans() === 'boolean');
+```
+
+`welcomeToBooleans()` should return `true`.
+
+```js
+assert(welcomeToBooleans() === true);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+welcomeToBooleans();
+```
+
+## --seed-contents--
+
+```js
+function welcomeToBooleans() {
+
+  // Only change code below this line
+
+  return false; // Change this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function welcomeToBooleans() {
+  return true; // Change this line
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
new file mode 100644
index 0000000000..93c8577ac6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
@@ -0,0 +1,100 @@
+---
+id: 56533eb9ac21ba0edf2244ab
+title: Understanding Case Sensitivity in Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cd6GDcD'
+forumTopicId: 18334
+dashedName: understanding-case-sensitivity-in-variables
+---
+
+# --description--
+
+In JavaScript all variables and function names are case sensitive. This means that capitalization matters.
+
+`MYVAR` is not the same as `MyVar` nor `myvar`. 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 *do not* use this language feature.
+
+**Best Practice**
+
+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.
+
+**Examples:**
+
+```js
+var someVariable;
+var anotherVariableName;
+var thisVariableNameIsSoLong;
+```
+
+# --instructions--
+
+Modify the existing declarations and assignments so their names use <dfn>camelCase</dfn>.
+
+Do not create any new variables.
+
+# --hints--
+
+`studlyCapVar` should be defined and have a value of `10`.
+
+```js
+assert(typeof studlyCapVar !== 'undefined' && studlyCapVar === 10);
+```
+
+`properCamelCase` should be defined and have a value of the string `A String`.
+
+```js
+assert(
+  typeof properCamelCase !== 'undefined' && properCamelCase === 'A String'
+);
+```
+
+`titleCaseOver` should be defined and have a value of `9000`.
+
+```js
+assert(typeof titleCaseOver !== 'undefined' && titleCaseOver === 9000);
+```
+
+`studlyCapVar` should use camelCase in both declaration and assignment sections.
+
+```js
+assert(code.match(/studlyCapVar/g).length === 2);
+```
+
+`properCamelCase` should use camelCase in both declaration and assignment sections.
+
+```js
+assert(code.match(/properCamelCase/g).length === 2);
+```
+
+`titleCaseOver` should use camelCase in both declaration and assignment sections.
+
+```js
+assert(code.match(/titleCaseOver/g).length === 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Variable declarations
+var StUdLyCapVaR;
+var properCamelCase;
+var TitleCaseOver;
+
+// Variable assignments
+STUDLYCAPVAR = 10;
+PRoperCAmelCAse = "A String";
+tITLEcASEoVER = 9000;
+```
+
+# --solutions--
+
+```js
+var studlyCapVar;
+var properCamelCase;
+var titleCaseOver;
+
+studlyCapVar = 10;
+properCamelCase = "A String";
+titleCaseOver = 9000;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-undefined-value-returned-from-a-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-undefined-value-returned-from-a-function.md
new file mode 100644
index 0000000000..bf8bd5a27a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-undefined-value-returned-from-a-function.md
@@ -0,0 +1,94 @@
+---
+id: 598e8944f009e646fc236146
+title: Understanding Undefined Value returned from a Function
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ce2p7cL'
+forumTopicId: 301177
+dashedName: understanding-undefined-value-returned-from-a-function
+---
+
+# --description--
+
+A function can include the `return` statement but it does not have to. In the case that the function doesn't have a `return` statement, when you call it, the function processes the inner code but the returned value is `undefined`.
+
+**Example**
+
+```js
+var sum = 0;
+function addSum(num) {
+  sum = sum + num;
+}
+addSum(3);
+```
+
+`addSum` is a function without a `return` statement. The function will change the global `sum` variable but the returned value of the function is `undefined`.
+
+# --instructions--
+
+Create a function `addFive` without any arguments. This function adds 5 to the `sum` variable, but its returned value is `undefined`.
+
+# --hints--
+
+`addFive` should be a function.
+
+```js
+assert(typeof addFive === 'function');
+```
+
+Once both functions have run, the `sum` should be equal to `8`.
+
+```js
+assert(sum === 8);
+```
+
+Returned value from `addFive` should be `undefined`.
+
+```js
+assert(addFive() === undefined);
+```
+
+Inside the `addFive` function, you should add `5` to the `sum` variable.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(addFive.toString()).match(/sum=sum\+5|sum\+=5/)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Setup
+var sum = 0;
+
+function addThree() {
+  sum = sum + 3;
+}
+
+// Only change code below this line
+
+
+// Only change code above this line
+
+addThree();
+addFive();
+```
+
+# --solutions--
+
+```js
+var sum = 0;
+
+function addThree() {
+  sum = sum + 3;
+}
+
+function addFive() {
+  sum = sum + 5;
+}
+
+addThree();
+addFive();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
new file mode 100644
index 0000000000..b51f61753d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-uninitialized-variables.md
@@ -0,0 +1,79 @@
+---
+id: 56533eb9ac21ba0edf2244aa
+title: Understanding Uninitialized Variables
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cBa2JAL'
+forumTopicId: 18335
+dashedName: understanding-uninitialized-variables
+---
+
+# --description--
+
+When JavaScript variables are declared, they have an initial value of `undefined`. If you do a mathematical operation on an `undefined` variable your result will be `NaN` which means <dfn>"Not a Number"</dfn>. If you concatenate a string with an `undefined` variable, you will get a literal <dfn>string</dfn> of `undefined`.
+
+# --instructions--
+
+Initialize the three variables `a`, `b`, and `c` with `5`, `10`, and `"I am a"` respectively so that they will not be `undefined`.
+
+# --hints--
+
+`a` should be defined and evaluated to have the value of `6`.
+
+```js
+assert(typeof a === 'number' && a === 6);
+```
+
+`b` should be defined and evaluated to have the value of `15`.
+
+```js
+assert(typeof b === 'number' && b === 15);
+```
+
+`c` should not contain `undefined` and should have a value of the string `I am a String!`
+
+```js
+assert(!/undefined/.test(c) && c === 'I am a String!');
+```
+
+You should not change code below the specified comment.
+
+```js
+assert(
+  /a = a \+ 1;/.test(code) &&
+    /b = b \+ 5;/.test(code) &&
+    /c = c \+ " String!";/.test(code)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(a,b,c){ return "a = " + a + ", b = " + b + ", c = '" + c + "'"; })(a,b,c);
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+var a;
+var b;
+var c;
+// Only change code above this line
+
+a = a + 1;
+b = b + 5;
+c = c + " String!";
+```
+
+# --solutions--
+
+```js
+var a = 5;
+var b = 10;
+var c = "I am a";
+a = a + 1;
+b = b + 5;
+c = c + " String!";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/updating-object-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/updating-object-properties.md
new file mode 100644
index 0000000000..3ea895350d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/updating-object-properties.md
@@ -0,0 +1,77 @@
+---
+id: 56bbb991ad1ed5201cd392d1
+title: Updating Object Properties
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c9yEJT4'
+forumTopicId: 18336
+dashedName: 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 `ourDog`:
+
+```js
+var ourDog = {
+  "name": "Camper",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["everything!"]
+};
+```
+
+Since he's a particularly happy dog, let's change his name to the string `Happy Camper`. Here's how we update his object's name property: `ourDog.name = "Happy Camper";` or `ourDog["name"] = "Happy Camper";` Now when we evaluate `ourDog.name`, instead of getting `Camper`, we'll get his new name, `Happy Camper`.
+
+# --instructions--
+
+Update the `myDog` object's name property. Let's change her name from `Coder` to `Happy Coder`. You can use either dot or bracket notation.
+
+# --hints--
+
+You should update `myDog`'s `name` property to equal the string `Happy Coder`.
+
+```js
+assert(/happy coder/gi.test(myDog.name));
+```
+
+You should not edit the `myDog` definition.
+
+```js
+assert(/"name": "Coder"/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(z){return z;})(myDog);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var myDog = {
+  "name": "Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"]
+};
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+var myDog = {
+  "name": "Coder",
+  "legs": 4,
+  "tails": 1,
+  "friends": ["freeCodeCamp Campers"]
+};
+myDog.name = "Happy Coder";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-first-character-in-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-first-character-in-a-string.md
new file mode 100644
index 0000000000..840f6fc61f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-first-character-in-a-string.md
@@ -0,0 +1,74 @@
+---
+id: bd7123c9c549eddfaeb5bdef
+title: Use Bracket Notation to Find the First Character in a String
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/ca8JwhW'
+forumTopicId: 18341
+dashedName: use-bracket-notation-to-find-the-first-character-in-a-string
+---
+
+# --description--
+
+<dfn>Bracket notation</dfn> is a way to get a character at a specific index 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 `var firstName = "Charles"`, you can get the value of the first letter of the string by using `firstName[0]`.
+
+Example:
+
+```js
+var firstName = "Charles";
+var firstLetter = firstName[0];
+```
+
+`firstLetter` would have a value of the string `C`.
+
+# --instructions--
+
+Use bracket notation to find the first character in the `lastName` variable and assign it to `firstLetterOfLastName`.
+
+**Hint:** Try looking at the example above if you get stuck.
+
+# --hints--
+
+The `firstLetterOfLastName` variable should have the value of `L`.
+
+```js
+assert(firstLetterOfLastName === 'L');
+```
+
+You should use bracket notation.
+
+```js
+assert(code.match(/firstLetterOfLastName\s*?=\s*?lastName\[.*?\]/));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(v){return v;})(firstLetterOfLastName);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var firstLetterOfLastName = "";
+var lastName = "Lovelace";
+
+// Only change code below this line
+firstLetterOfLastName = lastName; // Change this line
+```
+
+# --solutions--
+
+```js
+var firstLetterOfLastName = "";
+var lastName = "Lovelace";
+
+// Only change code below this line
+firstLetterOfLastName = lastName[0];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-last-character-in-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-last-character-in-a-string.md
new file mode 100644
index 0000000000..92b8f64187
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-last-character-in-a-string.md
@@ -0,0 +1,68 @@
+---
+id: bd7123c9c451eddfaeb5bdef
+title: Use Bracket Notation to Find the Last Character in a String
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cBZQGcv'
+forumTopicId: 18342
+dashedName: 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 `var firstName = "Ada"`, you can get the value of the last letter of the string by using `firstName[firstName.length - 1]`.
+
+Example:
+
+```js
+var firstName = "Ada";
+var lastLetter = firstName[firstName.length - 1];
+```
+
+`lastLetter` would have a value of the string `a`.
+
+# --instructions--
+
+Use <dfn>bracket notation</dfn> to find the last character in the `lastName` variable.
+
+**Hint:** Try looking at the example above if you get stuck.
+
+# --hints--
+
+`lastLetterOfLastName` should be the letter `e`.
+
+```js
+assert(lastLetterOfLastName === 'e');
+```
+
+You should use `.length` to get the last letter.
+
+```js
+assert(code.match(/\.length/g).length > 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(v){return v;})(lastLetterOfLastName);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var lastName = "Lovelace";
+
+// Only change code below this line
+var lastLetterOfLastName = lastName; // Change this line
+```
+
+# --solutions--
+
+```js
+var lastName = "Lovelace";
+var lastLetterOfLastName = lastName[lastName.length - 1];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-character-in-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-character-in-a-string.md
new file mode 100644
index 0000000000..a7823188ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-character-in-a-string.md
@@ -0,0 +1,68 @@
+---
+id: bd7123c9c450eddfaeb5bdef
+title: Use Bracket Notation to Find the Nth Character in a String
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cWPVJua'
+forumTopicId: 18343
+dashedName: 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 `0`, so the first character is actually the zeroth character.
+
+Example:
+
+```js
+var firstName = "Ada";
+var secondLetterOfFirstName = firstName[1];
+```
+
+`secondLetterOfFirstName` would have a value of the string `d`.
+
+# --instructions--
+
+Let's try to set `thirdLetterOfLastName` to equal the third letter of the `lastName` variable using bracket notation.
+
+**Hint:** Try looking at the example above if you get stuck.
+
+# --hints--
+
+The `thirdLetterOfLastName` variable should have the value of `v`.
+
+```js
+assert(thirdLetterOfLastName === 'v');
+```
+
+You should use bracket notation.
+
+```js
+assert(code.match(/thirdLetterOfLastName\s*?=\s*?lastName\[.*?\]/));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(v){return v;})(thirdLetterOfLastName);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var lastName = "Lovelace";
+
+// Only change code below this line
+var thirdLetterOfLastName = lastName; // Change this line
+```
+
+# --solutions--
+
+```js
+var lastName = "Lovelace";
+var thirdLetterOfLastName = lastName[2];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-to-last-character-in-a-string.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-to-last-character-in-a-string.md
new file mode 100644
index 0000000000..912b0b3b6b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-bracket-notation-to-find-the-nth-to-last-character-in-a-string.md
@@ -0,0 +1,68 @@
+---
+id: bd7123c9c452eddfaeb5bdef
+title: Use Bracket Notation to Find the Nth-to-Last Character in a String
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cw4vkh9'
+forumTopicId: 18344
+dashedName: 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 `var firstName = "Augusta"` string by using `firstName[firstName.length - 3]`
+
+Example:
+
+```js
+var firstName = "Augusta";
+var thirdToLastLetter = firstName[firstName.length - 3];
+```
+
+`thirdToLastLetter` would have a value of the string `s`.
+
+# --instructions--
+
+Use <dfn>bracket notation</dfn> to find the second-to-last character in the `lastName` string.
+
+**Hint:** Try looking at the example above if you get stuck.
+
+# --hints--
+
+`secondToLastLetterOfLastName` should be the letter `c`.
+
+```js
+assert(secondToLastLetterOfLastName === 'c');
+```
+
+You should use `.length` to get the second last letter.
+
+```js
+assert(code.match(/\.length/g).length > 0);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+(function(v){return v;})(secondToLastLetterOfLastName);
+```
+
+## --seed-contents--
+
+```js
+// Setup
+var lastName = "Lovelace";
+
+// Only change code below this line
+var secondToLastLetterOfLastName = lastName; // Change this line
+```
+
+# --solutions--
+
+```js
+var lastName = "Lovelace";
+var secondToLastLetterOfLastName = lastName[lastName.length - 2];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-conditional-logic-with-if-statements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-conditional-logic-with-if-statements.md
new file mode 100644
index 0000000000..53ecda52a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-conditional-logic-with-if-statements.md
@@ -0,0 +1,97 @@
+---
+id: cf1111c1c12feddfaeb3bdef
+title: Use Conditional Logic with If Statements
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cy87mf3'
+forumTopicId: 18348
+dashedName: use-conditional-logic-with-if-statements
+---
+
+# --description--
+
+`If` statements are used to make decisions in code. The keyword `if` tells JavaScript to execute the code in the curly braces under certain conditions, defined in the parentheses. These conditions are known as `Boolean` conditions and they may only be `true` or `false`.
+
+When the condition evaluates to `true`, the program executes the statement inside the curly braces. When the Boolean condition evaluates to `false`, the statement inside the curly braces will not execute.
+
+**Pseudocode**
+
+<blockquote>if (<i>condition is true</i>) {<br>  <i>statement is executed</i><br>}</blockquote>
+
+**Example**
+
+```js
+function test (myCondition) {
+  if (myCondition) {
+     return "It was true";
+  }
+  return "It was false";
+}
+test(true);
+test(false);
+```
+
+`test(true)` returns the string `It was true`, and `test(false)` returns the string `It was false`.
+
+When `test` is called with a value of `true`, the `if` statement evaluates `myCondition` to see if it is `true` or not. Since it is `true`, the function returns `It was true`. When we call `test` with a value of `false`, `myCondition` is *not* `true` and the statement in the curly braces is not executed and the function returns `It was false`.
+
+# --instructions--
+
+Create an `if` statement inside the function to return `Yes, that was true` if the parameter `wasThatTrue` is `true` and return `No, that was false` otherwise.
+
+# --hints--
+
+`trueOrFalse` should be a function
+
+```js
+assert(typeof trueOrFalse === 'function');
+```
+
+`trueOrFalse(true)` should return a string
+
+```js
+assert(typeof trueOrFalse(true) === 'string');
+```
+
+`trueOrFalse(false)` should return a string
+
+```js
+assert(typeof trueOrFalse(false) === 'string');
+```
+
+`trueOrFalse(true)` should return the string `Yes, that was true`
+
+```js
+assert(trueOrFalse(true) === 'Yes, that was true');
+```
+
+`trueOrFalse(false)` should return the string `No, that was false`
+
+```js
+assert(trueOrFalse(false) === 'No, that was false');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function trueOrFalse(wasThatTrue) {
+  // Only change code below this line
+
+
+
+  // Only change code above this line
+
+}
+```
+
+# --solutions--
+
+```js
+function trueOrFalse(wasThatTrue) {
+  if (wasThatTrue) {
+    return "Yes, that was true";
+  }
+  return "No, that was false";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-multiple-conditional-ternary-operators.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-multiple-conditional-ternary-operators.md
new file mode 100644
index 0000000000..4852147339
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-multiple-conditional-ternary-operators.md
@@ -0,0 +1,96 @@
+---
+id: 587d7b7e367417b2b2512b21
+title: Use Multiple Conditional (Ternary) Operators
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cyWJBT4'
+forumTopicId: 301179
+dashedName: use-multiple-conditional-ternary-operators
+---
+
+# --description--
+
+In the previous challenge, you used a single conditional operator. 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:
+
+```js
+function findGreaterOrEqual(a, b) {
+  if (a === b) {
+    return "a and b are equal";
+  }
+  else if (a > b) {
+    return "a is greater";
+  }
+  else {
+    return "b is greater";
+  }
+}
+```
+
+The above function can be re-written using multiple conditional operators:
+
+```js
+function findGreaterOrEqual(a, b) {
+  return (a === b) ? "a and b are equal" 
+    : (a > b) ? "a is greater" 
+    : "b is greater";
+}
+```
+
+It is considered best practice to format multiple conditional operators such that each condition is on a separate line, as shown above. Using multiple conditional operators without proper indentation may make your code hard to read. For example:
+
+```js
+function findGreaterOrEqual(a, b) {
+  return (a === b) ? "a and b are equal" : (a > b) ? "a is greater" : "b is greater";
+}
+```
+
+# --instructions--
+
+In the `checkSign` function, use multiple conditional operators - following the recommended format used in `findGreaterOrEqual` - to check if a number is positive, negative or zero. The function should return `positive`, `negative` or `zero`.
+
+# --hints--
+
+`checkSign` should use multiple conditional operators
+
+```js
+assert(/.+?\s*?\?\s*?.+?\s*?:\s*?.+?\s*?\?\s*?.+?\s*?:\s*?.+?/gi.test(code));
+```
+
+`checkSign(10)` should return the string `positive`. Note that capitalization matters
+
+```js
+assert(checkSign(10) === 'positive');
+```
+
+`checkSign(-12)` should return the string `negative`. Note that capitalization matters
+
+```js
+assert(checkSign(-12) === 'negative');
+```
+
+`checkSign(0)` should return the string `zero`. Note that capitalization matters
+
+```js
+assert(checkSign(0) === 'zero');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSign(num) {
+
+}
+
+checkSign(10);
+```
+
+# --solutions--
+
+```js
+function checkSign(num) {
+  return (num > 0) ? 'positive' : (num < 0) ? 'negative' : 'zero';
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
new file mode 100644
index 0000000000..c5e30c4680
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-countdown.md
@@ -0,0 +1,92 @@
+---
+id: 5cd9a70215d3c4e65518328f
+title: Use Recursion to Create a Countdown
+challengeType: 1
+forumTopicId: 305925
+dashedName: use-recursion-to-create-a-countdown
+---
+
+# --description--
+
+In a [previous challenge](/learn/javascript-algorithms-and-data-structures/basic-javascript/replace-loops-using-recursion), you learned how to use recursion to replace a `for` loop. Now, let's look at a more complex function that returns an array of consecutive integers starting with `1` through the number passed to the function.
+
+As mentioned in the previous challenge, there will be a <dfn>base case</dfn>. The base case tells the recursive function when it no longer needs to call itself. It is a simple case where the return value is already known. There will also be a <dfn>recursive call</dfn> which executes the original function with different arguments. If the function is written correctly, eventually the base case will be reached.
+
+For example, say you want to write a recursive function that returns an array containing the numbers `1` through `n`. This function will need to accept an argument, `n`, representing the final number. Then it will need to call itself with progressively smaller values of `n` until it reaches `1`. You could write the function as follows:
+
+```javascript
+function countup(n) {
+  if (n < 1) {
+    return [];
+  } else {
+    const countArray = countup(n - 1);
+    countArray.push(n);
+    return countArray;
+  }
+}
+console.log(countup(5));
+```
+
+The value `[1, 2, 3, 4, 5]` will be displayed in the console.
+
+At first, this seems counterintuitive since the value of `n` *decreases*, but the values in the final array are *increasing*. This happens because the push happens last, after the recursive call has returned. At the point where `n` is pushed into the array, `countup(n - 1)` has already been evaluated and returned `[1, 2, ..., n - 1]`.
+
+# --instructions--
+
+We have defined a function called `countdown` with one parameter (`n`). The function should use recursion to return an array containing the integers `n` through `1` based on the `n` parameter. If the function is called with a number less than 1, the function should return an empty array. For example, calling this function with `n = 5` should return the array `[5, 4, 3, 2, 1]`. Your function must use recursion by calling itself and must not use loops of any kind.
+
+# --hints--
+
+`countdown(-1)` should return an empty array.
+
+```js
+assert.isEmpty(countdown(-1));
+```
+
+`countdown(10)` should return `[10, 9, 8, 7, 6, 5, 4, 3, 2, 1]`
+
+```js
+assert.deepStrictEqual(countdown(10), [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]);
+```
+
+`countdown(5)` should return `[5, 4, 3, 2, 1]`
+
+```js
+assert.deepStrictEqual(countdown(5), [5, 4, 3, 2, 1]);
+```
+
+Your code should not rely on any kind of loops (`for`, `while` or higher order functions such as `forEach`, `map`, `filter`, and `reduce`).
+
+```js
+assert(
+  !code.match(/for|while|forEach|map|filter|reduce/g)
+);
+```
+
+You should use recursion to solve this problem.
+
+```js
+assert(
+  countdown.toString().match(/countdown\s*\(.+\)/)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+function countdown(n){
+  return;
+}
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+function countdown(n){
+   return n < 1 ? [] : [n].concat(countdown(n - 1));
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
new file mode 100644
index 0000000000..3859da1fba
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-recursion-to-create-a-range-of-numbers.md
@@ -0,0 +1,81 @@
+---
+id: 5cc0bd7a49b71cb96132e54c
+title: Use Recursion to Create a Range of Numbers
+challengeType: 1
+forumTopicId: 301180
+dashedName: use-recursion-to-create-a-range-of-numbers
+---
+
+# --description--
+
+Continuing from the previous challenge, we provide you another opportunity to create a recursive function to solve a problem.
+
+# --instructions--
+
+We have defined a function named `rangeOfNumbers` with two parameters. The function should return an array of integers which begins with a number represented by the `startNum` parameter and ends with a number represented by the `endNum` parameter. The starting number will always be less than or equal to the ending number. Your function must use recursion by calling itself and not use loops of any kind. It should also work for cases where both `startNum` and `endNum` are the same.
+
+# --hints--
+
+Your function should return an array.
+
+```js
+assert(Array.isArray(rangeOfNumbers(5, 10)));
+```
+
+Your code should not use any loop syntax (`for` or `while` or higher order functions such as `forEach`, `map`, `filter`, or `reduce`).
+
+```js
+assert(
+  !code.match(/for|while|forEach|map|filter|reduce/g)
+);
+```
+
+`rangeOfNumbers` should use recursion (call itself) to solve this challenge.
+
+```js
+assert(
+  rangeOfNumbers.toString().match(/rangeOfNumbers\s*\(.+\)/)
+);
+```
+
+`rangeOfNumbers(1, 5)` should return `[1, 2, 3, 4, 5]`.
+
+```js
+assert.deepStrictEqual(rangeOfNumbers(1, 5), [1, 2, 3, 4, 5]);
+```
+
+`rangeOfNumbers(6, 9)` should return `[6, 7, 8, 9]`.
+
+```js
+assert.deepStrictEqual(rangeOfNumbers(6, 9), [6, 7, 8, 9]);
+```
+
+`rangeOfNumbers(4, 4)` should return `[4]`.
+
+```js
+assert.deepStrictEqual(rangeOfNumbers(4, 4), [4]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function rangeOfNumbers(startNum, endNum) {
+  return [];
+};
+```
+
+# --solutions--
+
+```js
+function rangeOfNumbers(startNum, endNum) {
+  if (endNum - startNum === 0) {
+    return [startNum];
+  } else {
+    var numbers = rangeOfNumbers(startNum, endNum - 1);
+    numbers.push(endNum);
+    return numbers;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-conditional-ternary-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-conditional-ternary-operator.md
new file mode 100644
index 0000000000..cd7ab8e504
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-conditional-ternary-operator.md
@@ -0,0 +1,84 @@
+---
+id: 587d7b7e367417b2b2512b24
+title: Use the Conditional (Ternary) Operator
+challengeType: 1
+forumTopicId: 301181
+dashedName: 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 `a ? b : c`, where `a` is the condition, `b` is the code to run when the condition returns `true`, and `c` is the code to run when the condition returns `false`.
+
+The following function uses an `if/else` statement to check a condition:
+
+```js
+function findGreater(a, b) {
+  if(a > b) {
+    return "a is greater";
+  }
+  else {
+    return "b is greater";
+  }
+}
+```
+
+This can be re-written using the conditional operator:
+
+```js
+function findGreater(a, b) {
+  return a > b ? "a is greater" : "b is greater";
+}
+```
+
+# --instructions--
+
+Use the conditional operator in the `checkEqual` function to check if two numbers are equal or not. The function should return either the string `Equal` or the string `Not Equal`.
+
+# --hints--
+
+`checkEqual` should use the conditional operator
+
+```js
+assert(/.+?\s*?\?\s*?.+?\s*?:\s*?.+?/.test(code));
+```
+
+`checkEqual(1, 2)` should return the string `Not Equal`
+
+```js
+assert(checkEqual(1, 2) === 'Not Equal');
+```
+
+`checkEqual(1, 1)` should return the string `Equal`
+
+```js
+assert(checkEqual(1, 1) === 'Equal');
+```
+
+`checkEqual(1, -1)` should return the string `Not Equal`
+
+```js
+assert(checkEqual(1, -1) === 'Not Equal');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkEqual(a, b) {
+
+}
+
+checkEqual(1, 2);
+```
+
+# --solutions--
+
+```js
+function checkEqual(a, b) {
+  return a === b ? "Equal" : "Not Equal";
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix.md
new file mode 100644
index 0000000000..6bcf64b6c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix.md
@@ -0,0 +1,82 @@
+---
+id: 587d7b7e367417b2b2512b22
+title: Use the parseInt Function with a Radix
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/c6K4Kh3'
+forumTopicId: 301182
+dashedName: use-the-parseint-function-with-a-radix
+---
+
+# --description--
+
+The `parseInt()` 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:
+
+```js
+parseInt(string, radix);
+```
+
+And here's an example:
+
+```js
+var a = parseInt("11", 2);
+```
+
+The radix variable says that `11` is in the binary system, or base 2. This example converts the string `11` to an integer `3`.
+
+# --instructions--
+
+Use `parseInt()` in the `convertToInteger` function so it converts a binary number to an integer and returns it.
+
+# --hints--
+
+`convertToInteger` should use the `parseInt()` function
+
+```js
+assert(/parseInt/g.test(code));
+```
+
+`convertToInteger("10011")` should return a number
+
+```js
+assert(typeof convertToInteger('10011') === 'number');
+```
+
+`convertToInteger("10011")` should return 19
+
+```js
+assert(convertToInteger('10011') === 19);
+```
+
+`convertToInteger("111001")` should return 57
+
+```js
+assert(convertToInteger('111001') === 57);
+```
+
+`convertToInteger("JamesBond")` should return `NaN`
+
+```js
+assert.isNaN(convertToInteger('JamesBond'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertToInteger(str) {
+
+}
+
+convertToInteger("10011");
+```
+
+# --solutions--
+
+```js
+function convertToInteger(str) {
+  return parseInt(str, 2);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function.md
new file mode 100644
index 0000000000..901019fa34
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function.md
@@ -0,0 +1,74 @@
+---
+id: 587d7b7e367417b2b2512b23
+title: Use the parseInt Function
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cm83LSW'
+forumTopicId: 301183
+dashedName: use-the-parseint-function
+---
+
+# --description--
+
+The `parseInt()` function parses a string and returns an integer. Here's an example:
+
+```js
+var a = parseInt("007");
+```
+
+The above function converts the string `007` to the integer `7`. If the first character in the string can't be converted into a number, then it returns `NaN`.
+
+# --instructions--
+
+Use `parseInt()` in the `convertToInteger` function so it converts the input string `str` into an integer, and returns it.
+
+# --hints--
+
+`convertToInteger` should use the `parseInt()` function
+
+```js
+assert(/parseInt/g.test(code));
+```
+
+`convertToInteger("56")` should return a number
+
+```js
+assert(typeof convertToInteger('56') === 'number');
+```
+
+`convertToInteger("56")` should return 56
+
+```js
+assert(convertToInteger('56') === 56);
+```
+
+`convertToInteger("77")` should return 77
+
+```js
+assert(convertToInteger('77') === 77);
+```
+
+`convertToInteger("JamesBond")` should return `NaN`
+
+```js
+assert.isNaN(convertToInteger('JamesBond'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertToInteger(str) {
+
+}
+
+convertToInteger("56");
+```
+
+# --solutions--
+
+```js
+function convertToInteger(str) {
+  return parseInt(str);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
new file mode 100644
index 0000000000..5d9f1071db
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups.md
@@ -0,0 +1,154 @@
+---
+id: 56533eb9ac21ba0edf2244ca
+title: Using Objects for Lookups
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cdBk8sM'
+forumTopicId: 18373
+dashedName: 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 `switch` statement or an `if/else` 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:
+
+```js
+var alpha = {
+  1:"Z",
+  2:"Y",
+  3:"X",
+  4:"W",
+  ...
+  24:"C",
+  25:"B",
+  26:"A"
+};
+alpha[2];
+alpha[24];
+
+var value = 2;
+alpha[value];
+```
+
+`alpha[2]` is the string `Y`, `alpha[24]` is the string `C`, and `alpha[value]` is the string `Y`.
+
+# --instructions--
+
+Convert the switch statement into an object called `lookup`. Use it to look up `val` and assign the associated string to the `result` variable.
+
+# --hints--
+
+`phoneticLookup("alpha")` should equal the string `Adams`
+
+```js
+assert(phoneticLookup('alpha') === 'Adams');
+```
+
+`phoneticLookup("bravo")` should equal the string `Boston`
+
+```js
+assert(phoneticLookup('bravo') === 'Boston');
+```
+
+`phoneticLookup("charlie")` should equal the string `Chicago`
+
+```js
+assert(phoneticLookup('charlie') === 'Chicago');
+```
+
+`phoneticLookup("delta")` should equal the string `Denver`
+
+```js
+assert(phoneticLookup('delta') === 'Denver');
+```
+
+`phoneticLookup("echo")` should equal the string `Easy`
+
+```js
+assert(phoneticLookup('echo') === 'Easy');
+```
+
+`phoneticLookup("foxtrot")` should equal the string `Frank`
+
+```js
+assert(phoneticLookup('foxtrot') === 'Frank');
+```
+
+`phoneticLookup("")` should equal `undefined`
+
+```js
+assert(typeof phoneticLookup('') === 'undefined');
+```
+
+You should not modify the `return` statement
+
+```js
+assert(code.match(/return\sresult;/));
+```
+
+You should not use `case`, `switch`, or `if` statements
+
+```js
+assert(
+  !/case|switch|if/g.test(code.replace(/([/]{2}.*)|([/][*][^/*]*[*][/])/g, ''))
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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;
+}
+
+phoneticLookup("charlie");
+```
+
+# --solutions--
+
+```js
+function phoneticLookup(val) {
+  var result = "";
+
+  var lookup = {
+    alpha: "Adams",
+    bravo: "Boston",
+    charlie: "Chicago",
+    delta: "Denver",
+    echo: "Easy",
+    foxtrot: "Frank"
+  };
+
+  result = lookup[val];
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
new file mode 100644
index 0000000000..18f4e82445
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/word-blanks.md
@@ -0,0 +1,107 @@
+---
+id: 56533eb9ac21ba0edf2244bb
+title: Word Blanks
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/caqn8zuP'
+forumTopicId: 18377
+dashedName: word-blanks
+---
+
+# --description--
+
+We will now use our knowledge of strings to build a "[Mad Libs](https://en.wikipedia.org/wiki/Mad_Libs)" style word game we're calling "Word Blanks". You will create an (optionally humorous) "Fill in the Blanks" style sentence.
+
+In a "Mad Libs" game, you are provided sentences with some missing words, like nouns, verbs, adjectives and adverbs. You then fill in the missing pieces with words of your choice in a way that the completed sentence makes sense.
+
+Consider this sentence - It was really **\_\_\_\_**, and we **\_\_\_\_** ourselves **\_\_\_\_**. This sentence has three missing pieces- an adjective, a verb and an adverb, and we can add words of our choice to complete it. We can then assign the completed sentence to a variable as follows:
+
+```js
+var sentence = "It was really " + "hot" + ", and we " + "laughed" + " ourselves " + "silly" + ".";
+```
+
+# --instructions--
+
+In this challenge, we provide you with a noun, a verb, an adjective and an adverb. You need to form a complete sentence using words of your choice, along with the words we provide.
+
+You will need to use the string concatenation operator `+` to build a new string, using the provided variables: `myNoun`, `myAdjective`, `myVerb`, and `myAdverb`. You will then assign the formed string to the `wordBlanks` variable. You should not change the words assigned to the variables.
+
+You will also need to account for spaces in your string, so that the final sentence has spaces between all the words. The result should be a complete sentence.
+
+# --hints--
+
+`wordBlanks` should be a string.
+
+```js
+assert(typeof wordBlanks === 'string');
+```
+
+You should not change the values assigned to `myNoun`, `myVerb`, `myAdjective` or `myAdverb`.
+
+```js
+assert(
+  myNoun === 'dog' &&
+    myVerb === 'ran' &&
+    myAdjective === 'big' &&
+    myAdverb === 'quickly'
+);
+```
+
+You should not directly use the values `dog`, `ran`, `big`, or `quickly` to create `wordBlanks`.
+
+```js
+const newCode = removeAssignments(code);
+assert(
+  !/dog/.test(newCode) &&
+    !/ran/.test(newCode) &&
+    !/big/.test(newCode) &&
+    !/quickly/.test(newCode)
+);
+```
+
+`wordBlanks` should contain all of the words assigned to the variables `myNoun`, `myVerb`, `myAdjective` and `myAdverb` separated by non-word characters (and any additional words in your madlib).
+
+```js
+assert(
+  /\bdog\b/.test(wordBlanks) &&
+    /\bbig\b/.test(wordBlanks) &&
+    /\bran\b/.test(wordBlanks) &&
+    /\bquickly\b/.test(wordBlanks)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const removeAssignments = str => str
+  .replace(/myNoun\s*=\s*["']dog["']/g, '')
+  .replace(/myAdjective\s*=\s*["']big["']/g, '')
+  .replace(/myVerb\s*=\s*["']ran["']/g, '')
+  .replace(/myAdverb\s*=\s*["']quickly["']/g, '');
+```
+
+## --seed-contents--
+
+```js
+var myNoun = "dog";
+var myAdjective = "big";
+var myVerb = "ran";
+var myAdverb = "quickly";
+
+// Only change code below this line
+var wordBlanks = ""; // Change this line
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+var myNoun = "dog";
+var myAdjective = "big";
+var myVerb = "ran";
+var myAdverb = "quickly";
+
+var wordBlanks = "Once there was a " + myNoun + " which was very " + myAdjective + ". ";
+wordBlanks += "It " + myVerb + " " + myAdverb + " around the yard.";
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/write-reusable-javascript-with-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/write-reusable-javascript-with-functions.md
new file mode 100644
index 0000000000..2a62b70ea4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/basic-javascript/write-reusable-javascript-with-functions.md
@@ -0,0 +1,101 @@
+---
+id: 56bbb991ad1ed5201cd392cf
+title: Write Reusable JavaScript with Functions
+challengeType: 1
+videoUrl: 'https://scrimba.com/c/cL6dqfy'
+forumTopicId: 18378
+dashedName: 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:
+
+```js
+function functionName() {
+  console.log("Hello World");
+}
+```
+
+You can call or <dfn>invoke</dfn> this function by using its name followed by parentheses, like this: `functionName();` Each time the function is called it will print out the message `Hello World` on the dev console. All of the code between the curly braces will be executed every time the function is called.
+
+# --instructions--
+
+<ol>
+  <li>
+    Create a function called <code>reusableFunction</code> which prints the string <code>Hi World</code> to the dev console.
+  </li>
+  <li>
+    Call the function.
+  </li>
+</ol>
+
+# --hints--
+
+`reusableFunction` should be a function.
+
+```js
+assert(typeof reusableFunction === 'function');
+```
+
+If `reusableFunction` is called, it should output the string `Hi World` to the console.
+
+```js
+assert(testConsole());
+```
+
+You should call `reusableFunction` once it is defined.
+
+```js
+const functionStr = reusableFunction && __helpers.removeWhiteSpace(reusableFunction.toString());
+const codeWithoutFunction = __helpers.removeWhiteSpace(code).replace(/reusableFunction\(\)\{/g, '');
+assert(/reusableFunction\(\)/.test(codeWithoutFunction));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+
+function testConsole() {
+  var logOutput = "";
+  var originalConsole = console;
+  var nativeLog = console.log;
+  var hiWorldWasLogged = false;
+  console.log = function (message) {
+    if(message === 'Hi World')  {
+      console.warn(message)
+      hiWorldWasLogged = true;
+    }
+    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);
+    }
+  };
+  reusableFunction();
+  console.log = nativeLog;
+  return hiWorldWasLogged;
+}
+
+```
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+function reusableFunction() {
+  console.log("Hi World");
+}
+reusableFunction();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-arguments-passed-in-the-wrong-order-when-calling-a-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-arguments-passed-in-the-wrong-order-when-calling-a-function.md
new file mode 100644
index 0000000000..7aea16b1e6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-arguments-passed-in-the-wrong-order-when-calling-a-function.md
@@ -0,0 +1,57 @@
+---
+id: 587d7b85367417b2b2512b3a
+title: Catch Arguments Passed in the Wrong Order When Calling a Function
+challengeType: 1
+forumTopicId: 301184
+dashedName: 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.
+
+# --instructions--
+
+The function `raiseToPower` raises a base to an exponent. Unfortunately, it's not called properly - fix the code so the value of `power` is the expected 8.
+
+# --hints--
+
+Your code should fix the variable `power` so it equals 2 raised to the 3rd power, not 3 raised to the 2nd power.
+
+```js
+assert(power == 8);
+```
+
+Your code should use the correct order of the arguments for the `raiseToPower` function call.
+
+```js
+assert(code.match(/raiseToPower\(\s*?base\s*?,\s*?exp\s*?\);/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function raiseToPower(b, e) {
+  return Math.pow(b, e);
+}
+
+let base = 2;
+let exp = 3;
+let power = raiseToPower(exp, base);
+console.log(power);
+```
+
+# --solutions--
+
+```js
+function raiseToPower(b, e) {
+ return Math.pow(b, e);
+}
+
+let base = 2;
+let exp = 3;
+let power = raiseToPower(base, exp);
+console.log(power);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-missing-open-and-closing-parenthesis-after-a-function-call.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-missing-open-and-closing-parenthesis-after-a-function-call.md
new file mode 100644
index 0000000000..83f757ada1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-missing-open-and-closing-parenthesis-after-a-function-call.md
@@ -0,0 +1,69 @@
+---
+id: 587d7b85367417b2b2512b39
+title: Catch Missing Open and Closing Parenthesis After a Function Call
+challengeType: 1
+forumTopicId: 301185
+dashedName: 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:
+
+```js
+function myFunction() {
+  return "You rock!";
+}
+let varOne = myFunction;
+let varTwo = myFunction();
+```
+
+Here `varOne` is the function `myFunction`, and `varTwo` is the string `You rock!`.
+
+# --instructions--
+
+Fix the code so the variable `result` is set to the value returned from calling the function `getNine`.
+
+# --hints--
+
+Your code should fix the variable `result` so it is set to the number that the function `getNine` returns.
+
+```js
+assert(result == 9);
+```
+
+Your code should call the `getNine` function.
+
+```js
+assert(code.match(/getNine\(\)/g).length == 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function getNine() {
+  let x = 6;
+  let y = 3;
+  return x + y;
+}
+
+let result = getNine;
+console.log(result);
+```
+
+# --solutions--
+
+```js
+function getNine() {
+ let x = 6;
+ let y = 3;
+ return x + y;
+}
+
+let result = getNine();
+console.log(result);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md
new file mode 100644
index 0000000000..cdadad8534
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-misspelled-variable-and-function-names.md
@@ -0,0 +1,69 @@
+---
+id: 587d7b84367417b2b2512b35
+title: Catch Misspelled Variable and Function Names
+challengeType: 1
+forumTopicId: 301186
+dashedName: catch-misspelled-variable-and-function-names
+---
+
+# --description--
+
+The `console.log()` and `typeof` 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.
+
+# --instructions--
+
+Fix the two spelling errors in the code so the `netWorkingCapital` calculation works.
+
+# --hints--
+
+Check the spelling of the two variables used in the netWorkingCapital calculation, the console output should show that "Net working capital is: 2".
+
+```js
+assert(netWorkingCapital === 2);
+```
+
+There should be no instances of mis-spelled variables in the code.
+
+```js
+assert(!code.match(/recievables/g));
+```
+
+The `receivables` variable should be declared and used properly in the code.
+
+```js
+assert(code.match(/receivables/g).length == 2);
+```
+
+There should be no instances of mis-spelled variables in the code.
+
+```js
+assert(!code.match(/payable;/g));
+```
+
+The `payables` variable should be declared and used properly in the code.
+
+```js
+assert(code.match(/payables/g).length == 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let receivables = 10;
+let payables = 8;
+let netWorkingCapital = recievables - payable;
+console.log(`Net working capital is: ${netWorkingCapital}`);
+```
+
+# --solutions--
+
+```js
+let receivables = 10;
+let payables = 8;
+let netWorkingCapital = receivables - payables;
+console.log(`Net working capital is: ${netWorkingCapital}`);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-mixed-usage-of-single-and-double-quotes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-mixed-usage-of-single-and-double-quotes.md
new file mode 100644
index 0000000000..90d6fcd958
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-mixed-usage-of-single-and-double-quotes.md
@@ -0,0 +1,63 @@
+---
+id: 587d7b84367417b2b2512b37
+title: Catch Mixed Usage of Single and Double Quotes
+challengeType: 1
+forumTopicId: 301188
+dashedName: 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:
+
+```js
+const grouchoContraction = "I've had a perfectly wonderful evening, but this wasn't it.";
+const quoteInString = "Groucho Marx once said 'Quote me as saying I was mis-quoted.'";
+const uhOhGroucho = 'I've had a perfectly wonderful evening, but this wasn't it.';
+```
+
+The first two are correct, but the third is incorrect.
+
+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:
+
+```js
+const allSameQuotes = 'I\'ve had a perfectly wonderful evening, but this wasn\'t it.';
+```
+
+# --instructions--
+
+Fix the string so it either uses different quotes for the `href` value, or escape the existing ones. Keep the double quote marks around the entire string.
+
+# --hints--
+
+Your code should fix the quotes around the `href` value `#Home` by either changing or escaping them.
+
+```js
+assert(code.match(/<a href=\s*?('|\\")#Home\1\s*?>/g));
+```
+
+Your code should keep the double quotes around the entire string.
+
+```js
+assert(code.match(/"<p>.*?<\/p>";/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let innerHtml = "<p>Click here to <a href="#Home">return home</a></p>";
+console.log(innerHtml);
+```
+
+# --solutions--
+
+```js
+let innerHtml = "<p>Click here to <a href=\"#Home\">return home</a></p>";
+console.log(innerHtml);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-off-by-one-errors-when-using-indexing.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-off-by-one-errors-when-using-indexing.md
new file mode 100644
index 0000000000..1b22696596
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-off-by-one-errors-when-using-indexing.md
@@ -0,0 +1,93 @@
+---
+id: 587d7b86367417b2b2512b3b
+title: Catch Off By One Errors When Using Indexing
+challengeType: 1
+forumTopicId: 301189
+dashedName: catch-off-by-one-errors-when-using-indexing
+---
+
+# --description--
+
+<dfn>Off by one errors</dfn> (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 `undefined`.
+
+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:
+
+```js
+let alphabet = "abcdefghijklmnopqrstuvwxyz";
+let len = alphabet.length;
+for (let i = 0; i <= len; i++) {
+  console.log(alphabet[i]);
+}
+for (let j = 1; j < len; j++) {
+  console.log(alphabet[j]);
+}
+for (let k = 0; k < len; k++) {
+  console.log(alphabet[k]);
+}
+```
+
+The first example here loops one too many times, and the second loops one too few times (missing the first index, 0). The third example is correct.
+
+# --instructions--
+
+Fix the two indexing errors in the following function so all the numbers 1 through 5 are printed to the console.
+
+# --hints--
+
+Your code should set the initial condition of the loop so it starts at the first index.
+
+```js
+assert(code.match(/i\s*?=\s*?0\s*?;/g).length == 1);
+```
+
+Your code should fix the initial condition of the loop so that the index starts at 0.
+
+```js
+assert(!code.match(/i\s?=\s*?1\s*?;/g));
+```
+
+Your code should set the terminal condition of the loop so it stops at the last index.
+
+```js
+assert(code.match(/i\s*?<\s*?len\s*?;/g).length == 1);
+```
+
+Your code should fix the terminal condition of the loop so that it stops at 1 before the length.
+
+```js
+assert(!code.match(/i\s*?<=\s*?len;/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countToFive() {
+  let firstFive = "12345";
+  let len = firstFive.length;
+  // Only change code below this line
+  for (let i = 1; i <= len; i++) {
+  // Only change code above this line
+    console.log(firstFive[i]);
+  }
+}
+
+countToFive();
+```
+
+# --solutions--
+
+```js
+function countToFive() {
+ let firstFive = "12345";
+ let len = firstFive.length;
+ // Only change code below this line
+ for (let i = 0; i < len; i++) {
+ // Only change code above this line
+   console.log(firstFive[i]);
+ }
+}
+
+countToFive();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-unclosed-parentheses-brackets-braces-and-quotes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-unclosed-parentheses-brackets-braces-and-quotes.md
new file mode 100644
index 0000000000..42ad053023
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-unclosed-parentheses-brackets-braces-and-quotes.md
@@ -0,0 +1,49 @@
+---
+id: 587d7b84367417b2b2512b36
+title: 'Catch Unclosed Parentheses, Brackets, Braces and Quotes'
+challengeType: 1
+forumTopicId: 301190
+dashedName: 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.
+
+# --instructions--
+
+Fix the two pair errors in the code.
+
+# --hints--
+
+Your code should fix the missing piece of the array.
+
+```js
+assert(code.match(/myArray\s*?=\s*?\[\s*?1\s*?,\s*?2\s*?,\s*?3\s*?\];/g));
+```
+
+Your code should fix the missing piece of the `.reduce()` method. The console output should show that `Sum of array values is: 6`.
+
+```js
+assert(arraySum === 6);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myArray = [1, 2, 3;
+let arraySum = myArray.reduce((previous, current =>  previous + current);
+console.log(`Sum of array values is: ${arraySum}`);
+```
+
+# --solutions--
+
+```js
+let myArray = [1, 2, 3];
+let arraySum = myArray.reduce((previous, current) =>  previous + current);
+console.log(`Sum of array values is: ${arraySum}`);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-use-of-assignment-operator-instead-of-equality-operator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-use-of-assignment-operator-instead-of-equality-operator.md
new file mode 100644
index 0000000000..7fea55d185
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/catch-use-of-assignment-operator-instead-of-equality-operator.md
@@ -0,0 +1,81 @@
+---
+id: 587d7b85367417b2b2512b38
+title: Catch Use of Assignment Operator Instead of Equality Operator
+challengeType: 1
+forumTopicId: 301191
+dashedName: 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 `if`, `else if`, and `else` 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 `=`, or assignment operator. This leads to unexpected control flow in your program.
+
+As covered in previous challenges, the assignment operator (`=`) in JavaScript assigns a value to a variable name. And the `==` and `===` operators check for equality (the triple `===` tests for strict equality, meaning both value and type are the same).
+
+The code below assigns `x` to be 2, which evaluates as `true`. Almost every value on its own in JavaScript evaluates to `true`, except what are known as the "falsy" values: `false`, `0`, `""` (an empty string), `NaN`, `undefined`, and `null`.
+
+```js
+let x = 1;
+let y = 2;
+if (x = y) {
+
+} else {
+
+}
+```
+
+In this example, the code block within the `if` statement will run for any value of `y`, unless `y` is falsy. The `else` block, which we expect to run here, will not actually run.
+
+# --instructions--
+
+Fix the condition so the program runs the right branch, and the appropriate value is assigned to `result`.
+
+# --hints--
+
+Your code should fix the condition so it checks for equality, instead of using assignment.
+
+```js
+assert(result == 'Not equal!');
+```
+
+The condition should use either `==` or `===` to test for equality.
+
+```js
+assert(code.match(/x\s*?===?\s*?y/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let x = 7;
+let y = 9;
+let result = "to come";
+
+if(x = y) {
+  result = "Equal!";
+} else {
+  result = "Not equal!";
+}
+
+console.log(result);
+```
+
+# --solutions--
+
+```js
+let x = 7;
+let y = 9;
+let result = "to come";
+
+if(x === y) {
+ result = "Equal!";
+} else {
+ result = "Not equal!";
+}
+
+console.log(result);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/prevent-infinite-loops-with-a-valid-terminal-condition.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/prevent-infinite-loops-with-a-valid-terminal-condition.md
new file mode 100644
index 0000000000..9455e13645
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/prevent-infinite-loops-with-a-valid-terminal-condition.md
@@ -0,0 +1,63 @@
+---
+id: 587d7b86367417b2b2512b3d
+title: Prevent Infinite Loops with a Valid Terminal Condition
+challengeType: 1
+forumTopicId: 301192
+dashedName: 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 `while` loop inside `loopy()`. Do NOT call this function!
+
+```js
+function loopy() {
+  while(true) {
+    console.log("Hello, world!");
+  }
+}
+```
+
+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.
+
+# --instructions--
+
+The `myFunc()` function contains an infinite loop because the terminal condition `i != 4` will never evaluate to `false` (and break the looping) - `i` will increment by 2 each pass, and jump right over 4 since `i` is odd to start. Fix the comparison operator in the terminal condition so the loop only runs for `i` less than or equal to 4.
+
+# --hints--
+
+Your code should change the comparison operator in the terminal condition (the middle part) of the `for` loop.
+
+```js
+assert(code.match(/i\s*?<=\s*?4;/g).length == 1);
+```
+
+Your code should fix the comparison operator in the terminal condition of the loop.
+
+```js
+assert(!code.match(/i\s*?!=\s*?4;/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function myFunc() {
+  for (let i = 1; i != 4; i += 2) {
+    console.log("Still going!");
+  }
+}
+```
+
+# --solutions--
+
+```js
+function myFunc() {
+ for (let i = 1; i <= 4; i += 2) {
+   console.log("Still going!");
+ }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/understanding-the-differences-between-the-freecodecamp-and-browser-console.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/understanding-the-differences-between-the-freecodecamp-and-browser-console.md
new file mode 100644
index 0000000000..b3ec6b24bc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/understanding-the-differences-between-the-freecodecamp-and-browser-console.md
@@ -0,0 +1,73 @@
+---
+id: 587d7b83367417b2b2512b37
+title: Understanding the Differences between the freeCodeCamp and Browser Console
+challengeType: 1
+forumTopicId: 301193
+dashedName: understanding-the-differences-between-the-freecodecamp-and-browser-console
+---
+
+# --description--
+
+You may have noticed that some freeCodeCamp JavaScript challenges include their own console. This console behaves a little differently than the browser console you used in the last challenge.
+
+The following challenge is meant to highlight the main difference between the freeCodeCamp console and your browser console.
+
+When you run ordinary JavaScript, the browser's console will display your `console.log()` statements the exact number of times it is called.
+
+The freeCodeCamp console will print your `console.log()` statements a short time after the editor detects a change in the script, as well as during testing.
+
+The freeCodeCamp console is cleared before the tests are run and, to avoid spam, only prints the logs during the first test (see the note below for exceptions).
+
+If you would like to see every log for every test, run the tests, and open the browser console. If you prefer to use the browser console, and want it to mimic the freeCodeCamp console, place `console.clear()` before any other `console` calls, to clear the browser console.
+
+**Note:** `console.log`s inside functions are printed to the freeCodeCamp console whenever those functions are called. This can help debugging functions that are called during testing.
+
+# --instructions--
+
+First, use `console.log` to log the `output` variable. Then, use `console.clear` to clear the browser console.
+
+# --hints--
+
+You should use `console.clear()` to clear the browser console.
+
+```js
+assert(
+  __helpers
+    .removeWhiteSpace(code)
+    .match(/console.clear\(\)/)
+);
+```
+
+You should use `console.log()` to print the `output` variable.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/console\.log\(output\)/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Open your browser console.
+let output = "Get this to log once in the freeCodeCamp console and twice in the browser console";
+// Use console.log() to print the output variable.
+
+// Run the tests to see the difference between the two consoles.
+
+// Now, add console.clear() before your console.log() to clear the browser console, and pass the tests.
+```
+
+# --solutions--
+
+```js
+// Open your browser console.
+let output = "Get this to log once in the freeCodeCamp console and twice in the browser console";
+// Use console.log() to print the output variable.
+console.clear();
+console.log(output);
+
+// Run the tests to see the difference between the two consoles.
+
+// Now, add console.clear() before your console.log() to clear the browser console, and pass the tests.
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-caution-when-reinitializing-variables-inside-a-loop.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-caution-when-reinitializing-variables-inside-a-loop.md
new file mode 100644
index 0000000000..19dd59b605
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-caution-when-reinitializing-variables-inside-a-loop.md
@@ -0,0 +1,89 @@
+---
+id: 587d7b86367417b2b2512b3c
+title: Use Caution When Reinitializing Variables Inside a Loop
+challengeType: 1
+forumTopicId: 301194
+dashedName: 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 `console.log()` can uncover buggy behavior related to resetting, or failing to reset a variable.
+
+# --instructions--
+
+The following function is supposed to create a two-dimensional array with `m` rows and `n` columns of zeroes. Unfortunately, it's not producing the expected output because the `row` 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 `[[0, 0], [0, 0], [0, 0]]`.
+
+# --hints--
+
+Your code should set the `matrix` variable to an array holding 3 rows of 2 columns of zeroes each.
+
+```js
+assert(JSON.stringify(matrix) == '[[0,0],[0,0],[0,0]]');
+```
+
+The `matrix` variable should have 3 rows.
+
+```js
+assert(matrix.length == 3);
+```
+
+The `matrix` variable should have 2 columns in each row.
+
+```js
+assert(
+  matrix[0].length == 2 && matrix[1].length === 2 && matrix[2].length === 2
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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);
+```
+
+# --solutions--
+
+```js
+function zeroArray(m, n) {
+ // Creates a 2-D array with m rows and n columns of zeroes
+ let newArray = [];
+ for (let i = 0; i < m; i++) {
+   let row = [];
+   // 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);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-the-javascript-console-to-check-the-value-of-a-variable.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-the-javascript-console-to-check-the-value-of-a-variable.md
new file mode 100644
index 0000000000..4e212c2723
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-the-javascript-console-to-check-the-value-of-a-variable.md
@@ -0,0 +1,54 @@
+---
+id: 587d7b83367417b2b2512b33
+title: Use the JavaScript Console to Check the Value of a Variable
+challengeType: 1
+forumTopicId: 18372
+dashedName: 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 `console.log()` 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 the string `Hello world!` to the console:
+
+```js
+console.log('Hello world!');
+```
+
+# --instructions--
+
+Use the `console.log()` method to print the value of the variable `a` where noted in the code.
+
+# --hints--
+
+Your code should use `console.log()` to check the value of the variable `a`.
+
+```js
+assert(code.match(/console\.log\(a\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let a = 5;
+let b = 1;
+a++;
+// Only change code below this line
+
+
+let sumAB = a + b;
+console.log(sumAB);
+```
+
+# --solutions--
+
+```js
+var a = 5; console.log(a);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-typeof-to-check-the-type-of-a-variable.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-typeof-to-check-the-type-of-a-variable.md
new file mode 100644
index 0000000000..866916b9b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/debugging/use-typeof-to-check-the-type-of-a-variable.md
@@ -0,0 +1,66 @@
+---
+id: 587d7b84367417b2b2512b34
+title: Use typeof to Check the Type of a Variable
+challengeType: 1
+forumTopicId: 18374
+dashedName: use-typeof-to-check-the-type-of-a-variable
+---
+
+# --description--
+
+You can use `typeof` 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. Be careful especially when you're accessing and working with external data in the form of a JavaScript Object Notation (JSON) object.
+
+Here are some examples using `typeof`:
+
+```js
+console.log(typeof "");
+console.log(typeof 0);
+console.log(typeof []);
+console.log(typeof {});
+```
+
+In order, the console will display the strings `string`, `number`, `object`, and `object`.
+
+JavaScript recognizes six primitive (immutable) data types: `Boolean`, `Null`, `Undefined`, `Number`, `String`, and `Symbol` (new with ES6) and one type for mutable items: `Object`. Note that in JavaScript, arrays are technically a type of object.
+
+# --instructions--
+
+Add two `console.log()` statements to check the `typeof` each of the two variables `seven` and `three` in the code.
+
+# --hints--
+
+Your code should use `typeof` in two `console.log()` statements to check the type of the variables.
+
+```js
+assert(code.match(/console\.log\(typeof[\( ].*\)?\)/g).length == 2);
+```
+
+Your code should use `typeof` to check the type of the variable `seven`.
+
+```js
+assert(code.match(/typeof[\( ]seven\)?/g));
+```
+
+Your code should use `typeof` to check the type of the variable `three`.
+
+```js
+assert(code.match(/typeof[\( ]three\)?/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let seven = 7;
+let three = "3";
+console.log(seven + three);
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+let seven = 7;let three = "3";console.log(typeof seven);
+console.log(typeof three);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/compare-scopes-of-the-var-and-let-keywords.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/compare-scopes-of-the-var-and-let-keywords.md
new file mode 100644
index 0000000000..4250078f7e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/compare-scopes-of-the-var-and-let-keywords.md
@@ -0,0 +1,135 @@
+---
+id: 587d7b87367417b2b2512b40
+title: Compare Scopes of the var and let Keywords
+challengeType: 1
+forumTopicId: 301195
+dashedName: compare-scopes-of-the-var-and-let-keywords
+---
+
+# --description--
+
+When you declare a variable with the `var` keyword, it is declared globally, or locally if declared inside a function.
+
+The `let` keyword behaves similarly, but with some extra features. When you declare a variable with the `let` keyword inside a block, statement, or expression, its scope is limited to that block, statement, or expression.
+
+For example:
+
+```js
+var numArray = [];
+for (var i = 0; i < 3; i++) {
+  numArray.push(i);
+}
+console.log(numArray);
+console.log(i);
+```
+
+Here the console will display the values `[0, 1, 2]` and `3`.
+
+With the `var` keyword, `i` is declared globally. So when `i++` is executed, it updates the global variable. This code is similar to the following:
+
+```js
+var numArray = [];
+var i;
+for (i = 0; i < 3; i++) {
+  numArray.push(i);
+}
+console.log(numArray);
+console.log(i);
+```
+
+Here the console will display the values `[0, 1, 2]` and `3`.
+
+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 `i` variable. This is because the stored function will always refer to the value of the updated global `i` variable.
+
+```js
+var printNumTwo;
+for (var i = 0; i < 3; i++) {
+  if (i === 2) {
+    printNumTwo = function() {
+      return i;
+    };
+  }
+}
+console.log(printNumTwo());
+```
+
+Here the console will display the value `3`.
+
+As you can see, `printNumTwo()` prints 3 and not 2. This is because the value assigned to `i` was updated and the `printNumTwo()` returns the global `i` and not the value `i` had when the function was created in the for loop. The `let` keyword does not follow this behavior:
+
+```js
+let printNumTwo;
+for (let i = 0; i < 3; i++) {
+  if (i === 2) {
+    printNumTwo = function() {
+      return i;
+    };
+  }
+}
+console.log(printNumTwo());
+console.log(i);
+```
+
+Here the console will display the value `2`, and an error that `i is not defined`.
+
+`i` is not defined because it was not declared in the global scope. It is only declared within the `for` loop statement. `printNumTwo()` returned the correct value because three different `i` variables with unique values (0, 1, and 2) were created by the `let` keyword within the loop statement.
+
+# --instructions--
+
+Fix the code so that `i` declared in the `if` statement is a separate variable than `i` declared in the first line of the function. Be certain not to use the `var` keyword anywhere in your code.
+
+This exercise is designed to illustrate the difference between how `var` and `let` 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.
+
+# --hints--
+
+`var` should not exist in code.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/var/g));
+```
+
+The variable `i` declared in the `if` statement should equal the string `block scope`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').match(/(i\s*=\s*).*\s*.*\s*.*\1('|")block\s*scope\2/g)
+  );
+```
+
+`checkScope()` should return the string `function scope`
+
+```js
+assert(checkScope() === 'function scope');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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;
+}
+```
+
+# --solutions--
+
+```js
+function checkScope() {
+  let i = 'function scope';
+  if (true) {
+    let i = 'block scope';
+    console.log('Block scope i is: ', i);
+  }
+ 
+  console.log('Function scope i is: ', i);
+  return i;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
new file mode 100644
index 0000000000..83fb671b57
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/complete-a-promise-with-resolve-and-reject.md
@@ -0,0 +1,77 @@
+---
+id: 5cdafbc32913098997531680
+title: Complete a Promise with resolve and reject
+challengeType: 1
+forumTopicId: 301196
+dashedName: complete-a-promise-with-resolve-and-reject
+---
+
+# --description--
+
+A promise has three states: `pending`, `fulfilled`, and `rejected`. The promise you created in the last challenge is forever stuck in the `pending` state because you did not add a way to complete the promise. The `resolve` and `reject` parameters given to the promise argument are used to do this. `resolve` is used when you want your promise to succeed, and `reject` is used when you want it to fail. These are methods that take an argument, as seen below.
+
+```js
+const myPromise = new Promise((resolve, reject) => {
+  if(condition here) {
+    resolve("Promise was fulfilled");
+  } else {
+    reject("Promise was rejected");
+  }
+});
+```
+
+The example above uses strings for the argument of these functions, but it can really be anything. Often, it might be an object, that you would use data from, to put on your website or elsewhere.
+
+# --instructions--
+
+Make the promise handle success and failure. If `responseFromServer` is `true`, call the `resolve` method to successfully complete the promise. Pass `resolve` a string with the value `We got the data`. If `responseFromServer` is `false`, use the `reject` method instead and pass it the string: `Data not received`.
+
+# --hints--
+
+`resolve` should be called with the expected string when the `if` condition is `true`.
+
+```js
+assert(
+  code.match(/if\s*\(\s*responseFromServer\s*\)\s*{\s*resolve\s*\(\s*('|"|`)We got the data\1\s*\)(\s*|\s*;\s*)}/g)
+);
+```
+
+`reject` should be called with the expected string when the `if` condition is `false`.
+
+```js
+assert(
+  code.match(/}\s*else\s*{\s*reject\s*\(\s*('|"|`)Data not received\1\s*\)(\s*|\s*;\s*)}/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer represents a response from a server
+  let responseFromServer;
+    
+  if(responseFromServer) {
+    // Change this line
+  } else {  
+    // Change this line
+  }
+});
+```
+
+# --solutions--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer represents a response from a server
+  let responseFromServer;
+
+  if(responseFromServer) {
+    resolve("We got the data");
+  } else {  
+    reject("Data not received");
+  }
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-javascript-promise.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-javascript-promise.md
new file mode 100644
index 0000000000..a0ea3ea95b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-javascript-promise.md
@@ -0,0 +1,55 @@
+---
+id: 5cdafbb0291309899753167f
+title: Create a JavaScript Promise
+challengeType: 1
+forumTopicId: 301197
+dashedName: create-a-javascript-promise
+---
+
+# --description--
+
+A promise in JavaScript is exactly what it sounds like - you use it to make a promise to do something, usually asynchronously. When the task completes, you either fulfill your promise or fail to do so. `Promise` is a constructor function, so you need to use the `new` keyword to create one. It takes a function, as its argument, with two parameters - `resolve` and `reject`. These are methods used to determine the outcome of the promise. The syntax looks like this:
+
+```js
+const myPromise = new Promise((resolve, reject) => {
+
+});
+```
+
+# --instructions--
+
+Create a new promise called `makeServerRequest`. Pass in a function with `resolve` and `reject` parameters to the constructor.
+
+# --hints--
+
+You should assign a promise to a declared variable named `makeServerRequest`.
+
+```js
+assert(makeServerRequest instanceof Promise);
+```
+
+Your promise should receive a function with `resolve` and `reject` as parameters.
+
+```js
+assert(
+  code.match(
+    /Promise\(\s*(function\s*\(\s*resolve\s*,\s*reject\s*\)\s*{|\(\s*resolve\s*,\s*reject\s*\)\s*=>\s*{)[^}]*}/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
new file mode 100644
index 0000000000..30959b42a3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-a-module-script.md
@@ -0,0 +1,73 @@
+---
+id: 5cddbfd622f1a59093ec611d
+title: Create a Module Script
+challengeType: 6
+forumTopicId: 301198
+dashedName: create-a-module-script
+---
+
+# --description--
+
+JavaScript started with a small role to play on an otherwise mostly HTML web. Today, it’s huge, and some websites are built almost entirely with JavaScript. In order to make JavaScript more modular, clean, and maintainable; ES6 introduced a way to easily share code among JavaScript files. This involves exporting parts of a file for use in one or more other files, and importing the parts you need, where you need them. In order to take advantage of this functionality, you need to create a script in your HTML document with a `type` of `module`. Here’s an example:
+
+```html
+<script type="module" src="filename.js"></script>
+```
+
+A script that uses this `module` type can now use the `import` and `export` features you will learn about in the upcoming challenges.
+
+# --instructions--
+
+Add a script to the HTML document of type `module` and give it the source file of `index.js`
+
+# --hints--
+
+You should create a `script` tag.
+
+```js
+assert(code.match(/<\s*script[^>]*>\s*<\/\s*script\s*>/g));
+```
+
+Your `script` tag should have the `type` attribute with a value of `module`.
+
+```js
+assert(
+  code.match(
+    /<\s*script\s+[^t]*type\s*=\s*('|")module\1[^>]*>\s*<\/\s*script\s*>/g
+  )
+);
+```
+
+Your `script` tag should have a `src` of `index.js`.
+
+```js
+assert(
+  code.match(
+    /<\s*script\s+[^s]*src\s*=\s*('|")index\.js\1[^>]*>\s*<\/\s*script\s*>/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<html>
+  <body>
+    <!-- Only change code below this line -->
+
+    <!-- Only change code above this line -->
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<html>
+  <body>
+    <script type="module" src="index.js"></script>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-an-export-fallback-with-export-default.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-an-export-fallback-with-export-default.md
new file mode 100644
index 0000000000..0f4d9c3390
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-an-export-fallback-with-export-default.md
@@ -0,0 +1,63 @@
+---
+id: 587d7b8c367417b2b2512b58
+title: Create an Export Fallback with export default
+challengeType: 1
+forumTopicId: 301199
+dashedName: create-an-export-fallback-with-export-default
+---
+
+# --description--
+
+In the `export` 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 `export` 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.
+
+Below are examples using `export default`:
+
+```js
+export default function add(x, y) {
+  return x + y;
+}
+
+export default function(x, y) {
+  return x + y;
+}
+```
+
+The first is a named function, and the second is an anonymous function.
+
+Since `export default` 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. Additionally, you cannot use `export default` with `var`, `let`, or `const`
+
+# --instructions--
+
+The following function should be the fallback value for the module. Please add the necessary code to do so.
+
+# --hints--
+
+Your code should use an `export` fallback.
+
+```js
+assert(
+  code.match(
+    /export\s+default\s+function(\s+subtract\s*|\s*)\(\s*x,\s*y\s*\)\s*{/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function subtract(x, y) {
+  return x - y;
+}
+```
+
+# --solutions--
+
+```js
+export default function subtract(x, y) {
+  return x - y;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-strings-using-template-literals.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-strings-using-template-literals.md
new file mode 100644
index 0000000000..870716c3ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/create-strings-using-template-literals.md
@@ -0,0 +1,116 @@
+---
+id: 587d7b8a367417b2b2512b4e
+title: Create Strings using Template Literals
+challengeType: 1
+forumTopicId: 301200
+dashedName: 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 makes creating complex strings easier.
+
+Template literals allow you to create multi-line strings and to use string interpolation features to create strings.
+
+Consider the code below:
+
+```js
+const person = {
+  name: "Zodiac Hasbro",
+  age: 56
+};
+
+const greeting = `Hello, my name is ${person.name}!
+I am ${person.age} years old.`;
+
+console.log(greeting);
+```
+
+The console will display the strings `Hello, my name is Zodiac Hasbro!` and `I am 56 years old.`.
+
+A lot of things happened there. Firstly, the example uses backticks (`` ` ``), not quotes (`'` or `"`), to wrap the string. Secondly, notice that the string is multi-line, both in the code and the output. This saves inserting `\n` within strings. The `${variable}` syntax used above is a placeholder. Basically, you won't have to use concatenation with the `+` operator anymore. To add variables to strings, you just drop the variable in a template string and wrap it with `${` and `}`. Similarly, you can include other expressions in your string literal, for example `${a + b}`. This new way of creating strings gives you more flexibility to create robust strings.
+
+# --instructions--
+
+Use template literal syntax with backticks to create an array of list element (`li`) strings. Each list element's text should be one of the array elements from the `failure` property on the `result` object and have a `class` attribute with the value `text-warning`. The `makeList` function should return the array of list item strings.
+
+Use an iterator method (any kind of loop) to get the desired output (shown below).
+
+```js
+[
+  '<li class="text-warning">no-var</li>',
+  '<li class="text-warning">var-on-top</li>',
+  '<li class="text-warning">linebreak</li>'
+]
+```
+
+# --hints--
+
+`failuresList` should be an array containing `result failure` messages.
+
+```js
+assert(
+  typeof makeList(result.failure) === 'object' && failuresList.length === 3
+);
+```
+
+`failuresList` should be equal to the specified output.
+
+```js
+assert(
+  makeList(result.failure).every(
+    (v, i) =>
+      v === `<li class="text-warning">${result.failure[i]}</li>` ||
+      v === `<li class='text-warning'>${result.failure[i]}</li>`
+  )
+);
+```
+
+Template strings and expression interpolation should be used.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/(`.*\${.*}.*`)/));
+```
+
+An iterator should be used.
+
+```js
+(getUserInput) =>
+  assert(getUserInput('index').match(/for|map|reduce|forEach|while/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const result = {
+  success: ["max-length", "no-amd", "prefer-arrow-functions"],
+  failure: ["no-var", "var-on-top", "linebreak"],
+  skipped: ["no-extra-semi", "no-dup-keys"]
+};
+function makeList(arr) {
+  // Only change code below this line
+  const failureItems = [];
+  // Only change code above this line
+
+  return failureItems;
+}
+
+const failuresList = makeList(result.failure);
+```
+
+# --solutions--
+
+```js
+const result = {
+  success: ["max-length", "no-amd", "prefer-arrow-functions"],
+  failure: ["no-var", "var-on-top", "linebreak"],
+  skipped: ["no-extra-semi", "no-dup-keys"]
+};
+function makeList(arr) {
+  return arr.map(val => `<li class="text-warning">${val}</li>`);
+}
+
+const failuresList = makeList(result.failure);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/declare-a-read-only-variable-with-the-const-keyword.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/declare-a-read-only-variable-with-the-const-keyword.md
new file mode 100644
index 0000000000..39359d0a32
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/declare-a-read-only-variable-with-the-const-keyword.md
@@ -0,0 +1,89 @@
+---
+id: 587d7b87367417b2b2512b41
+title: Declare a Read-Only Variable with the const Keyword
+challengeType: 1
+forumTopicId: 301201
+dashedName: declare-a-read-only-variable-with-the-const-keyword
+---
+
+# --description--
+
+The keyword `let` is not the only new way to declare variables. In ES6, you can also declare variables using the `const` keyword.
+
+`const` has all the awesome features that `let` has, with the added bonus that variables declared using `const` are read-only. They are a constant value, which means that once a variable is assigned with `const`, it cannot be reassigned.
+
+```js
+const FAV_PET = "Cats";
+FAV_PET = "Dogs";
+```
+
+The console will display an error due to reassigning the value of `FAV_PET`.
+
+As you can see, trying to reassign a variable declared with `const` will throw an error. You should always name variables you don't want to reassign using the `const` keyword. This helps when you accidentally attempt to reassign a variable that is meant to stay constant. A common practice when naming constants is to use all uppercase letters, with words separated by an underscore.
+
+**Note:** It is common for developers to use uppercase variable identifiers for immutable values and lowercase or camelCase for mutable values (objects and arrays). In a later challenge you will see an example of a lowercase variable identifier being used for an array.
+
+# --instructions--
+
+Change the code so that all variables are declared using `let` or `const`. Use `let` when you want the variable to change, and `const` when you want the variable to remain constant. Also, rename variables declared with `const` to conform to common practices, meaning constants should be in all caps.
+
+# --hints--
+
+`var` should not exist in your code.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/var/g));
+```
+
+`SENTENCE` should be a constant variable declared with `const`.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/(const SENTENCE)/g));
+```
+
+`i` should be declared with `let`.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/(let i)/g));
+```
+
+`console.log` should be changed to print the `SENTENCE` variable.
+
+```js
+(getUserInput) =>
+  assert(getUserInput('index').match(/console\.log\(\s*SENTENCE\s*\)\s*;?/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function printManyTimes(str) {
+
+  // Only change code below this line
+
+  var sentence = str + " is cool!";
+  for (var i = 0; i < str.length; i+=2) {
+    console.log(sentence);
+  }
+
+  // Only change code above this line
+
+}
+printManyTimes("freeCodeCamp");
+```
+
+# --solutions--
+
+```js
+function printManyTimes(str) {
+
+  const SENTENCE = str + " is cool!";
+  for (let i = 0; i < str.length; i+=2) {
+    console.log(SENTENCE);
+  }
+
+}
+printManyTimes("freeCodeCamp");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/explore-differences-between-the-var-and-let-keywords.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/explore-differences-between-the-var-and-let-keywords.md
new file mode 100644
index 0000000000..f422b8c67b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/explore-differences-between-the-var-and-let-keywords.md
@@ -0,0 +1,91 @@
+---
+id: 587d7b87367417b2b2512b3f
+title: Explore Differences Between the var and let Keywords
+challengeType: 1
+forumTopicId: 301202
+dashedName: explore-differences-between-the-var-and-let-keywords
+---
+
+# --description--
+
+One of the biggest problems with declaring variables with the `var` keyword is that you can overwrite variable declarations without an error.
+
+```js
+var camper = 'James';
+var camper = 'David';
+console.log(camper);
+```
+
+Here the console will display the string `David`.
+
+As you can see in the code above, the `camper` variable is originally declared as `James` and then overridden to be `David`. In a small application, you might not run into this type of problem, but when your code becomes larger, you might accidentally overwrite a variable that you did not intend to overwrite. Because this behavior does not throw an error, searching and fixing bugs becomes more difficult.  
+A new keyword called `let` was introduced in ES6 to solve this potential issue with the `var` keyword. If you were to replace `var` with `let` in the variable declarations of the code above, the result would be an error.
+
+```js
+let camper = 'James';
+let camper = 'David';
+```
+
+This error can be seen in the console of your browser. So unlike `var`, when using `let`, a variable with the same name can only be declared once. Note the `"use strict"`. This enables Strict Mode, which catches common coding mistakes and "unsafe" actions. For instance:
+
+```js
+"use strict";
+x = 3.14;
+```
+
+This will display an error that `x is not defined`.
+
+# --instructions--
+
+Update the code so it only uses the `let` keyword.
+
+# --hints--
+
+`var` should not exist in the code.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/var/g));
+```
+
+`catName` should be the string `Oliver`.
+
+```js
+assert(catName === 'Oliver');
+```
+
+`quote` should be the string `Oliver says Meow!`
+
+```js
+assert(quote === 'Oliver says Meow!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var catName;
+var quote;
+function catTalk() {
+  "use strict";
+
+  catName = "Oliver";
+  quote = catName + " says Meow!";
+
+}
+catTalk();
+```
+
+# --solutions--
+
+```js
+let catName;
+let quote;
+function catTalk() {
+  'use strict';
+
+  catName = 'Oliver';
+  quote = catName + ' says Meow!';
+}
+catTalk();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-fulfilled-promise-with-then.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-fulfilled-promise-with-then.md
new file mode 100644
index 0000000000..682bab1df3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-fulfilled-promise-with-then.md
@@ -0,0 +1,92 @@
+---
+id: 5cdafbd72913098997531681
+title: Handle a Fulfilled Promise with then
+challengeType: 1
+forumTopicId: 301203
+dashedName: handle-a-fulfilled-promise-with-then
+---
+
+# --description--
+
+Promises are most useful when you have a process that takes an unknown amount of time in your code (i.e. something asynchronous), often a server request. When you make a server request it takes some amount of time, and after it completes you usually want to do something with the response from the server. This can be achieved by using the `then` method. The `then` method is executed immediately after your promise is fulfilled with `resolve`. Here’s an example:
+
+```js
+myPromise.then(result => {
+  
+});
+```
+
+`result` comes from the argument given to the `resolve` method.
+
+# --instructions--
+
+Add the `then` method to your promise. Use `result` as the parameter of its callback function and log `result` to the console.
+
+# --hints--
+
+You should call the `then` method on the promise.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/(makeServerRequest|\))\.then\(/g)
+);
+```
+
+Your `then` method should have a callback function with `result` as its parameter.
+
+```js
+assert(resultIsParameter);
+```
+
+You should log `result` to the console.
+
+```js
+assert(
+  resultIsParameter &&
+    __helpers
+      .removeWhiteSpace(code)
+      .match(/\.then\(.*?result.*?console.log\(result\).*?\)/)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const resultIsParameter = /\.then\((function\(result\){|result|\(result\)=>)/.test(__helpers.removeWhiteSpace(code));
+```
+
+## --seed-contents--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer is set to true to represent a successful response from a server
+  let responseFromServer = true;
+    
+  if(responseFromServer) {
+    resolve("We got the data");
+  } else {  
+    reject("Data not received");
+  }
+});
+```
+
+# --solutions--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer is set to true to represent a successful response from a server
+  let responseFromServer = true;
+    
+  if(responseFromServer) {
+    resolve("We got the data");
+  } else {  
+    reject("Data not received");
+  }
+});
+
+makeServerRequest.then(result => {
+  console.log(result);
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-rejected-promise-with-catch.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-rejected-promise-with-catch.md
new file mode 100644
index 0000000000..a0ac218b64
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/handle-a-rejected-promise-with-catch.md
@@ -0,0 +1,100 @@
+---
+id: 5cdafbe72913098997531682
+title: Handle a Rejected Promise with catch
+challengeType: 1
+forumTopicId: 301204
+dashedName: handle-a-rejected-promise-with-catch
+---
+
+# --description--
+
+`catch` is the method used when your promise has been rejected. It is executed immediately after a promise's `reject` method is called. Here’s the syntax:
+
+```js
+myPromise.catch(error => {
+  
+});
+```
+
+`error` is the argument passed in to the `reject` method.
+
+# --instructions--
+
+Add the `catch` method to your promise. Use `error` as the parameter of its callback function and log `error` to the console.
+
+# --hints--
+
+You should call the `catch` method on the promise.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/(makeServerRequest|\))\.catch\(/g)
+);
+```
+
+Your `catch` method should have a callback function with `error` as its parameter.
+
+```js
+assert(errorIsParameter);
+```
+
+You should log `error` to the console.
+
+```js
+assert(
+  errorIsParameter &&
+    __helpers
+      .removeWhiteSpace(code)
+      .match(/\.catch\(.*?error.*?console.log\(error\).*?\)/)
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const errorIsParameter = /\.catch\((function\(error\){|error|\(error\)=>)/.test(__helpers.removeWhiteSpace(code));
+```
+
+## --seed-contents--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer is set to false to represent an unsuccessful response from a server
+  let responseFromServer = false;
+    
+  if(responseFromServer) {
+    resolve("We got the data");
+  } else {  
+    reject("Data not received");
+  }
+});
+
+makeServerRequest.then(result => {
+  console.log(result);
+});
+```
+
+# --solutions--
+
+```js
+const makeServerRequest = new Promise((resolve, reject) => {
+  // responseFromServer is set to false to represent an unsuccessful response from a server
+  let responseFromServer = false;
+    
+  if(responseFromServer) {
+    resolve("We got the data");
+  } else {  
+    reject("Data not received");
+  }
+});
+
+makeServerRequest.then(result => {
+  console.log(result);
+});
+
+makeServerRequest.catch(error => {
+  console.log(error);
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/import-a-default-export.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/import-a-default-export.md
new file mode 100644
index 0000000000..115ad02bd7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/import-a-default-export.md
@@ -0,0 +1,48 @@
+---
+id: 587d7b8d367417b2b2512b59
+title: Import a Default Export
+challengeType: 1
+forumTopicId: 301205
+dashedName: import-a-default-export
+---
+
+# --description--
+
+In the last challenge, you learned about `export default` and its uses. To import a default export, you need to use a different `import` syntax. In the following example, `add` is the default export of the `math_functions.js` file. Here is how to import it:
+
+```js
+import add from "./math_functions.js";
+```
+
+The syntax differs in one key place. The imported value, `add`, is not surrounded by curly braces (`{}`). `add` here is simply a variable name for whatever the default export of the `math_functions.js` file is. You can use any name here when importing a default.
+
+# --instructions--
+
+In the following code, import the default export from the `math_functions.js` file, found in the same directory as this file. Give the import the name `subtract`.
+
+# --hints--
+
+You should properly import `subtract` from `math_functions.js`.
+
+```js
+assert(code.match(/import\s+subtract\s+from\s+('|")\.\/math_functions\.js\1/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+  
+// Only change code above this line
+
+subtract(7,4);
+```
+
+# --solutions--
+
+```js
+import subtract from "./math_functions.js";
+
+subtract(7,4);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
new file mode 100644
index 0000000000..5f987eab1a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/mutate-an-array-declared-with-const.md
@@ -0,0 +1,89 @@
+---
+id: 587d7b87367417b2b2512b42
+title: Mutate an Array Declared with const
+challengeType: 1
+forumTopicId: 301206
+dashedName: mutate-an-array-declared-with-const
+---
+
+# --description--
+
+The `const` declaration has many use cases in modern JavaScript.
+
+Some developers prefer to assign all their variables using `const` by default, unless they know they will need to reassign the value. Only in that case, they use `let`.
+
+However, it is important to understand that objects (including arrays and functions) assigned to a variable using `const` are still mutable. Using the `const` declaration only prevents reassignment of the variable identifier.
+
+```js
+const s = [5, 6, 7];
+s = [1, 2, 3];
+s[2] = 45;
+console.log(s);
+```
+
+`s = [1, 2, 3]` will result in an error. The `console.log` will display the value `[5, 6, 45]`.
+
+As you can see, you can mutate the object `[5, 6, 7]` itself and the variable `s` will still point to the altered array `[5, 6, 45]`. Like all arrays, the array elements in `s` are mutable, but because `const` was used, you cannot use the variable identifier `s` to point to a different array using the assignment operator.
+
+# --instructions--
+
+An array is declared as `const s = [5, 7, 2]`. Change the array to `[2, 5, 7]` using various element assignments.
+
+# --hints--
+
+You should not replace `const` keyword.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/const/g));
+```
+
+`s` should be a constant variable (by using `const`).
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/const\s+s/g));
+```
+
+You should not change the original array declaration.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').match(
+      /const\s+s\s*=\s*\[\s*5\s*,\s*7\s*,\s*2\s*\]\s*;?/g
+    )
+  );
+```
+
+`s` should be equal to `[2, 5, 7]`.
+
+```js
+assert.deepEqual(s, [2, 5, 7]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const s = [5, 7, 2];
+function editInPlace() {
+  // Only change code below this line
+
+  // Using s = [2, 5, 7] would be invalid
+
+  // Only change code above this line
+}
+editInPlace();
+```
+
+# --solutions--
+
+```js
+const s = [5, 7, 2];
+function editInPlace() {
+  s[0] = 2;
+  s[1] = 5;
+  s[2] = 7;
+}
+editInPlace();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/prevent-object-mutation.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/prevent-object-mutation.md
new file mode 100644
index 0000000000..0161194fda
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/prevent-object-mutation.md
@@ -0,0 +1,104 @@
+---
+id: 598f48a36c8c40764b4e52b3
+title: Prevent Object Mutation
+challengeType: 1
+forumTopicId: 301207
+dashedName: prevent-object-mutation
+---
+
+# --description--
+
+As seen in the previous challenge, `const` declaration alone doesn't really protect your data from mutation. To ensure your data doesn't change, JavaScript provides a function `Object.freeze` to prevent data mutation.
+
+Once the object is frozen, you can no longer add, update, or delete properties from it. Any attempt at changing the object will be rejected without an error.
+
+```js
+let obj = {
+  name:"FreeCodeCamp",
+  review:"Awesome"
+};
+Object.freeze(obj);
+obj.review = "bad";
+obj.newProp = "Test";
+console.log(obj); 
+```
+
+The `obj.review` and `obj.newProp` assignments will result in errors, and the console will display the value `{ name: "FreeCodeCamp", review: "Awesome" }`.
+
+# --instructions--
+
+In this challenge you are going to use `Object.freeze` to prevent mathematical constants from changing. You need to freeze the `MATH_CONSTANTS` object so that no one is able to alter the value of `PI`, add, or delete properties.
+
+# --hints--
+
+You should not replace the `const` keyword.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/const/g));
+```
+
+`MATH_CONSTANTS` should be a constant variable (by using `const`).
+
+```js
+(getUserInput) =>
+  assert(getUserInput('index').match(/const\s+MATH_CONSTANTS/g));
+```
+
+You should not change the original declaration of `MATH_CONSTANTS`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').match(
+      /const\s+MATH_CONSTANTS\s+=\s+{\s+PI:\s+3.14\s+};/g
+    )
+  );
+```
+
+`PI` should equal `3.14`.
+
+```js
+assert(PI === 3.14);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function freezeObj() {
+  const MATH_CONSTANTS = {
+    PI: 3.14
+  };
+  // Only change code below this line
+
+
+  // Only change code above this line
+  try {
+    MATH_CONSTANTS.PI = 99;
+  } catch(ex) {
+    console.log(ex);
+  }
+  return MATH_CONSTANTS.PI;
+}
+const PI = freezeObj();
+```
+
+# --solutions--
+
+```js
+function freezeObj() {
+  const MATH_CONSTANTS = {
+    PI: 3.14
+  };
+  Object.freeze(MATH_CONSTANTS);
+
+  try {
+    MATH_CONSTANTS.PI = 99;
+  } catch(ex) {
+    console.log(ex);
+  }
+  return MATH_CONSTANTS.PI;
+}
+const PI = freezeObj();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/reuse-javascript-code-using-import.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/reuse-javascript-code-using-import.md
new file mode 100644
index 0000000000..1a21ddbb05
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/reuse-javascript-code-using-import.md
@@ -0,0 +1,70 @@
+---
+id: 587d7b8c367417b2b2512b55
+title: Reuse JavaScript Code Using import
+challengeType: 1
+forumTopicId: 301208
+dashedName: reuse-javascript-code-using-import
+---
+
+# --description--
+
+`import` allows you to choose which parts of a file or module to load. In the previous lesson, the examples exported `add` from the `math_functions.js` file. Here's how you can import it to use in another file:
+
+```js
+import { add } from './math_functions.js';
+```
+
+Here, `import` will find `add` in `math_functions.js`, import just that function for you to use, and ignore the rest. The `./` tells the import to look for the `math_functions.js` file in the same folder as the current file. The relative file path (`./`) and file extension (`.js`) are required when using import in this way.
+
+You can import more than one item from the file by adding them in the `import` statement like this:
+
+```js
+import { add, subtract } from './math_functions.js';
+```
+
+# --instructions--
+
+Add the appropriate `import` statement that will allow the current file to use the `uppercaseString` and `lowercaseString` functions you exported in the previous lesson. These functions are in a file called `string_functions.js`, which is in the same directory as the current file.
+
+# --hints--
+
+You should properly import `uppercaseString`.
+
+```js
+assert(
+  code.match(
+    /import\s*{\s*(uppercaseString[^}]*|[^,]*,\s*uppercaseString\s*)}\s+from\s+('|")\.\/string_functions\.js\2/g
+  )
+);
+```
+
+You should properly import `lowercaseString`.
+
+```js
+assert(
+  code.match(
+    /import\s*{\s*(lowercaseString[^}]*|[^,]*,\s*lowercaseString\s*)}\s+from\s+('|")\.\/string_functions\.js\2/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+  
+// Only change code above this line
+
+uppercaseString("hello");
+lowercaseString("WORLD!");
+```
+
+# --solutions--
+
+```js
+import { uppercaseString, lowercaseString } from './string_functions.js';
+
+uppercaseString("hello");
+lowercaseString("WORLD!");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions.md
new file mode 100644
index 0000000000..0bb3fd12f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions.md
@@ -0,0 +1,64 @@
+---
+id: 587d7b88367417b2b2512b46
+title: Set Default Parameters for Your Functions
+challengeType: 1
+forumTopicId: 301209
+dashedName: 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:
+
+```js
+const greeting = (name = "Anonymous") => "Hello " + name;
+
+console.log(greeting("John"));
+console.log(greeting());
+```
+
+The console will display the strings `Hello John` and `Hello Anonymous`.
+
+The default parameter kicks in when the argument is not specified (it is undefined). As you can see in the example above, the parameter `name` will receive its default value `Anonymous` when you do not provide a value for the parameter. You can add default values for as many parameters as you want.
+
+# --instructions--
+
+Modify the function `increment` by adding default parameters so that it will add 1 to `number` if `value` is not specified.
+
+# --hints--
+
+The result of `increment(5, 2)` should be `7`.
+
+```js
+assert(increment(5, 2) === 7);
+```
+
+The result of `increment(5)` should be `6`.
+
+```js
+assert(increment(5) === 6);
+```
+
+A default parameter value of `1` should be used for `value`.
+
+```js
+assert(code.match(/value\s*=\s*1/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+const increment = (number, value) => number + value;
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const increment = (number, value = 1) => number + value;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use--to-import-everything-from-a-file.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use--to-import-everything-from-a-file.md
new file mode 100644
index 0000000000..c990788c45
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use--to-import-everything-from-a-file.md
@@ -0,0 +1,60 @@
+---
+id: 587d7b8c367417b2b2512b57
+title: Use * to Import Everything from a File
+challengeType: 1
+forumTopicId: 301210
+dashedName: use--to-import-everything-from-a-file
+---
+
+# --description--
+
+Suppose you have a file and you wish to import all of its contents into the current file. This can be done with the `import * as` syntax. Here's an example where the contents of a file named `math_functions.js` are imported into a file in the same directory:
+
+```js
+import * as myMathModule from "./math_functions.js";
+```
+
+The above `import` statement will create an object called `myMathModule`. This is just a variable name, you can name it anything. The object will contain all of the exports from `math_functions.js` in it, so you can access the functions like you would any other object property. Here's how you can use the `add` and `subtract` functions that were imported:
+
+```js
+myMathModule.add(2,3);
+myMathModule.subtract(5,3);
+```
+
+# --instructions--
+
+The code in this file requires the contents of the file: `string_functions.js`, that is in the same directory as the current file. Use the `import * as` syntax to import everything from the file into an object called `stringFunctions`.
+
+# --hints--
+
+Your code should properly use `import * as` syntax.
+
+```js
+assert(
+  code.match(
+    /import\s*\*\s*as\s+stringFunctions\s+from\s*('|")\.\/string_functions\.js\1/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+// Only change code above this line
+
+stringFunctions.uppercaseString("hello");
+stringFunctions.lowercaseString("WORLD!");
+```
+
+# --solutions--
+
+```js
+import * as stringFunctions from "./string_functions.js";
+
+// add code above this line
+stringFunctions.uppercaseString("hello");
+stringFunctions.lowercaseString("WORLD!");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-arrow-functions-to-write-concise-anonymous-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-arrow-functions-to-write-concise-anonymous-functions.md
new file mode 100644
index 0000000000..bcf4507370
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-arrow-functions-to-write-concise-anonymous-functions.md
@@ -0,0 +1,91 @@
+---
+id: 587d7b87367417b2b2512b43
+title: Use Arrow Functions to Write Concise Anonymous Functions
+challengeType: 1
+forumTopicId: 301211
+dashedName: 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:
+
+```js
+const myFunc = function() {
+  const myVar = "value";
+  return myVar;
+}
+```
+
+ES6 provides us with the syntactic sugar to not have to write anonymous functions this way. Instead, you can use **arrow function syntax**:
+
+```js
+const myFunc = () => {
+  const myVar = "value";
+  return myVar;
+}
+```
+
+When there is no function body, and only a return value, arrow function syntax allows you to omit the keyword `return` as well as the brackets surrounding the code. This helps simplify smaller functions into one-line statements:
+
+```js
+const myFunc = () => "value";
+```
+
+This code will still return the string `value` by default.
+
+# --instructions--
+
+Rewrite the function assigned to the variable `magic` which returns a `new Date()` to use arrow function syntax. Also, make sure nothing is defined using the keyword `var`.
+
+# --hints--
+
+You should replace the `var` keyword.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/var/g));
+```
+
+`magic` should be a constant variable (by using `const`).
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/const\s+magic/g));
+```
+
+`magic` should be a `function`.
+
+```js
+assert(typeof magic === 'function');
+```
+
+`magic()` should return the correct date.
+
+```js
+assert(magic().setHours(0, 0, 0, 0) === new Date().setHours(0, 0, 0, 0));
+```
+
+The `function` keyword should not be used.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/function/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var magic = function() {
+  return new Date();
+};
+```
+
+# --solutions--
+
+```js
+const magic = () => {
+  return new Date();
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
new file mode 100644
index 0000000000..8b847ad5fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-class-syntax-to-define-a-constructor-function.md
@@ -0,0 +1,100 @@
+---
+id: 587d7b8b367417b2b2512b53
+title: Use class Syntax to Define a Constructor Function
+challengeType: 1
+forumTopicId: 301212
+dashedName: use-class-syntax-to-define-a-constructor-function
+---
+
+# --description--
+
+ES6 provides a new syntax to create objects, using the <dfn>class</dfn> keyword.
+
+It should be noted that the `class` syntax is just syntax, and not a full-fledged class-based implementation of an object-oriented paradigm, unlike in languages such as Java, Python, Ruby, etc.
+
+In ES5, we usually define a `constructor` function and use the `new` keyword to instantiate an object.
+
+```js
+var SpaceShuttle = function(targetPlanet){
+  this.targetPlanet = targetPlanet;
+}
+var zeus = new SpaceShuttle('Jupiter');
+```
+
+The `class` syntax simply replaces the `constructor` function creation:
+
+```js
+class SpaceShuttle {
+  constructor(targetPlanet) {
+    this.targetPlanet = targetPlanet;
+  }
+}
+const zeus = new SpaceShuttle('Jupiter');
+```
+
+It should be noted that the `class` keyword declares a new function, to which a constructor is added. This constructor is invoked when `new` is called to create a new object.
+
+**Note:** UpperCamelCase should be used by convention for ES6 class names, as in `SpaceShuttle` used above.
+
+The `constructor` method is a special method for creating and initializing an object created with a class. You will learn more about it in the Object Oriented Programming section of the JavaScript Algorithms And Data Structures Certification.
+
+# --instructions--
+
+Use the `class` keyword and write a `constructor` to create the `Vegetable` class.
+
+The `Vegetable` class allows you to create a vegetable object with a property `name` that gets passed to the `constructor`.
+
+# --hints--
+
+`Vegetable` should be a `class` with a defined `constructor` method.
+
+```js
+assert(
+  typeof Vegetable === 'function' && typeof Vegetable.constructor === 'function'
+);
+```
+
+The `class` keyword should be used.
+
+```js
+assert(code.match(/class/g));
+```
+
+`Vegetable` should be able to be instantiated.
+
+```js
+assert(() => {
+  const a = new Vegetable('apple');
+  return typeof a === 'object';
+});
+```
+
+`carrot.name` should return `carrot`.
+
+```js
+assert(carrot.name == 'carrot');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+
+// Only change code above this line
+
+const carrot = new Vegetable('carrot');
+console.log(carrot.name); // Should display 'carrot'
+```
+
+# --solutions--
+
+```js
+class Vegetable {
+  constructor(name) {
+    this.name = name;
+  }
+}
+const carrot = new Vegetable('carrot');
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-arrays.md
new file mode 100644
index 0000000000..0660373384
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-arrays.md
@@ -0,0 +1,71 @@
+---
+id: 587d7b89367417b2b2512b4b
+title: Use Destructuring Assignment to Assign Variables from Arrays
+challengeType: 1
+forumTopicId: 301213
+dashedName: 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:
+
+```js
+const [a, b] = [1, 2, 3, 4, 5, 6];
+console.log(a, b);
+```
+
+The console will display the values of `a` and `b` as `1, 2`.
+
+The variable `a` is assigned the first value of the array, and `b` 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:
+
+```js
+const [a, b,,, c] = [1, 2, 3, 4, 5, 6];
+console.log(a, b, c);
+```
+
+The console will display the values of `a`, `b`, and `c` as `1, 2, 5`.
+
+# --instructions--
+
+Use destructuring assignment to swap the values of `a` and `b` so that `a` receives the value stored in `b`, and `b` receives the value stored in `a`.
+
+# --hints--
+
+The value of `a` should be `6`, after swapping.
+
+```js
+assert(a === 6);
+```
+
+The value of `b` should be `8`, after swapping.
+
+```js
+assert(b === 8);
+```
+
+You should use array destructuring to swap `a` and `b`.
+
+```js
+assert(/\[\s*(\w)\s*,\s*(\w)\s*\]\s*=\s*\[\s*\2\s*,\s*\1\s*\]/g.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let a = 8, b = 6;
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+let a = 8, b = 6;
+[a, b] = [b, a];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-nested-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-nested-objects.md
new file mode 100644
index 0000000000..61f1f42ed6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-nested-objects.md
@@ -0,0 +1,106 @@
+---
+id: 587d7b89367417b2b2512b4a
+title: Use Destructuring Assignment to Assign Variables from Nested Objects
+challengeType: 1
+forumTopicId: 301214
+dashedName: use-destructuring-assignment-to-assign-variables-from-nested-objects
+---
+
+# --description--
+
+You can use the same principles from the previous two lessons to destructure values from nested objects.
+
+Using an object similar to previous examples:
+
+```js
+const user = {
+  johnDoe: { 
+    age: 34,
+    email: 'johnDoe@freeCodeCamp.com'
+  }
+};
+```
+
+Here's how to extract the values of object properties and assign them to variables with the same name:
+
+```js
+const { johnDoe: { age, email }} = user;
+```
+
+And here's how you can assign an object properties' values to variables with different names:
+
+```js
+const { johnDoe: { age: userAge, email: userEmail }} = user;
+```
+
+# --instructions--
+
+Replace the two assignments with an equivalent destructuring assignment. It should still assign the variables `lowToday` and `highToday` the values of `today.low` and `today.high` from the `LOCAL_FORECAST` object.
+
+# --hints--
+
+You should remove the ES5 assignment syntax.
+
+```js
+assert(
+  !code.match(/lowToday = LOCAL_FORECAST\.today\.low/g) &&
+    !code.match(/highToday = LOCAL_FORECAST\.today.high/g)
+);
+```
+
+You should use destructuring to create the `lowToday` variable.
+
+```js
+assert(
+  code.match(
+    /(var|const|let)\s*{\s*today\s*:\s*{\s*(low\s*:\s*lowToday[^}]*|[^,]*,\s*low\s*:\s*lowToday\s*)}\s*}\s*=\s*LOCAL_FORECAST(;|\s+|\/\/)/g
+  )
+);
+```
+
+You should use destructuring to create the `highToday` variable.
+
+```js
+assert(
+  code.match(
+    /(var|const|let)\s*{\s*today\s*:\s*{\s*(high\s*:\s*highToday[^}]*|[^,]*,\s*high\s*:\s*highToday\s*)}\s*}\s*=\s*LOCAL_FORECAST(;|\s+|\/\/)/g
+  )
+);
+```
+
+`lowToday` should be equal to `64` and `highToday` should be equal to `77`.
+
+```js
+assert(lowToday === 64 && highToday === 77);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const LOCAL_FORECAST = {
+  yesterday: { low: 61, high: 75 },
+  today: { low: 64, high: 77 },
+  tomorrow: { low: 68, high: 80 }
+};
+
+// Only change code below this line
+  
+const lowToday = LOCAL_FORECAST.today.low;
+const highToday = LOCAL_FORECAST.today.high;
+
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const LOCAL_FORECAST = {
+  yesterday: { low: 61, high: 75 },
+  today: { low: 64, high: 77 },
+  tomorrow: { low: 68, high: 80 }
+};
+ 
+const { today: { low: lowToday, high: highToday }} = LOCAL_FORECAST;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-objects.md
new file mode 100644
index 0000000000..e14f1624a6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-assign-variables-from-objects.md
@@ -0,0 +1,97 @@
+---
+id: 587d7b89367417b2b2512b49
+title: Use Destructuring Assignment to Assign Variables from Objects
+challengeType: 1
+forumTopicId: 301215
+dashedName: use-destructuring-assignment-to-assign-variables-from-objects
+---
+
+# --description--
+
+Destructuring allows you to assign a new variable name when extracting values. You can do this by putting the new name after a colon when assigning the value.
+
+Using the same object from the last example:
+
+```js
+const user = { name: 'John Doe', age: 34 };
+```
+
+Here's how you can give new variable names in the assignment:
+
+```js
+const { name: userName, age: userAge } = user;
+```
+
+You may read it as "get the value of `user.name` and assign it to a new variable named `userName`" and so on. The value of `userName` would be the string `John Doe`, and the value of `userAge` would be the number `34`.
+
+# --instructions--
+
+Replace the two assignments with an equivalent destructuring assignment. It should still assign the variables `highToday` and `highTomorrow` the values of `today` and `tomorrow` from the `HIGH_TEMPERATURES` object.
+
+# --hints--
+
+You should remove the ES5 assignment syntax.
+
+```js
+assert(
+  !code.match(/highToday = HIGH_TEMPERATURES\.today/g) &&
+    !code.match(/highTomorrow = HIGH_TEMPERATURES\.tomorrow/g)
+);
+```
+
+You should use destructuring to create the `highToday` variable.
+
+```js
+assert(
+  code.match(
+    /(var|const|let)\s*{\s*(today\s*:\s*highToday[^}]*|[^,]*,\s*today\s*:\s*highToday\s*)}\s*=\s*HIGH_TEMPERATURES(;|\s+|\/\/)/g
+  )
+);
+```
+
+You should use destructuring to create the `highTomorrow` variable.
+
+```js
+assert(
+  code.match(
+    /(var|const|let)\s*{\s*(tomorrow\s*:\s*highTomorrow[^}]*|[^,]*,\s*tomorrow\s*:\s*highTomorrow\s*)}\s*=\s*HIGH_TEMPERATURES(;|\s+|\/\/)/g
+  )
+);
+```
+
+`highToday` should be equal to `77` and `highTomorrow` should be equal to `80`.
+
+```js
+assert(highToday === 77 && highTomorrow === 80);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const HIGH_TEMPERATURES = {
+  yesterday: 75,
+  today: 77,
+  tomorrow: 80
+};
+
+// Only change code below this line
+  
+const highToday = HIGH_TEMPERATURES.today;
+const highTomorrow = HIGH_TEMPERATURES.tomorrow; 
+
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const HIGH_TEMPERATURES = {
+  yesterday: 75,
+  today: 77,
+  tomorrow: 80
+};
+
+const { today: highToday, tomorrow: highTomorrow } = HIGH_TEMPERATURES;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.md
new file mode 100644
index 0000000000..5d71f58348
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.md
@@ -0,0 +1,101 @@
+---
+id: 5cfa550e84205a357704ccb6
+title: Use Destructuring Assignment to Extract Values from Objects
+challengeType: 1
+forumTopicId: 301216
+dashedName: use-destructuring-assignment-to-extract-values-from-objects
+---
+
+# --description--
+
+<dfn>Destructuring assignment</dfn> is special syntax introduced in ES6, for neatly assigning values taken directly from an object.
+
+Consider the following ES5 code:
+
+```js
+const user = { name: 'John Doe', age: 34 };
+
+const name = user.name;
+const age = user.age;
+```
+
+`name` would have a value of the string `John Doe`, and `age` would have the number `34`.
+
+Here's an equivalent assignment statement using the ES6 destructuring syntax:
+
+```js
+const { name, age } = user;
+```
+
+Again, `name` would have a value of the string `John Doe`, and `age` would have the number `34`.
+
+Here, the `name` and `age` variables will be created and assigned the values of their respective values from the `user` object. You can see how much cleaner this is.
+
+You can extract as many or few values from the object as you want.
+
+# --instructions--
+
+Replace the two assignments with an equivalent destructuring assignment. It should still assign the variables `today` and `tomorrow` the values of `today` and `tomorrow` from the `HIGH_TEMPERATURES` object.
+
+# --hints--
+
+You should remove the ES5 assignment syntax.
+
+```js
+assert(
+  !code.match(/today\s*=\s*HIGH_TEMPERATURES\.(today|tomorrow)/g)
+);
+```
+
+You should use destructuring to create the `today` variable.
+
+```js
+assert(
+  code.match(/(var|let|const)\s*{\s*(today[^}]*|[^,]*,\s*today)\s*}\s*=\s*HIGH_TEMPERATURES(;|\s+|\/\/)/g)
+);
+```
+
+You should use destructuring to create the `tomorrow` variable.
+
+```js
+assert(
+  code.match(/(var|let|const)\s*{\s*(tomorrow[^}]*|[^,]*,\s*tomorrow)\s*}\s*=\s*HIGH_TEMPERATURES(;|\s+|\/\/)/g)
+);
+```
+
+`today` should be equal to `77` and `tomorrow` should be equal to `80`.
+
+```js
+assert(today === 77 && tomorrow === 80);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const HIGH_TEMPERATURES = {
+  yesterday: 75,
+  today: 77,
+  tomorrow: 80
+};
+
+// Only change code below this line
+
+const today = HIGH_TEMPERATURES.today;
+const tomorrow = HIGH_TEMPERATURES.tomorrow;
+
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const HIGH_TEMPERATURES = {
+  yesterday: 75,
+  today: 77,
+  tomorrow: 80
+};
+
+const { today, tomorrow } = HIGH_TEMPERATURES;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-pass-an-object-as-a-functions-parameters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-pass-an-object-as-a-functions-parameters.md
new file mode 100644
index 0000000000..5e5d98d9ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-pass-an-object-as-a-functions-parameters.md
@@ -0,0 +1,94 @@
+---
+id: 587d7b8a367417b2b2512b4d
+title: Use Destructuring Assignment to Pass an Object as a Function's Parameters
+challengeType: 1
+forumTopicId: 301217
+dashedName: use-destructuring-assignment-to-pass-an-object-as-a-functions-parameters
+---
+
+# --description--
+
+In some cases, you can destructure the object in a function argument itself.
+
+Consider the code below:
+
+```js
+const profileUpdate = (profileData) => {
+  const { name, age, nationality, location } = profileData;
+
+}
+```
+
+This effectively destructures the object sent into the function. This can also be done in-place:
+
+```js
+const profileUpdate = ({ name, age, nationality, location }) => {
+
+}
+```
+
+When `profileData` is passed to the above function, the values are destructured from the function parameter for use within the function.
+
+# --instructions--
+
+Use destructuring assignment within the argument to the function `half` to send only `max` and `min` inside the function.
+
+# --hints--
+
+`stats` should be an `object`.
+
+```js
+assert(typeof stats === 'object');
+```
+
+`half(stats)` should be `28.015`
+
+```js
+assert(half(stats) === 28.015);
+```
+
+Destructuring should be used.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/half=\({\w+,\w+}\)/));
+```
+
+Destructured parameter should be used.
+
+```js
+assert(!code.match(/stats\.max|stats\.min/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const stats = {
+  max: 56.78,
+  standard_deviation: 4.34,
+  median: 34.54,
+  mode: 23.87,
+  min: -0.75,
+  average: 35.85
+};
+
+// Only change code below this line
+const half = (stats) => (stats.max + stats.min) / 2.0; 
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const stats = {
+  max: 56.78,
+  standard_deviation: 4.34,
+  median: 34.54,
+  mode: 23.87,
+  min: -0.75,
+  average: 35.85
+};
+
+const half = ( {max, min} ) => (max + min) / 2.0;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-with-the-rest-parameter-to-reassign-array-elements.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-with-the-rest-parameter-to-reassign-array-elements.md
new file mode 100644
index 0000000000..ca574e0f17
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-with-the-rest-parameter-to-reassign-array-elements.md
@@ -0,0 +1,86 @@
+---
+id: 587d7b8a367417b2b2512b4c
+title: >-
+  Use Destructuring Assignment with the Rest Parameter to Reassign Array
+  Elements
+challengeType: 1
+forumTopicId: 301218
+dashedName: >-
+  use-destructuring-assignment-with-the-rest-parameter-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 `Array.prototype.slice()`, as shown below:
+
+```js
+const [a, b, ...arr] = [1, 2, 3, 4, 5, 7];
+console.log(a, b);
+console.log(arr);
+```
+
+The console would display the values `1, 2` and `[3, 4, 5, 7]`.
+
+Variables `a` and `b` take the first and second values from the array. After that, because of the rest parameter's presence, `arr` gets the 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 parameter to catch a subarray that leaves out the last element of the original array.
+
+# --instructions--
+
+Use destructuring assignment with the rest parameter to perform an effective `Array.prototype.slice()` so that `arr` is a sub-array of the original array `source` with the first two elements omitted.
+
+# --hints--
+
+`arr` should be `[3,4,5,6,7,8,9,10]`
+
+```js
+assert(arr.every((v, i) => v === i + 3) && arr.length === 8);
+```
+
+`source` should be `[1,2,3,4,5,6,7,8,9,10]`
+
+```js
+assert(source.every((v, i) => v === i + 1) && source.length === 10);
+```
+
+`Array.slice()` should not be used.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/slice/g));
+```
+
+Destructuring on `list` should be used.
+
+```js
+assert(
+  __helpers
+    .removeWhiteSpace(code)
+    .match(/\[(([_$a-z]\w*)?,){1,}\.\.\.arr\]=list/i)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const source = [1,2,3,4,5,6,7,8,9,10];
+function removeFirstTwo(list) {
+  // Only change code below this line
+  const arr = list; // Change this line
+  // Only change code above this line
+  return arr;
+}
+const arr = removeFirstTwo(source);
+```
+
+# --solutions--
+
+```js
+const source = [1,2,3,4,5,6,7,8,9,10];
+function removeFirstTwo(list) {
+  const [, , ...arr] = list;
+  return arr;
+}
+const arr = removeFirstTwo(source);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-export-to-share-a-code-block.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-export-to-share-a-code-block.md
new file mode 100644
index 0000000000..cffcbbe642
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-export-to-share-a-code-block.md
@@ -0,0 +1,85 @@
+---
+id: 587d7b8c367417b2b2512b56
+title: Use export to Share a Code Block
+challengeType: 1
+forumTopicId: 301219
+dashedName: use-export-to-share-a-code-block
+---
+
+# --description--
+
+Imagine a file called `math_functions.js` that contains several functions related to mathematical operations. One of them is stored in a variable, `add`, that takes in two numbers and returns their sum. You want to use this function in several different JavaScript files. In order to share it with these other files, you first need to `export` it.
+
+```js
+export const add = (x, y) => {
+  return x + y;
+}
+```
+
+The above is a common way to export a single function, but you can achieve the same thing like this:
+
+```js
+const add = (x, y) => {
+  return x + y;
+}
+
+export { add };
+```
+
+When you export a variable or function, you can import it in another file and use it without having to rewrite the code. You can export multiple things by repeating the first example for each thing you want to export, or by placing them all in the export statement of the second example, like this:
+
+```js
+export { add, subtract };
+```
+
+# --instructions--
+
+There are two string-related functions in the editor. Export both of them using the method of your choice.
+
+# --hints--
+
+You should properly export `uppercaseString`.
+
+```js
+assert(
+  code.match(
+    /(export\s+const\s+uppercaseString|export\s*{\s*(uppercaseString[^}]*|[^,]*,\s*uppercaseString\s*)})/g
+  )
+);
+```
+
+You should properly export `lowercaseString`.
+
+```js
+assert(
+  code.match(
+    /(export\s+const\s+lowercaseString|export\s*{\s*(lowercaseString[^}]*|[^,]*,\s*lowercaseString\s*)})/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const uppercaseString = (string) => {
+  return string.toUpperCase();
+}
+
+const lowercaseString = (string) => {
+  return string.toLowerCase()
+}
+```
+
+# --solutions--
+
+```js
+export const uppercaseString = (string) => {
+  return string.toUpperCase();
+}
+
+export const lowercaseString = (string) => {
+  return string.toLowerCase()
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-getters-and-setters-to-control-access-to-an-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-getters-and-setters-to-control-access-to-an-object.md
new file mode 100644
index 0000000000..c46878caf1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-getters-and-setters-to-control-access-to-an-object.md
@@ -0,0 +1,174 @@
+---
+id: 587d7b8c367417b2b2512b54
+title: Use getters and setters to Control Access to an Object
+challengeType: 1
+forumTopicId: 301220
+dashedName: use-getters-and-setters-to-control-access-to-an-object
+---
+
+# --description--
+
+You can obtain values from an object and set the 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.  
+
+```js
+class Book {
+  constructor(author) {
+    this._author = author;
+  }
+  // getter
+  get writer() {
+    return this._author;
+  }
+  // setter
+  set writer(updatedAuthor) {
+    this._author = updatedAuthor;
+  }
+}
+const novel = new Book('anonymous');
+console.log(novel.writer);
+novel.writer = 'newAuthor';
+console.log(novel.writer);
+```
+
+The console would display the strings `anonymous` and `newAuthor`.
+
+Notice the syntax used to invoke the getter and setter. They do not even look like functions. Getters and setters are important because they hide internal implementation details.
+
+**Note:** It is convention to precede the name of a private variable with an underscore (`_`). However, the practice itself does not make a variable private.
+
+# --instructions--
+
+Use the `class` keyword to create a `Thermostat` class. The `constructor` accepts a Fahrenheit temperature.
+
+In the class, create a `getter` to obtain the temperature in Celsius and a `setter` to set the temperature in Celsius.
+
+Remember that `C = 5/9 * (F - 32)` and `F = C * 9.0 / 5 + 32`, where `F` is the value of temperature in Fahrenheit, and `C` is the value of the same temperature in Celsius.
+
+**Note:** When you implement this, you will track the temperature inside the class in one scale, either Fahrenheit or Celsius.
+
+This is the power of a getter and a setter. You are creating an API for another user, who can get the correct result regardless of which one you track.
+
+In other words, you are abstracting implementation details from the user.
+
+# --hints--
+
+`Thermostat` should be a `class` with a defined `constructor` method.
+
+```js
+assert(
+  typeof Thermostat === 'function' &&
+    typeof Thermostat.constructor === 'function'
+);
+```
+
+`class` keyword should be used.
+
+```js
+assert(code.match(/class/g));
+```
+
+`Thermostat` should be able to be instantiated.
+
+```js
+assert(
+  (() => {
+    const t = new Thermostat(122);
+    return typeof t === 'object';
+  })()
+);
+```
+
+When instantiated with a Fahrenheit value, `Thermostat` should set the correct `temperature`.
+
+```js
+assert(
+  (() => {
+    const t = new Thermostat(122);
+    return t.temperature === 50;
+  })()
+);
+```
+
+A `getter` should be defined.
+
+```js
+assert(
+  (() => {
+    const desc = Object.getOwnPropertyDescriptor(
+      Thermostat.prototype,
+      'temperature'
+    );
+    return !!desc && typeof desc.get === 'function';
+  })()
+);
+```
+
+A `setter` should  be defined.
+
+```js
+assert(
+  (() => {
+    const desc = Object.getOwnPropertyDescriptor(
+      Thermostat.prototype,
+      'temperature'
+    );
+    return !!desc && typeof desc.set === 'function';
+  })()
+);
+```
+
+Calling the `setter` with a Celsius value should set the `temperature`.
+
+```js
+assert(
+  (() => {
+    const t = new Thermostat(32);
+    t.temperature = 26;
+    const u = new Thermostat(32);
+    u.temperature = 50;
+    return t.temperature === 26 && u.temperature === 50;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+
+// Only change code above this line
+
+const thermos = new Thermostat(76); // Setting in Fahrenheit scale
+let temp = thermos.temperature; // 24.44 in Celsius
+thermos.temperature = 26;
+temp = thermos.temperature; // 26 in Celsius
+```
+
+# --solutions--
+
+```js
+class Thermostat {
+  constructor(fahrenheit) {
+    this._tempInCelsius = 5/9 * (fahrenheit - 32);
+  }
+  get temperature(){
+    return this._tempInCelsius;
+  }
+  set temperature(newTemp){
+    this._tempInCelsius = newTemp;
+  }
+}
+
+const thermos = new Thermostat(76); // Setting in Fahrenheit scale
+let temp = thermos.temperature; // 24.44 in Celsius
+thermos.temperature = 26;
+temp = thermos.temperature; // 26 in Celsius
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-rest-parameter-with-function-parameters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-rest-parameter-with-function-parameters.md
new file mode 100644
index 0000000000..2f7fe5e546
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-rest-parameter-with-function-parameters.md
@@ -0,0 +1,80 @@
+---
+id: 587d7b88367417b2b2512b47
+title: Use the Rest Parameter with Function Parameters
+challengeType: 1
+forumTopicId: 301221
+dashedName: use-the-rest-parameter-with-function-parameters
+---
+
+# --description--
+
+In order to help us create more flexible functions, ES6 introduces the <dfn>rest parameter</dfn> for function parameters. With the rest parameter, 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:
+
+```js
+function howMany(...args) {
+  return "You have passed " + args.length + " arguments.";
+}
+console.log(howMany(0, 1, 2));
+console.log(howMany("string", null, [1, 2, 3], { }));
+```
+
+The console would display the strings `You have passed 3 arguments.` and `You have passed 4 arguments.`.
+
+The rest parameter eliminates the need to check the `args` array and allows us to apply `map()`, `filter()` and `reduce()` on the parameters array.
+
+# --instructions--
+
+Modify the function `sum` using the rest parameter in such a way that the function `sum` is able to take any number of arguments and return their sum.
+
+# --hints--
+
+The result of `sum(0,1,2)` should be 3
+
+```js
+assert(sum(0, 1, 2) === 3);
+```
+
+The result of `sum(1,2,3,4)` should be 10
+
+```js
+assert(sum(1, 2, 3, 4) === 10);
+```
+
+The result of `sum(5)` should be 5
+
+```js
+assert(sum(5) === 5);
+```
+
+The result of `sum()` should be 0
+
+```js
+assert(sum() === 0);
+```
+
+`sum` should be an arrow function which uses the rest parameter syntax (`...`) on the `args` parameter.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/sum=\(\.\.\.args\)=>/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const sum = (x, y, z) => {
+  const args = [x, y, z];
+  return args.reduce((a, b) => a + b, 0);
+}
+```
+
+# --solutions--
+
+```js
+const sum = (...args) => {
+  return args.reduce((a, b) => a + b, 0);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-spread-operator-to-evaluate-arrays-in-place.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-spread-operator-to-evaluate-arrays-in-place.md
new file mode 100644
index 0000000000..d2aa718923
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/use-the-spread-operator-to-evaluate-arrays-in-place.md
@@ -0,0 +1,84 @@
+---
+id: 587d7b89367417b2b2512b48
+title: Use the Spread Operator to Evaluate Arrays In-Place
+challengeType: 1
+forumTopicId: 301222
+dashedName: 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 `apply()` to compute the maximum value in an array:
+
+```js
+var arr = [6, 89, 3, 45];
+var maximus = Math.max.apply(null, arr);
+```
+
+`maximus` would have a value of `89`.
+
+We had to use `Math.max.apply(null, arr)` because `Math.max(arr)` returns `NaN`. `Math.max()` expects comma-separated arguments, but not an array. The spread operator makes this syntax much better to read and maintain.
+
+```js
+const arr = [6, 89, 3, 45];
+const maximus = Math.max(...arr);
+```
+
+`maximus` would have a value of `89`.
+
+`...arr` returns an unpacked array. In other words, it *spreads* 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:
+
+```js
+const spreaded = ...arr;
+```
+
+# --instructions--
+
+Copy all contents of `arr1` into another array `arr2` using the spread operator.
+
+# --hints--
+
+`arr2` should be correct copy of `arr1`.
+
+```js
+assert(arr2.every((v, i) => v === arr1[i]) && arr2.length);
+```
+
+`...` spread operator should be used to duplicate `arr1`.
+
+```js
+assert(code.match(/Array\(\s*\.\.\.arr1\s*\)|\[\s*\.\.\.arr1\s*\]/));
+```
+
+`arr2` should remain unchanged when `arr1` is changed.
+
+```js
+assert((arr1, arr2) => {
+  arr1.push('JUN');
+  return arr2.length < arr1.length;
+});
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const arr1 = ['JAN', 'FEB', 'MAR', 'APR', 'MAY'];
+let arr2;
+
+arr2 = [];  // Change this line
+
+console.log(arr2);
+```
+
+# --solutions--
+
+```js
+const arr1 = ['JAN', 'FEB', 'MAR', 'APR', 'MAY'];
+let arr2;
+
+arr2 = [...arr1];
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-arrow-functions-with-parameters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-arrow-functions-with-parameters.md
new file mode 100644
index 0000000000..1d919e2481
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-arrow-functions-with-parameters.md
@@ -0,0 +1,94 @@
+---
+id: 587d7b88367417b2b2512b44
+title: Write Arrow Functions with Parameters
+challengeType: 1
+forumTopicId: 301223
+dashedName: write-arrow-functions-with-parameters
+---
+
+# --description--
+
+Just like a regular function, you can pass arguments into an arrow function.
+
+```js
+const doubler = (item) => item * 2;
+doubler(4);
+```
+
+`doubler(4)` would return the value `8`.
+
+If an arrow function has a single parameter, the parentheses enclosing the parameter may be omitted.
+
+```js
+const doubler = item => item * 2;
+```
+
+It is possible to pass more than one argument into an arrow function.
+
+```js
+const multiplier = (item, multi) => item * multi;
+multiplier(4, 2);
+```
+
+`multiplier(4, 2)` would return the value `8`.
+
+# --instructions--
+
+Rewrite the `myConcat` function which appends contents of `arr2` to `arr1` so that the function uses arrow function syntax.
+
+# --hints--
+
+You should replace the `var` keyword.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/var/g));
+```
+
+`myConcat` should be a constant variable (by using `const`).
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/const\s+myConcat/g));
+```
+
+`myConcat` should be an arrow function with two parameters
+
+```js
+assert(
+  /myConcat=\(\w+,\w+\)=>/.test(code.replace(/\s/g, '')) &&
+    typeof myConcat === 'function'
+);
+```
+
+`myConcat()` should return `[1, 2, 3, 4, 5]`.
+
+```js
+assert.deepEqual(myConcat([1, 2], [3, 4, 5]), [1, 2, 3, 4, 5]);
+```
+
+The `function` keyword should not be used.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/function/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var myConcat = function(arr1, arr2) {
+  return arr1.concat(arr2);
+};
+
+console.log(myConcat([1, 2], [3, 4, 5]));
+```
+
+# --solutions--
+
+```js
+const myConcat = (arr1, arr2) =>  {
+  return arr1.concat(arr2);
+};
+
+console.log(myConcat([1, 2], [3, 4, 5]));
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
new file mode 100644
index 0000000000..4c319f7bf1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-declarative-functions-with-es6.md
@@ -0,0 +1,86 @@
+---
+id: 587d7b8b367417b2b2512b50
+title: Write Concise Declarative Functions with ES6
+challengeType: 1
+forumTopicId: 301224
+dashedName: write-concise-declarative-functions-with-es6
+---
+
+# --description--
+
+When defining functions within objects in ES5, we have to use the keyword `function` as follows:
+
+```js
+const person = {
+  name: "Taylor",
+  sayHello: function() {
+    return `Hello! My name is ${this.name}.`;
+  }
+};
+```
+
+With ES6, you can remove the `function` keyword and colon altogether when defining functions in objects. Here's an example of this syntax:
+
+```js
+const person = {
+  name: "Taylor",
+  sayHello() {
+    return `Hello! My name is ${this.name}.`;
+  }
+};
+```
+
+# --instructions--
+
+Refactor the function `setGear` inside the object `bicycle` to use the shorthand syntax described above.
+
+# --hints--
+
+Traditional function expression should not be used.
+
+```js
+(getUserInput) => assert(!code.match(/function/));
+```
+
+`setGear` should be a declarative function.
+
+```js
+assert(
+  typeof bicycle.setGear === 'function' && code.match(/setGear\s*\(.+\)\s*\{/)
+);
+```
+
+`bicycle.setGear(48)` should change the `gear` value to 48.
+
+```js
+assert(new bicycle.setGear(48).gear === 48);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+const bicycle = {
+  gear: 2,
+  setGear: function(newGear) {
+    this.gear = newGear;
+  }
+};
+// Only change code above this line
+bicycle.setGear(3);
+console.log(bicycle.gear);
+```
+
+# --solutions--
+
+```js
+const bicycle = {
+  gear: 2,
+  setGear(newGear) {
+    this.gear = newGear;
+  }
+};
+bicycle.setGear(3);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-object-literal-declarations-using-object-property-shorthand.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-object-literal-declarations-using-object-property-shorthand.md
new file mode 100644
index 0000000000..33dabc5d3a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/es6/write-concise-object-literal-declarations-using-object-property-shorthand.md
@@ -0,0 +1,75 @@
+---
+id: 587d7b8a367417b2b2512b4f
+title: Write Concise Object Literal Declarations Using Object Property Shorthand
+challengeType: 1
+forumTopicId: 301225
+dashedName: write-concise-object-literal-declarations-using-object-property-shorthand
+---
+
+# --description--
+
+ES6 adds some nice support for easily defining object literals.
+
+Consider the following code:
+
+```js
+const getMousePosition = (x, y) => ({
+  x: x,
+  y: y
+});
+```
+
+`getMousePosition` is a simple function that returns an object containing two properties. ES6 provides the syntactic sugar to eliminate the redundancy of having to write `x: x`. You can simply write `x` once, and it will be converted to`x: x` (or something equivalent) under the hood. Here is the same function from above rewritten to use this new syntax:
+
+```js
+const getMousePosition = (x, y) => ({ x, y });
+```
+
+# --instructions--
+
+Use object property shorthand with object literals to create and return an object with `name`, `age` and `gender` properties.
+
+# --hints--
+
+`createPerson("Zodiac Hasbro", 56, "male")` should return `{name: "Zodiac Hasbro", age: 56, gender: "male"}`.
+
+```js
+assert.deepEqual(
+  { name: 'Zodiac Hasbro', age: 56, gender: 'male' },
+  createPerson('Zodiac Hasbro', 56, 'male')
+);
+```
+
+Your code should not use `key:value`.
+
+```js
+(getUserInput) => assert(!getUserInput('index').match(/:/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const createPerson = (name, age, gender) => {
+  // Only change code below this line
+  return {
+    name: name,
+    age: age,
+    gender: gender
+  };
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+const createPerson = (name, age, gender) => {
+  return {
+    name,
+    age,
+    gender
+  };
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-001.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-001.md
new file mode 100644
index 0000000000..a07d71fd5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-001.md
@@ -0,0 +1,76 @@
+---
+id: 5d79253297c0ebb149ea9fed
+title: Part 1
+challengeType: 0
+dashedName: part-1
+---
+
+# --description--
+
+In functional programming, we prefer immutable values over mutable values.
+
+Mutable values (declared with `var` or `let`) can lead to unexpected behaviors and bugs. Values declared with `const` cannot be reassigned, which makes using them easier because you don't have to keep track of their values.
+
+Start by creating an empty `infixToFunction` object using `const`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constinfixToFunction={}'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-002.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-002.md
new file mode 100644
index 0000000000..d606fa81f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-002.md
@@ -0,0 +1,78 @@
+---
+id: 5d7925323be8848dbc58a07a
+title: Part 2
+challengeType: 0
+dashedName: part-2
+---
+
+# --description--
+
+Above `infixToFunction`, define an empty function `add` using the `function` keyword. It should accept two parameters, `x` and `y`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('functionadd(x,y){}'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+function add(x, y) {
+
+}
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-003.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-003.md
new file mode 100644
index 0000000000..647d15759d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-003.md
@@ -0,0 +1,82 @@
+---
+id: 5d792532f631702ae6d23e11
+title: Part 3
+challengeType: 0
+dashedName: part-3
+---
+
+# --description--
+
+Now return the sum of `x` and `y` using the `return` keyword.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(add(1, 2) === 3 && add(100, 2000) === 2100);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+function add(x, y) {
+
+}
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+function add(x, y) {
+  return x + y;
+}
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-004.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-004.md
new file mode 100644
index 0000000000..dae790c420
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-004.md
@@ -0,0 +1,86 @@
+---
+id: 5d7925329445167ecc2ac9c9
+title: Part 4
+challengeType: 0
+dashedName: part-4
+---
+
+# --description--
+
+In JavaScript, functions are first class. This means that they can be used like any other values - for example, they can be assigned to variables.
+
+Assign `add` to a new variable `addVar`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constaddVar=add'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+function add(x, y) {
+  return x + y;
+}
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+function add(x, y) {
+  return x + y;
+}
+
+const addVar = add;
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-005.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-005.md
new file mode 100644
index 0000000000..af810c3b9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-005.md
@@ -0,0 +1,92 @@
+---
+id: 5d792532b07918c3a5904913
+title: Part 5
+challengeType: 0
+dashedName: part-5
+---
+
+# --description--
+
+Anonymous functions are functions without names - they are used only once and then forgotten. The syntax is the same as for normal functions but without the name:
+
+```js
+function(x) {
+  return x
+}
+```
+
+First, remove the `addVar` definition.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(!code.replace(/\s/g, '').includes('constaddVar=add'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+function add(x, y) {
+  return x + y;
+}
+
+const addVar = add;
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+function add(x, y) {
+  return x + y;
+}
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-006.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-006.md
new file mode 100644
index 0000000000..de60cac762
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-006.md
@@ -0,0 +1,92 @@
+---
+id: 5d792533cc8b18b6c133edc7
+title: Part 6
+challengeType: 0
+dashedName: part-6
+---
+
+# --description--
+
+Anonymous functions are often passed as arguments to other functions, but what if you want to call one later? You can assign anonymous functions to variables and call them with the variable's name:
+
+```js
+const fn = function(x) {
+  return x;
+}
+
+fn();
+```
+
+Assign the anonymous function to the variable `addVar`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constaddVar=function(x,y){returnx+y'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+function add(x, y) {
+  return x + y;
+}
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const addVar = function(x, y) {
+  return x + y;
+};
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-007.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-007.md
new file mode 100644
index 0000000000..d0b9f3ab38
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-007.md
@@ -0,0 +1,88 @@
+---
+id: 5d7925337954ed57a565a135
+title: Part 7
+challengeType: 0
+dashedName: part-7
+---
+
+# --description--
+
+This is possible because the anonymous function has been immediately assigned to a value - this is effectively the same as using a named function.
+
+Rewrite `addVar` using ES6's arrow syntax:
+
+```js
+const fn = (x, y) => x;
+```
+
+Note that the value is returned implicitly.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constaddVar=(x,y)=>x+y'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const addVar = function(x, y) {
+  return x + y;
+};
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-008.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-008.md
new file mode 100644
index 0000000000..1251a61d04
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-008.md
@@ -0,0 +1,80 @@
+---
+id: 5d79253352e33dd59ec2f6de
+title: Part 8
+challengeType: 0
+dashedName: part-8
+---
+
+# --description--
+
+Add the key `+` to `infixToFunction` and assign it the value `addVar`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(infixToFunction['+'].toString() === addVar.toString());
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {
+  "+": addVar
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-009.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-009.md
new file mode 100644
index 0000000000..b7b8112705
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-009.md
@@ -0,0 +1,82 @@
+---
+id: 5d792533d31e4f7fad33011d
+title: Part 9
+challengeType: 0
+dashedName: part-9
+---
+
+# --description--
+
+In `infixToFunction`, replace `addVar` with `(x, y) => x + y`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/\+["']:\(x,y\)=>x\+y/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {
+  "+": addVar
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {
+  "+": (x, y) => x + y
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-010.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-010.md
new file mode 100644
index 0000000000..f9b66cf731
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-010.md
@@ -0,0 +1,80 @@
+---
+id: 5d792533e7707b9645d7b540
+title: Part 10
+challengeType: 0
+dashedName: part-10
+---
+
+# --description--
+
+Remove the now redundant `addVar` definition.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof addVar === 'undefined');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const addVar = (x, y) => x + y;
+
+const infixToFunction = {
+  "+": (x, y) => x + y
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-011.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-011.md
new file mode 100644
index 0000000000..90a6a432c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-011.md
@@ -0,0 +1,85 @@
+---
+id: 5d79253378595ec568f70ab6
+title: Part 11
+challengeType: 0
+dashedName: part-11
+---
+
+# --description--
+
+Add similar definitions for `-`, `*` and `/` in `infixToFunction`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  infixToFunction['-'](10, 2) === 8 &&
+    infixToFunction['*'](10, 10) === 100 &&
+    infixToFunction['/'](100, 10) === 10
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-012.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-012.md
new file mode 100644
index 0000000000..8fa7ce4708
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-012.md
@@ -0,0 +1,90 @@
+---
+id: 5d7925330918ae4a2f282e7e
+title: Part 12
+challengeType: 0
+dashedName: part-12
+---
+
+# --description--
+
+Use arrow function syntax to define a function `infixEval` which takes `str` and `regex` as arguments and returns `str.replace(regex, "")`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constinfixEval=\(str,regex\)=>str\.replace\(regex,['"]{2}\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) => str.replace(regex, "");
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-013.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-013.md
new file mode 100644
index 0000000000..c4d07bd668
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-013.md
@@ -0,0 +1,96 @@
+---
+id: 5d792533ed00e75d129e1b18
+title: Part 13
+challengeType: 0
+dashedName: part-13
+---
+
+# --description--
+
+`replace` is a higher order function because it can take a function as argument (higher order functions can also return functions).
+
+Pass the `+` function from `infixToFunction` to the `replace` method as the second argument.
+
+This is how you would pass the `-` function:
+
+```js
+str.replace(regex, infixToFunction["-"])
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(infixEval('ab', /(a)b/) === 'aba');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) => str.replace(regex, "");
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) => str.replace(regex, infixToFunction["+"]);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-014.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-014.md
new file mode 100644
index 0000000000..68c6d5ee0c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-014.md
@@ -0,0 +1,95 @@
+---
+id: 5d792533a5c42fb4d1a4b70d
+title: Part 14
+challengeType: 0
+dashedName: part-14
+---
+
+# --description--
+
+Replace the second argument of `str.replace` with an anonymous function, which takes `match`, `arg1`, `fn`, and `arg2`, and returns `infixToFunction["+"]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('str.replace(regex,(match,arg1,fn,arg2)=>infixToFunction["+"])')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) => str.replace(regex, infixToFunction["+"]);
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction["+"]
+  );
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-015.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-015.md
new file mode 100644
index 0000000000..822205dcc1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-015.md
@@ -0,0 +1,100 @@
+---
+id: 5d79253358e8f646cbeb2bb0
+title: Part 15
+challengeType: 0
+dashedName: part-15
+---
+
+# --description--
+
+Change the `"+"` in the call to `infixToFunction` to `fn`.
+
+`fn` is the operator that the user inputs (`+`, `-`, `*` or `/`) - we use `infixToFunction` to get the function that corresponds to it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('str.replace(regex,(match,arg1,fn,arg2)=>infixToFunction[fn])')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction["+"]
+  );
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction[fn]
+  );
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-016.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-016.md
new file mode 100644
index 0000000000..fafef384b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-016.md
@@ -0,0 +1,102 @@
+---
+id: 5d792533bb38fab70b27f527
+title: Part 16
+challengeType: 0
+dashedName: part-16
+---
+
+# --description--
+
+`arg1` and `arg2` are the numbers input by the user in a string such as "1+3".
+
+Pass `parseFloat(arg1)` and `parseFloat(arg2)` as the arguments to `infixToFunction[fn]` (remember `infixToFunction[fn]` is a function).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+const regex = /([0-9.]+)([+-\/*])([0-9.]+)/;
+assert(
+  infixEval('23+35', regex) === '58' &&
+    infixEval('100-20', regex) === '80' &&
+    infixEval('10*10', regex) === '100' &&
+    infixEval('120/6', regex) === '20'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction[fn]
+  );
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-017.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-017.md
new file mode 100644
index 0000000000..239bec2a6c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-017.md
@@ -0,0 +1,98 @@
+---
+id: 5d79253386060ed9eb04a070
+title: Part 17
+challengeType: 0
+dashedName: part-17
+---
+
+# --description--
+
+The `match` parameter is currently unused, which can lead to unused variable warnings in some linters.
+
+To fix this, prefix or replace it with an underscore (`_`) - both ways signal to the reader and linter that you're aware you don't need this.
+
+Note that a single underscore can only be used once in a function and may conflict with some libraries (Lodash, Underscore.js).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('str.replace(regex,(_'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (match, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-018.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-018.md
new file mode 100644
index 0000000000..a741e0099b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-018.md
@@ -0,0 +1,101 @@
+---
+id: 5d792533717672657b81aa69
+title: Part 18
+challengeType: 0
+dashedName: part-18
+---
+
+# --description--
+
+When defining an arrow function with a single argument, the parentheses can be omitted:
+
+```js
+const greeting = name => `Hello !`;
+```
+
+Define a function `highPrecedence` which takes a single argument `str` and returns it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(highPrecedence('a') === 'a');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2)));
+
+const highPrecedence = str => str;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-019.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-019.md
new file mode 100644
index 0000000000..df724f07d5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-019.md
@@ -0,0 +1,108 @@
+---
+id: 5d7925335ab63018dcec11fe
+title: Part 19
+challengeType: 0
+dashedName: part-19
+---
+
+# --description--
+
+Arrow functions can have multiple statements:
+
+```js
+const fn = (x, y) => {
+  const result = x + y;
+  return result; // explicit return statement required
+};
+```
+
+Use this syntax for the `highPrecedence` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('highPrecedence=str=>{returnstr'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2)));
+
+const highPrecedence = str => str;
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  return str;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-020.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-020.md
new file mode 100644
index 0000000000..65d7ed32a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-020.md
@@ -0,0 +1,103 @@
+---
+id: 5d7925330f300c342315066d
+title: Part 20
+challengeType: 0
+dashedName: part-20
+---
+
+# --description--
+
+In `highPrecedence`, define `regex` to be `/([0-9.]+)([*\/])([0-9.]+)/`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('regex=/([0-9.]+)([*\\/])([0-9.]+)/'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  return str;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  return str;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-021.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-021.md
new file mode 100644
index 0000000000..677a211245
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-021.md
@@ -0,0 +1,105 @@
+---
+id: 5d792533aa6443215c9b16bf
+title: Part 21
+challengeType: 0
+dashedName: part-21
+---
+
+# --description--
+
+Now, assign the result of calling `infixEval` with `str` and `regex` to `str2`. Return `str2`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(highPrecedence('7*6') === '42' && highPrecedence('50/25') === '2');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  return str;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str2;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-022.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-022.md
new file mode 100644
index 0000000000..0b9f1a5302
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-022.md
@@ -0,0 +1,118 @@
+---
+id: 5d7925334c5e22586dd72962
+title: Part 22
+challengeType: 0
+dashedName: part-22
+---
+
+# --description--
+
+The ternary operator has the following syntax:
+
+```js
+const result = condition ? valueIfTrue : valueIfFalse;
+const result = 1 === 1 ? 1 : 0; // 1
+const result = 9 > 10 ? "Yes" : "No"; // "No"
+```
+
+Use this operator to return `str` if `str === str2`, and an empty string (`""`) otherwise.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  highPrecedence('2*2') === '' &&
+    highPrecedence('2+2') === '2+2' &&
+    code.includes('?')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str2;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : "";
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-023.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-023.md
new file mode 100644
index 0000000000..a04e721fb2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-023.md
@@ -0,0 +1,112 @@
+---
+id: 5d79253307ecd49e030bdcd1
+title: Part 23
+challengeType: 0
+dashedName: part-23
+---
+
+# --description--
+
+Recursion is when a function calls itself. We often use it instead of `while`/`for` loops, as loops usually involve mutable state.
+
+Replace the empty string in `highPrecedence` with a call to `highPrecedence` with `str2` as argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  highPrecedence('2*2*2') === '8' &&
+    highPrecedence('2*2') === '4' &&
+    highPrecedence('2+2') === '2+2'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : "";
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-024.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-024.md
new file mode 100644
index 0000000000..2aa72f9fde
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-024.md
@@ -0,0 +1,110 @@
+---
+id: 5d792534257122211d3043af
+title: Part 24
+challengeType: 0
+dashedName: part-24
+---
+
+# --description--
+
+Define an object `spreadsheetFunctions`, with a single key - an empty string (`""`). The corresponding value should be the function `x => x`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(spreadsheetFunctions['']('x') === 'x');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-025.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-025.md
new file mode 100644
index 0000000000..f568ad3feb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-025.md
@@ -0,0 +1,118 @@
+---
+id: 5d7925346f4f2da6df4354a6
+title: Part 25
+challengeType: 0
+dashedName: part-25
+---
+
+# --description--
+
+Define an empty function `applyFn` which takes an argument `str`. Use the curly brace syntax with an anonymous function. Do not wrap parentheses around the parameter.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constapplyFn=str=>{}'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-026.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-026.md
new file mode 100644
index 0000000000..8a2bfc2bc6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-026.md
@@ -0,0 +1,126 @@
+---
+id: 5d792534cac2dbe0a719ea7a
+title: Part 26
+challengeType: 0
+dashedName: part-26
+---
+
+# --description--
+
+Set `noHigh` to `highPrecedence(str)` in `applyFn`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('constapplyFn=str=>{constnoHigh=highPrecedence(str)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-027.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-027.md
new file mode 100644
index 0000000000..34bc2b288d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-027.md
@@ -0,0 +1,129 @@
+---
+id: 5d792534857332d07ccba3ad
+title: Part 27
+challengeType: 0
+dashedName: part-27
+---
+
+# --description--
+
+Set `infix` to `/([0-9.]+)([+-])([0-9.]+)/` in `applyFn`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constapplyFn=str=>{constnoHigh=highPrecedence(str);constinfix=/([0-9.]+)([+-])([0-9.]+)/'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-028.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-028.md
new file mode 100644
index 0000000000..2e5c445af1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-028.md
@@ -0,0 +1,131 @@
+---
+id: 5d792534d586ef495ea9df90
+title: Part 28
+challengeType: 0
+dashedName: part-28
+---
+
+# --description--
+
+Set `str2` to `infixEval(noHigh, infix)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constapplyFn=str=>{constnoHigh=highPrecedence(str);constinfix=/([0-9.]+)([+-])([0-9.]+)/;conststr2=infixEval(noHigh,infix)'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-029.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-029.md
new file mode 100644
index 0000000000..c151c5f91b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-029.md
@@ -0,0 +1,132 @@
+---
+id: 5d79253410532e13d13fe574
+title: Part 29
+challengeType: 0
+dashedName: part-29
+---
+
+# --description--
+
+Set `regex` to `/([a-z]*)\(([0-9., ]*)\)(?!.*\()/i` in `applyFn`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  applyFn
+    .toString()
+    .replace(/\s/g, '')
+    .includes('varregex=/([a-z]*)\\(([0-9.,]*)\\)(?!.*\\()/i')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-030.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-030.md
new file mode 100644
index 0000000000..6c0b270973
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-030.md
@@ -0,0 +1,136 @@
+---
+id: 5d7925342415527083bd6667
+title: Part 30
+challengeType: 0
+dashedName: part-30
+---
+
+# --description--
+
+The `split` method returns an array of strings from a larger string by using its argument to determine where to make each split:
+
+```js
+"a b c".split(" "); // ["a", "b", "c"];
+```
+
+Add a function `toNumberList` (inside `applyFn`) which takes an argument `args` and splits it by commas. Return `toNumberList`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(applyFn('')('foo,baz,bar')) === '["foo","baz","bar"]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",");
+  return toNumberList;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-031.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-031.md
new file mode 100644
index 0000000000..5496e05313
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-031.md
@@ -0,0 +1,140 @@
+---
+id: 5d792534c3d26890ac1484d4
+title: Part 31
+challengeType: 0
+dashedName: part-31
+---
+
+# --description--
+
+The `map` method takes a function and for each element of an array, it passes the element to the function and replace the element with the return value:
+
+```js
+[1, 2, 3].map(x => x + 1); // [2, 3, 4]
+```
+
+In `toNumberList`, chain the `map` method to `args.split(",")` and pass it `parseFloat` to parse each element of the array into a number.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('consttoNumberList=args=>args.split(",").map(parseFloat)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",");
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-032.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-032.md
new file mode 100644
index 0000000000..0ebf9a35f9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-032.md
@@ -0,0 +1,137 @@
+---
+id: 5d792534b92f3d1cd4410ce3
+title: Part 32
+challengeType: 0
+dashedName: part-32
+---
+
+# --description--
+
+Define a new function `applyFunction` (inside `applyFn`). It should take two arguments: `fn` and `args`, and should return `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'consttoNumberList=args=>args.split(",").map(parseFloat);constapplyFunction=(fn,args)=>spreadsheetFunctions'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) => spreadsheetFunctions;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-033.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-033.md
new file mode 100644
index 0000000000..cf487c21e0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-033.md
@@ -0,0 +1,138 @@
+---
+id: 5d7925341193948dfe6d76b4
+title: Part 33
+challengeType: 0
+dashedName: part-33
+---
+
+# --description--
+
+Now, instead of returning `spreadsheetFunctions`, use bracket notation and `fn.toLowerCase()` to get a specific function from `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'consttoNumberList=args=>args.split(",").map(parseFloat);constapplyFunction=(fn,args)=>spreadsheetFunctions[fn.toLowerCase()]'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) => spreadsheetFunctions;
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) => spreadsheetFunctions[fn.toLowerCase()];
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-034.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-034.md
new file mode 100644
index 0000000000..67d0591b16
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-034.md
@@ -0,0 +1,139 @@
+---
+id: 5d792534cf81365cfca58794
+title: Part 34
+challengeType: 0
+dashedName: part-34
+---
+
+# --description--
+
+Apply `toNumberList(args)` to `spreadsheetFunctions[fn.toLowerCase()]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'consttoNumberList=args=>args.split(",").map(parseFloat);constapplyFunction=(fn,args)=>spreadsheetFunctions[fn.toLowerCase()](toNumberList(args))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) => spreadsheetFunctions[fn.toLowerCase()];
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-035.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-035.md
new file mode 100644
index 0000000000..7ec1032c24
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-035.md
@@ -0,0 +1,137 @@
+---
+id: 5d7925348ee084278ff15556
+title: Part 35
+challengeType: 0
+dashedName: part-35
+---
+
+# --description--
+
+Note that `applyFunction` can access `toNumberList` from outside of itself. This is called lexical scoping - inner functions can access variables from outer functions.
+
+Now return `str2.replace(regex, "")` at the end of `applyFn`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(applyFn('2*2fn(1, 2, 3.3)') === '4');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(regex, "");
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-036.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-036.md
new file mode 100644
index 0000000000..14f81423a7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-036.md
@@ -0,0 +1,140 @@
+---
+id: 5d7925348a6a41c32f7a4e3e
+title: Part 36
+challengeType: 0
+dashedName: part-36
+---
+
+# --description--
+
+Replace the `""` in `str2.replace(regex, "")` with a function which takes `match`, `fn` and `args` as arguments and returns `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('returnstr2.replace(regex,(match,fn,args)=>spreadsheetFunctions)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(regex, "");
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(regex, (match, fn, args) => spreadsheetFunctions);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-037.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-037.md
new file mode 100644
index 0000000000..e96d38723a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-037.md
@@ -0,0 +1,148 @@
+---
+id: 5d792534408c5be896b0a46e
+title: Part 37
+challengeType: 0
+dashedName: part-37
+---
+
+# --description--
+
+The `hasOwnProperty` method checks if a key exists in an object. So `spreadsheetFunctions.hasOwnProperty("")` would return `true`, but replacing `""` with anything else would make it return `false`.
+
+Chain `hasOwnProperty` to `spreadsheetFunctions` to check if the `fn.toLowerCase()` key exists in `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'returnstr2.replace(regex,(match,fn,args)=>spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(regex, (match, fn, args) => spreadsheetFunctions);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase())
+  );
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-038.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-038.md
new file mode 100644
index 0000000000..910fe39b53
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-038.md
@@ -0,0 +1,144 @@
+---
+id: 5d792534f0eda837510e9192
+title: Part 38
+challengeType: 0
+dashedName: part-38
+---
+
+# --description--
+
+Now use the ternary operator in the last line to return `applyFunction(fn, args)` if the statement is true, and `match` otherwise.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(applyFn('2+2*2') === '6' && applyFn('(2+2)*2') === '4*2');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase())
+  );
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-039.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-039.md
new file mode 100644
index 0000000000..e8ddd4a988
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-039.md
@@ -0,0 +1,148 @@
+---
+id: 5d7925346b911fce161febaf
+title: Part 39
+challengeType: 0
+dashedName: part-39
+---
+
+# --description--
+
+Now define an empty function `range` which takes `start` and `end` as arguments (define it in the global scope).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constrange=(start,end)=>'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-040.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-040.md
new file mode 100644
index 0000000000..32c88b8d2b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-040.md
@@ -0,0 +1,156 @@
+---
+id: 5d79253483eada4dd69258eb
+title: Part 40
+challengeType: 0
+dashedName: part-40
+---
+
+# --description--
+
+`range` should set `arr` to `[start]` and should then return `arr`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').includes('constarr=[start]') &&
+    JSON.stringify(range(1)) === '[1]'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-041.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-041.md
new file mode 100644
index 0000000000..843c12b735
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-041.md
@@ -0,0 +1,155 @@
+---
+id: 5d7925342b2b993ef18cd45f
+title: Part 41
+challengeType: 0
+dashedName: part-41
+---
+
+# --description--
+
+After declaring `arr`, but before returning it, `range` should use the `push` method to add `end` onto `arr`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(range(1, 2)) === '[1,2]' && code.includes('push'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr;
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  arr.push(end);
+  return arr;
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-042.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-042.md
new file mode 100644
index 0000000000..9ddaa8e8c4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-042.md
@@ -0,0 +1,168 @@
+---
+id: 5d7925341747ad42b12f8e68
+title: Part 42
+challengeType: 0
+dashedName: part-42
+---
+
+# --description--
+
+This is still valid because we're modifying `arr` in place instead of reassigning to it (which is invalid with the `const` keyword). But doing this still modifies state, and we don't want to do that in functional programming.
+
+The `concat` method returns a new array instead of modifying an existing one:
+
+```js
+[1,2,3].concat(4); // [1, 2, 3, 4]
+[1,2,3].concat(4, 5); // [1, 2, 3, 4, 5]
+```
+
+Use `concat` instead of `push` to return the result of adding `end` to `arr`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(range(1, 2)) === '[1,2]' &&
+    code.includes('concat') &&
+    !code.includes('push')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  arr.push(end);
+  return arr;
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr.concat(end);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-043.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-043.md
new file mode 100644
index 0000000000..9ddf9141d3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-043.md
@@ -0,0 +1,161 @@
+---
+id: 5d792535b0b3c198ee3ed6f9
+title: Part 43
+challengeType: 0
+dashedName: part-43
+---
+
+# --description--
+
+The `concat` method can also accept arrays:
+
+```js
+[1,2,3].concat([4, 5]); // [1, 2, 3, 4, 5]
+[1,2,3].concat([4, 5], [6, 7]); // [1, 2, 3, 4, 5, 6, 7]
+```
+
+Use this form of `concat` by passing an array with just `end` to it: `arr.concat([end])`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('returnarr.concat([end])'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr.concat(end);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr.concat([end]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-044.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-044.md
new file mode 100644
index 0000000000..4fd31514d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-044.md
@@ -0,0 +1,156 @@
+---
+id: 5d7925357a0533eb221b005d
+title: Part 44
+challengeType: 0
+dashedName: part-44
+---
+
+# --description--
+
+Replace the call to `arr` in `arr.concat([end])` with `[start]` and remove the `arr` variable and its definition.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  !code.includes('arr') &&
+    code.replace(/\s/g, '').includes('[start].concat([end])')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  const arr = [start];
+  return arr.concat([end]);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return [start].concat([end]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-045.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-045.md
new file mode 100644
index 0000000000..b099301946
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-045.md
@@ -0,0 +1,155 @@
+---
+id: 5d792535591db67ee15b4106
+title: Part 45
+challengeType: 0
+dashedName: part-45
+---
+
+# --description--
+
+Use the ternary operator to return `[]` if `start > end` and `[start].concat([end])` otherwise.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(range(3, 2)) === '[]' &&
+    JSON.stringify(range(1, 3)) === '[1,3]'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return [start].concat([end]);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return start > end ? [] : [start].concat([end]);
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-046.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-046.md
new file mode 100644
index 0000000000..44e09a7c9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-046.md
@@ -0,0 +1,152 @@
+---
+id: 5d792535f1f7adf77de5831d
+title: Part 46
+challengeType: 0
+dashedName: part-46
+---
+
+# --description--
+
+Replace `[end]` with a recursive call to `range`: `[start].concat(range(start + 1, end))`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(range(1, 5)) === '[1,2,3,4,5]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return start > end ? [] : [start].concat([end]);
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return start > end ? [] : [start].concat(range(start + 1, end));
+}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-047.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-047.md
new file mode 100644
index 0000000000..c47ac9594f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-047.md
@@ -0,0 +1,157 @@
+---
+id: 5d7925353d2c505eafd50cd9
+title: Part 47
+challengeType: 0
+dashedName: part-47
+---
+
+# --description--
+
+Remove the curly braces and `return` keyword from `range`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constrange=(start,end)=>start>end?[]:[start].concat(range(start+1,end))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => {
+  return start > end ? [] : [start].concat(range(start + 1, end));
+}
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-048.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-048.md
new file mode 100644
index 0000000000..288bfd4f20
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-048.md
@@ -0,0 +1,152 @@
+---
+id: 5d79253539b5e944ba3e314c
+title: Part 48
+challengeType: 0
+dashedName: part-48
+---
+
+# --description--
+
+Define a function `charRange` which takes `start` and `end` as arguments. It should return `start`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constcharRange=(start,end)=>start'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => start;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-049.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-049.md
new file mode 100644
index 0000000000..f04d998459
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-049.md
@@ -0,0 +1,154 @@
+---
+id: 5d792535a4f1cbff7a8b9a0b
+title: Part 49
+challengeType: 0
+dashedName: part-49
+---
+
+# --description--
+
+Make `charRange` return `range(start, end)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(charRange(1, 5)) === '[1,2,3,4,5]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => start;
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start, end);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-050.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-050.md
new file mode 100644
index 0000000000..b8ff79a3c1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-050.md
@@ -0,0 +1,154 @@
+---
+id: 5d792535e3304f15a8890162
+title: Part 50
+challengeType: 0
+dashedName: part-50
+---
+
+# --description--
+
+Use the `charCodeAt(0)` method on `start` and `end` in `charRange`, like this: `start.charCodeAt(0)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(charRange('A', 'C')) === '[65,66,67]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start, end);
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start.charCodeAt(0), end.charCodeAt(0));
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-051.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-051.md
new file mode 100644
index 0000000000..2c1249ec71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-051.md
@@ -0,0 +1,158 @@
+---
+id: 5d792535a40ea5ac549d6804
+title: Part 51
+challengeType: 0
+dashedName: part-51
+---
+
+# --description--
+
+Chain `map` onto `range(start.charCodeAt(0), end.charCodeAt(0))`, with `x => x` as the argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('range(start.charCodeAt(0),end.charCodeAt(0)).map(x=>x)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start.charCodeAt(0), end.charCodeAt(0));
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start.charCodeAt(0), end.charCodeAt(0)).map(x => x);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-052.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-052.md
new file mode 100644
index 0000000000..8040420634
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-052.md
@@ -0,0 +1,157 @@
+---
+id: 5d7925358c220e5b2998909e
+title: Part 52
+challengeType: 0
+dashedName: part-52
+---
+
+# --description--
+
+Now, pass `x` to `String.fromCharCode` in the arrow function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(charRange('A', 'C')) === '["A","B","C"]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) => range(start.charCodeAt(0), end.charCodeAt(0)).map(x => x);
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-053.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-053.md
new file mode 100644
index 0000000000..bf05e022cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-053.md
@@ -0,0 +1,171 @@
+---
+id: 5d7925357729e183a49498aa
+title: Part 53
+challengeType: 0
+dashedName: part-53
+---
+
+# --description--
+
+Create a new function `evalFormula` which takes a single argument, `x`. Set `/([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi` to a variable named `rangeRegex`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constevalFormula=x=>{constrangeRegex=/([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-054.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-054.md
new file mode 100644
index 0000000000..ccb38b4bed
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-054.md
@@ -0,0 +1,174 @@
+---
+id: 5d79253555aa652afbb68086
+title: Part 54
+challengeType: 0
+dashedName: part-54
+---
+
+# --description--
+
+Define a function `rangeFromString` in `evalFormula` which takes `n1` and `n2` as arguments and returns `n1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /evalFormula.*constrangeFromString=\(n1,n2\)=>n1/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => n1;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-055.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-055.md
new file mode 100644
index 0000000000..71fc1817d8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-055.md
@@ -0,0 +1,174 @@
+---
+id: 5d79253582be306d339564f6
+title: Part 55
+challengeType: 0
+dashedName: part-55
+---
+
+# --description--
+
+Replace the `n1` return value in `rangeFromString` with `range(n1, n2)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /evalFormula.*constrangeFromString=\(n1,n2\)=>range\(n1,n2\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => n1;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(n1, n2);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-056.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-056.md
new file mode 100644
index 0000000000..49dc821958
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-056.md
@@ -0,0 +1,174 @@
+---
+id: 5d7925352047e5c54882c436
+title: Part 56
+challengeType: 0
+dashedName: part-56
+---
+
+# --description--
+
+As `n1` and `n2` are actually strings, replace `n1` and `n2` with `parseInt(n1)` and `parseInt(n2)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /evalFormula.*constrangeFromString=\(n1,n2\)=>range\(parseInt\(n1\),parseInt\(n2\)\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(n1, n2);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-057.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-057.md
new file mode 100644
index 0000000000..0156dce11a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-057.md
@@ -0,0 +1,175 @@
+---
+id: 5d79253568e441c0adf9db9f
+title: Part 57
+challengeType: 0
+dashedName: part-57
+---
+
+# --description--
+
+Now define a function `elemValue`, which takes an argument `n` and returns `n`. Use the curly brace arrow function syntax.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /evalFormula.*constelemValue=n=>\{returnn;?\}/.test(code.replace(/\s/g, ''))
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    return n;
+  };
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-058.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-058.md
new file mode 100644
index 0000000000..c3d88365c9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-058.md
@@ -0,0 +1,181 @@
+---
+id: 5d7925356ab117923b80c9cd
+title: Part 58
+challengeType: 0
+dashedName: part-58
+---
+
+# --description--
+
+Inside `elemValue`, define `fn` to be a function which takes `c` as argument and returns `document.getElementById(c + n).value`. Return `fn` instead of `n`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /elemValue.*constfn=\(?c\)?=>document\.getElementById\(c\+n\)\.value;?returnfn;?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    return n;
+  };
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-059.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-059.md
new file mode 100644
index 0000000000..90717f38f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-059.md
@@ -0,0 +1,181 @@
+---
+id: 5d792535e54a8cd729a0d708
+title: Part 59
+challengeType: 0
+dashedName: part-59
+---
+
+# --description--
+
+Now define `fn` to be `elemValue("1")` (inside `evalFormula` but outside `elemValue`). As `elemValue` returns a function, `fn` is also a function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /elemValue.*constfn=elemValue\(['"]1['"]\);?\}/.test(code.replace(/\s/g, ''))
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+  const fn = elemValue("1");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-060.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-060.md
new file mode 100644
index 0000000000..c640a7157d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-060.md
@@ -0,0 +1,185 @@
+---
+id: 5d7925353b307724a462b06b
+title: Part 60
+challengeType: 0
+dashedName: part-60
+---
+
+# --description--
+
+Finally, return `fn("A")`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /elemValue.*constfn=elemValue\(['"]1['"]\);?returnfn\(['"]A['"]\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+  const fn = elemValue("1");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-061.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-061.md
new file mode 100644
index 0000000000..dcda220719
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-061.md
@@ -0,0 +1,187 @@
+---
+id: 5d792536735f71d746ee5d99
+title: Part 61
+challengeType: 0
+dashedName: part-61
+---
+
+# --description--
+
+You might think that this wouldn't work because `fn` wouldn't have access to `n` after `elemValue` has finished executing. However, this works because of closures - functions have access to all variables declared at their time of creation.
+
+Inside `elemValue`, remove the variable `fn` and its definition, and replace `return fn` with `return c => document.getElementById(c + n).value`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('constelemValue=n=>{returnc=>document.getElementById(c+n).value')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    const fn = c => document.getElementById(c + n).value;
+    return fn;
+  };
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    return c => document.getElementById(c + n).value;
+  };
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-062.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-062.md
new file mode 100644
index 0000000000..4688244267
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-062.md
@@ -0,0 +1,182 @@
+---
+id: 5d792536ad340d9dff2e4a96
+title: Part 62
+challengeType: 0
+dashedName: part-62
+---
+
+# --description--
+
+Now, remove the curly braces and return statement.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constelemValue=n=>\(?c=>document\.getElementById\(c\+n\)\.value/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => {
+    return c => document.getElementById(c + n).value;
+  };
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => (c => document.getElementById(c + n).value);
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-063.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-063.md
new file mode 100644
index 0000000000..1591ad51d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-063.md
@@ -0,0 +1,181 @@
+---
+id: 5d7925369614afd92d01fed5
+title: Part 63
+challengeType: 0
+dashedName: part-63
+---
+
+# --description--
+
+You also don't need the parentheses in `elemValue` - it's parsed this way automatically. Remove them.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constelemValue=n=>c=>document\.getElementById\(c\+n\)\.value/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => (c => document.getElementById(c + n).value));
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-064.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-064.md
new file mode 100644
index 0000000000..fcadae3262
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-064.md
@@ -0,0 +1,180 @@
+---
+id: 5d792536504e68254fe02236
+title: Part 64
+challengeType: 0
+dashedName: part-64
+---
+
+# --description--
+
+The technique we just used is called currying - instead of taking multiple arguments, a function takes a single argument and return another function, which also takes a single argument.
+
+Define a new curried function, `addChars`, and set it equal to `c1 => c2 => c1 + c2`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constaddChars=c1=>c2=>c1+c2'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => c1 + c2
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-065.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-065.md
new file mode 100644
index 0000000000..5f1361ce97
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-065.md
@@ -0,0 +1,184 @@
+---
+id: 5d792536c8d2f0fdfad768fe
+title: Part 65
+challengeType: 0
+dashedName: part-65
+---
+
+# --description--
+
+You can add more arguments by simply adding another arrow with another argument name:
+
+```js
+const manyArguments = a => b => c => d => [a, b, c, d]
+```
+
+Add another argument to `addChars` and add it to the sum: `c1 => c2 => n => c1 + c2 + n`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('constaddChars=c1=>c2=>n=>c1+c2+n'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => c1 + c2
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => c1 + c2 + n
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-066.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-066.md
new file mode 100644
index 0000000000..ed6ce2aece
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-066.md
@@ -0,0 +1,180 @@
+---
+id: 5d79253639028b8ec56afcda
+title: Part 66
+challengeType: 0
+dashedName: part-66
+---
+
+# --description--
+
+Replace the body of `addChars`, so that instead of adding the arguments, it returns a `charRange` between the first two arguments: `c1 => c2 => n => charRange(c1, c2)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').includes('constaddChars=c1=>c2=>n=>charRange(c1,c2)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => c1 + c2 + n
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2)
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-067.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-067.md
new file mode 100644
index 0000000000..002ac9edb4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-067.md
@@ -0,0 +1,190 @@
+---
+id: 5d792536834f2fd93e84944f
+title: Part 67
+challengeType: 0
+dashedName: part-67
+---
+
+# --description--
+
+You call curried functions like this:
+
+```js
+const result = add(1)(2);
+```
+
+Use `map` on the `charRange` in `addChars`, passing in `x => elemValue(n)(x)` as the argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constaddChars=c1=>c2=>n=>charRange(c1,c2).map(x=>elemValue(n)(x))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2)
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(x => elemValue(n)(x));
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-068.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-068.md
new file mode 100644
index 0000000000..34db17da4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-068.md
@@ -0,0 +1,184 @@
+---
+id: 5d792536ddff9ea73c90a994
+title: Part 68
+challengeType: 0
+dashedName: part-68
+---
+
+# --description--
+
+However, you don't need an arrow function. As `elemValue(n)` is a function, you can pass it to `map` directly.
+
+Change `x => elemValue(n)(x)` to `elemValue(n)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('constaddChars=c1=>c2=>n=>charRange(c1,c2).map(elemValue(n))')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(x => elemValue(n)(x));
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const fn = elemValue("1");
+  return fn("A");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-069.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-069.md
new file mode 100644
index 0000000000..b8e784be5e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-069.md
@@ -0,0 +1,182 @@
+---
+id: 5d7925361596f84067904f7f
+title: Part 69
+challengeType: 0
+dashedName: part-69
+---
+
+# --description--
+
+Remove the `fn` declaration and return statement. Set `varRangeExpanded` to the result of using the `replace` method on `x`, with `rangeRegex` as the first argument and `""` as the second argument. Then, return it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  !code.includes('const fn') &&
+    code.includes('varRangeExpanded') &&
+    evalFormula('A1:J133') === '3'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const fn = elemValue("1");
+  return fn("A");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, "");
+  return varRangeExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-070.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-070.md
new file mode 100644
index 0000000000..68526cac21
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-070.md
@@ -0,0 +1,186 @@
+---
+id: 5d792536dd8a4daf255488ac
+title: Part 70
+challengeType: 0
+dashedName: part-70
+---
+
+# --description--
+
+Replace the `""` in `varRangeExpanded` with a function, which takes `match`, `c1`, `n1`, `c2` and `n2` as arguments, and returns `n1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constvarRangeExpanded=x.replace(rangeRegex,(match,c1,n1,c2,n2)=>n1)'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, "");
+  return varRangeExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    n1 
+  );
+  return varRangeExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-071.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-071.md
new file mode 100644
index 0000000000..ab3dcf48bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-071.md
@@ -0,0 +1,188 @@
+---
+id: 5d792536449c73004f265fb1
+title: Part 71
+challengeType: 0
+dashedName: part-71
+---
+
+# --description--
+
+Replace the `n1` return value in `varRangeExpanded` with `rangeFromString(n1, n2)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constvarRangeExpanded=x.replace(rangeRegex,(match,c1,n1,c2,n2)=>rangeFromString(n1,n2))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    n1 
+  );
+  return varRangeExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2)
+  );
+  return varRangeExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-072.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-072.md
new file mode 100644
index 0000000000..b80a304f66
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-072.md
@@ -0,0 +1,190 @@
+---
+id: 5d79253685fc69b8fe60a0d2
+title: Part 72
+challengeType: 0
+dashedName: part-72
+---
+
+# --description--
+
+Chain the `map` method to `rangeFromString(n1, n2)` and pass it `addChars(c1)(c2)` as an argument.
+
+This returns an `addChars` function, which has `c1` and `c2` (the characters) preset, and only needs a number (`n`) to be passed to it (which we get from the `rangeFromString` array).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constvarRangeExpanded=x.replace(rangeRegex,(match,c1,n1,c2,n2)=>rangeFromString(n1,n2).map(addChars(c1)(c2)))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2)
+  );
+  return varRangeExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  return varRangeExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-073.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-073.md
new file mode 100644
index 0000000000..fff03229b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-073.md
@@ -0,0 +1,186 @@
+---
+id: 5d792536dc6e3ab29525de9e
+title: Part 73
+challengeType: 0
+dashedName: part-73
+---
+
+# --description--
+
+The function in `varRangeExpanded` contains an unused argument. Replace or prefix it with an underscore.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('constvarRangeExpanded=x.replace(rangeRegex,(_')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (match, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  return varRangeExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  return varRangeExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-074.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-074.md
new file mode 100644
index 0000000000..5c4dc2d246
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-074.md
@@ -0,0 +1,188 @@
+---
+id: 5d792536cfd0fd893c630abb
+title: Part 74
+challengeType: 0
+dashedName: part-74
+---
+
+# --description--
+
+Set `varRegex` to `/[A-J][1-9][0-9]?/gi`. Then set `varExpanded` to the result of replacing `varRegex` with an empty string in `varRangeExpanded`. Return `varExpanded`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.includes('varRegex') &&
+    code.includes('varExpanded') &&
+    evalFormula('aC12bc') === 'abc'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  return varRangeExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(varRegex, "");
+  return varExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-075.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-075.md
new file mode 100644
index 0000000000..1f391b442e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-075.md
@@ -0,0 +1,195 @@
+---
+id: 5d7925366a5ff428fb483b40
+title: Part 75
+challengeType: 0
+dashedName: part-75
+---
+
+# --description--
+
+Replace the `""` in `varExpanded` with `match => document.getElementById(match.toUpperCase()).value`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constvarExpanded=varRangeExpanded.replace(varRegex,match=>document.getElementById(match.toUpperCase()).value)'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(varRegex, "");
+  return varExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  return varExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-076.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-076.md
new file mode 100644
index 0000000000..891d4a5da5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-076.md
@@ -0,0 +1,193 @@
+---
+id: 5d7925365d4035eeb2e395fd
+title: Part 76
+challengeType: 0
+dashedName: part-76
+---
+
+# --description--
+
+Set `functionExpanded` to `applyFn(varExpanded)` in `evalFormula`. Return `functionExpanded`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.includes('functionExpanded') && applyFn('2+2') === '4');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  return varExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-077.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-077.md
new file mode 100644
index 0000000000..5bb94f0fc4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-077.md
@@ -0,0 +1,198 @@
+---
+id: 5d7925364c106e9aaf05a16f
+title: Part 77
+challengeType: 0
+dashedName: part-77
+---
+
+# --description--
+
+`evalFormula` should return the value passed to it if this value remained unchanged. Otherwise, it should call itself with the latest value.
+
+Use the ternary operator in the last line of `evalFormula` to return `functionExpanded` if `x === functionExpanded` and `evalFormula(functionExpanded)` otherwise.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(evalFormula('(2+2)*2') === '8');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-078.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-078.md
new file mode 100644
index 0000000000..9247a03aec
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-078.md
@@ -0,0 +1,206 @@
+---
+id: 5d792536970cd8e819cc8a96
+title: Part 78
+challengeType: 0
+dashedName: part-78
+---
+
+# --description--
+
+You can define arrow functions without arguments:
+
+```js
+const two = () => 2;
+```
+
+Define an empty arrow function without arguments and assign it to `window.onload`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('window.onload=()=>'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => { };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-079.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-079.md
new file mode 100644
index 0000000000..35d843ba73
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-079.md
@@ -0,0 +1,209 @@
+---
+id: 5d792536e33baeaa60129e0a
+title: Part 79
+challengeType: 0
+dashedName: part-79
+---
+
+# --description--
+
+In `window.onload`, assign `document.getElementById("container")` to `container`. Also assign `charRange("A", "J")` to `letters`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload=\(\)=>\{constcontainer=document\.getElementById\(["']container["']\);?constletters=charRange\(["']A["'],["']J["']\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => { };
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const letters = charRange("A", "J");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-080.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-080.md
new file mode 100644
index 0000000000..151b312b28
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-080.md
@@ -0,0 +1,215 @@
+---
+id: 5d7925379e2a488f333e2d43
+title: Part 80
+challengeType: 0
+dashedName: part-80
+---
+
+# --description--
+
+Now define a function `createLabel` which takes an argument `name` and has an empty body.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*constcreateLabel=\(?name\)?=>\{\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const letters = charRange("A", "J");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+  
+  };
+  const letters = charRange("A", "J");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-081.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-081.md
new file mode 100644
index 0000000000..9c02544fa7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-081.md
@@ -0,0 +1,218 @@
+---
+id: 5d7925379000785f6d8d9af3
+title: Part 81
+challengeType: 0
+dashedName: part-81
+---
+
+# --description--
+
+Inside `createLabel`, assign `document.createElement("div")` to `label`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*constcreateLabel=\(?name\)?=>\{constlabel=document\.createElement\(["']div["']\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+  
+  };
+  const letters = charRange("A", "J");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+  };
+  const letters = charRange("A", "J");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-082.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-082.md
new file mode 100644
index 0000000000..73130f37af
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-082.md
@@ -0,0 +1,227 @@
+---
+id: 5d79253791391b0acddd0ac5
+title: Part 82
+challengeType: 0
+dashedName: part-82
+---
+
+# --description--
+
+Add the following code to `createLabel`:
+
+```js
+label.className = "label";
+label.textContent = name;
+container.appendChild(label);
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*constcreateLabel=\(?name\)?=>\{constlabel=document\.createElement\(["']div["']\);?label\.className=["']label["'];?label\.textContent=name;?container\.appendChild\(label\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+  };
+  const letters = charRange("A", "J");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-083.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-083.md
new file mode 100644
index 0000000000..2696ccf13a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-083.md
@@ -0,0 +1,223 @@
+---
+id: 5d7925373104ae5ae83f20a5
+title: Part 83
+challengeType: 0
+dashedName: part-83
+---
+
+# --description--
+
+The `forEach` method takes a function and calls it with each element of the array.
+
+Chain `forEach` to `letters` and pass it the `createLabel` function to create a label for each of the letters.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('letters.forEach(createLabel)'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-084.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-084.md
new file mode 100644
index 0000000000..616f9e9eef
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-084.md
@@ -0,0 +1,223 @@
+---
+id: 5d7925373b7127cfaeb50c26
+title: Part 84
+challengeType: 0
+dashedName: part-84
+---
+
+# --description--
+
+Add `range(1, 99)` to the end of `window.onload` (the result will be discarded for now).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/window\.onload[\s\S]*range\(1,99\);?\}/.test(code.replace(/\s/g, '')));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-085.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-085.md
new file mode 100644
index 0000000000..b7e36eaffc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-085.md
@@ -0,0 +1,228 @@
+---
+id: 5d792537cb3a5cd6baca5e1a
+title: Part 85
+challengeType: 0
+dashedName: part-85
+---
+
+# --description--
+
+Chain `forEach` onto `range(1, 99)`, passing in `createLabel` as an argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*range\(1,99\)\.forEach\(createLabel\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(createLabel);
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-086.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-086.md
new file mode 100644
index 0000000000..4fcb97a978
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-086.md
@@ -0,0 +1,230 @@
+---
+id: 5d79253742f3313d55db981f
+title: Part 86
+challengeType: 0
+dashedName: part-86
+---
+
+# --description--
+
+Replace `createLabel` with an arrow function with a block body. This would allow us to add more statements. The arrow function should take an argument `x`, and call `createLabel(x)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*range\(1,99\)\.forEach\(\(?x\)?=>\{createLabel\(x\);?\}\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(createLabel);
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+  });
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-087.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-087.md
new file mode 100644
index 0000000000..5f58399a0c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-087.md
@@ -0,0 +1,235 @@
+---
+id: 5d7925379e0180a438ce7f95
+title: Part 87
+challengeType: 0
+dashedName: part-87
+---
+
+# --description--
+
+Inside the `range` `forEach`, use the `forEach` method on `letters`, passing in a function with argument `x` and an empty body.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload.*range\(1,99\)\.forEach\(\(?x\)?=>\{createLabel\(x\);?letters\.forEach\(\(?y\)?=>\{\}\);?\}\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+  });
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+    
+    });
+  });
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-088.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-088.md
new file mode 100644
index 0000000000..2c508883bc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-088.md
@@ -0,0 +1,238 @@
+---
+id: 5d792537c80984dfa5501b96
+title: Part 88
+challengeType: 0
+dashedName: part-88
+---
+
+# --description--
+
+Inside `letters.forEach`, assign `document.createElement("input")` to `input`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*range\(1,99\)\.forEach\(\(?x\)?=>\{createLabel\(x\);?letters\.forEach\(\(?y\)?=>\{constinput=document\.createElement\(["']input["']\);?\}\);?\}\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+    
+    });
+  });
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input"); 
+    });
+  });
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-089.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-089.md
new file mode 100644
index 0000000000..3e7d194a12
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-089.md
@@ -0,0 +1,249 @@
+---
+id: 5d7925377b54d8a76efb5657
+title: Part 89
+challengeType: 0
+dashedName: part-89
+---
+
+# --description--
+
+Add the following code to `letters.forEach`:
+
+```js
+input.type = "text";
+input.id = y + x;
+input.onchange = update;
+container.appendChild(input);
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /window\.onload[\s\S]*range\(1,99\)\.forEach\(\(?x\)?=>\{createLabel\(x\);?letters\.forEach\(\(?y\)?=>\{constinput=document\.createElement\(["']input["']\);?input\.type=["']text["'];?input\.id=y\+x;?input\.onchange=update;?container\.appendChild\(input\);?\}\);?\}\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input"); 
+    });
+  });
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-090.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-090.md
new file mode 100644
index 0000000000..6a62000c17
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-090.md
@@ -0,0 +1,250 @@
+---
+id: 5d7925371398513549bb6395
+title: Part 90
+challengeType: 0
+dashedName: part-90
+---
+
+# --description--
+
+In the global scope, define a function called `update` which takes `event` as argument. It should define a variable, `element`, setting it to `event.target`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constupdate=\(?event\)?=>\{?constelement=event\.target;?\}?/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-091.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-091.md
new file mode 100644
index 0000000000..faf192a0ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-091.md
@@ -0,0 +1,255 @@
+---
+id: 5d792537ea3eaf302bf2d359
+title: Part 91
+challengeType: 0
+dashedName: part-91
+---
+
+# --description--
+
+Now set `value` to `element.value.replace(/\s/g, "")`. This removes all whitespace from `element` so that we can ignore it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constupdate=\(?event\)?=>\{constelement=event\.target;?constvalue=element\.value\.replace\(\/\\s\/g,["']{2}\);?\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-092.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-092.md
new file mode 100644
index 0000000000..4ec531ba10
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-092.md
@@ -0,0 +1,259 @@
+---
+id: 5d792537533b1c7843bfd029
+title: Part 92
+challengeType: 0
+dashedName: part-92
+---
+
+# --description--
+
+The `includes` method works on a string and checks if the argument is its substring.
+
+Add an empty if statement to `update` which executes if `element.id` is **not** a substring of `value`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constupdate=\(?event\)?=>\{constelement=event\.target;?constvalue=element\.value\.replace\(\/\\s\/g,["']{2}\);?if\(!\(?value\.includes\(element\.id\)\)?\)\{\}\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id)) {}
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-093.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-093.md
new file mode 100644
index 0000000000..fb6bff3d44
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-093.md
@@ -0,0 +1,258 @@
+---
+id: 5d792537dc0fe84345d4f19e
+title: Part 93
+challengeType: 0
+dashedName: part-93
+---
+
+# --description--
+
+Add another condition to the if statement so that it only executes if the first character of `value` is `=`. Do this by adding `&& value[0] === "="` to the if statement.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constupdate=\(?event\)?=>\{constelement=event\.target;?constvalue=element\.value\.replace\(\/\\s\/g,["']{2}\);?if\(!\(?value\.includes\(element\.id\)\)?&&value\[0\]===["']=["']\)\{\}\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id)) {}
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {}
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-094.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-094.md
new file mode 100644
index 0000000000..7a28fe467f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-094.md
@@ -0,0 +1,258 @@
+---
+id: 5d792537b6cadae0f4b0cda1
+title: Part 94
+challengeType: 0
+dashedName: part-94
+---
+
+# --description--
+
+The `slice` method takes two arguments. It extracts characters from the string from the index specified by the first argument up to (but not including) the second argument. The index starts at 0.
+
+Use the `slice` method to log the first two letters of `value` to the console.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('console.log(value.slice(0,2))'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {}
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    console.log(value.slice(0, 2));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-095.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-095.md
new file mode 100644
index 0000000000..c40d4d980a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-095.md
@@ -0,0 +1,260 @@
+---
+id: 5d79253770083fb730c93a93
+title: Part 95
+challengeType: 0
+dashedName: part-95
+---
+
+# --description--
+
+You don't have to specify the second argument in `slice`. If you don't, then `slice` will extract from the first argument to the end of the string.
+
+Change the call to `slice` to log all characters except the first instead.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('console.log(value.slice(1))'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    console.log(value.slice(0, 2));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    console.log(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-096.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-096.md
new file mode 100644
index 0000000000..bb8ebca7b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-096.md
@@ -0,0 +1,264 @@
+---
+id: 5d792537fef76b226b63b93b
+title: Part 96
+challengeType: 0
+dashedName: part-96
+---
+
+# --description--
+
+Now change the if statement to set `element.value` to the result of passing `value.slice(1)` to `evalFormula`. There is no need to use `const` because we're modifying `element.value`, not declaring it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constupdate=\(?event\)?=>\{constelement=event\.target;?constvalue=element\.value\.replace\(\/\\s\/g,["']{2}\);?if\(!\(?value\.includes\(element\.id\)\)?&&value\[0\]===["']=["']\)\{element\.value=evalFormula\(value\.slice\(1\)\);?\}\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    console.log(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-097.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-097.md
new file mode 100644
index 0000000000..d4603ffabc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-097.md
@@ -0,0 +1,271 @@
+---
+id: 5d79253760fca25ccbbd8990
+title: Part 97
+challengeType: 0
+dashedName: part-97
+---
+
+# --description--
+
+The array destructuring syntax can be used to extract values from arrays:
+
+```js
+const [x, y] = [1, 2]; // in variables
+const fn = ([x, y]) => x + y // in functions
+```
+
+Use this syntax to define a function `random` in `spreadsheetFunctions` which takes the array `[x, y]` and returns `x`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /["']?random["']?:\(\[x,y\]\)=>x/.test(code.replace(/\s/g, '')) &&
+    spreadsheetFunctions['random']([1, 2]) === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => x
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-098.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-098.md
new file mode 100644
index 0000000000..f7d670d94d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-098.md
@@ -0,0 +1,265 @@
+---
+id: 5d7925374321824cba309875
+title: Part 98
+challengeType: 0
+dashedName: part-98
+---
+
+# --description--
+
+Change the `random` function so that it returns `Math.floor(Math.random() * y + x)`. It now returns a random number within a range.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /["']?random["']?:\(\[x,y\]\)=>Math\.floor\(Math\.random\(\)\*y\+x\)/.test(
+    code.replace(/\s/g, '')
+  ) && spreadsheetFunctions['random']([1, 1]) === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => x
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-099.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-099.md
new file mode 100644
index 0000000000..261e0347ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-099.md
@@ -0,0 +1,274 @@
+---
+id: 5d7925381e8565a5c50ba7f1
+title: Part 99
+challengeType: 0
+dashedName: part-99
+---
+
+# --description--
+
+In functional programming, we strive to use a type of function called "pure functions" as much as possible. The first property of pure functions is that they always return the same value for the same arguments.
+
+You can check if this is the case by comparing a call to a function with another call (with the same arguments):
+
+```js
+console.log(f(2) === f(2)); // always true for pure functions
+```
+
+Use this technique to check if the `random` function in `spreadsheetFunctions` is pure by passing in the following array: `[1, 1000]`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /(spreadsheetFunctions\[["']random["']\]\(1,1000\))===\1/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+// console.log(spreadsheetFunctions["random"](1, 1000) === spreadsheetFunctions["random"](1, 1000))
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-100.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-100.md
new file mode 100644
index 0000000000..2774488c54
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-100.md
@@ -0,0 +1,269 @@
+---
+id: 5d7925383f1b77db7f1ff59e
+title: Part 100
+challengeType: 0
+dashedName: part-100
+---
+
+# --description--
+
+This is (probably) false, so `random` is certainly impure.
+
+The second property of pure functions is that they perform no side effects, which are state and I/O modifications. If you call a function without assigning the result to a variable, and it does something, then it's an impure function.
+
+Call `window.onload()` in `update`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /update=\(?event\)?=>\{.*window\.onload\(\).*\}/.test(code.replace(/\s/g, ''))
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+// console.log(spreadsheetFunctions["random"](1, 1000) === spreadsheetFunctions["random"](1, 1000))
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  // window.onload();
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-101.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-101.md
new file mode 100644
index 0000000000..55429a76f9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-101.md
@@ -0,0 +1,266 @@
+---
+id: 5d792538de9fa3f298bcd5f6
+title: Part 101
+challengeType: 0
+dashedName: part-101
+---
+
+# --description--
+
+Now try calling `highPrecedence` and pass it the string `"2*2"` without assigning it to a variable in `update`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /update=\(?event\)?=>\{.*highPrecedence\((['"])2\*2\1\).*\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  // window.onload();
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  highPrecedence("2*2");
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-102.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-102.md
new file mode 100644
index 0000000000..056a6ffaf1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-102.md
@@ -0,0 +1,268 @@
+---
+id: 5d7925385b74f69642e1fea5
+title: Part 102
+challengeType: 0
+dashedName: part-102
+---
+
+# --description--
+
+Obviously, this was ignored, as all `highPrecedence` does is return a value and this value is ignored.
+
+Now compare `highPrecedence("2*2")` with `highPrecedence("2*2")`, and `console.log` the result.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /update=\(?event\)?=>\{.*console\.log\((highPrecedence\(['"]2\*2['"]\))===\1\).*\}/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  // highPrecedence("2*2");
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  console.log(highPrecedence("2*2") === highPrecedence("2*2"));
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-103.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-103.md
new file mode 100644
index 0000000000..12dce03c77
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-103.md
@@ -0,0 +1,263 @@
+---
+id: 5d7925380ea76d55b2c97d7b
+title: Part 103
+challengeType: 0
+dashedName: part-103
+---
+
+# --description--
+
+This is true, so `highPrecedence` might be a pure function. If you inspect it, you can see that it indeed performs no I/O and doesn't use functions like `Math.random()` - so it's pure.
+
+Remove the `console.log` statement.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(!code.includes('console.log'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  console.log(highPrecedence("2*2") === highPrecedence("2*2"));
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-104.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-104.md
new file mode 100644
index 0000000000..c6d66c4b42
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-104.md
@@ -0,0 +1,265 @@
+---
+id: 5d792538be4fe331f1a6c008
+title: Part 104
+challengeType: 0
+dashedName: part-104
+---
+
+# --description--
+
+Unfortunately, impure functions are necessary - if you don't use them, the application won't perform any I/O so won't do anything.
+
+But we have an impure function that could be pure - `evalFormula`. It calls `document.getElementById(c + n).value`, but this value can change, even if the arguments don't.
+
+Change these calls to `""` - the function is now pure but doesn't work.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+const nos = code.replace(/\s/g, '');
+assert(nos.includes('elemValue=n=>c=>""') && nos.includes('match=>""'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => document.getElementById(c + n).value;
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => document.getElementById(match.toUpperCase()).value
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-105.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-105.md
new file mode 100644
index 0000000000..56b0b86f55
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-105.md
@@ -0,0 +1,262 @@
+---
+id: 5d792538d169f33142175b95
+title: Part 105
+challengeType: 0
+dashedName: part-105
+---
+
+# --description--
+
+To make this function pure, instead of depending on application state implicitly, we can pass it down explicitly as an argument.
+
+Add an argument `cells` to `evalFormula`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('evalFormula=(x,cells)=>{'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = x => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-106.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-106.md
new file mode 100644
index 0000000000..719f380dee
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-106.md
@@ -0,0 +1,270 @@
+---
+id: 5d792538e48b5a2c6e5bbe12
+title: Part 106
+challengeType: 0
+dashedName: part-106
+---
+
+# --description--
+
+When calling `evalFormula` in `update`, pass in `Array.from(document.getElementById("container").children)` as the `cells` argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'evalFormula(value.slice(1),Array.from(document.getElementById("container").children))'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(value.slice(1));
+  }
+};
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+  
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-107.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-107.md
new file mode 100644
index 0000000000..4c60fed38f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-107.md
@@ -0,0 +1,266 @@
+---
+id: 5d7925387f3e9da5ec856dbe
+title: Part 107
+challengeType: 0
+dashedName: part-107
+---
+
+# --description--
+
+Update the recursive call to `evalFormula` by passing in `cells` as the second argument.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('evalFormula(functionExpanded,cells)'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded);
+  
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-108.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-108.md
new file mode 100644
index 0000000000..7afc00435c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-108.md
@@ -0,0 +1,267 @@
+---
+id: 5d79253824ae9b4a6e6f3108
+title: Part 108
+challengeType: 0
+dashedName: part-108
+---
+
+# --description--
+
+Add a function `idToText` to `evalFormula`, which takes the argument `id` and returns `cells`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/constidToText=\(?id\)?=>cells/.test(code.replace(/\s/g, '')));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells;
+  
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-109.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-109.md
new file mode 100644
index 0000000000..d8de61d2a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-109.md
@@ -0,0 +1,273 @@
+---
+id: 5d7925383f122a279f4c54ad
+title: Part 109
+challengeType: 0
+dashedName: part-109
+---
+
+# --description--
+
+The `find` method returns the first element of an array that satisfies the function passed to it.
+
+Chain `find` onto `cells` and pass it `cell => cell === id`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constidToText=\(?id\)?=>cells\.find\(\(?cell\)?=>cell===id\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells;
+  
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell === id);
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-110.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-110.md
new file mode 100644
index 0000000000..d9cd4ea910
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-110.md
@@ -0,0 +1,270 @@
+---
+id: 5d7925387b682e962f209269
+title: Part 110
+challengeType: 0
+dashedName: part-110
+---
+
+# --description--
+
+In `idToText`, use the `id` property of `cell` to make sure the argument is equal to the cell's id rather than the cell itself.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constidToText=\(?id\)?=>cells\.find\(\(?cell\)?=>cell\.id===id\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell === id);
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id);
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-111.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-111.md
new file mode 100644
index 0000000000..6010072093
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-111.md
@@ -0,0 +1,270 @@
+---
+id: 5d792538de774217b173288e
+title: Part 111
+challengeType: 0
+dashedName: part-111
+---
+
+# --description--
+
+Use the `value` property on the result of `idToText` to return the text inside the cell, rather than the cell itself.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constidToText=\(?id\)?=>cells\.find\(\(?cell\)?=>cell\.id===id\)\.value/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id);
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-112.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-112.md
new file mode 100644
index 0000000000..c9e7086ced
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-112.md
@@ -0,0 +1,267 @@
+---
+id: 5d79253891d93585323d1f3c
+title: Part 112
+challengeType: 0
+dashedName: part-112
+---
+
+# --description--
+
+Change the empty string in `elemValue` to the result of calling `idToText` with `c + n`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').includes('elemValue=n=>c=>idToText(c+n)'));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => ""
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-113.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-113.md
new file mode 100644
index 0000000000..2060ef06b0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-113.md
@@ -0,0 +1,269 @@
+---
+id: 5d7925384e34e944ecb4612d
+title: Part 113
+challengeType: 0
+dashedName: part-113
+---
+
+# --description--
+
+Change the empty string in `varExpanded` to the result of calling `idToText` with `match.toUpperCase()`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').includes('match=>idToText(match.toUpperCase())')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => ""
+  );
+  
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-114.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-114.md
new file mode 100644
index 0000000000..40978e5993
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-114.md
@@ -0,0 +1,271 @@
+---
+id: 5d792538631844ad0bdfb4c3
+title: Part 114
+challengeType: 0
+dashedName: part-114
+---
+
+# --description--
+
+`evalFormula` is now pure, as it now has no external dependencies, and as before, performs no side effects.
+
+Now define a new function, `increment` inside `spreadsheetFunctions`, which takes `nums` as argument and uses `map` to increment each value of `nums` by 1.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(JSON.stringify(spreadsheetFunctions.increment([1, 5, 3])) === '[2,6,4]');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-115.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-115.md
new file mode 100644
index 0000000000..e111bcb79b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-115.md
@@ -0,0 +1,277 @@
+---
+id: 5d792538e2a8d20cc580d481
+title: Part 115
+challengeType: 0
+dashedName: part-115
+---
+
+# --description--
+
+The `slice` method can also work on arrays.
+
+Add a method `firsttwo` to `spreadsheetFunctions` which takes `arr` as argument and uses `slice` to return the first two elements of `arr`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(spreadsheetFunctions.firsttwo([2, 6, 1, 4, 3])) === '[2,6]'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-116.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-116.md
new file mode 100644
index 0000000000..13e96fed7a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-116.md
@@ -0,0 +1,283 @@
+---
+id: 5d792538f5004390d6678554
+title: Part 116
+challengeType: 0
+dashedName: part-116
+---
+
+# --description--
+
+You can also pass in a negative argument to `slice` to specify that index from the end:
+
+```js
+[2, 4, 6, 8, 10].slice(-3); // [6, 8, 10]
+```
+
+Use a negative index to add a function `lasttwo` which returns the last two elements of an array.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(spreadsheetFunctions.lasttwo([2, 6, 1, 4, 3])) === '[4,3]'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-117.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-117.md
new file mode 100644
index 0000000000..5fb13c0ed6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-117.md
@@ -0,0 +1,286 @@
+---
+id: 5d792539dd4fd4c96fd85f7e
+title: Part 117
+challengeType: 0
+dashedName: part-117
+---
+
+# --description--
+
+The `%` operator returns the remainder:
+
+```js
+4 % 3; // 1
+5 % 3; // 2
+6 % 3; // 0
+```
+
+Add an `isEven` function (to the global scope) which returns whether the number passed to it is even.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(isEven(20) && !isEven(31));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-118.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-118.md
new file mode 100644
index 0000000000..1d587b4bd9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-118.md
@@ -0,0 +1,290 @@
+---
+id: 5d79253949802f8587c8bbd3
+title: Part 118
+challengeType: 0
+dashedName: part-118
+---
+
+# --description--
+
+The `filter` method keeps only the elements of an array that satisfy the function passed to it:
+
+```js
+[1, 10, 8, 3, 4, 5].filter(x > 3); // [10, 8, 4, 5]
+```
+
+Use `filter` to add a function called `even` to `spreadsheetFunctions`, which returns all the even elements of an array, `nums`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(spreadsheetFunctions.even([2, 3, 5, 6, 9, 4])) === '[2,6,4]' &&
+    code.includes('filter')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-119.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-119.md
new file mode 100644
index 0000000000..e14a03d3f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-119.md
@@ -0,0 +1,295 @@
+---
+id: 5d7925395888767e9304c082
+title: Part 119
+challengeType: 0
+dashedName: part-119
+---
+
+# --description--
+
+The `reduce` method takes a function with an accumulator and the current value. The accumulator is initially set to the value at index 0.
+
+The `reduce` method then goes through each element of the array after that, passing in the element as the current value and the result of the last call as the accumulator.
+
+For example, here's how to multiply all the value in an array:
+
+```js
+[2, 3, 4].reduce((a, x) => a * x); // 24
+```
+
+Using `reduce`, add a function `sum` to `spreadsheetFunctions`, which sums all values in the array passed to it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  spreadsheetFunctions.sum([10, 5, 1, 3]) === 19 && code.includes('reduce')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-120.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-120.md
new file mode 100644
index 0000000000..404b2270b5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-120.md
@@ -0,0 +1,289 @@
+---
+id: 5d7925393b30099e37a34668
+title: Part 120
+challengeType: 0
+dashedName: part-120
+---
+
+# --description--
+
+The `includes` method checks if an element is in an array.
+
+Add a `has2` function to `spreadsheetFunctions` which checks if the inputted array has the number 2 in it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  spreadsheetFunctions.has2([2, 3, 5]) && !spreadsheetFunctions.has2([1, 3, 10])
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-121.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-121.md
new file mode 100644
index 0000000000..f6911f04f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-121.md
@@ -0,0 +1,299 @@
+---
+id: 5d7925398157757b23730fdd
+title: Part 121
+challengeType: 0
+dashedName: part-121
+---
+
+# --description--
+
+The `reduce` method can take a second argument (in addition to the function), specifying the initial accumulator value. In this case, the current value starts from index 0 rather than index 1:
+
+```js
+[1, [1, 2, 3], [3, 4, 5]].reduce((a, x) => a.concat(x), []); // [1, 1, 2, 3, 3, 4, 5]
+// without the second argument, it first tries 1.concat([1, 2, 3]), but 1 is not an array
+// now it first tries [].concat(1) which works 
+```
+
+Add a function `nodups` to `spreadsheetFunctions`, with the value `arr => arr.reduce((a, x) => a.includes(x), [])`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /nodups['"]?:arr=>arr\.reduce\(\(a,x\)=>a\.includes\(x\),\[\]\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-122.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-122.md
new file mode 100644
index 0000000000..e8d2eeace5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-122.md
@@ -0,0 +1,291 @@
+---
+id: 5d792539de4b9ac14dd40409
+title: Part 122
+challengeType: 0
+dashedName: part-122
+---
+
+# --description--
+
+Use the ternary operator in `nodups` to return `a` if `a.includes(x)` and `a.concat(x)` otherwise.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(spreadsheetFunctions.nodups([1, 3, 1, 5, 7, 7, 9, 7])) ===
+    '[1,3,5,7,9]'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2)
+  nodups: arr => arr.reduce((a, x) => a.includes(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-123.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-123.md
new file mode 100644
index 0000000000..384148b218
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-123.md
@@ -0,0 +1,296 @@
+---
+id: 5d792539534f1bf991bb987f
+title: Part 123
+challengeType: 0
+dashedName: part-123
+---
+
+# --description--
+
+ES6 introduced a shorthand object literal syntax:
+
+```js
+const a = 10;
+const myObject = { a };
+console.log(myObject); // { a: 10 }
+```
+
+First, move `sum` outside of `spreadsheetFunctions`. `sum` should be a function expression similar to `isEven`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(sum([1, 2, 3]) === 6);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum: nums => nums.reduce((a, x) => a + x),
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-124.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-124.md
new file mode 100644
index 0000000000..acae8adba0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-124.md
@@ -0,0 +1,291 @@
+---
+id: 5d7925394089b762f93ffa52
+title: Part 124
+challengeType: 0
+dashedName: part-124
+---
+
+# --description--
+
+Now use the shorthand syntax to reference `sum` inside of `spreadsheetFunctions`.
+
+This both adds it to the functions you can use in the spreadsheet, and allows you to use it throughout your program.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/[{,]sum[,}]/.test(code.replace(/\s/g, '')));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-125.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-125.md
new file mode 100644
index 0000000000..e997b64fbb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-125.md
@@ -0,0 +1,296 @@
+---
+id: 5d792539ec758d45a6900173
+title: Part 125
+challengeType: 0
+dashedName: part-125
+---
+
+# --description--
+
+The `length` property returns the length of an array. Use this property with the `sum` function to define an `average` function.
+
+As with `sum`, add this function to both the global scope and to `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  average([1, 5, 12]) === 6 && spreadsheetFunctions.average([1, 20, 3, 8]) === 8
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-126.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-126.md
new file mode 100644
index 0000000000..2c5eb36952
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-126.md
@@ -0,0 +1,306 @@
+---
+id: 5d7925398d525f61a9ff3a79
+title: Part 126
+challengeType: 0
+dashedName: part-126
+---
+
+# --description--
+
+The spread operator allow you to pass multiple arguments instead of an array:
+
+```js
+const arr = [1, 2, 3];
+const sum3 = (a, b, c) => a + b + c;
+sum3(...arr); // 6
+```
+
+Use the spread operator to add `range` to `spreadsheetFunctions`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  JSON.stringify(spreadsheetFunctions.range([1, 5])) === '[1,2,3,4,5]' &&
+    code.includes('...')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), [])
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-127.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-127.md
new file mode 100644
index 0000000000..de3c69ec7f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-127.md
@@ -0,0 +1,298 @@
+---
+id: 5d792539a222f385c5c17d2b
+title: Part 127
+challengeType: 0
+dashedName: part-127
+---
+
+# --description--
+
+Now define a `median` function which takes an argument `nums` (in the global scope).
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/constmedian=\(?nums\)?=>/.test(code.replace(/\s/g, '')));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-128.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-128.md
new file mode 100644
index 0000000000..548c01e3da
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-128.md
@@ -0,0 +1,310 @@
+---
+id: 5d7925398a7184b41b12a0e0
+title: Part 128
+challengeType: 0
+dashedName: part-128
+---
+
+# --description--
+
+The `sort` method sorts an array alphabetically:
+
+```js
+["B", "C", "A"].sort(); // ["A", "B", "C"]
+```
+
+Assign the sorted `nums` to `sorted` in `median`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').includes('constmedian=nums=>{constsorted=nums.sort()')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.sort();
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-129.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-129.md
new file mode 100644
index 0000000000..6e638ef7db
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-129.md
@@ -0,0 +1,316 @@
+---
+id: 5d7925399afb905c34730a75
+title: Part 129
+challengeType: 0
+dashedName: part-129
+---
+
+# --description--
+
+But our function takes an array of numbers, not strings. Luckily, you can pass a function `fn` as argument to sort:
+
+```js
+[2, 9, 10, 15].sort((a, b) => b - a); // [10, 9, 5, 2]
+```
+
+If `b - a` is less than 0, then `a` will be placed before `b`. As a result, this sorts the array in descending order.
+
+Use `sort` to sort `nums` in ascending order.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constmedian=nums=>\{constsorted=nums\.sort\(\((.+),(.+)\)=>\1-\2\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.sort();
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.sort((x, y) => x - y);
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-130.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-130.md
new file mode 100644
index 0000000000..7c7978b4ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-130.md
@@ -0,0 +1,310 @@
+---
+id: 5d792539728d1aa7788e2c9b
+title: Part 130
+challengeType: 0
+dashedName: part-130
+---
+
+# --description--
+
+Unfortunately, `sort` not only returns a new array, but also modifies the existing one. So our function also modifies the array passed to it - it is impure.
+
+You can fix this by adding `.slice()` between `nums` and `sort` - this creates a new array, that is equivalent to `nums`, but is immediately discarded, so it doesn't matter if it changes.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constmedian=nums=>\{constsorted=nums\.slice\(\)\.sort\(\((.+),(.+)\)=>\1-\2\)/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.sort((x, y) => x - y);
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-131.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-131.md
new file mode 100644
index 0000000000..08f1fb59b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-131.md
@@ -0,0 +1,310 @@
+---
+id: 5d79253939434a2724c0ec41
+title: Part 131
+challengeType: 0
+dashedName: part-131
+---
+
+# --description--
+
+Now define two variable: `length` which is `sorted.length` and `middle` which is `length / 2 - 1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constmedian=nums=>\{constsorted=nums\.slice\(\)\.sort\(\((.+),(.+)\)=>\1-\2\);?constlength=sorted\.length;?constmiddle=length\/2-1/.test(
+    code.replace(/\s/g, '')
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = length / 2 - 1;
+}; 
+
+
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-132.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-132.md
new file mode 100644
index 0000000000..ffad944ec9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-132.md
@@ -0,0 +1,309 @@
+---
+id: 5d792539b9e1d3c54d8fe94a
+title: Part 132
+challengeType: 0
+dashedName: part-132
+---
+
+# --description--
+
+Add a return statement to `median` so that it returns `isEven(length)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(median([1, 2, 3, 4]) && !median([1, 2, 3]));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+}; 
+
+
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = length / 2 - 1;
+  return isEven(length);
+}; 
+
+
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-133.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-133.md
new file mode 100644
index 0000000000..1c5e09a840
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-133.md
@@ -0,0 +1,314 @@
+---
+id: 5d792539b2e0bd8f9e8213e4
+title: Part 133
+challengeType: 0
+dashedName: part-133
+---
+
+# --description--
+
+Use the ternary operator to return `average([sorted[middle], sorted[middle + 1]])` if `length` is even, and `sorted[middle + 0.5]` otherwise.
+
+Note that the `middle` variable is close to the middle but is not actually the middle.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(median([1, 20, 3]) === 3 && median([27, 7, 20, 10]) === 15);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length);
+}; 
+
+
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-134.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-134.md
new file mode 100644
index 0000000000..3e509e7c06
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-134.md
@@ -0,0 +1,318 @@
+---
+id: 5d792539239148965a1a59a5
+title: Part 134
+challengeType: 0
+dashedName: part-134
+---
+
+# --description--
+
+Now add `median` to `spreadsheetFunctions`, just like you added `sum` and `average`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  spreadsheetFunctions.median([1, 20, 3]) === 3 &&
+    spreadsheetFunctions.median([27, 7, 20, 10]) === 15
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-135.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-135.md
new file mode 100644
index 0000000000..6986d1e317
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-135.md
@@ -0,0 +1,323 @@
+---
+id: 5d792539e1446045d0df6d28
+title: Part 135
+challengeType: 0
+dashedName: part-135
+---
+
+# --description--
+
+The `some` method checks if any element of the array satisfies the provided testing function.
+
+Add `someeven` to `spreadsheetFunctions`, which checks if any of the items passed in are even.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  spreadsheetFunctions.someeven([1, 5, 4, 3]) &&
+    !spreadsheetFunctions.someeven([3, 5, 9]) &&
+    code.includes('.some')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-136.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-136.md
new file mode 100644
index 0000000000..77fd516850
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-136.md
@@ -0,0 +1,325 @@
+---
+id: 5d79253a2febbb77098730b9
+title: Part 136
+challengeType: 0
+dashedName: part-136
+---
+
+# --description--
+
+The `every` method checks if all elements of an array satisfy the provided testing function.
+
+Use it to add an `everyeven` function to `spreadsheetFunctions` which checks if all values passed in are even`spreadsheetFunctions` which checks if all values passed in are even.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  spreadsheetFunctions.everyeven([2, 6, 4, 0, 20]) &&
+    !spreadsheetFunctions.everyeven([10, 0, 9, 2]) &&
+    code.includes('.every')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven)
+};
+
+
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-137.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-137.md
new file mode 100644
index 0000000000..0ca5e5edcb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-137.md
@@ -0,0 +1,326 @@
+---
+id: 5d79253a98bd9fdf7ce68d0a
+title: Part 137
+challengeType: 0
+dashedName: part-137
+---
+
+# --description--
+
+We've used recursion in `range`, but recursion can have performance issues in JavaScript. If performance is an issue, you should try to use a higher order function like `reduce`, and if you can't do that, you'll probably have to use a for/while loop.
+
+While we don't expect the user to enter particularly large numbers so that performance is an issue, we're going to refactor `range` as an exercise.
+
+Replace the body of `range` with `start`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /constrange=\(start,end\)=>start(;|const)/.test(code.replace(/\s/g, ''))
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) =>
+  start > end ? [] : [start].concat(range(start + 1, end));
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => start
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-138.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-138.md
new file mode 100644
index 0000000000..986d8afd6e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-138.md
@@ -0,0 +1,322 @@
+---
+id: 5d79253a1e9abf29de64c177
+title: Part 138
+challengeType: 0
+dashedName: part-138
+---
+
+# --description--
+
+The `Array` function takes an argument `x` and creates an array of size `x` filled with `undefined`.
+
+Make `range` return an array of `undefined` with size `end - start + 1`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').includes('constrange=(start,end)=>Array(end-start+1)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => start
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-139.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-139.md
new file mode 100644
index 0000000000..6421781e30
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-139.md
@@ -0,0 +1,325 @@
+---
+id: 5d79253a8b29d78984369e4b
+title: Part 139
+challengeType: 0
+dashedName: part-139
+---
+
+# --description--
+
+The `fill` method takes an argument and replaces all elements of the array with that argument.
+
+Use it on the array in `range` to replace everything with `start`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes('constrange=(start,end)=>Array(end-start+1).fill(start)')
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1).fill(start);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-140.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-140.md
new file mode 100644
index 0000000000..1ef0f5e749
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-140.md
@@ -0,0 +1,328 @@
+---
+id: 5d79253ad297a31cbe073718
+title: Part 140
+challengeType: 0
+dashedName: part-140
+---
+
+# --description--
+
+The function in the `map` method can actually take a second argument: the index of the element.
+
+This is why you need an arrow function in `charRange` - if you don't use one, then the index will be passed to `String.fromCharCode` as the second argument, leading to unexpected results. However, it is safe for functions like `parseFloat` which take only one argument (but not for `parseInt`).
+
+Chain `.map((x, i) => x + i)` to `.fill(start)` to add its index to every element in the array in `range`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .includes(
+      'constrange=(start,end)=>Array(end-start+1).fill(start).map((x,i)=>x+i)'
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1).fill(start);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1).fill(start).map((x, i) => x + i);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-141.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-141.md
new file mode 100644
index 0000000000..97decd495b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming-spreadsheet/part-141.md
@@ -0,0 +1,316 @@
+---
+id: 5dc10b8b93704f41d279eb5b
+title: Part 141
+challengeType: 0
+dashedName: part-141
+---
+
+# --description--
+
+Congratulations, you've finished your functional programming spreadsheet! Now test it out by crunching some numbers.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html lang="en">
+<head>
+  <meta charset="UTF-8">
+  <title>Spreadsheet</title>
+  <style>
+    #container {
+      display: grid;
+      grid-template-columns: 50px repeat(10, 200px);
+      grid-template-rows: repeat(11, 30px);
+    }
+    .label {
+      background-color: lightgray;
+      text-align: center;
+      vertical-align: middle;
+      line-height: 30px;
+    }
+  </style>
+</head>
+<body>
+<div id="container">
+  <div></div>
+</div>
+```
+
+## --after-user-code--
+
+```html
+</body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1).fill(start).map((x, i) => x + i);
+
+
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+const infixToFunction = {
+  "+": (x, y) => x + y,
+  "-": (x, y) => x - y,
+  "*": (x, y) => x * y,
+  "/": (x, y) => x / y
+};
+
+const infixEval = (str, regex) =>
+  str.replace(regex, (_, arg1, fn, arg2) =>
+    infixToFunction[fn](parseFloat(arg1), parseFloat(arg2))
+  );
+
+const highPrecedence = str => {
+  const regex = /([0-9.]+)([*\/])([0-9.]+)/;
+  const str2 = infixEval(str, regex);
+  return str === str2 ? str : highPrecedence(str2);
+};
+
+const isEven = num => num % 2 === 0;
+const sum = nums => nums.reduce((a, x) => a + x);
+const average = nums => sum(nums) / nums.length;
+
+const median = nums => {
+  const sorted = nums.slice().sort((x, y) => x - y);
+  const length = sorted.length;
+  const middle = sorted.length / 2 - 1;
+  return isEven(length)
+    ? average([sorted[middle], sorted[middle + 1]])
+    : sorted[middle + 0.5];
+}; 
+
+const spreadsheetFunctions = {
+  "": x => x,
+  random: ([x, y]) => Math.floor(Math.random() * y + x),
+  increment: nums => nums.map(x => x + 1),
+  firsttwo: arr => arr.slice(0, 2),
+  lasttwo: arr => arr.slice(-2),
+  even: nums => nums.filter(isEven),
+  sum,
+  average,
+  median,
+  has2: arr => arr.includes(2),
+  nodups: arr => arr.reduce((a, x) => a.includes(x) ? a : a.concat(x), []),
+  range: arr => range(...arr),
+  someeven: arr => arr.some(isEven),
+  everyeven: arr => arr.every(isEven)
+};
+
+const applyFn = str => {
+  const noHigh = highPrecedence(str);
+  const infix = /([0-9.]+)([+-])([0-9.]+)/;
+  const str2 = infixEval(noHigh, infix);
+  const regex = /([a-z]*)\(([0-9., ]*)\)(?!.*\()/i;
+  const toNumberList = args => args.split(",").map(parseFloat);
+  const applyFunction = (fn, args) =>
+    spreadsheetFunctions[fn.toLowerCase()](toNumberList(args));
+  return str2.replace(
+    regex,
+    (match, fn, args) =>
+      spreadsheetFunctions.hasOwnProperty(fn.toLowerCase()) ? applyFunction(fn, args) : match
+  );
+};
+
+const range = (start, end) => Array(end - start + 1).fill(start).map((x, i) => x + i);
+
+const charRange = (start, end) =>
+  range(start.charCodeAt(0), end.charCodeAt(0)).map(x =>
+    String.fromCharCode(x)
+  );
+
+const evalFormula = (x, cells) => {
+  const idToText = id => cells.find(cell => cell.id === id).value;
+  const rangeRegex = /([A-J])([1-9][0-9]?):([A-J])([1-9][0-9]?)/gi;
+  const rangeFromString = (n1, n2) => range(parseInt(n1), parseInt(n2));
+  const elemValue = n => c => idToText(c + n);
+  const addChars = c1 => c2 => n => charRange(c1, c2).map(elemValue(n));
+  const varRangeExpanded = x.replace(rangeRegex, (_, c1, n1, c2, n2) =>
+    rangeFromString(n1, n2).map(addChars(c1)(c2))
+  );
+  const varRegex = /[A-J][1-9][0-9]?/gi;
+  const varExpanded = varRangeExpanded.replace(
+    varRegex,
+    match => idToText(match.toUpperCase())
+  );
+  const functionExpanded = applyFn(varExpanded);
+  return functionExpanded === x
+    ? functionExpanded
+    : evalFormula(functionExpanded, cells);
+};
+
+window.onload = () => {
+  const container = document.getElementById("container");
+  const createLabel = name => {
+    const label = document.createElement("div");
+    label.className = "label";
+    label.textContent = name;
+    container.appendChild(label);
+  };
+  const letters = charRange("A", "J");
+  letters.forEach(createLabel);
+  range(1, 99).forEach(x => {
+    createLabel(x);
+    letters.forEach(y => {
+      const input = document.createElement("input");
+      input.type = "text";
+      input.id = y + x;
+      input.onchange = update;
+      container.appendChild(input);
+    });
+  });
+};
+
+const update = event => {
+  const element = event.target;
+  const value = element.value.replace(/\s/g, "");
+  if (!value.includes(element.id) && value[0] === "=") {
+    element.value = evalFormula(
+      value.slice(1),
+      Array.from(document.getElementById("container").children)
+    );
+  }
+};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
new file mode 100644
index 0000000000..4ed68341e9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/add-elements-to-the-end-of-an-array-using-concat-instead-of-push.md
@@ -0,0 +1,88 @@
+---
+id: 587d7da9367417b2b2512b67
+title: Add Elements to the End of an Array Using concat Instead of push
+challengeType: 1
+forumTopicId: 301226
+dashedName: 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 `concat` method as a way to combine arrays into a new one without mutating the original arrays. Compare `concat` to the `push` method. `push` adds an item to the end of the same array it is called on, which mutates that array. Here's an example:
+
+```js
+var arr = [1, 2, 3];
+arr.push([4, 5, 6]);
+```
+
+`arr` would have a modified value of `[1, 2, 3, [4, 5, 6]]`, which is not the functional programming way.
+
+`concat` offers a way to add new items to the end of an array without any mutating side effects.
+
+# --instructions--
+
+Change the `nonMutatingPush` function so it uses `concat` to add `newItem` to the end of `original` instead of `push`. The function should return an array.
+
+# --hints--
+
+Your code should use the `concat` method.
+
+```js
+assert(code.match(/\.concat/g));
+```
+
+Your code should not use the `push` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?push/g));
+```
+
+The `first` array should not change.
+
+```js
+assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]));
+```
+
+The `second` array should not change.
+
+```js
+assert(JSON.stringify(second) === JSON.stringify([4, 5]));
+```
+
+`nonMutatingPush([1, 2, 3], [4, 5])` should return `[1, 2, 3, 4, 5]`.
+
+```js
+assert(
+  JSON.stringify(nonMutatingPush([1, 2, 3], [4, 5])) ===
+    JSON.stringify([1, 2, 3, 4, 5])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nonMutatingPush(original, newItem) {
+  // Only change code below this line
+  return original.push(newItem);
+
+  // Only change code above this line
+}
+var first = [1, 2, 3];
+var second = [4, 5];
+nonMutatingPush(first, second);
+```
+
+# --solutions--
+
+```js
+function nonMutatingPush(original, newItem) {
+  return original.concat(newItem);
+}
+var first = [1, 2, 3];
+var second = [4, 5];
+nonMutatingPush(first, second);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/apply-functional-programming-to-convert-strings-to-url-slugs.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/apply-functional-programming-to-convert-strings-to-url-slugs.md
new file mode 100644
index 0000000000..b225822761
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/apply-functional-programming-to-convert-strings-to-url-slugs.md
@@ -0,0 +1,84 @@
+---
+id: 587d7dab367417b2b2512b6d
+title: Apply Functional Programming to Convert Strings to URL Slugs
+challengeType: 1
+forumTopicId: 301227
+dashedName: 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 `reduce`, 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 `map` and `filter` are special cases of `reduce`.
+
+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.
+
+# --instructions--
+
+Fill in the `urlSlug` function so it converts a string `title` and returns the hyphenated version for the URL. You can use any of the methods covered in this section, and don't use `replace`. 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 (`-`)
+
+The output should be all lower-cased letters
+
+The output should not have any spaces
+
+# --hints--
+
+Your code should not use the `replace` method for this challenge.
+
+```js
+assert(!code.match(/\.?[\s\S]*?replace/g));
+```
+
+`urlSlug("Winter Is Coming")` should return the string `winter-is-coming`.
+
+```js
+assert(urlSlug('Winter Is Coming') === 'winter-is-coming');
+```
+
+`urlSlug(" Winter Is  Coming")` should return the string `winter-is-coming`.
+
+```js
+assert(urlSlug(' Winter Is  Coming') === 'winter-is-coming');
+```
+
+`urlSlug("A Mind Needs Books Like A Sword Needs A Whetstone")` should return the string `a-mind-needs-books-like-a-sword-needs-a-whetstone`.
+
+```js
+assert(
+  urlSlug('A Mind Needs Books Like A Sword Needs A Whetstone') ===
+    'a-mind-needs-books-like-a-sword-needs-a-whetstone'
+);
+```
+
+`urlSlug("Hold The Door")` should return the string `hold-the-door`.
+
+```js
+assert(urlSlug('Hold The Door') === 'hold-the-door');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+function urlSlug(title) {
+
+
+}
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+// Only change code below this line
+function urlSlug(title) {
+  return title.trim().split(/\s+/).join("-").toLowerCase();
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/avoid-mutations-and-side-effects-using-functional-programming.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/avoid-mutations-and-side-effects-using-functional-programming.md
new file mode 100644
index 0000000000..0f401beeab
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/avoid-mutations-and-side-effects-using-functional-programming.md
@@ -0,0 +1,78 @@
+---
+id: 587d7b8e367417b2b2512b5e
+title: Avoid Mutations and Side Effects Using Functional Programming
+challengeType: 1
+forumTopicId: 301228
+dashedName: 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 `splice` call in the `tabClose()` function. Unfortunately, `splice` 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 principles 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 `splice` method changed the original array, and resulted in a bug.
+
+Recall that in functional programming, changing or altering things is called <dfn>mutation</dfn>, and the outcome is called a <dfn>side effect</dfn>. A function, ideally, should be a <dfn>pure function</dfn>, 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.
+
+# --instructions--
+
+Fill in the code for the function `incrementer` so it returns the value of the global variable `fixedValue` increased by one.
+
+# --hints--
+
+Your function `incrementer` should not change the value of `fixedValue` (which is `4`).
+
+```js
+incrementer();
+assert(fixedValue === 4);
+```
+
+Your `incrementer` function should return a value that is one larger than the `fixedValue` value.
+
+```js
+const __newValue = incrementer();
+assert(__newValue === 5);
+```
+
+Your `incrementer` function should return a value based on the global `fixedValue` variable value.
+
+```js
+(function () {
+  fixedValue = 10;
+  const newValue = incrementer();
+  assert(fixedValue === 10 && newValue === 11);
+  fixedValue = 4;
+})();
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// The global variable
+var fixedValue = 4;
+
+function incrementer () {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+var fixedValue = 4
+
+function incrementer() {
+  return fixedValue + 1
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-an-array-into-a-string-using-the-join-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-an-array-into-a-string-using-the-join-method.md
new file mode 100644
index 0000000000..350d529690
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-an-array-into-a-string-using-the-join-method.md
@@ -0,0 +1,90 @@
+---
+id: 587d7daa367417b2b2512b6c
+title: Combine an Array into a String Using the join Method
+challengeType: 1
+forumTopicId: 18221
+dashedName: combine-an-array-into-a-string-using-the-join-method
+---
+
+# --description--
+
+The `join` 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:
+
+```js
+var arr = ["Hello", "World"];
+var str = arr.join(" ");
+```
+
+`str` would have a value of the string `Hello World`.
+# --instructions--
+
+Use the `join` method (among others) inside the `sentensify` function to make a sentence from the words in the string `str`. 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 `replace` method.
+
+# --hints--
+
+Your code should use the `join` method.
+
+```js
+assert(code.match(/\.join/g));
+```
+
+Your code should not use the `replace` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?replace/g));
+```
+
+`sentensify("May-the-force-be-with-you")` should return a string.
+
+```js
+assert(typeof sentensify('May-the-force-be-with-you') === 'string');
+```
+
+`sentensify("May-the-force-be-with-you")` should return the string `May the force be with you`.
+
+```js
+assert(sentensify('May-the-force-be-with-you') === 'May the force be with you');
+```
+
+`sentensify("The.force.is.strong.with.this.one")` should return the string `The force is strong with this one`.
+
+```js
+assert(
+  sentensify('The.force.is.strong.with.this.one') ===
+    'The force is strong with this one'
+);
+```
+
+`sentensify("There,has,been,an,awakening")` should return the string `There has been an awakening`.
+
+```js
+assert(
+  sentensify('There,has,been,an,awakening') === 'There has been an awakening'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sentensify(str) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+sentensify("May-the-force-be-with-you");
+```
+
+# --solutions--
+
+```js
+function sentensify(str) {
+  // Only change code below this line
+  return str.split(/\W/).join(' ');
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-two-arrays-using-the-concat-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-two-arrays-using-the-concat-method.md
new file mode 100644
index 0000000000..22afb596f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/combine-two-arrays-using-the-concat-method.md
@@ -0,0 +1,79 @@
+---
+id: 587d7da9367417b2b2512b66
+title: Combine Two Arrays Using the concat Method
+challengeType: 1
+forumTopicId: 301229
+dashedName: combine-two-arrays-using-the-concat-method
+---
+
+# --description--
+
+<dfn>Concatenation</dfn> means to join items end to end. JavaScript offers the `concat` 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 `concat`, 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:
+
+```js
+[1, 2, 3].concat([4, 5, 6]);
+```
+
+The returned array would be `[1, 2, 3, 4, 5, 6]`.
+
+# --instructions--
+
+Use the `concat` method in the `nonMutatingConcat` function to concatenate `attach` to the end of `original`. The function should return the concatenated array.
+
+# --hints--
+
+Your code should use the `concat` method.
+
+```js
+assert(code.match(/\.concat/g));
+```
+
+The `first` array should not change.
+
+```js
+assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]));
+```
+
+The `second` array should not change.
+
+```js
+assert(JSON.stringify(second) === JSON.stringify([4, 5]));
+```
+
+`nonMutatingConcat([1, 2, 3], [4, 5])` should return `[1, 2, 3, 4, 5]`.
+
+```js
+assert(
+  JSON.stringify(nonMutatingConcat([1, 2, 3], [4, 5])) ===
+    JSON.stringify([1, 2, 3, 4, 5])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nonMutatingConcat(original, attach) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+var first = [1, 2, 3];
+var second = [4, 5];
+nonMutatingConcat(first, second);
+```
+
+# --solutions--
+
+```js
+function nonMutatingConcat(original, attach) {
+  // Only change code below this line
+  return original.concat(attach);
+  // Only change code above this line
+}
+var first = [1, 2, 3];
+var second = [4, 5];
+nonMutatingConcat(first, second);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-map-on-a-prototype.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-map-on-a-prototype.md
new file mode 100644
index 0000000000..b1098b2b28
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-map-on-a-prototype.md
@@ -0,0 +1,75 @@
+---
+id: 587d7b8f367417b2b2512b62
+title: Implement map on a Prototype
+challengeType: 1
+forumTopicId: 301230
+dashedName: implement-map-on-a-prototype
+---
+
+# --description--
+
+As you have seen from applying `Array.prototype.map()`, or simply `map()` earlier, the `map` 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, `map` is a pure function, and its output depends solely on its inputs. Plus, it takes another function as its argument.
+
+You might learn a lot about the `map` method if you implement your own version of it. It is recommended you use a `for` loop or `Array.prototype.forEach()`.
+
+# --instructions--
+
+Write your own `Array.prototype.myMap()`, which should behave exactly like `Array.prototype.map()`. You should not use the built-in `map` method. The `Array` instance can be accessed in the `myMap` method using `this`.
+
+# --hints--
+
+`new_s` should equal `[46, 130, 196, 10]`.
+
+```js
+assert(JSON.stringify(new_s) === JSON.stringify([46, 130, 196, 10]));
+```
+
+Your code should not use the `map` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?map/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// The global variable
+var s = [23, 65, 98, 5];
+
+Array.prototype.myMap = function(callback) {
+  var newArray = [];
+  // Only change code below this line
+
+  // Only change code above this line
+  return newArray;
+};
+
+var new_s = s.myMap(function(item) {
+  return item * 2;
+});
+```
+
+# --solutions--
+
+```js
+// the global Array
+var s = [23, 65, 98, 5];
+
+Array.prototype.myMap = function(callback) {
+  var newArray = [];
+  // Only change code below this line
+  for (var elem of this) {
+    newArray.push(callback(elem));
+  }
+  // Only change code above this line
+  return newArray;
+};
+
+var new_s = s.myMap(function(item) {
+  return item * 2;
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-the-filter-method-on-a-prototype.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-the-filter-method-on-a-prototype.md
new file mode 100644
index 0000000000..a9469de977
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/implement-the-filter-method-on-a-prototype.md
@@ -0,0 +1,70 @@
+---
+id: 587d7b8f367417b2b2512b64
+title: Implement the filter Method on a Prototype
+challengeType: 1
+forumTopicId: 301231
+dashedName: implement-the-filter-method-on-a-prototype
+---
+
+# --description--
+
+You might learn a lot about the `filter` method if you implement your own version of it. It is recommended you use a `for` loop or `Array.prototype.forEach()`.
+
+# --instructions--
+
+Write your own `Array.prototype.myFilter()`, which should behave exactly like `Array.prototype.filter()`. You should not use the built-in `filter` method. The `Array` instance can be accessed in the `myFilter` method using `this`.
+
+# --hints--
+
+`new_s` should equal `[23, 65, 5]`.
+
+```js
+assert(JSON.stringify(new_s) === JSON.stringify([23, 65, 5]));
+```
+
+Your code should not use the `filter` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?filter/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// The global variable
+var s = [23, 65, 98, 5];
+
+Array.prototype.myFilter = function(callback) {
+  // Only change code below this line
+  var newArray = [];
+  // Only change code above this line
+  return newArray;
+};
+
+var new_s = s.myFilter(function(item) {
+  return item % 2 === 1;
+});
+```
+
+# --solutions--
+
+```js
+// the global Array
+var s = [23, 65, 98, 5];
+
+Array.prototype.myFilter = function(callback) {
+  var newArray = [];
+  // Only change code below this line
+  for (let i = 0; i < this.length; i++) {
+    if (callback(this[i])) newArray.push(this[i]);
+  }
+  // Only change code above this line
+  return newArray;
+};
+
+var new_s = s.myFilter(function(item) {
+  return item % 2 === 1;
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/introduction-to-currying-and-partial-application.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/introduction-to-currying-and-partial-application.md
new file mode 100644
index 0000000000..5576adac56
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/introduction-to-currying-and-partial-application.md
@@ -0,0 +1,100 @@
+---
+id: 587d7dab367417b2b2512b70
+title: Introduction to Currying and Partial Application
+challengeType: 1
+forumTopicId: 301232
+dashedName: introduction-to-currying-and-partial-application
+---
+
+# --description--
+
+The <dfn>arity</dfn> of a function is the number of arguments it requires. <dfn>Currying</dfn> a function means to convert a function of N arity into N functions of arity 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:
+
+```js
+function unCurried(x, y) {
+  return x + y;
+}
+
+function curried(x) {
+  return function(y) {
+    return x + y;
+  }
+}
+
+const curried = x => y => x + y
+
+curried(1)(2)
+```
+
+`curried(1)(2)` would return `3`.
+
+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 curried function in the example above:
+
+```js
+var funcForY = curried(1);
+console.log(funcForY(2)); // 3
+```
+
+Similarly, <dfn>partial application</dfn> 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:
+
+```js
+function impartial(x, y, z) {
+  return x + y + z;
+}
+var partialFn = impartial.bind(this, 1, 2);
+partialFn(10); // 13
+```
+
+# --instructions--
+
+Fill in the body of the `add` function so it uses currying to add parameters `x`, `y`, and `z`.
+
+# --hints--
+
+`add(10)(20)(30)` should return `60`.
+
+```js
+assert(add(10)(20)(30) === 60);
+```
+
+`add(1)(2)(3)` should return `6`.
+
+```js
+assert(add(1)(2)(3) === 6);
+```
+
+`add(11)(22)(33)` should return `66`.
+
+```js
+assert(add(11)(22)(33) === 66);
+```
+
+Your code should include a final statement that returns `x + y + z`.
+
+```js
+assert(code.match(/[xyz]\s*?\+\s*?[xyz]\s*?\+\s*?[xyz]/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function add(x) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+add(10)(20)(30);
+```
+
+# --solutions--
+
+```js
+const add = x => y => z => x + y + z
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/learn-about-functional-programming.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/learn-about-functional-programming.md
new file mode 100644
index 0000000000..3c37f65800
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/learn-about-functional-programming.md
@@ -0,0 +1,86 @@
+---
+id: 587d7b8d367417b2b2512b5b
+title: Learn About Functional Programming
+challengeType: 1
+forumTopicId: 301233
+dashedName: 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: `INPUT -> PROCESS -> OUTPUT`
+
+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
+
+# --instructions--
+
+The members of freeCodeCamp happen to love tea.
+
+In the code editor, the `prepareTea` and `getTea` functions are already defined for you. Call the `getTea` function to get 40 cups of tea for the team, and store them in the `tea4TeamFCC` variable.
+
+# --hints--
+
+The `tea4TeamFCC` variable should hold 40 cups of tea for the team.
+
+```js
+assert(tea4TeamFCC.length === 40);
+```
+
+The `tea4TeamFCC` variable should hold cups of green tea.
+
+```js
+assert(tea4TeamFCC[0] === 'greenTea');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Function that returns a string representing a cup of green tea
+const prepareTea = () => 'greenTea';
+
+/*
+Given a function (representing the tea type) and number of cups needed, the
+following function returns an array of strings (each representing a cup of
+a specific type of tea).
+*/
+const getTea = (numOfCups) => {
+  const teaCups = [];
+
+  for(let cups = 1; cups <= numOfCups; cups += 1) {
+    const teaCup = prepareTea();
+    teaCups.push(teaCup);
+  }
+  return teaCups;
+};
+
+// Only change code below this line
+const tea4TeamFCC = null;
+// Only change code above this line
+```
+
+# --solutions--
+
+```js
+const prepareTea = () => 'greenTea';
+
+const getTea = (numOfCups) => {
+  const teaCups = [];
+  
+  for(let cups = 1; cups <= numOfCups; cups += 1) {
+    const teaCup = prepareTea();
+    teaCups.push(teaCup);
+  }
+
+  return teaCups;
+};
+
+const tea4TeamFCC = getTea(40); 
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/pass-arguments-to-avoid-external-dependence-in-a-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/pass-arguments-to-avoid-external-dependence-in-a-function.md
new file mode 100644
index 0000000000..2ca1573cc1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/pass-arguments-to-avoid-external-dependence-in-a-function.md
@@ -0,0 +1,80 @@
+---
+id: 587d7b8e367417b2b2512b5f
+title: Pass Arguments to Avoid External Dependence in a Function
+challengeType: 1
+forumTopicId: 301234
+dashedName: 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 `incrementer` would not work without the global variable `fixedValue` 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.
+
+# --instructions--
+
+Let's update the `incrementer` function to clearly declare its dependencies.
+
+Write the `incrementer` function so it takes an argument, and then returns a result after increasing the value by one.
+
+# --hints--
+
+Your function `incrementer` should not change the value of `fixedValue` (which is `4`).
+
+```js
+assert(fixedValue === 4);
+```
+
+Your `incrementer` function should take an argument.
+
+```js
+assert(incrementer.length === 1);
+```
+
+Your `incrementer` function should return a value that is one larger than the `fixedValue` value.
+
+```js
+const __newValue = incrementer(fixedValue);
+assert(__newValue === 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// The global variable
+var fixedValue = 4;
+
+// Only change code below this line
+function incrementer () {
+
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+// The global variable
+var fixedValue = 4;
+
+// Only change code below this line
+function incrementer (fixedValue) {
+  return fixedValue + 1;
+
+  // Only change code above this line
+}
+
+  
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/refactor-global-variables-out-of-functions.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/refactor-global-variables-out-of-functions.md
new file mode 100644
index 0000000000..33d95dd152
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/refactor-global-variables-out-of-functions.md
@@ -0,0 +1,141 @@
+---
+id: 587d7b8f367417b2b2512b60
+title: Refactor Global Variables Out of Functions
+challengeType: 1
+forumTopicId: 301235
+dashedName: 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. Hint: using something like `var newArr = arrVar`, where `arrVar` is an array will simply create a reference to the existing variable and not a copy. So changing a value in `newArr` would change the value in `arrVar`.
+
+2) Declare function parameters - any computation inside a function depends only on the arguments passed to the function, 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.
+
+# --instructions--
+
+Rewrite the code so the global array `bookList` is not changed inside either function. The `add` function should add the given `bookName` to the end of the array passed to it and return a new array (list). The `remove` function should remove the given `bookName` from the array passed to it.
+
+**Note:** Both functions should return an array, and any new parameters should be added before the `bookName` parameter.
+
+# --hints--
+
+`bookList` should not change and still equal `["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"]`.
+
+```js
+assert(
+  JSON.stringify(bookList) ===
+    JSON.stringify([
+      'The Hound of the Baskervilles',
+      'On The Electrodynamics of Moving Bodies',
+      'Philosophiæ Naturalis Principia Mathematica',
+      'Disquisitiones Arithmeticae'
+    ])
+);
+```
+
+`newBookList` should equal `["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae", "A Brief History of Time"]`.
+
+```js
+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'
+    ])
+);
+```
+
+`newerBookList` should equal `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"]`.
+
+```js
+assert(
+  JSON.stringify(newerBookList) ===
+    JSON.stringify([
+      'The Hound of the Baskervilles',
+      'Philosophiæ Naturalis Principia Mathematica',
+      'Disquisitiones Arithmeticae'
+    ])
+);
+```
+
+`newestBookList` should equal `["The Hound of the Baskervilles", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae", "A Brief History of Time"]`.
+
+```js
+assert(
+  JSON.stringify(newestBookList) ===
+    JSON.stringify([
+      'The Hound of the Baskervilles',
+      'Philosophiæ Naturalis Principia Mathematica',
+      'Disquisitiones Arithmeticae',
+      'A Brief History of Time'
+    ])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// The global variable
+var bookList = ["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"];
+
+// Change code below this line
+function add (bookName) {
+
+  bookList.push(bookName);
+  return bookList;
+  
+  // Change code above this line
+}
+
+// Change code below this line
+function remove (bookName) {
+  var book_index = bookList.indexOf(bookName);
+  if (book_index >= 0) {
+
+    bookList.splice(book_index, 1);
+    return bookList;
+
+    // Change 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);
+```
+
+# --solutions--
+
+```js
+// The global variable
+var bookList = ["The Hound of the Baskervilles", "On The Electrodynamics of Moving Bodies", "Philosophiæ Naturalis Principia Mathematica", "Disquisitiones Arithmeticae"];
+
+function add (bookList, bookName) {
+  return [...bookList, bookName];
+}
+
+function remove (bookList, bookName) {
+  const bookListCopy = [...bookList];
+  const bookNameIndex = bookList.indexOf(bookName);
+  if (bookNameIndex >= 0) {
+    bookListCopy.splice(bookNameIndex, 1);
+  }
+  return bookListCopy;
+}
+
+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');
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/remove-elements-from-an-array-using-slice-instead-of-splice.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/remove-elements-from-an-array-using-slice-instead-of-splice.md
new file mode 100644
index 0000000000..e8e2542d9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/remove-elements-from-an-array-using-slice-instead-of-splice.md
@@ -0,0 +1,86 @@
+---
+id: 9d7123c8c441eeafaeb5bdef
+title: Remove Elements from an Array Using slice Instead of splice
+challengeType: 1
+forumTopicId: 301236
+dashedName: 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 `splice` 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 `splice` method mutates the original array it is called on. Here's an example:
+
+```js
+var cities = ["Chicago", "Delhi", "Islamabad", "London", "Berlin"];
+cities.splice(3, 1);
+```
+
+Here `splice` returns the string `London` and deletes it from the cities array. `cities` will have the value `["Chicago", "Delhi", "Islamabad", "Berlin"]`.
+
+As we saw in the last challenge, the `slice` method does not mutate the original array, but returns a new one which can be saved into a variable. Recall that the `slice` 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 `slice` method instead of `splice` helps to avoid any array-mutating side effects.
+
+# --instructions--
+
+Rewrite the function `nonMutatingSplice` by using `slice` instead of `splice`. It should limit the provided `cities` 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.
+
+# --hints--
+
+Your code should use the `slice` method.
+
+```js
+assert(code.match(/\.slice/g));
+```
+
+Your code should not use the `splice` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?splice/g));
+```
+
+The `inputCities` array should not change.
+
+```js
+assert(
+  JSON.stringify(inputCities) ===
+    JSON.stringify(['Chicago', 'Delhi', 'Islamabad', 'London', 'Berlin'])
+);
+```
+
+`nonMutatingSplice(["Chicago", "Delhi", "Islamabad", "London", "Berlin"])` should return `["Chicago", "Delhi", "Islamabad"]`.
+
+```js
+assert(
+  JSON.stringify(
+    nonMutatingSplice(['Chicago', 'Delhi', 'Islamabad', 'London', 'Berlin'])
+  ) === JSON.stringify(['Chicago', 'Delhi', 'Islamabad'])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nonMutatingSplice(cities) {
+  // Only change code below this line
+  return cities.splice(3);
+
+  // Only change code above this line
+}
+var inputCities = ["Chicago", "Delhi", "Islamabad", "London", "Berlin"];
+nonMutatingSplice(inputCities);
+```
+
+# --solutions--
+
+```js
+function nonMutatingSplice(cities) {
+  // Only change code below this line
+  return cities.slice(0,3);
+  // Only change code above this line
+}
+var inputCities = ["Chicago", "Delhi", "Islamabad", "London", "Berlin"];
+nonMutatingSplice(inputCities);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-a-sorted-array-without-changing-the-original-array.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-a-sorted-array-without-changing-the-original-array.md
new file mode 100644
index 0000000000..6a04216752
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-a-sorted-array-without-changing-the-original-array.md
@@ -0,0 +1,91 @@
+---
+id: 587d7da9367417b2b2512b6a
+title: Return a Sorted Array Without Changing the Original Array
+challengeType: 1
+forumTopicId: 301237
+dashedName: return-a-sorted-array-without-changing-the-original-array
+---
+
+# --description--
+
+A side effect of the `sort` 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 `slice` and `concat` return a new array), then run the `sort` method.
+
+# --instructions--
+
+Use the `sort` method in the `nonMutatingSort` function to sort the elements of an array in ascending order. The function should return a new array, and not mutate the `globalArray` variable.
+
+# --hints--
+
+Your code should use the `sort` method.
+
+```js
+assert(nonMutatingSort.toString().match(/\.sort/g));
+```
+
+The `globalArray` variable should not change.
+
+```js
+assert(JSON.stringify(globalArray) === JSON.stringify([5, 6, 3, 2, 9]));
+```
+
+`nonMutatingSort(globalArray)` should return `[2, 3, 5, 6, 9]`.
+
+```js
+assert(
+  JSON.stringify(nonMutatingSort(globalArray)) ===
+    JSON.stringify([2, 3, 5, 6, 9])
+);
+```
+
+`nonMutatingSort(globalArray)` should not be hard coded.
+
+```js
+assert(!nonMutatingSort.toString().match(/[23569]/g));
+```
+
+The function should return a new array, not the array passed to it.
+
+```js
+assert(nonMutatingSort(globalArray) !== globalArray);
+```
+
+`nonMutatingSort([1, 30, 4, 21, 100000])` should return `[1, 4, 21, 30, 100000]`.
+
+```js
+assert(JSON.stringify(nonMutatingSort([1, 30, 4, 21, 100000])) ===
+    JSON.stringify([1, 4, 21, 30, 100000]))
+```
+
+`nonMutatingSort([140000, 104, 99])` should return `[99, 104, 140000]`.
+
+```js
+assert(JSON.stringify(nonMutatingSort([140000, 104, 99])) ===
+    JSON.stringify([99, 104, 140000]))
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var globalArray = [5, 6, 3, 2, 9];
+function nonMutatingSort(arr) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+nonMutatingSort(globalArray);
+```
+
+# --solutions--
+
+```js
+var globalArray = [5, 6, 3, 2, 9];
+function nonMutatingSort(arr) {
+  // Only change code below this line
+  return [].concat(arr).sort((a,b) => a-b);
+  // Only change code above this line
+}
+nonMutatingSort(globalArray);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-part-of-an-array-using-the-slice-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-part-of-an-array-using-the-slice-method.md
new file mode 100644
index 0000000000..2cf17e7466
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/return-part-of-an-array-using-the-slice-method.md
@@ -0,0 +1,95 @@
+---
+id: 587d7b90367417b2b2512b65
+title: Return Part of an Array Using the slice Method
+challengeType: 1
+forumTopicId: 301239
+dashedName: return-part-of-an-array-using-the-slice-method
+---
+
+# --description--
+
+The `slice` 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 `slice` method does not mutate the original array, but returns a new one.
+
+Here's an example:
+
+```js
+var arr = ["Cat", "Dog", "Tiger", "Zebra"];
+var newArray = arr.slice(1, 3);
+```
+
+`newArray` would have the value `["Dog", "Tiger"]`.
+
+# --instructions--
+
+Use the `slice` method in the `sliceArray` function to return part of the `anim` array given the provided `beginSlice` and `endSlice` indices. The function should return an array.
+
+# --hints--
+
+Your code should use the `slice` method.
+
+```js
+assert(code.match(/\.slice/g));
+```
+
+The `inputAnim` variable should not change.
+
+```js
+assert(
+  JSON.stringify(inputAnim) ===
+    JSON.stringify(['Cat', 'Dog', 'Tiger', 'Zebra', 'Ant'])
+);
+```
+
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 3)` should return `["Dog", "Tiger"]`.
+
+```js
+assert(
+  JSON.stringify(sliceArray(['Cat', 'Dog', 'Tiger', 'Zebra', 'Ant'], 1, 3)) ===
+    JSON.stringify(['Dog', 'Tiger'])
+);
+```
+
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 0, 1)` should return `["Cat"]`.
+
+```js
+assert(
+  JSON.stringify(sliceArray(['Cat', 'Dog', 'Tiger', 'Zebra', 'Ant'], 0, 1)) ===
+    JSON.stringify(['Cat'])
+);
+```
+
+`sliceArray(["Cat", "Dog", "Tiger", "Zebra", "Ant"], 1, 4)` should return `["Dog", "Tiger", "Zebra"]`.
+
+```js
+assert(
+  JSON.stringify(sliceArray(['Cat', 'Dog', 'Tiger', 'Zebra', 'Ant'], 1, 4)) ===
+    JSON.stringify(['Dog', 'Tiger', 'Zebra'])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sliceArray(anim, beginSlice, endSlice) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+var inputAnim = ["Cat", "Dog", "Tiger", "Zebra", "Ant"];
+sliceArray(inputAnim, 1, 3);
+```
+
+# --solutions--
+
+```js
+function sliceArray(anim, beginSlice, endSlice) {
+  // Only change code below this line
+  return anim.slice(beginSlice, endSlice)
+  // Only change code above this line
+}
+var inputAnim = ["Cat", "Dog", "Tiger", "Zebra", "Ant"];
+sliceArray(inputAnim, 1, 3);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/sort-an-array-alphabetically-using-the-sort-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/sort-an-array-alphabetically-using-the-sort-method.md
new file mode 100644
index 0000000000..eac62b543b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/sort-an-array-alphabetically-using-the-sort-method.md
@@ -0,0 +1,101 @@
+---
+id: 587d7da9367417b2b2512b69
+title: Sort an Array Alphabetically using the sort Method
+challengeType: 1
+forumTopicId: 18303
+dashedName: sort-an-array-alphabetically-using-the-sort-method
+---
+
+# --description--
+
+The `sort` method sorts the elements of an array according to the callback function.
+
+For example:
+
+```js
+function ascendingOrder(arr) {
+  return arr.sort(function(a, b) {
+    return a - b;
+  });
+}
+ascendingOrder([1, 5, 2, 3, 4]);
+```
+
+This would return the value `[1, 2, 3, 4, 5]`.
+
+```js
+function reverseAlpha(arr) {
+  return arr.sort(function(a, b) {
+    return a === b ? 0 : a < b ? 1 : -1;
+  });
+}
+reverseAlpha(['l', 'h', 'z', 'b', 's']);
+```
+
+This would return the value `['z', 's', 'l', 'h', 'b']`.
+
+JavaScript's default sorting method is by string Unicode point value, which may return unexpected results. Therefore, it is encouraged to provide a callback function to specify how to sort the array items. When such a callback function, normally called `compareFunction`, is supplied, the array elements are sorted according to the return value of the `compareFunction`: If `compareFunction(a,b)` returns a value less than 0 for two elements `a` and `b`, then `a` will come before `b`. If `compareFunction(a,b)` returns a value greater than 0 for two elements `a` and `b`, then `b` will come before `a`. If `compareFunction(a,b)` returns a value equal to 0 for two elements `a` and `b`, then `a` and `b` will remain unchanged.
+
+# --instructions--
+
+Use the `sort` method in the `alphabeticalOrder` function to sort the elements of `arr` in alphabetical order.
+
+# --hints--
+
+Your code should use the `sort` method.
+
+```js
+assert(code.match(/\.sort/g));
+```
+
+`alphabeticalOrder(["a", "d", "c", "a", "z", "g"])` should return `["a", "a", "c", "d", "g", "z"]`.
+
+```js
+assert(
+  JSON.stringify(alphabeticalOrder(['a', 'd', 'c', 'a', 'z', 'g'])) ===
+    JSON.stringify(['a', 'a', 'c', 'd', 'g', 'z'])
+);
+```
+
+`alphabeticalOrder(["x", "h", "a", "m", "n", "m"])` should return `["a", "h", "m", "m", "n", "x"]`.
+
+```js
+assert(
+  JSON.stringify(alphabeticalOrder(['x', 'h', 'a', 'm', 'n', 'm'])) ===
+    JSON.stringify(['a', 'h', 'm', 'm', 'n', 'x'])
+);
+```
+
+`alphabeticalOrder(["a", "a", "a", "a", "x", "t"])` should return `["a", "a", "a", "a", "t", "x"]`.
+
+```js
+assert(
+  JSON.stringify(alphabeticalOrder(['a', 'a', 'a', 'a', 'x', 't'])) ===
+    JSON.stringify(['a', 'a', 'a', 'a', 't', 'x'])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function alphabeticalOrder(arr) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+alphabeticalOrder(["a", "d", "c", "a", "z", "g"]);
+```
+
+# --solutions--
+
+```js
+function alphabeticalOrder(arr) {
+  // Only change code below this line
+  return arr.sort();
+  // Only change code above this line
+}
+alphabeticalOrder(["a", "d", "c", "a", "z", "g"]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/split-a-string-into-an-array-using-the-split-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/split-a-string-into-an-array-using-the-split-method.md
new file mode 100644
index 0000000000..d2d7eeeb9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/split-a-string-into-an-array-using-the-split-method.md
@@ -0,0 +1,88 @@
+---
+id: 587d7daa367417b2b2512b6b
+title: Split a String into an Array Using the split Method
+challengeType: 1
+forumTopicId: 18305
+dashedName: split-a-string-into-an-array-using-the-split-method
+---
+
+# --description--
+
+The `split` 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:
+
+```js
+var str = "Hello World";
+var bySpace = str.split(" ");
+
+var otherString = "How9are7you2today";
+var byDigits = otherString.split(/\d/);
+```
+
+`bySpace` would have the value `["Hello", "World"]` and `byDigits` would have the value `["How", "are", "you", "today"]`.
+
+Since strings are immutable, the `split` method makes it easier to work with them.
+
+# --instructions--
+
+Use the `split` method inside the `splitify` function to split `str` 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.
+
+# --hints--
+
+Your code should use the `split` method.
+
+```js
+assert(code.match(/\.split/g));
+```
+
+`splitify("Hello World,I-am code")` should return `["Hello", "World", "I", "am", "code"]`.
+
+```js
+assert(
+  JSON.stringify(splitify('Hello World,I-am code')) ===
+    JSON.stringify(['Hello', 'World', 'I', 'am', 'code'])
+);
+```
+
+`splitify("Earth-is-our home")` should return `["Earth", "is", "our", "home"]`.
+
+```js
+assert(
+  JSON.stringify(splitify('Earth-is-our home')) ===
+    JSON.stringify(['Earth', 'is', 'our', 'home'])
+);
+```
+
+`splitify("This.is.a-sentence")` should return `["This", "is", "a", "sentence"]`.
+
+```js
+assert(
+  JSON.stringify(splitify('This.is.a-sentence')) ===
+    JSON.stringify(['This', 'is', 'a', 'sentence'])
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function splitify(str) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+splitify("Hello World,I-am code");
+```
+
+# --solutions--
+
+```js
+function splitify(str) {
+  // Only change code below this line
+  return str.split(/\W/);
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
new file mode 100644
index 0000000000..c292a9c493
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-functional-programming-terminology.md
@@ -0,0 +1,112 @@
+---
+id: 587d7b8e367417b2b2512b5c
+title: Understand Functional Programming Terminology
+challengeType: 1
+forumTopicId: 301240
+dashedName: 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 `getTea` function from last challenge to handle various tea requests. We can modify `getTea` to accept a function as a parameter to be able to change the type of tea it prepares. This makes `getTea` more flexible, and gives the programmer more control when client requests change.
+
+But first, let's cover some functional terminology:
+
+<dfn>Callbacks</dfn> 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 `filter`, 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 <dfn>first class</dfn> functions. In JavaScript, all functions are first class functions.
+
+The functions that take a function as an argument, or return a function as a return value are called <dfn>higher order</dfn> functions.
+
+When functions are passed in to or returned from another function, then those functions which were passed in or returned can be called a <dfn>lambda</dfn>.
+
+# --instructions--
+
+Prepare 27 cups of green tea and 13 cups of black tea and store them in `tea4GreenTeamFCC` and `tea4BlackTeamFCC` variables, respectively. Note that the `getTea` 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.
+
+# --hints--
+
+The `tea4GreenTeamFCC` variable should hold 27 cups of green tea for the team.
+
+```js
+assert(tea4GreenTeamFCC.length === 27);
+```
+
+The `tea4GreenTeamFCC` variable should hold cups of green tea.
+
+```js
+assert(tea4GreenTeamFCC[0] === 'greenTea');
+```
+
+The `tea4BlackTeamFCC` variable should hold 13 cups of black tea.
+
+```js
+assert(tea4BlackTeamFCC.length === 13);
+```
+
+The `tea4BlackTeamFCC` variable should hold cups of black tea.
+
+```js
+assert(tea4BlackTeamFCC[0] === 'blackTea');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Function that returns a string representing a cup of green tea
+const prepareGreenTea = () => 'greenTea';
+
+// Function that returns a string representing a cup of black tea
+const prepareBlackTea = () => 'blackTea';
+
+/*
+Given a function (representing the tea type) and number of cups needed, the
+following function returns an array of strings (each representing a cup of
+a specific type of tea).
+*/
+const getTea = (prepareTea, numOfCups) => {
+  const teaCups = [];
+
+  for(let cups = 1; cups <= numOfCups; cups += 1) {
+    const teaCup = prepareTea();
+    teaCups.push(teaCup);
+  }
+  return teaCups;
+};
+
+// Only change code below this line
+const tea4GreenTeamFCC = null;
+const tea4BlackTeamFCC = null;
+// Only change code above this line
+
+console.log(
+  tea4GreenTeamFCC,
+  tea4BlackTeamFCC
+);
+```
+
+# --solutions--
+
+```js
+const prepareGreenTea = () => 'greenTea';
+const prepareBlackTea = () => 'blackTea';
+
+const getTea = (prepareTea, numOfCups) => {
+  const teaCups = [];
+
+  for(let cups = 1; cups <= numOfCups; cups += 1) {
+    const teaCup = prepareTea();
+    teaCups.push(teaCup);
+  }
+  return teaCups;
+};
+
+const tea4BlackTeamFCC = getTea(prepareBlackTea, 13);
+const tea4GreenTeamFCC = getTea(prepareGreenTea, 27);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-the-hazards-of-using-imperative-code.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-the-hazards-of-using-imperative-code.md
new file mode 100644
index 0000000000..f717be6c1e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/understand-the-hazards-of-using-imperative-code.md
@@ -0,0 +1,145 @@
+---
+id: 587d7b8e367417b2b2512b5d
+title: Understand the Hazards of Using Imperative Code
+challengeType: 1
+forumTopicId: 301241
+dashedName: 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 `for` 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 `for` loop mentioned above, you could call the `map` 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 `tabOpen()`, `tabClose()`, and `join()`. The array `tabs` is part of the Window object that stores the name of the open pages.
+
+# --instructions--
+
+Examine the code in the editor. It's using a method that has side effects in the program, causing incorrect behaviour. The final list of open tabs, stored in `finalTabs.tabs`, should be `['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'new tab', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']` but the list produced by the code is slightly different.
+
+Change `Window.prototype.tabClose` so that it removes the correct tab.
+
+# --hints--
+
+`finalTabs.tabs` should be `['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'new tab', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']`
+
+```js
+assert.deepEqual(finalTabs.tabs, [
+  'FB',
+  'Gitter',
+  'Reddit',
+  'Twitter',
+  'Medium',
+  'new tab',
+  'Netflix',
+  'YouTube',
+  'Vine',
+  'GMail',
+  'Work mail',
+  'Docs',
+  'freeCodeCamp',
+  'new tab'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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) {
+
+  // Only change code below this line
+
+  var tabsBeforeIndex = this.tabs.splice(0, index); // Get the tabs before the tab
+  var tabsAfterIndex = this.tabs.splice(index + 1); // Get the tabs after the tab
+
+  this.tabs = tabsBeforeIndex.concat(tabsAfterIndex); // Join them together
+
+  // Only change code above this line
+
+  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());
+console.log(finalTabs.tabs);
+```
+
+# --solutions--
+
+```js
+// 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.slice(0, index); // Get the tabs before the tab
+  var tabsAfterIndex = this.tabs.slice(index + 1); // 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());
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem.md
new file mode 100644
index 0000000000..3b80b6677c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem.md
@@ -0,0 +1,97 @@
+---
+id: 587d7b88367417b2b2512b45
+title: 'Use Higher-Order Functions map, filter, or reduce to Solve a Complex Problem'
+challengeType: 1
+forumTopicId: 301311
+dashedName: use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem
+---
+
+# --description--
+
+Now that you have worked through a few challenges using higher-order functions like `map()`, `filter()`, and `reduce()`, you now get to apply them to solve a more complex challenge.
+
+# --instructions--
+
+Complete the code for the `squareList` function using any combination of `map()`, `filter()`, and `reduce()`. The function should return a new array containing the squares of *only* the positive integers (decimal numbers are not integers) when an array of real numbers is passed to it. An example of an array of real numbers is `[-3, 4.8, 5, 3, -3.2]`.
+
+**Note:** Your function should not use any kind of `for` or `while` loops or the `forEach()` function.
+
+# --hints--
+
+`squareList` should be a `function`.
+
+```js
+assert.typeOf(squareList, 'function'),
+  '<code>squareList</code> should be a <code>function</code>';
+```
+
+`for`, `while`, and `forEach` should not be used.
+
+```js
+assert(!code.match(/for|while|forEach/g));
+```
+
+`map`, `filter`, or `reduce` should be used.
+
+```js
+assert(
+  __helpers
+    .removeWhiteSpace(code)
+    .match(/\.(map|filter|reduce)\(/g)
+);
+```
+
+The function should return an `array`.
+
+```js
+assert(Array.isArray(squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2])));
+```
+
+`squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2])` should return `[16, 1764, 36]`.
+
+```js
+assert.deepStrictEqual(squareList([4, 5.6, -9.8, 3.14, 42, 6, 8.34, -2]), [
+  16,
+  1764,
+  36
+]);
+```
+
+`squareList([-3.7, -5, 3, 10, 12.5, 7, -4.5, -17, 0.3])` should return `[9, 100, 49]`.
+
+```js
+assert.deepStrictEqual(squareList([-3.7, -5, 3, 10, 12.5, 7, -4.5, -17, 0.3]), [
+  9,
+  100,
+  49
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const squareList = arr => {
+  // Only change code below this line
+  return arr;
+  // Only change code above this line
+};
+
+const squaredIntegers = squareList([-3, 4.8, 5, 3, -3.2]);
+console.log(squaredIntegers);
+```
+
+# --solutions--
+
+```js
+const squareList = arr => {
+  const positiveIntegers = arr.filter(num => {
+    return num >= 0 && Number.isInteger(num);
+  });
+  const squaredIntegers = positiveIntegers.map(num => {
+    return num ** 2;
+  });
+  return squaredIntegers;
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria.md
new file mode 100644
index 0000000000..efea709677
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria.md
@@ -0,0 +1,77 @@
+---
+id: 587d7dab367417b2b2512b6e
+title: Use the every Method to Check that Every Element in an Array Meets a Criteria
+challengeType: 1
+forumTopicId: 301312
+dashedName: use-the-every-method-to-check-that-every-element-in-an-array-meets-a-criteria
+---
+
+# --description--
+
+The `every` method works with arrays to check if *every* element passes a particular test. It returns a Boolean value - `true` if all values meet the criteria, `false` if not.
+
+For example, the following code would check if every element in the `numbers` array is less than 10:
+
+```js
+var numbers = [1, 5, 8, 0, 10, 11];
+numbers.every(function(currentValue) {
+  return currentValue < 10;
+});
+```
+
+The `every` method would return `false` here.
+
+# --instructions--
+
+Use the `every` method inside the `checkPositive` function to check if every element in `arr` is positive. The function should return a Boolean value.
+
+# --hints--
+
+Your code should use the `every` method.
+
+```js
+assert(code.match(/\.every/g));
+```
+
+`checkPositive([1, 2, 3, -4, 5])` should return `false`.
+
+```js
+assert.isFalse(checkPositive([1, 2, 3, -4, 5]));
+```
+
+`checkPositive([1, 2, 3, 4, 5])` should return `true`.
+
+```js
+assert.isTrue(checkPositive([1, 2, 3, 4, 5]));
+```
+
+`checkPositive([1, -2, 3, -4, 5])` should return `false`.
+
+```js
+assert.isFalse(checkPositive([1, -2, 3, -4, 5]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkPositive(arr) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+checkPositive([1, 2, 3, -4, 5]);
+```
+
+# --solutions--
+
+```js
+function checkPositive(arr) {
+  // Only change code below this line
+  return arr.every(num => num > 0);
+  // Only change code above this line
+}
+checkPositive([1, 2, 3, -4, 5]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-filter-method-to-extract-data-from-an-array.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-filter-method-to-extract-data-from-an-array.md
new file mode 100644
index 0000000000..8a0945dcc9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-filter-method-to-extract-data-from-an-array.md
@@ -0,0 +1,317 @@
+---
+id: 587d7b8f367417b2b2512b63
+title: Use the filter Method to Extract Data from an Array
+challengeType: 1
+forumTopicId: 18179
+dashedName: use-the-filter-method-to-extract-data-from-an-array
+---
+
+# --description--
+
+Another useful array function is `Array.prototype.filter()`, or simply `filter()`.
+
+`filter` calls a function on each element of an array and returns a new array containing only the elements for which that function returns `true`. In other words, it filters the array, based on the function passed to it. Like `map`, it does this without needing to modify the original array.
+
+The callback function accepts three arguments. The first argument is the current element being processed. The second is the index of that element and the third is the array upon which the `filter` method was called.
+
+See below for an example using the `filter` method on the `users` array to return a new array containing only the users under the age of 30. For simplicity, the example only uses the first argument of the callback.
+
+```js
+const users = [
+  { name: 'John', age: 34 },
+  { name: 'Amy', age: 20 },
+  { name: 'camperCat', age: 10 }
+];
+
+const usersUnder30 = users.filter(user => user.age < 30);
+console.log(usersUnder30); 
+```
+
+The console would display the value `[ { name: 'Amy', age: 20 }, { name: 'camperCat', age: 10 } ]`.
+
+# --instructions--
+
+The variable `watchList` holds an array of objects with information on several movies. Use a combination of `filter` and `map` on `watchList` to assign a new array of objects with only `title` and `rating` keys. The new array should only include objects where `imdbRating` is greater than or equal to 8.0. Note that the `rating` values are saved as strings in the object and you may need to convert them into numbers to perform mathematical operations on them.
+
+# --hints--
+
+The `watchList` variable should not change.
+
+```js
+assert(
+  watchList[0].Title === 'Inception' && watchList[4].Director == 'James Cameron'
+);
+```
+
+Your code should use the `filter` method.
+
+```js
+assert(code.match(/\s*\.\s*filter/g));
+```
+
+Your code should not use a `for` loop.
+
+```js
+assert(!code.match(/for\s*?\([\s\S]*?\)/g));
+```
+
+`filteredList` should equal `[{"title": "Inception","rating": "8.8"},{"title": "Interstellar","rating": "8.6"},{"title": "The Dark Knight","rating": "9.0"},{"title": "Batman Begins","rating": "8.3"}]`.
+
+```js
+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' }
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+// Only change code below this line
+
+var filteredList;
+
+// Only change code above this line
+
+console.log(filteredList);
+```
+
+# --solutions--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+// Only change code below this line
+let filteredList = watchList.filter(e => e.imdbRating >= 8).map( ({Title: title, imdbRating: rating}) => ({title, rating}) );
+// Only change code above this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-map-method-to-extract-data-from-an-array.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-map-method-to-extract-data-from-an-array.md
new file mode 100644
index 0000000000..253dfefbd6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-map-method-to-extract-data-from-an-array.md
@@ -0,0 +1,330 @@
+---
+id: 587d7b8f367417b2b2512b61
+title: Use the map Method to Extract Data from an Array
+challengeType: 1
+forumTopicId: 18214
+dashedName: 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 <dfn>first class objects</dfn> 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 `Array.prototype.map()`, or more simply `map`.
+
+The `map` method iterates over each item in an array and returns a new array containing the results of calling the callback function on each element. It does this without mutating the original array.
+
+When the callback is used, it is passed three arguments. The first argument is the current element being processed. The second is the index of that element and the third is the array upon which the `map` method was called.
+
+See below for an example using the `map` method on the `users` array to return a new array containing only the names of the users as elements. For simplicity, the example only uses the first argument of the callback.
+
+```js
+const users = [
+  { name: 'John', age: 34 },
+  { name: 'Amy', age: 20 },
+  { name: 'camperCat', age: 10 }
+];
+
+const names = users.map(user => user.name);
+console.log(names);
+```
+
+The console would display the value ` [ 'John', 'Amy', 'camperCat' ]`.
+
+# --instructions--
+
+The `watchList` array holds objects with information on several movies. Use `map` on `watchList` to assign a new array of objects with only `title` and `rating` keys to the `ratings` variable. The code in the editor currently uses a `for` loop to do this, so you should replace the loop functionality with your `map` expression.
+
+# --hints--
+
+The `watchList` variable should not change.
+
+```js
+assert(
+  watchList[0].Title === 'Inception' && watchList[4].Director == 'James Cameron'
+);
+```
+
+Your code should not use a `for` loop.
+
+```js
+assert(!code.match(/for\s*?\([\s\S]*?\)/));
+```
+
+Your code should use the `map` method.
+
+```js
+assert(code.match(/\.map/g));
+```
+
+`ratings` should equal `[{"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"}]`.
+
+```js
+assert.deepEqual(ratings, [
+  { 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' }
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+// Only change code below this line
+
+var ratings = [];
+for(var i=0; i < watchList.length; i++){
+  ratings.push({title: watchList[i]["Title"],  rating: watchList[i]["imdbRating"]});
+}
+
+// Only change code above this line
+
+console.log(JSON.stringify(ratings));
+```
+
+# --solutions--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+var ratings = watchList.map(function(movie) {
+  return {
+    title: movie["Title"],
+    rating: movie["imdbRating"]
+  }
+});
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-reduce-method-to-analyze-data.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-reduce-method-to-analyze-data.md
new file mode 100644
index 0000000000..eb237053ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-reduce-method-to-analyze-data.md
@@ -0,0 +1,345 @@
+---
+id: 587d7da9367417b2b2512b68
+title: Use the reduce Method to Analyze Data
+challengeType: 1
+forumTopicId: 301313
+dashedName: use-the-reduce-method-to-analyze-data
+---
+
+# --description--
+
+`Array.prototype.reduce()`, or simply `reduce()`, is the most general of all array operations in JavaScript. You can solve almost any array processing problem using the `reduce` method.
+
+The `reduce` method allows for more general forms of array processing, and it's possible to show that both `filter` and `map` can be derived as special applications of `reduce`. The `reduce` method iterates over each item in an array and returns a single value (i.e. string, number, object, array). This is achieved via a callback function that is called on each iteration.
+
+The callback function accepts four arguments. The first argument is known as the accumulator, which gets assigned the return value of the callback function from the previous iteration, the second is the current element being processed, the third is the index of that element and the fourth is the array upon which `reduce` is called.
+
+In addition to the callback function, `reduce` has an additional parameter which takes an initial value for the accumulator. If this second parameter is not used, then the first iteration is skipped and the second iteration gets passed the first element of the array as the accumulator.
+
+See below for an example using `reduce` on the `users` array to return the sum of all the users' ages. For simplicity, the example only uses the first and second arguments.
+
+```js
+const users = [
+  { name: 'John', age: 34 },
+  { name: 'Amy', age: 20 },
+  { name: 'camperCat', age: 10 }
+];
+
+const sumOfAges = users.reduce((sum, user) => sum + user.age, 0);
+console.log(sumOfAges);
+```
+
+The console would display the value `64`.
+
+In another example, see how an object can be returned containing the names of the users as properties with their ages as values.
+
+```js
+const users = [
+  { name: 'John', age: 34 },
+  { name: 'Amy', age: 20 },
+  { name: 'camperCat', age: 10 }
+];
+
+const usersObj = users.reduce((obj, user) => {
+  obj[user.name] = user.age;
+  return obj;
+}, {});
+console.log(usersObj);
+```
+
+The console would display the value `{ John: 34, Amy: 20, camperCat: 10 }`.
+
+# --instructions--
+
+The variable `watchList` holds an array of objects with information on several movies. Use `reduce` to find the average IMDB rating of the movies directed by `Christopher Nolan`. Recall from prior challenges how to `filter` data and `map` over it to pull what you need. You may need to create other variables, and return the average rating from `getRating` function. 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.
+
+# --hints--
+
+The `watchList` variable should not change.
+
+```js
+assert(
+  watchList[0].Title === 'Inception' && watchList[4].Director == 'James Cameron'
+);
+```
+
+Your code should use the `reduce` method.
+
+```js
+assert(code.match(/\.reduce/g));
+```
+
+The `getRating(watchList)` should equal 8.675.
+
+```js
+assert(getRating(watchList) === 8.675);
+```
+
+Your code should not use a `for` loop.
+
+```js
+assert(!code.match(/for\s*?\([\s\S]*?\)/g));
+```
+
+Your code should return the correct output after modifying the `watchList` object.
+
+```js
+assert(getRating(watchList.filter((_, i) => i < 1 || i > 2)) === 8.55);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+function getRating(watchList){
+  // Only change code below this line
+  var averageRating;
+
+
+  // Only change code above this line
+  return averageRating;
+}
+console.log(getRating(watchList));
+```
+
+# --solutions--
+
+```js
+// 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, Elliot 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"
+  }
+];
+
+function getRating(watchList){
+  var averageRating;
+  const rating = watchList
+    .filter(obj => obj.Director === "Christopher Nolan")
+    .map(obj => Number(obj.imdbRating));
+  averageRating = rating.reduce((accum, curr) => accum + curr)/rating.length;
+  return averageRating;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria.md
new file mode 100644
index 0000000000..50654a12a3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/functional-programming/use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria.md
@@ -0,0 +1,77 @@
+---
+id: 587d7dab367417b2b2512b6f
+title: Use the some Method to Check that Any Elements in an Array Meet a Criteria
+challengeType: 1
+forumTopicId: 301314
+dashedName: use-the-some-method-to-check-that-any-elements-in-an-array-meet-a-criteria
+---
+
+# --description--
+
+The `some` method works with arrays to check if *any* element passes a particular test. It returns a Boolean value - `true` if any of the values meet the criteria, `false` if not.
+
+For example, the following code would check if any element in the `numbers` array is less than 10:
+
+```js
+var numbers = [10, 50, 8, 220, 110, 11];
+numbers.some(function(currentValue) {
+  return currentValue < 10;
+});
+```
+
+The `some` method would return `true`.
+
+# --instructions--
+
+Use the `some` method inside the `checkPositive` function to check if any element in `arr` is positive. The function should return a Boolean value.
+
+# --hints--
+
+Your code should use the `some` method.
+
+```js
+assert(code.match(/\.some/g));
+```
+
+`checkPositive([1, 2, 3, -4, 5])` should return `true`.
+
+```js
+assert(checkPositive([1, 2, 3, -4, 5]));
+```
+
+`checkPositive([1, 2, 3, 4, 5])` should return `true`.
+
+```js
+assert(checkPositive([1, 2, 3, 4, 5]));
+```
+
+`checkPositive([-1, -2, -3, -4, -5])` should return `false`.
+
+```js
+assert(!checkPositive([-1, -2, -3, -4, -5]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkPositive(arr) {
+  // Only change code below this line
+
+
+  // Only change code above this line
+}
+checkPositive([1, 2, 3, -4, 5]);
+```
+
+# --solutions--
+
+```js
+function checkPositive(arr) {
+  // Only change code below this line
+  return arr.some(elem => elem > 0);
+  // Only change code above this line
+}
+checkPositive([1, 2, 3, -4, 5]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/arguments-optional.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/arguments-optional.md
new file mode 100644
index 0000000000..b1aaabd91e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/arguments-optional.md
@@ -0,0 +1,91 @@
+---
+id: a97fd23d9b809dac9921074f
+title: Arguments Optional
+challengeType: 5
+forumTopicId: 14271
+dashedName: 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, `addTogether(2, 3)` should return `5`, and `addTogether(2)` should return a function.
+
+Calling this returned function with a single argument will then return the sum:
+
+```js
+var sumTwoAnd = addTogether(2);
+```
+
+`sumTwoAnd(3)` returns `5`.
+
+If either argument isn't a valid number, return undefined.
+
+# --hints--
+
+`addTogether(2, 3)` should return 5.
+
+```js
+assert.deepEqual(addTogether(2, 3), 5);
+```
+
+`addTogether(23, 30)` should return 53.
+
+```js
+assert.deepEqual(addTogether(23, 30), 53);
+```
+
+`addTogether(5)(7)` should return 12.
+
+```js
+assert.deepEqual(addTogether(5)(7), 12);
+```
+
+`addTogether("http://bit.ly/IqT6zt")` should return `undefined`.
+
+```js
+assert.isUndefined(addTogether('http://bit.ly/IqT6zt'));
+```
+
+`addTogether(2, "3")` should return `undefined`.
+
+```js
+assert.isUndefined(addTogether(2, '3'));
+```
+
+`addTogether(2)([3])` should return `undefined`.
+
+```js
+assert.isUndefined(addTogether(2)([3]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function addTogether() {
+  return false;
+}
+
+addTogether(2,3);
+```
+
+# --solutions--
+
+```js
+function addTogether() {
+  var a = arguments[0];
+  if (toString.call(a) !== '[object Number]') return;
+  if (arguments.length === 1) {
+    return function(b) {
+      if (toString.call(b) !== '[object Number]') return;
+      return a + b;
+    };
+  }
+  var b = arguments[1];
+  if (toString.call(b) !== '[object Number]') return;
+  return a + arguments[1];
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents.md
new file mode 100644
index 0000000000..66194f80d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents.md
@@ -0,0 +1,57 @@
+---
+id: a8d97bd4c764e91f9d2bda01
+title: Binary Agents
+challengeType: 5
+forumTopicId: 14273
+dashedName: binary-agents
+---
+
+# --description--
+
+Return an English translated sentence of the passed binary string.
+
+The binary string will be space separated.
+
+# --hints--
+
+`binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111")` should return the string `Aren't bonfires fun!?`
+
+```js
+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!?"
+);
+```
+
+`binaryAgent("01001001 00100000 01101100 01101111 01110110 01100101 00100000 01000110 01110010 01100101 01100101 01000011 01101111 01100100 01100101 01000011 01100001 01101101 01110000 00100001")` should return the string `I love FreeCodeCamp!`
+
+```js
+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!'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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--
+
+```js
+function binaryAgent(str) {
+  return str.split(' ').map(function(s) { return parseInt(s, 2); }).map(function(b) { return String.fromCharCode(b);}).join('');
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/convert-html-entities.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/convert-html-entities.md
new file mode 100644
index 0000000000..5401c28249
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/convert-html-entities.md
@@ -0,0 +1,89 @@
+---
+id: a6b0bb188d873cb2c8729495
+title: Convert HTML Entities
+challengeType: 5
+forumTopicId: 16007
+dashedName: convert-html-entities
+---
+
+# --description--
+
+Convert the characters `&`, `<`, `>`, `"` (double quote), and `'` (apostrophe), in a string to their corresponding HTML entities.
+
+# --hints--
+
+`convertHTML("Dolce & Gabbana")` should return the string `Dolce &amp; Gabbana`.
+
+```js
+assert.match(convertHTML('Dolce & Gabbana'), /Dolce &amp; Gabbana/);
+```
+
+`convertHTML("Hamburgers < Pizza < Tacos")` should return the string `Hamburgers &lt; Pizza &lt; Tacos`.
+
+```js
+assert.match(
+  convertHTML('Hamburgers < Pizza < Tacos'),
+  /Hamburgers &lt; Pizza &lt; Tacos/
+);
+```
+
+`convertHTML("Sixty > twelve")` should return the string `Sixty &gt; twelve`.
+
+```js
+assert.match(convertHTML('Sixty > twelve'), /Sixty &gt; twelve/);
+```
+
+`convertHTML('Stuff in "quotation marks"')` should return the string `Stuff in &quot;quotation marks&quot;`.
+
+```js
+assert.match(
+  convertHTML('Stuff in "quotation marks"'),
+  /Stuff in &quot;quotation marks&quot;/
+);
+```
+
+`convertHTML("Schindler's List")` should return the string `Schindler&apos;s List`.
+
+```js
+assert.match(convertHTML("Schindler's List"), /Schindler&apos;s List/);
+```
+
+`convertHTML("<>")` should return the string `&lt;&gt;`.
+
+```js
+assert.match(convertHTML('<>'), /&lt;&gt;/);
+```
+
+`convertHTML("abc")` should return the string `abc`.
+
+```js
+assert.strictEqual(convertHTML('abc'), 'abc');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertHTML(str) {
+  return str;
+}
+
+convertHTML("Dolce & Gabbana");
+```
+
+# --solutions--
+
+```js
+var MAP = { '&': '&amp;',
+            '<': '&lt;',
+            '>': '&gt;',
+            '"': '&quot;',
+            "'": '&apos;'};
+
+function convertHTML(str) {
+  return str.replace(/[&<>"']/g, function(c) {
+    return MAP[c];
+  });
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays.md
new file mode 100644
index 0000000000..8ec9a4a02e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays.md
@@ -0,0 +1,190 @@
+---
+id: a5de63ebea8dbee56860f4f2
+title: Diff Two Arrays
+challengeType: 5
+forumTopicId: 16008
+dashedName: 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.
+
+**Note:** You can return the array with its elements in any order.
+
+# --hints--
+
+`diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5])` should return an array.
+
+```js
+assert(typeof diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]) === 'object');
+```
+
+`["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return `["pink wool"]`.
+
+```js
+assert.sameMembers(
+  diffArray(
+    ['diorite', 'andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'],
+    ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']
+  ),
+  ['pink wool']
+);
+```
+
+`["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return an array with one item.
+
+```js
+assert(
+  diffArray(
+    ['diorite', 'andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'],
+    ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']
+  ).length === 1
+);
+```
+
+`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return `["diorite", "pink wool"]`.
+
+```js
+assert.sameMembers(
+  diffArray(
+    ['andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'],
+    ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']
+  ),
+  ['diorite', 'pink wool']
+);
+```
+
+`["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]` should return an array with two items.
+
+```js
+assert(
+  diffArray(
+    ['andesite', 'grass', 'dirt', 'pink wool', 'dead shrub'],
+    ['diorite', 'andesite', 'grass', 'dirt', 'dead shrub']
+  ).length === 2
+);
+```
+
+`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` should return `[]`.
+
+```js
+assert.sameMembers(
+  diffArray(
+    ['andesite', 'grass', 'dirt', 'dead shrub'],
+    ['andesite', 'grass', 'dirt', 'dead shrub']
+  ),
+  []
+);
+```
+
+`["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"]` should return an empty array.
+
+```js
+assert(
+  diffArray(
+    ['andesite', 'grass', 'dirt', 'dead shrub'],
+    ['andesite', 'grass', 'dirt', 'dead shrub']
+  ).length === 0
+);
+```
+
+`[1, 2, 3, 5], [1, 2, 3, 4, 5]` should return `[4]`.
+
+```js
+assert.sameMembers(diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]), [4]);
+```
+
+`[1, 2, 3, 5], [1, 2, 3, 4, 5]` should return an array with one item.
+
+```js
+assert(diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]).length === 1);
+```
+
+`[1, "calf", 3, "piglet"], [1, "calf", 3, 4]` should return `["piglet", 4]`.
+
+```js
+assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]), [
+  'piglet',
+  4
+]);
+```
+
+`[1, "calf", 3, "piglet"], [1, "calf", 3, 4]` should return an array with two items.
+
+```js
+assert(diffArray([1, 'calf', 3, 'piglet'], [1, 'calf', 3, 4]).length === 2);
+```
+
+`[], ["snuffleupagus", "cookie monster", "elmo"]` should return `["snuffleupagus", "cookie monster", "elmo"]`.
+
+```js
+assert.sameMembers(diffArray([], ['snuffleupagus', 'cookie monster', 'elmo']), [
+  'snuffleupagus',
+  'cookie monster',
+  'elmo'
+]);
+```
+
+`[], ["snuffleupagus", "cookie monster", "elmo"]` should return an array with three items.
+
+```js
+assert(diffArray([], ['snuffleupagus', 'cookie monster', 'elmo']).length === 3);
+```
+
+`[1, "calf", 3, "piglet"], [7, "filly"]` should return `[1, "calf", 3, "piglet", 7, "filly"]`.
+
+```js
+assert.sameMembers(diffArray([1, 'calf', 3, 'piglet'], [7, 'filly']), [
+  1,
+  'calf',
+  3,
+  'piglet',
+  7,
+  'filly'
+]);
+```
+
+`[1, "calf", 3, "piglet"], [7, "filly"]` should return an array with six items.
+
+```js
+assert(diffArray([1, 'calf', 3, 'piglet'], [7, 'filly']).length === 6);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diffArray(arr1, arr2) {
+  var newArr = [];
+  return newArr;
+}
+
+diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]);
+```
+
+# --solutions--
+
+```js
+function diffArray(arr1, arr2) {
+  var newArr = [];
+  var h1 = Object.create(null);
+  arr1.forEach(function(e) {
+    h1[e] = e;
+  });
+
+  var h2 = Object.create(null);
+  arr2.forEach(function(e) {
+    h2[e] = e;
+  });
+
+  Object.keys(h1).forEach(function(e) {
+     if (!(e in h2)) newArr.push(h1[e]);
+  });
+  Object.keys(h2).forEach(function(e) {
+     if (!(e in h1)) newArr.push(h2[e]);
+  });
+  return newArr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing.md
new file mode 100644
index 0000000000..820dc6ac3e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing.md
@@ -0,0 +1,83 @@
+---
+id: afd15382cdfb22c9efe8b7de
+title: DNA Pairing
+challengeType: 5
+forumTopicId: 16009
+dashedName: 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.
+
+[Base pairs](http://en.wikipedia.org/wiki/Base_pair) 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.
+
+# --hints--
+
+`pairElement("ATCGA")` should return `[["A","T"],["T","A"],["C","G"],["G","C"],["A","T"]]`.
+
+```js
+assert.deepEqual(pairElement('ATCGA'), [
+  ['A', 'T'],
+  ['T', 'A'],
+  ['C', 'G'],
+  ['G', 'C'],
+  ['A', 'T']
+]);
+```
+
+`pairElement("TTGAG")` should return `[["T","A"],["T","A"],["G","C"],["A","T"],["G","C"]]`.
+
+```js
+assert.deepEqual(pairElement('TTGAG'), [
+  ['T', 'A'],
+  ['T', 'A'],
+  ['G', 'C'],
+  ['A', 'T'],
+  ['G', 'C']
+]);
+```
+
+`pairElement("CTCTA")` should return `[["C","G"],["T","A"],["C","G"],["T","A"],["A","T"]]`.
+
+```js
+assert.deepEqual(pairElement('CTCTA'), [
+  ['C', 'G'],
+  ['T', 'A'],
+  ['C', 'G'],
+  ['T', 'A'],
+  ['A', 'T']
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pairElement(str) {
+  return str;
+}
+
+pairElement("GCG");
+```
+
+# --solutions--
+
+```js
+var lookup = Object.create(null);
+lookup.A = 'T';
+lookup.T = 'A';
+lookup.C = 'G';
+lookup.G = 'C';
+
+function pairElement(str) {
+ return str.split('').map(function(p) {return [p, lookup[p]];});
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it.md
new file mode 100644
index 0000000000..b2d97fca2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it.md
@@ -0,0 +1,104 @@
+---
+id: a5deed1811a43193f9f1c841
+title: Drop it
+challengeType: 5
+forumTopicId: 16010
+dashedName: drop-it
+---
+
+# --description--
+
+Given the array `arr`, iterate through and remove each element starting from the first element (the 0 index) until the function `func` returns `true` when the iterated element is passed through it.
+
+Then return the rest of the array once the condition is satisfied, otherwise, `arr` should be returned as an empty array.
+
+# --hints--
+
+`dropElements([1, 2, 3, 4], function(n) {return n >= 3;})` should return `[3, 4]`.
+
+```js
+assert.deepEqual(
+  dropElements([1, 2, 3, 4], function (n) {
+    return n >= 3;
+  }),
+  [3, 4]
+);
+```
+
+`dropElements([0, 1, 0, 1], function(n) {return n === 1;})` should return `[1, 0, 1]`.
+
+```js
+assert.deepEqual(
+  dropElements([0, 1, 0, 1], function (n) {
+    return n === 1;
+  }),
+  [1, 0, 1]
+);
+```
+
+`dropElements([1, 2, 3], function(n) {return n > 0;})` should return `[1, 2, 3]`.
+
+```js
+assert.deepEqual(
+  dropElements([1, 2, 3], function (n) {
+    return n > 0;
+  }),
+  [1, 2, 3]
+);
+```
+
+`dropElements([1, 2, 3, 4], function(n) {return n > 5;})` should return `[]`.
+
+```js
+assert.deepEqual(
+  dropElements([1, 2, 3, 4], function (n) {
+    return n > 5;
+  }),
+  []
+);
+```
+
+`dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;})` should return `[7, 4]`.
+
+```js
+assert.deepEqual(
+  dropElements([1, 2, 3, 7, 4], function (n) {
+    return n > 3;
+  }),
+  [7, 4]
+);
+```
+
+`dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;})` should return `[3, 9, 2]`.
+
+```js
+assert.deepEqual(
+  dropElements([1, 2, 3, 9, 2], function (n) {
+    return n > 2;
+  }),
+  [3, 9, 2]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function dropElements(arr, func) {
+  return arr;
+}
+
+dropElements([1, 2, 3], function(n) {return n < 3; });
+```
+
+# --solutions--
+
+```js
+function dropElements(arr, func) {
+  while (arr.length && !func(arr[0])) {
+    arr.shift();
+  }
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true.md
new file mode 100644
index 0000000000..0237b81875
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true.md
@@ -0,0 +1,155 @@
+---
+id: a10d2431ad0c6a099a4b8b52
+title: Everything Be True
+challengeType: 5
+forumTopicId: 16011
+dashedName: 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 `pre` will be an object property and you need to return `true` if its value is `truthy`. Otherwise, return `false`.
+
+In JavaScript, `truthy` values are values that translate to `true` when evaluated in a Boolean context.
+
+Remember, you can access object properties through either dot notation or `[]` notation.
+
+# --hints--
+
+`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` should return `true`.
+
+```js
+assert.strictEqual(
+  truthCheck(
+    [
+      { user: 'Tinky-Winky', sex: 'male' },
+      { user: 'Dipsy', sex: 'male' },
+      { user: 'Laa-Laa', sex: 'female' },
+      { user: 'Po', sex: 'female' }
+    ],
+    'sex'
+  ),
+  true
+);
+```
+
+`truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex")` should return `false`.
+
+```js
+assert.strictEqual(
+  truthCheck(
+    [
+      { user: 'Tinky-Winky', sex: 'male' },
+      { user: 'Dipsy' },
+      { user: 'Laa-Laa', sex: 'female' },
+      { user: 'Po', sex: 'female' }
+    ],
+    'sex'
+  ),
+  false
+);
+```
+
+`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")` should return `false`.
+
+```js
+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
+);
+```
+
+`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true}, {"name": "FastForward", "onBoat": null}], "onBoat")` should return `false`.
+
+```js
+assert.strictEqual(
+  truthCheck(
+    [
+      { name: 'Pete', onBoat: true },
+      { name: 'Repeat', onBoat: true },
+      { name: 'FastForward', onBoat: null }
+    ],
+    'onBoat'
+  ),
+  false
+);
+```
+
+`truthCheck([{"name": "Pete", "onBoat": true}, {"name": "Repeat", "onBoat": true, "alias": "Repete"}, {"name": "FastForward", "onBoat": true}], "onBoat")` should return `true`.
+
+```js
+assert.strictEqual(
+  truthCheck(
+    [
+      { name: 'Pete', onBoat: true },
+      { name: 'Repeat', onBoat: true, alias: 'Repete' },
+      { name: 'FastForward', onBoat: true }
+    ],
+    'onBoat'
+  ),
+  true
+);
+```
+
+`truthCheck([{"single": "yes"}], "single")` should return `true`.
+
+```js
+assert.strictEqual(truthCheck([{ single: 'yes' }], 'single'), true);
+```
+
+`truthCheck([{"single": ""}, {"single": "double"}], "single")` should return `false`.
+
+```js
+assert.strictEqual(
+  truthCheck([{ single: '' }, { single: 'double' }], 'single'),
+  false
+);
+```
+
+`truthCheck([{"single": "double"}, {"single": undefined}], "single")` should return `false`.
+
+```js
+assert.strictEqual(
+  truthCheck([{ single: 'double' }, { single: undefined }], 'single'),
+  false
+);
+```
+
+`truthCheck([{"single": "double"}, {"single": NaN}], "single")` should return `false`.
+
+```js
+assert.strictEqual(
+  truthCheck([{ single: 'double' }, { single: NaN }], 'single'),
+  false
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function truthCheck(collection, pre) {
+  return pre;
+}
+
+truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex");
+```
+
+# --solutions--
+
+```js
+function truthCheck(collection, pre) {
+  return collection.every(function(e) { return e[pre]; });
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
new file mode 100644
index 0000000000..a01f7a9f92
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person.md
@@ -0,0 +1,197 @@
+---
+id: a2f1d72d9b908d0bd72bb9f6
+title: Make a Person
+challengeType: 5
+forumTopicId: 16020
+dashedName: make-a-person
+---
+
+# --description--
+
+Fill in the object constructor with the following methods below:
+
+```js
+getFirstName()
+getLastName()
+getFullName()
+setFirstName(first)
+setLastName(last)
+setFullName(firstAndLast)
+```
+
+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.
+
+# --hints--
+
+`Object.keys(bob).length` should return 6.
+
+```js
+assert.deepEqual(Object.keys(bob).length, 6);
+```
+
+`bob instanceof Person` should return `true`.
+
+```js
+assert.deepEqual(bob instanceof Person, true);
+```
+
+`bob.firstName` should return `undefined`.
+
+```js
+assert.deepEqual(bob.firstName, undefined);
+```
+
+`bob.lastName` should return `undefined`.
+
+```js
+assert.deepEqual(bob.lastName, undefined);
+```
+
+`bob.getFirstName()` should return the string `Bob`.
+
+```js
+assert.deepEqual(bob.getFirstName(), 'Bob');
+```
+
+`bob.getLastName()` should return the string `Ross`.
+
+```js
+assert.deepEqual(bob.getLastName(), 'Ross');
+```
+
+`bob.getFullName()` should return the string `Bob Ross`.
+
+```js
+assert.deepEqual(bob.getFullName(), 'Bob Ross');
+```
+
+`bob.getFullName()` should return the string `Haskell Ross` after `bob.setFirstName("Haskell")`.
+
+```js
+assert.strictEqual(
+  (function () {
+    bob.setFirstName('Haskell');
+    return bob.getFullName();
+  })(),
+  'Haskell Ross'
+);
+```
+
+`bob.getFullName()` should return the string `Haskell Curry` after `bob.setLastName("Curry")`.
+
+```js
+assert.strictEqual(
+  (function () {
+    var _bob = new Person('Haskell Ross');
+    _bob.setLastName('Curry');
+    return _bob.getFullName();
+  })(),
+  'Haskell Curry'
+);
+```
+
+`bob.getFullName()` should return the string `Haskell Curry` after `bob.setFullName("Haskell Curry")`.
+
+```js
+assert.strictEqual(
+  (function () {
+    bob.setFullName('Haskell Curry');
+    return bob.getFullName();
+  })(),
+  'Haskell Curry'
+);
+```
+
+`bob.getFirstName()` should return the string `Haskell` after `bob.setFullName("Haskell Curry")`.
+
+```js
+assert.strictEqual(
+  (function () {
+    bob.setFullName('Haskell Curry');
+    return bob.getFirstName();
+  })(),
+  'Haskell'
+);
+```
+
+`bob.getLastName()` should return the string `Curry` after `bob.setFullName("Haskell Curry")`.
+
+```js
+assert.strictEqual(
+  (function () {
+    bob.setFullName('Haskell Curry');
+    return bob.getLastName();
+  })(),
+  'Curry'
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+if(bob){
+  bob = new Person("Bob Ross");
+}
+```
+
+## --seed-contents--
+
+```js
+var Person = function(firstAndLast) {
+  // Only change code below this line
+  // Complete the method below and implement the others similarly
+  this.getFullName = function() {
+    return "";
+  };
+  return firstAndLast;
+};
+
+var bob = new Person('Bob Ross');
+bob.getFullName();
+```
+
+# --solutions--
+
+```js
+var Person = function(firstAndLast) {
+
+  var firstName, lastName;
+
+  function updateName(str) {
+    firstName = str.split(" ")[0];
+    lastName = str.split(" ")[1];
+  }
+
+  updateName(firstAndLast);
+
+  this.getFirstName = function(){
+    return firstName;
+  };
+
+  this.getLastName = function(){
+    return lastName;
+  };
+
+  this.getFullName = function(){
+    return firstName + " " + lastName;
+  };
+
+  this.setFirstName = function(str){
+    firstName = str;
+  };
+
+
+  this.setLastName = function(str){
+    lastName = str;
+  };
+
+  this.setFullName = function(str){
+    updateName(str);
+  };
+};
+
+var bob = new Person('Bob Ross');
+bob.getFullName();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
new file mode 100644
index 0000000000..74118356a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris.md
@@ -0,0 +1,78 @@
+---
+id: af4afb223120f7348cdfc9fd
+title: Map the Debris
+challengeType: 5
+forumTopicId: 16021
+dashedName: 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 `{name: 'name', avgAlt: avgAlt}`.
+
+You can read about orbital periods [on Wikipedia](http://en.wikipedia.org/wiki/Orbital_period).
+
+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>.
+
+# --hints--
+
+`orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}])` should return `[{name: "sputnik", orbitalPeriod: 86400}]`.
+
+```js
+assert.deepEqual(orbitalPeriod([{ name: 'sputnik', avgAlt: 35873.5553 }]), [
+  { name: 'sputnik', orbitalPeriod: 86400 }
+]);
+```
+
+`orbitalPeriod([{name: "iss", avgAlt: 413.6}, {name: "hubble", avgAlt: 556.7}, {name: "moon", avgAlt: 378632.553}])` should return `[{name : "iss", orbitalPeriod: 5557}, {name: "hubble", orbitalPeriod: 5734}, {name: "moon", orbitalPeriod: 2377399}]`.
+
+```js
+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 }
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function orbitalPeriod(arr) {
+  var GM = 398600.4418;
+  var earthRadius = 6367.4447;
+  return arr;
+}
+
+orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]);
+```
+
+# --solutions--
+
+```js
+function orbitalPeriod(arr) {
+  var GM = 398600.4418;
+  var earthRadius = 6367.4447;
+  var TAU = 2 * Math.PI;
+  return arr.map(function(obj) {
+    return {
+      name: obj.name,
+      orbitalPeriod: Math.round(TAU * Math.sqrt(Math.pow(obj.avgAlt+earthRadius, 3)/GM))
+    };
+  });
+}
+
+orbitalPeriod([{name : "sputkin", avgAlt : 35873.5553}]);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters.md
new file mode 100644
index 0000000000..a1ecc67cbb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters.md
@@ -0,0 +1,72 @@
+---
+id: af7588ade1100bde429baf20
+title: Missing letters
+challengeType: 5
+forumTopicId: 16023
+dashedName: 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`.
+
+# --hints--
+
+`fearNotLetter("abce")` should return the string `d`.
+
+```js
+assert.deepEqual(fearNotLetter('abce'), 'd');
+```
+
+`fearNotLetter("abcdefghjklmno")` should return the string `i`.
+
+```js
+assert.deepEqual(fearNotLetter('abcdefghjklmno'), 'i');
+```
+
+`fearNotLetter("stvwx")` should return the string `u`.
+
+```js
+assert.deepEqual(fearNotLetter('stvwx'), 'u');
+```
+
+`fearNotLetter("bcdf")` should return the string `e`.
+
+```js
+assert.deepEqual(fearNotLetter('bcdf'), 'e');
+```
+
+`fearNotLetter("abcdefghijklmnopqrstuvwxyz")` should return `undefined`.
+
+```js
+assert.isUndefined(fearNotLetter('abcdefghijklmnopqrstuvwxyz'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fearNotLetter(str) {
+  return str;
+}
+
+fearNotLetter("abce");
+```
+
+# --solutions--
+
+```js
+function fearNotLetter (str) {
+  for (var i = str.charCodeAt(0); i <= str.charCodeAt(str.length - 1); i++) {
+    var letter = String.fromCharCode(i);
+    if (str.indexOf(letter) === -1) {
+      return letter;
+    }
+  }
+
+  return undefined;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/pig-latin.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/pig-latin.md
new file mode 100644
index 0000000000..e355f395b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/pig-latin.md
@@ -0,0 +1,93 @@
+---
+id: aa7697ea2477d1316795783b
+title: Pig Latin
+challengeType: 5
+forumTopicId: 16039
+dashedName: pig-latin
+---
+
+# --description--
+
+Pig Latin is a way of altering English Words. The rules are as follows:
+
+\- If a word begins with a consonant, take the first consonant or consonant cluster, move it to the end of the word, and add `ay` to it.
+
+\- If a word begins with a vowel, just add `way` at the end.
+
+# --instructions--
+
+Translate the provided string to Pig Latin. Input strings are guaranteed to be English words in all lowercase.
+
+# --hints--
+
+`translatePigLatin("california")` should return the string `aliforniacay`.
+
+```js
+assert.deepEqual(translatePigLatin('california'), 'aliforniacay');
+```
+
+`translatePigLatin("paragraphs")` should return the string `aragraphspay`.
+
+```js
+assert.deepEqual(translatePigLatin('paragraphs'), 'aragraphspay');
+```
+
+`translatePigLatin("glove")` should return the string `oveglay`.
+
+```js
+assert.deepEqual(translatePigLatin('glove'), 'oveglay');
+```
+
+`translatePigLatin("algorithm")` should return the string `algorithmway`.
+
+```js
+assert.deepEqual(translatePigLatin('algorithm'), 'algorithmway');
+```
+
+`translatePigLatin("eight")` should return the string `eightway`.
+
+```js
+assert.deepEqual(translatePigLatin('eight'), 'eightway');
+```
+
+Should handle words where the first vowel comes in the middle of the word.  `translatePigLatin("schwartz")` should return the string `artzschway`.
+
+```js
+assert.deepEqual(translatePigLatin('schwartz'), 'artzschway');
+```
+
+Should handle words without vowels. `translatePigLatin("rhythm")` should return the string `rhythmay`.
+
+```js
+assert.deepEqual(translatePigLatin('rhythm'), 'rhythmay');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function translatePigLatin(str) {
+  return str;
+}
+
+translatePigLatin("consonant");
+```
+
+# --solutions--
+
+```js
+function translatePigLatin(str) {
+  if (isVowel(str.charAt(0))) return str + "way";
+  var front = [];
+  str = str.split('');
+  while (str.length && !isVowel(str[0])) {
+    front.push(str.shift());
+  }
+  return [].concat(str, front).join('') + 'ay';
+}
+
+function isVowel(c) {
+  return ['a', 'e', 'i', 'o', 'u'].indexOf(c.toLowerCase()) !== -1;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace.md
new file mode 100644
index 0000000000..1f9df37ac3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace.md
@@ -0,0 +1,100 @@
+---
+id: a0b5010f579e69b815e7c5d6
+title: Search and Replace
+challengeType: 5
+forumTopicId: 16045
+dashedName: 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).
+
+**Note:** 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`
+
+# --hints--
+
+`myReplace("Let us go to the store", "store", "mall")` should return the string `Let us go to the mall`.
+
+```js
+assert.deepEqual(
+  myReplace('Let us go to the store', 'store', 'mall'),
+  'Let us go to the mall'
+);
+```
+
+`myReplace("He is Sleeping on the couch", "Sleeping", "sitting")` should return the string `He is Sitting on the couch`.
+
+```js
+assert.deepEqual(
+  myReplace('He is Sleeping on the couch', 'Sleeping', 'sitting'),
+  'He is Sitting on the couch'
+);
+```
+
+`myReplace("I think we should look up there", "up", "Down")` should return the string `I think we should look down there`.
+
+```js
+assert.deepEqual(
+  myReplace('I think we should look up there', 'up', 'Down'),
+  'I think we should look down there'
+);
+```
+
+`myReplace("This has a spellngi error", "spellngi", "spelling")` should return the string `This has a spelling error`.
+
+```js
+assert.deepEqual(
+  myReplace('This has a spellngi error', 'spellngi', 'spelling'),
+  'This has a spelling error'
+);
+```
+
+`myReplace("His name is Tom", "Tom", "john")` should return the string `His name is John`.
+
+```js
+assert.deepEqual(
+  myReplace('His name is Tom', 'Tom', 'john'),
+  'His name is John'
+);
+```
+
+`myReplace("Let us get back to more Coding", "Coding", "algorithms")` should return the string `Let us get back to more Algorithms`.
+
+```js
+assert.deepEqual(
+  myReplace('Let us get back to more Coding', 'Coding', 'algorithms'),
+  'Let us get back to more Algorithms'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function myReplace(str, before, after) {
+  return str;
+}
+
+myReplace("A quick brown fox jumped over the lazy dog", "jumped", "leaped");
+```
+
+# --solutions--
+
+```js
+function myReplace(str, before, after) {
+  if (before.charAt(0) === before.charAt(0).toUpperCase()) {
+    after = after.charAt(0).toUpperCase() + after.substring(1);
+  } else {
+    after = after.charAt(0).toLowerCase() + after.substring(1);
+  }
+  return str.replace(before, after);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy.md
new file mode 100644
index 0000000000..aa332e779e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy.md
@@ -0,0 +1,104 @@
+---
+id: a39963a4c10bc8b4d4f06d7e
+title: Seek and Destroy
+challengeType: 5
+forumTopicId: 16046
+dashedName: 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.
+
+**Note:** You have to use the `arguments` object.
+
+# --hints--
+
+`destroyer([1, 2, 3, 1, 2, 3], 2, 3)` should return `[1, 1]`.
+
+```js
+assert.deepEqual(destroyer([1, 2, 3, 1, 2, 3], 2, 3), [1, 1]);
+```
+
+`destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3)` should return `[1, 5, 1]`.
+
+```js
+assert.deepEqual(destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3), [1, 5, 1]);
+```
+
+`destroyer([3, 5, 1, 2, 2], 2, 3, 5)` should return `[1]`.
+
+```js
+assert.deepEqual(destroyer([3, 5, 1, 2, 2], 2, 3, 5), [1]);
+```
+
+`destroyer([2, 3, 2, 3], 2, 3)` should return `[]`.
+
+```js
+assert.deepEqual(destroyer([2, 3, 2, 3], 2, 3), []);
+```
+
+`destroyer(["tree", "hamburger", 53], "tree", 53)` should return `["hamburger"]`.
+
+```js
+assert.deepEqual(destroyer(['tree', 'hamburger', 53], 'tree', 53), [
+  'hamburger'
+]);
+```
+
+`destroyer(["possum", "trollo", 12, "safari", "hotdog", 92, 65, "grandma", "bugati", "trojan", "yacht"], "yacht", "possum", "trollo", "safari", "hotdog", "grandma", "bugati", "trojan")` should return `[12,92,65]`.
+
+```js
+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]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function destroyer(arr) {
+  return arr;
+}
+
+destroyer([1, 2, 3, 1, 2, 3], 2, 3);
+```
+
+# --solutions--
+
+```js
+function destroyer(arr) {
+  var hash = Object.create(null);
+  [].slice.call(arguments, 1).forEach(function(e) {
+    hash[e] = true;
+  });
+  return arr.filter(function(e) { return !(e in hash);});
+}
+
+destroyer([1, 2, 3, 1, 2, 3], 2, 3);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple.md
new file mode 100644
index 0000000000..e6c39f5ee6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple.md
@@ -0,0 +1,90 @@
+---
+id: ae9defd7acaf69703ab432ea
+title: Smallest Common Multiple
+challengeType: 5
+forumTopicId: 16075
+dashedName: 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 *between* 1 and 3. The answer here would be 6.
+
+# --hints--
+
+`smallestCommons([1, 5])` should return a number.
+
+```js
+assert.deepEqual(typeof smallestCommons([1, 5]), 'number');
+```
+
+`smallestCommons([1, 5])` should return 60.
+
+```js
+assert.deepEqual(smallestCommons([1, 5]), 60);
+```
+
+`smallestCommons([5, 1])` should return 60.
+
+```js
+assert.deepEqual(smallestCommons([5, 1]), 60);
+```
+
+`smallestCommons([2, 10])` should return 2520.
+
+```js
+assert.deepEqual(smallestCommons([2, 10]), 2520);
+```
+
+`smallestCommons([1, 13])` should return 360360.
+
+```js
+assert.deepEqual(smallestCommons([1, 13]), 360360);
+```
+
+`smallestCommons([23, 18])` should return 6056820.
+
+```js
+assert.deepEqual(smallestCommons([23, 18]), 6056820);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function smallestCommons(arr) {
+  return arr;
+}
+
+
+smallestCommons([1,5]);
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+    while (b !== 0) {
+        a = [b, b = a % b][0];
+    }
+    return a;
+}
+
+function lcm(a, b) {
+    return (a * b) / gcd(a, b);
+}
+
+function smallestCommons(arr) {
+  arr.sort(function(a,b) {return a-b;});
+  var rng = [];
+  for (var i = arr[0]; i <= arr[1]; i++) {
+    rng.push(i);
+  }
+  return rng.reduce(lcm);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union.md
new file mode 100644
index 0000000000..cbc9cd794a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union.md
@@ -0,0 +1,68 @@
+---
+id: a105e963526e7de52b219be9
+title: Sorted Union
+challengeType: 5
+forumTopicId: 16077
+dashedName: 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.
+
+# --hints--
+
+`uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1])` should return `[1, 3, 2, 5, 4]`.
+
+```js
+assert.deepEqual(uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]), [1, 3, 2, 5, 4]);
+```
+
+`uniteUnique([1, 2, 3], [5, 2, 1])` should return `[1, 2, 3, 5]`.
+
+```js
+assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1]), [1, 2, 3, 5]);
+```
+
+`uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8])` should return `[1, 2, 3, 5, 4, 6, 7, 8]`.
+
+```js
+assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]), [
+  1,
+  2,
+  3,
+  5,
+  4,
+  6,
+  7,
+  8
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function uniteUnique(arr) {
+  return arr;
+}
+
+uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);
+```
+
+# --solutions--
+
+```js
+function uniteUnique(arr) {
+  return [].slice.call(arguments).reduce(function(a, b) {
+    return [].concat(a, b.filter(function(e) {return a.indexOf(e) === -1;}));
+  }, []);
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case.md
new file mode 100644
index 0000000000..837188868b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case.md
@@ -0,0 +1,70 @@
+---
+id: a103376db3ba46b2d50db289
+title: Spinal Tap Case
+challengeType: 5
+forumTopicId: 16078
+dashedName: spinal-tap-case
+---
+
+# --description--
+
+Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.
+
+# --hints--
+
+`spinalCase("This Is Spinal Tap")` should return the string `this-is-spinal-tap`.
+
+```js
+assert.deepEqual(spinalCase('This Is Spinal Tap'), 'this-is-spinal-tap');
+```
+
+`spinalCase("thisIsSpinalTap")` should return the string `this-is-spinal-tap`.
+
+```js
+assert.strictEqual(spinalCase('thisIsSpinalTap'), 'this-is-spinal-tap');
+```
+
+`spinalCase("The_Andy_Griffith_Show")` should return the string `the-andy-griffith-show`.
+
+```js
+assert.strictEqual(
+  spinalCase('The_Andy_Griffith_Show'),
+  'the-andy-griffith-show'
+);
+```
+
+`spinalCase("Teletubbies say Eh-oh")` should return the string `teletubbies-say-eh-oh`.
+
+```js
+assert.strictEqual(
+  spinalCase('Teletubbies say Eh-oh'),
+  'teletubbies-say-eh-oh'
+);
+```
+
+`spinalCase("AllThe-small Things")` should return the string `all-the-small-things`.
+
+```js
+assert.strictEqual(spinalCase('AllThe-small Things'), 'all-the-small-things');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spinalCase(str) {
+  return str;
+}
+
+spinalCase('This Is Spinal Tap');
+```
+
+# --solutions--
+
+```js
+function spinalCase(str) {
+  str = str.replace(/([a-z](?=[A-Z]))/g, '$1 ');
+  return str.toLowerCase().replace(/\ |\_/g, '-');
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
new file mode 100644
index 0000000000..5744ab7e20
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller.md
@@ -0,0 +1,72 @@
+---
+id: ab306dbdcc907c7ddfc30830
+title: Steamroller
+challengeType: 5
+forumTopicId: 16079
+dashedName: steamroller
+---
+
+# --description--
+
+Flatten a nested array. You must account for varying levels of nesting.
+
+# --hints--
+
+`steamrollArray([[["a"]], [["b"]]])` should return `["a", "b"]`.
+
+```js
+assert.deepEqual(steamrollArray([[['a']], [['b']]]), ['a', 'b']);
+```
+
+`steamrollArray([1, [2], [3, [[4]]]])` should return `[1, 2, 3, 4]`.
+
+```js
+assert.deepEqual(steamrollArray([1, [2], [3, [[4]]]]), [1, 2, 3, 4]);
+```
+
+`steamrollArray([1, [], [3, [[4]]]])` should return `[1, 3, 4]`.
+
+```js
+assert.deepEqual(steamrollArray([1, [], [3, [[4]]]]), [1, 3, 4]);
+```
+
+`steamrollArray([1, {}, [3, [[4]]]])` should return `[1, {}, 3, 4]`.
+
+```js
+assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4]);
+```
+
+Your solution should not use the `Array.prototype.flat()` or `Array.prototype.flatMap()` methods.
+
+```js
+assert(!code.match(/\.\s*flat\s*\(/) && !code.match(/\.\s*flatMap\s*\(/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function steamrollArray(arr) {
+  return arr;
+}
+
+steamrollArray([1, [2], [3, [[4]]]]);
+```
+
+# --solutions--
+
+```js
+function steamrollArray(arr) {
+  if (!Array.isArray(arr)) {
+    return [arr];
+  }
+  var out = [];
+  arr.forEach(function(e) {
+    steamrollArray(e).forEach(function(v) {
+      out.push(v);
+    });
+  });
+  return out;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range.md
new file mode 100644
index 0000000000..a7dbdaeecc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range.md
@@ -0,0 +1,70 @@
+---
+id: a3566b1109230028080c9345
+title: Sum All Numbers in a Range
+challengeType: 5
+forumTopicId: 16083
+dashedName: 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.
+
+For example, `sumAll([4,1])` should return `10` because sum of all the numbers between 1 and 4 (both inclusive) is `10`.
+
+# --hints--
+
+`sumAll([1, 4])` should return a number.
+
+```js
+assert(typeof sumAll([1, 4]) === 'number');
+```
+
+`sumAll([1, 4])` should return 10.
+
+```js
+assert.deepEqual(sumAll([1, 4]), 10);
+```
+
+`sumAll([4, 1])` should return 10.
+
+```js
+assert.deepEqual(sumAll([4, 1]), 10);
+```
+
+`sumAll([5, 10])` should return 45.
+
+```js
+assert.deepEqual(sumAll([5, 10]), 45);
+```
+
+`sumAll([10, 5])` should return 45.
+
+```js
+assert.deepEqual(sumAll([10, 5]), 45);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumAll(arr) {
+  return 1;
+}
+
+sumAll([1, 4]);
+```
+
+# --solutions--
+
+```js
+function sumAll(arr) {
+  var sum = 0;
+  arr.sort(function(a,b) {return a-b;});
+  for (var i = arr[0]; i <= arr[1]; i++) {
+    sum += i;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers.md
new file mode 100644
index 0000000000..0c5b625e71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers.md
@@ -0,0 +1,82 @@
+---
+id: a5229172f011153519423690
+title: Sum All Odd Fibonacci Numbers
+challengeType: 5
+forumTopicId: 16084
+dashedName: sum-all-odd-fibonacci-numbers
+---
+
+# --description--
+
+Given a positive integer `num`, return the sum of all odd Fibonacci numbers that are less than or equal to `num`.
+
+The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.
+
+For example, `sumFibs(10)` should return `10` because all odd Fibonacci numbers less than or equal to `10` are 1, 1, 3, and 5.
+
+# --hints--
+
+`sumFibs(1)` should return a number.
+
+```js
+assert(typeof sumFibs(1) === 'number');
+```
+
+`sumFibs(1000)` should return 1785.
+
+```js
+assert(sumFibs(1000) === 1785);
+```
+
+`sumFibs(4000000)` should return 4613732.
+
+```js
+assert(sumFibs(4000000) === 4613732);
+```
+
+`sumFibs(4)` should return 5.
+
+```js
+assert(sumFibs(4) === 5);
+```
+
+`sumFibs(75024)` should return 60696.
+
+```js
+assert(sumFibs(75024) === 60696);
+```
+
+`sumFibs(75025)` should return 135721.
+
+```js
+assert(sumFibs(75025) === 135721);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumFibs(num) {
+  return num;
+}
+
+sumFibs(4);
+```
+
+# --solutions--
+
+```js
+function sumFibs(num) {
+  var a = 1;
+  var b = 1;
+  var s = 0;
+  while (a <= num) {
+    if (a % 2 !== 0) {
+      s += a;
+    }
+    a = [b, b=b+a][0];
+  }
+  return s;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
new file mode 100644
index 0000000000..57295dd11e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes.md
@@ -0,0 +1,75 @@
+---
+id: a3bfc1673c0526e06d3ac698
+title: Sum All Primes
+challengeType: 5
+forumTopicId: 16085
+dashedName: sum-all-primes
+---
+
+# --description--
+
+A <dfn>prime number</dfn> is a whole number greater than 1 with exactly two divisors: 1 and itself. For example, 2 is a prime number because it is only divisible by 1 and 2. In contrast, 4 is not prime since it is divisible by 1, 2 and 4.
+
+Rewrite `sumPrimes` so it returns the sum of all prime numbers that are less than or equal to num.
+
+# --hints--
+
+`sumPrimes(10)` should return a number.
+
+```js
+assert.deepEqual(typeof sumPrimes(10), 'number');
+```
+
+`sumPrimes(10)` should return 17.
+
+```js
+assert.deepEqual(sumPrimes(10), 17);
+```
+
+`sumPrimes(977)` should return 73156.
+
+```js
+assert.deepEqual(sumPrimes(977), 73156);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumPrimes(num) {
+  return num;
+}
+
+sumPrimes(10);
+```
+
+# --solutions--
+
+```js
+function eratosthenesArray(n) {
+    var primes = [];
+    if (n > 2) {
+        var half = n>>1;
+        var sieve = Array(half);
+        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {
+            if (!sieve[i]) {
+                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {
+                    sieve[j] = true;
+                }
+            }
+        }
+        primes.push(2);
+        for (var p = 1; p < half; p++) {
+            if (!sieve[p]) primes.push(2*p+1);
+        }
+    }
+    return primes;
+}
+
+function sumPrimes(num) {
+  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);
+}
+
+sumPrimes(10);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou.md
new file mode 100644
index 0000000000..b0a565be94
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou.md
@@ -0,0 +1,130 @@
+---
+id: a8e512fbe388ac2f9198f0fa
+title: Wherefore art thou
+challengeType: 5
+forumTopicId: 16092
+dashedName: 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 `[{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }]`, and the second argument is `{ last: "Capulet" }`, then you must return the third object from the array (the first argument), because it contains the name and its value, that was passed on as the second argument.
+
+# --hints--
+
+`whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" })` should return `[{ first: "Tybalt", last: "Capulet" }]`.
+
+```js
+assert.deepEqual(
+  whatIsInAName(
+    [
+      { first: 'Romeo', last: 'Montague' },
+      { first: 'Mercutio', last: null },
+      { first: 'Tybalt', last: 'Capulet' }
+    ],
+    { last: 'Capulet' }
+  ),
+  [{ first: 'Tybalt', last: 'Capulet' }]
+);
+```
+
+`whatIsInAName([{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }], { "apple": 1 })` should return `[{ "apple": 1 }, { "apple": 1 }, { "apple": 1, "bat": 2 }]`.
+
+```js
+assert.deepEqual(
+  whatIsInAName([{ apple: 1 }, { apple: 1 }, { apple: 1, bat: 2 }], {
+    apple: 1
+  }),
+  [{ apple: 1 }, { apple: 1 }, { apple: 1, bat: 2 }]
+);
+```
+
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "bat": 2 }, { "apple": 1, "bat": 2, "cookie": 2 }], { "apple": 1, "bat": 2 })` should return `[{ "apple": 1, "bat": 2 }, { "apple": 1, "bat": 2, "cookie": 2 }]`.
+
+```js
+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 }
+  ]
+);
+```
+
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "apple": 1 }, { "apple": 1, "bat": 2, "cookie": 2 }], { "apple": 1, "cookie": 2 })` should return `[{ "apple": 1, "bat": 2, "cookie": 2 }]`.
+
+```js
+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 }]
+);
+```
+
+`whatIsInAName([{ "apple": 1, "bat": 2 }, { "apple": 1 }, { "apple": 1, "bat": 2, "cookie": 2 }, { "bat":2 }], { "apple": 1, "bat": 2 })` should return `[{ "apple": 1, "bat": 2 }, { "apple": 1, "bat": 2, "cookie":2 }]`.
+
+```js
+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 }
+  ]
+);
+```
+
+`whatIsInAName([{"a": 1, "b": 2, "c": 3}], {"a": 1, "b": 9999, "c": 3})` should return `[]`
+
+```js
+assert.deepEqual(
+  whatIsInAName([{ a: 1, b: 2, c: 3 }], { a: 1, b: 9999, c: 3 }),
+  []
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function whatIsInAName(collection, source) {
+  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--
+
+```js
+function whatIsInAName(collection, source) {
+  var arr = [];
+  var keys = Object.keys(source);
+  collection.forEach(function(e) {
+    if(keys.every(function(key) {return e[key] === source[key];})) {
+      arr.push(e);
+    }
+  });
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-001.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-001.md
new file mode 100644
index 0000000000..11916a0bd1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-001.md
@@ -0,0 +1,98 @@
+---
+id: 5ddb965c65d27e1512d44d9a
+title: Part 1
+challengeType: 0
+dashedName: part-1
+---
+
+# --description--
+
+When a browser loads a page, it creates a Document Object Model (DOM) representation of the page which includes all of the HTML elements in a tree structure.
+
+In JavaScript, you can access the DOM by referencing the global `document` object.
+
+To view the DOM, log it to the console with `console.log(document)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/console\.log\(document\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast <input type="number" min="0" class="cal-control" id="breakfast" /><br>
+          Lunch <input type="number" min="0" class="cal-control" id="lunch" /><br>
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+console.log(document);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-002.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-002.md
new file mode 100644
index 0000000000..836ff253cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-002.md
@@ -0,0 +1,112 @@
+---
+id: 5ddb965c65d27e1512d44d9b
+title: Part 2
+challengeType: 0
+dashedName: part-2
+---
+
+# --description--
+
+In our HTML document, we have a form element with an `id` attribute: `<form id="calorie-form">`
+
+To reference and access this particular form in JavaScript, we can use the getElementById() method on the document and provide the ID.
+
+The code `document.getElementById('my-form')` gets a reference to an HTML element with an `id` of `my-form`. Get a reference to the HTML element with the `id` of `calorie-form`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/document\.getElementById\([\'\"\`]calorie\-form[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  //console.log(document);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  //console.log(document);
+  document.getElementById('calorie-form');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-003.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-003.md
new file mode 100644
index 0000000000..ab6cbd0394
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-003.md
@@ -0,0 +1,117 @@
+---
+id: 5ddb965c65d27e1512d44d9c
+title: Part 3
+challengeType: 0
+dashedName: part-3
+---
+
+# --description--
+
+Now we need to specify what should be done with the form when the user submits it by clicking the Calculate button.
+
+Forms have an `onsubmit` event that can execute a function when the form is submitted.
+
+For example, in `document.getElementById('my-form').onsubmit = processForm;`, the function `processForm` will run when the form is submitted.
+
+Assign a function named `calculate` to the `onsubmit` event of your form.
+
+You will create the `calculate` function later.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]calorie\-form[\'\"\`]\)\.onsubmit\=calculate/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-004.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-004.md
new file mode 100644
index 0000000000..021897b9fb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-004.md
@@ -0,0 +1,109 @@
+---
+id: 5ddb965c65d27e1512d44d9d
+title: Part 4
+challengeType: 0
+dashedName: part-4
+---
+
+# --description--
+
+Create the `calculate` function that will hold the code to sum up the user's calorie inputs. Leave the body blank for now. Here is an example of an empty function called `square`:
+
+```js
+function square() {}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof calculate === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate() {}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-005.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-005.md
new file mode 100644
index 0000000000..e359f47d12
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-005.md
@@ -0,0 +1,113 @@
+---
+id: 5ddb965c65d27e1512d44d9e
+title: Part 5
+challengeType: 0
+dashedName: part-5
+---
+
+# --description--
+
+By default, `onsubmit` will pass the event object as a parameter to the function it calls. People usually call it `e`, short for event. Update the `calculate()` function to accept `e` as parameter.
+
+Here is an example of an empty function called `square` that takes a `number` as a parameter:
+
+```js
+function square(number) {}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(calculate.toString().match(/function calculate\(\s*e\)\s*\{\s*\}/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate() {}
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {}
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-006.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-006.md
new file mode 100644
index 0000000000..6cffeae2a3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-006.md
@@ -0,0 +1,111 @@
+---
+id: 5ddb965c65d27e1512d44d9f
+title: Part 6
+challengeType: 0
+dashedName: part-6
+---
+
+# --description--
+
+When a form is submitted, the browser will try to submit it to a server and reload the page. We want to prevent this from happening and do our own processing on the client side.
+
+Prevent the default behavior of the form submit event by calling `e.preventDefault()` inside of the `calculate` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(calculate.toString().match(/e\.preventDefault\(\s*\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {}
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-007.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-007.md
new file mode 100644
index 0000000000..e21db1cd71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-007.md
@@ -0,0 +1,120 @@
+---
+id: 5ddb965c65d27e1512d44da0
+title: Part 7
+challengeType: 0
+dashedName: part-7
+---
+
+# --description--
+
+If you inspect the inputs in the form, you will notice that they have the class name `cal-control`.
+
+To access elements with a certain class name, we use the `getElementsByClassName()` method.
+
+Similar to how you referenced the calorie form above (`document.getElementById('calorie-form')`), create a reference to the elements with the class name `cal-control` below `e.preventDefault()`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/document\.getElementsByClassName\([\'\"\`]cal\-control[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    document.getElementsByClassName('cal-control');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-008.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-008.md
new file mode 100644
index 0000000000..b25fbf6bfc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-008.md
@@ -0,0 +1,117 @@
+---
+id: 5ddb965c65d27e1512d44da1
+title: Part 8
+challengeType: 0
+dashedName: part-8
+---
+
+# --description--
+
+Now assign the document object you just referenced to a variable named `total`. Since this variable will not change, use `const` to create it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*total\s*=\s*document\.getElementsByClassName\([\'\"\`]cal\-control[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    document.getElementsByClassName('cal-control');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = document.getElementsByClassName('cal-control');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-009.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-009.md
new file mode 100644
index 0000000000..856e7553ed
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-009.md
@@ -0,0 +1,119 @@
+---
+id: 5ddb965c65d27e1512d44da2
+title: Part 9
+challengeType: 0
+dashedName: part-9
+---
+
+# --description--
+
+To make the document objects easier to handle, let's turn them into an array. Wrap the `document.getElementsByClassName('cal-control')` portion of your code in an `Array.from()` method.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /Array\.from\(document\.getElementsByClassName\([\'\"\`]cal\-control[\'\"\`]\)\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = document.getElementsByClassName('cal-control');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-010.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-010.md
new file mode 100644
index 0000000000..d35af38630
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-010.md
@@ -0,0 +1,114 @@
+---
+id: 5ddb965c65d27e1512d44da3
+title: Part 10
+challengeType: 0
+dashedName: part-10
+---
+
+# --description--
+
+Create a variable named `meal` and set it equal to the first index of `total` (`total[0]`). This would be the input for Breakfast on the form.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/const\s*meal\s*=\s*total\[0\]/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+    const meal = total[0];
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-011.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-011.md
new file mode 100644
index 0000000000..5308378f39
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-011.md
@@ -0,0 +1,115 @@
+---
+id: 5ddb965c65d27e1512d44da4
+title: Part 11
+challengeType: 0
+dashedName: part-11
+---
+
+# --description--
+
+Log `meal.value` to the console, enter a number in the Breakfast input and hit the Calculate button. You'll notice that it displays what you entered.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+    const meal = total[0];
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+    const meal = total[0];
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-012.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-012.md
new file mode 100644
index 0000000000..a8300b97fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-012.md
@@ -0,0 +1,127 @@
+---
+id: 5ddb965c65d27e1512d44da5
+title: Part 12
+challengeType: 0
+dashedName: part-12
+---
+
+# --description--
+
+We need a way to iterate through all the `meal` items in the `total` array and return the values that the user entered as an array.
+
+The `map()` method allows us to do exactly that.
+
+Delete `const meal = total[0];` and chain the `.map()` method to the end of your `Array.from()` method. Here's an example of `.map()` chained to an array: `[3, 2, 1].map()`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .toString()
+    .replace(/\s/g, '')
+    .match(
+      /Array\.from\(document\.getElementsByClassName\([\'\"\`]cal\-control[\'\"\`]\)\)\.map\(\)\;?/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(document.getElementsByClassName('cal-control'));
+    const meal = total[0];
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map();
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-013.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-013.md
new file mode 100644
index 0000000000..ae1c94fc7b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-013.md
@@ -0,0 +1,125 @@
+---
+id: 5ddb965c65d27e1512d44da6
+title: Part 13
+challengeType: 0
+dashedName: part-13
+---
+
+# --description--
+
+Now we need to provide a function to `map()` that will be performed on each item of the array.
+
+This function will take the original item as an argument, in our case we'll call it `meal`. Inside the `.map()` parentheses, insert an empty function that takes `meal` as a parameter, like:
+
+```js
+function(meal){}
+```
+
+Enter in the above function as an argument in between the parentheses of the `.map()` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/map\(function\(\s*meal\)\{\}\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map();
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {});
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-014.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-014.md
new file mode 100644
index 0000000000..1520535d96
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-014.md
@@ -0,0 +1,123 @@
+---
+id: 5ddb965c65d27e1512d44da7
+title: Part 14
+challengeType: 0
+dashedName: part-14
+---
+
+# --description--
+
+Inside the function body, insert `return meal.value`, since it is the value of the individual `cal-control` inputs that we want.
+
+If you want, console log `total` to see what results you are getting.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/\(function\(meal\)\{returnmeal\.value\;?\}\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {});
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {
+      return meal.value;
+    });
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-015.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-015.md
new file mode 100644
index 0000000000..7add952801
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-015.md
@@ -0,0 +1,121 @@
+---
+id: 5ddb965c65d27e1512d44da8
+title: Part 15
+challengeType: 0
+dashedName: part-15
+---
+
+# --description--
+
+Since eventually we'll be adding all of the meal calories in the `total` array, explicitly convert `meal.value` into a number by wrapping it in the `Number()` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/Number\(meal\.value\)\;?/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {
+      return meal.value;
+    });
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {
+      return Number(meal.value);
+    });
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-016.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-016.md
new file mode 100644
index 0000000000..21a207e25a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-016.md
@@ -0,0 +1,120 @@
+---
+id: 5ddb965c65d27e1512d44da9
+title: Part 16
+challengeType: 0
+dashedName: part-16
+---
+
+# --description--
+
+Now let's simplify the function by refactoring it to use arrow functions. As an example, `function(x) {return x*x}` can be refactored as`x => x*x`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/meal\=\>Number\(meal\.value\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(function(meal) {
+      return Number(meal.value);
+    });
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(meal => Number(meal.value));
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-017.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-017.md
new file mode 100644
index 0000000000..1417798fe2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-017.md
@@ -0,0 +1,121 @@
+---
+id: 5ddb965c65d27e1512d44daa
+title: Part 17
+challengeType: 0
+dashedName: part-17
+---
+
+# --description--
+
+While you can use a loop to add everything in the `total` array to a variable, JavaScript provides the useful `reduce()` method.
+
+Chain the `reduce()` method to the `Array.from()` expression.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/Number\(meal\.value\)\)\.reduce\(\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(
+      document.getElementsByClassName('cal-control')
+    ).map(meal => Number(meal.value));
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+  const total = Array.from(document.getElementsByClassName('cal-control'))
+    .map(meal => Number(meal.value))
+    .reduce();
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-018.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-018.md
new file mode 100644
index 0000000000..5231d42570
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-018.md
@@ -0,0 +1,137 @@
+---
+id: 5ddb965c65d27e1512d44dab
+title: Part 18
+challengeType: 0
+dashedName: part-18
+---
+
+# --description--
+
+The `reduce()` method takes a callback function with at least two arguments, an accumulator and a current value:
+
+```js
+function(accumulator, currentValue) { /* code to run */ }
+```
+
+or using arrow functions:
+
+```js
+(accumulator, currentValue) => { /* code to run */ }
+```
+
+Insert the above callback function as an argument in the `.reduce()` method.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/reduce\(\(accumulator\,currentValue\)\=\>\{\/\*codetorun\*\/\}\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce();
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        /*code to run*/
+      });
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-019.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-019.md
new file mode 100644
index 0000000000..04ec061d78
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-019.md
@@ -0,0 +1,137 @@
+---
+id: 5ddb965c65d27e1512d44dac
+title: Part 19
+challengeType: 0
+dashedName: part-19
+---
+
+# --description--
+
+Provide the number zero as the initial value of the `reduce()` method by passing it as the second argument.
+
+Here is an example of a `reduce()` method with an empty object as its initial value:
+
+```js
+arr.reduce((accumulator, currentValue) => {
+  /* code to run */
+}, {});
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /reduce\(\(accumulator\,currentValue\)\=\>\{\/\*codetorun\*\/\}\,0\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        /* code to run */
+      });
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        /*code to run*/
+      }, 0);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-020.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-020.md
new file mode 100644
index 0000000000..1c7e67060f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-020.md
@@ -0,0 +1,145 @@
+---
+id: 5ddb965c65d27e1512d44dad
+title: Part 20
+challengeType: 0
+dashedName: part-20
+---
+
+# --description--
+
+Let's says we have an array `[1, 3, 5]` named `arr` and we want to sum up all the numbers.
+
+We can use the reduce function as follows:
+
+```js
+arr.reduce((accumulator, currentValue) => {
+  return accumulator + currentValue;
+}, 0);
+```
+
+At `arr[0]`, the function is `(0, 1) => { return 0 + 1 }`, since `arr[0] = 1 = currentValue`.
+
+At `arr[1]`, the function is `(1, 3) => 1 + 3`,
+
+Finally at `arr[2]`, the function is `(4, 5) => 4 + 5`. Now the accumulator is `9` and since we have gone through all of the items in `arr`, the `reduce()` method will return `9`.
+
+In the body of the callback function, replace `/* code to run */` with `return accumulator + currentValue`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /reduce\(\(accumulator\,currentValue\)\=\>{returnaccumulator\+currentValue\;?},0\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        /* code to run */
+      }, 0);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        return accumulator + currentValue;
+      }, 0);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-021.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-021.md
new file mode 100644
index 0000000000..3f40afa537
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-021.md
@@ -0,0 +1,134 @@
+---
+id: 5e302e80e003129199103c78
+title: Part 21
+challengeType: 0
+dashedName: part-21
+---
+
+# --description--
+
+To track how the `reduce()` function works, log the values of the `accumulator` and `currentValue` in the callback function before the `return` statement like this: `console.log({ accumulator })`
+
+You can also check your progress by adding `console.log({ total })` at the end of the `calculate()` function.
+
+When you enter calorie values in the form and push the Calculate button, you will see the values of `accumulator` and `currentValue` in each iteration of the `reduce()` callback function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/console.log\({accumulator}\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        // log the values of the `accumulator` and `currentValue` here
+        return accumulator + currentValue;
+      }, 0);
+
+    // log the value of `total` here
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        console.log({ accumulator });
+        console.log({ currentValue });
+        return accumulator + currentValue;
+      }, 0);
+
+    console.log({ total });
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-022.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-022.md
new file mode 100644
index 0000000000..804e6f5524
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-022.md
@@ -0,0 +1,137 @@
+---
+id: 5e302e8ce003129199103c79
+title: Part 22
+challengeType: 0
+dashedName: part-22
+---
+
+# --description--
+
+Now let's simplify the `reduce()` callback function by refactoring it.
+
+Essentially, the current callback function is `(accumulator, currentValue) => { return accumulator + currentValue }`. Since there's only one expression in the function body, we can omit the `{}`. Additionally, we can omit the `return` keyword since that is implicit when using arrow function syntax.
+
+So the function can be simplified to just `(accumulator, currentValue) => accumulator + currentValue`.
+
+Replace the current callback function argument in the `reduce()` function with the simplified callback function from above.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /reduce\(\(accumulator\,currentValue\)\=\>accumulator\+currentValue\,0\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => {
+        //console.log({ accumulator });
+        //console.log({ currentValue });
+        return accumulator + currentValue;
+      }, 0);
+
+    //console.log({ total });
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-023.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-023.md
new file mode 100644
index 0000000000..09974dcdf7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-023.md
@@ -0,0 +1,131 @@
+---
+id: 5ddb965c65d27e1512d44dae
+title: Part 23
+challengeType: 0
+dashedName: part-23
+---
+
+# --description--
+
+Now that we have the `total` number of calories that the user entered, we need to determine the maximum calories they should consume.
+
+Look at the form and notice that there are radio buttons for Female and Male. If Female is selected, the maximum calories consumed should be 2000, and if Male is selected, the maximum should be 2500.
+
+If you inspect the Female radio button you will notice its id: `<input type="radio" name="sex" id="female" value="F" checked="">`
+
+Create a variable named `maxCalories` and set it equal to the document element with the id of `female`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*maxCalories\s*=\s*document\.getElementById\([\'\"\`]female[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-024.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-024.md
new file mode 100644
index 0000000000..780a8572db
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-024.md
@@ -0,0 +1,129 @@
+---
+id: 5ddb965c65d27e1512d44daf
+title: Part 24
+challengeType: 0
+dashedName: part-24
+---
+
+# --description--
+
+Inspect the Female radio button again and notice that it has a `checked` attribute if it's checked: `<input type="radio" name="sex" id="female" value="F" checked>`
+
+Check to see if the Female radio button is checked or not by chaining on the `.checked` attribute to `document.getElementById('female')`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*maxCalories\s*=\s*document\.getElementById\([\'\"\`]female[\'\"\`]\)\.checked/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked;
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-025.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-025.md
new file mode 100644
index 0000000000..dfe3a8c520
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-025.md
@@ -0,0 +1,139 @@
+---
+id: 5ddb965c65d27e1512d44db0
+title: Part 25
+challengeType: 0
+dashedName: part-25
+---
+
+# --description--
+
+Use a ternary operator to assign the value of `maxCalories`. A ternary operator has the following syntax: `condition ? expressionTrue : expressionFalse`.
+
+For example, `(5 - 3 === 4) ? "Yes" : "No"` does the same thing as the following if else statement:
+
+```js
+if (5 - 3 === 4) {
+  return 'Yes';
+} else {
+  return 'No';
+}
+```
+
+`document.getElementById('female').checked` will return either `true` if it is checked or `false` if it isn't. Use a ternary operator to return 2000 if it is is checked and 2500 if it is not.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*maxCalories\s*=\s*document\.getElementById\([\'\"\`]female[\'\"\`]\)\.checked\s*\?\s*2000\s*\:\s*2500/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked;
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-026.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-026.md
new file mode 100644
index 0000000000..ccbc32e253
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-026.md
@@ -0,0 +1,127 @@
+---
+id: 5ddb965c65d27e1512d44db1
+title: Part 26
+challengeType: 0
+dashedName: part-26
+---
+
+# --description--
+
+Now that we have `total` and `maxCalories`, we need to find out the difference between them.
+
+Create a variable named `difference` and set it equal to `total - maxCalories`
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/const\s*difference\s*\=\s*total\s*\-\s*maxCalories?/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-027.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-027.md
new file mode 100644
index 0000000000..5a171c5455
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-027.md
@@ -0,0 +1,139 @@
+---
+id: 5ddb965c65d27e1512d44db2
+title: Part 27
+challengeType: 0
+dashedName: part-27
+---
+
+# --description--
+
+If `difference` is positive, the total calories the user ate is more than the `maxCalories` recommended, or a calories surplus -- otherwise, if `difference` is negative, the user has a calorie deficit.
+
+To determine if this is a calorie surplus or deficit, create a variable named `surplusOrDeficit` to determine if the difference is positive (`difference > 0`).
+
+If it is positive, `surplusOrDeficit` should be set equal to the string "Surplus", and "Deficit" if negative.
+
+Use the same ternary syntax that you used to determine `maxCalories`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*surplusOrDeficit\s*\=\s*difference\s*\>\s*0\s*\?\s*[\'\"\`]Surplus[\'\"\`]\s*\:\s*[\'\"\`]Deficit[\'\"\`]/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-028.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-028.md
new file mode 100644
index 0000000000..3a16672714
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-028.md
@@ -0,0 +1,141 @@
+---
+id: 5ddb965c65d27e1512d44db3
+title: Part 28
+challengeType: 0
+dashedName: part-28
+---
+
+# --description--
+
+If you look near the bottom of the HTML page, notice that there is currently an empty `div` element: `<div id="output"></div>`.
+
+We will be inserting output inside this `div`, telling the user if they are in a calorie surplus or deficit.
+
+Create a variable named `output` and set it equal to this division element with the `id` of `output`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*output\s*=\s*document\.getElementById\([\'\"\`]output[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-029.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-029.md
new file mode 100644
index 0000000000..54259be1df
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-029.md
@@ -0,0 +1,149 @@
+---
+id: 5ddb965c65d27e1512d44db4
+title: Part 29
+challengeType: 0
+dashedName: part-29
+---
+
+# --description--
+
+Now it's time to create the HTML elements that we will add inside of `output`.
+
+To create an element, use `createElement()`. For example:
+
+```js
+const myHeading1 = document.createElement('h1')
+```
+
+Create an `h3` element and assign it to a variable named `result`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*result\s*=\s*document\.createElement\([\'\"\`]h3[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-030.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-030.md
new file mode 100644
index 0000000000..5cb153bb9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-030.md
@@ -0,0 +1,152 @@
+---
+id: 5ddb965c65d27e1512d44db5
+title: Part 30
+challengeType: 0
+dashedName: part-30
+---
+
+# --description--
+
+Next, we will create a text node that we will later append to the `result` element.
+
+JavaScript has a function called `createTextNode()` to accomplish this. For example:
+
+```js
+const myText = document.createTextNode("Hello world!")
+```
+
+Create a variable named `resultText` and set it equal to a text node. Leave the string empty for now.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*resultText\s*=\s*document\.createTextNode\([\'\"\`]?\s*[\'\"\`]?\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode();
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-031.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-031.md
new file mode 100644
index 0000000000..cb1be5df67
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-031.md
@@ -0,0 +1,149 @@
+---
+id: 5ddb965c65d27e1512d44db6
+title: Part 31
+challengeType: 0
+dashedName: part-31
+---
+
+# --description--
+
+We can now use the `difference` variable that we created above.
+
+Insert the `difference` variable inside the parentheses of `.createTextNode()`
+
+If you want to see what the text currently looks like, try `console.log(resultText)`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*resultText\s*=\s*document\.createTextNode\(\s*difference\s*?\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode();
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(difference);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-032.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-032.md
new file mode 100644
index 0000000000..58d8630ee3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-032.md
@@ -0,0 +1,149 @@
+---
+id: 5ddb965c65d27e1512d44db7
+title: Part 32
+challengeType: 0
+dashedName: part-32
+---
+
+# --description--
+
+Notice how if `total` is less than `maxCalories`, `difference` is a negative number.
+
+We want to show the absolute value of the difference so it displays "300" rather than "-300".
+
+Wrap the `difference` in a `Math.abs()` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*resultText\s*=\s*document\.createTextNode\(\s*Math\.abs\(\s*difference\s*\)\s*\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(difference);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(Math.abs(difference));
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-033.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-033.md
new file mode 100644
index 0000000000..ba76ffd6f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-033.md
@@ -0,0 +1,147 @@
+---
+id: 5ddb965c65d27e1512d44db8
+title: Part 33
+challengeType: 0
+dashedName: part-33
+---
+
+# --description--
+
+Inside the parentheses of `.createTextNode()`, add `+ ' Calorie '` after `Math.abs(difference))`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*resultText\s*=\s*document\.createTextNode\(\s*Math\.abs\(\s*difference\s*\)\s*\+\s*[\'\"\`]\s*Calorie\s*[\'\"\`]\s*\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(Math.abs(difference));
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      Math.abs(difference) + ' Calorie '
+    );
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-034.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-034.md
new file mode 100644
index 0000000000..2a607d5640
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-034.md
@@ -0,0 +1,151 @@
+---
+id: 5ddb965c65d27e1512d44db9
+title: Part 34
+challengeType: 0
+dashedName: part-34
+---
+
+# --description--
+
+Next we want to add the text from the `surplusOrDeficit` variable that we previously created.
+
+Inside the parentheses of `.createTextNode()` add `+ surplusOrDeficit` after `Math.abs(difference) + ' Calorie '`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*resultText\s*=\s*document\.createTextNode\(\s*Math\.abs\(\s*difference\s*\)\s*\+\s*[\'\"\`]\s*Calorie\s*[\'\"\`]\s*\+\s*surplusOrDeficit\s*\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      Math.abs(difference) + ' Calorie '
+    );
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      Math.abs(difference) + ' Calorie ' + surplusOrDeficit
+    );
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-035.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-035.md
new file mode 100644
index 0000000000..3a2c170a59
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-035.md
@@ -0,0 +1,159 @@
+---
+id: 5ddb965c65d27e1512d44dba
+title: Part 35
+challengeType: 0
+dashedName: part-35
+---
+
+# --description--
+
+The data that we currently pass to `createTextNode()` is `Math.abs(difference) + ' Calorie ' + surplusOrDeficit`.
+
+Some people consider this a little cumbersome and prefer to use template literals instead.
+
+Template literals are enclosed in backticks (\`\`), and JavaScript expressions and variables can be embedded by enclosing them in `${}`.
+
+For example, ``console.log(`Hello ${firstName}, today is ${Date.now()}`)`` is the same as writing `console.log('Hello ' + firstName + ', today is ' + Date.now())`.
+
+Convert the data inside of `createTextNode()` to be a template literal.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.createTextNode\(\`\$\{Math\.abs\(difference\)\}Calorie\$\{surplusOrDeficit\}\`/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      Math.abs(difference) + ' Calorie ' + surplusOrDeficit
+    );
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-036.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-036.md
new file mode 100644
index 0000000000..909fc5870e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-036.md
@@ -0,0 +1,151 @@
+---
+id: 5ddb965c65d27e1512d44dbb
+title: Part 36
+challengeType: 0
+dashedName: part-36
+---
+
+# --description--
+
+Now you can append the `resultText` to the `result` with the `appendChild()` method, like this:
+
+```js
+result.appendChild(resultText);
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/result\.appendChild\(resultText\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-037.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-037.md
new file mode 100644
index 0000000000..a22f22ccef
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-037.md
@@ -0,0 +1,152 @@
+---
+id: 5ddb965c65d27e1512d44dbc
+title: Part 37
+challengeType: 0
+dashedName: part-37
+---
+
+# --description--
+
+Similarly, append the `result` to the `output` element with the `appendChild()` method.
+
+Now if you enter in data and push the Calculate button, you will see the text added to the HTML document!
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/output\.appendChild\(result\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-038.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-038.md
new file mode 100644
index 0000000000..7d1ee71406
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-038.md
@@ -0,0 +1,157 @@
+---
+id: 5ddb965c65d27e1512d44dbd
+title: Part 38
+challengeType: 0
+dashedName: part-38
+---
+
+# --description--
+
+Next, let's create and add a horizontal rule (`hr`) element to the output.
+
+Create an `hr` element and assign it to a variable named `line`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*line\s*=\s*document\.createElement\([\'\"\`]hr[\'\"\`]\)/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-039.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-039.md
new file mode 100644
index 0000000000..206d1898de
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-039.md
@@ -0,0 +1,156 @@
+---
+id: 5ddb965c65d27e1512d44dbe
+title: Part 39
+challengeType: 0
+dashedName: part-39
+---
+
+# --description--
+
+Add the `line` to the `output` element using the `appendChild()` method.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/output\.appendChild\(line\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+    
+    const line = document.createElement('hr');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-040.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-040.md
new file mode 100644
index 0000000000..034a14b6df
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-040.md
@@ -0,0 +1,165 @@
+---
+id: 5ddb965c65d27e1512d44dbf
+title: Part 40
+challengeType: 0
+dashedName: part-40
+---
+
+# --description--
+
+Let's create a few more HTML elements to add to the `output`.
+
+Create an `h4` element and assign it to a variable named `recommended`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*recommended\s*=\s*document\.createElement\([\'\"\`]h4[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-041.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-041.md
new file mode 100644
index 0000000000..81f6c9481e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-041.md
@@ -0,0 +1,168 @@
+---
+id: 5ddb965c65d27e1512d44dc0
+title: Part 41
+challengeType: 0
+dashedName: part-41
+---
+
+# --description--
+
+Create a text node and assign it to a variable named `recommendedText`.
+
+This is similar to how your created the `resultText` element previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*recommendedText\s*=\s*document\.createTextNode\([\'\"\`]?\s*[\'\"\`]?\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode();
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-042.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-042.md
new file mode 100644
index 0000000000..fc455be396
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-042.md
@@ -0,0 +1,173 @@
+---
+id: 5ddb965c65d27e1512d44dc1
+title: Part 42
+challengeType: 0
+dashedName: part-42
+---
+
+# --description--
+
+We want the `recommendedText` to say "XX Calories Recommended" where "XX" is the `maxCalories` variable that was previously created.
+
+Update text of `recommendedText` to use the `maxCalories` variable in a template literal along with the text "Calories Recommended".
+
+This is similar to template literal syntax previously used to create `resultText`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/document\.createTextNode\(\`\$\{maxCalories\}RecommendedCalories\`/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode();
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-043.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-043.md
new file mode 100644
index 0000000000..863a2f9bce
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-043.md
@@ -0,0 +1,173 @@
+---
+id: 5ddb965c65d27e1512d44dc2
+title: Part 43
+challengeType: 0
+dashedName: part-43
+---
+
+# --description--
+
+Append the `recommendedText` node to the `recommended` element.
+
+This is similar to how the `resultText` is appended to `result` previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/recommended\.appendChild\(recommendedText\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-044.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-044.md
new file mode 100644
index 0000000000..3a86333103
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-044.md
@@ -0,0 +1,172 @@
+---
+id: 5ddb965c65d27e1512d44dc3
+title: Part 44
+challengeType: 0
+dashedName: part-44
+---
+
+# --description--
+
+Append the `recommended` element to `output`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/output\.appendChild\(recommended\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-045.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-045.md
new file mode 100644
index 0000000000..ef995b910e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-045.md
@@ -0,0 +1,181 @@
+---
+id: 5ddb965c65d27e1512d44dc4
+title: Part 45
+challengeType: 0
+dashedName: part-45
+---
+
+# --description--
+
+Similar to the `recommended` element, we are going to create a `consumed` element that will display the amount of calories consumed.
+
+Create an `h4` element and assign it to a variable named `consumed`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*consumed\s*=\s*document\.createElement\([\'\"\`]h4[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-046.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-046.md
new file mode 100644
index 0000000000..dee873ed2c
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-046.md
@@ -0,0 +1,190 @@
+---
+id: 5ddb965c65d27e1512d44dc5
+title: Part 46
+challengeType: 0
+dashedName: part-46
+---
+
+# --description--
+
+Another way that we can set the text of the `consumed` element is to set the `innerHTML` property.
+
+For example:
+
+```js
+consumed.innerHTML = `Hello world`;
+```
+
+Set the inner HTML of `consumed` to "XX Consumed Calories", where "XX" is the `total` variable that was previously created. Use template literals.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/consumed\.innerHTML\=\`\$\{total\}ConsumedCalories\`/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-047.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-047.md
new file mode 100644
index 0000000000..0ccaa018c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-047.md
@@ -0,0 +1,180 @@
+---
+id: 5ddb965c65d27e1512d44dc6
+title: Part 47
+challengeType: 0
+dashedName: part-47
+---
+
+# --description--
+
+Append the `consumed` element to `output`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/output\.appendChild\(consumed\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-048.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-048.md
new file mode 100644
index 0000000000..7db49671eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-048.md
@@ -0,0 +1,191 @@
+---
+id: 5ddb965c65d27e1512d44dc7
+title: Part 48
+challengeType: 0
+dashedName: part-48
+---
+
+# --description--
+
+Now it's time to add some styling which can be added directly as attributes or classes.
+
+In our CSS file, we have a styling rule for any elements with the class name `green-text`.
+
+On line **20**, right after creating the `result` element, set the `className` property of `result` to be equal to `'green-text'`.
+
+Now if you submit the form again and inspect the `result` element, you will see it as `<h3 class="green-text">` and notice that the text is now green.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/result\.className\=[\'\"\`]green-text[\'\"\`]/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    //put your code here
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-049.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-049.md
new file mode 100644
index 0000000000..a6e5a02cd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-049.md
@@ -0,0 +1,197 @@
+---
+id: 5ddb965c65d27e1512d44dc8
+title: Part 49
+challengeType: 0
+dashedName: part-49
+---
+
+# --description--
+
+You can also add styling with the `setAttribute()` method. This method takes two arguments: the name of the attribute and the value that the attribute should be.
+
+For example, if you want to set the `width` of an `input` element to 100px, you would write `input.setAttribute('width', '100px')`.
+
+Set the `class` attribute of the `output` element equal to a class named `bordered-class`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /output\.setAttribute\([\'\"\`]class[\'\"\`]\,[\'\"\`]bordered-class[\'\"\`]\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    //put your code here
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-050.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-050.md
new file mode 100644
index 0000000000..322df8ded1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-050.md
@@ -0,0 +1,196 @@
+---
+id: 5ddb965c65d27e1512d44dc9
+title: Part 50
+challengeType: 0
+dashedName: part-50
+---
+
+# --description--
+
+Another way to add styling is to use the `style` property directly, like `output.style.width = '300px'`.
+
+Add a `backgroundColor` style to `output` and set it equal to `'#FFF9C4'`.
+
+The `calculate()` function is now finished!
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/output\.style\.backgroundColor\=[\'\"\`]\#FFF9C4[\'\"\`]/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-051.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-051.md
new file mode 100644
index 0000000000..fe824490f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-051.md
@@ -0,0 +1,203 @@
+---
+id: 5ddb965c65d27e1512d44dca
+title: Part 51
+challengeType: 0
+dashedName: part-51
+---
+
+# --description--
+
+When the user clicks the "Add Entry" button, they should be provided with additional text inputs to enter in a food name and calorie amount. These will be included in the `calculate()` function.
+
+In the HTML document, notice that the "Add Entry" button has the `id` attribute `add`:
+
+```html
+<button type="button" class="btn-add" id="add">
+```
+
+Get a reference to the `document` element with the `id` attribute `add`. This is similar to the reference to the `calorie-form` element that you wrote near the top of this document.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/document\.getElementById\([\'\"\`]add[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-052.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-052.md
new file mode 100644
index 0000000000..f4cadf1ca9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-052.md
@@ -0,0 +1,205 @@
+---
+id: 5ddb965c65d27e1512d44dcb
+title: Part 52
+challengeType: 0
+dashedName: part-52
+---
+
+# --description--
+
+We want a function to run every time the user clicks the "Add Entry" button.
+
+Chain the `onclick` property to the end of `document.getElementById('add')` and set it equal to an empty function:
+
+```js
+function() {}
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]add[\'\"\`]\)\.onclick\=function\(\)\{\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-053.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-053.md
new file mode 100644
index 0000000000..8564d3e93d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-053.md
@@ -0,0 +1,201 @@
+---
+id: 5ddb965c65d27e1512d44dcc
+title: Part 53
+challengeType: 0
+dashedName: part-53
+---
+
+# --description--
+
+Inside the function, create an `input` document element and assign it to a variable named `foodInput`.
+
+This is similar to how you created the `result` element previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*foodInput\s*=\s*document\.createElement\([\'\"\`]input[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-054.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-054.md
new file mode 100644
index 0000000000..862dd108b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-054.md
@@ -0,0 +1,202 @@
+---
+id: 5ddb965c65d27e1512d44dcd
+title: Part 54
+challengeType: 0
+dashedName: part-54
+---
+
+# --description--
+
+Set the `placeholder` property of the `foodInput` equal to `'food name'`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/foodInput\.placeholder\=[\'\"\`]foodname[\'\"\`]/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-055.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-055.md
new file mode 100644
index 0000000000..a11aac552e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-055.md
@@ -0,0 +1,208 @@
+---
+id: 5ddb965c65d27e1512d44dce
+title: Part 55
+challengeType: 0
+dashedName: part-55
+---
+
+# --description--
+
+We want to add the class name `food-control` to the `foodInput` element. We will reference this class name when we remove these inputs later on.
+
+In addition to using the `setAttribute` method, we can also update the `classList` property to add a class name, like `myInput.classList.add('my-class)`.
+
+Add the class name `food-control` to the `foodInput` element.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/foodInput\.classList\.add\([\'\"\`]food\-control[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-056.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-056.md
new file mode 100644
index 0000000000..cd13e1652e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-056.md
@@ -0,0 +1,212 @@
+---
+id: 5ddb965c65d27e1512d44dcf
+title: Part 56
+challengeType: 0
+dashedName: part-56
+---
+
+# --description--
+
+Notice that parent container of all of the inputs has an `id` of `entries`: `<div class="grid" id="entries">`.
+
+Get a reference to the document element with the `id` attribute `entries` and append the `foodInput` element to it by chaining on the `.appendChild()` function.
+
+This is similar to the other `appendChild()` methods that you have used previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]entries[\'\"\`]\)\.appendChild\(foodInput\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-057.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-057.md
new file mode 100644
index 0000000000..6a35bb7ab9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-057.md
@@ -0,0 +1,209 @@
+---
+id: 5ddb965c65d27e1512d44dd0
+title: Part 57
+challengeType: 0
+dashedName: part-57
+---
+
+# --description--
+
+Create a variable named `calorieInput` and set it equal to another `input` document element. This is similar to how you created the `foodInput`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  /const\s*calorieInput\s*=\s*document\.createElement\([\'\"\`]input[\'\"\`]\)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-058.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-058.md
new file mode 100644
index 0000000000..d81ee6e6a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-058.md
@@ -0,0 +1,216 @@
+---
+id: 5ddb965c65d27e1512d44dd1
+title: Part 58
+challengeType: 0
+dashedName: part-58
+---
+
+# --description--
+
+Use the `setAttribute()` method of `calorieInput` to set the `type` of this input to `number`.
+
+This is similar to how to set the class of the `output` element previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /calorieInput\.setAttribute\([\'\"\`]type[\'\"\`]\,[\'\"\`]number[\'\"\`]\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-059.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-059.md
new file mode 100644
index 0000000000..348da09429
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-059.md
@@ -0,0 +1,218 @@
+---
+id: 5ddb965c65d27e1512d44dd2
+title: Part 59
+challengeType: 0
+dashedName: part-59
+---
+
+# --description--
+
+The `calorieInput` element should only accept numbers that are 0 or above.
+
+Set the `min` attribute of `calorieInput` to `0`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /calorieInput\.setAttribute\([\'\"\`]min[\'\"\`]\,[\'\"\`]0[\'\"\`]\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-060.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-060.md
new file mode 100644
index 0000000000..420a10386d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-060.md
@@ -0,0 +1,218 @@
+---
+id: 5ddb965c65d27e1512d44dd3
+title: Part 60
+challengeType: 0
+dashedName: part-60
+---
+
+# --description--
+
+Add a class named `cal-control` to the `calorieInput` element. This is similar to how you added a class name to the `foodInput` element previously.
+
+We are adding this class name because in the `calculate()` function you created previously, the `total` is calculated from the elements with the class name `cal-control`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/calorieInput\.classList\.add\([\'\"\`]cal\-control[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-061.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-061.md
new file mode 100644
index 0000000000..a5d24110f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-061.md
@@ -0,0 +1,220 @@
+---
+id: 5ddb965c65d27e1512d44dd4
+title: Part 61
+challengeType: 0
+dashedName: part-61
+---
+
+# --description--
+
+Later we will want to remove these extra `calorieInput` elements that we added. This will happen when the user pushes the "Clear" button.
+
+To keep track of them, add the class name `extra-cal-control` to the `calorieInput` element.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/calorieInput\.classList\.add\([\'\"\`]extra-cal\-control[\'\"\`]\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-062.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-062.md
new file mode 100644
index 0000000000..32f589a264
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-062.md
@@ -0,0 +1,224 @@
+---
+id: 5ddb965c65d27e1512d44dd5
+title: Part 62
+challengeType: 0
+dashedName: part-62
+---
+
+# --description--
+
+Add the `calorieInput` element to the element with the `id` of `entries` by using the `appendChild()` method.
+
+The Add Entry functionality is now finished. You can test it by clicking the "Add Entry" button, entering in food names and their calories, and then clicking the "Calculate" button.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]entries[\'\"\`]\)\.appendChild\(calorieInput\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-063.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-063.md
new file mode 100644
index 0000000000..fb73ccba8f
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-063.md
@@ -0,0 +1,227 @@
+---
+id: 5ddb965c65d27e1512d44dd6
+title: Part 63
+challengeType: 0
+dashedName: part-63
+---
+
+# --description--
+
+Next we need a way to reset the form back to its original state. To do this, we specify what to do when the user clicks the "Clear" button.
+
+Get a reference to the `document` element with the `id` of `clear` and set its `onclick` property to equal to an empty function, `function(){}`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]clear[\'\"\`]\)\.onclick\=function\(\)\{\}/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-064.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-064.md
new file mode 100644
index 0000000000..331871b746
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-064.md
@@ -0,0 +1,224 @@
+---
+id: 5ddb965c65d27e1512d44dd7
+title: Part 64
+challengeType: 0
+dashedName: part-64
+---
+
+# --description--
+
+Inside the `function` body, instruct your code to call two other functions, `clearOutput()` and `clearForm()`. We will create these functions shortly.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(/clearOutput\(\)/.test(code) && /clearForm\(\)/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-065.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-065.md
new file mode 100644
index 0000000000..4484fa0236
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-065.md
@@ -0,0 +1,235 @@
+---
+id: 5ddb965c65d27e1512d44dd8
+title: Part 65
+challengeType: 0
+dashedName: part-65
+---
+
+# --description--
+
+Create a variable named `clearOutput` and set it equal to a blank arrow function:
+
+```js
+const clearOutput = () => {}
+```
+
+This is similar to `function clearOutput () {}`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof clearOutput === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-066.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-066.md
new file mode 100644
index 0000000000..2cdfc3804d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-066.md
@@ -0,0 +1,241 @@
+---
+id: 5ddb965c65d27e1512d44dd9
+title: Part 66
+challengeType: 0
+dashedName: part-66
+---
+
+# --description--
+
+We need to remove the contents inside of element with the `id` of `output`.
+
+In the body of the `clearOutput()` function, set the `innerHTML` property of that element equal to an empty string, `''`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]output[\'\"\`]\)\.innerHTML\=[\'\"\`][\'\"\`]/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-067.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-067.md
new file mode 100644
index 0000000000..4aa35cd16e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-067.md
@@ -0,0 +1,248 @@
+---
+id: 5ddb965c65d27e1512d44dda
+title: Part 67
+challengeType: 0
+dashedName: part-67
+---
+
+# --description--
+
+Now notice that if you click the "Clear" button, the `output` element is empty, but it still has a border around it. This is because we previously added the `bordered-class` class to this element.
+
+Remove the `bordered-class` class. For example:
+
+```js
+document.getElementById('my-div').classList.remove('my-class')
+```
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /document\.getElementById\([\'\"\`]output[\'\"\`]\)\.classList\.remove\([\'\"\`]bordered-class[\'\"\`]\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-068.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-068.md
new file mode 100644
index 0000000000..11754ad575
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-068.md
@@ -0,0 +1,241 @@
+---
+id: 5ddb965c65d27e1512d44ddb
+title: Part 68
+challengeType: 0
+dashedName: part-68
+---
+
+# --description--
+
+The `clearOutput` function is called when the user clicks the "Clear" button. But it also needs to be run when the user clicks the "Calculate" button.
+
+In the `calculate()` function, right after `event.preventDefault()`, call the `clearOutput` function.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(calculate.toString().match(/clearOutput\(\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    //put your code here
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-069.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-069.md
new file mode 100644
index 0000000000..f6d8088b08
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-069.md
@@ -0,0 +1,241 @@
+---
+id: 5ddb965c65d27e1512d44ddc
+title: Part 69
+challengeType: 0
+dashedName: part-69
+---
+
+# --description--
+
+Create a variable named `clearForm` and set it equal to a blank arrow function like you did with `clearOutput`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(typeof clearForm === 'function');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {};
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-070.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-070.md
new file mode 100644
index 0000000000..901e0c9e85
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-070.md
@@ -0,0 +1,257 @@
+---
+id: 5ddb965c65d27e1512d44ddd
+title: Part 70
+challengeType: 0
+dashedName: part-70
+---
+
+# --description--
+
+We need to remove all elements with the class name `food-control` that are added when the user clicks the "Add" button.
+
+Inside the function body of `clearForm`, create a variable named `foodInputs` and set it equal to an array of elements with the class name `food-control`.
+
+This is similar to how you declared the `total` variable previously in the `calculate` method.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /const\s*foodInputs\s*=Array\.from\(document\.getElementsByClassName\([\'\"\`]food\-control[\'\"\`]\)\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {};
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-071.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-071.md
new file mode 100644
index 0000000000..3019af35d3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-071.md
@@ -0,0 +1,255 @@
+---
+id: 5ddb965c65d27e1512d44dde
+title: Part 71
+challengeType: 0
+dashedName: part-71
+---
+
+# --description--
+
+To remove the items `foodInputs` array, we will iterate through them by using the `forEach()` function.
+
+Add `foodInputs.forEach()`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(code.replace(/\s/g, '').match(/foodInputs.forEach\(\)/));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach();
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-072.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-072.md
new file mode 100644
index 0000000000..08f456d122
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-072.md
@@ -0,0 +1,261 @@
+---
+id: 5ddb965c65d27e1512d44ddf
+title: Part 72
+challengeType: 0
+dashedName: part-72
+---
+
+# --description--
+
+We need to provide a callback function in the parentheses of `forEach()`.
+
+This function will take each input item, in our case we'll call it `input`, as an argument. Then inside the function body, we need to call the `remove()` method.
+
+In between the parentheses of the `.forEach()` function, enter `input => input.remove()`.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/foodInputs.forEach\(input=>input.remove\(\)\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach();
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-073.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-073.md
new file mode 100644
index 0000000000..4389186108
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-073.md
@@ -0,0 +1,269 @@
+---
+id: 5ddb965c65d27e1512d44de0
+title: Part 73
+challengeType: 0
+dashedName: part-73
+---
+
+# --description--
+
+We also need to remove all elements with the class name `extra-cal-control` that are added when the user clicks the "Add" button.
+
+Create a variable named `calInputs` and set it equal to an array of elements with the class name `extra-cal-control`.
+
+This is similar to how you declared the `foodInputs` variable previously.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(
+      /const\s*calInputs\s*=Array\.from\(document\.getElementsByClassName\([\'\"\`]extra-cal-control[\'\"\`]\)\)/
+    )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-074.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-074.md
new file mode 100644
index 0000000000..247b4c93eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-074.md
@@ -0,0 +1,267 @@
+---
+id: 5ddb965c65d27e1512d44de1
+title: Part 74
+challengeType: 0
+dashedName: part-74
+---
+
+# --description--
+
+Similar to how you removed each `foodInputs` elements, use the `forEach()` function to remove each `calInputs` element.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/calInputs.forEach\(input=>input.remove\(\)\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+
+    calInputs.forEach(input => input.remove());
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-075.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-075.md
new file mode 100644
index 0000000000..3ff7eeb2bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-075.md
@@ -0,0 +1,275 @@
+---
+id: 5ddb965c65d27e1512d44de2
+title: Part 75
+challengeType: 0
+dashedName: part-75
+---
+
+# --description--
+
+Finally, it's time to clear the other calories that may have been entered for Breakfast, Lunch, and Dinner. This can be achieved by calling the `reset()` method on the form.
+
+Get a reference to the document element with the `id` of `calorie-form` and chain the `reset()` method to it.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+assert(
+  code
+    .replace(/\s/g, '')
+    .match(/document\.getElementById\([\'\"\`]calorie-form[\'\"\`]\).reset\(\)/)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+
+    calInputs.forEach(input => input.remove());
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+
+    calInputs.forEach(input => input.remove());
+
+    document.getElementById('calorie-form').reset();
+  };
+</script>
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-076.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-076.md
new file mode 100644
index 0000000000..d740ed6a26
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/intermediate-javascript-calorie-counter/part-076.md
@@ -0,0 +1,185 @@
+---
+id: 5ddb965c65d27e1512d44de3
+title: Part 76
+challengeType: 0
+dashedName: part-76
+---
+
+# --description--
+
+Congratulations! Have fun playing with your completed calorie counter.
+
+# --hints--
+
+See description above for instructions.
+
+```js
+
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <meta charset="utf-8" />
+    <title></title>
+    <meta name="description" content="" />
+    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <link rel="stylesheet" href="styles.css" />
+  </head>
+  <body>
+    <div class="container">
+      <form id="calorie-form">
+        <h2 class="center">Calorie Counter</h2>
+        <div class="grid">
+          <legend>Sex</legend>
+          <div>
+            <input type="radio" name="sex" id="female" value="F" checked />
+            <label for="female">
+              Female (2,000 calories)
+            </label>
+
+            <div>
+              <input type="radio" name="sex" id="male" value="M" />
+              <label for="male">
+                Male (2,500 calories)
+              </label>
+            </div>
+          </div>
+        </div>
+        <div class="grid" id="entries">
+          Breakfast
+          <input
+            type="number"
+            min="0"
+            class="cal-control"
+            id="breakfast"
+          /><br />
+          Lunch
+          <input type="number" min="0" class="cal-control" id="lunch" /><br />
+          Dinner <input type="number" min="0" class="cal-control" id="dinner" />
+        </div>
+        <button type="button" class="btn-add" id="add">
+          Add Entry
+        </button>
+        <button type="submit" class="btn-solid" id="calculate">
+          Calculate
+        </button>
+        <button type="button" class="btn-outline" id="clear">
+          Clear
+        </button>
+      </form>
+      <div id="output"></div>
+    </div>
+  </body>
+</html>
+```
+
+## --after-user-code--
+
+```html
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  document.getElementById('calorie-form').onsubmit = calculate;
+
+  function calculate(e) {
+    e.preventDefault();
+    clearOutput();
+
+    const total = Array.from(document.getElementsByClassName('cal-control'))
+      .map(meal => Number(meal.value))
+      .reduce((accumulator, currentValue) => accumulator + currentValue, 0);
+
+    const maxCalories = document.getElementById('female').checked ? 2000 : 2500;
+
+    const difference = total - maxCalories;
+
+    const surplusOrDeficit = difference > 0 ? 'Surplus' : 'Deficit';
+
+    const output = document.getElementById('output');
+
+    const result = document.createElement('h3');
+    result.className = 'green-text';
+    const resultText = document.createTextNode(
+      `${Math.abs(difference)} Calorie ${surplusOrDeficit}`
+    );
+
+    result.appendChild(resultText);
+    output.appendChild(result);
+
+    const line = document.createElement('hr');
+    output.appendChild(line);
+
+    const recommended = document.createElement('h4');
+    const recommendedText = document.createTextNode(
+      `${maxCalories} Recommended Calories`
+    );
+
+    recommended.appendChild(recommendedText);
+    output.appendChild(recommended);
+
+    const consumed = document.createElement('h4');
+    consumed.innerHTML = `${total} Consumed Calories`;
+    output.appendChild(consumed);
+
+    output.setAttribute('class', 'bordered-class');
+    output.style.backgroundColor = '#FFF9C4';
+  }
+
+  document.getElementById('add').onclick = function() {
+    const foodInput = document.createElement('input');
+    foodInput.placeholder = 'food name';
+    foodInput.classList.add('food-control');
+    document.getElementById('entries').appendChild(foodInput);
+
+    const calorieInput = document.createElement('input');
+    calorieInput.setAttribute('type', 'number');
+    calorieInput.setAttribute('min', '0');
+    calorieInput.classList.add('cal-control');
+    calorieInput.classList.add('extra-cal-control');
+    document.getElementById('entries').appendChild(calorieInput);
+  };
+
+  document.getElementById('clear').onclick = function() {
+    clearOutput();
+    clearForm();
+  };
+
+  const clearOutput = () => {
+    document.getElementById('output').innerHTML = '';
+    document.getElementById('output').classList.remove('bordered-class');
+  };
+
+  const clearForm = () => {
+    const foodInputs = Array.from(
+      document.getElementsByClassName('food-control')
+    );
+
+    foodInputs.forEach(input => input.remove());
+
+    const calInputs = Array.from(
+      document.getElementsByClassName('extra-cal-control')
+    );
+
+    calInputs.forEach(input => input.remove());
+
+    document.getElementById('calorie-form').reset();
+  };
+</script>
+```
+
+# --solutions--
+
+```html
+<!-- Solution not necessary for the last step -->
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/caesars-cipher.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/caesars-cipher.md
new file mode 100644
index 0000000000..b94a388ea0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/caesars-cipher.md
@@ -0,0 +1,89 @@
+---
+id: 56533eb9ac21ba0edf2244e2
+title: Caesars Cipher
+challengeType: 5
+forumTopicId: 16003
+dashedName: caesars-cipher
+---
+
+# --description--
+
+One of the simplest and most widely known <dfn>ciphers</dfn> is a <dfn>Caesar cipher</dfn>, also known as a <dfn>shift cipher</dfn>. In a shift cipher the meanings of the letters are shifted by some set amount.
+
+A common modern use is the [ROT13](https://en.wikipedia.org/wiki/ROT13) cipher, where the values of the letters are shifted by 13 places. Thus `A ↔ N`, `B ↔ O` and so on.
+
+Write a function which takes a [ROT13](https://en.wikipedia.org/wiki/ROT13) encoded string as input and returns a decoded string.
+
+All letters will be uppercase. Do not transform any non-alphabetic character (i.e. spaces, punctuation), but do pass them on.
+
+# --hints--
+
+`rot13("SERR PBQR PNZC")` should decode to the string `FREE CODE CAMP`
+
+```js
+assert(rot13('SERR PBQR PNZC') === 'FREE CODE CAMP');
+```
+
+`rot13("SERR CVMMN!")` should decode to the string `FREE PIZZA!`
+
+```js
+assert(rot13('SERR CVMMN!') === 'FREE PIZZA!');
+```
+
+`rot13("SERR YBIR?")` should decode to the string `FREE LOVE?`
+
+```js
+assert(rot13('SERR YBIR?') === 'FREE LOVE?');
+```
+
+`rot13("GUR DHVPX OEBJA SBK WHZCF BIRE GUR YNML QBT.")` should decode to the string `THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.`
+
+```js
+assert(
+  rot13('GUR DHVPX OEBJA SBK WHZCF BIRE GUR YNML QBT.') ===
+    'THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function rot13(str) {
+
+  return str;
+}
+
+rot13("SERR PBQR PNZC");
+```
+
+# --solutions--
+
+```js
+var lookup = {
+  'A': 'N','B': 'O','C': 'P','D': 'Q',
+  'E': 'R','F': 'S','G': 'T','H': 'U',
+  'I': 'V','J': 'W','K': 'X','L': 'Y',
+  'M': 'Z','N': 'A','O': 'B','P': 'C',
+  'Q': 'D','R': 'E','S': 'F','T': 'G',
+  'U': 'H','V': 'I','W': 'J','X': 'K',
+  'Y': 'L','Z': 'M'
+};
+
+function rot13(encodedStr) {
+  var codeArr = encodedStr.split("");  // String to Array
+  var decodedArr = []; // Your Result goes here
+  // Only change code below this line
+
+  decodedArr = codeArr.map(function(letter) {
+    if(lookup.hasOwnProperty(letter)) {
+      letter = lookup[letter];
+    }
+    return letter;
+  });
+
+  // Only change code above this line
+  return decodedArr.join(""); // Array to String
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register.md
new file mode 100644
index 0000000000..49336bf373
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register.md
@@ -0,0 +1,249 @@
+---
+id: aa2e6f85cab2ab736c9a9b24
+title: Cash Register
+challengeType: 5
+forumTopicId: 16012
+dashedName: cash-register
+---
+
+# --description--
+
+Design a cash register drawer function `checkCashRegister()` that accepts purchase price as the first argument (`price`), payment as the second argument (`cash`), and cash-in-drawer (`cid`) as the third argument.
+
+`cid` is a 2D array listing available currency.
+
+The `checkCashRegister()` function should always return an object with a `status` key and a `change` key.
+
+Return `{status: "INSUFFICIENT_FUNDS", change: []}` if cash-in-drawer is less than the change due, or if you cannot return the exact change.
+
+Return `{status: "CLOSED", change: [...]}` with cash-in-drawer as the value for the key `change` if it is equal to the change due.
+
+Otherwise, return `{status: "OPEN", change: [...]}`, with the change due in coins and bills, sorted in highest to lowest order, as the value of the `change` key.
+
+<table class='table table-striped'><tbody><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 (ONE)</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></tbody></table>
+
+See below for an example of a cash-in-drawer array:
+
+```js
+[
+  ["PENNY", 1.01],
+  ["NICKEL", 2.05],
+  ["DIME", 3.1],
+  ["QUARTER", 4.25],
+  ["ONE", 90],
+  ["FIVE", 55],
+  ["TEN", 20],
+  ["TWENTY", 60],
+  ["ONE HUNDRED", 100]
+]
+```
+
+# --hints--
+
+`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]])` should return an object.
+
+```js
+assert.deepEqual(
+  Object.prototype.toString.call(
+    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]
+    ])
+  ),
+  '[object Object]'
+);
+```
+
+`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]])` should return `{status: "OPEN", change: [["QUARTER", 0.5]]}`.
+
+```js
+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]
+  ]),
+  { status: 'OPEN', change: [['QUARTER', 0.5]] }
+);
+```
+
+`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]])` should return `{status: "OPEN", change: [["TWENTY", 60], ["TEN", 20], ["FIVE", 15], ["ONE", 1], ["QUARTER", 0.5], ["DIME", 0.2], ["PENNY", 0.04]]}`.
+
+```js
+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]
+  ]),
+  {
+    status: 'OPEN',
+    change: [
+      ['TWENTY', 60],
+      ['TEN', 20],
+      ['FIVE', 15],
+      ['ONE', 1],
+      ['QUARTER', 0.5],
+      ['DIME', 0.2],
+      ['PENNY', 0.04]
+    ]
+  }
+);
+```
+
+`checkCashRegister(19.5, 20, [["PENNY", 0.01], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]])` should return `{status: "INSUFFICIENT_FUNDS", change: []}`.
+
+```js
+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]
+  ]),
+  { status: 'INSUFFICIENT_FUNDS', change: [] }
+);
+```
+
+`checkCashRegister(19.5, 20, [["PENNY", 0.01], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 1], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]])` should return `{status: "INSUFFICIENT_FUNDS", change: []}`.
+
+```js
+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]
+  ]),
+  { status: 'INSUFFICIENT_FUNDS', change: [] }
+);
+```
+
+`checkCashRegister(19.5, 20, [["PENNY", 0.5], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]])` should return `{status: "CLOSED", change: [["PENNY", 0.5], ["NICKEL", 0], ["DIME", 0], ["QUARTER", 0], ["ONE", 0], ["FIVE", 0], ["TEN", 0], ["TWENTY", 0], ["ONE HUNDRED", 0]]}`.
+
+```js
+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]
+  ]),
+  {
+    status: 'CLOSED',
+    change: [
+      ['PENNY', 0.5],
+      ['NICKEL', 0],
+      ['DIME', 0],
+      ['QUARTER', 0],
+      ['ONE', 0],
+      ['FIVE', 0],
+      ['TEN', 0],
+      ['TWENTY', 0],
+      ['ONE HUNDRED', 0]
+    ]
+  }
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkCashRegister(price, cash, cid) {
+  var change;
+  return change;
+}
+
+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--
+
+```js
+var denom = [
+    { name: 'ONE HUNDRED', val: 100},
+    { name: 'TWENTY', val: 20},
+    { name: 'TEN', val: 10},
+    { name: 'FIVE', val: 5},
+    { name: 'ONE', val: 1},
+    { name: 'QUARTER', val: 0.25},
+    { name: 'DIME', val: 0.1},
+    { name: 'NICKEL', val: 0.05},
+    { name: 'PENNY', val: 0.01}
+];
+
+function checkCashRegister(price, cash, cid) {
+ var output = {status: null, change: []};
+ var change = cash - price;
+ var register = cid.reduce(function(acc, curr) {
+ acc.total += curr[1];
+ acc[curr[0]] = curr[1];
+ return acc;
+ }, {total: 0});
+ if(register.total === change) {
+ output.status = 'CLOSED';
+ output.change = cid;
+ return output;
+ }
+ if(register.total < change) {
+ output.status = 'INSUFFICIENT_FUNDS';
+ return output;
+ }
+ var change_arr = denom.reduce(function(acc, curr) {
+ var value = 0;
+ while(register[curr.name] > 0 && change >= curr.val) {
+ change -= curr.val;
+ register[curr.name] -= curr.val;
+ value += curr.val;
+ change = Math.round(change * 100) / 100;
+ }
+ if(value > 0) {
+ acc.push([ curr.name, value ]);
+ }
+ return acc;
+ }, []);
+ if(change_arr.length < 1 || change > 0) {
+ output.status = 'INSUFFICIENT_FUNDS';
+ return output;
+ }
+ output.status = 'OPEN';
+ output.change = change_arr;
+ return output;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker.md
new file mode 100644
index 0000000000..e6107a26b4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker.md
@@ -0,0 +1,127 @@
+---
+id: aaa48de84e1ecc7c742e1124
+title: Palindrome Checker
+challengeType: 5
+forumTopicId: 16004
+dashedName: palindrome-checker
+---
+
+# --description--
+
+Return `true` if the given string is a palindrome. Otherwise, return `false`.
+
+A <dfn>palindrome</dfn> is a word or sentence that's spelled the same way both forward and backward, ignoring punctuation, case, and spacing.
+
+**Note:** You'll need to remove **all non-alphanumeric characters** (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 `racecar`, `RaceCar`, and `race CAR` among others.
+
+We'll also pass strings with special symbols, such as `2A3*3a2`, `2A3 3a2`, and `2_A3*3#A2`.
+
+# --hints--
+
+`palindrome("eye")` should return a boolean.
+
+```js
+assert(typeof palindrome('eye') === 'boolean');
+```
+
+`palindrome("eye")` should return `true`.
+
+```js
+assert(palindrome('eye') === true);
+```
+
+`palindrome("_eye")` should return `true`.
+
+```js
+assert(palindrome('_eye') === true);
+```
+
+`palindrome("race car")` should return `true`.
+
+```js
+assert(palindrome('race car') === true);
+```
+
+`palindrome("not a palindrome")` should return `false`.
+
+```js
+assert(palindrome('not a palindrome') === false);
+```
+
+`palindrome("A man, a plan, a canal. Panama")` should return `true`.
+
+```js
+assert(palindrome('A man, a plan, a canal. Panama') === true);
+```
+
+`palindrome("never odd or even")` should return `true`.
+
+```js
+assert(palindrome('never odd or even') === true);
+```
+
+`palindrome("nope")` should return `false`.
+
+```js
+assert(palindrome('nope') === false);
+```
+
+`palindrome("almostomla")` should return `false`.
+
+```js
+assert(palindrome('almostomla') === false);
+```
+
+`palindrome("My age is 0, 0 si ega ym.")` should return `true`.
+
+```js
+assert(palindrome('My age is 0, 0 si ega ym.') === true);
+```
+
+`palindrome("1 eye for of 1 eye.")` should return `false`.
+
+```js
+assert(palindrome('1 eye for of 1 eye.') === false);
+```
+
+`palindrome("0_0 (: /-\ :) 0-0")` should return `true`.
+
+```js
+assert(palindrome('0_0 (: /- :) 0-0') === true);
+```
+
+`palindrome("five|\_/|four")` should return `false`.
+
+```js
+assert(palindrome('five|_/|four') === false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function palindrome(str) {
+  return true;
+}
+
+
+
+palindrome("eye");
+```
+
+# --solutions--
+
+```js
+function palindrome(str) {
+  var string = str.toLowerCase().split(/[^A-Za-z0-9]/gi).join('');
+  var aux = string.split('');
+  if (aux.join('') === aux.reverse().join('')){
+    return true;
+  }
+
+  return false;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter.md
new file mode 100644
index 0000000000..78d91a3ec9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter.md
@@ -0,0 +1,199 @@
+---
+id: a7f4d8f2483413a6ce226cac
+title: Roman Numeral Converter
+challengeType: 5
+forumTopicId: 16044
+dashedName: roman-numeral-converter
+---
+
+# --description--
+
+Convert the given number into a roman numeral.
+
+All [roman numerals](http://www.mathsisfun.com/roman-numerals.html) answers should be provided in upper-case.
+
+# --hints--
+
+`convertToRoman(2)` should return the string `II`.
+
+```js
+assert.deepEqual(convertToRoman(2), 'II');
+```
+
+`convertToRoman(3)` should return the string `III`.
+
+```js
+assert.deepEqual(convertToRoman(3), 'III');
+```
+
+`convertToRoman(4)` should return the string `IV`.
+
+```js
+assert.deepEqual(convertToRoman(4), 'IV');
+```
+
+`convertToRoman(5)` should return the string `V`.
+
+```js
+assert.deepEqual(convertToRoman(5), 'V');
+```
+
+`convertToRoman(9)` should return the string `IX`.
+
+```js
+assert.deepEqual(convertToRoman(9), 'IX');
+```
+
+`convertToRoman(12)` should return the string `XII`.
+
+```js
+assert.deepEqual(convertToRoman(12), 'XII');
+```
+
+`convertToRoman(16)` should return the string `XVI`.
+
+```js
+assert.deepEqual(convertToRoman(16), 'XVI');
+```
+
+`convertToRoman(29)` should return the string `XXIX`.
+
+```js
+assert.deepEqual(convertToRoman(29), 'XXIX');
+```
+
+`convertToRoman(44)` should return the string `XLIV`.
+
+```js
+assert.deepEqual(convertToRoman(44), 'XLIV');
+```
+
+`convertToRoman(45)` should return the string `XLV`.
+
+```js
+assert.deepEqual(convertToRoman(45), 'XLV');
+```
+
+`convertToRoman(68)` should return the string `LXVIII`
+
+```js
+assert.deepEqual(convertToRoman(68), 'LXVIII');
+```
+
+`convertToRoman(83)` should return the string `LXXXIII`
+
+```js
+assert.deepEqual(convertToRoman(83), 'LXXXIII');
+```
+
+`convertToRoman(97)` should return the string `XCVII`
+
+```js
+assert.deepEqual(convertToRoman(97), 'XCVII');
+```
+
+`convertToRoman(99)` should return the string `XCIX`
+
+```js
+assert.deepEqual(convertToRoman(99), 'XCIX');
+```
+
+`convertToRoman(400)` should return the string `CD`
+
+```js
+assert.deepEqual(convertToRoman(400), 'CD');
+```
+
+`convertToRoman(500)` should return the string `D`
+
+```js
+assert.deepEqual(convertToRoman(500), 'D');
+```
+
+`convertToRoman(501)` should return the string `DI`
+
+```js
+assert.deepEqual(convertToRoman(501), 'DI');
+```
+
+`convertToRoman(649)` should return the string `DCXLIX`
+
+```js
+assert.deepEqual(convertToRoman(649), 'DCXLIX');
+```
+
+`convertToRoman(798)` should return the string `DCCXCVIII`
+
+```js
+assert.deepEqual(convertToRoman(798), 'DCCXCVIII');
+```
+
+`convertToRoman(891)` should return the string `DCCCXCI`
+
+```js
+assert.deepEqual(convertToRoman(891), 'DCCCXCI');
+```
+
+`convertToRoman(1000)` should return the string `M`
+
+```js
+assert.deepEqual(convertToRoman(1000), 'M');
+```
+
+`convertToRoman(1004)` should return the string `MIV`
+
+```js
+assert.deepEqual(convertToRoman(1004), 'MIV');
+```
+
+`convertToRoman(1006)` should return the string `MVI`
+
+```js
+assert.deepEqual(convertToRoman(1006), 'MVI');
+```
+
+`convertToRoman(1023)` should return the string `MXXIII`
+
+```js
+assert.deepEqual(convertToRoman(1023), 'MXXIII');
+```
+
+`convertToRoman(2014)` should return the string `MMXIV`
+
+```js
+assert.deepEqual(convertToRoman(2014), 'MMXIV');
+```
+
+`convertToRoman(3999)` should return the string `MMMCMXCIX`
+
+```js
+assert.deepEqual(convertToRoman(3999), 'MMMCMXCIX');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertToRoman(num) {
+ return num;
+}
+
+convertToRoman(36);
+```
+
+# --solutions--
+
+```js
+function convertToRoman(num) {
+  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]];
+  var res = [];
+  ref.forEach(function(p) {
+    while (num >= p[1]) {
+      res.push(p[0]);
+      num -= p[1];
+    }
+  });
+  return res.join('');
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md
new file mode 100644
index 0000000000..32b65ff902
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator.md
@@ -0,0 +1,211 @@
+---
+id: aff0395860f5d3034dc0bfc9
+title: Telephone Number Validator
+challengeType: 5
+forumTopicId: 16090
+dashedName: telephone-number-validator
+---
+
+# --description--
+
+Return `true` 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<br>(555)555-5555<br>(555) 555-5555<br>555 555 5555<br>5555555555<br>1 555 555 5555</blockquote>
+
+For this challenge you will be presented with a string such as `800-692-7753` or `8oo-six427676;laskdjf`. Your job is to validate or reject the US phone number based on any combination of the formats provided above. The area code is required. If the country code is provided, you must confirm that the country code is `1`. Return `true` if the string is a valid US phone number; otherwise return `false`.
+
+# --hints--
+
+`telephoneCheck("555-555-5555")` should return a boolean.
+
+```js
+assert(typeof telephoneCheck('555-555-5555') === 'boolean');
+```
+
+`telephoneCheck("1 555-555-5555")` should return `true`.
+
+```js
+assert(telephoneCheck('1 555-555-5555') === true);
+```
+
+`telephoneCheck("1 (555) 555-5555")` should return `true`.
+
+```js
+assert(telephoneCheck('1 (555) 555-5555') === true);
+```
+
+`telephoneCheck("5555555555")` should return `true`.
+
+```js
+assert(telephoneCheck('5555555555') === true);
+```
+
+`telephoneCheck("555-555-5555")` should return `true`.
+
+```js
+assert(telephoneCheck('555-555-5555') === true);
+```
+
+`telephoneCheck("(555)555-5555")` should return `true`.
+
+```js
+assert(telephoneCheck('(555)555-5555') === true);
+```
+
+`telephoneCheck("1(555)555-5555")` should return `true`.
+
+```js
+assert(telephoneCheck('1(555)555-5555') === true);
+```
+
+`telephoneCheck("555-5555")` should return `false`.
+
+```js
+assert(telephoneCheck('555-5555') === false);
+```
+
+`telephoneCheck("5555555")` should return `false`.
+
+```js
+assert(telephoneCheck('5555555') === false);
+```
+
+`telephoneCheck("1 555)555-5555")` should return `false`.
+
+```js
+assert(telephoneCheck('1 555)555-5555') === false);
+```
+
+`telephoneCheck("1 555 555 5555")` should return `true`.
+
+```js
+assert(telephoneCheck('1 555 555 5555') === true);
+```
+
+`telephoneCheck("1 456 789 4444")` should return `true`.
+
+```js
+assert(telephoneCheck('1 456 789 4444') === true);
+```
+
+`telephoneCheck("123**&!!asdf#")` should return `false`.
+
+```js
+assert(telephoneCheck('123**&!!asdf#') === false);
+```
+
+`telephoneCheck("55555555")` should return `false`.
+
+```js
+assert(telephoneCheck('55555555') === false);
+```
+
+`telephoneCheck("(6054756961)")` should return `false`.
+
+```js
+assert(telephoneCheck('(6054756961)') === false);
+```
+
+`telephoneCheck("2 (757) 622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('2 (757) 622-7382') === false);
+```
+
+`telephoneCheck("0 (757) 622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('0 (757) 622-7382') === false);
+```
+
+`telephoneCheck("-1 (757) 622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('-1 (757) 622-7382') === false);
+```
+
+`telephoneCheck("2 757 622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('2 757 622-7382') === false);
+```
+
+`telephoneCheck("10 (757) 622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('10 (757) 622-7382') === false);
+```
+
+`telephoneCheck("27576227382")` should return `false`.
+
+```js
+assert(telephoneCheck('27576227382') === false);
+```
+
+`telephoneCheck("(275)76227382")` should return `false`.
+
+```js
+assert(telephoneCheck('(275)76227382') === false);
+```
+
+`telephoneCheck("2(757)6227382")` should return `false`.
+
+```js
+assert(telephoneCheck('2(757)6227382') === false);
+```
+
+`telephoneCheck("2(757)622-7382")` should return `false`.
+
+```js
+assert(telephoneCheck('2(757)622-7382') === false);
+```
+
+`telephoneCheck("555)-555-5555")` should return `false`.
+
+```js
+assert(telephoneCheck('555)-555-5555') === false);
+```
+
+`telephoneCheck("(555-555-5555")` should return `false`.
+
+```js
+assert(telephoneCheck('(555-555-5555') === false);
+```
+
+`telephoneCheck("(555)5(55?)-5555")` should return `false`.
+
+```js
+assert(telephoneCheck('(555)5(55?)-5555') === false);
+```
+
+`telephoneCheck("55 55-55-555-5")` should return `false`.
+
+```js
+assert(telephoneCheck('55 55-55-555-5') === false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function telephoneCheck(str) {
+  return true;
+}
+
+telephoneCheck("555-555-5555");
+```
+
+# --solutions--
+
+```js
+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}$/;
+
+function telephoneCheck(str) {
+  return re.test(str);
+}
+
+telephoneCheck("555-555-5555");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
new file mode 100644
index 0000000000..33a5ab2895
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/add-methods-after-inheritance.md
@@ -0,0 +1,133 @@
+---
+id: 587d7db1367417b2b2512b87
+title: Add Methods After Inheritance
+challengeType: 1
+forumTopicId: 301315
+dashedName: add-methods-after-inheritance
+---
+
+# --description--
+
+A constructor function that inherits its `prototype` object from a supertype constructor function can still have its own methods in addition to inherited methods.
+
+For example, `Bird` is a constructor that inherits its `prototype` from `Animal`:
+
+```js
+function Animal() { }
+Animal.prototype.eat = function() {
+  console.log("nom nom nom");
+};
+function Bird() { }
+Bird.prototype = Object.create(Animal.prototype);
+Bird.prototype.constructor = Bird;
+```
+
+In addition to what is inherited from `Animal`, you want to add behavior that is unique to `Bird` objects. Here, `Bird` will get a `fly()` function. Functions are added to `Bird's` `prototype` the same way as any constructor function:
+
+```js
+Bird.prototype.fly = function() {
+  console.log("I'm flying!");
+};
+```
+
+Now instances of `Bird` will have both `eat()` and `fly()` methods:
+
+```js
+let duck = new Bird();
+duck.eat();
+duck.fly();
+```
+
+`duck.eat()` would display the string `nom nom nom` in the console, and `duck.fly()` would display the string `I'm flying!`.
+
+# --instructions--
+
+Add all necessary code so the `Dog` object inherits from `Animal` and the `Dog`'s `prototype` constructor is set to `Dog`. Then add a `bark()` method to the `Dog` object so that `beagle` can both `eat()` and `bark()`. The `bark()` method should print `Woof!` to the console.
+
+# --hints--
+
+`Animal` should not respond to the `bark()` method.
+
+```js
+assert(typeof Animal.prototype.bark == 'undefined');
+```
+
+`Dog` should inherit the `eat()` method from `Animal`.
+
+```js
+assert(typeof Dog.prototype.eat == 'function');
+```
+
+The `Dog` prototype should have a `bark()` method.
+
+```js
+assert('bark' in Dog.prototype);
+```
+
+`beagle` should be an `instanceof` `Animal`.
+
+```js
+assert(beagle instanceof Animal);
+```
+
+The constructor for `beagle` should be set to `Dog`.
+
+```js
+assert(beagle.constructor === Dog);
+```
+
+`beagle.eat()` should log the string `nom nom nom`
+
+```js
+console.log = function (msg) {
+  throw msg;
+};
+assert.throws(() => beagle.eat(), 'nom nom nom');
+```
+
+`beagle.bark()` should log the string `Woof!`
+
+```js
+console.log = function (msg) {
+  throw msg;
+};
+assert.throws(() => beagle.bark(), 'Woof!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Animal() { }
+Animal.prototype.eat = function() { console.log("nom nom nom"); };
+
+function Dog() { }
+
+// Only change code below this line
+
+
+
+
+// Only change code above this line
+
+let beagle = new Dog();
+```
+
+# --solutions--
+
+```js
+function Animal() { }
+Animal.prototype.eat = function() { console.log("nom nom nom"); };
+
+function Dog() { }
+Dog.prototype = Object.create(Animal.prototype);
+Dog.prototype.constructor = Dog;
+Dog.prototype.bark = function () {
+  console.log('Woof!');
+};
+let beagle = new Dog();
+
+beagle.eat();
+beagle.bark();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/change-the-prototype-to-a-new-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/change-the-prototype-to-a-new-object.md
new file mode 100644
index 0000000000..5313994f24
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/change-the-prototype-to-a-new-object.md
@@ -0,0 +1,103 @@
+---
+id: 587d7daf367417b2b2512b7f
+title: Change the Prototype to a New Object
+challengeType: 1
+forumTopicId: 301316
+dashedName: change-the-prototype-to-a-new-object
+---
+
+# --description--
+
+Up until now you have been adding properties to the `prototype` individually:
+
+```js
+Bird.prototype.numLegs = 2;
+```
+
+This becomes tedious after more than a few properties.
+
+```js
+Bird.prototype.eat = function() {
+  console.log("nom nom nom");
+}
+
+Bird.prototype.describe = function() {
+  console.log("My name is " + this.name);
+}
+```
+
+A more efficient way is to set the `prototype` to a new object that already contains the properties. This way, the properties are added all at once:
+
+```js
+Bird.prototype = {
+  numLegs: 2, 
+  eat: function() {
+    console.log("nom nom nom");
+  },
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+```
+
+# --instructions--
+
+Add the property `numLegs` and the two methods `eat()` and `describe()` to the `prototype` of `Dog` by setting the `prototype` to a new object.
+
+# --hints--
+
+`Dog.prototype` should be set to a new object.
+
+```js
+assert(/Dog\.prototype\s*?=\s*?{/.test(code));
+```
+
+`Dog.prototype` should have the property `numLegs`.
+
+```js
+assert(Dog.prototype.numLegs !== undefined);
+```
+
+`Dog.prototype` should have the method `eat()`.
+
+```js
+assert(typeof Dog.prototype.eat === 'function');
+```
+
+`Dog.prototype` should have the method `describe()`.
+
+```js
+assert(typeof Dog.prototype.describe === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+Dog.prototype = {
+  // Only change code below this line
+
+};
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+Dog.prototype = {
+numLegs: 4,
+  eat () {
+    console.log('nom nom nom');
+  },
+  describe () {
+    console.log('My name is ' + this.name);
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-basic-javascript-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-basic-javascript-object.md
new file mode 100644
index 0000000000..c58ecb52ce
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-basic-javascript-object.md
@@ -0,0 +1,69 @@
+---
+id: 587d7dac367417b2b2512b73
+title: Create a Basic JavaScript Object
+challengeType: 1
+forumTopicId: 301317
+dashedName: create-a-basic-javascript-object
+---
+
+# --description--
+
+Think about things people see every day, like cars, shops, and birds. These are all <dfn>objects</dfn>: tangible things people can observe and interact with.
+
+What are some qualities of these objects? A car has wheels. Shops sell items. Birds have wings.
+
+These qualities, or <dfn>properties</dfn>, define what makes up an object. Note that similar objects share the same properties, but may have different values for those properties. For example, all cars have wheels, but not all cars have the same number of wheels.
+
+Objects in JavaScript are used to model real-world objects, giving them properties and behavior just like their real-world counterparts. Here's an example using these concepts to create a `duck` object:
+
+```js
+let duck = {
+  name: "Aflac",
+  numLegs: 2
+};
+```
+
+This `duck` object has two property/value pairs: a `name` of `Aflac` and a `numLegs` of 2.
+
+# --instructions--
+
+Create a `dog` object with `name` and `numLegs` properties, and set them to a string and a number, respectively.
+
+# --hints--
+
+`dog` should be an object.
+
+```js
+assert(typeof dog === 'object');
+```
+
+`dog` should have a `name` property set to a string.
+
+```js
+assert(typeof dog.name === 'string');
+```
+
+`dog` should have a `numLegs` property set to a number.
+
+```js
+assert(typeof dog.numLegs === 'number');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let dog = {
+
+};
+```
+
+# --solutions--
+
+```js
+let dog = {
+  name: '',
+  numLegs: 4
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-method-on-an-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-method-on-an-object.md
new file mode 100644
index 0000000000..38b5cdb233
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/create-a-method-on-an-object.md
@@ -0,0 +1,70 @@
+---
+id: 587d7dad367417b2b2512b75
+title: Create a Method on an Object
+challengeType: 1
+forumTopicId: 301318
+dashedName: create-a-method-on-an-object
+---
+
+# --description--
+
+Objects can have a special type of property, called a <dfn>method</dfn>.
+
+Methods are properties that are functions. This adds different behavior to an object. Here is the `duck` example with a method:
+
+```js
+let duck = {
+  name: "Aflac",
+  numLegs: 2,
+  sayName: function() {return "The name of this duck is " + duck.name + ".";}
+};
+duck.sayName();
+```
+
+The example adds the `sayName` method, which is a function that returns a sentence giving the name of the `duck`. Notice that the method accessed the `name` property in the return statement using `duck.name`. The next challenge will cover another way to do this.
+
+# --instructions--
+
+Using the `dog` object, give it a method called `sayLegs`. The method should return the sentence `This dog has 4 legs.`
+
+# --hints--
+
+`dog.sayLegs()` should be a function.
+
+```js
+assert(typeof dog.sayLegs === 'function');
+```
+
+`dog.sayLegs()` should return the given string - note that punctuation and spacing matter.
+
+```js
+assert(dog.sayLegs() === 'This dog has 4 legs.');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4,
+
+};
+
+dog.sayLegs();
+```
+
+# --solutions--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4,
+  sayLegs () {
+    return 'This dog has ' + this.numLegs + ' legs.';
+  }
+};
+
+dog.sayLegs();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/define-a-constructor-function.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/define-a-constructor-function.md
new file mode 100644
index 0000000000..91e7d84cd1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/define-a-constructor-function.md
@@ -0,0 +1,67 @@
+---
+id: 587d7dad367417b2b2512b77
+title: Define a Constructor Function
+challengeType: 1
+forumTopicId: 16804
+dashedName: define-a-constructor-function
+---
+
+# --description--
+
+<dfn>Constructors</dfn> 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 constructor:
+
+```js
+function Bird() {
+  this.name = "Albert";
+  this.color = "blue";
+  this.numLegs = 2;
+}
+```
+
+This constructor defines a `Bird` object with properties `name`, `color`, and `numLegs` set to Albert, blue, and 2, respectively. Constructors follow a few conventions:
+
+<ul><li>Constructors are defined with a capitalized name to distinguish them from other functions that are not <code>constructors</code>.</li><li>Constructors use the keyword <code>this</code> to set properties of the object they will create. Inside the constructor, <code>this</code> refers to the new object it will create.</li><li>Constructors define properties and behaviors instead of returning a value as other functions might.</li></ul>
+
+# --instructions--
+
+Create a constructor, `Dog`, with properties `name`, `color`, and `numLegs` that are set to a string, a string, and a number, respectively.
+
+# --hints--
+
+`Dog` should have a `name` property set to a string.
+
+```js
+assert(typeof new Dog().name === 'string');
+```
+
+`Dog` should have a `color` property set to a string.
+
+```js
+assert(typeof new Dog().color === 'string');
+```
+
+`Dog` should have a `numLegs` property set to a number.
+
+```js
+assert(typeof new Dog().numLegs === 'number');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+function Dog (name, color, numLegs) {
+  this.name = 'name';
+  this.color = 'color';
+  this.numLegs = 4;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/extend-constructors-to-receive-arguments.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/extend-constructors-to-receive-arguments.md
new file mode 100644
index 0000000000..5f803b1d61
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/extend-constructors-to-receive-arguments.md
@@ -0,0 +1,89 @@
+---
+id: 587d7dae367417b2b2512b79
+title: Extend Constructors to Receive Arguments
+challengeType: 1
+forumTopicId: 18235
+dashedName: extend-constructors-to-receive-arguments
+---
+
+# --description--
+
+The `Bird` and `Dog` constructors from the last challenge worked well. However, notice that all `Birds` that are created with the `Bird` 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:
+
+```js
+let swan = new Bird();
+swan.name = "Carlos";
+swan.color = "white";
+```
+
+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 `Bird` objects, you can design your Bird constructor to accept parameters:
+
+```js
+function Bird(name, color) {
+  this.name = name;
+  this.color = color;
+  this.numLegs = 2;
+}
+```
+
+Then pass in the values as arguments to define each unique bird into the `Bird` constructor: `let cardinal = new Bird("Bruce", "red");` This gives a new instance of `Bird` with `name` and `color` properties set to `Bruce` and `red`, respectively. The `numLegs` property is still set to 2. The `cardinal` has these properties:
+
+```js
+cardinal.name
+cardinal.color
+cardinal.numLegs
+```
+
+The constructor is more flexible. It's now possible to define the properties for each `Bird` 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.
+
+# --instructions--
+
+Create another `Dog` constructor. This time, set it up to take the parameters `name` and `color`, and have the property `numLegs` fixed at 4. Then create a new `Dog` saved in a variable `terrier`. Pass it two strings as arguments for the `name` and `color` properties.
+
+# --hints--
+
+`Dog` should receive an argument for `name`.
+
+```js
+assert(new Dog('Clifford').name === 'Clifford');
+```
+
+`Dog` should receive an argument for `color`.
+
+```js
+assert(new Dog('Clifford', 'yellow').color === 'yellow');
+```
+
+`Dog` should have property `numLegs` set to 4.
+
+```js
+assert(new Dog('Clifford').numLegs === 4);
+```
+
+`terrier` should be created using the `Dog` constructor.
+
+```js
+assert(terrier instanceof Dog);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog() {
+
+}
+```
+
+# --solutions--
+
+```js
+function Dog (name, color) {
+  this.numLegs = 4;
+  this.name = name;
+  this.color = color;
+}
+
+const terrier = new Dog();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/inherit-behaviors-from-a-supertype.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/inherit-behaviors-from-a-supertype.md
new file mode 100644
index 0000000000..27fa9f57b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/inherit-behaviors-from-a-supertype.md
@@ -0,0 +1,127 @@
+---
+id: 587d7db0367417b2b2512b84
+title: Inherit Behaviors from a Supertype
+challengeType: 1
+forumTopicId: 301319
+dashedName: inherit-behaviors-from-a-supertype
+---
+
+# --description--
+
+In the previous challenge, you created a `supertype` called `Animal` that defined behaviors shared by all animals:
+
+```js
+function Animal() { }
+Animal.prototype.eat = function() {
+  console.log("nom nom nom");
+};
+```
+
+This and the next challenge will cover how to reuse the methods of `Animal` inside `Bird` and `Dog` without defining them again. It uses a technique called inheritance. This challenge covers the first step: make an instance of the `supertype` (or parent). You already know one way to create an instance of `Animal` using the `new` operator:
+
+```js
+let animal = new Animal();
+```
+
+There are some disadvantages when using this syntax for inheritance, which are too complex for the scope of this challenge. Instead, here's an alternative approach without those disadvantages:
+
+```js
+let animal = Object.create(Animal.prototype);
+```
+
+`Object.create(obj)` creates a new object, and sets `obj` as the new object's `prototype`. Recall that the `prototype` is like the "recipe" for creating an object. By setting the `prototype` of `animal` to be the `prototype` of `Animal`, you are effectively giving the `animal` instance the same "recipe" as any other instance of `Animal`.
+
+```js
+animal.eat();
+animal instanceof Animal;
+```
+
+The `instanceof` method here would return `true`.
+
+# --instructions--
+
+Use `Object.create` to make two instances of `Animal` named `duck` and `beagle`.
+
+# --hints--
+
+The `duck` variable should be defined.
+
+```js
+assert(typeof duck !== 'undefined');
+```
+
+The `beagle` variable should be defined.
+
+```js
+assert(typeof beagle !== 'undefined');
+```
+
+The `duck` variable should be initialised with `Object.create`.
+
+```js
+assert(
+  /(let|const|var)\s{1,}duck\s*=\s*Object\.create\s*\(\s*Animal\.prototype\s*\)\s*/.test(
+    code
+  )
+);
+```
+
+The `beagle` variable should be initialised with `Object.create`.
+
+```js
+assert(
+  /(let|const|var)\s{1,}beagle\s*=\s*Object\.create\s*\(\s*Animal\.prototype\s*\)\s*/.test(
+    code
+  )
+);
+```
+
+`duck` should have a `prototype` of `Animal`.
+
+```js
+assert(duck instanceof Animal);
+```
+
+`beagle` should have a `prototype` of `Animal`.
+
+```js
+assert(beagle instanceof Animal);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Animal() { }
+
+Animal.prototype = {
+  constructor: Animal,
+  eat: function() {
+    console.log("nom nom nom");
+  }
+};
+
+// Only change code below this line
+
+let duck; // Change this line
+let beagle; // Change this line
+```
+
+# --solutions--
+
+```js
+function Animal() { }
+
+Animal.prototype = {
+  constructor: Animal,
+  eat: function() {
+    console.log("nom nom nom");
+  }
+};
+let duck = Object.create(Animal.prototype);
+let beagle = Object.create(Animal.prototype);
+
+duck.eat();
+beagle.eat();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/iterate-over-all-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/iterate-over-all-properties.md
new file mode 100644
index 0000000000..a30165e632
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/iterate-over-all-properties.md
@@ -0,0 +1,106 @@
+---
+id: 587d7daf367417b2b2512b7d
+title: Iterate Over All Properties
+challengeType: 1
+forumTopicId: 301320
+dashedName: iterate-over-all-properties
+---
+
+# --description--
+
+You have now seen two kinds of properties: <dfn>own properties</dfn> and `prototype` properties. Own properties are defined directly on the object instance itself. And `prototype` properties are defined on the `prototype`.
+
+```js
+function Bird(name) {
+  this.name = name;  //own property
+}
+
+Bird.prototype.numLegs = 2; // prototype property
+
+let duck = new Bird("Donald");
+```
+
+Here is how you add `duck`'s own properties to the array `ownProps` and `prototype` properties to the array `prototypeProps`:
+
+```js
+let ownProps = [];
+let prototypeProps = [];
+
+for (let property in duck) {
+  if(duck.hasOwnProperty(property)) {
+    ownProps.push(property);
+  } else {
+    prototypeProps.push(property);
+  }
+}
+
+console.log(ownProps);
+console.log(prototypeProps);
+```
+
+`console.log(ownProps)` would display `["name"]` in the console, and `console.log(prototypeProps)` would display `["numLegs"]`.
+
+# --instructions--
+
+Add all of the own properties of `beagle` to the array `ownProps`. Add all of the `prototype` properties of `Dog` to the array `prototypeProps`.
+
+# --hints--
+
+The `ownProps` array should only contain `name`.
+
+```js
+assert.deepEqual(ownProps, ['name']);
+```
+
+The `prototypeProps` array should only contain `numLegs`.
+
+```js
+assert.deepEqual(prototypeProps, ['numLegs']);
+```
+
+You should solve this challenge without using the built in method `Object.keys()`.
+
+```js
+assert(!/\Object.keys/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+Dog.prototype.numLegs = 4;
+
+let beagle = new Dog("Snoopy");
+
+let ownProps = [];
+let prototypeProps = [];
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+Dog.prototype.numLegs = 4;
+
+let beagle = new Dog("Snoopy");
+
+let ownProps = [];
+let prototypeProps = [];
+for (let prop in beagle) {
+  if (beagle.hasOwnProperty(prop)) {
+    ownProps.push(prop);
+  } else {
+    prototypeProps.push(prop);
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/make-code-more-reusable-with-the-this-keyword.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/make-code-more-reusable-with-the-this-keyword.md
new file mode 100644
index 0000000000..b0c80c8ee4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/make-code-more-reusable-with-the-this-keyword.md
@@ -0,0 +1,75 @@
+---
+id: 587d7dad367417b2b2512b76
+title: Make Code More Reusable with the this Keyword
+challengeType: 1
+forumTopicId: 301321
+dashedName: make-code-more-reusable-with-the-this-keyword
+---
+
+# --description--
+
+The last challenge introduced a method to the `duck` object. It used `duck.name` dot notation to access the value for the `name` property within the return statement:
+
+```js
+sayName: function() {return "The name of this duck is " + duck.name + ".";}
+```
+
+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 `this` keyword:
+
+```js
+let duck = {
+  name: "Aflac",
+  numLegs: 2,
+  sayName: function() {return "The name of this duck is " + this.name + ".";}
+};
+```
+
+`this` is a deep topic, and the above example is only one way to use it. In the current context, `this` refers to the object that the method is associated with: `duck`. If the object's name is changed to `mallard`, it is not necessary to find all the references to `duck` in the code. It makes the code reusable and easier to read.
+
+# --instructions--
+
+Modify the `dog.sayLegs` method to remove any references to `dog`. Use the `duck` example for guidance.
+
+# --hints--
+
+`dog.sayLegs()` should return the given string.
+
+```js
+assert(dog.sayLegs() === 'This dog has 4 legs.');
+```
+
+Your code should use the `this` keyword to access the `numLegs` property of `dog`.
+
+```js
+assert(code.match(/this\.numLegs/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4,
+  sayLegs: function() {return "This dog has " + dog.numLegs + " legs.";}
+};
+
+dog.sayLegs();
+```
+
+# --solutions--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4,
+  sayLegs () {
+    return 'This dog has ' + this.numLegs + ' legs.';
+  }
+};
+
+dog.sayLegs();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/override-inherited-methods.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/override-inherited-methods.md
new file mode 100644
index 0000000000..6a531a5730
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/override-inherited-methods.md
@@ -0,0 +1,100 @@
+---
+id: 587d7db1367417b2b2512b88
+title: Override Inherited Methods
+challengeType: 1
+forumTopicId: 301322
+dashedName: override-inherited-methods
+---
+
+# --description--
+
+In previous lessons, you learned that an object can inherit its behavior (methods) from another object by referencing its `prototype` object:
+
+```js
+ChildObject.prototype = Object.create(ParentObject.prototype);
+```
+
+Then the `ChildObject` received its own methods by chaining them onto its `prototype`:
+
+```js
+ChildObject.prototype.methodName = function() {...};
+```
+
+It's possible to override an inherited method. It's done the same way - by adding a method to `ChildObject.prototype` using the same method name as the one to override. Here's an example of `Bird` overriding the `eat()` method inherited from `Animal`:
+
+```js
+function Animal() { }
+Animal.prototype.eat = function() {
+  return "nom nom nom";
+};
+function Bird() { }
+
+Bird.prototype = Object.create(Animal.prototype);
+
+Bird.prototype.eat = function() {
+  return "peck peck peck";
+};
+```
+
+If you have an instance `let duck = new Bird();` and you call `duck.eat()`, this is how JavaScript looks for the method on the `prototype` chain of `duck`:
+
+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.
+
+# --instructions--
+
+Override the `fly()` method for `Penguin` so that it returns the string `Alas, this is a flightless bird.`
+
+# --hints--
+
+`penguin.fly()` should return the string `Alas, this is a flightless bird.`
+
+```js
+assert(penguin.fly() === 'Alas, this is a flightless bird.');
+```
+
+The `bird.fly()` method should return the string `I am flying!`
+
+```js
+assert(new Bird().fly() === 'I am flying!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Bird() { }
+
+Bird.prototype.fly = function() { return "I am flying!"; };
+
+function Penguin() { }
+Penguin.prototype = Object.create(Bird.prototype);
+Penguin.prototype.constructor = Penguin;
+
+// Only change code below this line
+
+
+
+// Only change code above this line
+
+let penguin = new Penguin();
+console.log(penguin.fly());
+```
+
+# --solutions--
+
+```js
+function Bird() { }
+
+Bird.prototype.fly = function() { return "I am flying!"; };
+
+function Penguin() { }
+Penguin.prototype = Object.create(Bird.prototype);
+Penguin.prototype.constructor = Penguin;
+Penguin.prototype.fly = () => 'Alas, this is a flightless bird.';
+let penguin = new Penguin();
+console.log(penguin.fly());
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/remember-to-set-the-constructor-property-when-changing-the-prototype.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/remember-to-set-the-constructor-property-when-changing-the-prototype.md
new file mode 100644
index 0000000000..cd44cdceb3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/remember-to-set-the-constructor-property-when-changing-the-prototype.md
@@ -0,0 +1,86 @@
+---
+id: 587d7daf367417b2b2512b80
+title: Remember to Set the Constructor Property when Changing the Prototype
+challengeType: 1
+forumTopicId: 301323
+dashedName: remember-to-set-the-constructor-property-when-changing-the-prototype
+---
+
+# --description--
+
+There is one crucial side effect of manually setting the prototype to a new object. It erases the `constructor` property! This property can be used to check which constructor function created the instance, but since the property has been overwritten, it now gives false results:
+
+```js
+duck.constructor === Bird;
+duck.constructor === Object;
+duck instanceof Bird;
+```
+
+In order, these expressions would evaluate to `false`, `true`, and `true`.
+
+To fix this, whenever a prototype is manually set to a new object, remember to define the `constructor` property:
+
+```js
+Bird.prototype = {
+  constructor: Bird,
+  numLegs: 2,
+  eat: function() {
+    console.log("nom nom nom");
+  },
+  describe: function() {
+    console.log("My name is " + this.name); 
+  }
+};
+```
+
+# --instructions--
+
+Define the `constructor` property on the `Dog` `prototype`.
+
+# --hints--
+
+`Dog.prototype` should set the `constructor` property.
+
+```js
+assert(Dog.prototype.constructor === Dog);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+// Only change code below this line
+Dog.prototype = {
+
+  numLegs: 4,
+  eat: function() {
+    console.log("nom nom nom");
+  },
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+Dog.prototype = {
+  constructor: Dog,
+  numLegs: 4,
+  eat: function() {
+    console.log("nom nom nom");
+  },
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/reset-an-inherited-constructor-property.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/reset-an-inherited-constructor-property.md
new file mode 100644
index 0000000000..093cc3e740
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/reset-an-inherited-constructor-property.md
@@ -0,0 +1,91 @@
+---
+id: 587d7db1367417b2b2512b86
+title: Reset an Inherited Constructor Property
+challengeType: 1
+forumTopicId: 301324
+dashedName: reset-an-inherited-constructor-property
+---
+
+# --description--
+
+When an object inherits its `prototype` from another object, it also inherits the supertype's constructor property.
+
+Here's an example:
+
+```js
+function Bird() { }
+Bird.prototype = Object.create(Animal.prototype);
+let duck = new Bird();
+duck.constructor
+```
+
+But `duck` and all instances of `Bird` should show that they were constructed by `Bird` and not `Animal`. To do so, you can manually set the constructor property of `Bird` to the `Bird` object:
+
+```js
+Bird.prototype.constructor = Bird;
+duck.constructor
+```
+
+# --instructions--
+
+Fix the code so `duck.constructor` and `beagle.constructor` return their respective constructors.
+
+# --hints--
+
+`Bird.prototype` should be an instance of `Animal`.
+
+```js
+assert(Animal.prototype.isPrototypeOf(Bird.prototype));
+```
+
+`duck.constructor` should return `Bird`.
+
+```js
+assert(duck.constructor === Bird);
+```
+
+`Dog.prototype` should be an instance of `Animal`.
+
+```js
+assert(Animal.prototype.isPrototypeOf(Dog.prototype));
+```
+
+`beagle.constructor` should return `Dog`.
+
+```js
+assert(beagle.constructor === Dog);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Animal() { }
+function Bird() { }
+function Dog() { }
+
+Bird.prototype = Object.create(Animal.prototype);
+Dog.prototype = Object.create(Animal.prototype);
+
+// Only change code below this line
+
+
+
+let duck = new Bird();
+let beagle = new Dog();
+```
+
+# --solutions--
+
+```js
+function Animal() { }
+function Bird() { }
+function Dog() { }
+Bird.prototype = Object.create(Animal.prototype);
+Dog.prototype = Object.create(Animal.prototype);
+Dog.prototype.constructor = Dog;
+Bird.prototype.constructor = Bird;
+let duck = new Bird();
+let beagle = new Dog();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/set-the-childs-prototype-to-an-instance-of-the-parent.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/set-the-childs-prototype-to-an-instance-of-the-parent.md
new file mode 100644
index 0000000000..16bdccd2e3
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/set-the-childs-prototype-to-an-instance-of-the-parent.md
@@ -0,0 +1,79 @@
+---
+id: 587d7db1367417b2b2512b85
+title: Set the Child's Prototype to an Instance of the Parent
+challengeType: 1
+forumTopicId: 301325
+dashedName: set-the-childs-prototype-to-an-instance-of-the-parent
+---
+
+# --description--
+
+In the previous challenge you saw the first step for inheriting behavior from the supertype (or parent) `Animal`: making a new instance of `Animal`.
+
+This challenge covers the next step: set the `prototype` of the subtype (or child)—in this case, `Bird`—to be an instance of `Animal`.
+
+```js
+Bird.prototype = Object.create(Animal.prototype);
+```
+
+Remember that the `prototype` is like the "recipe" for creating an object. In a way, the recipe for `Bird` now includes all the key "ingredients" from `Animal`.
+
+```js
+let duck = new Bird("Donald");
+duck.eat();
+```
+
+`duck` inherits all of `Animal`'s properties, including the `eat` method.
+
+# --instructions--
+
+Modify the code so that instances of `Dog` inherit from `Animal`.
+
+# --hints--
+
+`Dog.prototype` should be an instance of `Animal`.
+
+```js
+assert(Animal.prototype.isPrototypeOf(Dog.prototype));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Animal() { }
+
+Animal.prototype = {
+  constructor: Animal,
+  eat: function() {
+    console.log("nom nom nom");
+  }
+};
+
+function Dog() { }
+
+// Only change code below this line
+
+
+let beagle = new Dog();
+```
+
+# --solutions--
+
+```js
+function Animal() { }
+
+Animal.prototype = {
+  constructor: Animal,
+  eat: function() {
+    console.log("nom nom nom");
+  }
+};
+
+function Dog() { }
+Dog.prototype = Object.create(Animal.prototype);
+
+let beagle = new Dog();
+beagle.eat();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-own-properties.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-own-properties.md
new file mode 100644
index 0000000000..b9d96a71ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-own-properties.md
@@ -0,0 +1,104 @@
+---
+id: 587d7dae367417b2b2512b7b
+title: Understand Own Properties
+challengeType: 1
+forumTopicId: 301326
+dashedName: understand-own-properties
+---
+
+# --description--
+
+In the following example, the `Bird` constructor defines two properties: `name` and `numLegs`:
+
+```js
+function Bird(name) {
+  this.name  = name;
+  this.numLegs = 2;
+}
+
+let duck = new Bird("Donald");
+let canary = new Bird("Tweety");
+```
+
+`name` and `numLegs` are called <dfn>own properties</dfn>, because they are defined directly on the instance object. That means that `duck` and `canary` each has its own separate copy of these properties. In fact every instance of `Bird` will have its own copy of these properties. The following code adds all of the own properties of `duck` to the array `ownProps`:
+
+```js
+let ownProps = [];
+
+for (let property in duck) {
+  if(duck.hasOwnProperty(property)) {
+    ownProps.push(property);
+  }
+}
+
+console.log(ownProps);
+```
+
+The console would display the value `["name", "numLegs"]`.
+
+# --instructions--
+
+Add the own properties of `canary` to the array `ownProps`.
+
+# --hints--
+
+`ownProps` should include the values `numLegs` and `name`.
+
+```js
+assert(ownProps.indexOf('name') !== -1 && ownProps.indexOf('numLegs') !== -1);
+```
+
+You should solve this challenge without using the built in method `Object.keys()`.
+
+```js
+assert(!/Object(\.keys|\[(['"`])keys\2\])/.test(code));
+```
+
+You should solve this challenge without hardcoding the `ownProps` array.
+
+```js
+assert(
+  !/\[\s*(?:'|")(?:name|numLegs)|(?:push|concat)\(\s*(?:'|")(?:name|numLegs)/.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Bird(name) {
+  this.name = name;
+  this.numLegs = 2;
+}
+
+let canary = new Bird("Tweety");
+let ownProps = [];
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+function Bird(name) {
+  this.name = name;
+  this.numLegs = 2;
+}
+
+let canary = new Bird("Tweety");
+function getOwnProps (obj) {
+  const props = [];
+
+  for (let prop in obj) {
+    if (obj.hasOwnProperty(prop)) {
+      props.push(prop);
+    }
+  }
+
+  return props;
+}
+
+const ownProps = getOwnProps(canary);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-constructor-property.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-constructor-property.md
new file mode 100644
index 0000000000..17b2bf8359
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-constructor-property.md
@@ -0,0 +1,85 @@
+---
+id: 587d7daf367417b2b2512b7e
+title: Understand the Constructor Property
+challengeType: 1
+forumTopicId: 301327
+dashedName: understand-the-constructor-property
+---
+
+# --description--
+
+There is a special `constructor` property located on the object instances `duck` and `beagle` that were created in the previous challenges:
+
+```js
+let duck = new Bird();
+let beagle = new Dog();
+
+console.log(duck.constructor === Bird); 
+console.log(beagle.constructor === Dog);
+```
+
+Both of these `console.log` calls would display `true` in the console.
+
+Note that the `constructor` property is a reference to the constructor function that created the instance. The advantage of the `constructor` 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:
+
+```js
+function joinBirdFraternity(candidate) {
+  if (candidate.constructor === Bird) {
+    return true;
+  } else {
+    return false;
+  }
+}
+```
+
+**Note:** Since the `constructor` property can be overwritten (which will be covered in the next two challenges) it’s generally better to use the `instanceof` method to check the type of an object.
+
+# --instructions--
+
+Write a `joinDogFraternity` function that takes a `candidate` parameter and, using the `constructor` property, return `true` if the candidate is a `Dog`, otherwise return `false`.
+
+# --hints--
+
+`joinDogFraternity` should be defined as a function.
+
+```js
+assert(typeof joinDogFraternity === 'function');
+```
+
+`joinDogFraternity` should return `true` if `candidate` is an instance of `Dog`.
+
+```js
+assert(joinDogFraternity(new Dog('')) === true);
+```
+
+`joinDogFraternity` should use the `constructor` property.
+
+```js
+assert(/\.constructor/.test(code) && !/instanceof/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+// Only change code below this line
+function joinDogFraternity(candidate) {
+
+}
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+function joinDogFraternity(candidate) {
+  return candidate.constructor === Dog;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-immediately-invoked-function-expression-iife.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-immediately-invoked-function-expression-iife.md
new file mode 100644
index 0000000000..67ebe4d0e7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-immediately-invoked-function-expression-iife.md
@@ -0,0 +1,83 @@
+---
+id: 587d7db2367417b2b2512b8b
+title: Understand the Immediately Invoked Function Expression (IIFE)
+challengeType: 1
+forumTopicId: 301328
+dashedName: understand-the-immediately-invoked-function-expression-iife
+---
+
+# --description--
+
+A common pattern in JavaScript is to execute a function as soon as it is declared:
+
+```js
+(function () {
+  console.log("Chirp, chirp!");
+})();
+```
+
+This is an anonymous function expression that executes right away, and outputs `Chirp, chirp!` immediately.
+
+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 <dfn>immediately invoked function expression</dfn> or <dfn>IIFE</dfn>.
+
+# --instructions--
+
+Rewrite the function `makeNest` and remove its call so instead it's an anonymous immediately invoked function expression (IIFE).
+
+# --hints--
+
+The function should be anonymous.
+
+```js
+assert(/\((function|\(\))(=>|\(\)){?/.test(code.replace(/\s/g, '')));
+```
+
+Your function should have parentheses at the end of the expression to call it immediately.
+
+```js
+assert(/\(.*(\)\(|\}\(\))\)/.test(code.replace(/[\s;]/g, '')));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function makeNest() {
+  console.log("A cozy nest is ready");
+}
+
+makeNest();
+```
+
+# --solutions--
+
+```js
+(function () {
+  console.log("A cozy nest is ready");
+})();
+```
+
+---
+
+```js
+(function () {
+  console.log("A cozy nest is ready");
+}());
+```
+
+---
+
+```js
+(() => {
+  console.log("A cozy nest is ready");
+})();
+```
+
+---
+
+```js
+(() =>
+  console.log("A cozy nest is ready")
+)();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-prototype-chain.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-prototype-chain.md
new file mode 100644
index 0000000000..1ee203a745
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-the-prototype-chain.md
@@ -0,0 +1,74 @@
+---
+id: 587d7db0367417b2b2512b82
+title: Understand the Prototype Chain
+challengeType: 1
+forumTopicId: 301329
+dashedName: understand-the-prototype-chain
+---
+
+# --description--
+
+All objects in JavaScript (with a few exceptions) have a `prototype`. Also, an object’s `prototype` itself is an object.
+
+```js
+function Bird(name) {
+  this.name = name;
+}
+
+typeof Bird.prototype;
+```
+
+Because a `prototype` is an object, a `prototype` can have its own `prototype`! In this case, the `prototype` of `Bird.prototype` is `Object.prototype`:
+
+```js
+Object.prototype.isPrototypeOf(Bird.prototype);
+```
+
+How is this useful? You may recall the `hasOwnProperty` method from a previous challenge:
+
+```js
+let duck = new Bird("Donald");
+duck.hasOwnProperty("name");
+```
+
+The `hasOwnProperty` method is defined in `Object.prototype`, which can be accessed by `Bird.prototype`, which can then be accessed by `duck`. This is an example of the `prototype` chain. In this `prototype` chain, `Bird` is the `supertype` for `duck`, while `duck` is the `subtype`. `Object` is a `supertype` for both `Bird` and `duck`. `Object` is a `supertype` for all objects in JavaScript. Therefore, any object can use the `hasOwnProperty` method.
+
+# --instructions--
+
+Modify the code to show the correct prototype chain.
+
+# --hints--
+
+Your code should show that `Object.prototype` is the prototype of `Dog.prototype`
+
+```js
+assert(/Object\.prototype\.isPrototypeOf/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+let beagle = new Dog("Snoopy");
+
+Dog.prototype.isPrototypeOf(beagle);  // yields true
+
+// Fix the code below so that it evaluates to true
+???.isPrototypeOf(Dog.prototype);
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+let beagle = new Dog("Snoopy");
+Dog.prototype.isPrototypeOf(beagle);
+Object.prototype.isPrototypeOf(Dog.prototype);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-where-an-objects-prototype-comes-from.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-where-an-objects-prototype-comes-from.md
new file mode 100644
index 0000000000..ce7ed680ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/understand-where-an-objects-prototype-comes-from.md
@@ -0,0 +1,63 @@
+---
+id: 587d7db0367417b2b2512b81
+title: Understand Where an Object’s Prototype Comes From
+challengeType: 1
+forumTopicId: 301330
+dashedName: understand-where-an-objects-prototype-comes-from
+---
+
+# --description--
+
+Just like people inherit genes from their parents, an object inherits its `prototype` directly from the constructor function that created it. For example, here the `Bird` constructor creates the `duck` object:
+
+```js
+function Bird(name) {
+  this.name = name;
+}
+
+let duck = new Bird("Donald");
+```
+
+`duck` inherits its `prototype` from the `Bird` constructor function. You can show this relationship with the `isPrototypeOf` method:
+
+```js
+Bird.prototype.isPrototypeOf(duck);
+```
+
+This would return `true`.
+
+# --instructions--
+
+Use `isPrototypeOf` to check the `prototype` of `beagle`.
+
+# --hints--
+
+You should show that `Dog.prototype` is the `prototype` of `beagle`
+
+```js
+assert(/Dog\.prototype\.isPrototypeOf\(beagle\)/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+let beagle = new Dog("Snoopy");
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+let beagle = new Dog("Snoopy");
+Dog.prototype.isPrototypeOf(beagle);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-constructor-to-create-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-constructor-to-create-objects.md
new file mode 100644
index 0000000000..122fcb9a59
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-constructor-to-create-objects.md
@@ -0,0 +1,80 @@
+---
+id: 587d7dad367417b2b2512b78
+title: Use a Constructor to Create Objects
+challengeType: 1
+forumTopicId: 18233
+dashedName: use-a-constructor-to-create-objects
+---
+
+# --description--
+
+Here's the `Bird` constructor from the previous challenge:
+
+```js
+function Bird() {
+  this.name = "Albert";
+  this.color  = "blue";
+  this.numLegs = 2;
+}
+
+let blueBird = new Bird();
+```
+
+**NOTE:** `this` inside the constructor always refers to the object being created.
+
+Notice that the `new` operator is used when calling a constructor. This tells JavaScript to create a new instance of `Bird` called `blueBird`. Without the `new` operator, `this` inside the constructor would not point to the newly created object, giving unexpected results. Now `blueBird` has all the properties defined inside the `Bird` constructor:
+
+```js
+blueBird.name;
+blueBird.color;
+blueBird.numLegs;
+```
+
+Just like any other object, its properties can be accessed and modified:
+
+```js
+blueBird.name = 'Elvira';
+blueBird.name;
+```
+
+# --instructions--
+
+Use the `Dog` constructor from the last lesson to create a new instance of `Dog`, assigning it to a variable `hound`.
+
+# --hints--
+
+`hound` should be created using the `Dog` constructor.
+
+```js
+assert(hound instanceof Dog);
+```
+
+Your code should use the `new` operator to create an instance of `Dog`.
+
+```js
+assert(code.match(/new/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog() {
+  this.name = "Rupert";
+  this.color = "brown";
+  this.numLegs = 4;
+}
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+function Dog() {
+  this.name = "Rupert";
+  this.color = "brown";
+  this.numLegs = 4;
+}
+const hound = new Dog();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-mixin-to-add-common-behavior-between-unrelated-objects.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-mixin-to-add-common-behavior-between-unrelated-objects.md
new file mode 100644
index 0000000000..d4d627fbc8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-a-mixin-to-add-common-behavior-between-unrelated-objects.md
@@ -0,0 +1,111 @@
+---
+id: 587d7db2367417b2b2512b89
+title: Use a Mixin to Add Common Behavior Between Unrelated Objects
+challengeType: 1
+forumTopicId: 301331
+dashedName: 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 `Bird` and `Airplane`. They can both fly, but a `Bird` is not a type of `Airplane` and vice versa.
+
+For unrelated objects, it's better to use <dfn>mixins</dfn>. A mixin allows other objects to use a collection of functions.
+
+```js
+let flyMixin = function(obj) {
+  obj.fly = function() {
+    console.log("Flying, wooosh!");
+  }
+};
+```
+
+The `flyMixin` takes any object and gives it the `fly` method.
+
+```js
+let bird = {
+  name: "Donald",
+  numLegs: 2
+};
+
+let plane = {
+  model: "777",
+  numPassengers: 524
+};
+
+flyMixin(bird);
+flyMixin(plane);
+```
+
+Here `bird` and `plane` are passed into `flyMixin`, which then assigns the `fly` function to each object. Now `bird` and `plane` can both fly:
+
+```js
+bird.fly();
+plane.fly();
+```
+
+The console would display the string `Flying, wooosh!` twice, once for each `.fly()` call.
+
+Note how the mixin allows for the same `fly` method to be reused by unrelated objects `bird` and `plane`.
+
+# --instructions--
+
+Create a mixin named `glideMixin` that defines a method named `glide`. Then use the `glideMixin` to give both `bird` and `boat` the ability to glide.
+
+# --hints--
+
+Your code should declare a `glideMixin` variable that is a function.
+
+```js
+assert(typeof glideMixin === 'function');
+```
+
+Your code should use the `glideMixin` on the `bird` object to give it the `glide` method.
+
+```js
+assert(typeof bird.glide === 'function');
+```
+
+Your code should use the `glideMixin` on the `boat` object to give it the `glide` method.
+
+```js
+assert(typeof boat.glide === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let bird = {
+  name: "Donald",
+  numLegs: 2
+};
+
+let boat = {
+  name: "Warrior",
+  type: "race-boat"
+};
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+let bird = {
+  name: "Donald",
+  numLegs: 2
+};
+
+let boat = {
+  name: "Warrior",
+  type: "race-boat"
+};
+function glideMixin (obj) {
+  obj.glide = () => 'Gliding!';
+}
+
+glideMixin(bird);
+glideMixin(boat);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-an-iife-to-create-a-module.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-an-iife-to-create-a-module.md
new file mode 100644
index 0000000000..ba842fa313
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-an-iife-to-create-a-module.md
@@ -0,0 +1,106 @@
+---
+id: 587d7db2367417b2b2512b8c
+title: Use an IIFE to Create a Module
+challengeType: 1
+forumTopicId: 301332
+dashedName: use-an-iife-to-create-a-module
+---
+
+# --description--
+
+An immediately invoked function expression (IIFE) is often used to group related functionality into a single object or <dfn>module</dfn>. For example, an earlier challenge defined two mixins:
+
+```js
+function glideMixin(obj) {
+  obj.glide = function() {
+    console.log("Gliding on the water");
+  };
+}
+function flyMixin(obj) {
+  obj.fly = function() {
+    console.log("Flying, wooosh!");
+  };
+}
+```
+
+We can group these mixins into a module as follows:
+
+```js
+let motionModule = (function () {
+  return {
+    glideMixin: function(obj) {
+      obj.glide = function() {
+        console.log("Gliding on the water");
+      };
+    },
+    flyMixin: function(obj) {
+      obj.fly = function() {
+        console.log("Flying, wooosh!");
+      };
+    }
+  }
+})();
+```
+
+Note that you have an immediately invoked function expression (IIFE) that returns an object `motionModule`. This returned object contains all of the mixin behaviors as properties of the object. The advantage of the module 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:
+
+```js
+motionModule.glideMixin(duck);
+duck.glide();
+```
+
+# --instructions--
+
+Create a module named `funModule` to wrap the two mixins `isCuteMixin` and `singMixin`. `funModule` should return an object.
+
+# --hints--
+
+`funModule` should be defined and return an object.
+
+```js
+assert(typeof funModule === 'object');
+```
+
+`funModule.isCuteMixin` should access a function.
+
+```js
+assert(typeof funModule.isCuteMixin === 'function');
+```
+
+`funModule.singMixin` should access a function.
+
+```js
+assert(typeof funModule.singMixin === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let isCuteMixin = function(obj) {
+  obj.isCute = function() {
+    return true;
+  };
+};
+let singMixin = function(obj) {
+  obj.sing = function() {
+    console.log("Singing to an awesome tune");
+  };
+};
+```
+
+# --solutions--
+
+```js
+const funModule = (function () {
+  return {
+    isCuteMixin: obj => {
+      obj.isCute = () => true;
+    },
+    singMixin: obj => {
+      obj.sing = () => console.log("Singing to an awesome tune");
+    }
+  };
+})();
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-closure-to-protect-properties-within-an-object-from-being-modified-externally.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-closure-to-protect-properties-within-an-object-from-being-modified-externally.md
new file mode 100644
index 0000000000..db936ea17d
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-closure-to-protect-properties-within-an-object-from-being-modified-externally.md
@@ -0,0 +1,82 @@
+---
+id: 587d7db2367417b2b2512b8a
+title: >-
+  Use Closure to Protect Properties Within an Object from Being Modified
+  Externally
+challengeType: 1
+forumTopicId: 18234
+dashedName: >-
+  use-closure-to-protect-properties-within-an-object-from-being-modified-externally
+---
+
+# --description--
+
+In the previous challenge, `bird` had a public property `name`. It is considered public because it can be accessed and changed outside of `bird`'s definition.
+
+```js
+bird.name = "Duffy";
+```
+
+Therefore, any part of your code can easily change the name of `bird` 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 this public property 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 variable can only be accessed and changed by methods also within the constructor function.
+
+```js
+function Bird() {
+  let hatchedEgg = 10;
+
+  this.getHatchedEggCount = function() { 
+    return hatchedEgg;
+  };
+}
+let ducky = new Bird();
+ducky.getHatchedEggCount();
+```
+
+Here `getHatchedEggCount` is a privileged method, because it has access to the private variable `hatchedEgg`. This is possible because `hatchedEgg` is declared in the same context as `getHatchedEggCount`. In JavaScript, a function always has access to the context in which it was created. This is called `closure`.
+
+# --instructions--
+
+Change how `weight` is declared in the `Bird` function so it is a private variable. Then, create a method `getWeight` that returns the value of `weight` 15.
+
+# --hints--
+
+The `weight` property should be a private variable and should be assigned the value of `15`.
+
+```js
+assert(code.match(/(var|let|const)\s+weight\s*\=\s*15\;?/g));
+```
+
+Your code should create a method in `Bird` called `getWeight` that returns the value of the private variable `weight`.
+
+```js
+assert(new Bird().getWeight() === 15);
+```
+
+Your `getWeight` function should return the private variable `weight`.
+
+```js
+assert(code.match(/((return\s+)|(\(\s*\)\s*\=\>\s*))weight\;?/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Bird() {
+  this.weight = 15;
+
+
+}
+```
+
+# --solutions--
+
+```js
+function Bird() {
+  let weight = 15;
+
+  this.getWeight = () => weight;
+}
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-dot-notation-to-access-the-properties-of-an-object.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-dot-notation-to-access-the-properties-of-an-object.md
new file mode 100644
index 0000000000..c2a6b1700b
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-dot-notation-to-access-the-properties-of-an-object.md
@@ -0,0 +1,62 @@
+---
+id: 587d7dac367417b2b2512b74
+title: Use Dot Notation to Access the Properties of an Object
+challengeType: 1
+forumTopicId: 301333
+dashedName: use-dot-notation-to-access-the-properties-of-an-object
+---
+
+# --description--
+
+The last challenge created an object with various properties. Now you'll see how to access the values of those properties. Here's an example:
+
+```js
+let duck = {
+  name: "Aflac",
+  numLegs: 2
+};
+console.log(duck.name);
+```
+
+Dot notation is used on the object name, `duck`, followed by the name of the property, `name`, to access the value of `Aflac`.
+
+# --instructions--
+
+Print both properties of the `dog` object to your console.
+
+# --hints--
+
+Your code should use `console.log` to print the value for the `name` property of the `dog` object.
+
+```js
+assert(/console.log\(.*dog\.name.*\)/g.test(code));
+```
+
+Your code should use `console.log` to print the value for the `numLegs` property of the `dog` object.
+
+```js
+assert(/console.log\(.*dog\.numLegs.*\)/g.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4
+};
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+let dog = {
+  name: "Spot",
+  numLegs: 4
+};
+console.log(dog.name);
+console.log(dog.numLegs);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-inheritance-so-you-dont-repeat-yourself.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-inheritance-so-you-dont-repeat-yourself.md
new file mode 100644
index 0000000000..4411c1a12e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-inheritance-so-you-dont-repeat-yourself.md
@@ -0,0 +1,142 @@
+---
+id: 587d7db0367417b2b2512b83
+title: Use Inheritance So You Don't Repeat Yourself
+challengeType: 1
+forumTopicId: 301334
+dashedName: use-inheritance-so-you-dont-repeat-yourself
+---
+
+# --description--
+
+There's a principle in programming called <dfn>Don't Repeat Yourself (DRY)</dfn>. 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 `describe` method is shared by `Bird` and `Dog`:
+
+```js
+Bird.prototype = {
+  constructor: Bird,
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+
+Dog.prototype = {
+  constructor: Dog,
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+```
+
+The `describe` method is repeated in two places. The code can be edited to follow the DRY principle by creating a `supertype` (or parent) called `Animal`:
+
+```js
+function Animal() { };
+
+Animal.prototype = {
+  constructor: Animal, 
+  describe: function() {
+    console.log("My name is " + this.name);
+  }
+};
+```
+
+Since `Animal` includes the `describe` method, you can remove it from `Bird` and `Dog`:
+
+```js
+Bird.prototype = {
+  constructor: Bird
+};
+
+Dog.prototype = {
+  constructor: Dog
+};
+```
+
+# --instructions--
+
+The `eat` method is repeated in both `Cat` and `Bear`. Edit the code in the spirit of DRY by moving the `eat` method to the `Animal` `supertype`.
+
+# --hints--
+
+`Animal.prototype` should have the `eat` property.
+
+```js
+assert(Animal.prototype.hasOwnProperty('eat'));
+```
+
+`Bear.prototype` should not have the `eat` property.
+
+```js
+assert(!Bear.prototype.hasOwnProperty('eat'));
+```
+
+`Cat.prototype` should not have the `eat` property.
+
+```js
+assert(!Cat.prototype.hasOwnProperty('eat'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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,
+
+};
+```
+
+# --solutions--
+
+```js
+function Cat(name) {
+  this.name = name;
+}
+
+Cat.prototype = {
+  constructor: Cat
+};
+
+function Bear(name) {
+  this.name = name;
+}
+
+Bear.prototype = {
+  constructor: Bear
+};
+
+function Animal() { }
+
+Animal.prototype = {
+  constructor: Animal,
+  eat: function() {
+    console.log("nom nom nom");
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-prototype-properties-to-reduce-duplicate-code.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-prototype-properties-to-reduce-duplicate-code.md
new file mode 100644
index 0000000000..7d18dd43b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/use-prototype-properties-to-reduce-duplicate-code.md
@@ -0,0 +1,77 @@
+---
+id: 587d7dae367417b2b2512b7c
+title: Use Prototype Properties to Reduce Duplicate Code
+challengeType: 1
+forumTopicId: 301336
+dashedName: use-prototype-properties-to-reduce-duplicate-code
+---
+
+# --description--
+
+Since `numLegs` will probably have the same value for all instances of `Bird`, you essentially have a duplicated variable `numLegs` inside each `Bird` 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 the `prototype` of `Bird`. Properties in the `prototype` are shared among ALL instances of `Bird`. Here's how to add `numLegs` to the `Bird prototype`:
+
+```js
+Bird.prototype.numLegs = 2;
+```
+
+Now all instances of `Bird` have the `numLegs` property.
+
+```js
+console.log(duck.numLegs);
+console.log(canary.numLegs);
+```
+
+Since all instances automatically have the properties on the `prototype`, think of a `prototype` as a "recipe" for creating objects. Note that the `prototype` for `duck` and `canary` is part of the `Bird` constructor as `Bird.prototype`. Nearly every object in JavaScript has a `prototype` property which is part of the constructor function that created it.
+
+# --instructions--
+
+Add a `numLegs` property to the `prototype` of `Dog`
+
+# --hints--
+
+`beagle` should have a `numLegs` property.
+
+```js
+assert(beagle.numLegs !== undefined);
+```
+
+`beagle.numLegs` should be a number.
+
+```js
+assert(typeof beagle.numLegs === 'number');
+```
+
+`numLegs` should be a `prototype` property not an own property.
+
+```js
+assert(beagle.hasOwnProperty('numLegs') === false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Dog(name) {
+  this.name = name;
+}
+
+
+
+// Only change code above this line
+let beagle = new Dog("Snoopy");
+```
+
+# --solutions--
+
+```js
+function Dog (name) {
+  this.name = name;
+}
+Dog.prototype.numLegs = 4;
+let beagle = new Dog("Snoopy");
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/verify-an-objects-constructor-with-instanceof.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/verify-an-objects-constructor-with-instanceof.md
new file mode 100644
index 0000000000..232e29ed51
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/object-oriented-programming/verify-an-objects-constructor-with-instanceof.md
@@ -0,0 +1,79 @@
+---
+id: 587d7dae367417b2b2512b7a
+title: Verify an Object's Constructor with instanceof
+challengeType: 1
+forumTopicId: 301337
+dashedName: verify-an-objects-constructor-with-instanceof
+---
+
+# --description--
+
+Anytime a constructor function creates a new object, that object is said to be an <dfn>instance</dfn> of its constructor. JavaScript gives a convenient way to verify this with the `instanceof` operator. `instanceof` allows you to compare an object to a constructor, returning `true` or `false` based on whether or not that object was created with the constructor. Here's an example:
+
+```js
+let Bird = function(name, color) {
+  this.name = name;
+  this.color = color;
+  this.numLegs = 2;
+}
+
+let crow = new Bird("Alexis", "black");
+
+crow instanceof Bird;
+```
+
+This `instanceof` method would return `true`.
+
+If an object is created without using a constructor, `instanceof` will verify that it is not an instance of that constructor:
+
+```js
+let canary = {
+  name: "Mildred",
+  color: "Yellow",
+  numLegs: 2
+};
+
+canary instanceof Bird;
+```
+
+This `instanceof` method would return `false`.
+
+# --instructions--
+
+Create a new instance of the `House` constructor, calling it `myHouse` and passing a number of bedrooms. Then, use `instanceof` to verify that it is an instance of `House`.
+
+# --hints--
+
+`myHouse` should have a `numBedrooms` attribute set to a number.
+
+```js
+assert(typeof myHouse.numBedrooms === 'number');
+```
+
+You should verify that `myHouse` is an instance of `House` using the `instanceof` operator.
+
+```js
+assert(/myHouse\s*instanceof\s*House/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function House(numBedrooms) {
+  this.numBedrooms = numBedrooms;
+}
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+function House(numBedrooms) {
+  this.numBedrooms = numBedrooms;
+}
+const myHouse = new House(4);
+console.log(myHouse instanceof House);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-all-or-none.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-all-or-none.md
new file mode 100644
index 0000000000..8bed443ac0
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-all-or-none.md
@@ -0,0 +1,77 @@
+---
+id: 587d7dba367417b2b2512ba8
+title: Check for All or None
+challengeType: 1
+forumTopicId: 301338
+dashedName: 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, `?`. 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.
+
+```js
+let american = "color";
+let british = "colour";
+let rainbowRegex= /colou?r/;
+rainbowRegex.test(american);
+rainbowRegex.test(british);
+```
+
+Both uses of the `test` method would return `true`.
+
+# --instructions--
+
+Change the regex `favRegex` to match both the American English (`favorite`) and the British English (`favourite`) version of the word.
+
+# --hints--
+
+Your regex should use the optional symbol, `?`.
+
+```js
+favRegex.lastIndex = 0;
+assert(favRegex.source.match(/\?/).length > 0);
+```
+
+Your regex should match the string `favorite`
+
+```js
+favRegex.lastIndex = 0;
+assert(favRegex.test('favorite'));
+```
+
+Your regex should match the string `favourite`
+
+```js
+favRegex.lastIndex = 0;
+assert(favRegex.test('favourite'));
+```
+
+Your regex should not match the string `fav`
+
+```js
+favRegex.lastIndex = 0;
+assert(!favRegex.test('fav'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let favWord = "favorite";
+let favRegex = /change/; // Change this line
+let result = favRegex.test(favWord);
+```
+
+# --solutions--
+
+```js
+let favWord = "favorite";
+let favRegex = /favou?r/;
+let result = favRegex.test(favWord);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-mixed-grouping-of-characters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-mixed-grouping-of-characters.md
new file mode 100644
index 0000000000..6f388d1462
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/check-for-mixed-grouping-of-characters.md
@@ -0,0 +1,90 @@
+---
+id: 5c3dda8b4d8df89bea71600f
+title: Check For Mixed Grouping of Characters
+challengeType: 1
+forumTopicId: 301339
+dashedName: check-for-mixed-grouping-of-characters
+---
+
+# --description--
+
+Sometimes we want to check for groups of characters using a Regular Expression and to achieve that we use parentheses `()`.
+
+If you want to find either `Penguin` or `Pumpkin` in a string, you can use the following Regular Expression: `/P(engu|umpk)in/g`
+
+Then check whether the desired string groups are in the test string by using the `test()` method.
+
+```js
+let testStr = "Pumpkin";
+let testRegex = /P(engu|umpk)in/;
+testRegex.test(testStr);
+```
+
+The `test` method here would return `true`.
+
+# --instructions--
+
+Fix the regex so that it checks for the names of `Franklin Roosevelt` or `Eleanor Roosevelt` in a case sensitive manner and it should make concessions for middle names.
+
+Then fix the code so that the regex that you have created is checked against `myString` and either `true` or `false` is returned depending on whether the regex matches.
+
+# --hints--
+
+Your regex `myRegex` should return `true` for the string `Franklin D. Roosevelt`
+
+```js
+myRegex.lastIndex = 0;
+assert(myRegex.test('Franklin D. Roosevelt'));
+```
+
+Your regex `myRegex` should return `true` for the string `Eleanor Roosevelt`
+
+```js
+myRegex.lastIndex = 0;
+assert(myRegex.test('Eleanor Roosevelt'));
+```
+
+Your regex `myRegex` should return `false` for the string `Franklin Rosevelt`
+
+```js
+myRegex.lastIndex = 0;
+assert(!myRegex.test('Franklin Rosevelt'));
+```
+
+Your regex `myRegex` should return `false` for the string `Frank Roosevelt`
+
+```js
+myRegex.lastIndex = 0;
+assert(!myRegex.test('Frank Roosevelt'));
+```
+
+You should use `.test()` to test the regex.
+
+```js
+assert(code.match(/myRegex.test\(\s*myString\s*\)/));
+```
+
+Your result should return `true`.
+
+```js
+assert(result === true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myString = "Eleanor Roosevelt";
+let myRegex = /False/; // Change this line
+let result = false; // Change this line
+// After passing the challenge experiment with myString and see how the grouping works
+```
+
+# --solutions--
+
+```js
+let myString = "Eleanor Roosevelt";
+let myRegex = /(Franklin|Eleanor).*Roosevelt/;
+let result = myRegex.test(myString);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/extract-matches.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/extract-matches.md
new file mode 100644
index 0000000000..887f6e3629
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/extract-matches.md
@@ -0,0 +1,73 @@
+---
+id: 587d7db4367417b2b2512b92
+title: Extract Matches
+challengeType: 1
+forumTopicId: 301340
+dashedName: 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 `.match()` method.
+
+To use the `.match()` method, apply the method on a string and pass in the regex inside the parentheses.
+
+Here's an example:
+
+```js
+"Hello, World!".match(/Hello/);
+let ourStr = "Regular expressions";
+let ourRegex = /expressions/;
+ourStr.match(ourRegex);
+```
+
+Here the first `match` would return `["Hello"]` and the second would return `["expressions"]`.
+
+Note that the `.match` syntax is the "opposite" of the `.test` method you have been using thus far:
+
+```js
+'string'.match(/regex/);
+/regex/.test('string');
+```
+
+# --instructions--
+
+Apply the `.match()` method to extract the string `coding`.
+
+# --hints--
+
+The `result` should have the string `coding`
+
+```js
+assert(result.join() === 'coding');
+```
+
+Your regex `codingRegex` should search for the string `coding`
+
+```js
+assert(codingRegex.source === 'coding');
+```
+
+You should use the `.match()` method.
+
+```js
+assert(code.match(/\.match\(.*\)/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let extractStr = "Extract the word 'coding' from this string.";
+let codingRegex = /change/; // Change this line
+let result = extractStr; // Change this line
+```
+
+# --solutions--
+
+```js
+let extractStr = "Extract the word 'coding' from this string.";
+let codingRegex = /coding/; // Change this line
+let result = extractStr.match(codingRegex); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-characters-with-lazy-matching.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-characters-with-lazy-matching.md
new file mode 100644
index 0000000000..a4dfbbf1d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-characters-with-lazy-matching.md
@@ -0,0 +1,61 @@
+---
+id: 587d7db6367417b2b2512b9b
+title: Find Characters with Lazy Matching
+challengeType: 1
+forumTopicId: 301341
+dashedName: find-characters-with-lazy-matching
+---
+
+# --description--
+
+In regular expressions, a <dfn>greedy</dfn> 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 <dfn>lazy</dfn> match, which finds the smallest possible part of the string that satisfies the regex pattern.
+
+You can apply the regex `/t[a-z]*i/` to the string `"titanic"`. This regex is basically a pattern that starts with `t`, ends with `i`, and has some letters in between.
+
+Regular expressions are by default greedy, so the match would return `["titani"]`. It finds the largest sub-string possible to fit the pattern.
+
+However, you can use the `?` character to change it to lazy matching. `"titanic"` matched against the adjusted regex of `/t[a-z]*?i/` returns `["ti"]`.
+
+**Note:** Parsing HTML with regular expressions should be avoided, but pattern matching an HTML string with regular expressions is completely fine.
+
+# --instructions--
+
+Fix the regex `/<.*>/` to return the HTML tag `<h1>` and not the text `"<h1>Winter is coming</h1>"`. Remember the wildcard `.` in a regular expression matches any character.
+
+# --hints--
+
+The `result` variable should be an array with `<h1>` in it
+
+```js
+assert(result[0] == '<h1>');
+```
+
+`myRegex` should use lazy matching
+
+```js
+assert(/\?/g.test(myRegex));
+```
+
+`myRegex` should not include the string `h1`
+
+```js
+assert(!myRegex.source.match('h1'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let text = "<h1>Winter is coming</h1>";
+let myRegex = /<.*>/; // Change this line
+let result = text.match(myRegex);
+```
+
+# --solutions--
+
+```js
+let text = "<h1>Winter is coming</h1>";
+let myRegex = /<.*?>/; // Change this line
+let result = text.match(myRegex);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-more-than-the-first-match.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-more-than-the-first-match.md
new file mode 100644
index 0000000000..e9e55893d6
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-more-than-the-first-match.md
@@ -0,0 +1,85 @@
+---
+id: 587d7db4367417b2b2512b93
+title: Find More Than the First Match
+challengeType: 1
+forumTopicId: 301342
+dashedName: find-more-than-the-first-match
+---
+
+# --description--
+
+So far, you have only been able to extract or search a pattern once.
+
+```js
+let testStr = "Repeat, Repeat, Repeat";
+let ourRegex = /Repeat/;
+testStr.match(ourRegex);
+```
+
+Here `match` would return `["Repeat"]`.
+
+To search or extract a pattern more than once, you can use the `g` flag.
+
+```js
+let repeatRegex = /Repeat/g;
+testStr.match(repeatRegex);
+```
+
+And here `match` returns the value `["Repeat", "Repeat", "Repeat"]`
+
+# --instructions--
+
+Using the regex `starRegex`, find and extract both `Twinkle` words from the string `twinkleStar`.
+
+**Note**  
+You can have multiple flags on your regex like `/search/gi`
+
+# --hints--
+
+Your regex `starRegex` should use the global flag `g`
+
+```js
+assert(starRegex.flags.match(/g/).length == 1);
+```
+
+Your regex `starRegex` should use the case insensitive flag `i`
+
+```js
+assert(starRegex.flags.match(/i/).length == 1);
+```
+
+Your match should match both occurrences of the word `Twinkle`
+
+```js
+assert(
+  result.sort().join() ==
+    twinkleStar
+      .match(/twinkle/gi)
+      .sort()
+      .join()
+);
+```
+
+Your match `result` should have two elements in it.
+
+```js
+assert(result.length == 2);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let twinkleStar = "Twinkle, twinkle, little star";
+let starRegex = /change/; // Change this line
+let result = twinkleStar; // Change this line
+```
+
+# --solutions--
+
+```js
+let twinkleStar = "Twinkle, twinkle, little star";
+let starRegex = /twinkle/gi;
+let result = twinkleStar.match(starRegex);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-one-or-more-criminals-in-a-hunt.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-one-or-more-criminals-in-a-hunt.md
new file mode 100644
index 0000000000..553c581b89
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/find-one-or-more-criminals-in-a-hunt.md
@@ -0,0 +1,106 @@
+---
+id: 587d7db7367417b2b2512b9c
+title: Find One or More Criminals in a Hunt
+challengeType: 1
+forumTopicId: 301343
+dashedName: 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 `/z+/` matches the letter `z` when it appears one or more times in a row. It would find matches in all of the following strings:
+
+```js
+"z"
+"zzzzzz"
+"ABCzzzz"
+"zzzzABC"
+"abczzzzzzzzzzzzzzzzzzzzzabc"
+```
+
+But it does not find matches in the following strings since there are no letter `z` characters:
+
+```js
+""
+"ABC"
+"abcabc"
+```
+
+# --instructions--
+
+Write a greedy regex that finds one or more criminals within a group of other people. A criminal is represented by the capital letter `C`.
+
+# --hints--
+
+Your regex should match one criminal (`C`) in the string `C`
+
+```js
+assert('C'.match(reCriminals) && 'C'.match(reCriminals)[0] == 'C');
+```
+
+Your regex should match two criminals (`CC`) in the string `CC`
+
+```js
+assert('CC'.match(reCriminals) && 'CC'.match(reCriminals)[0] == 'CC');
+```
+
+Your regex should match three criminals (`CCC`) in the string `P1P5P4CCCcP2P6P3`.
+
+```js
+assert(
+  'P1P5P4CCCcP2P6P3'.match(reCriminals) &&
+    'P1P5P4CCCcP2P6P3'.match(reCriminals)[0] == 'CCC'
+);
+```
+
+Your regex should match five criminals (`CCCCC`) in the string `P6P2P7P4P5CCCCCP3P1`
+
+```js
+assert(
+  'P6P2P7P4P5CCCCCP3P1'.match(reCriminals) &&
+    'P6P2P7P4P5CCCCCP3P1'.match(reCriminals)[0] == 'CCCCC'
+);
+```
+
+Your regex should not match any criminals in the empty string `""`
+
+```js
+assert(!reCriminals.test(''));
+```
+
+Your regex should not match any criminals in the string `P1P2P3`
+
+```js
+assert(!reCriminals.test('P1P2P3'));
+```
+
+Your regex should match fifty criminals (`CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC`) in the string `P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3`.
+
+```js
+assert(
+  'P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3'.match(
+    reCriminals
+  ) &&
+    'P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3'.match(
+      reCriminals
+    )[0] == 'CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let reCriminals = /./; // Change this line
+```
+
+# --solutions--
+
+```js
+let reCriminals = /C+/; // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/ignore-case-while-matching.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/ignore-case-while-matching.md
new file mode 100644
index 0000000000..84ad9636ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/ignore-case-while-matching.md
@@ -0,0 +1,99 @@
+---
+id: 587d7db4367417b2b2512b91
+title: Ignore Case While Matching
+challengeType: 1
+forumTopicId: 301344
+dashedName: 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 `A`, `B`, and `C`. Examples of lowercase are `a`, `b`, and `c`.
+
+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 `i` flag. You can use it by appending it to the regex. An example of using this flag is `/ignorecase/i`. This regex can match the strings `ignorecase`, `igNoreCase`, and `IgnoreCase`.
+
+# --instructions--
+
+Write a regex `fccRegex` to match `freeCodeCamp`, no matter its case. Your regex should not match any abbreviations or variations with spaces.
+
+# --hints--
+
+Your regex should match the string `freeCodeCamp`
+
+```js
+assert(fccRegex.test('freeCodeCamp'));
+```
+
+Your regex should match the string `FreeCodeCamp`
+
+```js
+assert(fccRegex.test('FreeCodeCamp'));
+```
+
+Your regex should match the string `FreecodeCamp`
+
+```js
+assert(fccRegex.test('FreecodeCamp'));
+```
+
+Your regex should match the string `FreeCodecamp`
+
+```js
+assert(fccRegex.test('FreeCodecamp'));
+```
+
+Your regex should not match the string `Free Code Camp`
+
+```js
+assert(!fccRegex.test('Free Code Camp'));
+```
+
+Your regex should match the string `FreeCOdeCamp`
+
+```js
+assert(fccRegex.test('FreeCOdeCamp'));
+```
+
+Your regex should not match the string `FCC`
+
+```js
+assert(!fccRegex.test('FCC'));
+```
+
+Your regex should match the string `FrEeCoDeCamp`
+
+```js
+assert(fccRegex.test('FrEeCoDeCamp'));
+```
+
+Your regex should match the string `FrEeCodECamp`
+
+```js
+assert(fccRegex.test('FrEeCodECamp'));
+```
+
+Your regex should match the string `FReeCodeCAmp`
+
+```js
+assert(fccRegex.test('FReeCodeCAmp'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myString = "freeCodeCamp";
+let fccRegex = /change/; // Change this line
+let result = fccRegex.test(myString);
+```
+
+# --solutions--
+
+```js
+let myString = "freeCodeCamp";
+let fccRegex = /freecodecamp/i; // Change this line
+let result = fccRegex.test(myString);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-a-literal-string-with-different-possibilities.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-a-literal-string-with-different-possibilities.md
new file mode 100644
index 0000000000..5a970259d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-a-literal-string-with-different-possibilities.md
@@ -0,0 +1,83 @@
+---
+id: 587d7db4367417b2b2512b90
+title: Match a Literal String with Different Possibilities
+challengeType: 1
+forumTopicId: 301345
+dashedName: match-a-literal-string-with-different-possibilities
+---
+
+# --description--
+
+Using regexes like `/coding/`, you can look for the pattern `coding` 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 `alternation` or `OR` operator: `|`.
+
+This operator matches patterns either before or after it. For example, if you wanted to match the strings `yes` or `no`, the regex you want is `/yes|no/`.
+
+You can also search for more than just two patterns. You can do this by adding more patterns with more `OR` operators separating them, like `/yes|no|maybe/`.
+
+# --instructions--
+
+Complete the regex `petRegex` to match the pets `dog`, `cat`, `bird`, or `fish`.
+
+# --hints--
+
+Your regex `petRegex` should return `true` for the string `John has a pet dog.`
+
+```js
+assert(petRegex.test('John has a pet dog.'));
+```
+
+Your regex `petRegex` should return `false` for the string `Emma has a pet rock.`
+
+```js
+assert(!petRegex.test('Emma has a pet rock.'));
+```
+
+Your regex `petRegex` should return `true` for the string `Emma has a pet bird.`
+
+```js
+assert(petRegex.test('Emma has a pet bird.'));
+```
+
+Your regex `petRegex` should return `true` for the string `Liz has a pet cat.`
+
+```js
+assert(petRegex.test('Liz has a pet cat.'));
+```
+
+Your regex `petRegex` should return `false` for the string `Kara has a pet dolphin.`
+
+```js
+assert(!petRegex.test('Kara has a pet dolphin.'));
+```
+
+Your regex `petRegex` should return `true` for the string `Alice has a pet fish.`
+
+```js
+assert(petRegex.test('Alice has a pet fish.'));
+```
+
+Your regex `petRegex` should return `false` for the string `Jimmy has a pet computer.`
+
+```js
+assert(!petRegex.test('Jimmy has a pet computer.'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let petString = "James has a pet cat.";
+let petRegex = /change/; // Change this line
+let result = petRegex.test(petString);
+```
+
+# --solutions--
+
+```js
+let petString = "James has a pet cat.";
+let petRegex = /dog|cat|bird|fish/; // Change this line
+let result = petRegex.test(petString);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-letters-and-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-letters-and-numbers.md
new file mode 100644
index 0000000000..716adc5104
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-letters-and-numbers.md
@@ -0,0 +1,98 @@
+---
+id: 587d7db7367417b2b2512b9f
+title: Match All Letters and Numbers
+challengeType: 1
+forumTopicId: 301346
+dashedName: match-all-letters-and-numbers
+---
+
+# --description--
+
+Using character classes, you were able to search for all letters of the alphabet with `[a-z]`. 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 `\w`. This shortcut is equal to `[A-Za-z0-9_]`. This character class matches upper and lowercase letters plus numbers. Note, this character class also includes the underscore character (`_`).
+
+```js
+let longHand = /[A-Za-z0-9_]+/;
+let shortHand = /\w+/;
+let numbers = "42";
+let varNames = "important_var";
+longHand.test(numbers);
+shortHand.test(numbers);
+longHand.test(varNames);
+shortHand.test(varNames);
+```
+
+All four of these `test` calls would return `true`.
+
+These shortcut character classes are also known as <dfn>shorthand character classes</dfn>.
+
+# --instructions--
+
+Use the shorthand character class `\w` to count the number of alphanumeric characters in various quotes and strings.
+
+# --hints--
+
+Your regex should use the global flag.
+
+```js
+assert(alphabetRegexV2.global);
+```
+
+Your regex should use the shorthand character `\w` to match all characters which are alphanumeric.
+
+```js
+assert(/\\w/.test(alphabetRegexV2.source));
+```
+
+Your regex should find 31 alphanumeric characters in the string `The five boxing wizards jump quickly.`
+
+```js
+assert(
+  'The five boxing wizards jump quickly.'.match(alphabetRegexV2).length === 31
+);
+```
+
+Your regex should find 32 alphanumeric characters in the string `Pack my box with five dozen liquor jugs.`
+
+```js
+assert(
+  'Pack my box with five dozen liquor jugs.'.match(alphabetRegexV2).length ===
+    32
+);
+```
+
+Your regex should find 30 alphanumeric characters in the string `How vexingly quick daft zebras jump!`
+
+```js
+assert(
+  'How vexingly quick daft zebras jump!'.match(alphabetRegexV2).length === 30
+);
+```
+
+Your regex should find 36 alphanumeric characters in the string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
+
+```js
+assert(
+  '123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.'.match(alphabetRegexV2)
+    .length === 36
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let quoteSample = "The five boxing wizards jump quickly.";
+let alphabetRegexV2 = /change/; // Change this line
+let result = quoteSample.match(alphabetRegexV2).length;
+```
+
+# --solutions--
+
+```js
+let quoteSample = "The five boxing wizards jump quickly.";
+let alphabetRegexV2 = /\w/g; // Change this line
+let result = quoteSample.match(alphabetRegexV2).length;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-non-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-non-numbers.md
new file mode 100644
index 0000000000..3eed2453f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-non-numbers.md
@@ -0,0 +1,85 @@
+---
+id: 587d7db8367417b2b2512ba1
+title: Match All Non-Numbers
+challengeType: 1
+forumTopicId: 301347
+dashedName: match-all-non-numbers
+---
+
+# --description--
+
+The last challenge showed how to search for digits using the shortcut `\d` with a lowercase `d`. You can also search for non-digits using a similar shortcut that uses an uppercase `D` instead.
+
+The shortcut to look for non-digit characters is `\D`. This is equal to the character class `[^0-9]`, which looks for a single character that is not a number between zero and nine.
+
+# --instructions--
+
+Use the shorthand character class for non-digits `\D` to count how many non-digits are in movie titles.
+
+# --hints--
+
+Your regex should use the shortcut character to match non-digit characters
+
+```js
+assert(/\\D/.test(noNumRegex.source));
+```
+
+Your regex should use the global flag.
+
+```js
+assert(noNumRegex.global);
+```
+
+Your regex should find no non-digits in the string `9`.
+
+```js
+assert('9'.match(noNumRegex) == null);
+```
+
+Your regex should find 6 non-digits in the string `Catch 22`.
+
+```js
+assert('Catch 22'.match(noNumRegex).length == 6);
+```
+
+Your regex should find 11 non-digits in the string `101 Dalmatians`.
+
+```js
+assert('101 Dalmatians'.match(noNumRegex).length == 11);
+```
+
+Your regex should find 15 non-digits in the string `One, Two, Three`.
+
+```js
+assert('One, Two, Three'.match(noNumRegex).length == 15);
+```
+
+Your regex should find 12 non-digits in the string `21 Jump Street`.
+
+```js
+assert('21 Jump Street'.match(noNumRegex).length == 12);
+```
+
+Your regex should find 17 non-digits in the string `2001: A Space Odyssey`.
+
+```js
+assert('2001: A Space Odyssey'.match(noNumRegex).length == 17);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let movieName = "2001: A Space Odyssey";
+let noNumRegex = /change/; // Change this line
+let result = movieName.match(noNumRegex).length;
+```
+
+# --solutions--
+
+```js
+let movieName = "2001: A Space Odyssey";
+let noNumRegex = /\D/g; // Change this line
+let result = movieName.match(noNumRegex).length;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-numbers.md
new file mode 100644
index 0000000000..f4a6505e86
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-all-numbers.md
@@ -0,0 +1,85 @@
+---
+id: 5d712346c441eddfaeb5bdef
+title: Match All Numbers
+challengeType: 1
+forumTopicId: 18181
+dashedName: 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 `\d`, with a lowercase `d`. This is equal to the character class `[0-9]`, which looks for a single character of any number between zero and nine.
+
+# --instructions--
+
+Use the shorthand character class `\d` to count how many digits are in movie titles. Written out numbers ("six" instead of 6) do not count.
+
+# --hints--
+
+Your regex should use the shortcut character to match digit characters
+
+```js
+assert(/\\d/.test(numRegex.source));
+```
+
+Your regex should use the global flag.
+
+```js
+assert(numRegex.global);
+```
+
+Your regex should find 1 digit in the string `9`.
+
+```js
+assert('9'.match(numRegex).length == 1);
+```
+
+Your regex should find 2 digits in the string `Catch 22`.
+
+```js
+assert('Catch 22'.match(numRegex).length == 2);
+```
+
+Your regex should find 3 digits in the string `101 Dalmatians`.
+
+```js
+assert('101 Dalmatians'.match(numRegex).length == 3);
+```
+
+Your regex should find no digits in the string `One, Two, Three`.
+
+```js
+assert('One, Two, Three'.match(numRegex) == null);
+```
+
+Your regex should find 2 digits in the string `21 Jump Street`.
+
+```js
+assert('21 Jump Street'.match(numRegex).length == 2);
+```
+
+Your regex should find 4 digits in the string `2001: A Space Odyssey`.
+
+```js
+assert('2001: A Space Odyssey'.match(numRegex).length == 4);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let movieName = "2001: A Space Odyssey";
+let numRegex = /change/; // Change this line
+let result = movieName.match(numRegex).length;
+```
+
+# --solutions--
+
+```js
+let movieName = "2001: A Space Odyssey";
+let numRegex = /\d/g; // Change this line
+let result = movieName.match(numRegex).length;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-anything-with-wildcard-period.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-anything-with-wildcard-period.md
new file mode 100644
index 0000000000..3306cfb8c7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-anything-with-wildcard-period.md
@@ -0,0 +1,119 @@
+---
+id: 587d7db5367417b2b2512b94
+title: Match Anything with Wildcard Period
+challengeType: 1
+forumTopicId: 301348
+dashedName: 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: `.`
+
+The wildcard character `.` will match any one character. The wildcard is also called `dot` and `period`. You can use the wildcard character just like any other character in the regex. For example, if you wanted to match `hug`, `huh`, `hut`, and `hum`, you can use the regex `/hu./` to match all four words.
+
+```js
+let humStr = "I'll hum a song";
+let hugStr = "Bear hug";
+let huRegex = /hu./;
+huRegex.test(humStr);
+huRegex.test(hugStr);
+```
+
+Both of these `test` calls would return `true`.
+
+# --instructions--
+
+Complete the regex `unRegex` so that it matches the strings `run`, `sun`, `fun`, `pun`, `nun`, and `bun`. Your regex should use the wildcard character.
+
+# --hints--
+
+You should use the `.test()` method.
+
+```js
+assert(code.match(/\.test\(.*\)/));
+```
+
+You should use the wildcard character in your regex `unRegex`
+
+```js
+assert(/\./.test(unRegex.source));
+```
+
+Your regex `unRegex` should match `run` in the string `Let us go on a run.`
+
+```js
+unRegex.lastIndex = 0;
+assert(unRegex.test('Let us go on a run.'));
+```
+
+Your regex `unRegex` should match `sun` in the string `The sun is out today.`
+
+```js
+unRegex.lastIndex = 0;
+assert(unRegex.test('The sun is out today.'));
+```
+
+Your regex `unRegex` should match `fun` in the string `Coding is a lot of fun.`
+
+```js
+unRegex.lastIndex = 0;
+assert(unRegex.test('Coding is a lot of fun.'));
+```
+
+Your regex `unRegex` should match `pun` in the string `Seven days without a pun makes one weak.`
+
+```js
+unRegex.lastIndex = 0;
+assert(unRegex.test('Seven days without a pun makes one weak.'));
+```
+
+Your regex `unRegex` should match `nun` in the string `One takes a vow to be a nun.`
+
+```js
+unRegex.lastIndex = 0;
+assert(unRegex.test('One takes a vow to be a nun.'));
+```
+
+Your regex `unRegex` should match `bun` in the string `She got fired from the hot dog stand for putting her hair in a bun.`
+
+```js
+unRegex.lastIndex = 0;
+assert(
+  unRegex.test(
+    'She got fired from the hot dog stand for putting her hair in a bun.'
+  )
+);
+```
+
+Your regex `unRegex` should not match the string `There is a bug in my code.`
+
+```js
+unRegex.lastIndex = 0;
+assert(!unRegex.test('There is a bug in my code.'));
+```
+
+Your regex `unRegex` should not match the string `Catch me if you can.`
+
+```js
+unRegex.lastIndex = 0;
+assert(!unRegex.test('Catch me if you can.'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let exampleStr = "Let's have fun with regular expressions!";
+let unRegex = /change/; // Change this line
+let result = unRegex.test(exampleStr);
+```
+
+# --solutions--
+
+```js
+let exampleStr = "Let's have fun with regular expressions!";
+let unRegex = /.un/; // Change this line
+let result = unRegex.test(exampleStr);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-beginning-string-patterns.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-beginning-string-patterns.md
new file mode 100644
index 0000000000..6d2b1dec50
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-beginning-string-patterns.md
@@ -0,0 +1,71 @@
+---
+id: 587d7db7367417b2b2512b9d
+title: Match Beginning String Patterns
+challengeType: 1
+forumTopicId: 301349
+dashedName: 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 caret character (`^`) inside a character set to create a negated character set in the form `[^thingsThatWillNotBeMatched]`. Outside of a character set, the caret is used to search for patterns at the beginning of strings.
+
+```js
+let firstString = "Ricky is first and can be found.";
+let firstRegex = /^Ricky/;
+firstRegex.test(firstString);
+let notFirst = "You can't find Ricky now.";
+firstRegex.test(notFirst);
+```
+
+The first `test` call would return `true`, while the second would return `false`.
+
+# --instructions--
+
+Use the caret character in a regex to find `Cal` only in the beginning of the string `rickyAndCal`.
+
+# --hints--
+
+Your regex should search for the string `Cal` with a capital letter.
+
+```js
+assert(calRegex.source == '^Cal');
+```
+
+Your regex should not use any flags.
+
+```js
+assert(calRegex.flags == '');
+```
+
+Your regex should match the string `Cal` at the beginning of the string.
+
+```js
+assert(calRegex.test('Cal and Ricky both like racing.'));
+```
+
+Your regex should not match the string `Cal` in the middle of a string.
+
+```js
+assert(!calRegex.test('Ricky and Cal both like racing.'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let rickyAndCal = "Cal and Ricky both like racing.";
+let calRegex = /change/; // Change this line
+let result = calRegex.test(rickyAndCal);
+```
+
+# --solutions--
+
+```js
+let rickyAndCal = "Cal and Ricky both like racing.";
+let calRegex = /^Cal/; // Change this line
+let result = calRegex.test(rickyAndCal);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
new file mode 100644
index 0000000000..c9d82ef7f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-one-or-more-times.md
@@ -0,0 +1,59 @@
+---
+id: 587d7db6367417b2b2512b99
+title: Match Characters that Occur One or More Times
+challengeType: 1
+forumTopicId: 301350
+dashedName: 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 `+` 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, `/a+/g` would find one match in `abc` and return `["a"]`. Because of the `+`, it would also find a single match in `aabc` and return `["aa"]`.
+
+If it were instead checking the string `abab`, it would find two matches and return `["a", "a"]` because the `a` characters are not in a row - there is a `b` between them. Finally, since there is no `a` in the string `bcd`, it wouldn't find a match.
+
+# --instructions--
+
+You want to find matches when the letter `s` occurs one or more times in `Mississippi`. Write a regex that uses the `+` sign.
+
+# --hints--
+
+Your regex `myRegex` should use the `+` sign to match one or more `s` characters.
+
+```js
+assert(/\+/.test(myRegex.source));
+```
+
+Your regex `myRegex` should match 2 items.
+
+```js
+assert(result.length == 2);
+```
+
+The `result` variable should be an array with two matches of `ss`
+
+```js
+assert(result[0] == 'ss' && result[1] == 'ss');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let difficultSpelling = "Mississippi";
+let myRegex = /change/; // Change this line
+let result = difficultSpelling.match(myRegex);
+```
+
+# --solutions--
+
+```js
+let difficultSpelling = "Mississippi";
+let myRegex = /s+/g; // Change this line
+let result = difficultSpelling.match(myRegex);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
new file mode 100644
index 0000000000..aaa4fdba5a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-characters-that-occur-zero-or-more-times.md
@@ -0,0 +1,96 @@
+---
+id: 587d7db6367417b2b2512b9a
+title: Match Characters that Occur Zero or More Times
+challengeType: 1
+forumTopicId: 301351
+dashedName: match-characters-that-occur-zero-or-more-times
+---
+
+# --description--
+
+The last challenge used the plus `+` 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 asterisk or star: `*`.
+
+```js
+let soccerWord = "gooooooooal!";
+let gPhrase = "gut feeling";
+let oPhrase = "over the moon";
+let goRegex = /go*/;
+soccerWord.match(goRegex);
+gPhrase.match(goRegex);
+oPhrase.match(goRegex);
+```
+
+In order, the three `match` calls would return the values `["goooooooo"]`, `["g"]`, and `null`.
+
+# --instructions--
+
+For this challenge, `chewieQuote` has been initialized as the string `Aaaaaaaaaaaaaaaarrrgh!` behind the scenes. Create a regex `chewieRegex` that uses the `*` character to match an uppercase `A` character immediately followed by zero or more lowercase `a` characters in `chewieQuote`. Your regex does not need flags or character classes, and it should not match any of the other quotes.
+
+# --hints--
+
+Your regex `chewieRegex` should use the `*` character to match zero or more `a` characters.
+
+```js
+assert(/\*/.test(chewieRegex.source));
+```
+
+Your regex should match the string `A` in `chewieQuote`.
+
+```js
+assert(result[0][0] === 'A');
+```
+
+Your regex should match the string `Aaaaaaaaaaaaaaaa` in `chewieQuote`.
+
+```js
+assert(result[0] === 'Aaaaaaaaaaaaaaaa');
+```
+
+Your regex `chewieRegex` should match 16 characters in `chewieQuote`.
+
+```js
+assert(result[0].length === 16);
+```
+
+Your regex should not match any characters in the string `He made a fair move. Screaming about it can't help you.`
+
+```js
+assert(
+  !"He made a fair move. Screaming about it can't help you.".match(chewieRegex)
+);
+```
+
+Your regex should not match any characters in the string `Let him have it. It's not wise to upset a Wookiee.`
+
+```js
+assert(
+  !"Let him have it. It's not wise to upset a Wookiee.".match(chewieRegex)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const chewieQuote = "Aaaaaaaaaaaaaaaarrrgh!";
+```
+
+## --seed-contents--
+
+```js
+// Only change code below this line
+let chewieRegex = /change/; // Change this line
+// Only change code above this line
+
+let result = chewieQuote.match(chewieRegex);
+```
+
+# --solutions--
+
+```js
+  let chewieRegex = /Aa*/;
+  let result = chewieQuote.match(chewieRegex);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-ending-string-patterns.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-ending-string-patterns.md
new file mode 100644
index 0000000000..28a0024ffc
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-ending-string-patterns.md
@@ -0,0 +1,65 @@
+---
+id: 587d7db7367417b2b2512b9e
+title: Match Ending String Patterns
+challengeType: 1
+forumTopicId: 301352
+dashedName: match-ending-string-patterns
+---
+
+# --description--
+
+In the last challenge, you learned to use the caret 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 dollar sign character `$` at the end of the regex.
+
+```js
+let theEnding = "This is a never ending story";
+let storyRegex = /story$/;
+storyRegex.test(theEnding);
+let noEnding = "Sometimes a story will have to end";
+storyRegex.test(noEnding);
+```
+
+The first `test` call would return `true`, while the second would return `false`.
+
+# --instructions--
+
+Use the anchor character (`$`) to match the string `caboose` at the end of the string `caboose`.
+
+# --hints--
+
+You should search for `caboose` with the dollar sign `$` anchor in your regex.
+
+```js
+assert(lastRegex.source == 'caboose$');
+```
+
+Your regex should not use any flags.
+
+```js
+assert(lastRegex.flags == '');
+```
+
+You should match `caboose` at the end of the string `The last car on a train is the caboose`
+
+```js
+assert(lastRegex.test('The last car on a train is the caboose'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let caboose = "The last car on a train is the caboose";
+let lastRegex = /change/; // Change this line
+let result = lastRegex.test(caboose);
+```
+
+# --solutions--
+
+```js
+let caboose = "The last car on a train is the caboose";
+let lastRegex = /caboose$/; // Change this line
+let result = lastRegex.test(caboose);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-everything-but-letters-and-numbers.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-everything-but-letters-and-numbers.md
new file mode 100644
index 0000000000..ac2c15b427
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-everything-but-letters-and-numbers.md
@@ -0,0 +1,92 @@
+---
+id: 587d7db8367417b2b2512ba0
+title: Match Everything But Letters and Numbers
+challengeType: 1
+forumTopicId: 301353
+dashedName: match-everything-but-letters-and-numbers
+---
+
+# --description--
+
+You've learned that you can use a shortcut to match alphanumerics `[A-Za-z0-9_]` using `\w`. A natural pattern you might want to search for is the opposite of alphanumerics.
+
+You can search for the opposite of the `\w` with `\W`. Note, the opposite pattern uses a capital letter. This shortcut is the same as `[^A-Za-z0-9_]`.
+
+```js
+let shortHand = /\W/;
+let numbers = "42%";
+let sentence = "Coding!";
+numbers.match(shortHand);
+sentence.match(shortHand);
+```
+
+The first `match` call would return the value `["%"]` and the second would return `["!"]`.
+
+# --instructions--
+
+Use the shorthand character class `\W` to count the number of non-alphanumeric characters in various quotes and strings.
+
+# --hints--
+
+Your regex should use the global flag.
+
+```js
+assert(nonAlphabetRegex.global);
+```
+
+Your regex should find 6 non-alphanumeric characters in the string `The five boxing wizards jump quickly.`.
+
+```js
+assert(
+  'The five boxing wizards jump quickly.'.match(nonAlphabetRegex).length == 6
+);
+```
+
+Your regex should use the shorthand character to match characters which are non-alphanumeric.
+
+```js
+assert(/\\W/.test(nonAlphabetRegex.source));
+```
+
+Your regex should find 8 non-alphanumeric characters in the string `Pack my box with five dozen liquor jugs.`
+
+```js
+assert(
+  'Pack my box with five dozen liquor jugs.'.match(nonAlphabetRegex).length == 8
+);
+```
+
+Your regex should find 6 non-alphanumeric characters in the string `How vexingly quick daft zebras jump!`
+
+```js
+assert(
+  'How vexingly quick daft zebras jump!'.match(nonAlphabetRegex).length == 6
+);
+```
+
+Your regex should find 12 non-alphanumeric characters in the string `123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.`
+
+```js
+assert(
+  '123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.'.match(nonAlphabetRegex)
+    .length == 12
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let quoteSample = "The five boxing wizards jump quickly.";
+let nonAlphabetRegex = /change/; // Change this line
+let result = quoteSample.match(nonAlphabetRegex).length;
+```
+
+# --solutions--
+
+```js
+let quoteSample = "The five boxing wizards_jump quickly.";
+let nonAlphabetRegex = /\W/g; // Change this line
+let result = quoteSample.match(nonAlphabetRegex).length;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-letters-of-the-alphabet.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-letters-of-the-alphabet.md
new file mode 100644
index 0000000000..7e5d5d86e4
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-letters-of-the-alphabet.md
@@ -0,0 +1,71 @@
+---
+id: 587d7db5367417b2b2512b96
+title: Match Letters of the Alphabet
+challengeType: 1
+forumTopicId: 301354
+dashedName: match-letters-of-the-alphabet
+---
+
+# --description--
+
+You saw how you can use <dfn>character sets</dfn> 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 character set, you can define a range of characters to match using a hyphen character: `-`.
+
+For example, to match lowercase letters `a` through `e` you would use `[a-e]`.
+
+```js
+let catStr = "cat";
+let batStr = "bat";
+let matStr = "mat";
+let bgRegex = /[a-e]at/;
+catStr.match(bgRegex);
+batStr.match(bgRegex);
+matStr.match(bgRegex);
+```
+
+In order, the three `match` calls would return the values `["cat"]`, `["bat"]`, and `null`.
+
+# --instructions--
+
+Match all the letters in the string `quoteSample`.
+
+**Note**: Be sure to match both uppercase and lowercase letters.
+
+# --hints--
+
+Your regex `alphabetRegex` should match 35 items.
+
+```js
+assert(result.length == 35);
+```
+
+Your regex `alphabetRegex` should use the global flag.
+
+```js
+assert(alphabetRegex.flags.match(/g/).length == 1);
+```
+
+Your regex `alphabetRegex` should use the case insensitive flag.
+
+```js
+assert(alphabetRegex.flags.match(/i/).length == 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let quoteSample = "The quick brown fox jumps over the lazy dog.";
+let alphabetRegex = /change/; // Change this line
+let result = alphabetRegex; // Change this line
+```
+
+# --solutions--
+
+```js
+let quoteSample = "The quick brown fox jumps over the lazy dog.";
+let alphabetRegex = /[a-z]/gi; // Change this line
+let result = quoteSample.match(alphabetRegex); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-literal-strings.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-literal-strings.md
new file mode 100644
index 0000000000..5cdea6123e
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-literal-strings.md
@@ -0,0 +1,72 @@
+---
+id: 587d7db3367417b2b2512b8f
+title: Match Literal Strings
+challengeType: 1
+forumTopicId: 301355
+dashedName: match-literal-strings
+---
+
+# --description--
+
+In the last challenge, you searched for the word `Hello` using the regular expression `/Hello/`. That regex searched for a literal match of the string `Hello`. Here's another example searching for a literal match of the string `Kevin`:
+
+```js
+let testStr = "Hello, my name is Kevin.";
+let testRegex = /Kevin/;
+testRegex.test(testStr);
+```
+
+This `test` call will return `true`.
+
+Any other forms of `Kevin` will not match. For example, the regex `/Kevin/` will not match `kevin` or `KEVIN`.
+
+```js
+let wrongRegex = /kevin/;
+wrongRegex.test(testStr);
+```
+
+This `test` call will return `false`.
+
+A future challenge will show how to match those other forms as well.
+
+# --instructions--
+
+Complete the regex `waldoRegex` to find `"Waldo"` in the string `waldoIsHiding` with a literal match.
+
+# --hints--
+
+Your regex `waldoRegex` should find the string `Waldo`
+
+```js
+assert(waldoRegex.test(waldoIsHiding));
+```
+
+Your regex `waldoRegex` should not search for anything else.
+
+```js
+assert(!waldoRegex.test('Somewhere is hiding in this text.'));
+```
+
+You should perform a literal string match with your regex.
+
+```js
+assert(!/\/.*\/i/.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let waldoIsHiding = "Somewhere Waldo is hiding in this text.";
+let waldoRegex = /search/; // Change this line
+let result = waldoRegex.test(waldoIsHiding);
+```
+
+# --solutions--
+
+```js
+let waldoIsHiding = "Somewhere Waldo is hiding in this text.";
+let waldoRegex = /Waldo/; // Change this line
+let result = waldoRegex.test(waldoIsHiding);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-non-whitespace-characters.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-non-whitespace-characters.md
new file mode 100644
index 0000000000..a35a8aa487
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-non-whitespace-characters.md
@@ -0,0 +1,78 @@
+---
+id: 587d7db9367417b2b2512ba4
+title: Match Non-Whitespace Characters
+challengeType: 1
+forumTopicId: 18210
+dashedName: match-non-whitespace-characters
+---
+
+# --description--
+
+You learned about searching for whitespace using `\s`, with a lowercase `s`. You can also search for everything except whitespace.
+
+Search for non-whitespace using `\S`, which is an uppercase `s`. 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 `[^ \r\t\f\n\v]`.
+
+```js
+let whiteSpace = "Whitespace. Whitespace everywhere!"
+let nonSpaceRegex = /\S/g;
+whiteSpace.match(nonSpaceRegex).length;
+```
+
+The value returned by the `.length` method would be `32`.
+
+# --instructions--
+
+Change the regex `countNonWhiteSpace` to look for multiple non-whitespace characters in a string.
+
+# --hints--
+
+Your regex should use the global flag.
+
+```js
+assert(countNonWhiteSpace.global);
+```
+
+Your regex should use the shorthand character `\S` to match all non-whitespace characters.
+
+```js
+assert(/\\S/.test(countNonWhiteSpace.source));
+```
+
+Your regex should find 35 non-spaces in the string `Men are from Mars and women are from Venus.`
+
+```js
+assert(
+  'Men are from Mars and women are from Venus.'.match(countNonWhiteSpace)
+    .length == 35
+);
+```
+
+Your regex should find 23 non-spaces in the string `Space: the final frontier.`
+
+```js
+assert('Space: the final frontier.'.match(countNonWhiteSpace).length == 23);
+```
+
+Your regex should find 21 non-spaces in the string `MindYourPersonalSpace`
+
+```js
+assert('MindYourPersonalSpace'.match(countNonWhiteSpace).length == 21);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let sample = "Whitespace is important in separating words";
+let countNonWhiteSpace = /change/; // Change this line
+let result = sample.match(countNonWhiteSpace);
+```
+
+# --solutions--
+
+```js
+let sample = "Whitespace is important in separating words";
+let countNonWhiteSpace = /\S/g; // Change this line
+let result = sample.match(countNonWhiteSpace);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-numbers-and-letters-of-the-alphabet.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-numbers-and-letters-of-the-alphabet.md
new file mode 100644
index 0000000000..bfc04f2661
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-numbers-and-letters-of-the-alphabet.md
@@ -0,0 +1,63 @@
+---
+id: 587d7db5367417b2b2512b97
+title: Match Numbers and Letters of the Alphabet
+challengeType: 1
+forumTopicId: 301356
+dashedName: match-numbers-and-letters-of-the-alphabet
+---
+
+# --description--
+
+Using the hyphen (`-`) to match a range of characters is not limited to letters. It also works to match a range of numbers.
+
+For example, `/[0-5]/` matches any number between `0` and `5`, including the `0` and `5`.
+
+Also, it is possible to combine a range of letters and numbers in a single character set.
+
+```js
+let jennyStr = "Jenny8675309";
+let myRegex = /[a-z0-9]/ig;
+jennyStr.match(myRegex);
+```
+
+# --instructions--
+
+Create a single regex that matches a range of letters between `h` and `s`, and a range of numbers between `2` and `6`. Remember to include the appropriate flags in the regex.
+
+# --hints--
+
+Your regex `myRegex` should match 17 items.
+
+```js
+assert(result.length == 17);
+```
+
+Your regex `myRegex` should use the global flag.
+
+```js
+assert(myRegex.flags.match(/g/).length == 1);
+```
+
+Your regex `myRegex` should use the case insensitive flag.
+
+```js
+assert(myRegex.flags.match(/i/).length == 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let quoteSample = "Blueberry 3.141592653s are delicious.";
+let myRegex = /change/; // Change this line
+let result = myRegex; // Change this line
+```
+
+# --solutions--
+
+```js
+let quoteSample = "Blueberry 3.141592653s are delicious.";
+let myRegex = /[h-s2-6]/gi; // Change this line
+let result = quoteSample.match(myRegex); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-character-with-multiple-possibilities.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-character-with-multiple-possibilities.md
new file mode 100644
index 0000000000..ba055ac4c1
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-character-with-multiple-possibilities.md
@@ -0,0 +1,85 @@
+---
+id: 587d7db5367417b2b2512b95
+title: Match Single Character with Multiple Possibilities
+challengeType: 1
+forumTopicId: 301357
+dashedName: match-single-character-with-multiple-possibilities
+---
+
+# --description--
+
+You learned how to match literal patterns (`/literal/`) and wildcard character (`/./`). 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 <dfn>character classes</dfn>. Character classes allow you to define a group of characters you wish to match by placing them inside square (`[` and `]`) brackets.
+
+For example, you want to match `bag`, `big`, and `bug` but not `bog`. You can create the regex `/b[aiu]g/` to do this. The `[aiu]` is the character class that will only match the characters `a`, `i`, or `u`.
+
+```js
+let bigStr = "big";
+let bagStr = "bag";
+let bugStr = "bug";
+let bogStr = "bog";
+let bgRegex = /b[aiu]g/;
+bigStr.match(bgRegex);
+bagStr.match(bgRegex);
+bugStr.match(bgRegex);
+bogStr.match(bgRegex);
+```
+
+In order, the four `match` calls would return the values `["big"]`, `["bag"]`, `["bug"]`, and `null`.
+
+# --instructions--
+
+Use a character class with vowels (`a`, `e`, `i`, `o`, `u`) in your regex `vowelRegex` to find all the vowels in the string `quoteSample`.
+
+**Note:** Be sure to match both upper- and lowercase vowels.
+
+# --hints--
+
+You should find all 25 vowels.
+
+```js
+assert(result.length == 25);
+```
+
+Your regex `vowelRegex` should use a character class.
+
+```js
+assert(/\[.*\]/.test(vowelRegex.source));
+```
+
+Your regex `vowelRegex` should use the global flag.
+
+```js
+assert(vowelRegex.flags.match(/g/).length == 1);
+```
+
+Your regex `vowelRegex` should use the case insensitive flag.
+
+```js
+assert(vowelRegex.flags.match(/i/).length == 1);
+```
+
+Your regex should not match any consonants.
+
+```js
+assert(!/[b-df-hj-np-tv-z]/gi.test(result.join()));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+```
+
+# --solutions--
+
+```js
+let quoteSample = "Beware of bugs in the above code; I have only proved it correct, not tried it.";
+let vowelRegex = /[aeiou]/gi; // Change this line
+let result = quoteSample.match(vowelRegex); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-characters-not-specified.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-characters-not-specified.md
new file mode 100644
index 0000000000..a0f6672834
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-single-characters-not-specified.md
@@ -0,0 +1,57 @@
+---
+id: 587d7db6367417b2b2512b98
+title: Match Single Characters Not Specified
+challengeType: 1
+forumTopicId: 301358
+dashedName: 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 <dfn>negated character sets</dfn>.
+
+To create a negated character set, you place a caret character (`^`) after the opening bracket and before the characters you do not want to match.
+
+For example, `/[^aeiou]/gi` matches all characters that are not a vowel. Note that characters like `.`, `!`, `[`, `@`, `/` and white space are matched - the negated vowel character set only excludes the vowel characters.
+
+# --instructions--
+
+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.
+
+# --hints--
+
+Your regex `myRegex` should match 9 items.
+
+```js
+assert(result.length == 9);
+```
+
+Your regex `myRegex` should use the global flag.
+
+```js
+assert(myRegex.flags.match(/g/).length == 1);
+```
+
+Your regex `myRegex` should use the case insensitive flag.
+
+```js
+assert(myRegex.flags.match(/i/).length == 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let quoteSample = "3 blind mice.";
+let myRegex = /change/; // Change this line
+let result = myRegex; // Change this line
+```
+
+# --solutions--
+
+```js
+let quoteSample = "3 blind mice.";
+let myRegex = /[^0-9aeiou]/gi; // Change this line
+let result = quoteSample.match(myRegex); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-whitespace.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-whitespace.md
new file mode 100644
index 0000000000..f055b0d4a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/match-whitespace.md
@@ -0,0 +1,77 @@
+---
+id: 587d7db8367417b2b2512ba3
+title: Match Whitespace
+challengeType: 1
+forumTopicId: 301359
+dashedName: 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 `\s`, which is a lowercase `s`. 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 `[ \r\t\f\n\v]`.
+
+```js
+let whiteSpace = "Whitespace. Whitespace everywhere!"
+let spaceRegex = /\s/g;
+whiteSpace.match(spaceRegex);
+```
+
+This `match` call would return `[" ", " "]`.
+# --instructions--
+
+Change the regex `countWhiteSpace` to look for multiple whitespace characters in a string.
+
+# --hints--
+
+Your regex should use the global flag.
+
+```js
+assert(countWhiteSpace.global);
+```
+
+Your regex should use the shorthand character `\s` to match all whitespace characters.
+
+```js
+assert(/\\s/.test(countWhiteSpace.source));
+```
+
+Your regex should find eight spaces in the string `Men are from Mars and women are from Venus.`
+
+```js
+assert(
+  'Men are from Mars and women are from Venus.'.match(countWhiteSpace).length ==
+    8
+);
+```
+
+Your regex should find three spaces in the string `Space: the final frontier.`
+
+```js
+assert('Space: the final frontier.'.match(countWhiteSpace).length == 3);
+```
+
+Your regex should find no spaces in the string `MindYourPersonalSpace`
+
+```js
+assert('MindYourPersonalSpace'.match(countWhiteSpace) == null);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let sample = "Whitespace is important in separating words";
+let countWhiteSpace = /change/; // Change this line
+let result = sample.match(countWhiteSpace);
+```
+
+# --solutions--
+
+```js
+let sample = "Whitespace is important in separating words";
+let countWhiteSpace = /\s/g;
+let result = sample.match(countWhiteSpace);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/positive-and-negative-lookahead.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/positive-and-negative-lookahead.md
new file mode 100644
index 0000000000..0065d0cdf5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/positive-and-negative-lookahead.md
@@ -0,0 +1,114 @@
+---
+id: 587d7dba367417b2b2512ba9
+title: Positive and Negative Lookahead
+challengeType: 1
+forumTopicId: 301360
+dashedName: positive-and-negative-lookahead
+---
+
+# --description--
+
+<dfn>Lookaheads</dfn> 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 lookaheads: <dfn>positive lookahead</dfn> and <dfn>negative lookahead</dfn>.
+
+A positive lookahead 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 `(?=...)` where the `...` is the required part that is not matched.
+
+On the other hand, a negative lookahead will look to make sure the element in the search pattern is not there. A negative lookahead is used as `(?!...)` where the `...` 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.
+
+```js
+let quit = "qu";
+let noquit = "qt";
+let quRegex= /q(?=u)/;
+let qRegex = /q(?!u)/;
+quit.match(quRegex);
+noquit.match(qRegex);
+```
+
+Both of these `match` calls would return `["q"]`.
+
+A more practical use of lookaheads 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:
+
+```js
+let password = "abc123";
+let checkPass = /(?=\w{3,6})(?=\D*\d)/;
+checkPass.test(password);
+```
+
+# --instructions--
+
+Use lookaheads in the `pwRegex` to match passwords that are greater than 5 characters long, and have two consecutive digits.
+
+# --hints--
+
+Your regex should use two positive `lookaheads`.
+
+```js
+assert(pwRegex.source.match(/\(\?=.*?\)\(\?=.*?\)/) !== null);
+```
+
+Your regex should not match the string `astronaut`
+
+```js
+assert(!pwRegex.test('astronaut'));
+```
+
+Your regex should not match the string `banan1`
+
+```js
+assert(!pwRegex.test('banan1'));
+```
+
+Your regex should match the string `bana12`
+
+```js
+assert(pwRegex.test('bana12'));
+```
+
+Your regex should match the string `abc123`
+
+```js
+assert(pwRegex.test('abc123'));
+```
+
+Your regex should not match the string `12345`
+
+```js
+assert(!pwRegex.test('12345'));
+```
+
+Your regex should match the string `8pass99`
+
+```js
+assert(pwRegex.test('8pass99'));
+```
+
+Your regex should not match the string `1a2bcde`
+
+```js
+assert(!pwRegex.test('1a2bcde'));
+```
+
+Your regex should match the string `astr1on11aut`
+
+```js
+assert(pwRegex.test('astr1on11aut'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let sampleWord = "astronaut";
+let pwRegex = /change/; // Change this line
+let result = pwRegex.test(sampleWord);
+```
+
+# --solutions--
+
+```js
+let pwRegex =  /(?=\w{6})(?=\w*\d{2})/;
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/remove-whitespace-from-start-and-end.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/remove-whitespace-from-start-and-end.md
new file mode 100644
index 0000000000..6caed07bf8
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/remove-whitespace-from-start-and-end.md
@@ -0,0 +1,55 @@
+---
+id: 587d7dbb367417b2b2512bac
+title: Remove Whitespace from Start and End
+challengeType: 1
+forumTopicId: 301362
+dashedName: 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.
+
+# --instructions--
+
+Write a regex and use the appropriate string methods to remove whitespace at the beginning and end of strings.
+
+**Note:** The `String.prototype.trim()` method would work here, but you'll need to complete this challenge using regular expressions.
+
+# --hints--
+
+`result` should be equal to the string `Hello, World!`
+
+```js
+assert(result === 'Hello, World!');
+```
+
+Your solution should not use the `String.prototype.trim()` method.
+
+```js
+assert(!code.match(/\.?[\s\S]*?trim/));
+```
+
+The `result` variable should not directly be set to a string
+
+```js
+assert(!code.match(/result\s*=\s*["'`].*?["'`]/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let hello = "   Hello, World!  ";
+let wsRegex = /change/; // Change this line
+let result = hello; // Change this line
+```
+
+# --solutions--
+
+```js
+let hello = "   Hello, World!  ";
+let wsRegex = /^(\s+)(.+[^\s])(\s+)$/;
+let result = hello.replace(wsRegex, '$2');
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/restrict-possible-usernames.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/restrict-possible-usernames.md
new file mode 100644
index 0000000000..e109816c5a
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/restrict-possible-usernames.md
@@ -0,0 +1,123 @@
+---
+id: 587d7db8367417b2b2512ba2
+title: Restrict Possible Usernames
+challengeType: 1
+forumTopicId: 301363
+dashedName: 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) Usernames can only use alpha-numeric characters.
+
+2) The only numbers in the username have to be at the end. There can be zero or more of them at the end. Username cannot start with the number.
+
+3) Username letters can be lowercase and uppercase.
+
+4) Usernames have to be at least two characters long. A two-character username can only use alphabet letters as characters.
+
+# --instructions--
+
+Change the regex `userCheck` to fit the constraints listed above.
+
+# --hints--
+
+Your regex should match the string `JACK`
+
+```js
+assert(userCheck.test('JACK'));
+```
+
+Your regex should not match the string `J`
+
+```js
+assert(!userCheck.test('J'));
+```
+
+Your regex should match the string `Jo`
+
+```js
+assert(userCheck.test('Jo'));
+```
+
+Your regex should match the string `Oceans11`
+
+```js
+assert(userCheck.test('Oceans11'));
+```
+
+Your regex should match the string `RegexGuru`
+
+```js
+assert(userCheck.test('RegexGuru'));
+```
+
+Your regex should not match the string `007`
+
+```js
+assert(!userCheck.test('007'));
+```
+
+Your regex should not match the string `9`
+
+```js
+assert(!userCheck.test('9'));
+```
+
+Your regex should not match the string `A1`
+
+```js
+assert(!userCheck.test('A1'));
+```
+
+Your regex should not match the string `BadUs3rnam3`
+
+```js
+assert(!userCheck.test('BadUs3rnam3'));
+```
+
+Your regex should match the string `Z97`
+
+```js
+assert(userCheck.test('Z97'));
+```
+
+Your regex should not match the string `c57bT3`
+
+```js
+assert(!userCheck.test('c57bT3'));
+```
+
+Your regex should match the string `AB1`
+
+```js
+assert(userCheck.test('AB1'));
+```
+
+Your regex should not match the string `J%4`
+
+```js
+assert(!userCheck.test('J%4'))
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let username = "JackOfAllTrades";
+let userCheck = /change/; // Change this line
+let result = userCheck.test(username);
+```
+
+# --solutions--
+
+```js
+let username = "JackOfAllTrades";
+const userCheck = /^[a-z]([0-9]{2,}|[a-z]+\d*)$/i;
+let result = userCheck.test(username);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/reuse-patterns-using-capture-groups.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/reuse-patterns-using-capture-groups.md
new file mode 100644
index 0000000000..2558509c76
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/reuse-patterns-using-capture-groups.md
@@ -0,0 +1,106 @@
+---
+id: 587d7dbb367417b2b2512baa
+title: Reuse Patterns Using Capture Groups
+challengeType: 1
+forumTopicId: 301364
+dashedName: 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 <dfn>capture groups</dfn>. Parentheses, `(` and `)`, 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 (`\`) and then a number. This number starts at 1 and increases with each additional capture group you use. An example would be `\1` to match the first group.
+
+The example below matches any word that occurs twice separated by a space:
+
+```js
+let repeatStr = "regex regex";
+let repeatRegex = /(\w+)\s\1/;
+repeatRegex.test(repeatStr);
+repeatStr.match(repeatRegex);
+```
+
+The `test` call would return `true`, and the `match` call would return `["regex regex", "regex"]`.
+
+Using the `.match()` method on a string will return an array with the string it matches, along with its capture group.
+
+# --instructions--
+
+Use capture groups in `reRegex` to match a string that consists of only the same number repeated exactly three times separated by single spaces.
+
+# --hints--
+
+Your regex should use the shorthand character class for digits.
+
+```js
+assert(reRegex.source.match(/\\d/));
+```
+
+Your regex should reuse a capture group twice.
+
+```js
+assert(reRegex.source.match(/\\1|\\2/g).length >= 2);
+```
+
+Your regex should match the string `42 42 42`.
+
+```js
+assert(reRegex.test('42 42 42'));
+```
+
+Your regex should match the string `100 100 100`.
+
+```js
+assert(reRegex.test('100 100 100'));
+```
+
+Your regex should not match the string `42 42 42 42`.
+
+```js
+assert.equal('42 42 42 42'.match(reRegex.source), null);
+```
+
+Your regex should not match the string `42 42`.
+
+```js
+assert.equal('42 42'.match(reRegex.source), null);
+```
+
+Your regex should not match the string `101 102 103`.
+
+```js
+assert(!reRegex.test('101 102 103'));
+```
+
+Your regex should not match the string `1 2 3`.
+
+```js
+assert(!reRegex.test('1 2 3'));
+```
+
+Your regex should match the string `10 10 10`.
+
+```js
+assert(reRegex.test('10 10 10'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let repeatNum = "42 42 42";
+let reRegex = /change/; // Change this line
+let result = reRegex.test(repeatNum);
+```
+
+# --solutions--
+
+```js
+let repeatNum = "42 42 42";
+let reRegex = /^(\d+)\s\1\s\1$/;
+let result = reRegex.test(repeatNum);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-exact-number-of-matches.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-exact-number-of-matches.md
new file mode 100644
index 0000000000..427d8d6daf
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-exact-number-of-matches.md
@@ -0,0 +1,92 @@
+---
+id: 587d7db9367417b2b2512ba7
+title: Specify Exact Number of Matches
+challengeType: 1
+forumTopicId: 301365
+dashedName: specify-exact-number-of-matches
+---
+
+# --description--
+
+You can specify the lower and upper number of patterns with quantity specifiers 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 `hah` with the letter `a` `3` times, your regex would be `/ha{3}h/`.
+
+```js
+let A4 = "haaaah";
+let A3 = "haaah";
+let A100 = "h" + "a".repeat(100) + "h";
+let multipleHA = /ha{3}h/;
+multipleHA.test(A4);
+multipleHA.test(A3);
+multipleHA.test(A100);
+```
+
+In order, the three `test` calls would return `false`, `true`, and `false`.
+
+# --instructions--
+
+Change the regex `timRegex` to match the word `Timber` only when it has four letter `m`'s.
+
+# --hints--
+
+Your regex should use curly brackets.
+
+```js
+assert(timRegex.source.match(/{.*?}/).length > 0);
+```
+
+Your regex should not match the string `Timber`
+
+```js
+timRegex.lastIndex = 0;
+assert(!timRegex.test('Timber'));
+```
+
+Your regex should not match the string `Timmber`
+
+```js
+timRegex.lastIndex = 0;
+assert(!timRegex.test('Timmber'));
+```
+
+Your regex should not match the string `Timmmber`
+
+```js
+timRegex.lastIndex = 0;
+assert(!timRegex.test('Timmmber'));
+```
+
+Your regex should match the string `Timmmmber`
+
+```js
+timRegex.lastIndex = 0;
+assert(timRegex.test('Timmmmber'));
+```
+
+Your regex should not match the string `Timber` with 30 `m`'s in it.
+
+```js
+timRegex.lastIndex = 0;
+assert(!timRegex.test('Ti' + 'm'.repeat(30) + 'ber'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let timStr = "Timmmmber";
+let timRegex = /change/; // Change this line
+let result = timRegex.test(timStr);
+```
+
+# --solutions--
+
+```js
+let timStr = "Timmmmber";
+let timRegex = /Tim{4}ber/; // Change this line
+let result = timRegex.test(timStr);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-only-the-lower-number-of-matches.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-only-the-lower-number-of-matches.md
new file mode 100644
index 0000000000..358f095a71
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-only-the-lower-number-of-matches.md
@@ -0,0 +1,93 @@
+---
+id: 587d7db9367417b2b2512ba6
+title: Specify Only the Lower Number of Matches
+challengeType: 1
+forumTopicId: 301366
+dashedName: specify-only-the-lower-number-of-matches
+---
+
+# --description--
+
+You can specify the lower and upper number of patterns with quantity specifiers 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 `hah` with the letter `a` appearing at least `3` times, your regex would be `/ha{3,}h/`.
+
+```js
+let A4 = "haaaah";
+let A2 = "haah";
+let A100 = "h" + "a".repeat(100) + "h";
+let multipleA = /ha{3,}h/;
+multipleA.test(A4);
+multipleA.test(A2);
+multipleA.test(A100);
+```
+
+In order, the three `test` calls would return `true`, `false`, and `true`.
+
+# --instructions--
+
+Change the regex `haRegex` to match the word `Hazzah` only when it has four or more letter `z`'s.
+
+# --hints--
+
+Your regex should use curly brackets.
+
+```js
+assert(haRegex.source.match(/{.*?}/).length > 0);
+```
+
+Your regex should not match the string `Hazzah`
+
+```js
+assert(!haRegex.test('Hazzah'));
+```
+
+Your regex should not match the string `Hazzzah`
+
+```js
+assert(!haRegex.test('Hazzzah'));
+```
+
+Your regex should match the string `Hazzzzah`
+
+```js
+assert('Hazzzzah'.match(haRegex)[0].length === 8);
+```
+
+Your regex should match the string `Hazzzzzah`
+
+```js
+assert('Hazzzzzah'.match(haRegex)[0].length === 9);
+```
+
+Your regex should match the string `Hazzzzzzah`
+
+```js
+assert('Hazzzzzzah'.match(haRegex)[0].length === 10);
+```
+
+Your regex should match the string `Hazzah` with 30 `z`'s in it.
+
+```js
+assert('Hazzzzzzzzzzzzzzzzzzzzzzzzzzzzzzah'.match(haRegex)[0].length === 34);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let haStr = "Hazzzzah";
+let haRegex = /change/; // Change this line
+let result = haRegex.test(haStr);
+```
+
+# --solutions--
+
+```js
+let haStr = "Hazzzzah";
+let haRegex = /Haz{4,}ah/; // Change this line
+let result = haRegex.test(haStr);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-upper-and-lower-number-of-matches.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-upper-and-lower-number-of-matches.md
new file mode 100644
index 0000000000..aac7dedad2
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/specify-upper-and-lower-number-of-matches.md
@@ -0,0 +1,91 @@
+---
+id: 587d7db9367417b2b2512ba5
+title: Specify Upper and Lower Number of Matches
+challengeType: 1
+forumTopicId: 301367
+dashedName: specify-upper-and-lower-number-of-matches
+---
+
+# --description--
+
+Recall that you use the plus sign `+` to look for one or more characters and the asterisk `*` 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 <dfn>quantity specifiers</dfn>. Quantity specifiers are used with curly brackets (`{` and `}`). You put two numbers between the curly brackets - for the lower and upper number of patterns.
+
+For example, to match only the letter `a` appearing between `3` and `5` times in the string `ah`, your regex would be `/a{3,5}h/`.
+
+```js
+let A4 = "aaaah";
+let A2 = "aah";
+let multipleA = /a{3,5}h/;
+multipleA.test(A4);
+multipleA.test(A2);
+```
+
+The first `test` call would return `true`, while the second would return `false`.
+
+# --instructions--
+
+Change the regex `ohRegex` to match the entire phrase `Oh no` only when it has `3` to `6` letter `h`'s.
+
+# --hints--
+
+Your regex should use curly brackets.
+
+```js
+assert(ohRegex.source.match(/{.*?}/).length > 0);
+```
+
+Your regex should not match the string `Ohh no`
+
+```js
+assert(!ohRegex.test('Ohh no'));
+```
+
+Your regex should match the string `Ohhh no`
+
+```js
+assert('Ohhh no'.match(ohRegex)[0].length === 7);
+```
+
+Your regex should match the string `Ohhhh no`
+
+```js
+assert('Ohhhh no'.match(ohRegex)[0].length === 8);
+```
+
+Your regex should match the string `Ohhhhh no`
+
+```js
+assert('Ohhhhh no'.match(ohRegex)[0].length === 9);
+```
+
+Your regex should match the string `Ohhhhhh no`
+
+```js
+assert('Ohhhhhh no'.match(ohRegex)[0].length === 10);
+```
+
+Your regex should not match the string `Ohhhhhhh no`
+
+```js
+assert(!ohRegex.test('Ohhhhhhh no'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let ohStr = "Ohhh no";
+let ohRegex = /change/; // Change this line
+let result = ohRegex.test(ohStr);
+```
+
+# --solutions--
+
+```js
+let ohStr = "Ohhh no";
+let ohRegex = /Oh{3,6} no/; // Change this line
+let result = ohRegex.test(ohStr);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/use-capture-groups-to-search-and-replace.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/use-capture-groups-to-search-and-replace.md
new file mode 100644
index 0000000000..6b1d6b0592
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/use-capture-groups-to-search-and-replace.md
@@ -0,0 +1,88 @@
+---
+id: 587d7dbb367417b2b2512bab
+title: Use Capture Groups to Search and Replace
+challengeType: 1
+forumTopicId: 301368
+dashedName: 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 `.replace()` on a string. The inputs for `.replace()` 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.
+
+```js
+let wrongText = "The sky is silver.";
+let silverRegex = /silver/;
+wrongText.replace(silverRegex, "blue");
+```
+
+The `replace` call would return the string `The sky is blue.`.
+
+You can also access capture groups in the replacement string with dollar signs (`$`).
+
+```js
+"Code Camp".replace(/(\w+)\s(\w+)/, '$2 $1');
+```
+
+The `replace` call would return the string `Camp Code`.
+
+# --instructions--
+
+Write a regex `fixRegex` using three capture groups that will search for each word in the string `one two three`. Then update the `replaceText` variable to replace `one two three` with the string `three two one` and assign the result to the `result` variable. Make sure you are utilizing capture groups in the replacement string using the dollar sign (`$`) syntax.
+
+# --hints--
+
+You should use `.replace()` to search and replace.
+
+```js
+assert(code.match(/\.replace\(.*\)/));
+```
+
+Your regex should change the string `one two three` to the string `three two one`
+
+```js
+assert(result === 'three two one');
+```
+
+You should not change the last line.
+
+```js
+assert(code.match(/result\s*=\s*str\.replace\(.*?\)/));
+```
+
+`fixRegex` should use at least three capture groups.
+
+```js
+assert(new RegExp(fixRegex.source + '|').exec('').length - 1 >= 3);
+```
+
+`replaceText` should use parenthesized submatch string(s) (i.e. the nth parenthesized submatch string, $n, corresponds to the nth capture group).
+
+```js
+{
+  const re = /(\$\d{1,2})+(?:[\D]|\b)/g;
+  assert(replaceText.match(re).length >= 3);
+}
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let str = "one two three";
+let fixRegex = /change/; // Change this line
+let replaceText = ""; // Change this line
+let result = str.replace(fixRegex, replaceText);
+```
+
+# --solutions--
+
+```js
+let str = "one two three";
+let fixRegex = /(\w+) (\w+) (\w+)/g; // Change this line
+let replaceText = "$3 $2 $1"; // Change this line
+let result = str.replace(fixRegex, replaceText);
+```
diff --git a/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/using-the-test-method.md b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/using-the-test-method.md
new file mode 100644
index 0000000000..dddb321ec5
--- /dev/null
+++ b/curriculum/challenges/portuguese/02-javascript-algorithms-and-data-structures/regular-expressions/using-the-test-method.md
@@ -0,0 +1,59 @@
+---
+id: 587d7db3367417b2b2512b8e
+title: Using the Test Method
+challengeType: 1
+forumTopicId: 301369
+dashedName: 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 `the` in the string `The dog chased the cat`, you could use the following regular expression: `/the/`. 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 `.test()` method. The `.test()` method takes the regex, applies it to a string (which is placed inside the parentheses), and returns `true` or `false` if your pattern finds something or not.
+
+```js
+let testStr = "freeCodeCamp";
+let testRegex = /Code/;
+testRegex.test(testStr);
+```
+
+The `test` method here returns `true`.
+
+# --instructions--
+
+Apply the regex `myRegex` on the string `myString` using the `.test()` method.
+
+# --hints--
+
+You should use `.test()` to test the regex.
+
+```js
+assert(code.match(/myRegex.test\(\s*myString\s*\)/));
+```
+
+Your result should return `true`.
+
+```js
+assert(result === true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+let myString = "Hello, World!";
+let myRegex = /Hello/;
+let result = myRegex; // Change this line
+```
+
+# --solutions--
+
+```js
+let myString = "Hello, World!";
+let myRegex = /Hello/;
+let result = myRegex.test(myString); // Change this line
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
new file mode 100644
index 0000000000..2326bddd3c
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-elements-within-your-bootstrap-wells.md
@@ -0,0 +1,90 @@
+---
+id: bad87fee1348bd9aec908849
+title: Add Elements within Your Bootstrap Wells
+challengeType: 0
+forumTopicId: 16636
+dashedName: add-elements-within-your-bootstrap-wells
+---
+
+# --description--
+
+Now we're several `div` elements deep on each column of our row. This is as deep as we'll need to go. Now we can add our `button` elements.
+
+Nest three `button` elements within each of your `div` elements having the class name `well`.
+
+# --hints--
+
+Three `button` elements should be nested within each of your `div` elements with class `well`.
+
+```js
+assert(
+  $('div.well:eq(0)').children('button').length === 3 &&
+    $('div.well:eq(1)').children('button').length === 3
+);
+```
+
+You should have a total of 6 `button` elements.
+
+```js
+assert($('button') && $('button').length > 5);
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
new file mode 100644
index 0000000000..9c9a200e02
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-all-of-our-buttons.md
@@ -0,0 +1,177 @@
+---
+id: bad87fee1348bd9aedc08845
+title: Add Font Awesome Icons to all of our Buttons
+challengeType: 0
+forumTopicId: 16637
+required:
+  - link: 'https://use.fontawesome.com/releases/v5.8.1/css/all.css'
+    raw: true
+dashedName: add-font-awesome-icons-to-all-of-our-buttons
+---
+
+# --description--
+
+Font Awesome is a convenient library of icons. These icons can be web fonts or vector graphics. 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.
+
+# --instructions--
+
+Use Font Awesome to add an `info-circle` icon to your info button and a `trash` icon to your delete button.
+
+**Note:** The `span` element is an acceptable alternative to the `i` element for the directions below.
+
+# --hints--
+
+You should add a `<i class="fas fa-info-circle"></i>` within your `info` button element.
+
+```js
+assert(
+  $('.btn-info > i').is('.fas.fa-info-circle') ||
+    $('.btn-info > span').is('.fas.fa-info-circle')
+);
+```
+
+You should add a `<i class="fas fa-trash"></i>` within your `delete` button element.
+
+```js
+assert(
+  $('.btn-danger > i').is('.fas.fa-trash') ||
+    $('.btn-danger > span').is('.fas.fa-trash')
+);
+```
+
+Each of your `i` elements should have a closing tag and `<i class="fas fa-thumbs-up"></i>` is in your `like` button element.
+
+```js
+assert(
+  code.match(/<\/i>|<\/span/g) &&
+    code.match(/<\/i|<\/span>/g).length > 2 &&
+    ($('.btn-primary > i').is('.fas.fa-thumbs-up') ||
+      $('.btn-primary > span').is('.fas.fa-thumbs-up'))
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="fas 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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="fas fa-thumbs-up"></i> Like</button>
+    </div>
+    <div class="col-xs-4">
+      <button class="btn btn-block btn-info"><i class="fas fa-info-circle"></i> Info</button>
+    </div>
+    <div class="col-xs-4">
+      <button class="btn btn-block btn-danger"><i class="fas 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
new file mode 100644
index 0000000000..bda1cf6d31
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-font-awesome-icons-to-our-buttons.md
@@ -0,0 +1,194 @@
+---
+id: bad87fee1348bd9aedd08845
+title: Add Font Awesome Icons to our Buttons
+challengeType: 0
+forumTopicId: 16638
+required:
+  - link: 'https://use.fontawesome.com/releases/v5.8.1/css/all.css'
+    raw: true
+dashedName: add-font-awesome-icons-to-our-buttons
+---
+
+# --description--
+
+Font Awesome is a convenient library of icons. These icons can be webfonts or vector graphics. 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:
+
+```html
+<link rel="stylesheet" href="https://use.fontawesome.com/releases/v5.8.1/css/all.css" integrity="sha384-50oBUHEmvpQ+1lW4y57PTFmhCaXp0ML5d60M1M7uH2+nqUivzIebhndOJK28anvf" crossorigin="anonymous">
+```
+
+In this case, we've already added it for you to this page behind the scenes.
+
+The `i` 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 `i` element to turn it into an icon, for example:
+
+```html
+<i class="fas fa-info-circle"></i>
+```
+
+Note that the `span` element is also acceptable for use with icons.
+
+# --instructions--
+
+Use Font Awesome to add a `thumbs-up` icon to your like button by giving it an `i` element with the classes `fas` and `fa-thumbs-up`. Make sure to keep the text `Like` next to the icon.
+
+# --hints--
+
+You should add an `i` element with the classes `fas` and `fa-thumbs-up`.
+
+```js
+assert($('i').is('.fas.fa-thumbs-up') || $('span').is('.fas.fa-thumbs-up'));
+```
+
+Your `fa-thumbs-up` icon should be located within the Like button.
+
+```js
+assert(
+  ($('i.fa-thumbs-up').parent().text().match(/Like/gi) &&
+    $('.btn-primary > i').is('.fas.fa-thumbs-up')) ||
+    ($('span.fa-thumbs-up').parent().text().match(/Like/gi) &&
+      $('.btn-primary > span').is('.fas.fa-thumbs-up'))
+);
+```
+
+Your `i` element should be nested within your `button` element.
+
+```js
+assert(
+  $('button').children('i').length > 0 ||
+    $('button').children('span').length > 0
+);
+```
+
+Your icon element should have a closing tag.
+
+```js
+assert(code.match(/<\/i>|<\/span>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="fas 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
new file mode 100644
index 0000000000..66b46cd625
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/add-id-attributes-to-bootstrap-elements.md
@@ -0,0 +1,93 @@
+---
+id: bad87fee1348bd9aec908853
+title: Add id Attributes to Bootstrap Elements
+challengeType: 0
+forumTopicId: 16639
+dashedName: add-id-attributes-to-bootstrap-elements
+---
+
+# --description--
+
+Recall that in addition to class attributes, you can give each of your elements an `id` 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 `div` elements of class `well`.
+
+Remember that you can give an element an id like this:
+
+```html
+<div class="well" id="center-well">
+```
+
+Give the well on the left the id of `left-well`. Give the well on the right the id of `right-well`.
+
+# --hints--
+
+Your left `well` should have the id of `left-well`.
+
+```js
+assert(
+  $('.col-xs-6').children('#left-well') &&
+    $('.col-xs-6').children('#left-well').length > 0
+);
+```
+
+Your right `well` should have the id of `right-well`.
+
+```js
+assert(
+  $('.col-xs-6').children('#right-well') &&
+    $('.col-xs-6').children('#right-well').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
new file mode 100644
index 0000000000..4ec8c688fc
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/apply-the-default-bootstrap-button-style.md
@@ -0,0 +1,77 @@
+---
+id: bad87fee1348bd9aec908850
+title: Apply the Default Bootstrap Button Style
+challengeType: 0
+forumTopicId: 16657
+dashedName: apply-the-default-bootstrap-button-style
+---
+
+# --description--
+
+Bootstrap has another button class called `btn-default`.
+
+Apply both the `btn` and `btn-default` classes to each of your `button` elements.
+
+# --hints--
+
+You should apply the `btn` class to each of your `button` elements.
+
+```js
+assert($('.btn').length > 5);
+```
+
+You should apply the `btn-default` class to each of your `button` elements.
+
+```js
+assert($('.btn-default').length > 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
new file mode 100644
index 0000000000..50f3b1dbd7
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/call-out-optional-actions-with-btn-info.md
@@ -0,0 +1,175 @@
+---
+id: bad87fee1348cd8acef08813
+title: Call out Optional Actions with btn-info
+challengeType: 0
+forumTopicId: 16770
+dashedName: call-out-optional-actions-with-btn-info
+---
+
+# --description--
+
+Bootstrap comes with several pre-defined colors for buttons. The `btn-info` 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 `btn-info` and `btn-block` classes to it.
+
+Note that these buttons still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+You should create a new `button` element with the text `Info`.
+
+```js
+assert(new RegExp('info', 'gi').test($('button').text()));
+```
+
+Both of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+
+```js
+assert($('button.btn-block.btn').length > 1);
+```
+
+Your new button should have the class `btn-info`.
+
+```js
+assert($('button').hasClass('btn-info'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
new file mode 100644
index 0000000000..9aeceadaa1
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/center-text-with-bootstrap.md
@@ -0,0 +1,157 @@
+---
+id: bad87fee1348bd8acde08812
+title: Center Text with Bootstrap
+challengeType: 0
+forumTopicId: 16771
+dashedName: 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 `text-center` to our `h2` element.
+
+Remember that you can add several classes to the same element by separating each of them with a space, like this:
+
+```html
+<h2 class="red-text text-center">your text</h2>
+```
+
+# --hints--
+
+Your `h2` element should be centered by applying the class `text-center`
+
+```js
+assert($('h2').hasClass('text-center'));
+```
+
+Your `h2` element should still have the class `red-text`
+
+```js
+assert($('h2').hasClass('red-text'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
new file mode 100644
index 0000000000..1573a5fc26
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-block-element-bootstrap-button.md
@@ -0,0 +1,185 @@
+---
+id: bad87fee1348cd8acef08812
+title: Create a Block Element Bootstrap Button
+challengeType: 0
+forumTopicId: 16810
+dashedName: create-a-block-element-bootstrap-button
+---
+
+# --description--
+
+Normally, your `button` elements with the `btn` and `btn-default` classes are only as wide as the text that they contain. For example:
+
+```html
+<button class="btn btn-default">Submit</button>
+```
+
+This button would only be as wide as the word `Submit`.
+
+<button class='btn btn-default'>Submit</button>
+
+By making them block elements with the additional class of `btn-block`, 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.
+
+```html
+<button class="btn btn-default btn-block">Submit</button>
+```
+
+This button would take up 100% of the available width.
+
+<button class='btn btn-default btn-block'>Submit</button>
+
+Note that these buttons still need the `btn` class.
+
+Add Bootstrap's `btn-block` class to your Bootstrap button.
+
+# --hints--
+
+Your button should still have the `btn` and `btn-default` classes.
+
+```js
+assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
+```
+
+Your button should have the class `btn-block`.
+
+```js
+assert($('button').hasClass('btn-block'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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-default">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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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-default">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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
new file mode 100644
index 0000000000..3014dc6931
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-button.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348cd8acdf08812
+title: Create a Bootstrap Button
+challengeType: 0
+forumTopicId: 16811
+dashedName: create-a-bootstrap-button
+---
+
+# --description--
+
+Bootstrap has its own styles for `button` elements, which look much better than the plain HTML ones.
+
+Create a new `button` element below your large kitten photo. Give it the `btn` and `btn-default` classes, as well as the text of `Like`.
+
+# --hints--
+
+You should create a new `button` element with the text `Like`.
+
+```js
+assert(
+  new RegExp('like', 'gi').test($('button').text()) &&
+    $('img.img-responsive + button.btn').length > 0
+);
+```
+
+Your new button should have two classes: `btn` and `btn-default`.
+
+```js
+assert($('button').hasClass('btn') && $('button').hasClass('btn-default'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<html>
+<head>
+<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css">
+<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>
+</head>
+<body>
+<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.">
+
+   <!-- ADD Bootstrap Styled Button -->
+  <button class="btn btn-default">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="https://freecatphotoapp.com/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>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
new file mode 100644
index 0000000000..5292646446
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-headline.md
@@ -0,0 +1,67 @@
+---
+id: bad87fee1348bd9aec908846
+title: Create a Bootstrap Headline
+challengeType: 0
+forumTopicId: 16812
+dashedName: 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 `h3` element, with the text `jQuery Playground`.
+
+Color your `h3` element with the `text-primary` Bootstrap class, and center it with the `text-center` Bootstrap class.
+
+# --hints--
+
+You should add an `h3` element to your page.
+
+```js
+assert($('h3') && $('h3').length > 0);
+```
+
+Your `h3` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/h3>/g) &&
+    code.match(/<h3/g) &&
+    code.match(/<\/h3>/g).length === code.match(/<h3/g).length
+);
+```
+
+Your `h3` element should be colored by applying the class `text-primary`
+
+```js
+assert($('h3').hasClass('text-primary'));
+```
+
+Your `h3` element should be centered by applying the class `text-center`
+
+```js
+assert($('h3').hasClass('text-center'));
+```
+
+Your `h3` element should have the text `jQuery Playground`.
+
+```js
+assert.isTrue(/jquery(\s)+playground/gi.test($('h3').text()));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+
+```
+
+# --solutions--
+
+```html
+<h3 class="text-primary text-center">jQuery Playground</h3>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
new file mode 100644
index 0000000000..3a5ff315bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-bootstrap-row.md
@@ -0,0 +1,68 @@
+---
+id: bad87fee1348bd9bec908846
+title: Create a Bootstrap Row
+challengeType: 0
+forumTopicId: 16813
+dashedName: create-a-bootstrap-row
+---
+
+# --description--
+
+Now we'll create a Bootstrap row for our inline elements.
+
+Create a `div` element below the `h3` tag, with a class of `row`.
+
+# --hints--
+
+You should add a `div` element below your `h3` element.
+
+```js
+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
+);
+```
+
+Your `div` element should have the class `row`
+
+```js
+assert($('div').hasClass('row'));
+```
+
+Your `row div` should be nested inside the `container-fluid div`
+
+```js
+assert($('div.container-fluid div.row').length > 0);
+```
+
+Your `div` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+
+</div>
+```
+
+# --solutions--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+  <div class="row"></div>
+</div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
new file mode 100644
index 0000000000..eaea933735
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-class-to-target-with-jquery-selectors.md
@@ -0,0 +1,71 @@
+---
+id: bad87fee1348bd9aec908852
+title: Create a Class to Target with jQuery Selectors
+challengeType: 0
+forumTopicId: 16815
+dashedName: 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 `button` elements the class `target`.
+
+# --hints--
+
+You should apply the `target` class to each of your `button` elements.
+
+```js
+assert($('.target').length > 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+      </div>
+    </div>
+    <div class="col-xs-6">
+      <div class="well">
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+        <button class="target btn btn-default"></button>
+      </div>
+    </div>
+  </div>
+</div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-custom-heading.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-custom-heading.md
new file mode 100644
index 0000000000..646afcbe0f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-a-custom-heading.md
@@ -0,0 +1,177 @@
+---
+id: bad87fee1348bd9aede08845
+title: Create a Custom Heading
+challengeType: 0
+forumTopicId: 16816
+dashedName: 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 `div` element.
+
+Nest your first image and your `h2` element within a single `<div class="row">` element. Nest your `h2` element within a `<div class="col-xs-8">` and your image in a `<div class="col-xs-4">` so that they are on the same line.
+
+Notice how the image is now just the right size to fit along the text?
+
+# --hints--
+
+Your `h2` element and topmost `img` element should both be nested together within a `div` element with the class `row`.
+
+```js
+assert($('div.row:has(h2)').length > 0 && $('div.row:has(img)').length > 0);
+```
+
+Your topmost `img` element should be nested within a `div` with the class `col-xs-4`.
+
+```js
+assert(
+  $('div.col-xs-4:has(img)').length > 0 &&
+    $('div.col-xs-4:has(div)').length === 0
+);
+```
+
+Your `h2` element should be nested within a `div` with the class `col-xs-8`.
+
+```js
+assert(
+  $('div.col-xs-8:has(h2)').length > 0 &&
+    $('div.col-xs-8:has(div)').length === 0
+);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-bootstrap-wells.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
new file mode 100644
index 0000000000..47de1536d6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/create-bootstrap-wells.md
@@ -0,0 +1,71 @@
+---
+id: bad87fee1348bd9aec908848
+title: Create Bootstrap Wells
+challengeType: 0
+forumTopicId: 16825
+dashedName: create-bootstrap-wells
+---
+
+# --description--
+
+Bootstrap has a class called `well` that can create a visual sense of depth for your columns.
+
+Nest one `div` element with the class `well` within each of your `col-xs-6` `div` elements.
+
+# --hints--
+
+You should add a `div` element with the class `well` inside each of your `div` elements with the class `col-xs-6`
+
+```js
+assert($('div.col-xs-6').not(':has(>div.well)').length < 1);
+```
+
+Both of your `div` elements with the class `col-xs-6` should be nested within your `div` element with the class `row`.
+
+```js
+assert($('div.row > div.col-xs-6').length > 1);
+```
+
+All your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
new file mode 100644
index 0000000000..76a1bffcd7
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/ditch-custom-css-for-bootstrap.md
@@ -0,0 +1,188 @@
+---
+id: bad87fee1347bd9aedf08845
+title: Ditch Custom CSS for Bootstrap
+challengeType: 0
+forumTopicId: 17565
+dashedName: 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 `.red-text`, `p`, and `.smaller-image` CSS declarations from your `style` element so that the only declarations left in your `style` element are `h2` and `thick-green-border`.
+
+Then delete the `p` element that contains a dead link. Then remove the `red-text` class from your `h2` element and replace it with the `text-primary` Bootstrap class.
+
+Finally, remove the `smaller-image` class from your first `img` element and replace it with the `img-responsive` class.
+
+# --hints--
+
+Your `h2` element should no longer have the class `red-text`.
+
+```js
+assert(!$('h2').hasClass('red-text'));
+```
+
+Your `h2` element should now have the class `text-primary`.
+
+```js
+assert($('h2').hasClass('text-primary'));
+```
+
+Your paragraph elements should no longer use the font `Monospace`.
+
+```js
+assert(
+  !$('p')
+    .css('font-family')
+    .match(/monospace/i)
+);
+```
+
+The `smaller-image` class should be removed from your top image.
+
+```js
+assert(!$('img').hasClass('smaller-image'));
+```
+
+You should add the `img-responsive` class to your top image.
+
+```js
+assert($('.img-responsive').length > 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
new file mode 100644
index 0000000000..290766d634
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/give-each-element-a-unique-id.md
@@ -0,0 +1,125 @@
+---
+id: bad87fee1348bd9aec908855
+title: Give Each Element a Unique id
+challengeType: 0
+forumTopicId: 18191
+dashedName: 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 `target1` and ending with `target6`.
+
+Make sure that `target1` to `target3` are in `#left-well`, and `target4` to `target6` are in `#right-well`.
+
+# --hints--
+
+One `button` element should have the id `target1`.
+
+```js
+assert(
+  $('#left-well').children('#target1') &&
+    $('#left-well').children('#target1').length > 0
+);
+```
+
+One `button` element should have the id `target2`.
+
+```js
+assert(
+  $('#left-well').children('#target2') &&
+    $('#left-well').children('#target2').length > 0
+);
+```
+
+One `button` element should have the id `target3`.
+
+```js
+assert(
+  $('#left-well').children('#target3') &&
+    $('#left-well').children('#target3').length > 0
+);
+```
+
+One `button` element should have the id `target4`.
+
+```js
+assert(
+  $('#right-well').children('#target4') &&
+    $('#right-well').children('#target4').length > 0
+);
+```
+
+One `button` element should have the id `target5`.
+
+```js
+assert(
+  $('#right-well').children('#target5') &&
+    $('#right-well').children('#target5').length > 0
+);
+```
+
+One `button` element should have the id `target6`.
+
+```js
+assert(
+  $('#right-well').children('#target6') &&
+    $('#right-well').children('#target6').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
new file mode 100644
index 0000000000..452f52ab47
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/house-our-page-within-a-bootstrap-container-fluid-div.md
@@ -0,0 +1,53 @@
+---
+id: bad87fee1348bd9aec908746
+title: House our page within a Bootstrap container-fluid div
+challengeType: 0
+forumTopicId: 18198
+dashedName: 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 `h3` element within a `div` element with the class `container-fluid`.
+
+# --hints--
+
+Your `div` element should have the class `container-fluid`.
+
+```js
+assert($('div').hasClass('container-fluid'));
+```
+
+Each of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+Your `h3` element should be nested inside a `div` element.
+
+```js
+assert($('div').children('h3').length > 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<h3 class="text-primary text-center">jQuery Playground</h3>
+```
+
+# --solutions--
+
+```html
+<div class="container-fluid">
+    <h3 class="text-primary text-center">jQuery Playground</h3>
+</div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
new file mode 100644
index 0000000000..6d995aa318
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-buttons.md
@@ -0,0 +1,105 @@
+---
+id: bad87fee1348bd9aec908856
+title: Label Bootstrap Buttons
+challengeType: 0
+forumTopicId: 18222
+dashedName: label-bootstrap-buttons
+---
+
+# --description--
+
+Just like we labeled our wells, we want to label our buttons.
+
+Give each of your `button` elements text that corresponds to its id selector.
+
+# --hints--
+
+Your `button` element with the id `target1` should have the text `#target1`.
+
+```js
+assert(new RegExp('#target1', 'gi').test($('#target1').text()));
+```
+
+Your `button` element with the id `target2` should have the text `#target2`.
+
+```js
+assert(new RegExp('#target2', 'gi').test($('#target2').text()));
+```
+
+Your `button` element with the id `target3` should have the text `#target3`.
+
+```js
+assert(new RegExp('#target3', 'gi').test($('#target3').text()));
+```
+
+Your `button` element with the id `target4` should have the text `#target4`.
+
+```js
+assert(new RegExp('#target4', 'gi').test($('#target4').text()));
+```
+
+Your `button` element with the id `target5` should have the text `#target5`.
+
+```js
+assert(new RegExp('#target5', 'gi').test($('#target5').text()));
+```
+
+Your `button` element with the id `target6` should have the text `#target6`.
+
+```js
+assert(new RegExp('#target6', 'gi').test($('#target6').text()));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-wells.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
new file mode 100644
index 0000000000..cae4c4837f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/label-bootstrap-wells.md
@@ -0,0 +1,101 @@
+---
+id: bad87fee1348bd9aec908854
+title: Label Bootstrap Wells
+challengeType: 0
+forumTopicId: 18223
+dashedName: 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 `col-xs-6` `div` element, add a `h4` element with the text `#left-well`.
+
+Above your right-well, inside its `col-xs-6` `div` element, add a `h4` element with the text `#right-well`.
+
+# --hints--
+
+You should add an `h4` element to each of your `<div class="col-xs-6">` elements.
+
+```js
+assert(
+  $('.col-xs-6').children('h4') && $('.col-xs-6').children('h4').length > 1
+);
+```
+
+One `h4` element should have the text `#left-well`.
+
+```js
+assert(new RegExp('#left-well', 'gi').test($('h4').text()));
+```
+
+One `h4` element should have the text `#right-well`.
+
+```js
+assert(new RegExp('#right-well', 'gi').test($('h4').text()));
+```
+
+All of your `h4` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/h4>/g) &&
+    code.match(/<h4/g) &&
+    code.match(/<\/h4>/g).length === code.match(/<h4/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
new file mode 100644
index 0000000000..426dad2cb4
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/line-up-form-elements-responsively-with-bootstrap.md
@@ -0,0 +1,214 @@
+---
+id: bad87fee1348bd9aec908845
+title: Line up Form Elements Responsively with Bootstrap
+challengeType: 0
+forumTopicId: 18225
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: line-up-form-elements-responsively-with-bootstrap
+---
+
+# --description--
+
+Now let's get your form `input` and your submission `button` on the same line. We'll do this the same way we have previously: by using a `div` element with the class `row`, and other `div` elements within it using the `col-xs-*` class.
+
+Nest both your form's text `input` and submit `button` within a `div` with the class `row`. Nest your form's text `input` within a div with the class of `col-xs-7`. Nest your form's submit `button` in a `div` with the class `col-xs-5`.
+
+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!
+
+# --hints--
+
+Your form submission button and text input should be nested in a div with class `row`.
+
+```js
+assert(
+  $('div.row:has(input[type="text"])').length > 0 &&
+    $('div.row:has(button[type="submit"])').length > 0
+);
+```
+
+Your form text input should be nested in a div with the class `col-xs-7`.
+
+```js
+assert($('div.col-xs-7:has(input[type="text"])').length > 0);
+```
+
+Your form submission button should be nested in a div with the class `col-xs-5`.
+
+```js
+assert($('div.col-xs-5:has(button[type="submit"])').length > 0);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+    <div class="row">
+      <div class="col-xs-7">
+        <input type="text" class="form-control" placeholder="cat photo URL" required>
+      </div>
+      <div class="col-xs-5">
+        <button type="submit" class="btn btn-primary"><i class="fa fa-paper-plane"></i> Submit</button>
+      </div>
+    </div>
+  </form>
+</div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
new file mode 100644
index 0000000000..54c1ec8e26
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/make-images-mobile-responsive.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348bd9acde08812
+title: Make Images Mobile Responsive
+challengeType: 0
+forumTopicId: 18232
+dashedName: make-images-mobile-responsive
+---
+
+# --description--
+
+First, add a new image below the existing one. Set its `src` attribute to `https://bit.ly/fcc-running-cats`.
+
+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 `img-responsive` class to your image. Do this, and the image should perfectly fit the width of your page.
+
+# --hints--
+
+You should have a total of two images.
+
+```js
+assert($('img').length === 2);
+```
+
+Your new image should be below your old one and have the class `img-responsive`.
+
+```js
+assert($('img:eq(1)').hasClass('img-responsive'));
+```
+
+Your new image should not have the class `smaller-image`.
+
+```js
+assert(!$('img:eq(1)').hasClass('smaller-image'));
+```
+
+Your new image should have a `src` of `https://bit.ly/fcc-running-cats`.
+
+```js
+assert($('img:eq(1)').attr('src') === 'https://bit.ly/fcc-running-cats');
+```
+
+Your new `img` element should have a closing angle bracket.
+
+```js
+assert(
+  code.match(/<img/g) &&
+    code.match(/<img[^<]*>/g).length === 2 &&
+    code.match(/<img/g).length === 2
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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">
+
+  <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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
new file mode 100644
index 0000000000..33c062bdf5
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-checkboxes.md
@@ -0,0 +1,191 @@
+---
+id: bad87fee1348bd9aeda08845
+title: Responsively Style Checkboxes
+challengeType: 0
+forumTopicId: 18269
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: responsively-style-checkboxes
+---
+
+# --description--
+
+Since Bootstrap's `col-xs-*` classes are applicable to all `form` elements, you can use them on your checkboxes too! This way, the checkboxes will be evenly spread out across the page, regardless of how wide the screen resolution is.
+
+# --instructions--
+
+Nest all three of your checkboxes in a `<div class="row">` element. Then nest each of them in a `<div class="col-xs-4">` element.
+
+# --hints--
+
+All of your checkboxes should be nested inside one `div` with the class `row`.
+
+```js
+assert($('div.row:has(input[type="checkbox"])').length > 0);
+```
+
+Each of your checkboxes should be nested inside its own `div` with the class `col-xs-4`.
+
+```js
+assert($('div.col-xs-4:has(input[type="checkbox"])').length > 2);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
new file mode 100644
index 0000000000..b2ec1682b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/responsively-style-radio-buttons.md
@@ -0,0 +1,175 @@
+---
+id: bad87fee1348bd9aedb08845
+title: Responsively Style Radio Buttons
+challengeType: 0
+forumTopicId: 18270
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: responsively-style-radio-buttons
+---
+
+# --description--
+
+You can use Bootstrap's `col-xs-*` classes on `form` 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 `<div class="row">` element. Then nest each of them within a `<div class="col-xs-6">` element.
+
+**Note:** As a reminder, radio buttons are `input` elements of type `radio`.
+
+# --hints--
+
+All of your radio buttons should be nested inside one `div` with the class `row`.
+
+```js
+assert($('div.row:has(input[type="radio"])').length > 0);
+```
+
+Each of your radio buttons should be nested inside its own `div` with the class `col-xs-6`.
+
+```js
+assert($('div.col-xs-6:has(input[type="radio"])').length > 1);
+```
+
+All of your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
new file mode 100644
index 0000000000..440c9a7740
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/split-your-bootstrap-row.md
@@ -0,0 +1,57 @@
+---
+id: bad87fee1348bd9aec908847
+title: Split Your Bootstrap Row
+challengeType: 0
+forumTopicId: 18306
+dashedName: 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 `div` elements within your row, both with the class `col-xs-6`.
+
+# --hints--
+
+Two `div class="col-xs-6"` elements should be nested within your `div class="row"` element.
+
+```js
+assert($('div.row > div.col-xs-6').length > 1);
+```
+
+All your `div` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<div class="container-fluid">
+  <h3 class="text-primary text-center">jQuery Playground</h3>
+  <div class="row">
+
+
+  </div>
+</div>
+```
+
+# --solutions--
+
+```html
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
new file mode 100644
index 0000000000..ddbc6ab0ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/style-text-inputs-as-form-controls.md
@@ -0,0 +1,201 @@
+---
+id: bad87fee1348bd9aed908845
+title: Style Text Inputs as Form Controls
+challengeType: 0
+forumTopicId: 18312
+required:
+  - link: >-
+      https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css
+    raw: true
+dashedName: style-text-inputs-as-form-controls
+---
+
+# --description--
+
+You can add the `fa-paper-plane` Font Awesome icon by adding `<i class="fa fa-paper-plane"></i>` within your submit `button` element.
+
+Give your form's text input field a class of `form-control`. Give your form's submit button the classes `btn btn-primary`. Also give this button the Font Awesome icon of `fa-paper-plane`.
+
+All textual `<input>`, `<textarea>`, and `<select>` elements with the class `.form-control` have a width of 100%.
+
+# --hints--
+
+The submit button in your form should have the classes `btn btn-primary`.
+
+```js
+assert($('button[type="submit"]').hasClass('btn btn-primary'));
+```
+
+You should add a `<i class="fa fa-paper-plane"></i>` within your submit `button` element.
+
+```js
+assert($('button[type="submit"]:has(i.fa.fa-paper-plane)').length > 0);
+```
+
+The text `input` in your form should have the class `form-control`.
+
+```js
+assert($('input[type="text"]').hasClass('form-control'));
+```
+
+Each of your `i` elements should have a closing tag.
+
+```js
+assert(code.match(/<\/i>/g) && code.match(/<\/i/g).length > 3);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
new file mode 100644
index 0000000000..a3e9e1b9ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/taste-the-bootstrap-button-color-rainbow.md
@@ -0,0 +1,167 @@
+---
+id: bad87fee1348cd8acef08811
+title: Taste the Bootstrap Button Color Rainbow
+challengeType: 0
+forumTopicId: 18323
+dashedName: taste-the-bootstrap-button-color-rainbow
+---
+
+# --description--
+
+The `btn-primary` class is the main color you'll use in your app. It is useful for highlighting actions you want your user to take.
+
+Replace Bootstrap's `btn-default` class with `btn-primary` in your button.
+
+Note that this button will still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+Your button should have the class `btn-primary`.
+
+```js
+assert($('button').hasClass('btn-primary'));
+```
+
+Your button should still have the `btn` and `btn-block` classes.
+
+```js
+assert($('button').hasClass('btn-block') && $('button').hasClass('btn'));
+```
+
+All your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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-default 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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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-primary 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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
new file mode 100644
index 0000000000..b4e04ccd5b
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-a-span-to-target-inline-elements.md
@@ -0,0 +1,185 @@
+---
+id: bad87fee1348bd9aedf08845
+title: Use a span to Target Inline Elements
+challengeType: 0
+forumTopicId: 18370
+dashedName: use-a-span-to-target-inline-elements
+---
+
+# --description--
+
+You can use spans to create inline elements. Remember when we used the `btn-block` class to make the button fill the entire row?
+
+<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>normal button</button>
+
+<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>btn-block button</button>
+
+That illustrates the difference between an "inline" element and a "block" element.
+
+By using the inline `span` element, you can put several elements on the same line, and even style different parts of the same line differently.
+
+Using a `span` element, nest the word `love` inside the `p` element that currently has the text `Things cats love`. Then give the `span` the class `text-danger` to make the text red.
+
+Here's how you would do this for the `p` element that has the text `Top 3 things cats hate`:
+
+```html
+<p>Top 3 things cats <span class="text-danger">hate:</span></p>
+```
+
+# --hints--
+
+Your `span` element should be inside your `p` element.
+
+```js
+assert($('p span') && $('p span').length > 0);
+```
+
+Your `span` element should have just the text `love`.
+
+```js
+assert(
+  $('p span') &&
+    $('p span').text().match(/love/i) &&
+    !$('p span')
+      .text()
+      .match(/Things cats/i)
+);
+```
+
+Your `span` element should have class `text-danger`.
+
+```js
+assert($('span').hasClass('text-danger'));
+```
+
+Your `span` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/span>/g) &&
+    code.match(/<span/g) &&
+    code.match(/<\/span>/g).length === code.match(/<span/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
new file mode 100644
index 0000000000..d53b768509
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-comments-to-clarify-code.md
@@ -0,0 +1,98 @@
+---
+id: bad87fee1348bd9aec908857
+title: Use Comments to Clarify Code
+challengeType: 0
+forumTopicId: 18347
+dashedName: 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 `<!--` and end a comment with `-->`
+
+Add a comment at the top of your HTML that says `Code below this line should not be changed`
+
+# --hints--
+
+You should start a comment with `<!--` at the top of your HTML.
+
+```js
+assert(code.match(/^\s*<!--/));
+```
+
+Your comment should have the text `Code below this line should not be changed`.
+
+```js
+assert(code.match(/<!--(?!(>|->|.*-->.*this line))\s*.*this line.*\s*-->/gi));
+```
+
+You should close your comment with `-->`.
+
+```js
+assert(code.match(/-->.*\n+.+/g));
+```
+
+You should have the same number of comment openers and closers.
+
+```js
+assert(code.match(/<!--/g).length === code.match(/-->/g).length);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<!-- Code below this line should not be changed -->
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
new file mode 100644
index 0000000000..3e5204468d
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-responsive-design-with-bootstrap-fluid-containers.md
@@ -0,0 +1,170 @@
+---
+id: bad87fee1348bd9acde08712
+title: Use Responsive Design with Bootstrap Fluid Containers
+challengeType: 0
+forumTopicId: 18362
+dashedName: 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 <dfn>responsive design</dfn>.
+
+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:
+
+```html
+<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css" integrity="sha384-BVYiiSIFeK1dGmJRAkycuHAHRg32OmUcww7on3RYdg4Va+PmSTsz/K68vbdEjh4u" crossorigin="anonymous"/>
+```
+
+In this case, we've already added it for you to this page behind the scenes. Note that using either `>` or `/>` to close the `link` tag is acceptable.
+
+To get started, we should nest all of our HTML (except the `link` tag and the `style` element) in a `div` element with the class `container-fluid`.
+
+# --hints--
+
+Your `div` element should have the class `container-fluid`.
+
+```js
+assert($('div').hasClass('container-fluid'));
+```
+
+Your `div` element should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+All HTML elements after the closing `style` tag should be nested in `.container-fluid`.
+
+```js
+assert($('.container-fluid').children().length >= 8 && !$('.container-fluid').has("style").length && !$('.container-fluid').has("link").length);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
new file mode 100644
index 0000000000..67a3387379
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/use-the-bootstrap-grid-to-put-elements-side-by-side.md
@@ -0,0 +1,196 @@
+---
+id: bad88fee1348ce8acef08815
+title: Use the Bootstrap Grid to Put Elements Side By Side
+challengeType: 0
+forumTopicId: 18371
+dashedName: use-the-bootstrap-grid-to-put-elements-side-by-side
+---
+
+# --description--
+
+Bootstrap uses a responsive 12-column 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 `div` element.
+
+Bootstrap has different column width attributes that it uses depending on how wide the user's screen is. For example, phones have narrow screens, and laptops have wider screens.
+
+Take for example Bootstrap's `col-md-*` class. Here, `md` means medium, and `*` 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 `col-xs-*`, where `xs` means extra small (like an extra-small mobile phone screen), and `*` is the number of columns specifying how many columns wide the element should be.
+
+Put the `Like`, `Info` and `Delete` buttons side-by-side by nesting all three of them within one `<div class="row">` element, then each of them within a `<div class="col-xs-4">` element.
+
+The `row` class is applied to a `div`, and the buttons themselves can be nested within it.
+
+# --hints--
+
+Your buttons should all be nested within the same `div` element with the class `row`.
+
+```js
+assert($('div.row:has(button)').length > 0);
+```
+
+Each of your Bootstrap buttons should be nested within its own `div` element with the class `col-xs-4`.
+
+```js
+assert($('div.col-xs-4:has(button)').length > 2);
+```
+
+Each of your `button` elements should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+Each of your `div` elements should have a closing tag.
+
+```js
+assert(
+  code.match(/<\/div>/g) &&
+    code.match(/<div/g) &&
+    code.match(/<\/div>/g).length === code.match(/<div/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
new file mode 100644
index 0000000000..3102b61875
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/bootstrap/warn-your-users-of-a-dangerous-action-with-btn-danger.md
@@ -0,0 +1,176 @@
+---
+id: bad87fee1348ce8acef08814
+title: Warn Your Users of a Dangerous Action with btn-danger
+challengeType: 0
+forumTopicId: 18375
+dashedName: warn-your-users-of-a-dangerous-action-with-btn-danger
+---
+
+# --description--
+
+Bootstrap comes with several pre-defined colors for buttons. The `btn-danger` 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 `btn-danger`.
+
+Note that these buttons still need the `btn` and `btn-block` classes.
+
+# --hints--
+
+You should create a new `button` element with the text `Delete`.
+
+```js
+assert(new RegExp('Delete', 'gi').test($('button').text()));
+```
+
+All of your Bootstrap buttons should have the `btn` and `btn-block` classes.
+
+```js
+assert($('button.btn-block.btn').length > 2);
+```
+
+Your new button should have the class `btn-danger`.
+
+```js
+assert($('button').hasClass('btn-danger'));
+```
+
+All of your `button` elements should have closing tags.
+
+```js
+assert(
+  code.match(/<\/button>/g) &&
+    code.match(/<button/g) &&
+    code.match(/<\/button>/g).length === code.match(/<button/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
+
+# --solutions--
+
+```html
+<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="https://freecatphotoapp.com/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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
new file mode 100644
index 0000000000..cbb6d71c11
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-25-5-clock.md
@@ -0,0 +1,81 @@
+---
+id: bd7158d8c442eddfaeb5bd0f
+title: Build a 25 + 5 Clock
+challengeType: 3
+forumTopicId: 301373
+dashedName: build-a-25--5-clock
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/XpKrrW>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see an element with `id="break-label"` that contains a string (e.g. "Break Length").
+
+**User Story #2:** I can see an element with `id="session-label"` that contains a string (e.g. "Session Length").
+
+**User Story #3:** I can see two clickable elements with corresponding IDs: `id="break-decrement"` and `id="session-decrement"`.
+
+**User Story #4:** I can see two clickable elements with corresponding IDs: `id="break-increment"` and `id="session-increment"`.
+
+**User Story #5:** I can see an element with a corresponding `id="break-length"`, which by default (on load) displays a value of 5.
+
+**User Story #6:** I can see an element with a corresponding `id="session-length"`, which by default displays a value of 25.
+
+**User Story #7:** I can see an element with a corresponding `id="timer-label"`, that contains a string indicating a session is initialized (e.g. "Session").
+
+**User Story #8:** I can see an element with corresponding `id="time-left"`. NOTE: Paused or running, the value in this field should always be displayed in `mm:ss` format (i.e. 25:00).
+
+**User Story #9:** I can see a clickable element with a corresponding `id="start_stop"`.
+
+**User Story #10:** I can see a clickable element with a corresponding `id="reset"`.
+
+**User Story #11:** When I click the element with the id of `reset`, any running timer should be stopped, the value within `id="break-length"` should return to `5`, the value within `id="session-length"` should return to 25, and the element with `id="time-left"` should reset to its default state.
+
+**User Story #12:** When I click the element with the id of `break-decrement`, the value within `id="break-length"` decrements by a value of 1, and I can see the updated value.
+
+**User Story #13:** When I click the element with the id of `break-increment`, the value within `id="break-length"` increments by a value of 1, and I can see the updated value.
+
+**User Story #14:** When I click the element with the id of `session-decrement`, the value within `id="session-length"` decrements by a value of 1, and I can see the updated value.
+
+**User Story #15:** When I click the element with the id of `session-increment`, the value within `id="session-length"` increments by a value of 1, and I can see the updated value.
+
+**User Story #16:** I should not be able to set a session or break length to &lt;= 0.
+
+**User Story #17:** I should not be able to set a session or break length to > 60.
+
+**User Story #18:** When I first click the element with `id="start_stop"`, the timer should begin running from the value currently displayed in `id="session-length"`, even if the value has been incremented or decremented from the original value of 25.
+
+**User Story #19:** If the timer is running, the element with the id of `time-left` should display the remaining time in `mm:ss` format (decrementing by a value of 1 and updating the display every 1000ms).
+
+**User Story #20:** If the timer is running and I click the element with `id="start_stop"`, the countdown should pause.
+
+**User Story #21:** If the timer is paused and I click the element with `id="start_stop"`, the countdown should resume running from the point at which it was paused.
+
+**User Story #22:** When a session countdown reaches zero (NOTE: timer MUST reach 00:00), and a new countdown begins, the element with the id of `timer-label` should display a string indicating a break has begun.
+
+**User Story #23:** When a session countdown reaches zero (NOTE: timer MUST reach 00:00), a new break countdown should begin, counting down from the value currently displayed in the `id="break-length"` element.
+
+**User Story #24:** When a break countdown reaches zero (NOTE: timer MUST reach 00:00), and a new countdown begins, the element with the id of `timer-label` should display a string indicating a session has begun.
+
+**User Story #25:** When a break countdown reaches zero (NOTE: timer MUST reach 00:00), a new session countdown should begin, counting down from the value currently displayed in the `id="session-length"` element.
+
+**User Story #26:** When a countdown reaches zero (NOTE: timer MUST reach 00:00), a sound indicating that time is up should play. This should utilize an HTML5 `audio` tag and have a corresponding `id="beep"`.
+
+**User Story #27:** The audio element with `id="beep"` must be 1 second or longer.
+
+**User Story #28:** The audio element with id of `beep` must stop playing and be rewound to the beginning when the element with the id of `reset` is clicked.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
new file mode 100644
index 0000000000..4cf667cf9e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-drum-machine.md
@@ -0,0 +1,39 @@
+---
+id: 587d7dbc367417b2b2512bae
+title: Build a Drum Machine
+challengeType: 3
+forumTopicId: 301370
+dashedName: build-a-drum-machine
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/MJyNMd>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I should be able to see an outer container with a corresponding `id="drum-machine"` that contains all other elements.
+
+**User Story #2:** Within `#drum-machine` I can see an element with a corresponding `id="display"`.
+
+**User Story #3:** Within `#drum-machine` I can see 9 clickable drum pad elements, each with a class name of `drum-pad`, a unique id that describes the audio clip the drum pad will be set up to trigger, and an inner text that corresponds to one of the following keys on the keyboard: `Q`, `W`, `E`, `A`, `S`, `D`, `Z`, `X`, `C`. The drum pads MUST be in this order.
+
+**User Story #4:** Within each `.drum-pad`, there should be an HTML5 `audio` element which has a `src` attribute pointing to an audio clip, a class name of `clip`, and an id corresponding to the inner text of its parent `.drum-pad` (e.g. `id="Q"`, `id="W"`, `id="E"` etc.).
+
+**User Story #5:** When I click on a `.drum-pad` element, the audio clip contained in its child `audio` element should be triggered.
+
+**User Story #6:** When I press the trigger key associated with each `.drum-pad`, the audio clip contained in its child `audio` element should be triggered (e.g. pressing the `Q` key should trigger the drum pad which contains the string `Q`, pressing the `W` key should trigger the drum pad which contains the string `W`, etc.).
+
+**User Story #7:** When a `.drum-pad` is triggered, a string describing the associated audio clip is displayed as the inner text of the `#display` element (each string must be unique).
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
new file mode 100644
index 0000000000..cb20e900bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-javascript-calculator.md
@@ -0,0 +1,62 @@
+---
+id: bd7158d8c442eddfaeb5bd17
+title: Build a JavaScript Calculator
+challengeType: 3
+forumTopicId: 301371
+dashedName: build-a-javascript-calculator
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wgGVVX>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** My calculator should contain a clickable element containing an `=` (equal sign) with a corresponding `id="equals"`.
+
+**User Story #2:** My calculator should contain 10 clickable elements containing one number each from 0-9, with the following corresponding IDs: `id="zero"`, `id="one"`, `id="two"`, `id="three"`, `id="four"`, `id="five"`, `id="six"`, `id="seven"`, `id="eight"`, and `id="nine"`.
+
+**User Story #3:** My calculator should contain 4 clickable elements each containing one of the 4 primary mathematical operators with the following corresponding IDs: `id="add"`, `id="subtract"`, `id="multiply"`, `id="divide"`.
+
+**User Story #4:** My calculator should contain a clickable element containing a `.` (decimal point) symbol with a corresponding `id="decimal"`.
+
+**User Story #5:** My calculator should contain a clickable element with an `id="clear"`.
+
+**User Story #6:** My calculator should contain an element to display values with a corresponding `id="display"`.
+
+**User Story #7:** At any time, pressing the `clear` button clears the input and output values, and returns the calculator to its initialized state; 0 should be shown in the element with the id of `display`.
+
+**User Story #8:** As I input numbers, I should be able to see my input in the element with the id of `display`.
+
+**User Story #9:** In any order, I should be able to add, subtract, multiply and divide a chain of numbers of any length, and when I hit `=`, the correct result should be shown in the element with the id of `display`.
+
+**User Story #10:** When inputting numbers, my calculator should not allow a number to begin with multiple zeros.
+
+**User Story #11:** When the decimal element is clicked, a `.` should append to the currently displayed value; two `.` in one number should not be accepted.
+
+**User Story #12:** I should be able to perform any operation (`+`, `-`, `*`, `/`) on numbers containing decimal points.
+
+**User Story #13:** If 2 or more operators are entered consecutively, the operation performed should be the last operator entered (excluding the negative (`-`) sign). For example, if `5 + * 7 =` is entered, the result should be `35` (i.e. `5 * 7`); if `5 * - 5 =` is entered, the result should be `-25` (i.e. `5 * (-5)`).
+
+**User Story #14:** Pressing an operator immediately following `=` should start a new calculation that operates on the result of the previous evaluation.
+
+**User Story #15:** My calculator should have several decimal places of precision when it comes to rounding (note that there is no exact standard, but you should be able to handle calculations like `2 / 7` with reasonable precision to at least 4 decimal places).
+
+**Note On Calculator Logic:** 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.
+
+**EXAMPLE:** `3 + 5 x 6 - 2 / 4 =`  
+
+-   **Immediate Execution Logic:** `11.5`
+-   **Formula/Expression Logic:** `32.5`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
new file mode 100644
index 0000000000..2be74eba1c
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-markdown-previewer.md
@@ -0,0 +1,39 @@
+---
+id: bd7157d8c242eddfaeb5bd13
+title: Build a Markdown Previewer
+challengeType: 3
+forumTopicId: 301372
+dashedName: build-a-markdown-previewer
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/GrZVVO>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see a `textarea` element with a corresponding `id="editor"`.
+
+**User Story #2:** I can see an element with a corresponding `id="preview"`.
+
+**User Story #3:** When I enter text into the `#editor` element, the `#preview` element is updated as I type to display the content of the textarea.
+
+**User Story #4:** When I enter GitHub flavored markdown into the `#editor` element, the text is rendered as HTML in the `#preview` element as I type (HINT: You don't need to parse Markdown yourself - you can import the Marked library for this: <https://cdnjs.com/libraries/marked>).
+
+**User Story #5:** When my markdown previewer first loads, the default text in the `#editor` field should contain valid markdown that represents at least one of each of the following elements: a header (H1 size), a sub header (H2 size), a link, inline code, a code block, a list item, a blockquote, an image, and bolded text.
+
+**User Story #6:** When my markdown previewer first loads, the default markdown in the `#editor` field should be rendered as HTML in the `#preview` element.
+
+**Optional Bonus (you do not need to make this test pass):** My markdown previewer interprets carriage returns and renders them as `br` (line break) elements.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
new file mode 100644
index 0000000000..f70f8dab0f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/front-end-libraries-projects/build-a-random-quote-machine.md
@@ -0,0 +1,49 @@
+---
+id: bd7158d8c442eddfaeb5bd13
+title: Build a Random Quote Machine
+challengeType: 3
+forumTopicId: 301374
+dashedName: build-a-random-quote-machine
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/qRZeGZ>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use any mix of HTML, JavaScript, CSS, Bootstrap, SASS, React, Redux, and jQuery to complete this project. You should use a frontend framework (like React for example) because this section is about learning frontend frameworks. Additional technologies not listed above are not recommended and using them is at your own risk. We are looking at supporting other frontend frameworks like Angular and Vue, but they are not currently supported. We will accept and try to fix all issue reports that use the suggested technology stack for this project. Happy coding!
+
+**User Story #1:** I can see a wrapper element with a corresponding `id="quote-box"`.
+
+**User Story #2:** Within `#quote-box`, I can see an element with a corresponding `id="text"`.
+
+**User Story #3:** Within `#quote-box`, I can see an element with a corresponding `id="author"`.
+
+**User Story #4:** Within `#quote-box`, I can see a clickable element with a corresponding `id="new-quote"`.
+
+**User Story #5:** Within `#quote-box`, I can see a clickable `a` element with a corresponding `id="tweet-quote"`.
+
+**User Story #6:** On first load, my quote machine displays a random quote in the element with `id="text"`.
+
+**User Story #7:** On first load, my quote machine displays the random quote's author in the element with `id="author"`.
+
+**User Story #8:** When the `#new-quote` button is clicked, my quote machine should fetch a new quote and display it in the `#text` element.
+
+**User Story #9:** My quote machine should fetch the new quote's author when the `#new-quote` button is clicked and display it in the `#author` element.
+
+**User Story #10:** I can tweet the current quote by clicking on the `#tweet-quote` `a` element. This `a` element should include the `"twitter.com/intent/tweet"` path in its `href` attribute to tweet the current quote.
+
+**User Story #11:** The `#quote-box` wrapper element should be horizontally centered. Please run tests with browser's zoom level at 100% and page maximized.
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+**Note:** Twitter does not allow links to be loaded in an iframe. Try using the `target="_blank"` or `target="_top"` attribute on the `#tweet-quote` element if your tweet won't load. `target="_top"` will replace the current tab so make sure your work is saved.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
new file mode 100644
index 0000000000..50960b60c6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-text-inside-an-element-using-jquery.md
@@ -0,0 +1,131 @@
+---
+id: 564944c91be2204b269d51e3
+title: Change Text Inside an Element Using jQuery
+challengeType: 6
+forumTopicId: 16773
+dashedName: 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 `.html()` 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:
+
+```js
+$("h3").html("<em>jQuery Playground</em>");
+```
+
+jQuery also has a similar function called `.text()` 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 `target4` by emphasizing its text.
+
+[View our news article for &lt;em>](https://www.freecodecamp.org/news/html-elements-explained-what-are-html-tags/#em-element) to learn the difference between `<i>` and `<em>` and their uses.
+
+Note that while the `<i>` tag has traditionally been used to emphasize text, it has since been adopted for use as a tag for icons. The `<em>` tag is now widely accepted as the tag for emphasis. Either will work for this challenge.
+
+# --hints--
+
+You should emphasize the text in your `target4` button by adding HTML tags.
+
+```js
+assert.isTrue(
+  /<em>|<i>\s*#target4\s*<\/em>|<\/i>/gi.test($('#target4').html())
+);
+```
+
+The text should otherwise remain unchanged.
+
+```js
+assert($('#target4') && $('#target4').text().trim() === '#target4');
+```
+
+You should not alter any other text.
+
+```js
+assert.isFalse(/<em>|<i>/gi.test($('h3').html()));
+```
+
+You should be using `.html()` and not `.text()`.
+
+```js
+assert(code.match(/\.html\(/g));
+```
+
+You should select `button id="target4"` with jQuery.
+
+```js
+assert(code.match(/\$\(\s*?(\"|\')#target4(\"|\')\s*?\)\.html\(/));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target4").html('<em>#target4</em>');
+  });
+</script>
+
+<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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..aa09b454b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/change-the-css-of-an-element-using-jquery.md
@@ -0,0 +1,118 @@
+---
+id: bad87fee1348bd9aed908826
+title: Change the CSS of an Element Using jQuery
+challengeType: 6
+forumTopicId: 16776
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: change-the-css-of-an-element-using-jquery
+---
+
+# --description--
+
+We can also change the CSS of an HTML element directly with jQuery.
+
+jQuery has a function called `.css()` that allows you to change the CSS of an element.
+
+Here's how we would change its color to blue:
+
+```js
+$("#target1").css("color", "blue");
+```
+
+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 `document ready function`.
+
+Select `target1` and change its color to red.
+
+# --hints--
+
+Your `target1` element should have red text.
+
+```js
+assert($('#target1').css('color') === 'rgb(255, 0, 0)');
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+    $("#target1").css("color", "red");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/clone-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
new file mode 100644
index 0000000000..9bb02186d5
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/clone-an-element-using-jquery.md
@@ -0,0 +1,121 @@
+---
+id: bad87fee1348bd9aed508826
+title: Clone an Element Using jQuery
+challengeType: 6
+forumTopicId: 16780
+dashedName: 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 `clone()` that makes a copy of an element.
+
+For example, if we wanted to copy `target2` from our `left-well` to our `right-well`, we would use:
+
+```js
+$("#target2").clone().appendTo("#right-well");
+```
+
+Did you notice this involves sticking two jQuery functions together? This is called <dfn>function chaining</dfn> and it's a convenient way to get things done with jQuery.
+
+Clone your `target5` element and append it to your `left-well`.
+
+# --hints--
+
+Your `target5` element should be inside your `right-well`.
+
+```js
+assert($('#right-well').children('#target5').length > 0);
+```
+
+A copy of your `target5` element should also be inside your `left-well`.
+
+```js
+assert($('#left-well').children('#target5').length > 0);
+```
+
+You should only use jQuery to move these elements.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+    $("#target5").clone().appendTo("#left-well");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/delete-your-jquery-functions.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/delete-your-jquery-functions.md
new file mode 100644
index 0000000000..e5d188bff7
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/delete-your-jquery-functions.md
@@ -0,0 +1,124 @@
+---
+id: bad87fee1348bd9aeda08726
+title: Delete Your jQuery Functions
+challengeType: 6
+forumTopicId: 17561
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: delete-your-jquery-functions
+---
+
+# --description--
+
+These animations were cool at first, but now they're getting kind of distracting.
+
+Delete all three of these jQuery functions from your `document ready function`, but leave your `document ready function` itself intact.
+
+# --hints--
+
+All three of your jQuery functions should be deleted from your `document ready function`.
+
+```js
+assert(code.match(/\{\s*\}\);/g));
+```
+
+You should leave your `script` element intact.
+
+```js
+assert(code.match(/<script>/g));
+```
+
+You should leave your `$(document).ready(function() {` at the beginning of your `script` element.
+
+```js
+assert(code.match(/\$\(document\)\.ready\(function\(\)\s?\{/g));
+```
+
+You should leave the `document.ready` function's closing `})` intact.
+
+```js
+assert(code.match(/.*\s*\}\);/g));
+```
+
+You should leave your `script` element closing tag intact.
+
+```js
+assert(
+  code.match(/<\/script>/g) &&
+    code.match(/<script/g) &&
+    code.match(/<\/script>/g).length === code.match(/<script/g).length
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/disable-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
new file mode 100644
index 0000000000..07162e70b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/disable-an-element-using-jquery.md
@@ -0,0 +1,120 @@
+---
+id: bad87fee1348bd9aed808826
+title: Disable an Element Using jQuery
+challengeType: 6
+forumTopicId: 17563
+dashedName: 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 `.prop()` that allows you to adjust the properties of elements.
+
+Here's how you would disable all buttons:
+
+```js
+$("button").prop("disabled", true);
+```
+
+Disable only the `target1` button.
+
+# --hints--
+
+Your `target1` button should be disabled.
+
+```js
+assert(
+  $('#target1') &&
+    $('#target1').prop('disabled') &&
+    code.match(/["']disabled["'],( true|true)/g)
+);
+```
+
+No other buttons should be disabled.
+
+```js
+assert($('#target2') && !$('#target2').prop('disabled'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/disabled[^<]*>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
new file mode 100644
index 0000000000..3835dfeca8
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/learn-how-script-tags-and-document-ready-work.md
@@ -0,0 +1,118 @@
+---
+id: bad87fee1348bd9acdd08826
+title: Learn How Script Tags and Document Ready Work
+challengeType: 6
+forumTopicId: 18224
+dashedName: 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 `script` element at the top of your page. Be sure to close it on the following line.
+
+Your browser will run any JavaScript inside a `script` element, including jQuery.
+
+Inside your `script` element, add this code: `$(document).ready(function() {` to your `script`. Then close it on the following line (still inside your `script` element) with: `});`
+
+We'll learn more about `functions` later. The important thing to know is that code you put inside this `function` will run as soon as your browser has loaded your page.
+
+This is important because without your `document ready function`, your code may run before your HTML is rendered, which would cause bugs.
+
+# --hints--
+
+You should create a `script` element making sure it is valid and has a closing tag.
+
+```js
+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
+);
+```
+
+You should add `$(document).ready(function() {` to the beginning of your `script` element.
+
+```js
+assert(
+  code.match(
+    /\$\s*?\(\s*?document\s*?\)\.ready\s*?\(\s*?function\s*?\(\s*?\)\s*?\{/g
+  )
+);
+```
+
+You should close your `$(document).ready(function() {` function with `});`
+
+```js
+assert(code.match(/\n*?\s*?\}\s*?\);/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+  });
+</script>
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
new file mode 100644
index 0000000000..94c5908436
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-an-element-using-jquery.md
@@ -0,0 +1,109 @@
+---
+id: bad87fee1348bd9aed708826
+title: Remove an Element Using jQuery
+challengeType: 6
+forumTopicId: 18262
+dashedName: remove-an-element-using-jquery
+---
+
+# --description--
+
+Now let's remove an HTML element from your page using jQuery.
+
+jQuery has a function called `.remove()` that will remove an HTML element entirely
+
+Remove the `#target4` element from the page by using the `.remove()` function.
+
+# --hints--
+
+You should use jQuery to remove your `target4` element from your page.
+
+```js
+assert(
+  $('#target4').length === 0 && code.match(/\$\(["']#target4["']\).remove\(\)/g)
+);
+```
+
+You should only use jQuery to remove this element.
+
+```js
+assert(
+  code.match(/id="target4/g) &&
+    !code.match(/<!--.*id="target4".*-->/g) &&
+    $('#right-well').length > 0
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
new file mode 100644
index 0000000000..7df3b8052f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/remove-classes-from-an-element-with-jquery.md
@@ -0,0 +1,121 @@
+---
+id: bad87fee1348bd9aed918626
+title: Remove Classes from an Element with jQuery
+challengeType: 6
+forumTopicId: 18264
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: remove-classes-from-an-element-with-jquery
+---
+
+# --description--
+
+In the same way you can add classes to an element with jQuery's `addClass()` function, you can remove them with jQuery's `removeClass()` function.
+
+Here's how you would do this for a specific button:
+
+```js
+$("#target2").removeClass("btn-default");
+```
+
+Let's remove the `btn-default` class from all of our `button` elements.
+
+# --hints--
+
+The `btn-default` class should be removed from all of your `button` elements.
+
+```js
+assert($('.btn-default').length === 0);
+```
+
+You should only use jQuery to remove this class from the element.
+
+```js
+assert(code.match(/btn btn-default/g));
+```
+
+You should only remove the `btn-default` class.
+
+```js
+assert(
+  code.match(
+    /\.[\v\s]*removeClass[\s\v]*\([\s\v]*('|")\s*btn-default\s*('|")[\s\v]*\)/gm
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+    $("button").removeClass("btn-default");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..0e082e179f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-a-specific-child-of-an-element-using-jquery.md
@@ -0,0 +1,143 @@
+---
+id: bad87fee1348bd9aed108826
+title: Target a Specific Child of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18315
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-a-specific-child-of-an-element-using-jquery
+---
+
+# --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 `target:nth-child(n)` 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:
+
+```js
+$(".target:nth-child(3)").addClass("animated bounce");
+```
+
+Make the second child in each of your well elements bounce. You must select the elements' children with the `target` class.
+
+# --hints--
+
+The second element in your `target` elements should bounce.
+
+```js
+assert(
+  $('.target:nth-child(2)').hasClass('animated') &&
+    $('.target:nth-child(2)').hasClass('bounce')
+);
+```
+
+Only two elements should bounce.
+
+```js
+assert($('.animated.bounce').length === 2);
+```
+
+You should use the `:nth-child()` selector to modify these elements.
+
+```js
+assert(code.match(/\:nth-child\(/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+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)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+    $(".target:nth-child(2)").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
new file mode 100644
index 0000000000..525a6106cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-class-using-jquery.md
@@ -0,0 +1,112 @@
+---
+id: bad87fee1348bd9aedc08826
+title: Target Elements by Class Using jQuery
+challengeType: 6
+forumTopicId: 18316
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-elements-by-class-using-jquery
+---
+
+# --description--
+
+You see how we made all of your `button` elements bounce? We selected them with `$("button")`, then we added some CSS classes to them with `.addClass("animated bounce");`.
+
+You just used jQuery's `.addClass()` function, which allows you to add classes to elements.
+
+First, let's target your `div` elements with the class `well` by using the `$(".well")` selector.
+
+Note that, just like with CSS declarations, you type a `.` before the class's name.
+
+Then use jQuery's `.addClass()` function to add the classes `animated` and `shake`.
+
+For example, you could make all the elements with the class `text-primary` shake by adding the following to your `document ready function`:
+
+```js
+$(".text-primary").addClass("animated shake");
+```
+
+# --hints--
+
+You should use the jQuery `addClass()` function to give the classes `animated` and `shake` to all your elements with the class `well`.
+
+```js
+assert($('.well').hasClass('animated') && $('.well').hasClass('shake'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class\.\*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
new file mode 100644
index 0000000000..e63f60b4e5
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-elements-by-id-using-jquery.md
@@ -0,0 +1,122 @@
+---
+id: bad87fee1348bd9aeda08826
+title: Target Elements by id Using jQuery
+challengeType: 6
+forumTopicId: 18317
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-elements-by-id-using-jquery
+---
+
+# --description--
+
+You can also target elements by their id attributes.
+
+First target your `button` element with the id `target3` by using the `$("#target3")` selector.
+
+Note that, just like with CSS declarations, you type a `#` before the id's name.
+
+Then use jQuery's `.addClass()` function to add the classes `animated` and `fadeOut`.
+
+Here's how you'd make the `button` element with the id `target6` fade out:
+
+```js
+$("#target6").addClass("animated fadeOut");
+```
+
+# --hints--
+
+You should select the `button` element with the `id` of `target3` and use the jQuery `addClass()` function to give it the class of `animated`.
+
+```js
+assert($('#target3').hasClass('animated'));
+```
+
+You should target the element with the id `target3` and use the jQuery `addClass()` function to give it the class `fadeOut`.
+
+```js
+assert(
+  ($('#target3').hasClass('fadeOut') || $('#target3').hasClass('fadeout')) &&
+    code.match(/\$\(\s*.#target3.\s*\)/g)
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+    $(".well").addClass("animated shake");
+    $("#target3").addClass("animated fadeOut");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-even-elements-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
new file mode 100644
index 0000000000..d89318eb3e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-even-elements-using-jquery.md
@@ -0,0 +1,138 @@
+---
+id: bad87fee1348bd9aed008826
+title: Target Even Elements Using jQuery
+challengeType: 6
+forumTopicId: 18318
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-even-elements-using-jquery
+---
+
+# --description--
+
+You can also target elements based on their positions using `:odd` or `:even` 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, `:odd` 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 `target` and give them classes:
+
+```js
+$(".target:odd").addClass("animated shake");
+```
+
+Try selecting all the even `target` elements and giving them the classes of `animated` and `shake`. Remember that **even** refers to the position of elements with a zero-based system in mind.
+
+# --hints--
+
+All of the `target` elements that jQuery considers to be even should shake.
+
+```js
+assert(
+  $('.target:even').hasClass('animated') && $('.target:even').hasClass('shake')
+);
+```
+
+You should use the `:even` selector to modify these elements.
+
+```js
+assert(code.match(/\:even/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(
+  code.match(/\$\(".target:even"\)/g) ||
+    code.match(/\$\('.target:even'\)/g) ||
+    code.match(/\$\(".target"\).filter\(":even"\)/g) ||
+    code.match(/\$\('.target'\).filter\(':even'\)/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
new file mode 100644
index 0000000000..5b45498d38
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-html-elements-with-selectors-using-jquery.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9bedc08826
+title: Target HTML Elements with Selectors Using jQuery
+challengeType: 6
+forumTopicId: 18319
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-html-elements-with-selectors-using-jquery
+---
+
+# --description--
+
+Now we have a `document ready function`.
+
+Now let's write our first jQuery statement. All jQuery functions start with a `$`, usually referred to as a dollar sign operator, or as bling.
+
+jQuery often selects an HTML element with a <dfn>selector</dfn>, then does something to that element.
+
+For example, let's make all of your `button` elements bounce. Just add this code inside your document ready function:
+
+```js
+$("button").addClass("animated bounce");
+```
+
+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 `bounce` class to your `button` elements.
+
+# --hints--
+
+You should use the jQuery `addClass()` function to give the classes `animated` and `bounce` to your `button` elements.
+
+```js
+assert($('button').hasClass('animated') && $('button').hasClass('bounce'));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+Your jQuery code should be within the `$(document).ready();` function.
+
+```js
+assert(
+  code.replace(/\s/g, '').match(/\$\(document\)\.ready\(function\(\)\{\$/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated bounce");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..5b75dd072b
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-children-of-an-element-using-jquery.md
@@ -0,0 +1,125 @@
+---
+id: bad87fee1348bd9aed208826
+title: Target the Children of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18320
+dashedName: target-the-children-of-an-element-using-jquery
+---
+
+# --description--
+
+When HTML elements are placed one level below another they are called <dfn>children</dfn> of that element. For example, the button elements in this challenge with the text `#target1`, `#target2`, and `#target3` are all children of the `<div class="well" id="left-well">` element.
+
+jQuery has a function called `children()` that allows you to access the children of whichever element you've selected.
+
+Here's an example of how you would use the `children()` function to give the children of your `left-well` element the color `blue`:
+
+```js
+$("#left-well").children().css("color", "blue")
+```
+
+# --instructions--
+
+Give all the children of your `right-well` element the color orange.
+
+# --hints--
+
+All children of `#right-well` should have orange text.
+
+```js
+assert($('#right-well').children().css('color') === 'rgb(255, 165, 0)');
+```
+
+You should use the `children()` function to modify these elements.
+
+```js
+assert(code.match(/\.children\(\)\.css/g));
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(code.match(/<div class="well" id="right-well">/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
new file mode 100644
index 0000000000..48985e399e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-parent-of-an-element-using-jquery.md
@@ -0,0 +1,140 @@
+---
+id: bad87fee1348bd9aed308826
+title: Target the Parent of an Element Using jQuery
+challengeType: 6
+forumTopicId: 18321
+dashedName: target-the-parent-of-an-element-using-jquery
+---
+
+# --description--
+
+Every HTML element has a `parent` element from which it `inherits` properties.
+
+For example, your `jQuery Playground` `h3` element has the parent element of `<div class="container-fluid">`, which itself has the parent `body`.
+
+jQuery has a function called `parent()` that allows you to access the parent of whichever element you've selected.
+
+Here's an example of how you would use the `parent()` function if you wanted to give the parent element of the `left-well` element a background color of blue:
+
+```js
+$("#left-well").parent().css("background-color", "blue")
+```
+
+Give the parent of the `#target1` element a background-color of red.
+
+# --hints--
+
+Your `left-well` element should have a red background.
+
+```js
+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'
+);
+```
+
+You should use the `.parent()` function to modify this element.
+
+```js
+assert(code.match(/\.parent\s*\(\s*\)\s*\.css/g));
+```
+
+The `.parent()` method should be called on the `#target1` element.
+
+```js
+assert(
+  code.match(/\$\s*?\(\s*?(?:'|")\s*?#target1\s*?(?:'|")\s*?\)\s*?\.parent/gi)
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(code.match(/<div class="well" id="left-well">/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+    $("#target5").clone().appendTo("#left-well");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
new file mode 100644
index 0000000000..65e25dbc54
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/target-the-same-element-with-multiple-jquery-selectors.md
@@ -0,0 +1,142 @@
+---
+id: bad87fee1348bd9aed908626
+title: Target the Same Element with Multiple jQuery Selectors
+challengeType: 6
+forumTopicId: 18322
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: target-the-same-element-with-multiple-jquery-selectors
+---
+
+# --description--
+
+Now you know three ways of targeting elements: by type: `$("button")`, by class: `$(".btn")`, and by id `$("#target1")`.
+
+Although it is possible to add multiple classes in a single `.addClass()` call, let's add them to the same element in *three separate ways*.
+
+Using `.addClass()`, add only one class at a time to the same element, three different ways:
+
+Add the `animated` class to all elements with type `button`.
+
+Add the `shake` class to all the buttons with class `.btn`.
+
+Add the `btn-primary` class to the button with id `#target1`.
+
+**Note:** 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 `shake`, `animated`, and `btn-primary` to `#target1`.
+
+# --hints--
+
+Your code should use the `$("button")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?button\s*?(?:'|")/gi));
+```
+
+Your code should use the `$(".btn")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?\.btn\s*?(?:'|")/gi));
+```
+
+Your code should use the `$("#target1")` selector.
+
+```js
+assert(code.match(/\$\s*?\(\s*?(?:'|")\s*?#target1\s*?(?:'|")/gi));
+```
+
+You should only add one class with each of your three selectors.
+
+```js
+assert(
+  code.match(/addClass/g) &&
+    code.match(/addClass\s*?\(\s*?('|")\s*?[\w-]+\s*?\1\s*?\)/g).length > 2
+);
+```
+
+Your `#target1` element should have the classes `animated`‚ `shake` and `btn-primary`.
+
+```js
+assert(
+  $('#target1').hasClass('animated') &&
+    $('#target1').hasClass('shake') &&
+    $('#target1').hasClass('btn-primary')
+);
+```
+
+You should only use jQuery to add these classes to the element.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("button").addClass("animated");
+    $(".btn").addClass("shake");
+    $("#target1").addClass("btn-primary");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
new file mode 100644
index 0000000000..5b0f8ef1fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-appendto-to-move-elements-with-jquery.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9aed608826
+title: Use appendTo to Move Elements with jQuery
+challengeType: 6
+forumTopicId: 18340
+dashedName: use-appendto-to-move-elements-with-jquery
+---
+
+# --description--
+
+Now let's try moving elements from one `div` to another.
+
+jQuery has a function called `appendTo()` that allows you to select HTML elements and append them to another element.
+
+For example, if we wanted to move `target4` from our right well to our left well, we would use:
+
+```js
+$("#target4").appendTo("#left-well");
+```
+
+Move your `target2` element from your `left-well` to your `right-well`.
+
+# --hints--
+
+Your `target2` element should not be inside your `left-well`.
+
+```js
+assert($('#left-well').children('#target2').length === 0);
+```
+
+Your `target2` element should be inside your `right-well`.
+
+```js
+assert($('#right-well').children('#target2').length > 0);
+```
+
+You should only use jQuery to move these elements.
+
+```js
+assert(!code.match(/class.*animated/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(document).ready(function() {
+    $("#target1").css("color", "red");
+    $("#target1").prop("disabled", true);
+    $("#target4").remove();
+    $("#target2").appendTo("#right-well");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
new file mode 100644
index 0000000000..4123f59226
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/jquery/use-jquery-to-modify-the-entire-page.md
@@ -0,0 +1,117 @@
+---
+id: bad87fee1348bd9aecb08826
+title: Use jQuery to Modify the Entire Page
+challengeType: 6
+forumTopicId: 18361
+required:
+  - link: 'https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css'
+dashedName: use-jquery-to-modify-the-entire-page
+---
+
+# --description--
+
+We're done playing with our jQuery playground. Let's tear it down!
+
+jQuery can target the `body` element as well.
+
+Here's how we would make the entire body fade out: `$("body").addClass("animated fadeOut");`
+
+But let's do something more dramatic. Add the classes `animated` and `hinge` to your `body` element.
+
+# --hints--
+
+You should add the classes `animated` and `hinge` to your `body` element.
+
+```js
+assert($('body').hasClass('animated') && $('body').hasClass('hinge'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  $(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");
+
+  });
+</script>
+
+<!-- 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  $(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");
+    $("body").addClass("animated hinge");
+  });
+</script>
+
+<!-- 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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-react.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
new file mode 100644
index 0000000000..b016ed7ef1
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-react.md
@@ -0,0 +1,156 @@
+---
+id: 5a24c314108439a4d4036147
+title: Connect Redux to React
+challengeType: 6
+forumTopicId: 301426
+dashedName: connect-redux-to-react
+---
+
+# --description--
+
+Now that you've written both the `mapStateToProps()` and the `mapDispatchToProps()` functions, you can use them to map `state` and `dispatch` to the `props` of one of your React components. The `connect` method from React Redux can handle this task. This method takes two optional arguments, `mapStateToProps()` and `mapDispatchToProps()`. They are optional because you may have a component that only needs access to `state` but doesn't need to dispatch any actions, or vice versa.
+
+To use this method, pass in the functions as arguments, and immediately call the result with your component. This syntax is a little unusual and looks like:
+
+```js
+connect(mapStateToProps, mapDispatchToProps)(MyComponent)
+```
+
+**Note:** If you want to omit one of the arguments to the `connect` method, you pass `null` in its place.
+
+# --instructions--
+
+The code editor has the `mapStateToProps()` and `mapDispatchToProps()` functions and a new React component called `Presentational`. Connect this component to Redux with the `connect` method from the `ReactRedux` global object, and call it immediately on the `Presentational` component. Assign the result to a new `const` called `ConnectedComponent` that represents the connected component. That's it, now you're connected to Redux! Try changing either of `connect`'s arguments to `null` and observe the test results.
+
+# --hints--
+
+The `Presentational` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should receive a prop `messages` via `connect`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const props = mockedComponent.find('Presentational').props();
+    return props.messages === '__INITIAL__STATE__';
+  })()
+);
+```
+
+The `Presentational` component should receive a prop `submitNewMessage` via `connect`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const props = mockedComponent.find('Presentational').props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+const store = Redux.createStore(
+  (state = '__INITIAL__STATE__', action) => state
+);
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <ReactRedux.Provider store = {store}>
+        <ConnectedComponent/>
+      </ReactRedux.Provider>
+    );
+  }
+};
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message));
+    }
+  }
+};
+
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h3>This is a Presentational Component</h3>
+  }
+};
+
+const connect = ReactRedux.connect;
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message));
+    }
+  }
+};
+
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h3>This is a Presentational Component</h3>
+  }
+};
+
+const connect = ReactRedux.connect;
+// Change code below this line
+
+const ConnectedComponent = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
new file mode 100644
index 0000000000..ce25f89ba6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/connect-redux-to-the-messages-app.md
@@ -0,0 +1,300 @@
+---
+id: 5a24c314108439a4d4036148
+title: Connect Redux to the Messages App
+challengeType: 6
+forumTopicId: 301427
+dashedName: connect-redux-to-the-messages-app
+---
+
+# --description--
+
+Now that you understand how to use `connect` to connect React to Redux, you can apply what you've learned to your React component that handles messages.
+
+In the last lesson, the component you connected to Redux was named `Presentational`, and this wasn't arbitrary. This term *generally* refers to React components that are not directly connected to Redux. They are simply responsible for the presentation of UI and do this as a function of the props they receive. By contrast, container components are connected to Redux. These are typically responsible for dispatching actions to the store and often pass store state to child components as props.
+
+# --instructions--
+
+The code editor has all the code you've written in this section so far. The only change is that the React component is renamed to `Presentational`. Create a new component held in a constant called `Container` that uses `connect` to connect the `Presentational` component to Redux. Then, in the `AppWrapper`, render the React Redux `Provider` component. Pass `Provider` the Redux `store` as a prop and render `Container` as a child. Once everything is setup, you will see the messages app rendered to the page again.
+
+# --hints--
+
+The `AppWrapper` should render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render to page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render an `h2`, `input`, `button`, and `ul` elements.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    return (
+      PresentationalComponent.find('div').length === 1 &&
+      PresentationalComponent.find('h2').length === 1 &&
+      PresentationalComponent.find('button').length === 1 &&
+      PresentationalComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+The `Presentational` component should receive `messages` from the Redux store as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return Array.isArray(props.messages);
+  })()
+);
+```
+
+The `Presentational` component should receive the `submitMessage` action creator as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+// React-Redux:
+const mapStateToProps = (state) => {
+  return { messages: state }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (newMessage) => {
+       dispatch(addMessage(newMessage))
+    }
+  }
+};
+
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Define the Container component here:
+
+
+class AppWrapper extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Complete the return statement:
+    return (null);
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+// React-Redux:
+const mapStateToProps = (state) => {
+  return { messages: state }
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (newMessage) => {
+       dispatch(addMessage(newMessage))
+    }
+  }
+};
+
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
new file mode 100644
index 0000000000..b1c4581f2e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-local-state-into-redux.md
@@ -0,0 +1,397 @@
+---
+id: 5a24c314108439a4d4036149
+title: Extract Local State into Redux
+challengeType: 6
+forumTopicId: 301428
+dashedName: extract-local-state-into-redux
+---
+
+# --description--
+
+You're almost done! Recall that you wrote all the Redux code so that Redux could control the state management of your React messages app. Now that Redux is connected, you need to extract the state management out of the `Presentational` component and into Redux. Currently, you have Redux connected, but you are handling the state locally within the `Presentational` component.
+
+# --instructions--
+
+In the `Presentational` component, first, remove the `messages` property in the local `state`. These messages will be managed by Redux. Next, modify the `submitMessage()` method so that it dispatches `submitNewMessage()` from `this.props`, and pass in the current message input from local `state` as an argument. Because you removed `messages` from local state, remove the `messages` property from the call to `this.setState()` here as well. Finally, modify the `render()` method so that it maps over the messages received from `props` rather than `state`.
+
+Once these changes are made, the app will continue to function the same, except Redux manages the state. This example also illustrates how a component may have local `state`: your component still tracks user input locally in its own `state`. You can see how Redux provides a useful state management framework on top of React. You achieved the same result using only React's local state at first, and this is usually possible with simple apps. However, as your apps become larger and more complex, so does your state management, and this is the problem Redux solves.
+
+# --hints--
+
+The `AppWrapper` should render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render to page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('Presentational').length === 1;
+  })()
+);
+```
+
+The `Presentational` component should render an `h2`, `input`, `button`, and `ul` elements.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    return (
+      PresentationalComponent.find('div').length === 1 &&
+      PresentationalComponent.find('h2').length === 1 &&
+      PresentationalComponent.find('button').length === 1 &&
+      PresentationalComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+The `Presentational` component should receive `messages` from the Redux store as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return Array.isArray(props.messages);
+  })()
+);
+```
+
+The `Presentational` component should receive the `submitMessage` action creator as a prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalComponent = mockedComponent.find('Presentational');
+    const props = PresentationalComponent.props();
+    return typeof props.submitNewMessage === 'function';
+  })()
+);
+```
+
+The state of the `Presentational` component should contain one property, `input`, which is initialized to an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    const PresentationalState = mockedComponent
+      .find('Presentational')
+      .instance().state;
+    return (
+      typeof PresentationalState.input === 'string' &&
+      Object.keys(PresentationalState).length === 1
+    );
+  })()
+);
+```
+
+Typing in the `input` element should update the state of the `Presentational` component.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const testValue = '__MOCK__INPUT__';
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  let initialInput = mockedComponent.find('Presentational').find('input');
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await changed();
+  const updatedInput = updated.find('Presentational').find('input');
+  assert(
+    initialInput.props().value === '' &&
+      updatedInput.props().value === '__MOCK__INPUT__'
+  );
+};
+```
+
+Dispatching the `submitMessage` on the `Presentational` component should update Redux store and clear the input in local state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  let beforeProps = mockedComponent.find('Presentational').props();
+  const testValue = '__TEST__EVENT__INPUT__';
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const clickButton = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterChange = await changed();
+  const afterChangeInput = afterChange.find('input').props().value;
+  const afterClick = await clickButton();
+  const afterProps = mockedComponent.find('Presentational').props();
+  assert(
+    beforeProps.messages.length === 0 &&
+      afterChangeInput === testValue &&
+      afterProps.messages.pop() === testValue &&
+      afterClick.find('input').props().value === ''
+  );
+};
+```
+
+The `Presentational` component should render the `messages` from the Redux store.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  let beforeProps = mockedComponent.find('Presentational').props();
+  const testValue = '__TEST__EVENT__INPUT__';
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const clickButton = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterChange = await changed();
+  const afterChangeInput = afterChange.find('input').props().value;
+  const afterClick = await clickButton();
+  const afterProps = mockedComponent.find('Presentational').props();
+  assert(
+    beforeProps.messages.length === 0 &&
+      afterChangeInput === testValue &&
+      afterProps.messages.pop() === testValue &&
+      afterClick.find('input').props().value === '' &&
+      afterClick.find('ul').childAt(0).text() === testValue
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Change code below this line
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => ({
+      input: '',
+      messages: state.messages.concat(state.input)
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+// Change code above this line
+
+const mapStateToProps = (state) => {
+  return {messages: state}
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message))
+    }
+  }
+};
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message: message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+const Provider = ReactRedux.Provider;
+const connect = ReactRedux.connect;
+
+// Change code below this line
+class Presentational extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.props.submitNewMessage(this.state.input);
+    this.setState({
+      input: ''
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.props.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+// Change code above this line
+
+const mapStateToProps = (state) => {
+  return {messages: state}
+};
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: (message) => {
+      dispatch(addMessage(message))
+    }
+  }
+};
+
+const Container = connect(mapStateToProps, mapDispatchToProps)(Presentational);
+
+class AppWrapper extends React.Component {
+  render() {
+    return (
+      <Provider store={store}>
+        <Container/>
+      </Provider>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
new file mode 100644
index 0000000000..6718ed802e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/extract-state-logic-to-redux.md
@@ -0,0 +1,115 @@
+---
+id: 5a24c314108439a4d4036143
+title: Extract State Logic to Redux
+challengeType: 6
+forumTopicId: 301429
+dashedName: extract-state-logic-to-redux
+---
+
+# --description--
+
+Now that you finished the React component, you need to move the logic it's performing locally in its `state` into Redux. This is the first step to connect the simple React app to Redux. The only functionality your app has is to add new messages from the user to an unordered list. The example is simple in order to demonstrate how React and Redux work together.
+
+# --instructions--
+
+First, define an action type `ADD` and set it to a const `ADD`. Next, define an action creator `addMessage()` which creates the action to add a message. You'll need to pass a `message` to this action creator and include the message in the returned `action`.
+
+Then create a reducer called `messageReducer()` that handles the state for the messages. The initial state should equal an empty array. This reducer should add a message to the array of messages held in state, or return the current state. Finally, create your Redux store and pass it the reducer.
+
+# --hints--
+
+The const `ADD` should exist and hold a value equal to the string `ADD`
+
+```js
+assert(ADD === 'ADD');
+```
+
+The action creator `addMessage` should return an object with `type` equal to `ADD` and `message` equal to the message that is passed in.
+
+```js
+assert(
+  (function () {
+    const addAction = addMessage('__TEST__MESSAGE__');
+    return addAction.type === ADD && addAction.message === '__TEST__MESSAGE__';
+  })()
+);
+```
+
+`messageReducer` should be a function.
+
+```js
+assert(typeof messageReducer === 'function');
+```
+
+The store should exist and have an initial state set to an empty array.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return typeof store === 'object' && initialState.length === 0;
+  })()
+);
+```
+
+Dispatching `addMessage` against the store should immutably add a new message to the array of messages held in state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addMessage('__A__TEST__MESSAGE'));
+    const addState = store.getState();
+    return isFrozen && addState[0] === '__A__TEST__MESSAGE';
+  })()
+);
+```
+
+The `messageReducer` should return the current state if called with any other actions.
+
+```js
+assert(
+  (function () {
+    const addState = store.getState();
+    store.dispatch({ type: 'FAKE_ACTION' });
+    const testState = store.getState();
+    return addState === testState;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+// Define ADD, addMessage(), messageReducer(), and store here:
+```
+
+# --solutions--
+
+```jsx
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
new file mode 100644
index 0000000000..8bf764191f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/getting-started-with-react-redux.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036141
+title: Getting Started with React Redux
+challengeType: 6
+forumTopicId: 301430
+dashedName: getting-started-with-react-redux
+---
+
+# --description--
+
+This series of challenges introduces how to use Redux with React. First, here's a review of some of the key principles of each technology. React is a view library that you provide with data, then it renders the view in an efficient, predictable way. Redux is a state management framework that you can use to simplify the management of your application's state. Typically, in a React Redux app, you create a single Redux store that manages the state of your entire app. Your React components subscribe to only the pieces of data in the store that are relevant to their role. Then, you dispatch actions directly from React components, which then trigger store updates.
+
+Although React components can manage their own state locally, when you have a complex app, it's generally better to keep the app state in a single location with Redux. There are exceptions when individual components may have local state specific only to them. Finally, because Redux is not designed to work with React out of the box, you need to use the `react-redux` package. It provides a way for you to pass Redux `state` and `dispatch` to your React components as `props`.
+
+Over the next few challenges, first, you'll create a simple React component which allows you to input new text messages. These are added to an array that's displayed in the view. This should be a nice review of what you learned in the React lessons. Next, you'll create a Redux store and actions that manage the state of the messages array. Finally, you'll use `react-redux` to connect the Redux store with your component, thereby extracting the local state into the Redux store.
+
+# --instructions--
+
+Start with a `DisplayMessages` component. Add a constructor to this component and initialize it with a state that has two properties: `input`, that's set to an empty string, and `messages`, that's set to an empty array.
+
+# --hints--
+
+The `DisplayMessages` component should render an empty `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    return mockedComponent.find('div').text() === '';
+  })()
+);
+```
+
+The `DisplayMessages` constructor should be called properly with `super`, passing in `props`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        noWhiteSpace.includes('constructor(props)') &&
+        noWhiteSpace.includes('super(props')
+      );
+    })()
+  );
+```
+
+The `DisplayMessages` component should have an initial state equal to `{input: "", messages: []}`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' &&
+      initialState.input === '' &&
+      Array.isArray(initialState.messages) &&
+      initialState.messages.length === 0
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<DisplayMessages />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class DisplayMessages extends React.Component {
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return <div />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+  }
+  render() {
+    return <div/>
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/manage-state-locally-first.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
new file mode 100644
index 0000000000..ec7c618f3d
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/manage-state-locally-first.md
@@ -0,0 +1,260 @@
+---
+id: 5a24c314108439a4d4036142
+title: Manage State Locally First
+challengeType: 6
+forumTopicId: 301431
+dashedName: manage-state-locally-first
+---
+
+# --description--
+
+Here you'll finish creating the `DisplayMessages` component.
+
+# --instructions--
+
+First, in the `render()` method, have the component render an `input` element, `button` element, and `ul` element. When the `input` element changes, it should trigger a `handleChange()` method. Also, the `input` element should render the value of `input` that's in the component's state. The `button` element should trigger a `submitMessage()` method when it's clicked.
+
+Second, write these two methods. The `handleChange()` method should update the `input` with what the user is typing. The `submitMessage()` method should concatenate the current message (stored in `input`) to the `messages` array in local state, and clear the value of the `input`.
+
+Finally, use the `ul` to map over the array of `messages` and render it to the screen as a list of `li` elements.
+
+# --hints--
+
+The `DisplayMessages` component should initialize with a state equal to `{ input: "", messages: [] }`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' &&
+      initialState.input === '' &&
+      initialState.messages.length === 0
+    );
+  })()
+);
+```
+
+The `DisplayMessages` component should render a `div` containing an `h2` element, a `button` element, a `ul` element, and `li` elements as children.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const state = () => {
+    mockedComponent.setState({ messages: ['__TEST__MESSAGE'] });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('h2').length === 1 &&
+      updated.find('button').length === 1 &&
+      updated.find('ul').length === 1 &&
+      updated.find('li').length > 0
+  );
+};
+```
+
+`.map` should be used on the `messages` array.
+
+```js
+assert(code.match(/this\.state\.messages\.map/g));
+```
+
+The `input` element should render the value of `input` in local state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const testValue = '__TEST__EVENT__INPUT';
+  const changed = () => {
+    causeChange(mockedComponent, testValue);
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await changed();
+  assert(updated.find('input').props().value === testValue);
+};
+```
+
+Calling the method `handleChange` should update the `input` value in state to the current input.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage = '__TEST__EVENT__MESSAGE__';
+  const changed = () => {
+    causeChange(mockedComponent, testMessage);
+    return waitForIt(() => mockedComponent);
+  };
+  const afterInput = await changed();
+  assert(
+    initialState.input === '' &&
+      afterInput.state().input === '__TEST__EVENT__MESSAGE__'
+  );
+};
+```
+
+Clicking the `Add message` button should call the method `submitMessage` which should add the current `input` to the `messages` array in state.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage_1 = '__FIRST__MESSAGE__';
+  const firstChange = () => {
+    causeChange(mockedComponent, testMessage_1);
+    return waitForIt(() => mockedComponent);
+  };
+  const firstResult = await firstChange();
+  const firstSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit_1 = await firstSubmit();
+  const submitState_1 = afterSubmit_1.state();
+  const testMessage_2 = '__SECOND__MESSAGE__';
+  const secondChange = () => {
+    causeChange(mockedComponent, testMessage_2);
+    return waitForIt(() => mockedComponent);
+  };
+  const secondResult = await secondChange();
+  const secondSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit_2 = await secondSubmit();
+  const submitState_2 = afterSubmit_2.state();
+  assert(
+    initialState.messages.length === 0 &&
+      submitState_1.messages.length === 1 &&
+      submitState_2.messages.length === 2 &&
+      submitState_2.messages[1] === testMessage_2
+  );
+};
+```
+
+The `submitMessage` method should clear the current input.
+
+```js
+async () => {
+  const mockedComponent = Enzyme.mount(React.createElement(DisplayMessages));
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const causeChange = (c, v) =>
+    c.find('input').simulate('change', { target: { value: v } });
+  const initialState = mockedComponent.state();
+  const testMessage = '__FIRST__MESSAGE__';
+  const firstChange = () => {
+    causeChange(mockedComponent, testMessage);
+    return waitForIt(() => mockedComponent);
+  };
+  const firstResult = await firstChange();
+  const firstState = firstResult.state();
+  const firstSubmit = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent);
+  };
+  const afterSubmit = await firstSubmit();
+  const submitState = afterSubmit.state();
+  assert(firstState.input === testMessage && submitState.input === '');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<DisplayMessages />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+  }
+  // Add handleChange() and submitMessage() methods here
+
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        { /* Render an input, button, and ul below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+   this.submitMessage = this.submitMessage.bind(this);
+ }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };  
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
new file mode 100644
index 0000000000..72dae912c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-dispatch-to-props.md
@@ -0,0 +1,107 @@
+---
+id: 5a24c314108439a4d4036146
+title: Map Dispatch to Props
+challengeType: 6
+forumTopicId: 301432
+dashedName: map-dispatch-to-props
+---
+
+# --description--
+
+The `mapDispatchToProps()` function is used to provide specific action creators to your React components so they can dispatch actions against the Redux store. It's similar in structure to the `mapStateToProps()` function you wrote in the last challenge. It returns an object that maps dispatch actions to property names, which become component `props`. However, instead of returning a piece of `state`, each property returns a function that calls `dispatch` with an action creator and any relevant action data. You have access to this `dispatch` because it's passed in to `mapDispatchToProps()` as a parameter when you define the function, just like you passed `state` to `mapStateToProps()`. Behind the scenes, React Redux is using Redux's `store.dispatch()` to conduct these dispatches with `mapDispatchToProps()`. This is similar to how it uses `store.subscribe()` for components that are mapped to `state`.
+
+For example, you have a `loginUser()` action creator that takes a `username` as an action payload. The object returned from `mapDispatchToProps()` for this action creator would look something like:
+
+```jsx
+{
+  submitLoginUser: function(username) {
+    dispatch(loginUser(username));
+  }
+}
+```
+
+# --instructions--
+
+The code editor provides an action creator called `addMessage()`. Write the function `mapDispatchToProps()` that takes `dispatch` as an argument, then returns an object. The object should have a property `submitNewMessage` set to the dispatch function, which takes a parameter for the new message to add when it dispatches `addMessage()`.
+
+# --hints--
+
+`addMessage` should return an object with keys `type` and `message`.
+
+```js
+assert(
+  (function () {
+    const addMessageTest = addMessage();
+    return (
+      addMessageTest.hasOwnProperty('type') &&
+      addMessageTest.hasOwnProperty('message')
+    );
+  })()
+);
+```
+
+`mapDispatchToProps` should be a function.
+
+```js
+assert(typeof mapDispatchToProps === 'function');
+```
+
+`mapDispatchToProps` should return an object.
+
+```js
+assert(typeof mapDispatchToProps() === 'object');
+```
+
+Dispatching `addMessage` with `submitNewMessage` from `mapDispatchToProps` should return a message to the dispatch function.
+
+```js
+assert(
+  (function () {
+    let testAction;
+    const dispatch = (fn) => {
+      testAction = fn;
+    };
+    let dispatchFn = mapDispatchToProps(dispatch);
+    dispatchFn.submitNewMessage('__TEST__MESSAGE__');
+    return (
+      testAction.type === 'ADD' && testAction.message === '__TEST__MESSAGE__'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const addMessage = (message) => {
+  return {
+    type: 'ADD',
+    message: message
+  }
+};
+
+// Change code below this line
+
+const mapDispatchToProps = (dispatch) => {
+  return {
+    submitNewMessage: function(message) {
+      dispatch(addMessage(message));
+    }
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-state-to-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-state-to-props.md
new file mode 100644
index 0000000000..e75b1fb34c
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/map-state-to-props.md
@@ -0,0 +1,69 @@
+---
+id: 5a24c314108439a4d4036145
+title: Map State to Props
+challengeType: 6
+forumTopicId: 301433
+dashedName: map-state-to-props
+---
+
+# --description--
+
+The `Provider` component allows you to provide `state` and `dispatch` to your React components, but you must specify exactly what state and actions you want. This way, you make sure that each component only has access to the state it needs. You accomplish this by creating two functions: `mapStateToProps()` and `mapDispatchToProps()`.
+
+In these functions, you declare what pieces of state you want to have access to and which action creators you need to be able to dispatch. Once these functions are in place, you'll see how to use the React Redux `connect` method to connect them to your components in another challenge.
+
+**Note:** Behind the scenes, React Redux uses the `store.subscribe()` method to implement `mapStateToProps()`.
+
+# --instructions--
+
+Create a function `mapStateToProps()`. This function should take `state` as an argument, then return an object which maps that state to specific property names. These properties will become accessible to your component via `props`. Since this example keeps the entire state of the app in a single array, you can pass that entire state to your component. Create a property `messages` in the object that's being returned, and set it to `state`.
+
+# --hints--
+
+The const `state` should be an empty array.
+
+```js
+assert(Array.isArray(state) && state.length === 0);
+```
+
+`mapStateToProps` should be a function.
+
+```js
+assert(typeof mapStateToProps === 'function');
+```
+
+`mapStateToProps` should return an object.
+
+```js
+assert(typeof mapStateToProps() === 'object');
+```
+
+Passing an array as state to `mapStateToProps` should return this array assigned to a key of `messages`.
+
+```js
+assert(mapStateToProps(['messages']).messages.pop() === 'messages');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const state = [];
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const state = [];
+
+// Change code below this line
+
+const mapStateToProps = (state) => {
+  return {
+    messages: state
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/moving-forward-from-here.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
new file mode 100644
index 0000000000..b7921af1cc
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/moving-forward-from-here.md
@@ -0,0 +1,69 @@
+---
+id: 5a24c314108439a4d403614a
+title: Moving Forward From Here
+challengeType: 6
+forumTopicId: 301434
+dashedName: moving-forward-from-here
+---
+
+# --description--
+
+Congratulations! You finished the lessons on React and Redux. There's one last item worth pointing out before you move on. Typically, you won't write React apps in a code editor like this. This challenge gives you a glimpse of what the syntax looks like if you're working with npm and a file system on your own machine. The code should look similar, except for the use of `import` statements (these pull in all of the dependencies that have been provided for you in the challenges). The "Managing Packages with npm" section covers npm in more detail.
+
+Finally, writing React and Redux code generally requires some configuration. This can get complicated quickly. If you are interested in experimenting on your own machine, the <a href="https://github.com/facebookincubator/create-react-app" target="_blank" rel="nofollow">Create React App</a> comes configured and ready to go.
+
+Alternatively, you can enable Babel as a JavaScript Preprocessor in CodePen, add React and ReactDOM as external JavaScript resources, and work there as well.
+
+# --instructions--
+
+Log the message `'Now I know React and Redux!'` to the console.
+
+# --hints--
+
+The message `Now I know React and Redux!` should be logged to the console.
+
+```js
+(getUserInput) =>
+  assert(
+    /console\s*\.\s*log\s*\(\s*('|"|`)Now I know React and Redux!\1\s*\)/.test(
+      getUserInput('index')
+    )
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+/*
+import React from 'react'
+import ReactDOM from 'react-dom'
+import { Provider, connect } from 'react-redux'
+import { createStore, combineReducers, applyMiddleware } from 'redux'
+import thunk from 'redux-thunk'
+
+import rootReducer from './redux/reducers'
+import App from './components/App'
+
+const store = createStore(
+  rootReducer,
+  applyMiddleware(thunk)
+);
+
+ReactDOM.render(
+  <Provider store={store}>
+    <App/>
+  </Provider>,
+  document.getElementById('root')
+);
+*/
+
+// Only change code below this line
+```
+
+# --solutions--
+
+```jsx
+console.log('Now I know React and Redux!');
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
new file mode 100644
index 0000000000..dfef55cdd2
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react-and-redux/use-provider-to-connect-redux-to-react.md
@@ -0,0 +1,263 @@
+---
+id: 5a24c314108439a4d4036144
+title: Use Provider to Connect Redux to React
+challengeType: 6
+forumTopicId: 301435
+dashedName: use-provider-to-connect-redux-to-react
+---
+
+# --description--
+
+In the last challenge, you created a Redux store to handle the messages array and created an action for adding new messages. The next step is to provide React access to the Redux store and the actions it needs to dispatch updates. React Redux provides its `react-redux` package to help accomplish these tasks.
+
+React Redux provides a small API with two key features: `Provider` and `connect`. Another challenge covers `connect`. The `Provider` is a wrapper component from React Redux that wraps your React app. This wrapper then allows you to access the Redux `store` and `dispatch` functions throughout your component tree. `Provider` takes two props, the Redux store and the child components of your app. Defining the `Provider` for an App component might look like this:
+
+```jsx
+<Provider store={store}>
+  <App/>
+</Provider>
+```
+
+# --instructions--
+
+The code editor now shows all your Redux and React code from the past several challenges. It includes the Redux store, actions, and the `DisplayMessages` component. The only new piece is the `AppWrapper` component at the bottom. Use this top level component to render the `Provider` from `ReactRedux`, and pass the Redux store as a prop. Then render the `DisplayMessages` component as a child. Once you are finished, you should see your React component rendered to the page.
+
+**Note:** React Redux is available as a global variable here, so you can access the Provider with dot notation. The code in the editor takes advantage of this and sets it to a constant `Provider` for you to use in the `AppWrapper` render method.
+
+# --hints--
+
+The `AppWrapper` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return mockedComponent.find('AppWrapper').length === 1;
+  })()
+);
+```
+
+The `Provider` wrapper component should have a prop of `store` passed to it, equal to the Redux store.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+      return __helpers
+        .removeWhiteSpace(getUserInput('index'))
+        .includes('<Providerstore={store}>');
+    })()
+  );
+```
+
+`DisplayMessages` should render as a child of `AppWrapper`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return (
+      mockedComponent.find('AppWrapper').find('DisplayMessages').length === 1
+    );
+  })()
+);
+```
+
+The `DisplayMessages` component should render an `h2`, `input`, `button`, and `ul` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(AppWrapper));
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h2').length === 1 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('ul').length === 1
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<AppWrapper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+    this.handleChange = this.handleChange.bind(this);
+    this.submitMessage = this.submitMessage.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {  
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+const Provider = ReactRedux.Provider;
+
+class AppWrapper extends React.Component {
+  // Render the Provider below this line
+
+  // Change code above this line
+};
+```
+
+# --solutions--
+
+```jsx
+// Redux:
+const ADD = 'ADD';
+
+const addMessage = (message) => {
+  return {
+    type: ADD,
+    message
+  }
+};
+
+const messageReducer = (state = [], action) => {
+  switch (action.type) {
+    case ADD:
+      return [
+        ...state,
+        action.message
+      ];
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(messageReducer);
+
+// React:
+
+class DisplayMessages extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      messages: []
+    }
+ this.handleChange = this.handleChange.bind(this);
+ this.submitMessage = this.submitMessage.bind(this);
+ }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  submitMessage() {
+    this.setState((state) => {
+      const currentMessage = state.input;
+      return {
+        input: '',
+        messages: state.messages.concat(currentMessage)
+      };  
+    });
+  }
+  render() {
+    return (
+      <div>
+        <h2>Type in a new Message:</h2>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange}/><br/>
+        <button onClick={this.submitMessage}>Submit</button>
+        <ul>
+          {this.state.messages.map( (message, idx) => {
+              return (
+                 <li key={idx}>{message}</li>
+              )
+            })
+          }
+        </ul>
+      </div>
+    );
+  }
+};
+
+const Provider = ReactRedux.Provider;
+
+class AppWrapper extends React.Component {
+  // Change code below this line
+  render() {
+    return (
+      <Provider store = {store}>
+        <DisplayMessages/>
+      </Provider>
+    );
+  }
+  // Change code above this line
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/access-props-using-this.props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/access-props-using-this.props.md
new file mode 100644
index 0000000000..5fe3a39679
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/access-props-using-this.props.md
@@ -0,0 +1,165 @@
+---
+id: 5a24c314108439a4d403616e
+title: Access Props Using this.props
+challengeType: 6
+forumTopicId: 301375
+dashedName: access-props-using-this-props
+---
+
+# --description--
+
+The last several challenges covered the basic ways to pass props to child components. But what if the child component that you're passing a prop to is an ES6 class component, rather than a stateless functional component? The ES6 class component uses a slightly different convention to access props.
+
+Anytime you refer to a class component within itself, you use the `this` keyword. To access props within a class component, you preface the code that you use to access it with `this`. For example, if an ES6 class component has a prop called `data`, you write `{this.props.data}` in JSX.
+
+# --instructions--
+
+Render an instance of the `ReturnTempPassword` component in the parent component `ResetPassword`. Here, give `ReturnTempPassword` a prop of `tempPassword` and assign it a value of a string that is at least 8 characters long. Within the child, `ReturnTempPassword`, access the `tempPassword` prop within the `strong` tags to make sure the user sees the temporary password.
+
+# --hints--
+
+The `ResetPassword` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The fourth child of `ResetPassword` should be the `ReturnTempPassword` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return (
+      mockedComponent.children().childAt(3).name() === 'ReturnTempPassword'
+    );
+  })()
+);
+```
+
+The `ReturnTempPassword` component should have a prop called `tempPassword`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return mockedComponent.find('ReturnTempPassword').props().tempPassword;
+  })()
+);
+```
+
+The `tempPassword` prop of `ReturnTempPassword` should be equal to a string of at least 8 characters.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    const temp = mockedComponent.find('ReturnTempPassword').props()
+      .tempPassword;
+    return typeof temp === 'string' && temp.length >= 8;
+  })()
+);
+```
+
+The `ReturnTempPassword` component should display the password you create as the `tempPassword` prop within `strong` tags.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ResetPassword));
+    return (
+      mockedComponent.find('strong').text() ===
+      mockedComponent.find('ReturnTempPassword').props().tempPassword
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ResetPassword />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class ReturnTempPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+            { /* Change code below this line */ }
+            <p>Your temporary password is: <strong></strong></p>
+            { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+
+class ResetPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+          <h2>Reset Password</h2>
+          <h3>We've generated a new temporary password for you.</h3>
+          <h3>Please reset this password from your account settings ASAP.</h3>
+          { /* Change code below this line */ }
+
+          { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class ReturnTempPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+            <p>Your temporary password is: <strong>{this.props.tempPassword}</strong></p>
+        </div>
+    );
+  }
+};
+
+class ResetPassword extends React.Component {
+  constructor(props) {
+    super(props);
+
+  }
+  render() {
+    return (
+        <div>
+          <h2>Reset Password</h2>
+          <h3>We've generated a new temporary password for you.</h3>
+          <h3>Please reset this password from your account settings ASAP.</h3>
+          { /* Change code below this line */ }
+          <ReturnTempPassword tempPassword="serrPbqrPnzc" />
+          { /* Change code above this line */ }
+        </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/add-comments-in-jsx.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-comments-in-jsx.md
new file mode 100644
index 0000000000..94a2131b27
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-comments-in-jsx.md
@@ -0,0 +1,82 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5e
+title: Add Comments in JSX
+challengeType: 6
+forumTopicId: 301376
+dashedName: add-comments-in-jsx
+---
+
+# --description--
+
+JSX is a syntax that gets compiled into valid JavaScript. Sometimes, for readability, you might need to add comments to your code. Like most programming languages, JSX has its own way to do this.
+
+To put comments inside JSX, you use the syntax `{/* */}` to wrap around the comment text.
+
+# --instructions--
+
+The code editor has a JSX element similar to what you created in the last challenge. Add a comment somewhere within the provided `div` element, without modifying the existing `h1` or `p` elements.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The existing `h1` and `p` elements should not be modified.
+
+```js
+assert(
+  JSX.props.children[0].props.children === 'This is a block of JSX' &&
+    JSX.props.children[1].props.children === "Here's a subtitle"
+);
+```
+
+The `JSX` should use valid comment syntax.
+
+```js
+assert(/<div>[\s\S]*{\s*\/\*[\s\S]*\*\/\s*}[\s\S]*<\/div>/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>This is a block of JSX</h1>
+    <p>Here's a subtitle</p>
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>This is a block of JSX</h1>
+  { /* this is a JSX comment */ }
+  <p>Here's a subtitle</p>
+</div>);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/add-event-listeners.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-event-listeners.md
new file mode 100644
index 0000000000..d49282cfe6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-event-listeners.md
@@ -0,0 +1,179 @@
+---
+id: 5a24c314108439a4d403617e
+title: Add Event Listeners
+challengeType: 6
+forumTopicId: 301377
+dashedName: add-event-listeners
+---
+
+# --description--
+
+The `componentDidMount()` method is also the best place to attach any event listeners you need to add for specific functionality. React provides a synthetic event system which wraps the native event system present in browsers. This means that the synthetic event system behaves exactly the same regardless of the user's browser - even if the native events may behave differently between different browsers.
+
+You've already been using some of these synthetic event handlers such as `onClick()`. React's synthetic event system is great to use for most interactions you'll manage on DOM elements. However, if you want to attach an event handler to the document or window objects, you have to do this directly.
+
+# --instructions--
+
+Attach an event listener in the `componentDidMount()` method for `keydown` events and have these events trigger the callback `handleKeyPress()`. You can use `document.addEventListener()` which takes the event (in quotes) as the first argument and the callback as the second argument.
+
+Then, in `componentWillUnmount()`, remove this same event listener. You can pass the same arguments to `document.removeEventListener()`. It's good practice to use this lifecycle method to do any clean up on React components before they are unmounted and destroyed. Removing event listeners is an example of one such clean up action.
+
+# --hints--
+
+`MyComponent` should render a `div` element which wraps an `h1` tag.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').children().find('h1').length === 1;
+  })()
+);
+```
+
+A `keydown` listener should be attached to the document in `componentDidMount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    const didMountString = mockedComponent
+      .instance()
+      .componentDidMount.toString();
+    return new RegExp(
+      'document.addEventListener(.|\n|\r)+keydown(.|\n|\r)+this.handleKeyPress'
+    ).test(didMountString);
+  })()
+);
+```
+
+The `keydown` listener should be removed from the document in `componentWillUnmount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    const willUnmountString = mockedComponent
+      .instance()
+      .componentWillUnmount.toString();
+    return new RegExp(
+      'document.removeEventListener(.|\n|\r)+keydown(.|\n|\r)+this.handleKeyPress'
+    ).test(willUnmountString);
+  })()
+);
+```
+
+Once the component has mounted, pressing `enter` should update its state and the rendered `h1` tag.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const beforeState = mockedComponent.state('message');
+  const beforeText = mockedComponent.find('h1').text();
+  const pressEnterKey = () => {
+    mockedComponent.instance().handleKeyPress({ keyCode: 13 });
+    return waitForIt(() => {
+      mockedComponent.update();
+      return {
+        state: mockedComponent.state('message'),
+        text: mockedComponent.find('h1').text()
+      };
+    });
+  };
+  const afterKeyPress = await pressEnterKey();
+  assert(
+    beforeState !== afterKeyPress.state && beforeText !== afterKeyPress.text
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      message: ''
+    };
+    this.handleEnter = this.handleEnter.bind(this);
+    this.handleKeyPress = this.handleKeyPress.bind(this);
+  }
+  // Change code below this line
+  componentDidMount() {
+
+  }
+  componentWillUnmount() {
+
+  }
+  // Change code above this line
+  handleEnter() {
+    this.setState((state) => ({
+      message: state.message + 'You pressed the enter key! '
+    }));
+  }
+  handleKeyPress(event) {
+    if (event.keyCode === 13) {
+      this.handleEnter();
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.message}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      message: ''
+    };
+    this.handleKeyPress = this.handleKeyPress.bind(this);
+    this.handleEnter = this.handleEnter.bind(this);  }
+  componentDidMount() {
+    // Change code below this line
+    document.addEventListener('keydown', this.handleKeyPress);
+    // Change code above this line
+  }
+  componentWillUnmount() {
+    // Change code below this line
+    document.removeEventListener('keydown', this.handleKeyPress);
+    // Change code above this line
+  }
+  handleEnter() {
+    this.setState((state) => ({
+      message: state.message + 'You pressed the enter key! '
+    }));
+  }
+  handleKeyPress(event) {
+    if (event.keyCode === 13) {
+      this.handleEnter();
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.message}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/add-inline-styles-in-react.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-inline-styles-in-react.md
new file mode 100644
index 0000000000..0ced56da50
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/add-inline-styles-in-react.md
@@ -0,0 +1,112 @@
+---
+id: 5a24c314108439a4d4036182
+title: Add Inline Styles in React
+challengeType: 6
+forumTopicId: 301378
+dashedName: add-inline-styles-in-react
+---
+
+# --description--
+
+You may have noticed in the last challenge that there were several other syntax differences from HTML inline styles in addition to the `style` attribute set to a JavaScript object. First, the names of certain CSS style properties use camel case. For example, the last challenge set the size of the font with `fontSize` instead of `font-size`. Hyphenated words like `font-size` are invalid syntax for JavaScript object properties, so React uses camel case. As a rule, any hyphenated style properties are written using camel case in JSX.
+
+All property value length units (like `height`, `width`, and `fontSize`) are assumed to be in `px` unless otherwise specified. If you want to use `em`, for example, you wrap the value and the units in quotes, like `{fontSize: "4em"}`. Other than the length values that default to `px`, all other property values should be wrapped in quotes.
+
+# --instructions--
+
+If you have a large set of styles, you can assign a style `object` to a constant to keep your code organized. Declare your styles constant as a global variable at the top of the file. Initialize `styles` constant and assign an `object` with three style properties and their values to it. Give the `div` a color of `purple`, a font-size of `40`, and a border of `2px solid purple`. Then set the `style` attribute equal to the `styles` constant.
+
+# --hints--
+
+The `styles` variable should be an `object` with three properties.
+
+```js
+assert(Object.keys(styles).length === 3);
+```
+
+The `styles` variable should have a `color` property set to a value of `purple`.
+
+```js
+assert(styles.color === 'purple');
+```
+
+The `styles` variable should have a `fontSize` property set to a value of `40`.
+
+```js
+assert(styles.fontSize === 40);
+```
+
+The `styles` variable should have a `border` property set to a value of `2px solid purple`.
+
+```js
+assert(styles.border === '2px solid purple');
+```
+
+The component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.shallow(React.createElement(Colorful));
+    return mockedComponent.type() === 'div';
+  })()
+);
+```
+
+The `div` element should have its styles defined by the `styles` object.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.shallow(React.createElement(Colorful));
+    return (
+      mockedComponent.props().style.color === 'purple' &&
+      mockedComponent.props().style.fontSize === 40 &&
+      mockedComponent.props().style.border === '2px solid purple'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Colorful />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+// Change code above this line
+class Colorful extends React.Component {
+  render() {
+    // Change code below this line
+    return (
+      <div style={{color: "yellow", fontSize: 24}}>Style Me!</div>
+    );
+    // Change code above this line
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const styles = {
+  color: "purple",
+  fontSize: 40,
+  border: "2px solid purple"
+};
+// Change code above this line
+class Colorful extends React.Component {
+  render() {
+    // Change code below this line
+    return (
+      <div style={styles}>Style Me!</div>
+    );
+    // Change code above this line
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/bind-this-to-a-class-method.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/bind-this-to-a-class-method.md
new file mode 100644
index 0000000000..ed61f77d7f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/bind-this-to-a-class-method.md
@@ -0,0 +1,136 @@
+---
+id: 5a24c314108439a4d4036174
+title: Bind 'this' to a Class Method
+challengeType: 6
+forumTopicId: 301379
+dashedName: bind-this-to-a-class-method
+---
+
+# --description--
+
+In addition to setting and updating `state`, you can also define methods for your component class. A class method typically needs to use the `this` keyword so it can access properties on the class (such as `state` and `props`) inside the scope of the method. There are a few ways to allow your class methods to access `this`.
+
+One common way is to explicitly bind `this` in the constructor so `this` becomes bound to the class methods when the component is initialized. You may have noticed the last challenge used `this.handleClick = this.handleClick.bind(this)` for its `handleClick` method in the constructor. Then, when you call a function like `this.setState()` within your class method, `this` refers to the class and will not be `undefined`.
+
+**Note:** The `this` keyword is one of the most confusing aspects of JavaScript but it plays an important role in React. Although its behavior here is totally normal, these lessons aren't the place for an in-depth review of `this` so please refer to other lessons if the above is confusing!
+
+# --instructions--
+
+The code editor has a component with a `state` that keeps track of the text. It also has a method which allows you to set the text to `You clicked!`. However, the method doesn't work because it's using the `this` keyword that is undefined. Fix it by explicitly binding `this` to the `handleClick()` method in the component's constructor.
+
+Next, add a click handler to the `button` element in the render method. It should trigger the `handleClick()` method when the button receives a click event. Remember that the method you pass to the `onClick` handler needs curly braces because it should be interpreted directly as JavaScript.
+
+Once you complete the above steps you should be able to click the button and see `You clicked!`.
+
+# --hints--
+
+`MyComponent` should return a `div` element which wraps two elements, a button and an `h1` element, in that order.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).find('div').length === 1 &&
+    Enzyme.mount(React.createElement(MyComponent))
+      .find('div')
+      .childAt(0)
+      .type() === 'button' &&
+    Enzyme.mount(React.createElement(MyComponent))
+      .find('div')
+      .childAt(1)
+      .type() === 'h1'
+);
+```
+
+The state of `MyComponent` should initialize with the key value pair `{ text: "Hello" }`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('text') === 'Hello'
+);
+```
+
+Clicking the `button` element should run the `handleClick` method and set the state `text` to `You clicked!`.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ text: 'Hello' });
+    return waitForIt(() => mockedComponent.state('text'));
+  };
+  const second = () => {
+    mockedComponent.find('button').simulate('click');
+    return waitForIt(() => mockedComponent.state('text'));
+  };
+  const firstValue = await first();
+  const secondValue = await second();
+  assert(firstValue === 'Hello' && secondValue === 'You clicked!');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      text: "Hello"
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  handleClick() {
+    this.setState({
+      text: "You clicked!"
+    });
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <button>Click Me</button>
+        { /* Change code above this line */ }
+        <h1>{this.state.text}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      text: "Hello"
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState({
+      text: "You clicked!"
+    });
+  }
+  render() {
+    return (
+      <div>
+        <button onClick = {this.handleClick}>Click Me</button>
+        <h1>{this.state.text}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
new file mode 100644
index 0000000000..9a08852594
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/change-inline-css-conditionally-based-on-component-state.md
@@ -0,0 +1,176 @@
+---
+id: 5a24c314108439a4d4036189
+title: Change Inline CSS Conditionally Based on Component State
+challengeType: 6
+forumTopicId: 301380
+dashedName: change-inline-css-conditionally-based-on-component-state
+---
+
+# --description--
+
+At this point, you've seen several applications of conditional rendering and the use of inline styles. Here's one more example that combines both of these topics. You can also render CSS conditionally based on the state of a React component. To do this, you check for a condition, and if that condition is met, you modify the styles object that's assigned to the JSX elements in the render method.
+
+This paradigm is important to understand because it is a dramatic shift from the more traditional approach of applying styles by modifying DOM elements directly (which is very common with jQuery, for example). In that approach, you must keep track of when elements change and also handle the actual manipulation directly. It can become difficult to keep track of changes, potentially making your UI unpredictable. When you set a style object based on a condition, you describe how the UI should look as a function of the application's state. There is a clear flow of information that only moves in one direction. This is the preferred method when writing applications with React.
+
+# --instructions--
+
+The code editor has a simple controlled input component with a styled border. You want to style this border red if the user types more than 15 characters of text in the input box. Add a condition to check for this and, if the condition is valid, set the input border style to `3px solid red`. You can try it out by entering text in the input.
+
+# --hints--
+
+The `GateKeeper` component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return mockedComponent.find('div').length === 1;
+  })()
+);
+```
+
+The `GateKeeper` component should be initialized with a state key `input` set to an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return mockedComponent.state().input === '';
+  })()
+);
+```
+
+The `GateKeeper` component should render an `h3` tag and an `input` tag.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return (
+      mockedComponent.find('h3').length === 1 &&
+      mockedComponent.find('input').length === 1
+    );
+  })()
+);
+```
+
+The `input` tag should initially have a style of `1px solid black` for the `border` property.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+    return (
+      mockedComponent.find('input').props().style.border === '1px solid black'
+    );
+  })()
+);
+```
+
+The `input` tag should be styled with a border of `3px solid red` if the input value in state is longer than 15 characters.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 100));
+  const mockedComponent = Enzyme.mount(React.createElement(GateKeeper));
+  const simulateChange = (el, value) =>
+    el.simulate('change', { target: { value } });
+  let initialStyle = mockedComponent.find('input').props().style.border;
+  const state_1 = () => {
+    mockedComponent.setState({ input: 'this is 15 char' });
+    return waitForIt(() => mockedComponent.find('input').props().style.border);
+  };
+  const state_2 = () => {
+    mockedComponent.setState({
+      input: 'A very long string longer than 15 characters.'
+    });
+    return waitForIt(() => mockedComponent.find('input').props().style.border);
+  };
+  const style_1 = await state_1();
+  const style_2 = await state_2();
+  assert(
+    initialStyle === '1px solid black' &&
+      style_1 === '1px solid black' &&
+      style_2 === '3px solid red'
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<GateKeeper />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class GateKeeper extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({ input: event.target.value })
+  }
+  render() {
+    let inputStyle = {
+      border: '1px solid black'
+    };
+    // Change code below this line
+
+    // Change code above this line
+    return (
+      <div>
+        <h3>Don't Type Too Much:</h3>
+        <input
+          type="text"
+          style={inputStyle}
+          value={this.state.input}
+          onChange={this.handleChange} />
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class GateKeeper extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({ input: event.target.value })
+  }
+  render() {
+    let inputStyle = {
+      border: '1px solid black'
+    };
+    if (this.state.input.length > 15) {
+      inputStyle.border = '3px solid red';
+    };
+    return (
+      <div>
+        <h3>Don't Type Too Much:</h3>
+        <input
+          type="text"
+          style={inputStyle}
+          value={this.state.input}
+          onChange={this.handleChange} />
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/compose-react-components.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/compose-react-components.md
new file mode 100644
index 0000000000..f39e29008a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/compose-react-components.md
@@ -0,0 +1,199 @@
+---
+id: 5a24c314108439a4d4036166
+title: Compose React Components
+challengeType: 6
+forumTopicId: 301381
+dashedName: compose-react-components
+---
+
+# --description--
+
+As the challenges continue to use more complex compositions with React components and JSX, there is one important point to note. Rendering ES6 style class components within other components is no different than rendering the simple components you used in the last few challenges. You can render JSX elements, stateless functional components, and ES6 class components within other components.
+
+# --instructions--
+
+In the code editor, the `TypesOfFood` component is already rendering a component called `Vegetables`. Also, there is the `Fruits` component from the last challenge.
+
+Nest two components inside of `Fruits` — first `NonCitrus`, and then `Citrus`. Both of these components are provided for you behind the scenes. Next, nest the `Fruits` class component into the `TypesOfFood` component, below the `h1` header and above `Vegetables`. The result should be a series of nested components, which uses two different component types.
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `TypesOfFood` component should return the `Fruits` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(1).name() === 'Fruits';
+  })()
+);
+```
+
+The `Fruits` component should return the `NonCitrus` component and the `Citrus` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return (
+      mockedComponent.find('Fruits').children().find('NonCitrus').length ===
+        1 &&
+      mockedComponent.find('Fruits').children().find('Citrus').length === 1
+    );
+  })()
+);
+```
+
+The `TypesOfFood` component should return the `Vegetables` component below the `Fruits` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(2).name() === 'Vegetables';
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+class NonCitrus extends React.Component {
+  render() {
+    return (
+      <div>
+        <h4>Non-Citrus:</h4>
+        <ul>
+          <li>Apples</li>
+          <li>Blueberries</li>
+          <li>Strawberries</li>
+          <li>Bananas</li>
+        </ul>
+      </div>
+    );
+  }
+};
+class Citrus extends React.Component {
+  render() {
+    return (
+      <div>
+        <h4>Citrus:</h4>
+        <ul>
+          <li>Lemon</li>
+          <li>Lime</li>
+          <li>Orange</li>
+          <li>Grapefruit</li>
+        </ul>
+      </div>
+    );
+  }
+};
+class Vegetables extends React.Component {
+  render() {
+    return (
+      <div>
+        <h2>Vegetables:</h2>
+        <ul>
+          <li>Brussel Sprouts</li>
+          <li>Broccoli</li>
+          <li>Squash</li>
+        </ul>
+      </div>
+    );
+     }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<TypesOfFood />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Fruits extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h2>Fruits:</h2>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+     super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+        <Vegetables />
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Fruits extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h2>Fruits:</h2>
+        { /* Change code below this line */ }
+        <NonCitrus />
+        <Citrus />
+        { /* Change code above this line */ }
+      </div>
+    )
+  }
+}
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+     super(props);
+  }
+    render() {
+      return (
+        <div>
+        <h1>Types of Food:</h1>
+          { /* Change code below this line */ }
+          <Fruits />
+          { /* Change code above this line */ }
+          <Vegetables />
+        </div>
+      );
+    }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-complex-jsx-element.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-complex-jsx-element.md
new file mode 100644
index 0000000000..595047ee70
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-complex-jsx-element.md
@@ -0,0 +1,110 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5d
+title: Create a Complex JSX Element
+challengeType: 6
+forumTopicId: 301382
+dashedName: create-a-complex-jsx-element
+---
+
+# --description--
+
+The last challenge was a simple example of JSX, but JSX can represent more complex HTML as well.
+
+One important thing to know about nested JSX is that it must return a single element.
+
+This one parent element would wrap all of the other levels of nested elements.
+
+For instance, several JSX elements written as siblings with no parent wrapper element will not transpile.
+
+Here's an example:
+
+**Valid JSX:**
+
+```jsx
+<div>
+  <p>Paragraph One</p>
+  <p>Paragraph Two</p>
+  <p>Paragraph Three</p>
+</div>
+```
+
+**Invalid JSX:**
+
+```jsx
+<p>Paragraph One</p>
+<p>Paragraph Two</p>
+<p>Paragraph Three</p>
+```
+
+# --instructions--
+
+Define a new constant `JSX` that renders a `div` which contains the following elements in order:
+
+An `h1`, a `p`, and an unordered list that contains three `li` items. You can include any text you want within each element.
+
+**Note:** When rendering multiple elements like this, you can wrap them all in parentheses, but it's not strictly required. Also notice this challenge uses a `div` tag to wrap all the child elements within a single parent element. If you remove the `div`, the JSX will no longer transpile. Keep this in mind, since it will also apply when you return JSX elements in React components.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The `div` should contain a `ul` tag as the third element.
+
+```js
+assert(JSX.props.children[2].type === 'ul');
+```
+
+The `ul` should contain three `li` elements.
+
+```js
+assert(
+  JSX.props.children
+    .filter((ele) => ele.type === 'ul')[0]
+    .props.children.filter((ele) => ele.type === 'li').length === 3
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>Hello JSX!</h1>
+  <p>Some info</p>
+  <ul>
+    <li>An item</li>
+    <li>Another item</li>
+    <li>A third item</li>
+  </ul>
+</div>);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-component-with-composition.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-component-with-composition.md
new file mode 100644
index 0000000000..956c87a620
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-component-with-composition.md
@@ -0,0 +1,134 @@
+---
+id: 5a24c314108439a4d4036164
+title: Create a Component with Composition
+challengeType: 6
+forumTopicId: 301383
+dashedName: create-a-component-with-composition
+---
+
+# --description--
+
+Now we will look at how we can compose multiple React components together. Imagine you are building an app and have created three components: a `Navbar`, `Dashboard`, and `Footer`.
+
+To compose these components together, you could create an `App` *parent* component which renders each of these three components as *children*. To render a component as a child in a React component, you include the component name written as a custom HTML tag in the JSX. For example, in the `render` method you could write:
+
+```jsx
+return (
+ <App>
+  <Navbar />
+  <Dashboard />
+  <Footer />
+ </App>
+)
+```
+
+When React encounters a custom HTML tag that references another component (a component name wrapped in `< />` like in this example), it renders the markup for that component in the location of the tag. This should illustrate the parent/child relationship between the `App` component and the `Navbar`, `Dashboard`, and `Footer`.
+
+# --instructions--
+
+In the code editor, there is a simple functional component called `ChildComponent` and a class component called `ParentComponent`. Compose the two together by rendering the `ChildComponent` within the `ParentComponent`. Make sure to close the `ChildComponent` tag with a forward slash.
+
+**Note:** `ChildComponent` is defined with an ES6 arrow function because this is a very common practice when using React. However, know that this is just a function. If you aren't familiar with the arrow function syntax, please refer to the JavaScript section.
+
+# --hints--
+
+The React component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    var shallowRender = Enzyme.shallow(React.createElement(ParentComponent));
+    return shallowRender.type() === 'div';
+  })()
+);
+```
+
+The component should return two nested elements.
+
+```js
+assert(
+  (function () {
+    var shallowRender = Enzyme.shallow(React.createElement(ParentComponent));
+    return shallowRender.children().length === 2;
+  })()
+);
+```
+
+The component should return the `ChildComponent` as its second child.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ParentComponent));
+    return (
+      mockedComponent.find('ParentComponent').find('ChildComponent').length ===
+      1
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ParentComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const ChildComponent = () => {
+  return (
+    <div>
+      <p>I am the child</p>
+    </div>
+  );
+};
+
+class ParentComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>I am the parent</h1>
+        { /* Change code below this line */ }
+
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const ChildComponent = () => {
+  return (
+    <div>
+      <p>I am the child</p>
+    </div>
+  );
+};
+
+class ParentComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>I am the parent</h1>
+        { /* Change code below this line */ }
+        <ChildComponent />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-form.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-form.md
new file mode 100644
index 0000000000..1990de794d
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-form.md
@@ -0,0 +1,209 @@
+---
+id: 5a24c314108439a4d4036179
+title: Create a Controlled Form
+challengeType: 6
+forumTopicId: 301384
+dashedName: create-a-controlled-form
+---
+
+# --description--
+
+The last challenge showed that React can control the internal state for certain elements like `input` and `textarea`, which makes them controlled components. This applies to other form elements as well, including the regular HTML `form` element.
+
+# --instructions--
+
+The `MyForm` component is set up with an empty `form` with a submit handler. The submit handler will be called when the form is submitted.
+
+We've added a button which submits the form. You can see it has the `type` set to `submit` indicating it is the button controlling the form. Add the `input` element in the `form` and set its `value` and `onChange()` attributes like the last challenge. You should then complete the `handleSubmit` method so that it sets the component state property `submit` to the current input value in the local `state`.
+
+**Note:** You also must call `event.preventDefault()` in the submit handler, to prevent the default form submit behavior which will refresh the web page.
+
+Finally, create an `h1` tag after the `form` which renders the `submit` value from the component's `state`. You can then type in the form and click the button (or press enter), and you should see your input rendered to the page.
+
+# --hints--
+
+`MyForm` should return a `div` element which contains a `form` and an `h1` tag. The form should include an `input` and a `button`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+    return (
+      mockedComponent.find('div').children().find('form').length === 1 &&
+      mockedComponent.find('div').children().find('h1').length === 1 &&
+      mockedComponent.find('form').children().find('input').length === 1 &&
+      mockedComponent.find('form').children().find('button').length === 1
+    );
+  })()
+);
+```
+
+The state of `MyForm` should initialize with `input` and `submit` properties, both set to empty strings.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyForm)).state('input') === '' &&
+    Enzyme.mount(React.createElement(MyForm)).state('submit') === ''
+);
+```
+
+Typing in the `input` element should update the `input` property of the component's state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    return mockedComponent.state('input');
+  };
+  const _2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return {
+      state: mockedComponent.state('input'),
+      inputVal: mockedComponent.find('input').props().value
+    };
+  };
+  const before = _1();
+  const after = _2();
+  assert(
+    before === '' &&
+      after.state === 'TestInput' &&
+      after.inputVal === 'TestInput'
+  );
+})();
+```
+
+Submitting the form should run `handleSubmit` which should set the `submit` property in state equal to the current input.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    mockedComponent.setState({ submit: '' });
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'SubmitInput' } });
+    return mockedComponent.state('submit');
+  };
+  const _2 = () => {
+    mockedComponent.find('form').simulate('submit');
+    return mockedComponent.state('submit');
+  };
+  const before = _1();
+  const after = _2();
+  assert(before === '' && after === 'SubmitInput');
+})();
+```
+
+The `h1` header should render the value of the `submit` field from the component's state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyForm));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    mockedComponent.setState({ submit: '' });
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return mockedComponent.find('h1').text();
+  };
+  const _2 = () => {
+    mockedComponent.find('form').simulate('submit');
+    return mockedComponent.find('h1').text();
+  };
+  const before = _1();
+  const after = _2();
+  assert(before === '' && after === 'TestInput');
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyForm />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyForm extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      submit: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+    this.handleSubmit = this.handleSubmit.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  handleSubmit(event) {
+    // Change code below this line
+    
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <form onSubmit={this.handleSubmit}>
+          {/* Change code below this line */}
+
+          {/* Change code above this line */}
+          <button type='submit'>Submit!</button>
+        </form>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyForm extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: '',
+      submit: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+    this.handleSubmit = this.handleSubmit.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  handleSubmit(event) {
+    event.preventDefault();
+    this.setState(state => ({
+      submit: state.input
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <form onSubmit={this.handleSubmit}>
+          <input value={this.state.input} onChange={this.handleChange} />
+          <button type='submit'>Submit!</button>
+        </form>
+        <h1>{this.state.submit}</h1>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-input.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-input.md
new file mode 100644
index 0000000000..e38cf90ad5
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-controlled-input.md
@@ -0,0 +1,150 @@
+---
+id: 5a24c314108439a4d4036178
+title: Create a Controlled Input
+challengeType: 6
+forumTopicId: 301385
+dashedName: create-a-controlled-input
+---
+
+# --description--
+
+Your application may have more complex interactions between `state` and the rendered UI. For example, form control elements for text input, such as `input` and `textarea`, maintain their own state in the DOM as the user types. With React, you can move this mutable state into a React component's `state`. The user's input becomes part of the application `state`, so React controls the value of that input field. Typically, if you have React components with input fields the user can type into, it will be a controlled input form.
+
+# --instructions--
+
+The code editor has the skeleton of a component called `ControlledInput` to create a controlled `input` element. The component's `state` is already initialized with an `input` property that holds an empty string. This value represents the text a user types into the `input` field.
+
+First, create a method called `handleChange()` that has a parameter called `event`. When the method is called, it receives an `event` object that contains a string of text from the `input` element. You can access this string with `event.target.value` inside the method. Update the `input` property of the component's `state` with this new string.
+
+In the `render` method, create the `input` element above the `h4` tag. Add a `value` attribute which is equal to the `input` property of the component's `state`. Then add an `onChange()` event handler set to the `handleChange()` method.
+
+When you type in the input box, that text is processed by the `handleChange()` method, set as the `input` property in the local `state`, and rendered as the value in the `input` box on the page. The component `state` is the single source of truth regarding the input data.
+
+Last but not least, don't forget to add the necessary bindings in the constructor.
+
+# --hints--
+
+`ControlledInput` should return a `div` element which contains an `input` and a `p` tag.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(ControlledInput))
+    .find('div')
+    .children()
+    .find('input').length === 1 &&
+    Enzyme.mount(React.createElement(ControlledInput))
+      .find('div')
+      .children()
+      .find('p').length === 1
+);
+```
+
+The state of `ControlledInput` should initialize with an `input` property set to an empty string.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(ControlledInput)).state('input'),
+  ''
+);
+```
+
+Typing in the input element should update the state and the value of the input, and the `p` element should render this state as you type.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(ControlledInput));
+  const _1 = () => {
+    mockedComponent.setState({ input: '' });
+    return waitForIt(() => mockedComponent.state('input'));
+  };
+  const _2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return waitForIt(() => ({
+      state: mockedComponent.state('input'),
+      text: mockedComponent.find('p').text(),
+      inputVal: mockedComponent.find('input').props().value
+    }));
+  };
+  const before = await _1();
+  const after = await _2();
+  assert(
+    before === '' &&
+      after.state === 'TestInput' &&
+      after.text === 'TestInput' &&
+      after.inputVal === 'TestInput'
+  );
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ControlledInput />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class ControlledInput extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */}
+
+        { /* Change code above this line */}
+        <h4>Controlled Input:</h4>
+        <p>{this.state.input}</p>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class ControlledInput extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      input: ''
+    };
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      input: event.target.value
+    });
+  }
+  render() {
+    return (
+      <div>
+        <input
+          value={this.state.input}
+          onChange={this.handleChange} />
+        <h4>Controlled Input:</h4>
+
+        <p>{this.state.input}</p>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-react-component.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-react-component.md
new file mode 100644
index 0000000000..6a92615c1d
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-react-component.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036163
+title: Create a React Component
+challengeType: 6
+forumTopicId: 301386
+dashedName: create-a-react-component
+---
+
+# --description--
+
+The other way to define a React component is with the ES6 `class` syntax. In the following example, `Kitten` extends `React.Component`:
+
+```jsx
+class Kitten extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <h1>Hi</h1>
+    );
+  }
+}
+```
+
+This creates an ES6 class `Kitten` which extends the `React.Component` class. So the `Kitten` class now has access to many useful React features, such as local state and lifecycle hooks. Don't worry if you aren't familiar with these terms yet, they will be covered in greater detail in later challenges. Also notice the `Kitten` class has a `constructor` defined within it that calls `super()`. It uses `super()` to call the constructor of the parent class, in this case `React.Component`. The constructor is a special method used during the initialization of objects that are created with the `class` keyword. It is best practice to call a component's `constructor` with `super`, and pass `props` to both. This makes sure the component is initialized properly. For now, know that it is standard for this code to be included. Soon you will see other uses for the constructor as well as `props`.
+
+# --instructions--
+
+`MyComponent` is defined in the code editor using class syntax. Finish writing the `render` method so it returns a `div` element that contains an `h1` with the text `Hello React!`.
+
+# --hints--
+
+The React component should return a `div` element.
+
+```js
+assert(Enzyme.shallow(React.createElement(MyComponent)).type() === 'div');
+```
+
+The returned `div` should render an `h1` header within it.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.shallow(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The `h1` header should contain the string `Hello React!`.
+
+```js
+assert(
+  Enzyme.shallow(React.createElement(MyComponent)).html() ===
+    '<div><h1>Hello React!</h1></div>'
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Change code below this line
+
+
+
+    // Change code above this line
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    // Change code below this line
+    return (
+      <div>
+        <h1>Hello React!</h1>
+      </div>
+    );
+    // Change code above this line
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-simple-jsx-element.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-simple-jsx-element.md
new file mode 100644
index 0000000000..6873473687
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-simple-jsx-element.md
@@ -0,0 +1,57 @@
+---
+id: 587d7dbc367417b2b2512bb1
+title: Create a Simple JSX Element
+challengeType: 6
+forumTopicId: 301390
+dashedName: create-a-simple-jsx-element
+---
+
+# --description--
+
+React is an Open Source view library created and maintained by Facebook. It's a great tool to render the User Interface (UI) of modern web applications.
+
+React uses a syntax extension of JavaScript called JSX that allows you to write HTML directly within JavaScript. This has several benefits. It lets you use the full programmatic power of JavaScript within HTML, and helps to keep your code readable. For the most part, JSX is similar to the HTML that you have already learned, however there are a few key differences that will be covered throughout these challenges.
+
+For instance, because JSX is a syntactic extension of JavaScript, you can actually write JavaScript directly within JSX. To do this, you simply include the code you want to be treated as JavaScript within curly braces: `{ 'this is treated as JavaScript code' }`. Keep this in mind, since it's used in several future challenges.
+
+However, because JSX is not valid JavaScript, JSX code must be compiled into JavaScript. The transpiler Babel is a popular tool for this process. For your convenience, it's already added behind the scenes for these challenges. If you happen to write syntactically invalid JSX, you will see the first test in these challenges fail.
+
+It's worth noting that under the hood the challenges are calling `ReactDOM.render(JSX, document.getElementById('root'))`. This function call is what places your JSX into React's own lightweight representation of the DOM. React then uses snapshots of its own DOM to optimize updating only specific parts of the actual DOM.
+
+# --instructions--
+
+The current code uses JSX to assign a `div` element to the constant `JSX`. Replace the `div` with an `h1` element and add the text `Hello JSX!` inside it.
+
+# --hints--
+
+The constant `JSX` should return an `h1` element.
+
+```js
+assert(JSX.type === 'h1');
+```
+
+The `h1` tag should include the text `Hello JSX!`
+
+```js
+assert(Enzyme.shallow(JSX).contains('Hello JSX!'));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = <div></div>;
+```
+
+# --solutions--
+
+```jsx
+const JSX = <h1>Hello JSX!</h1>;
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateful-component.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateful-component.md
new file mode 100644
index 0000000000..41ebc9c77b
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateful-component.md
@@ -0,0 +1,134 @@
+---
+id: 5a24c314108439a4d4036170
+title: Create a Stateful Component
+challengeType: 6
+forumTopicId: 301391
+dashedName: create-a-stateful-component
+---
+
+# --description--
+
+One of the most important topics in React is `state`. State consists of any data your application needs to know about, that can change over time. You want your apps to respond to state changes and present an updated UI when necessary. React offers a nice solution for the state management of modern web applications.
+
+You create state in a React component by declaring a `state` property on the component class in its `constructor`. This initializes the component with `state` when it is created. The `state` property must be set to a JavaScript `object`. Declaring it looks like this:
+
+```jsx
+this.state = {
+
+}
+```
+
+You have access to the `state` object throughout the life of your component. You can update it, render it in your UI, and pass it as props to child components. The `state` object can be as complex or as simple as you need it to be. Note that you must create a class component by extending `React.Component` in order to create `state` like this.
+
+# --instructions--
+
+There is a component in the code editor that is trying to render a `name` property from its `state`. However, there is no `state` defined. Initialize the component with `state` in the `constructor` and assign your name to a property of `name`.
+
+# --hints--
+
+`StatefulComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    return mockedComponent.find('StatefulComponent').length === 1;
+  })()
+);
+```
+
+`StatefulComponent` should render a `div` and an `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h1').length === 1
+    );
+  })()
+);
+```
+
+The state of `StatefulComponent` should be initialized with a property `name` set to a string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState === 'object' && typeof initialState.name === 'string'
+    );
+  })()
+);
+```
+
+The property `name` in the state of `StatefulComponent` should render in the `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(StatefulComponent)
+    );
+    const initialState = mockedComponent.state();
+    return mockedComponent.find('h1').text() === initialState.name;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<StatefulComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class StatefulComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    // Only change code below this line
+
+    // Only change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class StatefulComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp!'
+    }
+  }
+  render() {
+    return (
+      <div>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateless-functional-component.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateless-functional-component.md
new file mode 100644
index 0000000000..e76b742ada
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/create-a-stateless-functional-component.md
@@ -0,0 +1,102 @@
+---
+id: 5a24c314108439a4d4036162
+title: Create a Stateless Functional Component
+challengeType: 6
+forumTopicId: 301392
+dashedName: create-a-stateless-functional-component
+---
+
+# --description--
+
+Components are the core of React. Everything in React is a component and here you will learn how to create one.
+
+There are two ways to create a React component. The first way is to use a JavaScript function. Defining a component in this way creates a *stateless functional component*. The concept of state in an application will be covered in later challenges. For now, think of a stateless component as one that can receive data and render it, but does not manage or track changes to that data. (We'll cover the second way to create a React component in the next challenge.)
+
+To create a component with a function, you simply write a JavaScript function that returns either JSX or `null`. One important thing to note is that React requires your function name to begin with a capital letter. Here's an example of a stateless functional component that assigns an HTML class in JSX:
+
+```jsx
+const DemoComponent = function() {
+  return (
+    <div className='customClass' />
+  );
+};
+```
+
+After being transpiled, the `<div>` will have a CSS class of `customClass`.
+
+Because a JSX component represents HTML, you could put several components together to create a more complex HTML page. This is one of the key advantages of the component architecture React provides. It allows you to compose your UI from many separate, isolated components. This makes it easier to build and maintain complex user interfaces.
+
+# --instructions--
+
+The code editor has a function called `MyComponent`. Complete this function so it returns a single `div` element which contains some string of text.
+
+**Note:** The text is considered a child of the `div` element, so you will not be able to use a self-closing tag.
+
+# --hints--
+
+`MyComponent` should return JSX.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.length === 1;
+  })()
+);
+```
+
+`MyComponent` should return a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `div` element should contain a string of text.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').text() !== '';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const MyComponent = function() {
+  // Change code below this line
+
+
+
+  // Change code above this line
+}
+```
+
+# --solutions--
+
+```jsx
+const MyComponent = function() {
+  // Change code below this line
+  return (
+    <div>
+      Demo Solution
+    </div>
+  );
+  // Change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/define-an-html-class-in-jsx.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/define-an-html-class-in-jsx.md
new file mode 100644
index 0000000000..2438f4b291
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/define-an-html-class-in-jsx.md
@@ -0,0 +1,62 @@
+---
+id: 5a24c314108439a4d4036160
+title: Define an HTML Class in JSX
+challengeType: 6
+forumTopicId: 301393
+dashedName: define-an-html-class-in-jsx
+---
+
+# --description--
+
+Now that you're getting comfortable writing JSX, you may be wondering how it differs from HTML.
+
+So far, it may seem that HTML and JSX are exactly the same.
+
+One key difference in JSX is that you can no longer use the word `class` to define HTML classes. This is because `class` is a reserved word in JavaScript. Instead, JSX uses `className`.
+
+In fact, the naming convention for all HTML attributes and event references in JSX become camelCase. For example, a click event in JSX is `onClick`, instead of `onclick`. Likewise, `onchange` becomes `onChange`. While this is a subtle difference, it is an important one to keep in mind moving forward.
+
+# --instructions--
+
+Apply a class of `myDiv` to the `div` provided in the JSX code.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert.strictEqual(JSX.type, 'div');
+```
+
+The `div` should have a class of `myDiv`.
+
+```js
+assert.strictEqual(JSX.props.className, 'myDiv');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>Add a class to this div</h1>
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div className = 'myDiv'>
+  <h1>Add a class to this div</h1>
+</div>);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
new file mode 100644
index 0000000000..23751b823b
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/give-sibling-elements-a-unique-key-attribute.md
@@ -0,0 +1,147 @@
+---
+id: 5a24c314108439a4d403618b
+title: Give Sibling Elements a Unique Key Attribute
+challengeType: 6
+forumTopicId: 301394
+dashedName: give-sibling-elements-a-unique-key-attribute
+---
+
+# --description--
+
+The last challenge showed how the `map` method is used to dynamically render a number of elements based on user input. However, there was an important piece missing from that example. When you create an array of elements, each one needs a `key` attribute set to a unique value. React uses these keys to keep track of which items are added, changed, or removed. This helps make the re-rendering process more efficient when the list is modified in any way.  
+
+**Note:** Keys only need to be unique between sibling elements, they don't need to be globally unique in your application.
+
+# --instructions--
+
+The code editor has an array with some front end frameworks and a stateless functional component named `Frameworks()`. `Frameworks()` needs to map the array to an unordered list, much like in the last challenge. Finish writing the `map` callback to return an `li` element for each framework in the `frontEndFrameworks` array. This time, make sure to give each `li` a `key` attribute, set to a unique value. The `li` elements should also contain text from `frontEndFrameworks`.
+
+Normally, you want to make the key something that uniquely identifies the element being rendered. As a last resort the array index may be used, but typically you should try to use a unique identification.
+
+# --hints--
+
+The `Frameworks` component should exist and render to the page.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(Frameworks)).find('Frameworks').length === 1
+);
+```
+
+`Frameworks` should render an `h1` element.
+
+```js
+assert(Enzyme.mount(React.createElement(Frameworks)).find('h1').length === 1);
+```
+
+`Frameworks` should render a `ul` element.
+
+```js
+assert(Enzyme.mount(React.createElement(Frameworks)).find('ul').length === 1);
+```
+
+The `ul` tag should render 6 child `li` elements.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(Frameworks)).find('ul').children().length ===
+    6 &&
+    Enzyme.mount(React.createElement(Frameworks))
+      .find('ul')
+      .childAt(0)
+      .name() === 'li' &&
+    Enzyme.mount(React.createElement(Frameworks)).find('li').length === 6
+);
+```
+
+Each list item element should have a unique `key` attribute.
+
+```js
+assert(
+  (() => {
+    const ul = Enzyme.mount(React.createElement(Frameworks)).find('ul');
+    const keys = new Set([
+      ul.childAt(0).key(),
+      ul.childAt(1).key(),
+      ul.childAt(2).key(),
+      ul.childAt(3).key(),
+      ul.childAt(4).key(),
+      ul.childAt(5).key()
+    ]);
+    return keys.size === 6;
+  })()
+);
+```
+
+Each list item element should contain text from `frontEndFrameworks`.
+
+```js
+assert(
+  (() => {
+    const li = Enzyme.mount(React.createElement(Frameworks))
+      .find('ul')
+      .children();
+    return [...Array(5)].every((_, i) =>
+      frontEndFrameworks.includes(li.at(i).text())
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Frameworks />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const frontEndFrameworks = [
+  'React',
+  'Angular',
+  'Ember',
+  'Knockout',
+  'Backbone',
+  'Vue'
+];
+
+function Frameworks() {
+  const renderFrameworks = null; // Change this line
+  return (
+    <div>
+      <h1>Popular Front End JavaScript Frameworks</h1>
+      <ul>
+        {renderFrameworks}
+      </ul>
+    </div>
+  );
+};
+```
+
+# --solutions--
+
+```jsx
+const frontEndFrameworks = [
+  'React',
+  'Angular',
+  'Ember',
+  'Knockout',
+  'Backbone',
+  'Vue'
+];
+
+function Frameworks() {
+  const renderFrameworks = frontEndFrameworks.map((fw, i) => <li key={i}>{fw}</li>);
+  return (
+    <div>
+      <h1>Popular Front End JavaScript Frameworks</h1>
+      <ul>
+        {renderFrameworks}
+      </ul>
+    </div>
+  );
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/introducing-inline-styles.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/introducing-inline-styles.md
new file mode 100644
index 0000000000..1266a6cea2
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/introducing-inline-styles.md
@@ -0,0 +1,104 @@
+---
+id: 5a24c314108439a4d4036181
+title: Introducing Inline Styles
+challengeType: 6
+forumTopicId: 301395
+dashedName: introducing-inline-styles
+---
+
+# --description--
+
+There are other complex concepts that add powerful capabilities to your React code. But you may be wondering about the more simple problem of how to style those JSX elements you create in React. You likely know that it won't be exactly the same as working with HTML because of [the way you apply classes to JSX elements](/learn/front-end-libraries/react/define-an-html-class-in-jsx).
+
+If you import styles from a stylesheet, it isn't much different at all. You apply a class to your JSX element using the `className` attribute, and apply styles to the class in your stylesheet. Another option is to apply inline styles, which are very common in ReactJS development.
+
+You apply inline styles to JSX elements similar to how you do it in HTML, but with a few JSX differences. Here's an example of an inline style in HTML:
+
+```jsx
+<div style="color: yellow; font-size: 16px">Mellow Yellow</div>
+```
+
+JSX elements use the `style` attribute, but because of the way JSX is transpiled, you can't set the value to a `string`. Instead, you set it equal to a JavaScript `object`. Here's an example:
+
+```jsx
+<div style={{color: "yellow", fontSize: 16}}>Mellow Yellow</div>
+```
+
+Notice how we camelCase the `fontSize` property? This is because React will not accept kebab-case keys in the style object. React will apply the correct property name for us in the HTML.
+
+# --instructions--
+
+Add a `style` attribute to the `div` in the code editor to give the text a color of red and font size of `72px`.
+
+Note that you can optionally set the font size to be a number, omitting the units `px`, or write it as `72px`.
+
+# --hints--
+
+The component should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `div` element should have a color of `red`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return mockedComponent.children().props().style.color === 'red';
+  })()
+);
+```
+
+The `div` element should have a font size of `72px`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Colorful));
+    return (
+      mockedComponent.children().props().style.fontSize === 72 ||
+      mockedComponent.children().props().style.fontSize === '72' ||
+      mockedComponent.children().props().style.fontSize === '72px'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Colorful />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Colorful extends React.Component {
+  render() {
+    return (
+      <div>Big Red</div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Colorful extends React.Component {
+  render() {
+    return (
+      <div style={{color: "red", fontSize: 72}}>Big Red</div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
new file mode 100644
index 0000000000..31edb73183
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/learn-about-self-closing-jsx-tags.md
@@ -0,0 +1,75 @@
+---
+id: 5a24c314108439a4d4036161
+title: Learn About Self-Closing JSX Tags
+challengeType: 6
+forumTopicId: 301396
+dashedName: learn-about-self-closing-jsx-tags
+---
+
+# --description--
+
+So far, you’ve seen how JSX differs from HTML in a key way with the use of `className` vs. `class` for defining HTML classes.
+
+Another important way in which JSX differs from HTML is in the idea of the self-closing tag.
+
+In HTML, almost all tags have both an opening and closing tag: `<div></div>`; the closing tag always has a forward slash before the tag name that you are closing. However, there are special instances in HTML called “self-closing tags”, or tags that don’t require both an opening and closing tag before another tag can start.
+
+For example the line-break tag can be written as `<br>` or as `<br />`, but should never be written as `<br></br>`, since it doesn't contain any content.
+
+In JSX, the rules are a little different. Any JSX element can be written with a self-closing tag, and every element must be closed. The line-break tag, for example, must always be written as `<br />` in order to be valid JSX that can be transpiled. A `<div>`, on the other hand, can be written as `<div />` or `<div></div>`. The difference is that in the first syntax version there is no way to include anything in the `<div />`. You will see in later challenges that this syntax is useful when rendering React components.
+
+# --instructions--
+
+Fix the errors in the code editor so that it is valid JSX and successfully transpiles. Make sure you don't change any of the content - you only need to close tags where they are needed.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert.strictEqual(JSX.type, 'div');
+```
+
+The `div` should contain a `br` tag.
+
+```js
+assert(Enzyme.shallow(JSX).find('br').length === 1);
+```
+
+The `div` should contain an `hr` tag.
+
+```js
+assert(Enzyme.shallow(JSX).find('hr').length === 1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(JSX, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h2>Welcome to React!</h2> <br >
+    <p>Be sure to close all tags!</p>
+    <hr >
+  </div>
+);
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h2>Welcome to React!</h2> <br />
+  <p>Be sure to close all tags!</p>
+  <hr />
+</div>
+);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
new file mode 100644
index 0000000000..661ea8e6dd
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/optimize-re-renders-with-shouldcomponentupdate.md
@@ -0,0 +1,187 @@
+---
+id: 5a24c314108439a4d4036180
+title: Optimize Re-Renders with shouldComponentUpdate
+challengeType: 6
+forumTopicId: 301398
+dashedName: optimize-re-renders-with-shouldcomponentupdate
+---
+
+# --description--
+
+So far, if any component receives new `state` or new `props`, it re-renders itself and all its children. This is usually okay. But React provides a lifecycle method you can call when child components receive new `state` or `props`, and declare specifically if the components should update or not. The method is `shouldComponentUpdate()`, and it takes `nextProps` and `nextState` as parameters.
+
+This method is a useful way to optimize performance. For example, the default behavior is that your component re-renders when it receives new `props`, even if the `props` haven't changed. You can use `shouldComponentUpdate()` to prevent this by comparing the `props`. The method must return a `boolean` value that tells React whether or not to update the component. You can compare the current props (`this.props`) to the next props (`nextProps`) to determine if you need to update or not, and return `true` or `false` accordingly.
+
+# --instructions--
+
+The `shouldComponentUpdate()` method is added in a component called `OnlyEvens`. Currently, this method returns `true` so `OnlyEvens` re-renders every time it receives new `props`. Modify the method so `OnlyEvens` updates only if the `value` of its new props is even. Click the `Add` button and watch the order of events in your browser's console as the lifecycle hooks are triggered.
+
+# --hints--
+
+The `Controller` component should render the `OnlyEvens` component as a child.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(Controller));
+    return (
+      mockedComponent.find('Controller').length === 1 &&
+      mockedComponent.find('OnlyEvens').length === 1
+    );
+  })()
+);
+```
+
+The `shouldComponentUpdate` method should be defined on the `OnlyEvens` component.
+
+```js
+assert(
+  (() => {
+    const child = React.createElement(OnlyEvens)
+      .type.prototype.shouldComponentUpdate.toString()
+      .replace(/s/g, '');
+    return child !== 'undefined';
+  })()
+);
+```
+
+The `OnlyEvens` component should return an `h1` tag which renders the value of `this.props.value`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(Controller));
+  const first = () => {
+    mockedComponent.setState({ value: 1000 });
+    return mockedComponent.find('h1').html();
+  };
+  const second = () => {
+    mockedComponent.setState({ value: 10 });
+    return mockedComponent.find('h1').html();
+  };
+  const firstValue = first();
+  const secondValue = second();
+  assert(firstValue === '<h1>1000</h1>' && secondValue === '<h1>10</h1>');
+})();
+```
+
+`OnlyEvens` should re-render only when `nextProps.value` is even.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(Controller));
+  const first = () => {
+    mockedComponent.setState({ value: 8 });
+    return mockedComponent.find('h1').text();
+  };
+  const second = () => {
+    mockedComponent.setState({ value: 7 });
+    return mockedComponent.find('h1').text();
+  };
+  const third = () => {
+    mockedComponent.setState({ value: 42 });
+    return mockedComponent.find('h1').text();
+  };
+  const firstValue = first();
+  const secondValue = second();
+  const thirdValue = third();
+  assert(firstValue === '8' && secondValue === '8' && thirdValue === '42');
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Controller />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class OnlyEvens extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  shouldComponentUpdate(nextProps, nextState) {
+    console.log('Should I update?');
+    // Change code below this line
+    return true;
+    // Change code above this line
+  }
+  componentDidUpdate() {
+    console.log('Component re-rendered.');
+  }
+  render() {
+    return <h1>{this.props.value}</h1>;
+  }
+}
+
+class Controller extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      value: 0
+    };
+    this.addValue = this.addValue.bind(this);
+  }
+  addValue() {
+    this.setState(state => ({
+      value: state.value + 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.addValue}>Add</button>
+        <OnlyEvens value={this.state.value} />
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class OnlyEvens extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  shouldComponentUpdate(nextProps, nextState) {
+    console.log('Should I update?');
+    // Change code below this line
+    return nextProps.value % 2 === 0;
+    // Change code above this line
+  }
+  componentDidUpdate() {
+    console.log('Component re-rendered.');
+  }
+  render() {
+    return <h1>{this.props.value}</h1>;
+  }
+}
+
+class Controller extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      value: 0
+    };
+    this.addValue = this.addValue.bind(this);
+  }
+  addValue() {
+    this.setState(state => ({
+      value: state.value + 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.addValue}>Add</button>
+        <OnlyEvens value={this.state.value} />
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/override-default-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/override-default-props.md
new file mode 100644
index 0000000000..9a6afa9795
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/override-default-props.md
@@ -0,0 +1,112 @@
+---
+id: 5a24c314108439a4d403616c
+title: Override Default Props
+challengeType: 6
+forumTopicId: 301399
+dashedName: override-default-props
+---
+
+# --description--
+
+The ability to set default props is a useful feature in React. The way to override the default props is to explicitly set the prop values for a component.
+
+# --instructions--
+
+The `ShoppingCart` component now renders a child component `Items`. This `Items` component has a default prop `quantity` set to the integer `0`. Override the default prop by passing in a value of `10` for `quantity`.
+
+**Note:** Remember that the syntax to add a prop to a component looks similar to how you add HTML attributes. However, since the value for `quantity` is an integer, it won't go in quotes but it should be wrapped in curly braces. For example, `{100}`. This syntax tells JSX to interpret the value within the braces directly as JavaScript.
+
+# --hints--
+
+The component `ShoppingCart` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The component `Items` should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('Items').length === 1;
+  })()
+);
+```
+
+The `Items` component should have a prop of `{ quantity: 10 }` passed from the `ShoppingCart` component.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+      return (
+        mockedComponent.find('Items').props().quantity == 10 &&
+        getUserInput('index')
+          .replace(/ /g, '')
+          .includes('<Itemsquantity={10}/>')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+}
+
+Items.defaultProps = {
+  quantity: 0
+}
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    { /* Change code below this line */ }
+    return <Items />
+    { /* Change code above this line */ }
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+}
+
+Items.defaultProps = {
+  quantity: 0
+}
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    { /* Change code below this line */ }
+    return <Items quantity = {10} />
+    { /* Change code above this line */ }
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-a-callback-as-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-a-callback-as-props.md
new file mode 100644
index 0000000000..e542314e5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-a-callback-as-props.md
@@ -0,0 +1,217 @@
+---
+id: 5a24c314108439a4d403617b
+title: Pass a Callback as Props
+challengeType: 6
+forumTopicId: 301400
+dashedName: pass-a-callback-as-props
+---
+
+# --description--
+
+You can pass `state` as props to child components, but you're not limited to passing data. You can also pass handler functions or any method that's defined on a React component to a child component. This is how you allow child components to interact with their parent components. You pass methods to a child just like a regular prop. It's assigned a name and you have access to that method name under `this.props` in the child component.
+
+# --instructions--
+
+There are three components outlined in the code editor. The `MyApp` component is the parent that will render the `GetInput` and `RenderInput` child components. Add the `GetInput` component to the render method in `MyApp`, then pass it a prop called `input` assigned to `inputValue` from `MyApp`'s `state`. Also create a prop called `handleChange` and pass the input handler `handleChange` to it.
+
+Next, add `RenderInput` to the render method in `MyApp`, then create a prop called `input` and pass the `inputValue` from `state` to it. Once you are finished you will be able to type in the `input` field in the `GetInput` component, which then calls the handler method in its parent via props. This updates the input in the `state` of the parent, which is passed as props to both children. Observe how the data flows between the components and how the single source of truth remains the `state` of the parent component. Admittedly, this example is a bit contrived, but should serve to illustrate how data and callbacks can be passed between React components.
+
+# --hints--
+
+The `MyApp` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('MyApp').length === 1;
+  })()
+);
+```
+
+The `GetInput` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('GetInput').length === 1;
+  })()
+);
+```
+
+The `RenderInput` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return mockedComponent.find('RenderInput').length === 1;
+  })()
+);
+```
+
+The `GetInput` component should receive the `MyApp` state property `inputValue` as props and contain an `input` element which modifies `MyApp` state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const state_1 = () => {
+    mockedComponent.setState({ inputValue: '' });
+    return waitForIt(() => mockedComponent.state());
+  };
+  const state_2 = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: 'TestInput' } });
+    return waitForIt(() => mockedComponent.state());
+  };
+  const updated_1 = await state_1();
+  const updated_2 = await state_2();
+  assert(updated_1.inputValue === '' && updated_2.inputValue === 'TestInput');
+};
+```
+
+The `RenderInput` component should receive the `MyApp` state property `inputValue` as props.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const state_1 = () => {
+    mockedComponent.setState({ inputValue: 'TestName' });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated_1 = await state_1();
+  assert(updated_1.find('p').text().includes('TestName'));
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyApp />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      inputValue: ''
+    }
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      inputValue: event.target.value
+    });
+  }
+  render() {
+    return (
+       <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+       </div>
+    );
+  }
+};
+
+class GetInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Get Input:</h3>
+        <input
+          value={this.props.input}
+          onChange={this.props.handleChange}/>
+      </div>
+    );
+  }
+};
+
+class RenderInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Input Render:</h3>
+        <p>{this.props.input}</p>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      inputValue: ''
+    }
+  this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(event) {
+    this.setState({
+      inputValue: event.target.value
+    });
+  }
+  render() {
+    return (
+       <div>
+         <GetInput
+           input={this.state.inputValue}
+           handleChange={this.handleChange}/>
+         <RenderInput
+           input={this.state.inputValue}/>
+       </div>
+    );
+  }
+};
+
+class GetInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Get Input:</h3>
+        <input
+          value={this.props.input}
+          onChange={this.props.handleChange}/>
+      </div>
+    );
+  }
+};
+
+class RenderInput extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>Input Render:</h3>
+        <p>{this.props.input}</p>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-an-array-as-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-an-array-as-props.md
new file mode 100644
index 0000000000..a5b7170b30
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-an-array-as-props.md
@@ -0,0 +1,186 @@
+---
+id: 5a24c314108439a4d403616a
+title: Pass an Array as Props
+challengeType: 6
+forumTopicId: 301401
+dashedName: pass-an-array-as-props
+---
+
+# --description--
+
+The last challenge demonstrated how to pass information from a parent component to a child component as `props` or properties. This challenge looks at how arrays can be passed as `props`. To pass an array to a JSX element, it must be treated as JavaScript and wrapped in curly braces.
+
+```jsx
+<ParentComponent>
+  <ChildComponent colors={["green", "blue", "red"]} />
+</ParentComponent>
+```
+
+The child component then has access to the array property `colors`. Array methods such as `join()` can be used when accessing the property. `const ChildComponent = (props) => <p>{props.colors.join(', ')}</p>` This will join all `colors` array items into a comma separated string and produce: `<p>green, blue, red</p>` Later, we will learn about other common methods to render arrays of data in React.
+
+# --instructions--
+
+There are `List` and `ToDo` components in the code editor. When rendering each `List` from the `ToDo` component, pass in a `tasks` property assigned to an array of to-do tasks, for example `["walk dog", "workout"]`. Then access this `tasks` array in the `List` component, showing its value within the `p` element. Use `join(", ")` to display the `props.tasks`array in the `p` element as a comma separated list. Today's list should have at least 2 tasks and tomorrow's should have at least 3 tasks.
+
+# --hints--
+
+The `ToDo` component should return a single outer `div`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().type() === 'div';
+  })()
+);
+```
+
+The third child of the `ToDo` component should be an instance of the `List` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().childAt(2).name() === 'List';
+  })()
+);
+```
+
+The fifth child of the `ToDo` component should be an instance of the `List` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.children().first().childAt(4).name() === 'List';
+  })()
+);
+```
+
+Both instances of the `List` component should have a property called `tasks` and `tasks` should be of type array.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return (
+      Array.isArray(mockedComponent.find('List').get(0).props.tasks) &&
+      Array.isArray(mockedComponent.find('List').get(1).props.tasks)
+    );
+  })()
+);
+```
+
+The first `List` component representing the tasks for today should have 2 or more items.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.find('List').get(0).props.tasks.length >= 2;
+  })()
+);
+```
+
+The second `List` component representing the tasks for tomorrow should have 3 or more items.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return mockedComponent.find('List').get(1).props.tasks.length >= 3;
+  })()
+);
+```
+
+The `List` component should render the value from the `tasks` prop in the `p` tag.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ToDo));
+    return (
+      mockedComponent
+        .find('p')
+        .get(0)
+        .props.children.replace(/\s*,\s*/g, ',') ===
+        mockedComponent
+          .find('List')
+          .get(0)
+          .props.tasks.join(',')
+          .replace(/\s*,\s*/g, ',') &&
+      mockedComponent
+        .find('p')
+        .get(1)
+        .props.children.replace(/\s*,\s*/g, ',') ===
+        mockedComponent
+          .find('List')
+          .get(1)
+          .props.tasks.join(',')
+          .replace(/\s*,\s*/g, ',')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ToDo />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const List = (props) => {
+  { /* Change code below this line */ }
+  return <p>{}</p>
+  { /* Change code above this line */ }
+};
+
+class ToDo extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>To Do Lists</h1>
+        <h2>Today</h2>
+        { /* Change code below this line */ }
+        <List/>
+        <h2>Tomorrow</h2>
+        <List/>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const List= (props) => {
+  return <p>{props.tasks.join(', ')}</p>
+};
+
+class ToDo extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>To Do Lists</h1>
+        <h2>Today</h2>
+        <List tasks={['study', 'exercise']} />
+        <h2>Tomorrow</h2>
+        <List tasks={['call Sam', 'grocery shopping', 'order tickets']} />
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
new file mode 100644
index 0000000000..b8f6117708
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-props-to-a-stateless-functional-component.md
@@ -0,0 +1,164 @@
+---
+id: 5a24c314108439a4d4036169
+title: Pass Props to a Stateless Functional Component
+challengeType: 6
+forumTopicId: 301402
+dashedName: pass-props-to-a-stateless-functional-component
+---
+
+# --description--
+
+The previous challenges covered a lot about creating and composing JSX elements, functional components, and ES6 style class components in React. With this foundation, it's time to look at another feature very common in React: **props**. In React, you can pass props, or properties, to child components. Say you have an `App` component which renders a child component called `Welcome` which is a stateless functional component. You can pass `Welcome` a `user` property by writing:
+
+```jsx
+<App>
+  <Welcome user='Mark' />
+</App>
+```
+
+You use **custom HTML attributes** created by you and supported by React to be passed to the component. In this case, the created property `user` is passed to the component `Welcome`. Since `Welcome` is a stateless functional component, it has access to this value like so:
+
+```jsx
+const Welcome = (props) => <h1>Hello, {props.user}!</h1>
+```
+
+It is standard to call this value `props` and when dealing with stateless functional components, you basically consider it as an argument to a function which returns JSX. You can access the value of the argument in the function body. With class components, you will see this is a little different.
+
+# --instructions--
+
+There are `Calendar` and `CurrentDate` components in the code editor. When rendering `CurrentDate` from the `Calendar` component, pass in a property of `date` assigned to the current date from JavaScript's `Date` object. Then access this `prop` in the `CurrentDate` component, showing its value within the `p` tags. Note that for `prop` values to be evaluated as JavaScript, they must be enclosed in curly brackets, for instance `date={Date()}`.
+
+# --hints--
+
+The `Calendar` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The second child of the `Calendar` component should be the `CurrentDate` component.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().childAt(1).name() === 'CurrentDate';
+  })()
+);
+```
+
+The `CurrentDate` component should have a prop called `date`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    return mockedComponent.children().childAt(1).props().date;
+  })()
+);
+```
+
+The `date` prop of the `CurrentDate` should contain a string of text.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(Calendar));
+    const prop = mockedComponent.children().childAt(1).props().date;
+    return typeof prop === 'string' && prop.length > 0;
+  })()
+);
+```
+
+The `date` prop should be generated by calling `Date()`
+
+```js
+assert(/<CurrentDatedate={Date\(\)}\/>/.test(__helpers.removeWhiteSpace(code)));
+```
+
+The `CurrentDate` component should render the value from the `date` prop in the `p` tag.
+
+```js
+let date = 'dummy date';
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(
+      React.createElement(CurrentDate, { date })
+    );
+    return mockedComponent.find('p').html().includes(date);
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Calendar />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const CurrentDate = (props) => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+      <p>The current date is: </p>
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class Calendar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>What date is it?</h3>
+        { /* Change code below this line */ }
+        <CurrentDate />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const CurrentDate = (props) => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+      <p>The current date is: {props.date}</p>
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class Calendar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h3>What date is it?</h3>
+        { /* Change code below this line */ }
+        <CurrentDate date={Date()} />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-state-as-props-to-child-components.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
new file mode 100644
index 0000000000..e0554a5a98
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/pass-state-as-props-to-child-components.md
@@ -0,0 +1,145 @@
+---
+id: 5a24c314108439a4d403617a
+title: Pass State as Props to Child Components
+challengeType: 6
+forumTopicId: 301403
+dashedName: pass-state-as-props-to-child-components
+---
+
+# --description--
+
+You saw a lot of examples that passed props to child JSX elements and child React components in previous challenges. You may be wondering where those props come from. A common pattern is to have a stateful component containing the `state` important to your app, that then renders child components. You want these components to have access to some pieces of that `state`, which are passed in as props.
+
+For example, maybe you have an `App` component that renders a `Navbar`, among other components. In your `App`, you have `state` that contains a lot of user information, but the `Navbar` only needs access to the user's username so it can display it. You pass that piece of `state` to the `Navbar` component as a prop.
+
+This pattern illustrates some important paradigms in React. The first is *unidirectional data flow*. State flows in one direction down the tree of your application's components, from the stateful parent component to child components. The child components only receive the state data they need. The second is that complex stateful apps can be broken down into just a few, or maybe a single, stateful component. The rest of your components simply receive state from the parent as props, and render a UI from that state. It begins to create a separation where state management is handled in one part of code and UI rendering in another. This principle of separating state logic from UI logic is one of React's key principles. When it's used correctly, it makes the design of complex, stateful applications much easier to manage.
+
+# --instructions--
+
+The `MyApp` component is stateful and renders a `Navbar` component as a child. Pass the `name` property in its `state` down to the child component, then show the `name` in the `h1` tag that's part of the `Navbar` render method. `name` should appear after the text `Hello, my name is:`.
+
+# --hints--
+
+The `MyApp` component should render with a `Navbar` component inside.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+    return (
+      mockedComponent.find('MyApp').length === 1 &&
+      mockedComponent.find('Navbar').length === 1
+    );
+  })()
+);
+```
+
+The `Navbar` component should receive the `MyApp` state property `name` as props.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const setState = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.find('Navbar').props());
+  };
+  const navProps = await setState();
+  assert(navProps.name === 'TestName');
+};
+```
+
+The `h1` element in `Navbar` should render the `name` prop.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyApp));
+  const navH1Before = mockedComponent.find('Navbar').find('h1').text();
+  const setState = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.find('Navbar').find('h1').text());
+  };
+  const navH1After = await setState();
+  assert(new RegExp('TestName').test(navH1After) && navH1After !== navH1Before);
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyApp />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'CamperBot'
+    }
+  }
+  render() {
+    return (
+       <div>
+         {/* Change code below this line */}
+         <Navbar />
+         {/* Change code above this line */}
+       </div>
+    );
+  }
+};
+
+class Navbar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+    <div>
+      {/* Change code below this line */}
+      <h1>Hello, my name is: </h1>
+      {/* Change code above this line */}
+    </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyApp extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'CamperBot'
+    }
+  }
+  render() {
+    return (
+       <div>
+         <Navbar name={this.state.name}/>
+       </div>
+    );
+  }
+};
+class Navbar extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+    <div>
+      <h1>Hello, my name is: {this.props.name}</h1>
+    </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-a-class-component-to-the-dom.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
new file mode 100644
index 0000000000..2e3a9a7a56
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-a-class-component-to-the-dom.md
@@ -0,0 +1,159 @@
+---
+id: 5a24c314108439a4d4036167
+title: Render a Class Component to the DOM
+challengeType: 6
+forumTopicId: 301404
+dashedName: render-a-class-component-to-the-dom
+---
+
+# --description--
+
+You may remember using the ReactDOM API in an earlier challenge to render JSX elements to the DOM. The process for rendering React components will look very similar. The past few challenges focused on components and composition, so the rendering was done for you behind the scenes. However, none of the React code you write will render to the DOM without making a call to the ReactDOM API.
+
+Here's a refresher on the syntax: `ReactDOM.render(componentToRender, targetNode)`. The first argument is the React component that you want to render. The second argument is the DOM node that you want to render that component within.
+
+React components are passed into `ReactDOM.render()` a little differently than JSX elements. For JSX elements, you pass in the name of the element that you want to render. However, for React components, you need to use the same syntax as if you were rendering a nested component, for example `ReactDOM.render(<ComponentToRender />, targetNode)`. You use this syntax for both ES6 class components and functional components.
+
+# --instructions--
+
+Both the `Fruits` and `Vegetables` components are defined for you behind the scenes. Render both components as children of the `TypesOfFood` component, then render `TypesOfFood` to the DOM. There is a `div` with `id='challenge-node'` available for you to use.
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().type() === 'div';
+  })()
+);
+```
+
+The `TypesOfFood` component should render the `Fruits` component after the `h1` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(1).name() === 'Fruits';
+  })()
+);
+```
+
+The `TypesOfFood` component should render the `Vegetables` component after `Fruits`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(TypesOfFood));
+    return mockedComponent.children().childAt(2).name() === 'Vegetables';
+  })()
+);
+```
+
+The `TypesOfFood` component should render to the DOM within the `div` with the id `challenge-node`.
+
+```js
+assert(
+  (function () {
+    const html = document.getElementById('challenge-node').childNodes[0]
+      .innerHTML;
+    return (
+      html.includes(
+        '<div><h2>Fruits:</h2><h4>Non-Citrus:</h4><ul><li>Apples</li><li>Blueberries</li><li>Strawberries</li><li>Bananas</li></ul><h4>Citrus:</h4><ul><li>Lemon</li><li>Lime</li><li>Orange</li><li>Grapefruit</li></ul></div>'
+      ) &&
+      html.includes(
+        '<div><h2>Vegetables:</h2><ul><li>Brussel Sprouts</li><li>Broccoli</li><li>Squash</li></ul></div>'
+      )
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+const Fruits = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <h4>Non-Citrus:</h4>
+        <ul>
+          <li>Apples</li>
+          <li>Blueberries</li>
+          <li>Strawberries</li>
+          <li>Bananas</li>
+        </ul>
+      <h4>Citrus:</h4>
+        <ul>
+          <li>Lemon</li>
+          <li>Lime</li>
+          <li>Orange</li>
+          <li>Grapefruit</li>
+        </ul>
+    </div>
+  );
+};
+const Vegetables = () => {
+  return (
+    <div>
+      <h2>Vegetables:</h2>
+      <ul>
+        <li>Brussel Sprouts</li>
+        <li>Broccoli</li>
+        <li>Squash</li>
+      </ul>
+    </div>
+  );
+};
+```
+
+## --seed-contents--
+
+```jsx
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        {/* Change code below this line */}
+          <Fruits />
+           <Vegetables />
+         {/* Change code above this line */}
+      </div>
+    );
+  }
+};
+
+// Change code below this line
+ReactDOM.render(<TypesOfFood />, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-conditionally-from-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-conditionally-from-props.md
new file mode 100644
index 0000000000..e69e98305a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-conditionally-from-props.md
@@ -0,0 +1,303 @@
+---
+id: 5a24c314108439a4d4036188
+title: Render Conditionally from Props
+challengeType: 6
+forumTopicId: 301405
+dashedName: render-conditionally-from-props
+---
+
+# --description--
+
+So far, you've seen how to use `if/else`, `&&`, and the ternary operator (`condition ? expressionIfTrue : expressionIfFalse`) to make conditional decisions about what to render and when. However, there's one important topic left to discuss that lets you combine any or all of these concepts with another powerful React feature: props. Using props to conditionally render code is very common with React developers — that is, they use the value of a given prop to automatically make decisions about what to render.
+
+In this challenge, you'll set up a child component to make rendering decisions based on props. You'll also use the ternary operator, but you can see how several of the other concepts that were covered in the last few challenges might be just as useful in this context.
+
+# --instructions--
+
+The code editor has two components that are partially defined for you: a parent called `GameOfChance`, and a child called `Results`. They are used to create a simple game where the user presses a button to see if they win or lose.
+
+First, you'll need a simple expression that randomly returns a different value every time it is run. You can use `Math.random()`. This method returns a value between `0` (inclusive) and `1` (exclusive) each time it is called. So for 50/50 odds, use `Math.random() >= .5` in your expression. Statistically speaking, this expression will return `true` 50% of the time, and `false` the other 50%. In the render method, replace `null` with the above expression to complete the variable declaration.
+
+Now you have an expression that you can use to make a randomized decision in the code. Next you need to implement this. Render the `Results` component as a child of `GameOfChance`, and pass in `expression` as a prop called `fiftyFifty`. In the `Results` component, write a ternary expression to render the `h1` element with the text `You Win!` or `You Lose!` based on the `fiftyFifty` prop that's being passed in from `GameOfChance`. Finally, make sure the `handleClick()` method is correctly counting each turn so the user knows how many times they've played. This also serves to let the user know the component has actually updated in case they win or lose twice in a row.
+
+# --hints--
+
+The `GameOfChance` component should exist and render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('GameOfChance').length,
+  1
+);
+```
+
+`GameOfChance` should return a single `button` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('button').length,
+  1
+);
+```
+
+`GameOfChance` should return a single instance of the `Results` component, which has a prop called `fiftyFifty`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(GameOfChance)).find('Results').length ===
+    1 &&
+    Enzyme.mount(React.createElement(GameOfChance))
+      .find('Results')
+      .props()
+      .hasOwnProperty('fiftyFifty') === true
+);
+```
+
+`GameOfChance` state should be initialized with a property of `counter` set to a value of `1`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).state().counter,
+  1
+);
+```
+
+When the `GameOfChance` component is first rendered to the DOM, a `p` element should be returned with the inner text of `Turn: 1`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(GameOfChance)).find('p').text(),
+  'Turn: 1'
+);
+```
+
+Each time the button is clicked, the counter state should be incremented by a value of 1, and a single `p` element should be rendered to the DOM that contains the text `Turn: N`, where `N` is the value of the counter state.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(GameOfChance));
+  const simulate = () => {
+    comp.find('button').simulate('click');
+  };
+  const result = () => ({
+    count: comp.state('counter'),
+    text: comp.find('p').text()
+  });
+  const _1 = () => {
+    simulate();
+    return result();
+  };
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _1_val = _1();
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  assert(
+    _1_val.count === 2 &&
+      _1_val.text === 'Turn: 2' &&
+      _2_val.count === 3 &&
+      _2_val.text === 'Turn: 3' &&
+      _3_val.count === 4 &&
+      _3_val.text === 'Turn: 4' &&
+      _4_val.count === 5 &&
+      _4_val.text === 'Turn: 5' &&
+      _5_val.count === 6 &&
+      _5_val.text === 'Turn: 6'
+  );
+})();
+```
+
+When the `GameOfChance` component is first mounted to the DOM and each time the button is clicked thereafter, a single `h1` element should be returned that randomly renders either `You Win!` or `You Lose!`.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(GameOfChance));
+  const simulate = () => {
+    comp.find('button').simulate('click');
+  };
+  const result = () => ({
+    h1: comp.find('h1').length,
+    text: comp.find('h1').text()
+  });
+  const _1 = result();
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _6 = () => {
+    simulate();
+    return result();
+  };
+  const _7 = () => {
+    simulate();
+    return result();
+  };
+  const _8 = () => {
+    simulate();
+    return result();
+  };
+  const _9 = () => {
+    simulate();
+    return result();
+  };
+  const _10 = () => {
+    simulate();
+    return result();
+  };
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  const _6_val = _6();
+  const _7_val = _7();
+  const _8_val = _8();
+  const _9_val = _9();
+  const _10_val = _10();
+  const __text = new Set([
+    _1.text,
+    _2_val.text,
+    _3_val.text,
+    _4_val.text,
+    _5_val.text,
+    _6_val.text,
+    _7_val.text,
+    _8_val.text,
+    _9_val.text,
+    _10_val.text
+  ]);
+  const __h1 = new Set([
+    _1.h1,
+    _2_val.h1,
+    _3_val.h1,
+    _4_val.h1,
+    _5_val.h1,
+    _6_val.h1,
+    _7_val.h1,
+    _8_val.h1,
+    _9_val.h1,
+    _10_val.h1
+  ]);
+  assert(__text.size === 2 && __h1.size === 1);
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<GameOfChance />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class Results extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    {/* Change code below this line */}
+    return <h1></h1>;
+    {/* Change code above this line */}
+  }
+}
+
+class GameOfChance extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      counter: 1
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState(prevState => {
+      // Complete the return statement:
+      return {
+        counter: prevState
+      }
+    });
+  }
+  render() {
+    const expression = null; // Change this line
+    return (
+      <div>
+        <button onClick={this.handleClick}>Play Again</button>
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+        <p>{'Turn: ' + this.state.counter}</p>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class Results extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <h1>{this.props.fiftyFifty ? 'You Win!' : 'You Lose!'}</h1>;
+  }
+}
+
+class GameOfChance extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      counter: 1
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    this.setState(prevState => {
+      return {
+        counter: prevState.counter + 1
+      }
+    });
+  }
+  render() {
+    const expression = Math.random() >= 0.5;
+    return (
+      <div>
+        <button onClick={this.handleClick}>Play Again</button>
+        <Results fiftyFifty={expression} />
+        <p>{'Turn: ' + this.state.counter}</p>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-html-elements-to-the-dom.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-html-elements-to-the-dom.md
new file mode 100644
index 0000000000..d5167e4e13
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-html-elements-to-the-dom.md
@@ -0,0 +1,75 @@
+---
+id: 5a24bbe0dba28a8d3cbd4c5f
+title: Render HTML Elements to the DOM
+challengeType: 6
+forumTopicId: 301406
+dashedName: render-html-elements-to-the-dom
+---
+
+# --description--
+
+So far, you've learned that JSX is a convenient tool to write readable HTML within JavaScript. With React, we can render this JSX directly to the HTML DOM using React's rendering API known as ReactDOM.
+
+ReactDOM offers a simple method to render React elements to the DOM which looks like this: `ReactDOM.render(componentToRender, targetNode)`, where the first argument is the React element or component that you want to render, and the second argument is the DOM node that you want to render the component to.
+
+As you would expect, `ReactDOM.render()` must be called after the JSX element declarations, just like how you must declare variables before using them.
+
+# --instructions--
+
+The code editor has a simple JSX component. Use the `ReactDOM.render()` method to render this component to the page. You can pass defined JSX elements directly in as the first argument and use `document.getElementById()` to select the DOM node to render them to. There is a `div` with `id='challenge-node'` available for you to use. Make sure you don't change the `JSX` constant.
+
+# --hints--
+
+The constant `JSX` should return a `div` element.
+
+```js
+assert(JSX.type === 'div');
+```
+
+The `div` should contain an `h1` tag as the first element.
+
+```js
+assert(JSX.props.children[0].type === 'h1');
+```
+
+The `div` should contain a `p` tag as the second element.
+
+```js
+assert(JSX.props.children[1].type === 'p');
+```
+
+The provided JSX element should render to the DOM node with id `challenge-node`.
+
+```js
+assert(
+  document.getElementById('challenge-node').childNodes[0].innerHTML ===
+    '<h1>Hello World</h1><p>Lets render this to the DOM</p>'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+const JSX = (
+  <div>
+    <h1>Hello World</h1>
+    <p>Lets render this to the DOM</p>
+  </div>
+);
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const JSX = (
+<div>
+  <h1>Hello World</h1>
+  <p>Lets render this to the DOM</p>
+</div>
+);
+// Change code below this line
+ReactDOM.render(JSX, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
new file mode 100644
index 0000000000..bfced52d4b
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-react-on-the-server-with-rendertostring.md
@@ -0,0 +1,76 @@
+---
+id: 5a24c314108439a4d403618d
+title: Render React on the Server with renderToString
+challengeType: 6
+forumTopicId: 301407
+dashedName: render-react-on-the-server-with-rendertostring
+---
+
+# --description--
+
+So far, you have been rendering React components on the client. Normally, this is what you will always do. However, there are some use cases where it makes sense to render a React component on the server. Since React is a JavaScript view library and you can run JavaScript on the server with Node, this is possible. In fact, React provides a `renderToString()` method you can use for this purpose.
+
+There are two key reasons why rendering on the server may be used in a real world app. First, without doing this, your React apps would consist of a relatively empty HTML file and a large bundle of JavaScript when it's initially loaded to the browser. This may not be ideal for search engines that are trying to index the content of your pages so people can find you. If you render the initial HTML markup on the server and send this to the client, the initial page load contains all of the page's markup which can be crawled by search engines. Second, this creates a faster initial page load experience because the rendered HTML is smaller than the JavaScript code of the entire app. React will still be able to recognize your app and manage it after the initial load.
+
+# --instructions--
+
+The `renderToString()` method is provided on `ReactDOMServer`, which is available here as a global object. The method takes one argument which is a React element. Use this to render `App` to a string.
+
+# --hints--
+
+The `App` component should render to a string using `ReactDOMServer.renderToString`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index')
+      .replace(/ /g, '')
+      .includes('ReactDOMServer.renderToString(<App/>)') &&
+      Enzyme.mount(React.createElement(App)).children().name() === 'div'
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var ReactDOMServer = { renderToString(x) { return null; } };
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<App />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class App extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <div/>
+  }
+};
+
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class App extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <div/>
+  }
+};
+
+// Change code below this line
+ReactDOMServer.renderToString(<App/>);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
new file mode 100644
index 0000000000..e1dd33ed04
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface-another-way.md
@@ -0,0 +1,119 @@
+---
+id: 5a24c314108439a4d4036172
+title: Render State in the User Interface Another Way
+challengeType: 6
+forumTopicId: 301408
+dashedName: render-state-in-the-user-interface-another-way
+---
+
+# --description--
+
+There is another way to access `state` in a component. In the `render()` method, before the `return` statement, you can write JavaScript directly. For example, you could declare functions, access data from `state` or `props`, perform computations on this data, and so on. Then, you can assign any data to variables, which you have access to in the `return` statement.
+
+# --instructions--
+
+In the `MyComponent` render method, define a `const` called `name` and set it equal to the name value in the component's `state`. Because you can write JavaScript directly in this part of the code, you don't have to enclose this reference in curly braces.
+
+Next, in the return statement, render this value in an `h1` tag using the variable `name`. Remember, you need to use the JSX syntax (curly braces for JavaScript) in the return statement.
+
+# --hints--
+
+`MyComponent` should have a key `name` with value `freeCodeCamp` stored in its state.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'freeCodeCamp'
+);
+```
+
+`MyComponent` should render an `h1` header enclosed in a single `div`.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.mount(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The rendered `h1` tag should include a reference to `{name}`.
+
+```js
+(getUserInput) =>
+  assert(/<h1>\n*\s*\{\s*name\s*\}\s*\n*<\/h1>/.test(getUserInput('index')));
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  assert(firstValue === '<div><h1>TestName</h1></div>');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    // Change code below this line
+
+    // Change code above this line
+    return (
+      <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    // Change code below this line
+    const name = this.state.name;
+    // Change code above this line
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <h1>{name}</h1>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface.md
new file mode 100644
index 0000000000..766b22bd9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-state-in-the-user-interface.md
@@ -0,0 +1,113 @@
+---
+id: 5a24c314108439a4d4036171
+title: Render State in the User Interface
+challengeType: 6
+forumTopicId: 301409
+dashedName: render-state-in-the-user-interface
+---
+
+# --description--
+
+Once you define a component's initial state, you can display any part of it in the UI that is rendered. If a component is stateful, it will always have access to the data in `state` in its `render()` method. You can access the data with `this.state`.
+
+If you want to access a state value within the `return` of the render method, you have to enclose the value in curly braces.
+
+`state` is one of the most powerful features of components in React. It allows you to track important data in your app and render a UI in response to changes in this data. If your data changes, your UI will change. React uses what is called a virtual DOM, to keep track of changes behind the scenes. When state data updates, it triggers a re-render of the components using that data - including child components that received the data as a prop. React updates the actual DOM, but only where necessary. This means you don't have to worry about changing the DOM. You simply declare what the UI should look like.
+
+Note that if you make a component stateful, no other components are aware of its `state`. Its `state` is completely encapsulated, or local to that component, unless you pass state data to a child component as `props`. This notion of encapsulated `state` is very important because it allows you to write certain logic, then have that logic contained and isolated in one place in your code.
+
+# --instructions--
+
+In the code editor, `MyComponent` is already stateful. Define an `h1` tag in the component's render method which renders the value of `name` from the component's state.
+
+**Note:** The `h1` should only render the value from `state` and nothing else. In JSX, any code you write with curly braces `{ }` will be treated as JavaScript. So to access the value from `state` just enclose the reference in curly braces.
+
+# --hints--
+
+`MyComponent` should have a key `name` with value `freeCodeCamp` stored in its state.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'freeCodeCamp'
+);
+```
+
+`MyComponent` should render an `h1` header enclosed in a single `div`.
+
+```js
+assert(
+  /<div><h1>.*<\/h1><\/div>/.test(
+    Enzyme.mount(React.createElement(MyComponent)).html()
+  )
+);
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  const getValue = firstValue.replace(/\s/g, '');
+  assert(getValue === '<div><h1>TestName</h1></div>');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'freeCodeCamp'
+    }
+  }
+  render() {
+    return (
+      <div>
+        { /* Change code below this line */ }
+        <h1>{this.state.name}</h1>
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/render-with-an-if-else-condition.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-with-an-if-else-condition.md
new file mode 100644
index 0000000000..b56c814074
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/render-with-an-if-else-condition.md
@@ -0,0 +1,155 @@
+---
+id: 5a24c314108439a4d4036184
+title: Render with an If-Else Condition
+challengeType: 6
+forumTopicId: 301410
+dashedName: render-with-an-if-else-condition
+---
+
+# --description--
+
+Another application of using JavaScript to control your rendered view is to tie the elements that are rendered to a condition. When the condition is true, one view renders. When it's false, it's a different view. You can do this with a standard `if/else` statement in the `render()` method of a React component.
+
+# --instructions--
+
+MyComponent contains a `boolean` in its state which tracks whether you want to display some element in the UI or not. The `button` toggles the state of this value. Currently, it renders the same UI every time. Rewrite the `render()` method with an `if/else` statement so that if `display` is `true`, you return the current markup. Otherwise, return the markup without the `h1` element.
+
+**Note:** You must write an `if/else` to pass the tests. Use of the ternary operator will not pass here.
+
+# --hints--
+
+`MyComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('MyComponent').length === 1;
+  })()
+);
+```
+
+When `display` is set to `true`, a `div`, `button`, and `h1` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: true });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('div').children().length === 2 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('h1').length === 1
+  );
+};
+```
+
+When `display` is set to `false`, only a `div` and `button` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: false });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('div').children().length === 1 &&
+      mockedComponent.find('button').length === 1 &&
+      mockedComponent.find('h1').length === 0
+  );
+};
+```
+
+The render method should use an `if/else` statement to check the condition of `this.state.display`.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').includes('if') &&
+      getUserInput('index').includes('else')
+  );
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+    this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState((state) => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         <h1>Displayed!</h1>
+       </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+ this.toggleDisplay = this.toggleDisplay.bind(this);
+ }
+  toggleDisplay() {
+    this.setState((state) => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    if (this.state.display) {
+      return (
+         <div>
+           <button onClick={this.toggleDisplay}>Toggle Display</button>
+           <h1>Displayed!</h1>
+         </div>
+      );
+    } else {
+      return (
+        <div>
+           <button onClick={this.toggleDisplay}>Toggle Display</button>
+         </div>
+      );
+    }
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
new file mode 100644
index 0000000000..c9d751ce8d
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/review-using-props-with-stateless-functional-components.md
@@ -0,0 +1,145 @@
+---
+id: 5a24c314108439a4d403616f
+title: Review Using Props with Stateless Functional Components
+challengeType: 6
+forumTopicId: 301411
+dashedName: review-using-props-with-stateless-functional-components
+---
+
+# --description--
+
+Except for the last challenge, you've been passing props to stateless functional components. These components act like pure functions. They accept props as input and return the same view every time they are passed the same props. You may be wondering what state is, and the next challenge will cover it in more detail. Before that, here's a review of the terminology for components.
+
+A *stateless functional component* is any function you write which accepts props and returns JSX. A *stateless component*, on the other hand, is a class that extends `React.Component`, but does not use internal state (covered in the next challenge). Finally, a *stateful component* is a class component that does maintain its own internal state. You may see stateful components referred to simply as components or React components.
+
+A common pattern is to try to minimize statefulness and to create stateless functional components wherever possible. This helps contain your state management to a specific area of your application. In turn, this improves development and maintenance of your app by making it easier to follow how changes to state affect its behavior.
+
+# --instructions--
+
+The code editor has a `CampSite` component that renders a `Camper` component as a child. Define the `Camper` component and assign it default props of `{ name: 'CamperBot' }`. Inside the `Camper` component, render any code that you want, but make sure to have one `p` element that includes only the `name` value that is passed in as a `prop`. Finally, define `propTypes` on the `Camper` component to require `name` to be provided as a prop and verify that it is of type `string`.
+
+# --hints--
+
+The `CampSite` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return mockedComponent.find('CampSite').length === 1;
+  })()
+);
+```
+
+The `Camper` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return mockedComponent.find('Camper').length === 1;
+  })()
+);
+```
+
+The `Camper` component should include default props which assign the string `CamperBot` to the key `name`.
+
+```js
+assert(
+  /Camper.defaultProps={name:(['"`])CamperBot\1,?}/.test(
+    __helpers.removeWhiteSpace(code)
+  )
+);
+```
+
+The `Camper` component should include prop types which require the `name` prop to be of type `string`.
+
+```js
+assert(
+  /Camper.propTypes={name:PropTypes.string.isRequired,?}/.test(
+    __helpers.removeWhiteSpace(code)
+  )
+);
+```
+
+The `Camper` component should contain a `p` element with only the text from the `name` prop.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(CampSite));
+    return (
+      mockedComponent.find('p').text() ===
+      mockedComponent.find('Camper').props().name
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var PropTypes = {
+   string: { isRequired: true }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<CampSite />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class CampSite extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <Camper/>
+      </div>
+    );
+  }
+};
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+class CampSite extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <Camper/>
+      </div>
+    );
+  }
+};
+// Change code below this line
+
+const Camper = (props) => {
+   return (
+     <div>
+       <p>{props.name}</p>
+     </div>
+   );
+};
+
+Camper.propTypes = {
+  name: PropTypes.string.isRequired
+};
+
+Camper.defaultProps = {
+  name: 'CamperBot'
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/set-state-with-this.setstate.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/set-state-with-this.setstate.md
new file mode 100644
index 0000000000..93b387efc9
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/set-state-with-this.setstate.md
@@ -0,0 +1,143 @@
+---
+id: 5a24c314108439a4d4036173
+title: Set State with this.setState
+challengeType: 6
+forumTopicId: 301412
+dashedName: set-state-with-this-setstate
+---
+
+# --description--
+
+The previous challenges covered component `state` and how to initialize state in the `constructor`. There is also a way to change the component's `state`. React provides a method for updating component `state` called `setState`. You call the `setState` method within your component class like so: `this.setState()`, passing in an object with key-value pairs. The keys are your state properties and the values are the updated state data. For instance, if we were storing a `username` in state and wanted to update it, it would look like this:
+
+```jsx
+this.setState({
+  username: 'Lewis'
+});
+```
+
+React expects you to never modify `state` directly, instead always use `this.setState()` when state changes occur. Also, you should note that React may batch multiple state updates in order to improve performance. What this means is that state updates through the `setState` method can be asynchronous. There is an alternative syntax for the `setState` method which provides a way around this problem. This is rarely needed but it's good to keep it in mind! Please consult the [React documentation](https://facebook.github.io/react/docs/state-and-lifecycle.html) for further details.
+
+# --instructions--
+
+There is a `button` element in the code editor which has an `onClick()` handler. This handler is triggered when the `button` receives a click event in the browser, and runs the `handleClick` method defined on `MyComponent`. Within the `handleClick` method, update the component `state` using `this.setState()`. Set the `name` property in `state` to equal the string `React Rocks!`.
+
+Click the button and watch the rendered state update. Don't worry if you don't fully understand how the click handler code works at this point. It's covered in upcoming challenges.
+
+# --hints--
+
+The state of `MyComponent` should initialize with the key value pair `{ name: Initial State }`.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MyComponent)).state('name') ===
+    'Initial State'
+);
+```
+
+`MyComponent` should render an `h1` header.
+
+```js
+assert(Enzyme.mount(React.createElement(MyComponent)).find('h1').length === 1);
+```
+
+The rendered `h1` header should contain text rendered from the component's state.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'TestName' });
+    return waitForIt(() => mockedComponent.html());
+  };
+  const firstValue = await first();
+  assert(/<h1>TestName<\/h1>/.test(firstValue));
+};
+```
+
+Calling the `handleClick` method on `MyComponent` should set the name property in state to equal `React Rocks!`.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ name: 'Before' });
+    return waitForIt(() => mockedComponent.state('name'));
+  };
+  const second = () => {
+    mockedComponent.instance().handleClick();
+    return waitForIt(() => mockedComponent.state('name'));
+  };
+  const firstValue = await first();
+  const secondValue = await second();
+  assert(firstValue === 'Before' && secondValue === 'React Rocks!');
+};
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'Initial State'
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+    // Change code below this line
+
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <button onClick={this.handleClick}>Click Me</button>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      name: 'Initial State'
+    };
+    this.handleClick = this.handleClick.bind(this);
+  }
+  handleClick() {
+     // Change code below this line
+    this.setState({
+      name: 'React Rocks!'
+    });
+    // Change code above this line
+  }
+  render() {
+    return (
+      <div>
+        <button onClick = {this.handleClick}>Click Me</button>
+        <h1>{this.state.name}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use--for-a-more-concise-conditional.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
new file mode 100644
index 0000000000..0f13747bc3
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use--for-a-more-concise-conditional.md
@@ -0,0 +1,146 @@
+---
+id: 5a24c314108439a4d4036185
+title: Use && for a More Concise Conditional
+challengeType: 6
+forumTopicId: 301413
+dashedName: use--for-a-more-concise-conditional
+---
+
+# --description--
+
+The `if/else` statements worked in the last challenge, but there's a more concise way to achieve the same result. Imagine that you are tracking several conditions in a component and you want different elements to render depending on each of these conditions. If you write a lot of `else if` statements to return slightly different UIs, you may repeat code which leaves room for error. Instead, you can use the `&&` logical operator to perform conditional logic in a more concise way. This is possible because you want to check if a condition is `true`, and if it is, return some markup. Here's an example:
+
+```jsx
+{condition && <p>markup</p>}
+```
+
+If the `condition` is `true`, the markup will be returned. If the condition is `false`, the operation will immediately return `false` after evaluating the `condition` and return nothing. You can include these statements directly in your JSX and string multiple conditions together by writing `&&` after each one. This allows you to handle more complex conditional logic in your `render()` method without repeating a lot of code.
+
+# --instructions--
+
+Solve the previous example again, so the `h1` only renders if `display` is `true`, but use the `&&` logical operator instead of an `if/else` statement.
+
+# --hints--
+
+`MyComponent` should exist and render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('MyComponent').length;
+  })()
+);
+```
+
+When `display` is set to `true`, a `div`, `button`, and `h1` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: true });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('div').children().length === 2 &&
+      updated.find('button').length === 1 &&
+      updated.find('h1').length === 1
+  );
+};
+```
+
+When `display` is set to `false`, only a `div` and `button` should render.
+
+```js
+async () => {
+  const waitForIt = (fn) =>
+    new Promise((resolve, reject) => setTimeout(() => resolve(fn()), 250));
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const state_1 = () => {
+    mockedComponent.setState({ display: false });
+    return waitForIt(() => mockedComponent);
+  };
+  const updated = await state_1();
+  assert(
+    updated.find('div').length === 1 &&
+      updated.find('div').children().length === 1 &&
+      updated.find('button').length === 1 &&
+      updated.find('h1').length === 0
+  );
+};
+```
+
+The render method should use the `&&` logical operator to check the condition of `this.state.display`.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('&&'));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+    this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState(state => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         <h1>Displayed!</h1>
+       </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      display: true
+    }
+ this.toggleDisplay = this.toggleDisplay.bind(this);
+  }
+  toggleDisplay() {
+    this.setState(state => ({
+      display: !state.display
+    }));
+  }
+  render() {
+    // Change code below this line
+    return (
+       <div>
+         <button onClick={this.toggleDisplay}>Toggle Display</button>
+         {this.state.display && <h1>Displayed!</h1>}
+       </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
new file mode 100644
index 0000000000..3329290523
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-a-ternary-expression-for-conditional-rendering.md
@@ -0,0 +1,280 @@
+---
+id: 5a24c314108439a4d4036187
+title: Use a Ternary Expression for Conditional Rendering
+challengeType: 6
+forumTopicId: 301414
+dashedName: use-a-ternary-expression-for-conditional-rendering
+---
+
+# --description--
+
+Before moving on to dynamic rendering techniques, there's one last way to use built-in JavaScript conditionals to render what you want: the <dfn>ternary operator</dfn>. The ternary operator is often utilized as a shortcut for `if/else` statements in JavaScript. They're not quite as robust as traditional `if/else` statements, but they are very popular among React developers. One reason for this is because of how JSX is compiled, `if/else` statements can't be inserted directly into JSX code. You might have noticed this a couple challenges ago — when an `if/else` statement was required, it was always *outside* the `return` statement. Ternary expressions can be an excellent alternative if you want to implement conditional logic within your JSX. Recall that a ternary operator has three parts, but you can combine several ternary expressions together. Here's the basic syntax:
+
+```jsx
+condition ? expressionIfTrue : expressionIfFalse;
+```
+
+# --instructions--
+
+The code editor has three constants defined within the `CheckUserAge` component's `render()` method. They are called `buttonOne`, `buttonTwo`, and `buttonThree`. Each of these is assigned a simple JSX expression representing a button element. First, initialize the state of `CheckUserAge` with `input` and `userAge` both set to values of an empty string.
+
+Once the component is rendering information to the page, users should have a way to interact with it. Within the component's `return` statement, set up a ternary expression that implements the following logic: when the page first loads, render the submit button, `buttonOne`, to the page. Then, when a user enters their age and clicks the button, render a different button based on the age. If a user enters a number less than `18`, render `buttonThree`. If a user enters a number greater than or equal to `18`, render `buttonTwo`.
+
+# --hints--
+
+The `CheckUserAge` component should render with a single `input` element and a single `button` element.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).find('div').find('input')
+    .length === 1 &&
+    Enzyme.mount(React.createElement(CheckUserAge)).find('div').find('button')
+      .length === 1
+);
+```
+
+The `CheckUserAge` component's state should be initialized with a property of `userAge` and a property of `input`, both set to a value of an empty string.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).state().input === '' &&
+    Enzyme.mount(React.createElement(CheckUserAge)).state().userAge === ''
+);
+```
+
+When the `CheckUserAge` component is first rendered to the DOM, the `button`'s inner text should be Submit.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(CheckUserAge)).find('button').text() ===
+    'Submit'
+);
+```
+
+When a number of less than 18 is entered into the `input` element and the `button` is clicked, the `button`'s inner text should read `You Shall Not Pass`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const initialButton = mockedComponent.find('button').text();
+  const enter3AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '3' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter17AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '17' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge3 = enter3AndClickButton();
+  const userAge17 = enter17AndClickButton();
+  assert(
+    initialButton === 'Submit' &&
+      userAge3 === 'You Shall Not Pass' &&
+      userAge17 === 'You Shall Not Pass'
+  );
+})();
+```
+
+When a number greater than or equal to 18 is entered into the `input` element and the `button` is clicked, the `button`'s inner text should read `You May Enter`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const initialButton = mockedComponent.find('button').text();
+  const enter18AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '18' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter35AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '35' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge18 = enter18AndClickButton();
+  const userAge35 = enter35AndClickButton();
+  assert(
+    initialButton === 'Submit' &&
+      userAge18 === 'You May Enter' &&
+      userAge35 === 'You May Enter'
+  );
+})();
+```
+
+Once a number has been submitted, and the value of the `input` is once again changed, the `button` should return to reading `Submit`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(CheckUserAge));
+  const enter18AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '18' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const changeInputDontClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '5' } });
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const enter10AndClickButton = () => {
+    mockedComponent
+      .find('input')
+      .simulate('change', { target: { value: '10' } });
+    mockedComponent.find('button').simulate('click');
+    mockedComponent.update();
+    return mockedComponent.find('button').text();
+  };
+  const userAge18 = enter18AndClickButton();
+  const changeInput1 = changeInputDontClickButton();
+  const userAge10 = enter10AndClickButton();
+  const changeInput2 = changeInputDontClickButton();
+  assert(
+    userAge18 === 'You May Enter' &&
+      changeInput1 === 'Submit' &&
+      userAge10 === 'You Shall Not Pass' &&
+      changeInput2 === 'Submit'
+  );
+})();
+```
+
+Your code should not contain any `if/else` statements.
+
+```js
+assert(
+  new RegExp(/(\s|;)if(\s|\()/).test(
+    Enzyme.mount(React.createElement(CheckUserAge)).instance().render.toString()
+  ) === false
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<CheckUserAge />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class CheckUserAge extends React.Component {
+  constructor(props) {
+    super(props);
+    // Change code below this line
+
+    // Change code above this line
+    this.submit = this.submit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(e) {
+    this.setState({
+      input: e.target.value,
+      userAge: ''
+    });
+  }
+  submit() {
+    this.setState(state => ({
+      userAge: state.input
+    }));
+  }
+  render() {
+    const buttonOne = <button onClick={this.submit}>Submit</button>;
+    const buttonTwo = <button>You May Enter</button>;
+    const buttonThree = <button>You Shall Not Pass</button>;
+    return (
+      <div>
+        <h3>Enter Your Age to Continue</h3>
+        <input
+          style={inputStyle}
+          type='number'
+          value={this.state.input}
+          onChange={this.handleChange}
+        />
+        <br />
+        {/* Change code below this line */}
+
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class CheckUserAge extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userAge: '',
+      input: ''
+    };
+    this.submit = this.submit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleChange(e) {
+    this.setState({
+      input: e.target.value,
+      userAge: ''
+    });
+  }
+  submit() {
+    this.setState(state => ({
+      userAge: state.input
+    }));
+  }
+  render() {
+    const buttonOne = <button onClick={this.submit}>Submit</button>;
+    const buttonTwo = <button>You May Enter</button>;
+    const buttonThree = <button>You Shall Not Pass</button>;
+    return (
+      <div>
+        <h3>Enter Your Age to Continue</h3>
+        <input
+          style={inputStyle}
+          type='number'
+          value={this.state.input}
+          onChange={this.handleChange}
+        />
+        <br />
+        {this.state.userAge === ''
+          ? buttonOne
+          : this.state.userAge >= 18
+          ? buttonTwo
+          : buttonThree}
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
new file mode 100644
index 0000000000..d9bccebbf2
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-advanced-javascript-in-react-render-method.md
@@ -0,0 +1,334 @@
+---
+id: 5a24c314108439a4d4036183
+title: Use Advanced JavaScript in React Render Method
+challengeType: 6
+forumTopicId: 301415
+dashedName: use-advanced-javascript-in-react-render-method
+---
+
+# --description--
+
+In previous challenges, you learned how to inject JavaScript code into JSX code using curly braces, `{ }`, for tasks like accessing props, passing props, accessing state, inserting comments into your code, and most recently, styling your components. These are all common use cases to put JavaScript in JSX, but they aren't the only way that you can utilize JavaScript code in your React components.
+
+You can also write JavaScript directly in your `render` methods, before the `return` statement, ***without*** inserting it inside of curly braces. This is because it is not yet within the JSX code. When you want to use a variable later in the JSX code *inside* the `return` statement, you place the variable name inside curly braces.
+
+# --instructions--
+
+In the code provided, the `render` method has an array that contains 20 phrases to represent the answers found in the classic 1980's Magic Eight Ball toy. The button click event is bound to the `ask` method, so each time the button is clicked a random number will be generated and stored as the `randomIndex` in state. On line 52, delete the string `change me!` and reassign the `answer` const so your code randomly accesses a different index of the `possibleAnswers` array each time the component updates. Finally, insert the `answer` const inside the `p` tags.
+
+# --hints--
+
+The `MagicEightBall` component should exist and should render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall)).find('MagicEightBall')
+    .length,
+  1
+);
+```
+
+`MagicEightBall`'s first child should be an `input` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall))
+    .children()
+    .childAt(0)
+    .name(),
+  'input'
+);
+```
+
+`MagicEightBall`'s third child should be a `button` element.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MagicEightBall))
+    .children()
+    .childAt(2)
+    .name(),
+  'button'
+);
+```
+
+`MagicEightBall`'s state should be initialized with a property of `userInput` and a property of `randomIndex` both set to a value of an empty string.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MagicEightBall)).state('randomIndex') ===
+    '' &&
+    Enzyme.mount(React.createElement(MagicEightBall)).state('userInput') === ''
+);
+```
+
+When `MagicEightBall` is first mounted to the DOM, it should return an empty `p` element.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(MagicEightBall)).find('p').length === 1 &&
+    Enzyme.mount(React.createElement(MagicEightBall)).find('p').text() === ''
+);
+```
+
+When text is entered into the `input` element and the button is clicked, the `MagicEightBall` component should return a `p` element that contains a random element from the `possibleAnswers` array.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MagicEightBall));
+  const simulate = () => {
+    comp.find('input').simulate('change', { target: { value: 'test?' } });
+    comp.find('button').simulate('click');
+  };
+  const result = () => comp.find('p').text();
+  const _1 = () => {
+    simulate();
+    return result();
+  };
+  const _2 = () => {
+    simulate();
+    return result();
+  };
+  const _3 = () => {
+    simulate();
+    return result();
+  };
+  const _4 = () => {
+    simulate();
+    return result();
+  };
+  const _5 = () => {
+    simulate();
+    return result();
+  };
+  const _6 = () => {
+    simulate();
+    return result();
+  };
+  const _7 = () => {
+    simulate();
+    return result();
+  };
+  const _8 = () => {
+    simulate();
+    return result();
+  };
+  const _9 = () => {
+    simulate();
+    return result();
+  };
+  const _10 = () => {
+    simulate();
+    return result();
+  };
+  const _1_val = _1();
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  const _5_val = _5();
+  const _6_val = _6();
+  const _7_val = _7();
+  const _8_val = _8();
+  const _9_val = _9();
+  const _10_val = _10();
+  const actualAnswers = [
+    _1_val,
+    _2_val,
+    _3_val,
+    _4_val,
+    _5_val,
+    _6_val,
+    _7_val,
+    _8_val,
+    _9_val,
+    _10_val
+  ];
+  const hasIndex = actualAnswers.filter(
+    (answer, i) => possibleAnswers.indexOf(answer) !== -1
+  );
+  const notAllEqual = new Set(actualAnswers);
+  assert(notAllEqual.size > 1 && hasIndex.length === 10);
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+var possibleAnswers = [
+  'It is certain',
+  'It is decidedly so',
+  'Without a doubt',
+  'Yes, definitely',
+  'You may rely on it',
+  'As I see it, yes',
+  'Outlook good',
+  'Yes',
+  'Signs point to yes',
+  'Reply hazy try again',
+  'Ask again later',
+  'Better not tell you now',
+  'Cannot predict now',
+  'Concentrate and ask again',
+  "Don't count on it",
+  'My reply is no',
+  'My sources say no',
+  'Outlook not so good',
+  'Very doubtful',
+  'Most likely'
+];
+ReactDOM.render(<MagicEightBall />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class MagicEightBall extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userInput: '',
+      randomIndex: ''
+    };
+    this.ask = this.ask.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  ask() {
+    if (this.state.userInput) {
+      this.setState({
+        randomIndex: Math.floor(Math.random() * 20),
+        userInput: ''
+      });
+    }
+  }
+  handleChange(event) {
+    this.setState({
+      userInput: event.target.value
+    });
+  }
+  render() {
+    const possibleAnswers = [
+      'It is certain',
+      'It is decidedly so',
+      'Without a doubt',
+      'Yes, definitely',
+      'You may rely on it',
+      'As I see it, yes',
+      'Outlook good',
+      'Yes',
+      'Signs point to yes',
+      'Reply hazy try again',
+      'Ask again later',
+      'Better not tell you now',
+      'Cannot predict now',
+      'Concentrate and ask again',
+      "Don't count on it",
+      'My reply is no',
+      'My sources say no',
+      'Most likely',
+      'Outlook not so good',
+      'Very doubtful'
+    ];
+    const answer = 'change me!'; // Change this line
+    return (
+      <div>
+        <input
+          type='text'
+          value={this.state.userInput}
+          onChange={this.handleChange}
+          style={inputStyle}
+        />
+        <br />
+        <button onClick={this.ask}>Ask the Magic Eight Ball!</button>
+        <br />
+        <h3>Answer:</h3>
+        <p>
+          {/* Change code below this line */}
+
+          {/* Change code above this line */}
+        </p>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const inputStyle = {
+  width: 235,
+  margin: 5
+};
+
+class MagicEightBall extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      userInput: '',
+      randomIndex: ''
+    };
+    this.ask = this.ask.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  ask() {
+    if (this.state.userInput) {
+      this.setState({
+        randomIndex: Math.floor(Math.random() * 20),
+        userInput: ''
+      });
+    }
+  }
+  handleChange(event) {
+    this.setState({
+      userInput: event.target.value
+    });
+  }
+  render() {
+    const possibleAnswers = [
+      'It is certain',
+      'It is decidedly so',
+      'Without a doubt',
+      'Yes, definitely',
+      'You may rely on it',
+      'As I see it, yes',
+      'Outlook good',
+      'Yes',
+      'Signs point to yes',
+      'Reply hazy try again',
+      'Ask again later',
+      'Better not tell you now',
+      'Cannot predict now',
+      'Concentrate and ask again',
+      "Don't count on it",
+      'My reply is no',
+      'My sources say no',
+      'Outlook not so good',
+      'Very doubtful',
+      'Most likely'
+    ];
+    const answer = possibleAnswers[this.state.randomIndex];
+    return (
+      <div>
+        <input
+          type='text'
+          value={this.state.userInput}
+          onChange={this.handleChange}
+          style={inputStyle}
+        />
+        <br />
+        <button onClick={this.ask}>Ask the Magic Eight Ball!</button>
+        <br />
+        <h3>Answer:</h3>
+        <p>{answer}</p>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
new file mode 100644
index 0000000000..9aa54c9672
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.filter-to-dynamically-filter-an-array.md
@@ -0,0 +1,236 @@
+---
+id: 5a24c314108439a4d403618c
+title: Use Array.filter() to Dynamically Filter an Array
+challengeType: 6
+forumTopicId: 301416
+dashedName: use-array-filter-to-dynamically-filter-an-array
+---
+
+# --description--
+
+The `map` array method is a powerful tool that you will use often when working with React. Another method related to `map` is `filter`, which filters the contents of an array based on a condition, then returns a new array. For example, if you have an array of users that all have a property `online` which can be set to `true` or `false`, you can filter only those users that are online by writing:
+
+```js
+let onlineUsers = users.filter(user => user.online);
+```
+
+# --instructions--
+
+In the code editor, `MyComponent`'s `state` is initialized with an array of users. Some users are online and some aren't. Filter the array so you see only the users who are online. To do this, first use `filter` to return a new array containing only the users whose `online` property is `true`. Then, in the `renderOnline` variable, map over the filtered array, and return a `li` element for each user that contains the text of their `username`. Be sure to include a unique `key` as well, like in the last challenges.
+
+# --hints--
+
+`MyComponent` should exist and render to the page.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).find('MyComponent').length,
+  1
+);
+```
+
+`MyComponent`'s state should be initialized to an array of six users.
+
+```js
+assert(
+  Array.isArray(
+    Enzyme.mount(React.createElement(MyComponent)).state('users')
+  ) === true &&
+    Enzyme.mount(React.createElement(MyComponent)).state('users').length === 6
+);
+```
+
+`MyComponent` should return a `div`, an `h1`, and then an unordered list containing `li` elements for every user whose online status is set to `true`.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MyComponent));
+  const users = (bool) => ({
+    users: [
+      { username: 'Jeff', online: bool },
+      { username: 'Alan', online: bool },
+      { username: 'Mary', online: bool },
+      { username: 'Jim', online: bool },
+      { username: 'Laura', online: bool }
+    ]
+  });
+  const result = () => comp.find('li').length;
+  const _1 = result();
+  const _2 = () => {
+    comp.setState(users(true));
+    return result();
+  };
+  const _3 = () => {
+    comp.setState(users(false));
+    return result();
+  };
+  const _4 = () => {
+    comp.setState({ users: [] });
+    return result();
+  };
+  const _2_val = _2();
+  const _3_val = _3();
+  const _4_val = _4();
+  assert(
+    comp.find('div').length === 1 &&
+      comp.find('h1').length === 1 &&
+      comp.find('ul').length === 1 &&
+      _1 === 4 &&
+      _2_val === 5 &&
+      _3_val === 0 &&
+      _4_val === 0
+  );
+})();
+```
+
+`MyComponent` should render `li` elements that contain the `username` of each online user.
+
+```js
+(() => {
+  const comp = Enzyme.mount(React.createElement(MyComponent));
+  const users = (bool) => ({
+    users: [
+      { username: 'Jeff', online: bool },
+      { username: 'Alan', online: bool },
+      { username: 'Mary', online: bool },
+      { username: 'Jim', online: bool },
+      { username: 'Laura', online: bool }
+    ]
+  });
+  const ul = () => {
+    comp.setState(users(true));
+    return comp.find('ul').html();
+  };
+  const html = ul();
+  assert(
+    html ===
+      '<ul><li>Jeff</li><li>Alan</li><li>Mary</li><li>Jim</li><li>Laura</li></ul>'
+  );
+})();
+```
+
+Each list item element should have a unique `key` attribute.
+
+```js
+assert(
+  (() => {
+    const ul = Enzyme.mount(React.createElement(MyComponent)).find('ul');
+    console.log(ul.debug());
+    const keys = new Set([
+      ul.childAt(0).key(),
+      ul.childAt(1).key(),
+      ul.childAt(2).key(),
+      ul.childAt(3).key()
+    ]);
+    return keys.size === 4;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      users: [
+        {
+          username: 'Jeff',
+          online: true
+        },
+        {
+          username: 'Alan',
+          online: false
+        },
+        {
+          username: 'Mary',
+          online: true
+        },
+        {
+          username: 'Jim',
+          online: false
+        },
+        {
+          username: 'Sara',
+          online: true
+        },
+        {
+          username: 'Laura',
+          online: true
+        }
+      ]
+    };
+  }
+  render() {
+    const usersOnline = null; // Change this line
+    const renderOnline = null; // Change this line
+    return (
+      <div>
+        <h1>Current Online Users:</h1>
+        <ul>{renderOnline}</ul>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      users: [
+        {
+          username: 'Jeff',
+          online: true
+        },
+        {
+          username: 'Alan',
+          online: false
+        },
+        {
+          username: 'Mary',
+          online: true
+        },
+        {
+          username: 'Jim',
+          online: false
+        },
+        {
+          username: 'Sara',
+          online: true
+        },
+        {
+          username: 'Laura',
+          online: true
+        }
+      ]
+    };
+  }
+  render() {
+    const usersOnline = this.state.users.filter(user => {
+      return user.online;
+    });
+    const renderOnline = usersOnline.map(user => {
+      return <li key={user.username}>{user.username}</li>;
+    });
+    return (
+      <div>
+        <h1>Current Online Users:</h1>
+        <ul>{renderOnline}</ul>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
new file mode 100644
index 0000000000..0d6cca62f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-array.map-to-dynamically-render-elements.md
@@ -0,0 +1,265 @@
+---
+id: 5a24c314108439a4d403618a
+title: Use Array.map() to Dynamically Render Elements
+challengeType: 6
+forumTopicId: 301417
+dashedName: use-array-map-to-dynamically-render-elements
+---
+
+# --description--
+
+Conditional rendering is useful, but you may need your components to render an unknown number of elements. Often in reactive programming, a programmer has no way to know what the state of an application is until runtime, because so much depends on a user's interaction with that program. Programmers need to write their code to correctly handle that unknown state ahead of time. Using `Array.map()` in React illustrates this concept.
+
+For example, you create a simple "To Do List" app. As the programmer, you have no way of knowing how many items a user might have on their list. You need to set up your component to dynamically render the correct number of list elements long before someone using the program decides that today is laundry day.
+
+# --instructions--
+
+The code editor has most of the `MyToDoList` component set up. Some of this code should look familiar if you completed the controlled form challenge. You'll notice a `textarea` and a `button`, along with a couple of methods that track their states, but nothing is rendered to the page yet.
+
+Inside the `constructor`, create a `this.state` object and define two states: `userInput` should be initialized as an empty string, and `toDoList` should be initialized as an empty array. Next, delete the comment in the `render()` method next to the `items` variable. In its place, map over the `toDoList` array stored in the component's internal state and dynamically render a `li` for each item. Try entering the string `eat, code, sleep, repeat` into the `textarea`, then click the button and see what happens.
+
+**Note:** You may know that all sibling child elements created by a mapping operation like this do need to be supplied with a unique `key` attribute. Don't worry, this is the topic of the next challenge.
+
+# --hints--
+
+The MyToDoList component should exist and render to the page.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return mockedComponent.find('MyToDoList').length === 1;
+  })()
+);
+```
+
+The first child of `MyToDoList` should be a `textarea` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(0).type() ===
+      'textarea'
+    );
+  })()
+);
+```
+
+The second child of `MyToDoList` should be a `br` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(1).type() === 'br'
+    );
+  })()
+);
+```
+
+The third child of `MyToDoList` should be a `button` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    return (
+      mockedComponent.find('MyToDoList').children().childAt(2).type() ===
+      'button'
+    );
+  })()
+);
+```
+
+The state of `MyToDoList` should be initialized with `toDoList` as an empty array.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    const initialState = mockedComponent.state();
+    return (
+      Array.isArray(initialState.toDoList) === true &&
+      initialState.toDoList.length === 0
+    );
+  })()
+);
+```
+
+The state of `MyToDoList` should be initialized with `userInput` as an empty string.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+    const initialState = mockedComponent.state();
+    return (
+      typeof initialState.userInput === 'string' &&
+      initialState.userInput.length === 0
+    );
+  })()
+);
+```
+
+When the `Create List` button is clicked, the `MyToDoList` component should dynamically return an unordered list that contains a list item element for every item of a comma-separated list entered into the `textarea` element.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyToDoList));
+  const simulateChange = (el, value) =>
+    el.simulate('change', { target: { value } });
+  const state_1 = () => {
+    return mockedComponent.find('ul').find('li');
+  };
+  const setInput = () => {
+    return simulateChange(
+      mockedComponent.find('textarea'),
+      'testA, testB, testC'
+    );
+  };
+  const click = () => {
+    return mockedComponent.find('button').simulate('click');
+  };
+  const state_2 = () => {
+    const nodes = mockedComponent.find('ul').find('li');
+    return { nodes, text: nodes.reduce((t, n) => t + n.text().trim(), '') };
+  };
+  const setInput_2 = () => {
+    return simulateChange(
+      mockedComponent.find('textarea'),
+      't1, t2, t3, t4, t5, t6'
+    );
+  };
+  const click_1 = () => {
+    return mockedComponent.find('button').simulate('click');
+  };
+  const state_3 = () => {
+    const nodes = mockedComponent.find('ul').find('li');
+    return { nodes, text: nodes.reduce((t, n) => t + n.text().trim(), '') };
+  };
+  const awaited_state_1 = state_1();
+  const awaited_setInput = setInput();
+  const awaited_click = click();
+  const awaited_state_2 = state_2();
+  const awaited_setInput_2 = setInput_2();
+  const awaited_click_1 = click_1();
+  const awaited_state_3 = state_3();
+  assert(
+    awaited_state_1.length === 0 &&
+      awaited_state_2.nodes.length === 3 &&
+      awaited_state_3.nodes.length === 6 &&
+      awaited_state_2.text === 'testAtestBtestC' &&
+      awaited_state_3.text === 't1t2t3t4t5t6'
+  );
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyToDoList />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+const textAreaStyles = {
+  width: 235,
+  margin: 5
+};
+
+class MyToDoList extends React.Component {
+  constructor(props) {
+    super(props);
+    // Change code below this line
+
+    // Change code above this line
+    this.handleSubmit = this.handleSubmit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleSubmit() {
+    const itemsArray = this.state.userInput.split(',');
+    this.setState({
+      toDoList: itemsArray
+    });
+  }
+  handleChange(e) {
+    this.setState({
+      userInput: e.target.value
+    });
+  }
+  render() {
+    const items = null; // Change this line
+    return (
+      <div>
+        <textarea
+          onChange={this.handleChange}
+          value={this.state.userInput}
+          style={textAreaStyles}
+          placeholder='Separate Items With Commas'
+        />
+        <br />
+        <button onClick={this.handleSubmit}>Create List</button>
+        <h1>My "To Do" List:</h1>
+        <ul>{items}</ul>
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+const textAreaStyles = {
+  width: 235,
+  margin: 5
+};
+
+class MyToDoList extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      toDoList: [],
+      userInput: ''
+    };
+    this.handleSubmit = this.handleSubmit.bind(this);
+    this.handleChange = this.handleChange.bind(this);
+  }
+  handleSubmit() {
+    const itemsArray = this.state.userInput.split(',');
+    this.setState({
+      toDoList: itemsArray
+    });
+  }
+  handleChange(e) {
+    this.setState({
+      userInput: e.target.value
+    });
+  }
+  render() {
+    const items = this.state.toDoList.map((item, i) => {
+      return <li key={i}>{item}</li>;
+    });
+    return (
+      <div>
+        <textarea
+          onChange={this.handleChange}
+          value={this.state.userInput}
+          style={textAreaStyles}
+          placeholder='Separate Items With Commas'
+        />
+        <br />
+        <button onClick={this.handleSubmit}>Create List</button>
+        <h1>My "To Do" List:</h1>
+        <ul>{items}</ul>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-default-props.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-default-props.md
new file mode 100644
index 0000000000..1f048ada95
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-default-props.md
@@ -0,0 +1,78 @@
+---
+id: 5a24c314108439a4d403616b
+title: Use Default Props
+challengeType: 6
+forumTopicId: 301418
+dashedName: use-default-props
+---
+
+# --description--
+
+React also has an option to set default props. You can assign default props to a component as a property on the component itself and React assigns the default prop if necessary. This allows you to specify what a prop value should be if no value is explicitly provided. For example, if you declare `MyComponent.defaultProps = { location: 'San Francisco' }`, you have defined a location prop that's set to the string `San Francisco`, unless you specify otherwise. React assigns default props if props are undefined, but if you pass `null` as the value for a prop, it will remain `null`.
+
+# --instructions--
+
+The code editor shows a `ShoppingCart` component. Define default props on this component which specify a prop `items` with a value of `0`.
+
+# --hints--
+
+The `ShoppingCart` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The `ShoppingCart` component should have a default prop of `{ items: 0 }`.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    mockedComponent.setProps({ items: undefined });
+    return mockedComponent.find('ShoppingCart').props().items === 0;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const ShoppingCart = (props) => {
+  return (
+    <div>
+      <h1>Shopping Cart Component</h1>
+    </div>
+  )
+};
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+const ShoppingCart = (props) => {
+  return (
+    <div>
+      <h1>Shopping Cart Component</h1>
+    </div>
+  )
+};
+
+// Change code below this line
+ShoppingCart.defaultProps = {
+  items: 0
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
new file mode 100644
index 0000000000..2c6a725994
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-proptypes-to-define-the-props-you-expect.md
@@ -0,0 +1,132 @@
+---
+id: 5a24c314108439a4d403616d
+title: Use PropTypes to Define the Props You Expect
+challengeType: 6
+forumTopicId: 301419
+dashedName: use-proptypes-to-define-the-props-you-expect
+---
+
+# --description--
+
+React provides useful type-checking features to verify that components receive props of the correct type. For example, your application makes an API call to retrieve data that you expect to be in an array, which is then passed to a component as a prop. You can set `propTypes` on your component to require the data to be of type `array`. This will throw a useful warning when the data is of any other type.
+
+It's considered a best practice to set `propTypes` when you know the type of a prop ahead of time. You can define a `propTypes` property for a component in the same way you defined `defaultProps`. Doing this will check that props of a given key are present with a given type. Here's an example to require the type `function` for a prop called `handleClick`:
+
+```js
+MyComponent.propTypes = { handleClick: PropTypes.func.isRequired }
+```
+
+In the example above, the `PropTypes.func` part checks that `handleClick` is a function. Adding `isRequired` tells React that `handleClick` is a required property for that component. You will see a warning if that prop isn't provided. Also notice that `func` represents `function`. Among the seven JavaScript primitive types, `function` and `boolean` (written as `bool`) are the only two that use unusual spelling. In addition to the primitive types, there are other types available. For example, you can check that a prop is a React element. Please refer to the [documentation](https://reactjs.org/docs/jsx-in-depth.html#specifying-the-react-element-type) for all of the options.
+
+**Note:** As of React v15.5.0, `PropTypes` is imported independently from React, like this: `import PropTypes from 'prop-types';`
+
+# --instructions--
+
+Define `propTypes` for the `Items` component to require `quantity` as a prop and verify that it is of type `number`.
+
+# --hints--
+
+The `ShoppingCart` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('ShoppingCart').length === 1;
+  })()
+);
+```
+
+The `Items` component should render.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(ShoppingCart));
+    return mockedComponent.find('Items').length === 1;
+  })()
+);
+```
+
+The `Items` component should include a `propTypes` check to require a value for `quantity` and ensure that its value is a number.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        noWhiteSpace.includes('quantity:PropTypes.number.isRequired') &&
+        noWhiteSpace.includes('Items.propTypes=')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --before-user-code--
+
+```jsx
+var PropTypes = {
+  number: { isRequired: true }
+};
+```
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<ShoppingCart />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+};
+
+// Change code below this line
+
+// Change code above this line
+
+Items.defaultProps = {
+  quantity: 0
+};
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <Items />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const Items = (props) => {
+  return <h1>Current Quantity of Items in Cart: {props.quantity}</h1>
+};
+
+// Change code below this line
+Items.propTypes = {
+  quantity: PropTypes.number.isRequired
+};
+// Change code above this line
+
+Items.defaultProps = {
+  quantity: 0
+};
+
+class ShoppingCart extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return <Items />
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-react-to-render-nested-components.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-react-to-render-nested-components.md
new file mode 100644
index 0000000000..3f98507054
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-react-to-render-nested-components.md
@@ -0,0 +1,150 @@
+---
+id: 5a24c314108439a4d4036165
+title: Use React to Render Nested Components
+challengeType: 6
+forumTopicId: 301420
+dashedName: use-react-to-render-nested-components
+---
+
+# --description--
+
+The last challenge showed a simple way to compose two components, but there are many different ways you can compose components with React.
+
+Component composition is one of React's powerful features. When you work with React, it is important to start thinking about your user interface in terms of components like the App example in the last challenge. You break down your UI into its basic building blocks, and those pieces become the components. This helps to separate the code responsible for the UI from the code responsible for handling your application logic. It can greatly simplify the development and maintenance of complex projects.
+
+# --instructions--
+
+There are two functional components defined in the code editor, called `TypesOfFruit` and `Fruits`. Take the `TypesOfFruit` component and compose it, or *nest* it, within the `Fruits` component. Then take the `Fruits` component and nest it within the `TypesOfFood` component. The result should be a child component, nested within a parent component, which is nested within a parent component of its own!
+
+# --hints--
+
+The `TypesOfFood` component should return a single `div` element.
+
+```js
+assert(Enzyme.shallow(React.createElement(TypesOfFood)).type() === 'div');
+```
+
+The `TypesOfFood` component should return the `Fruits` component.
+
+```js
+assert(
+  Enzyme.shallow(React.createElement(TypesOfFood)).props().children[1].type
+    .name === 'Fruits'
+);
+```
+
+The `Fruits` component should return the `TypesOfFruit` component.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(TypesOfFood)).find('h2').html() ===
+    '<h2>Fruits:</h2>'
+);
+```
+
+The `TypesOfFruit` component should return the `h2` and `ul` elements.
+
+```js
+assert(
+  Enzyme.mount(React.createElement(TypesOfFood)).find('ul').text() ===
+    'ApplesBlueberriesStrawberriesBananas'
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<TypesOfFood />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+const TypesOfFruit = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <ul>
+        <li>Apples</li>
+        <li>Blueberries</li>
+        <li>Strawberries</li>
+        <li>Bananas</li>
+      </ul>
+    </div>
+  );
+};
+
+const Fruits = () => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+const TypesOfFruit = () => {
+  return (
+    <div>
+      <h2>Fruits:</h2>
+      <ul>
+        <li>Apples</li>
+        <li>Blueberries</li>
+        <li>Strawberries</li>
+        <li>Bananas</li>
+      </ul>
+    </div>
+  );
+};
+
+const Fruits = () => {
+  return (
+    <div>
+      { /* Change code below this line */ }
+        <TypesOfFruit />
+      { /* Change code above this line */ }
+    </div>
+  );
+};
+
+class TypesOfFood extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+
+  render() {
+    return (
+      <div>
+        <h1>Types of Food:</h1>
+        { /* Change code below this line */ }
+        <Fruits />
+        { /* Change code above this line */ }
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-state-to-toggle-an-element.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-state-to-toggle-an-element.md
new file mode 100644
index 0000000000..d4b7578928
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-state-to-toggle-an-element.md
@@ -0,0 +1,189 @@
+---
+id: 5a24c314108439a4d4036176
+title: Use State to Toggle an Element
+challengeType: 6
+forumTopicId: 301421
+dashedName: use-state-to-toggle-an-element
+---
+
+# --description--
+
+Sometimes you might need to know the previous state when updating the state. However, state updates may be asynchronous - this means React may batch multiple `setState()` calls into a single update. This means you can't rely on the previous value of `this.state` or `this.props` when calculating the next value. So, you should not use code like this:
+
+```jsx
+this.setState({
+  counter: this.state.counter + this.props.increment
+});
+```
+
+Instead, you should pass `setState` a function that allows you to access state and props. Using a function with `setState` guarantees you are working with the most current values of state and props. This means that the above should be rewritten as:
+
+```jsx
+this.setState((state, props) => ({
+  counter: state.counter + props.increment
+}));
+```
+
+You can also use a form without `props` if you need only the `state`:
+
+```jsx
+this.setState(state => ({
+  counter: state.counter + 1
+}));
+```
+
+Note that you have to wrap the object literal in parentheses, otherwise JavaScript thinks it's a block of code.
+
+# --instructions--
+
+`MyComponent` has a `visibility` property which is initialized to `false`. The render method returns one view if the value of `visibility` is true, and a different view if it is false.
+
+Currently, there is no way of updating the `visibility` property in the component's `state`. The value should toggle back and forth between true and false. There is a click handler on the button which triggers a class method called `toggleVisibility()`. Pass a function to `setState` to define this method so that the `state` of `visibility` toggles to the opposite value when the method is called. If `visibility` is `false`, the method sets it to `true`, and vice versa.
+
+Finally, click the button to see the conditional rendering of the component based on its `state`.
+
+**Hint:** Don't forget to bind the `this` keyword to the method in the `constructor`!
+
+# --hints--
+
+`MyComponent` should return a `div` element which contains a `button`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).find('div').find('button')
+    .length,
+  1
+);
+```
+
+The state of `MyComponent` should initialize with a `visibility` property set to `false`.
+
+```js
+assert.strictEqual(
+  Enzyme.mount(React.createElement(MyComponent)).state('visibility'),
+  false
+);
+```
+
+Clicking the button element should toggle the `visibility` property in state between `true` and `false`.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ visibility: false });
+    return mockedComponent.state('visibility');
+  };
+  const second = () => {
+    mockedComponent.find('button').simulate('click');
+    return mockedComponent.state('visibility');
+  };
+  const third = () => {
+    mockedComponent.find('button').simulate('click');
+    return mockedComponent.state('visibility');
+  };
+  const firstValue = first();
+  const secondValue = second();
+  const thirdValue = third();
+  assert(!firstValue && secondValue && !thirdValue);
+})();
+```
+
+An anonymous function should be passed to `setState`.
+
+```js
+const paramRegex = '[a-zA-Z$_]\\w*(,[a-zA-Z$_]\\w*)?';
+assert(
+  new RegExp(
+    'this\\.setState\\((function\\(' +
+      paramRegex +
+      '\\){|([a-zA-Z$_]\\w*|\\(' +
+      paramRegex +
+      '\\))=>)'
+  ).test(__helpers.removeWhiteSpace(code))
+);
+```
+
+`this` should not be used inside `setState`
+
+```js
+assert(!/this\.setState\([^}]*this/.test(code));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      visibility: false
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    if (this.state.visibility) {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+          <h1>Now you see me!</h1>
+        </div>
+      );
+    } else {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+        </div>
+      );
+    }
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      visibility: false
+    };
+    this.toggleVisibility = this.toggleVisibility.bind(this);
+  }
+  toggleVisibility() {
+    this.setState(state => ({
+      visibility: !state.visibility
+    }));
+  }
+  render() {
+    if (this.state.visibility) {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+          <h1>Now you see me!</h1>
+        </div>
+      );
+    } else {
+      return (
+        <div>
+          <button onClick={this.toggleVisibility}>Click Me</button>
+        </div>
+      );
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
new file mode 100644
index 0000000000..f20b192ce8
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentdidmount.md
@@ -0,0 +1,127 @@
+---
+id: 5a24c314108439a4d403617d
+title: Use the Lifecycle Method componentDidMount
+challengeType: 6
+forumTopicId: 301422
+dashedName: use-the-lifecycle-method-componentdidmount
+---
+
+# --description--
+
+Most web developers, at some point, need to call an API endpoint to retrieve data. If you're working with React, it's important to know where to perform this action.
+
+The best practice with React is to place API calls or any calls to your server in the lifecycle method `componentDidMount()`. This method is called after a component is mounted to the DOM. Any calls to `setState()` here will trigger a re-rendering of your component. When you call an API in this method, and set your state with the data that the API returns, it will automatically trigger an update once you receive the data.
+
+# --instructions--
+
+There is a mock API call in `componentDidMount()`. It sets state after 2.5 seconds to simulate calling a server to retrieve data. This example requests the current total active users for a site. In the render method, render the value of `activeUsers` in the `h1` after the text `Active Users:`. Watch what happens in the preview, and feel free to change the timeout to see the different effects.
+
+# --hints--
+
+`MyComponent` should render a `div` element which wraps an `h1` tag.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return (
+      mockedComponent.find('div').length === 1 &&
+      mockedComponent.find('h1').length === 1
+    );
+  })()
+);
+```
+
+Component state should be updated with a timeout function in `componentDidMount`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return new RegExp('setTimeout(.|\n)+setState(.|\n)+activeUsers').test(
+      String(mockedComponent.instance().componentDidMount)
+    );
+  })()
+);
+```
+
+The `h1` tag should render the `activeUsers` value from `MyComponent`'s state.
+
+```js
+(() => {
+  const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+  const first = () => {
+    mockedComponent.setState({ activeUsers: 1237 });
+    return mockedComponent.find('h1').text();
+  };
+  const second = () => {
+    mockedComponent.setState({ activeUsers: 1000 });
+    return mockedComponent.find('h1').text();
+  };
+  assert(new RegExp('1237').test(first()) && new RegExp('1000').test(second()));
+})();
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'));
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      activeUsers: null
+    };
+  }
+  componentDidMount() {
+    setTimeout(() => {
+      this.setState({
+        activeUsers: 1273
+      });
+    }, 2500);
+  }
+  render() {
+    return (
+      <div>
+        {/* Change code below this line */}
+        <h1>Active Users: </h1>
+        {/* Change code above this line */}
+      </div>
+    );
+  }
+}
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      activeUsers: null
+    };
+  }
+  componentDidMount() {
+    setTimeout(() => {
+      this.setState({
+        activeUsers: 1273
+      });
+    }, 2500);
+  }
+  render() {
+    return (
+      <div>
+        <h1>Active Users: {this.state.activeUsers}</h1>
+      </div>
+    );
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
new file mode 100644
index 0000000000..6095a48eed
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/use-the-lifecycle-method-componentwillmount.md
@@ -0,0 +1,87 @@
+---
+id: 5a24c314108439a4d403617c
+title: Use the Lifecycle Method componentWillMount
+challengeType: 6
+forumTopicId: 301423
+dashedName: use-the-lifecycle-method-componentwillmount
+---
+
+# --description--
+
+React components have several special methods that provide opportunities to perform actions at specific points in the lifecycle of a component. These are called lifecycle methods, or lifecycle hooks, and allow you to catch components at certain points in time. This can be before they are rendered, before they update, before they receive props, before they unmount, and so on. Here is a list of some of the main lifecycle methods: `componentWillMount()` `componentDidMount()` `shouldComponentUpdate()` `componentDidUpdate()` `componentWillUnmount()` The next several lessons will cover some of the basic use cases for these lifecycle methods.
+
+**Note:** The `componentWillMount` Lifecycle method will be deprecated in a future version of 16.X and removed in version 17. [(Source)](https://reactjs.org/blog/2018/03/27/update-on-async-rendering.html)
+
+# --instructions--
+
+The `componentWillMount()` method is called before the `render()` method when a component is being mounted to the DOM. Log something to the console within `componentWillMount()` - you may want to have your browser console open to see the output.
+
+# --hints--
+
+`MyComponent` should render a `div` element.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('div').length === 1;
+  })()
+);
+```
+
+`console.log` should be called in `componentWillMount`.
+
+```js
+assert(
+  (function () {
+    const lifecycle = React.createElement(MyComponent)
+      .type.prototype.componentWillMount.toString()
+      .replace(/ /g, '');
+    return lifecycle.includes('console.log(');
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<MyComponent />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  componentWillMount() {
+    // Change code below this line
+
+    // Change code above this line
+  }
+  render() {
+    return <div />
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  componentWillMount() {
+    // Change code below this line
+    console.log('Component is mounting...');
+    // Change code above this line
+  }
+  render() {
+    return <div />
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-react-component-from-scratch.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-react-component-from-scratch.md
new file mode 100644
index 0000000000..83cf8603ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-react-component-from-scratch.md
@@ -0,0 +1,84 @@
+---
+id: 5a24c314108439a4d4036168
+title: Write a React Component from Scratch
+challengeType: 6
+forumTopicId: 301424
+dashedName: write-a-react-component-from-scratch
+---
+
+# --description--
+
+Now that you've learned the basics of JSX and React components, it's time to write a component on your own. React components are the core building blocks of React applications so it's important to become very familiar with writing them. Remember, a typical React component is an ES6 `class` which extends `React.Component`. It has a render method that returns HTML (from JSX) or `null`. This is the basic form of a React component. Once you understand this well, you will be prepared to start building more complex React projects.
+
+# --instructions--
+
+Define a class `MyComponent` that extends `React.Component`. Its render method should return a `div` that contains an `h1` tag with the text: `My First React Component!` in it. Use this text exactly, the case and punctuation matter. Make sure to call the constructor for your component, too.
+
+Render this component to the DOM using `ReactDOM.render()`. There is a `div` with `id='challenge-node'` available for you to use.
+
+# --hints--
+
+There should be a React component called `MyComponent`.
+
+```js
+(getUserInput) =>
+  assert(
+    __helpers
+      .removeWhiteSpace(getUserInput('index'))
+      .includes('classMyComponentextendsReact.Component{')
+  );
+```
+
+`MyComponent` should contain an `h1` tag with text `My First React Component!` Case and punctuation matter.
+
+```js
+assert(
+  (function () {
+    const mockedComponent = Enzyme.mount(React.createElement(MyComponent));
+    return mockedComponent.find('h1').text() === 'My First React Component!';
+  })()
+);
+```
+
+`MyComponent` should render to the DOM.
+
+```js
+assert(document.getElementById('challenge-node').childNodes.length === 1);
+```
+
+`MyComponent` should have a constructor calling `super` with `props`.
+
+```js
+assert(
+  MyComponent.toString().includes('MyComponent(props)') &&
+    MyComponent.toString().includes('_super.call(this, props)')
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```jsx
+// Change code below this line
+```
+
+# --solutions--
+
+```jsx
+// Change code below this line
+class MyComponent extends React.Component {
+  constructor(props) {
+    super(props);
+  }
+  render() {
+    return (
+      <div>
+        <h1>My First React Component!</h1>
+      </div>
+    );
+  }
+};
+
+ReactDOM.render(<MyComponent />, document.getElementById('challenge-node'));
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-simple-counter.md b/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-simple-counter.md
new file mode 100644
index 0000000000..9522c78e54
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/react/write-a-simple-counter.md
@@ -0,0 +1,146 @@
+---
+id: 5a24c314108439a4d4036177
+title: Write a Simple Counter
+challengeType: 6
+forumTopicId: 301425
+dashedName: write-a-simple-counter
+---
+
+# --description--
+
+You can design a more complex stateful component by combining the concepts covered so far. These include initializing `state`, writing methods that set `state`, and assigning click handlers to trigger these methods.
+
+# --instructions--
+
+The `Counter` component keeps track of a `count` value in `state`. There are two buttons which call methods `increment()` and `decrement()`. Write these methods so the counter value is incremented or decremented by 1 when the appropriate button is clicked. Also, create a `reset()` method so when the reset button is clicked, the count is set to 0.
+
+**Note:** Make sure you don't modify the `className`s of the buttons. Also, remember to add the necessary bindings for the newly-created methods in the constructor.
+
+# --hints--
+
+`Counter` should return a `div` element which contains three buttons with text content in this order `Increment!`, `Decrement!`, `Reset`.
+
+```js
+assert(
+  (() => {
+    const mockedComponent = Enzyme.mount(React.createElement(Counter));
+    return (
+      mockedComponent.find('.inc').text() === 'Increment!' &&
+      mockedComponent.find('.dec').text() === 'Decrement!' &&
+      mockedComponent.find('.reset').text() === 'Reset'
+    );
+  })()
+);
+```
+
+The state of `Counter` should initialize with a `count` property set to `0`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+assert(mockedComponent.find('h1').text() === 'Current Count: 0');
+```
+
+Clicking the increment button should increment the count by `1`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.find('.inc').simulate('click');
+assert(mockedComponent.find('h1').text() === 'Current Count: 1');
+```
+
+Clicking the decrement button should decrement the count by `1`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.find('.dec').simulate('click');
+assert(mockedComponent.find('h1').text() === 'Current Count: -1');
+```
+
+Clicking the reset button should reset the count to `0`.
+
+```js
+const mockedComponent = Enzyme.mount(React.createElement(Counter));
+mockedComponent.setState({ count: 5 });
+const currentCountElement = mockedComponent.find('h1');
+assert(currentCountElement.text() === 'Current Count: 5');
+mockedComponent.find('.reset').simulate('click');
+assert(currentCountElement.text() === 'Current Count: 0');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```jsx
+ReactDOM.render(<Counter />, document.getElementById('root'))
+```
+
+## --seed-contents--
+
+```jsx
+class Counter extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      count: 0
+    };
+    // Change code below this line
+
+    // Change code above this line
+  }
+  // Change code below this line
+
+  // Change code above this line
+  render() {
+    return (
+      <div>
+        <button className='inc' onClick={this.increment}>Increment!</button>
+        <button className='dec' onClick={this.decrement}>Decrement!</button>
+        <button className='reset' onClick={this.reset}>Reset</button>
+        <h1>Current Count: {this.state.count}</h1>
+      </div>
+    );
+  }
+};
+```
+
+# --solutions--
+
+```jsx
+class Counter extends React.Component {
+  constructor(props) {
+    super(props);
+    this.state = {
+      count: 0
+    };
+  this.increment = this.increment.bind(this);
+ this.decrement = this.decrement.bind(this);
+ this.reset = this.reset.bind(this);
+ }
+  reset() {
+    this.setState({
+      count: 0
+    });
+  }
+  increment() {
+    this.setState(state => ({
+      count: state.count + 1
+    }));
+  }
+  decrement() {
+    this.setState(state => ({
+      count: state.count - 1
+    }));
+  }
+  render() {
+    return (
+      <div>
+        <button className='inc' onClick={this.increment}>Increment!</button>
+        <button className='dec' onClick={this.decrement}>Decrement!</button>
+        <button className='reset' onClick={this.reset}>Reset</button>
+        <h1>Current Count: {this.state.count}</h1>
+      </div>
+    );
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/combine-multiple-reducers.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/combine-multiple-reducers.md
new file mode 100644
index 0000000000..741bfc9c6a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/combine-multiple-reducers.md
@@ -0,0 +1,175 @@
+---
+id: 5a24c314108439a4d4036154
+title: Combine Multiple Reducers
+challengeType: 6
+forumTopicId: 301436
+dashedName: combine-multiple-reducers
+---
+
+# --description--
+
+When the state of your app begins to grow more complex, it may be tempting to divide state into multiple pieces. Instead, remember the first principle of Redux: all app state is held in a single state object in the store. Therefore, Redux provides reducer composition as a solution for a complex state model. You define multiple reducers to handle different pieces of your application's state, then compose these reducers together into one root reducer. The root reducer is then passed into the Redux `createStore()` method.
+
+In order to let us combine multiple reducers together, Redux provides the `combineReducers()` method. This method accepts an object as an argument in which you define properties which associate keys to specific reducer functions. The name you give to the keys will be used by Redux as the name for the associated piece of state.
+
+Typically, it is a good practice to create a reducer for each piece of application state when they are distinct or unique in some way. For example, in a note-taking app with user authentication, one reducer could handle authentication while another handles the text and notes that the user is submitting. For such an application, we might write the `combineReducers()` method like this:
+
+```js
+const rootReducer = Redux.combineReducers({
+  auth: authenticationReducer,
+  notes: notesReducer
+});
+```
+
+Now, the key `notes` will contain all of the state associated with our notes and handled by our `notesReducer`. This is how multiple reducers can be composed to manage more complex application state. In this example, the state held in the Redux store would then be a single object containing `auth` and `notes` properties.
+
+# --instructions--
+
+There are `counterReducer()` and `authReducer()` functions provided in the code editor, along with a Redux store. Finish writing the `rootReducer()` function using the `Redux.combineReducers()` method. Assign `counterReducer` to a key called `count` and `authReducer` to a key called `auth`.
+
+# --hints--
+
+The `counterReducer` should increment and decrement the `state`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState().count;
+    store.dispatch({ type: INCREMENT });
+    store.dispatch({ type: INCREMENT });
+    const firstState = store.getState().count;
+    store.dispatch({ type: DECREMENT });
+    const secondState = store.getState().count;
+    return firstState === initialState + 2 && secondState === firstState - 1;
+  })()
+);
+```
+
+The `authReducer` should toggle the `state` of `authenticated` between `true` and `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch({ type: LOGIN });
+    const loggedIn = store.getState().auth.authenticated;
+    store.dispatch({ type: LOGOUT });
+    const loggedOut = store.getState().auth.authenticated;
+    return loggedIn === true && loggedOut === false;
+  })()
+);
+```
+
+The store `state` should have two keys: `count`, which holds a number, and `auth`, which holds an object. The `auth` object should have a property of `authenticated`, which holds a boolean.
+
+```js
+assert(
+  (function () {
+    const state = store.getState();
+    return (
+      typeof state.auth === 'object' &&
+      typeof state.auth.authenticated === 'boolean' &&
+      typeof state.count === 'number'
+    );
+  })()
+);
+```
+
+The `rootReducer` should be a function that combines the `counterReducer` and the `authReducer`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(getUserInput('index'));
+      return (
+        typeof rootReducer === 'function' &&
+        noWhiteSpace.includes('Redux.combineReducers')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const authReducer = (state = {authenticated: false}, action) => {
+  switch(action.type) {
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+    default:
+      return state;
+  }
+};
+
+const rootReducer = // Define the root reducer here
+
+const store = Redux.createStore(rootReducer);
+```
+
+# --solutions--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const authReducer = (state = {authenticated: false}, action) => {
+  switch(action.type) {
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+    default:
+      return state;
+  }
+};
+
+const rootReducer = Redux.combineReducers({
+  count: counterReducer,
+  auth: authReducer
+});
+
+const store = Redux.createStore(rootReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/copy-an-object-with-object.assign.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
new file mode 100644
index 0000000000..9c004ef012
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/copy-an-object-with-object.assign.md
@@ -0,0 +1,133 @@
+---
+id: 5a24c314108439a4d403615b
+title: Copy an Object with Object.assign
+challengeType: 6
+forumTopicId: 301437
+dashedName: copy-an-object-with-object-assign
+---
+
+# --description--
+
+The last several challenges worked with arrays, but there are ways to help enforce state immutability when state is an `object`, too. A useful tool for handling objects is the `Object.assign()` utility. `Object.assign()` takes a target object and source objects and maps properties from the source objects to the target object. Any matching properties are overwritten by properties in the source objects. This behavior is commonly used to make shallow copies of objects by passing an empty object as the first argument followed by the object(s) you want to copy. Here's an example:
+
+```js
+const newObject = Object.assign({}, obj1, obj2);
+```
+
+This creates `newObject` as a new `object`, which contains the properties that currently exist in `obj1` and `obj2`.
+
+# --instructions--
+
+The Redux state and actions were modified to handle an `object` for the `state`. Edit the code to return a new `state` object for actions with type `ONLINE`, which set the `status` property to the string `online`. Try to use `Object.assign()` to complete the challenge.
+
+# --hints--
+
+The Redux store should exist and initialize with a state that is equivalent to the `defaultState` object declared on line 1.
+
+```js
+assert(
+  (function () {
+    const expectedState = {
+      user: 'CamperBot',
+      status: 'offline',
+      friends: '732,982',
+      community: 'freeCodeCamp'
+    };
+    const initialState = store.getState();
+    return DeepEqual(expectedState, initialState);
+  })()
+);
+```
+
+`wakeUp` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof wakeUp === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ONLINE` should update the property `status` in state to `online` and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch({ type: 'ONLINE' });
+    const finalState = store.getState();
+    const expectedState = {
+      user: 'CamperBot',
+      status: 'online',
+      friends: '732,982',
+      community: 'freeCodeCamp'
+    };
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+`Object.assign` should be used to return new state.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('Object.assign'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  user: 'CamperBot',
+  status: 'offline',
+  friends: '732,982',
+  community: 'freeCodeCamp'
+};
+
+const immutableReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case 'ONLINE':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const wakeUp = () => {
+  return {
+    type: 'ONLINE'
+  }
+};
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  user: 'CamperBot',
+  status: 'offline',
+  friends: '732,982',
+  community: 'freeCodeCamp'
+};
+
+const immutableReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case 'ONLINE':
+      return Object.assign({}, state, {
+        status: 'online'
+      });
+    default:
+      return state;
+  }
+};
+
+const wakeUp = () => {
+  return {
+    type: 'ONLINE'
+  }
+};
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/create-a-redux-store.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/create-a-redux-store.md
new file mode 100644
index 0000000000..4eb9227a82
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/create-a-redux-store.md
@@ -0,0 +1,61 @@
+---
+id: 5a24c314108439a4d403614b
+title: Create a Redux Store
+challengeType: 6
+forumTopicId: 301439
+dashedName: create-a-redux-store
+---
+
+# --description--
+
+Redux is a state management framework that can be used with a number of different web technologies, including React.
+
+In Redux, there is a single state object that's responsible for the entire state of your application. This means if you had a React app with ten components, and each component had its own local state, the entire state of your app would be defined by a single state object housed in the Redux `store`. This is the first important principle to understand when learning Redux: the Redux store is the single source of truth when it comes to application state.
+
+This also means that any time any piece of your app wants to update state, it **must** do so through the Redux store. The unidirectional data flow makes it easier to track state management in your app.
+
+# --instructions--
+
+The Redux `store` is an object which holds and manages application `state`. There is a method called `createStore()` on the Redux object, which you use to create the Redux `store`. This method takes a `reducer` function as a required argument. The `reducer` function is covered in a later challenge, and is already defined for you in the code editor. It simply takes `state` as an argument and returns `state`.
+
+Declare a `store` variable and assign it to the `createStore()` method, passing in the `reducer` as an argument.
+
+**Note:** The code in the editor uses ES6 default argument syntax to initialize this state to hold a value of `5`. If you're not familiar with default arguments, you can refer to the [ES6 section in the Curriculum](https://learn.freecodecamp.org/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions) which covers this topic.
+
+# --hints--
+
+The Redux store should exist.
+
+```js
+assert(typeof store.getState === 'function');
+```
+
+The Redux store should have a value of 5 for the state.
+
+```js
+assert(store.getState() === 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const reducer = (state = 5) => {
+  return state;
+}
+
+// Redux methods are available from a Redux object
+// For example: Redux.createStore()
+// Define the store here:
+```
+
+# --solutions--
+
+```js
+const reducer = (state = 5) => {
+  return state;
+}
+
+const store = Redux.createStore(reducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-a-redux-action.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-a-redux-action.md
new file mode 100644
index 0000000000..31f49e2e33
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-a-redux-action.md
@@ -0,0 +1,55 @@
+---
+id: 5a24c314108439a4d403614d
+title: Define a Redux Action
+challengeType: 6
+forumTopicId: 301440
+dashedName: define-a-redux-action
+---
+
+# --description--
+
+Since Redux is a state management framework, updating state is one of its core tasks. In Redux, all state updates are triggered by dispatching actions. An action is simply a JavaScript object that contains information about an action event that has occurred. The Redux store receives these action objects, then updates its state accordingly. Sometimes a Redux action also carries some data. For example, the action carries a username after a user logs in. While the data is optional, actions must carry a `type` property that specifies the 'type' of action that occurred.
+
+Think of Redux actions as messengers that deliver information about events happening in your app to the Redux store. The store then conducts the business of updating state based on the action that occurred.
+
+# --instructions--
+
+Writing a Redux action is as simple as declaring an object with a type property. Declare an object `action` and give it a property `type` set to the string `'LOGIN'`.
+
+# --hints--
+
+An `action` object should exist.
+
+```js
+assert(
+  (function () {
+    return typeof action === 'object';
+  })()
+);
+```
+
+The `action` object should have a key property `type` with value `LOGIN`.
+
+```js
+assert(
+  (function () {
+    return action.type === 'LOGIN';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+// Define an action here:
+```
+
+# --solutions--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-an-action-creator.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-an-action-creator.md
new file mode 100644
index 0000000000..656723c9e1
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/define-an-action-creator.md
@@ -0,0 +1,57 @@
+---
+id: 5a24c314108439a4d403614e
+title: Define an Action Creator
+challengeType: 6
+forumTopicId: 301441
+dashedName: define-an-action-creator
+---
+
+# --description--
+
+After creating an action, the next step is sending the action to the Redux store so it can update its state. In Redux, you define action creators to accomplish this. An action creator is simply a JavaScript function that returns an action. In other words, action creators create objects that represent action events.
+
+# --instructions--
+
+Define a function named `actionCreator()` that returns the `action` object when called.
+
+# --hints--
+
+The function `actionCreator` should exist.
+
+```js
+assert(typeof actionCreator === 'function');
+```
+
+Running the `actionCreator` function should return the `action` object.
+
+```js
+assert(typeof action === 'object');
+```
+
+The returned `action` should have a key property `type` with value `LOGIN`.
+
+```js
+assert(action.type === 'LOGIN');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+// Define an action creator here:
+```
+
+# --solutions--
+
+```js
+const action = {
+  type: 'LOGIN'
+}
+const actionCreator = () => {
+  return action;
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/dispatch-an-action-event.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/dispatch-an-action-event.md
new file mode 100644
index 0000000000..46bfbbb12e
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/dispatch-an-action-event.md
@@ -0,0 +1,85 @@
+---
+id: 5a24c314108439a4d403614f
+title: Dispatch an Action Event
+challengeType: 6
+forumTopicId: 301442
+dashedName: dispatch-an-action-event
+---
+
+# --description--
+
+`dispatch` method is what you use to dispatch actions to the Redux store. Calling `store.dispatch()` and passing the value returned from an action creator sends an action back to the store.
+
+Recall that action creators return an object with a type property that specifies the action that has occurred. Then the method dispatches an action object to the Redux store. Based on the previous challenge's example, the following lines are equivalent, and both dispatch the action of type `LOGIN`:
+
+```js
+store.dispatch(actionCreator());
+store.dispatch({ type: 'LOGIN' });
+```
+
+# --instructions--
+
+The Redux store in the code editor has an initialized state that's an object containing a `login` property currently set to `false`. There's also an action creator called `loginAction()` which returns an action of type `LOGIN`. Dispatch the `LOGIN` action to the Redux store by calling the `dispatch` method, and pass in the action created by `loginAction()`.
+
+# --hints--
+
+Calling the function `loginAction` should return an object with `type` property set to the string `LOGIN`.
+
+```js
+assert(loginAction().type === 'LOGIN');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().login === false);
+```
+
+The `store.dispatch()` method should be used to dispatch an action of type `LOGIN`.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      let noWhiteSpace = getUserInput('index').replace(/\s/g, '');
+      return (
+        noWhiteSpace.includes('store.dispatch(loginAction())') ||
+        noWhiteSpace.includes("store.dispatch({type: 'LOGIN'})") === true
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const store = Redux.createStore(
+  (state = {login: false}) => state
+);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+// Dispatch the action here:
+```
+
+# --solutions--
+
+```js
+const store = Redux.createStore(
+  (state = {login: false}) => state
+);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+store.dispatch(loginAction());
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/get-state-from-the-redux-store.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/get-state-from-the-redux-store.md
new file mode 100644
index 0000000000..7c348ad330
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/get-state-from-the-redux-store.md
@@ -0,0 +1,55 @@
+---
+id: 5a24c314108439a4d403614c
+title: Get State from the Redux Store
+challengeType: 6
+forumTopicId: 301443
+dashedName: get-state-from-the-redux-store
+---
+
+# --description--
+
+The Redux store object provides several methods that allow you to interact with it. For example, you can retrieve the current `state` held in the Redux store object with the `getState()` method.
+
+# --instructions--
+
+The code from the previous challenge is re-written more concisely in the code editor. Use `store.getState()` to retrieve the `state` from the `store`, and assign this to a new variable `currentState`.
+
+# --hints--
+
+The Redux store should have a value of 5 for the initial state.
+
+```js
+assert(store.getState() === 5);
+```
+
+A variable `currentState` should exist and should be assigned the current state of the Redux store.
+
+```js
+(getUserInput) =>
+  assert(
+    currentState === 5 && getUserInput('index').includes('store.getState()')
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const store = Redux.createStore(
+  (state = 5) => state
+);
+
+// Change code below this line
+```
+
+# --solutions--
+
+```js
+const store = Redux.createStore(
+  (state = 5) => state
+);
+
+// Change code below this line
+const currentState = store.getState();
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/handle-an-action-in-the-store.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/handle-an-action-in-the-store.md
new file mode 100644
index 0000000000..d33750b9c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/handle-an-action-in-the-store.md
@@ -0,0 +1,108 @@
+---
+id: 5a24c314108439a4d4036150
+title: Handle an Action in the Store
+challengeType: 6
+forumTopicId: 301444
+dashedName: handle-an-action-in-the-store
+---
+
+# --description--
+
+After an action is created and dispatched, the Redux store needs to know how to respond to that action. This is the job of a `reducer` function. Reducers in Redux are responsible for the state modifications that take place in response to actions. A `reducer` takes `state` and `action` as arguments, and it always returns a new `state`. It is important to see that this is the **only** role of the reducer. It has no side effects — it never calls an API endpoint and it never has any hidden surprises. The reducer is simply a pure function that takes state and action, then returns new state.
+
+Another key principle in Redux is that `state` is read-only. In other words, the `reducer` function must **always** return a new copy of `state` and never modify state directly. Redux does not enforce state immutability, however, you are responsible for enforcing it in the code of your reducer functions. You'll practice this in later challenges.
+
+# --instructions--
+
+The code editor has the previous example as well as the start of a `reducer` function for you. Fill in the body of the `reducer` function so that if it receives an action of type `'LOGIN'` it returns a state object with `login` set to `true`. Otherwise, it returns the current `state`. Note that the current `state` and the dispatched `action` are passed to the reducer, so you can access the action's type directly with `action.type`.
+
+# --hints--
+
+Calling the function `loginAction` should return an object with type property set to the string `LOGIN`.
+
+```js
+assert(loginAction().type === 'LOGIN');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().login === false);
+```
+
+Dispatching `loginAction` should update the `login` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginAction());
+    const afterState = store.getState();
+    return initialState.login === false && afterState.login === true;
+  })()
+);
+```
+
+If the action is not of type `LOGIN`, the store should return the current state.
+
+```js
+assert(
+  (function () {
+    store.dispatch({ type: '__TEST__ACTION__' });
+    let afterTest = store.getState();
+    return typeof afterTest === 'object' && afterTest.hasOwnProperty('login');
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  login: false
+};
+
+const reducer = (state = defaultState, action) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(reducer);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  login: false
+};
+
+const reducer = (state = defaultState, action) => {
+
+  if (action.type === 'LOGIN') {
+    return {login: true}
+  }
+
+  else {
+    return state
+  }
+
+};
+
+const store = Redux.createStore(reducer);
+
+const loginAction = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/never-mutate-state.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/never-mutate-state.md
new file mode 100644
index 0000000000..002a7c4da2
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/never-mutate-state.md
@@ -0,0 +1,133 @@
+---
+id: 5a24c314108439a4d4036158
+title: Never Mutate State
+challengeType: 6
+forumTopicId: 301445
+dashedName: never-mutate-state
+---
+
+# --description--
+
+These final challenges describe several methods of enforcing the key principle of state immutability in Redux. Immutable state means that you never modify state directly, instead, you return a new copy of state.
+
+If you took a snapshot of the state of a Redux app over time, you would see something like `state 1`, `state 2`, `state 3`,`state 4`, `...` and so on where each state may be similar to the last, but each is a distinct piece of data. This immutability, in fact, is what provides such features as time-travel debugging that you may have heard about.
+
+Redux does not actively enforce state immutability in its store or reducers, that responsibility falls on the programmer. Fortunately, JavaScript (especially ES6) provides several useful tools you can use to enforce the immutability of your state, whether it is a `string`, `number`, `array`, or `object`. Note that strings and numbers are primitive values and are immutable by nature. In other words, 3 is always 3. You cannot change the value of the number 3. An `array` or `object`, however, is mutable. In practice, your state will probably consist of an `array` or `object`, as these are useful data structures for representing many types of information.
+
+# --instructions--
+
+There is a `store` and `reducer` in the code editor for managing to-do items. Finish writing the `ADD_TO_DO` case in the reducer to append a new to-do to the state. There are a few ways to accomplish this with standard JavaScript or ES6. See if you can find a way to return a new array with the item from `action.todo` appended to the end.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to the `todos` array in the code editor.
+
+```js
+assert(
+  (function () {
+    const todos = [
+      'Go to the store',
+      'Clean the house',
+      'Cook dinner',
+      'Learn to code'
+    ];
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) && initialState.join(',') === todos.join(',')
+    );
+  })()
+);
+```
+
+`addToDo` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof addToDo === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ADD_TO_DO` on the Redux store should add a `todo` item and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addToDo('__TEST__TO__DO__'));
+    const finalState = store.getState();
+    const expectedState = [
+      'Go to the store',
+      'Clean the house',
+      'Cook dinner',
+      'Learn to code',
+      '__TEST__TO__DO__'
+    ];
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const ADD_TO_DO = 'ADD_TO_DO';
+
+// A list of strings representing tasks to do:
+const todos = [
+  'Go to the store',
+  'Clean the house',
+  'Cook dinner',
+  'Learn to code',
+];
+
+const immutableReducer = (state = todos, action) => {
+  switch(action.type) {
+    case ADD_TO_DO:
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: ADD_TO_DO,
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const ADD_TO_DO = 'ADD_TO_DO';
+
+const todos = [
+  'Go to the store',
+  'Clean the house',
+  'Cook dinner',
+  'Learn to code',
+];
+
+const immutableReducer = (state = todos, action) => {
+  switch(action.type) {
+    case ADD_TO_DO:
+      return state.concat(action.todo);
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: ADD_TO_DO,
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/register-a-store-listener.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/register-a-store-listener.md
new file mode 100644
index 0000000000..d3d43ced41
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/register-a-store-listener.md
@@ -0,0 +1,118 @@
+---
+id: 5a24c314108439a4d4036153
+title: Register a Store Listener
+challengeType: 6
+forumTopicId: 301446
+dashedName: register-a-store-listener
+---
+
+# --description--
+
+Another method you have access to on the Redux `store` object is `store.subscribe()`. This allows you to subscribe listener functions to the store, which are called whenever an action is dispatched against the store. One simple use for this method is to subscribe a function to your store that simply logs a message every time an action is received and the store is updated.
+
+# --instructions--
+
+Write a callback function that increments the global variable `count` every time the store receives an action, and pass this function in to the `store.subscribe()` method. You'll see that `store.dispatch()` is called three times in a row, each time directly passing in an action object. Watch the console output between the action dispatches to see the updates take place.
+
+# --hints--
+
+Dispatching the `ADD` action on the store should increment the state by `1`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch({ type: 'ADD' });
+    const newState = store.getState();
+    return newState === initialState + 1;
+  })()
+);
+```
+
+There should be a listener function subscribed to the store using `store.subscribe`.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/store\s*\.\s*subscribe\(/gm));
+```
+
+The `store.subscribe` should receive a function.
+
+```js
+(getUserInput) => assert(getUserInput('index').match(/(\s*function\s*)|(\s*\(\s*\)\s*=>)/gm)) 
+```
+
+The callback to `store.subscribe` should also increment the global `count` variable as the store is updated.
+
+```js
+assert(store.getState() === count);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+count = 0;
+```
+
+## --seed-contents--
+
+```js
+const ADD = 'ADD';
+
+const reducer = (state = 0, action) => {
+  switch(action.type) {
+    case ADD:
+      return state + 1;
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(reducer);
+
+// Global count variable:
+let count = 0;
+
+// Change code below this line
+
+// Change code above this line
+
+store.dispatch({type: ADD});
+console.log(count);
+store.dispatch({type: ADD});
+console.log(count);
+store.dispatch({type: ADD});
+console.log(count);
+```
+
+# --solutions--
+
+```js
+const ADD = 'ADD';
+
+const reducer = (state = 0, action) => {
+  switch(action.type) {
+    case ADD:
+      return state + 1;
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(reducer);
+ let count = 0;
+// Change code below this line
+
+store.subscribe( () =>
+ {
+ count++;
+ }
+);
+
+// Change code above this line
+
+store.dispatch({type: ADD});
+store.dispatch({type: ADD});
+store.dispatch({type: ADD});
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/remove-an-item-from-an-array.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/remove-an-item-from-an-array.md
new file mode 100644
index 0000000000..16bd461669
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/remove-an-item-from-an-array.md
@@ -0,0 +1,114 @@
+---
+id: 5a24c314108439a4d403615a
+title: Remove an Item from an Array
+challengeType: 6
+forumTopicId: 301447
+dashedName: remove-an-item-from-an-array
+---
+
+# --description--
+
+Time to practice removing items from an array. The spread operator can be used here as well. Other useful JavaScript methods include `slice()` and `concat()`.
+
+# --instructions--
+
+The reducer and action creator were modified to remove an item from an array based on the index of the item. Finish writing the reducer so a new state array is returned with the item at the specific index removed.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to `[0,1,2,3,4,5]`
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) === true &&
+      DeepEqual(initialState, [0, 1, 2, 3, 4, 5])
+    );
+  })()
+);
+```
+
+`removeItem` and `immutableReducer` both should be functions.
+
+```js
+assert(
+  typeof removeItem === 'function' && typeof immutableReducer === 'function'
+);
+```
+
+Dispatching the `removeItem` action creator should remove items from the state and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(removeItem(3));
+    const state_1 = store.getState();
+    store.dispatch(removeItem(2));
+    const state_2 = store.getState();
+    store.dispatch(removeItem(0));
+    store.dispatch(removeItem(0));
+    store.dispatch(removeItem(0));
+    const state_3 = store.getState();
+    return (
+      isFrozen &&
+      DeepEqual(state_1, [0, 1, 2, 4, 5]) &&
+      DeepEqual(state_2, [0, 1, 4, 5]) &&
+      DeepEqual(state_3, [5])
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const immutableReducer = (state = [0,1,2,3,4,5], action) => {
+  switch(action.type) {
+    case 'REMOVE_ITEM':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const removeItem = (index) => {
+  return {
+    type: 'REMOVE_ITEM',
+    index
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const immutableReducer = (state = [0,1,2,3,4,5], action) => {
+  switch(action.type) {
+    case 'REMOVE_ITEM':
+      return [
+        ...state.slice(0, action.index),
+        ...state.slice(action.index + 1)
+      ];
+    default:
+      return state;
+  }
+};
+
+const removeItem = (index) => {
+  return {
+    type: 'REMOVE_ITEM',
+    index
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/send-action-data-to-the-store.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/send-action-data-to-the-store.md
new file mode 100644
index 0000000000..ccfda74b7a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/send-action-data-to-the-store.md
@@ -0,0 +1,107 @@
+---
+id: 5a24c314108439a4d4036155
+title: Send Action Data to the Store
+challengeType: 6
+forumTopicId: 301448
+dashedName: send-action-data-to-the-store
+---
+
+# --description--
+
+By now you've learned how to dispatch actions to the Redux store, but so far these actions have not contained any information other than a `type`. You can also send specific data along with your actions. In fact, this is very common because actions usually originate from some user interaction and tend to carry some data with them. The Redux store often needs to know about this data.
+
+# --instructions--
+
+There's a basic `notesReducer()` and an `addNoteText()` action creator defined in the code editor. Finish the body of the `addNoteText()` function so that it returns an `action` object. The object should include a `type` property with a value of `ADD_NOTE`, and also a `text` property set to the `note` data that's passed into the action creator. When you call the action creator, you'll pass in specific note information that you can access for the object.
+
+Next, finish writing the `switch` statement in the `notesReducer()`. You need to add a case that handles the `addNoteText()` actions. This case should be triggered whenever there is an action of type `ADD_NOTE` and it should return the `text` property on the incoming `action` as the new `state`.
+
+The action is dispatched at the bottom of the code. Once you're finished, run the code and watch the console. That's all it takes to send action-specific data to the store and use it when you update store `state`.
+
+# --hints--
+
+The action creator `addNoteText` should return an object with keys `type` and `text`.
+
+```js
+assert(
+  (function () {
+    const addNoteFn = addNoteText('__TEST__NOTE');
+    return addNoteFn.type === ADD_NOTE && addNoteFn.text === '__TEST__NOTE';
+  })()
+);
+```
+
+Dispatching an action of type `ADD_NOTE` with the `addNoteText` action creator should update the `state` to the string passed to the action creator.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(addNoteText('__TEST__NOTE'));
+    const newState = store.getState();
+    return initialState !== newState && newState === '__TEST__NOTE';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const ADD_NOTE = 'ADD_NOTE';
+
+const notesReducer = (state = 'Initial State', action) => {
+  switch(action.type) {
+    // Change code below this line
+
+    // Change code above this line
+    default:
+      return state;
+  }
+};
+
+const addNoteText = (note) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(notesReducer);
+
+console.log(store.getState());
+store.dispatch(addNoteText('Hello!'));
+console.log(store.getState());
+```
+
+# --solutions--
+
+```js
+const ADD_NOTE = 'ADD_NOTE';
+
+const notesReducer = (state = 'Initial State', action) => {
+  switch(action.type) {
+    // Change code below this line
+    case ADD_NOTE:
+      return action.text;
+    // Change code above this line
+    default:
+      return state;
+  }
+};
+
+const addNoteText = (note) => {
+  // Change code below this line
+  return {
+    type: ADD_NOTE,
+    text: note
+  }
+  // Change code above this line
+};
+
+const store = Redux.createStore(notesReducer);
+
+console.log(store.getState());
+store.dispatch(addNoteText('Hello Redux!'));
+console.log(store.getState());
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
new file mode 100644
index 0000000000..604bc416f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-a-switch-statement-to-handle-multiple-actions.md
@@ -0,0 +1,152 @@
+---
+id: 5a24c314108439a4d4036151
+title: Use a Switch Statement to Handle Multiple Actions
+challengeType: 6
+forumTopicId: 301449
+dashedName: use-a-switch-statement-to-handle-multiple-actions
+---
+
+# --description--
+
+You can tell the Redux store how to handle multiple action types. Say you are managing user authentication in your Redux store. You want to have a state representation for when users are logged in and when they are logged out. You represent this with a single state object with the property `authenticated`. You also need action creators that create actions corresponding to user login and user logout, along with the action objects themselves.
+
+# --instructions--
+
+The code editor has a store, actions, and action creators set up for you. Fill in the `reducer` function to handle multiple authentication actions. Use a JavaScript `switch` statement in the `reducer` to respond to different action events. This is a standard pattern in writing Redux reducers. The switch statement should switch over `action.type` and return the appropriate authentication state.
+
+**Note:** At this point, don't worry about state immutability, since it is small and simple in this example. For each action, you can return a new object — for example, `{authenticated: true}`. Also, don't forget to write a `default` case in your switch statement that returns the current `state`. This is important because once your app has multiple reducers, they are all run any time an action dispatch is made, even when the action isn't related to that reducer. In such a case, you want to make sure that you return the current `state`.
+
+# --hints--
+
+Calling the function `loginUser` should return an object with type property set to the string `LOGIN`.
+
+```js
+assert(loginUser().type === 'LOGIN');
+```
+
+Calling the function `logoutUser` should return an object with type property set to the string `LOGOUT`.
+
+```js
+assert(logoutUser().type === 'LOGOUT');
+```
+
+The store should be initialized with an object with an `authenticated` property set to `false`.
+
+```js
+assert(store.getState().authenticated === false);
+```
+
+Dispatching `loginUser` should update the `authenticated` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginUser());
+    const afterLogin = store.getState();
+    return (
+      initialState.authenticated === false && afterLogin.authenticated === true
+    );
+  })()
+);
+```
+
+Dispatching `logoutUser` should update the `authenticated` property in the store state to `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch(loginUser());
+    const loggedIn = store.getState();
+    store.dispatch(logoutUser());
+    const afterLogout = store.getState();
+    return (
+      loggedIn.authenticated === true && afterLogout.authenticated === false
+    );
+  })()
+);
+```
+
+The `authReducer` function should handle multiple action types with a `switch` statement.
+
+```js
+(getUserInput) =>
+  assert(
+    getUserInput('index').toString().includes('switch') &&
+      getUserInput('index').toString().includes('case') &&
+      getUserInput('index').toString().includes('default')
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+  // Change code below this line
+
+  // Change code above this line
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+
+    case 'LOGIN':
+      return {
+        authenticated: true
+      }
+
+    case 'LOGOUT':
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-const-for-action-types.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-const-for-action-types.md
new file mode 100644
index 0000000000..5893acce88
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-const-for-action-types.md
@@ -0,0 +1,204 @@
+---
+id: 5a24c314108439a4d4036152
+title: Use const for Action Types
+challengeType: 6
+forumTopicId: 301450
+dashedName: use-const-for-action-types
+---
+
+# --description--
+
+A common practice when working with Redux is to assign action types as read-only constants, then reference these constants wherever they are used. You can refactor the code you're working with to write the action types as `const` declarations.
+
+# --instructions--
+
+Declare `LOGIN` and `LOGOUT` as `const` values and assign them to the strings `'LOGIN'` and `'LOGOUT'`, respectively. Then, edit the `authReducer()` and the action creators to reference these constants instead of string values.
+
+**Note:** It's generally a convention to write constants in all uppercase, and this is standard practice in Redux as well.
+
+# --hints--
+
+Calling the function `loginUser` should return an object with `type` property set to the string `LOGIN`.
+
+```js
+assert(loginUser().type === 'LOGIN');
+```
+
+Calling the function `logoutUser` should return an object with `type` property set to the string `LOGOUT`.
+
+```js
+assert(logoutUser().type === 'LOGOUT');
+```
+
+The store should be initialized with an object with property `login` set to `false`.
+
+```js
+assert(store.getState().authenticated === false);
+```
+
+Dispatching `loginUser` should update the `login` property in the store state to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(loginUser());
+    const afterLogin = store.getState();
+    return (
+      initialState.authenticated === false && afterLogin.authenticated === true
+    );
+  })()
+);
+```
+
+Dispatching `logoutUser` should update the `login` property in the store state to `false`.
+
+```js
+assert(
+  (function () {
+    store.dispatch(loginUser());
+    const loggedIn = store.getState();
+    store.dispatch(logoutUser());
+    const afterLogout = store.getState();
+    return (
+      loggedIn.authenticated === true && afterLogout.authenticated === false
+    );
+  })()
+);
+```
+
+The `authReducer` function should handle multiple action types with a switch statement.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      return (
+        typeof authReducer === 'function' &&
+        getUserInput('index').toString().includes('switch') &&
+        getUserInput('index').toString().includes('case') &&
+        getUserInput('index').toString().includes('default')
+      );
+    })()
+  );
+```
+
+`LOGIN` and `LOGOUT` should be declared as `const` values and should be assigned strings of `LOGIN`and `LOGOUT`.
+
+```js
+const noWhiteSpace = __helpers.removeWhiteSpace(code);
+assert(
+  /constLOGIN=(['"`])LOGIN\1/.test(noWhiteSpace) &&
+    /constLOGOUT=(['"`])LOGOUT\1/.test(noWhiteSpace)
+);
+```
+
+The action creators and the reducer should reference the `LOGIN` and `LOGOUT` constants.
+
+```js
+(getUserInput) =>
+  assert(
+    (function () {
+      const noWhiteSpace = __helpers.removeWhiteSpace(
+        getUserInput('index').toString()
+      );
+      return (
+        noWhiteSpace.includes('caseLOGIN:') &&
+        noWhiteSpace.includes('caseLOGOUT:') &&
+        noWhiteSpace.includes('type:LOGIN') &&
+        noWhiteSpace.includes('type:LOGOUT')
+      );
+    })()
+  );
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+    case 'LOGIN': 
+      return {
+        authenticated: true
+      }
+    case 'LOGOUT': 
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: 'LOGIN'
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: 'LOGOUT'
+  }
+};
+```
+
+# --solutions--
+
+```js
+const LOGIN = 'LOGIN';
+const LOGOUT = 'LOGOUT';
+
+const defaultState = {
+  authenticated: false
+};
+
+const authReducer = (state = defaultState, action) => {
+
+  switch (action.type) {
+
+    case LOGIN:
+      return {
+        authenticated: true
+      }
+
+    case LOGOUT:
+      return {
+        authenticated: false
+      }
+
+    default:
+      return state;
+
+  }
+
+};
+
+const store = Redux.createStore(authReducer);
+
+const loginUser = () => {
+  return {
+    type: LOGIN
+  }
+};
+
+const logoutUser = () => {
+  return {
+    type: LOGOUT
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
new file mode 100644
index 0000000000..9839855204
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-middleware-to-handle-asynchronous-actions.md
@@ -0,0 +1,170 @@
+---
+id: 5a24c314108439a4d4036156
+title: Use Middleware to Handle Asynchronous Actions
+challengeType: 6
+forumTopicId: 301451
+dashedName: use-middleware-to-handle-asynchronous-actions
+---
+
+# --description--
+
+So far these challenges have avoided discussing asynchronous actions, but they are an unavoidable part of web development. At some point you'll need to call asynchronous endpoints in your Redux app, so how do you handle these types of requests? Redux provides middleware designed specifically for this purpose, called Redux Thunk middleware. Here's a brief description how to use this with Redux.
+
+To include Redux Thunk middleware, you pass it as an argument to `Redux.applyMiddleware()`. This statement is then provided as a second optional parameter to the `createStore()` function. Take a look at the code at the bottom of the editor to see this. Then, to create an asynchronous action, you return a function in the action creator that takes `dispatch` as an argument. Within this function, you can dispatch actions and perform asynchronous requests.
+
+In this example, an asynchronous request is simulated with a `setTimeout()` call. It's common to dispatch an action before initiating any asynchronous behavior so that your application state knows that some data is being requested (this state could display a loading icon, for instance). Then, once you receive the data, you dispatch another action which carries the data as a payload along with information that the action is completed.
+
+Remember that you're passing `dispatch` as a parameter to this special action creator. This is what you'll use to dispatch your actions, you simply pass the action directly to dispatch and the middleware takes care of the rest.
+
+# --instructions--
+
+Write both dispatches in the `handleAsync()` action creator. Dispatch `requestingData()` before the `setTimeout()` (the simulated API call). Then, after you receive the (pretend) data, dispatch the `receivedData()` action, passing in this data. Now you know how to handle asynchronous actions in Redux. Everything else continues to behave as before.
+
+# --hints--
+
+The `requestingData` action creator should return an object of type equal to the value of `REQUESTING_DATA`.
+
+```js
+assert(requestingData().type === REQUESTING_DATA);
+```
+
+The `receivedData` action creator should return an object of type equal to the value of `RECEIVED_DATA`.
+
+```js
+assert(receivedData('data').type === RECEIVED_DATA);
+```
+
+`asyncDataReducer` should be a function.
+
+```js
+assert(typeof asyncDataReducer === 'function');
+```
+
+Dispatching the `requestingData` action creator should update the store `state` property of fetching to `true`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(requestingData());
+    const reqState = store.getState();
+    return initialState.fetching === false && reqState.fetching === true;
+  })()
+);
+```
+
+Dispatching `handleAsync` should dispatch the data request action and then dispatch the received data action after a delay.
+
+```js
+assert(
+  (function () {
+    const noWhiteSpace = __helpers.removeWhiteSpace(handleAsync.toString());
+    return (
+      noWhiteSpace.includes('dispatch(requestingData())') === true &&
+      noWhiteSpace.includes('dispatch(receivedData(data))') === true
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const REQUESTING_DATA = 'REQUESTING_DATA'
+const RECEIVED_DATA = 'RECEIVED_DATA'
+
+const requestingData = () => { return {type: REQUESTING_DATA} }
+const receivedData = (data) => { return {type: RECEIVED_DATA, users: data.users} }
+
+const handleAsync = () => {
+  return function(dispatch) {
+    // Dispatch request action here
+
+    setTimeout(function() {
+      let data = {
+        users: ['Jeff', 'William', 'Alice']
+      }
+      // Dispatch received data action here
+
+    }, 2500);
+  }
+};
+
+const defaultState = {
+  fetching: false,
+  users: []
+};
+
+const asyncDataReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case REQUESTING_DATA:
+      return {
+        fetching: true,
+        users: []
+      }
+    case RECEIVED_DATA:
+      return {
+        fetching: false,
+        users: action.users
+      }
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(
+  asyncDataReducer,
+  Redux.applyMiddleware(ReduxThunk.default)
+);
+```
+
+# --solutions--
+
+```js
+const REQUESTING_DATA = 'REQUESTING_DATA'
+const RECEIVED_DATA = 'RECEIVED_DATA'
+
+const requestingData = () => { return {type: REQUESTING_DATA} }
+const receivedData = (data) => { return {type: RECEIVED_DATA, users: data.users} }
+
+const handleAsync = () => {
+  return function(dispatch) {
+    dispatch(requestingData());
+    setTimeout(function() {
+      let data = {
+        users: ['Jeff', 'William', 'Alice']
+      }
+      dispatch(receivedData(data));
+    }, 2500);
+  }
+};
+
+const defaultState = {
+  fetching: false,
+  users: []
+};
+
+const asyncDataReducer = (state = defaultState, action) => {
+  switch(action.type) {
+    case REQUESTING_DATA:
+      return {
+        fetching: true,
+        users: []
+      }
+    case RECEIVED_DATA:
+      return {
+        fetching: false,
+        users: action.users
+      }
+    default:
+      return state;
+  }
+};
+
+const store = Redux.createStore(
+  asyncDataReducer,
+  Redux.applyMiddleware(ReduxThunk.default)
+);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
new file mode 100644
index 0000000000..68e6f320ac
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/use-the-spread-operator-on-arrays.md
@@ -0,0 +1,114 @@
+---
+id: 5a24c314108439a4d4036159
+title: Use the Spread Operator on Arrays
+challengeType: 6
+forumTopicId: 301452
+dashedName: use-the-spread-operator-on-arrays
+---
+
+# --description--
+
+One solution from ES6 to help enforce state immutability in Redux is the spread operator: `...`. The spread operator has a variety of applications, one of which is well-suited to the previous challenge of producing a new array from an existing array. This is relatively new, but commonly used syntax. For example, if you have an array `myArray` and write:
+
+```js
+let newArray = [...myArray];
+```
+
+`newArray` is now a clone of `myArray`. Both arrays still exist separately in memory. If you perform a mutation like `newArray.push(5)`, `myArray` doesn't change. The `...` effectively *spreads* out the values in `myArray` into a new array. To clone an array but add additional values in the new array, you could write `[...myArray, 'new value']`. This would return a new array composed of the values in `myArray` and the string `new value` as the last value. The spread syntax can be used multiple times in array composition like this, but it's important to note that it only makes a shallow copy of the array. That is to say, it only provides immutable array operations for one-dimensional arrays.
+
+# --instructions--
+
+Use the spread operator to return a new copy of state when a to-do is added.
+
+# --hints--
+
+The Redux store should exist and initialize with a state equal to `["Do not mutate state!"]`.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    return (
+      Array.isArray(initialState) === true &&
+      initialState[0] === 'Do not mutate state!'
+    );
+  })()
+);
+```
+
+`addToDo` and `immutableReducer` both should be functions.
+
+```js
+assert(typeof addToDo === 'function' && typeof immutableReducer === 'function');
+```
+
+Dispatching an action of type `ADD_TO_DO` on the Redux store should add a `todo` item and should NOT mutate state.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    const isFrozen = DeepFreeze(initialState);
+    store.dispatch(addToDo('__TEST__TO__DO__'));
+    const finalState = store.getState();
+    const expectedState = ['Do not mutate state!', '__TEST__TO__DO__'];
+    return isFrozen && DeepEqual(finalState, expectedState);
+  })()
+);
+```
+
+The spread operator should be used to return new state.
+
+```js
+(getUserInput) => assert(getUserInput('index').includes('...state'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const immutableReducer = (state = ['Do not mutate state!'], action) => {
+  switch(action.type) {
+    case 'ADD_TO_DO':
+      // Don't mutate state here or the tests will fail
+      return
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: 'ADD_TO_DO',
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
+
+# --solutions--
+
+```js
+const immutableReducer = (state = ['Do not mutate state!'], action) => {
+  switch(action.type) {
+    case 'ADD_TO_DO':
+      return [
+        ...state,
+        action.todo
+      ];
+    default:
+      return state;
+  }
+};
+
+const addToDo = (todo) => {
+  return {
+    type: 'ADD_TO_DO',
+    todo
+  }
+}
+
+const store = Redux.createStore(immutableReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/redux/write-a-counter-with-redux.md b/curriculum/challenges/portuguese/03-front-end-libraries/redux/write-a-counter-with-redux.md
new file mode 100644
index 0000000000..9bf25454c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/redux/write-a-counter-with-redux.md
@@ -0,0 +1,116 @@
+---
+id: 5a24c314108439a4d4036157
+title: Write a Counter with Redux
+challengeType: 6
+forumTopicId: 301453
+dashedName: write-a-counter-with-redux
+---
+
+# --description--
+
+Now you've learned all the core principles of Redux! You've seen how to create actions and action creators, create a Redux store, dispatch your actions against the store, and design state updates with pure reducers. You've even seen how to manage complex state with reducer composition and handle asynchronous actions. These examples are simplistic, but these concepts are the core principles of Redux. If you understand them well, you're ready to start building your own Redux app. The next challenges cover some of the details regarding `state` immutability, but first, here's a review of everything you've learned so far.
+
+# --instructions--
+
+In this lesson, you'll implement a simple counter with Redux from scratch. The basics are provided in the code editor, but you'll have to fill in the details! Use the names that are provided and define `incAction` and `decAction` action creators, the `counterReducer()`, `INCREMENT` and `DECREMENT` action types, and finally the Redux `store`. Once you're finished you should be able to dispatch `INCREMENT` or `DECREMENT` actions to increment or decrement the state held in the `store`. Good luck building your first Redux app!
+
+# --hints--
+
+The action creator `incAction` should return an action object with `type` equal to the value of `INCREMENT`
+
+```js
+assert(incAction().type === INCREMENT);
+```
+
+The action creator `decAction` should return an action object with `type` equal to the value of `DECREMENT`
+
+```js
+assert(decAction().type === DECREMENT);
+```
+
+The Redux store should initialize with a `state` of 0.
+
+```js
+assert(store.getState() === 0);
+```
+
+Dispatching `incAction` on the Redux store should increment the `state` by 1.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(incAction());
+    const incState = store.getState();
+    return initialState + 1 === incState;
+  })()
+);
+```
+
+Dispatching `decAction` on the Redux store should decrement the `state` by 1.
+
+```js
+assert(
+  (function () {
+    const initialState = store.getState();
+    store.dispatch(decAction());
+    const decState = store.getState();
+    return initialState - 1 === decState;
+  })()
+);
+```
+
+`counterReducer` should be a function
+
+```js
+assert(typeof counterReducer === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+const INCREMENT = null; // Define a constant for increment action types
+const DECREMENT = null; // Define a constant for decrement action types
+
+const counterReducer = null; // Define the counter reducer which will increment or decrement the state based on the action it receives
+
+const incAction = null; // Define an action creator for incrementing
+
+const decAction = null; // Define an action creator for decrementing
+
+const store = null; // Define the Redux store here, passing in your reducers
+```
+
+# --solutions--
+
+```js
+const INCREMENT = 'INCREMENT';
+const DECREMENT = 'DECREMENT';
+
+const counterReducer = (state = 0, action) => {
+  switch(action.type) {
+    case INCREMENT:
+      return state + 1;
+    case DECREMENT:
+      return state - 1;
+    default:
+      return state;
+  }
+};
+
+const incAction = () => {
+  return {
+    type: INCREMENT
+  }
+};
+
+const decAction = () => {
+  return {
+    type: DECREMENT
+  }
+};
+
+const store = Redux.createStore(counterReducer);
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
new file mode 100644
index 0000000000..0e6f582247
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/apply-a-style-until-a-condition-is-met-with-while.md
@@ -0,0 +1,117 @@
+---
+id: 587d7dbf367417b2b2512bbb
+title: Apply a Style Until a Condition is Met with @while
+challengeType: 0
+forumTopicId: 301454
+dashedName: apply-a-style-until-a-condition-is-met-with-while
+---
+
+# --description--
+
+The `@while` directive is an option with similar functionality to the JavaScript `while` loop. It creates CSS rules until a condition is met.
+
+The `@for` challenge gave an example to create a simple grid system. This can also work with `@while`.
+
+```scss
+$x: 1;
+@while $x < 13 {
+  .col-#{$x} { width: 100%/12 * $x;}
+  $x: $x + 1;
+}
+```
+
+First, define a variable `$x` and set it to 1. Next, use the `@while` directive to create the grid system *while* `$x` is less than 13. After setting the CSS rule for `width`, `$x` is incremented by 1 to avoid an infinite loop.
+
+# --instructions--
+
+Use `@while` to create a series of classes with different `font-sizes`.
+
+There should be 5 different classes from `text-1` to `text-5`. Then set `font-size` to `15px` multiplied by the current index number. Make sure to avoid an infinite loop!
+
+# --hints--
+
+Your code should use the `@while` directive.
+
+```js
+assert(code.match(/@while /g));
+```
+
+Your code should use an index variable which starts at an index of 1.
+
+```js
+assert(code.match(/\$.*:\s*?1;/gi));
+```
+
+Your code should increment the counter variable.
+
+```js
+assert(code.match(/\$(.*)\s*?:\s*\$\1\s*\+\s*1\s*;/gi));
+```
+
+Your `.text-1` class should have a `font-size` of `15px`.
+
+```js
+assert($('.text-1').css('font-size') == '15px');
+```
+
+Your `.text-2` class should have a `font-size` of `30px`.
+
+```js
+assert($('.text-2').css('font-size') == '30px');
+```
+
+Your `.text-3` class should have a `font-size` of `45px`.
+
+```js
+assert($('.text-3').css('font-size') == '45px');
+```
+
+Your `.text-4` class should have a `font-size` of `60px`.
+
+```js
+assert($('.text-4').css('font-size') == '60px');
+```
+
+Your `.text-5` class should have a `font-size` of `75px`.
+
+```js
+assert($('.text-5').css('font-size') == '75px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+</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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  $x: 1;
+  @while $x < 6 {
+    .text-#{$x}{
+      font-size: 15px * $x;
+    }
+    $x: $x + 1;
+  }
+</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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/create-reusable-css-with-mixins.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
new file mode 100644
index 0000000000..0d9d13c6f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/create-reusable-css-with-mixins.md
@@ -0,0 +1,132 @@
+---
+id: 587d7dbd367417b2b2512bb6
+title: Create Reusable CSS with Mixins
+challengeType: 0
+forumTopicId: 301455
+dashedName: create-reusable-css-with-mixins
+---
+
+# --description--
+
+In Sass, a <dfn>mixin</dfn> 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`:
+
+```scss
+div {
+  -webkit-box-shadow: 0px 0px 4px #fff;
+  -moz-box-shadow: 0px 0px 4px #fff;
+  -ms-box-shadow: 0px 0px 4px #fff;
+  box-shadow: 0px 0px 4px #fff;
+}
+```
+
+It's a lot of typing to re-write this rule for all the elements that have a `box-shadow`, or to change each value to test different effects. Mixins are like functions for CSS. Here is how to write one:
+
+```scss
+@mixin box-shadow($x, $y, $blur, $c){ 
+  -webkit-box-shadow: $x $y $blur $c;
+  -moz-box-shadow: $x $y $blur $c;
+  -ms-box-shadow: $x $y $blur $c;
+  box-shadow: $x $y $blur $c;
+}
+```
+
+The definition starts with `@mixin` followed by a custom name. The parameters (the `$x`, `$y`, `$blur`, and `$c` in the example above) are optional. Now any time a `box-shadow` rule is needed, only a single line calling the mixin replaces having to type all the vendor prefixes. A mixin is called with the `@include` directive:
+
+```scss
+div {
+  @include box-shadow(0px, 0px, 4px, #fff);
+}
+```
+
+# --instructions--
+
+Write a mixin for `border-radius` and give it a `$radius` parameter. It should use all the vendor prefixes from the example. Then use the `border-radius` mixin to give the `#awesome` element a border radius of `15px`.
+
+# --hints--
+
+Your code should declare a mixin named `border-radius` which has a parameter named `$radius`.
+
+```js
+assert(code.match(/@mixin\s+?border-radius\s*?\(\s*?\$radius\s*?\)\s*?{/gi));
+```
+
+Your code should include the `-webkit-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/-webkit-border-radius:\$radius;/gi)
+);
+```
+
+Your code should include the `-moz-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/-moz-border-radius:\$radius;/gi)
+);
+```
+
+Your code should include the `-ms-border-radius` vendor prefix that uses the `$radius` parameter.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/-ms-border-radius:\$radius;/gi));
+```
+
+Your code should include the general `border-radius` rule that uses the `$radius` parameter.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(/border-radius:\$radius;/gi).length ==
+    4
+);
+```
+
+Your code should call the `border-radius mixin` using the `@include` keyword, setting it to `15px`.
+
+```js
+assert(code.match(/@include\s+?border-radius\(\s*?15px\s*?\)\s*;/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  #awesome {
+    width: 150px;
+    height: 150px;
+    background-color: green;
+
+  }
+</style>
+
+<div id="awesome"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  @mixin border-radius($radius) {
+    -webkit-border-radius: $radius;
+    -moz-border-radius: $radius;
+    -ms-border-radius: $radius;
+    border-radius: $radius;
+  }
+
+  #awesome {
+    width: 150px;
+    height: 150px;
+    background-color: green;
+    @include border-radius(15px);
+  }
+</style>
+
+<div id="awesome"></div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
new file mode 100644
index 0000000000..c5723d66d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/extend-one-set-of-css-styles-to-another-element.md
@@ -0,0 +1,116 @@
+---
+id: 587d7fa5367417b2b2512bbd
+title: Extend One Set of CSS Styles to Another Element
+challengeType: 0
+forumTopicId: 301456
+dashedName: extend-one-set-of-css-styles-to-another-element
+---
+
+# --description--
+
+Sass has a feature called `extend` 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 `.panel` class. It has a `background-color`, `height` and `border`.
+
+```scss
+.panel{
+  background-color: red;
+  height: 70px;
+  border: 2px solid green;
+}
+```
+
+Now you want another panel called `.big-panel`. It has the same base properties as `.panel`, but also needs a `width` and `font-size`. It's possible to copy and paste the initial CSS rules from `.panel`, but the code becomes repetitive as you add more types of panels. The `extend` directive is a simple way to reuse the rules written for one element, then add more for another:
+
+```scss
+.big-panel{
+  @extend .panel;
+  width: 150px;
+  font-size: 2em;
+}
+```
+
+The `.big-panel` will have the same properties as `.panel` in addition to the new styles.
+
+# --instructions--
+
+Make a class `.info-important` that extends `.info` and also has a `background-color` set to magenta.
+
+# --hints--
+
+Your `info-important` class should have a `background-color` set to `magenta`.
+
+```js
+assert(
+  code.match(
+    /\.info-important\s*?{[\s\S]*background-color\s*?:\s*?magenta\s*?;[\s\S]*}/gi
+  )
+);
+```
+
+Your `info-important` class should use `@extend` to inherit the styling from the `info` class.
+
+```js
+assert(
+  code.match(/\.info-important\s*?{[\s\S]*@extend\s*?.info\s*?;[\s\S]*/gi)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+  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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  h3{
+    text-align: center;
+  }
+  .info{
+    width: 200px;
+    border: 1px solid black;
+    margin: 0 auto;
+  }
+  .info-important{
+    @extend .info;
+    background-color: magenta;
+  }
+
+
+
+</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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/nest-css-with-sass.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/nest-css-with-sass.md
new file mode 100644
index 0000000000..1e7b8493c6
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/nest-css-with-sass.md
@@ -0,0 +1,105 @@
+---
+id: 587d7dbd367417b2b2512bb5
+title: Nest CSS with Sass
+challengeType: 0
+forumTopicId: 301457
+dashedName: nest-css-with-sass
+---
+
+# --description--
+
+Sass allows nesting 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:
+
+```scss
+nav {
+  background-color: red;
+}
+
+nav ul {
+  list-style: none;
+}
+
+nav ul li {
+  display: inline-block;
+}
+```
+
+For a large project, the CSS file will have many lines and rules. This is where nesting can help organize your code by placing child style rules within the respective parent elements:
+
+```scss
+nav {
+  background-color: red;
+
+  ul {
+    list-style: none;
+
+    li {
+      display: inline-block;
+    }
+  }
+}
+
+```
+
+# --instructions--
+
+Use the nesting technique shown above to re-organize the CSS rules for both children of `.blog-post` element. For testing purposes, the `h1` should come before the `p` element.
+
+# --hints--
+
+Your code should re-organize the CSS rules so the `h1` and `p` are nested in the `.blog-post` parent element.
+
+```js
+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
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+  .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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  .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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
new file mode 100644
index 0000000000..9262041c3a
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/split-your-styles-into-smaller-chunks-with-partials.md
@@ -0,0 +1,47 @@
+---
+id: 587d7dbf367417b2b2512bbc
+title: Split Your Styles into Smaller Chunks with Partials
+challengeType: 0
+forumTopicId: 301459
+dashedName: split-your-styles-into-smaller-chunks-with-partials
+---
+
+# --description--
+
+<dfn>Partials</dfn> 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 partials start with the underscore (`_`) 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 `.scss` file extension. To bring the code in the partial into another Sass file, use the `@import` directive.
+
+For example, if all your mixins are saved in a partial named "\_mixins.scss", and they are needed in the "main.scss" file, this is how to use them in the main file:
+
+```scss
+@import 'mixins'
+```
+
+Note that the underscore and file extension are not needed in the `import` statement - Sass understands it is a partial. Once a partial is imported into a file, all variables, mixins, and other code are available to use.
+
+# --instructions--
+
+Write an `@import` statement to import a partial named `_variables.scss` into the main.scss file.
+
+# --hints--
+
+Your code should use the `@import` directive, and should not include the underscore in the file name.
+
+```js
+assert(code.match(/@import\s+?('|")variables\1/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!-- The main.scss file -->
+```
+
+# --solutions--
+
+```html
+@import 'variables'
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/store-data-with-sass-variables.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/store-data-with-sass-variables.md
new file mode 100644
index 0000000000..b106a6fb84
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/store-data-with-sass-variables.md
@@ -0,0 +1,121 @@
+---
+id: 587d7dbd367417b2b2512bb4
+title: Store Data with Sass Variables
+challengeType: 0
+forumTopicId: 301460
+dashedName: store-data-with-sass-variables
+---
+
+# --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 `let` and `const` keywords. In Sass, variables start with a `$` followed by the variable name.
+
+Here are a couple examples:
+
+```scss
+$main-fonts: Arial, sans-serif;
+$headings-color: green;
+```
+
+And to use the variables:
+
+```scss
+h1 {
+  font-family: $main-fonts;
+  color: $headings-color;
+}
+```
+
+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.
+
+# --instructions--
+
+Create a variable `$text-color` and set it to `red`. Then change the value of the `color` property for the `.blog-post` and `h2` to the `$text-color` variable.
+
+# --hints--
+
+Your code should have a Sass variable declared for `$text-color` with a value of `red`.
+
+```js
+assert(code.match(/\$text-color\s*:\s*?red\s*;/g));
+```
+
+Your code should use the `$text-color` variable to change the `color` for the `.blog-post` and `h2` items.
+
+```js
+assert(code.match(/color\s*:\s*\$text-color\s*;?/g));
+```
+
+Your `.blog-post` element should have a `color` of red.
+
+```js
+assert($('.blog-post').css('color') == 'rgb(255, 0, 0)');
+```
+
+Your `h2` elements should have a `color` of red.
+
+```js
+assert($('h2').css('color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+  .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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  $text-color: red;
+
+  .header{
+    text-align: center;
+  }
+  .blog-post, h2 {
+    color: $text-color;
+  }
+</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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
new file mode 100644
index 0000000000..bfdc68db55
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-each-to-map-over-items-in-a-list.md
@@ -0,0 +1,135 @@
+---
+id: 587d7dbf367417b2b2512bba
+title: Use @each to Map Over Items in a List
+challengeType: 0
+forumTopicId: 301461
+dashedName: use-each-to-map-over-items-in-a-list
+---
+
+# --description--
+
+The last challenge showed how the `@for` directive uses a starting and ending value to loop a certain number of times. Sass also offers the `@each` 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.
+
+```scss
+@each $color in blue, red, green {
+  .#{$color}-text {color: $color;}
+}
+```
+
+A map has slightly different syntax. Here's an example:
+
+```scss
+$colors: (color1: blue, color2: red, color3: green);
+
+@each $key, $color in $colors {
+  .#{$color}-text {color: $color;}
+}
+```
+
+Note that the `$key` variable is needed to reference the keys in the map. Otherwise, the compiled CSS would have `color1`, `color2`... in it. Both of the above code examples are converted into the following CSS:
+
+```scss
+.blue-text {
+  color: blue;
+}
+
+.red-text {
+  color: red;
+}
+
+.green-text {
+  color: green;
+}
+```
+
+# --instructions--
+
+Write an `@each` directive that goes through a list: `blue, black, red` and assigns each variable to a `.color-bg` class, where the `color` part changes for each item. Each class should set the `background-color` the respective color.
+
+# --hints--
+
+Your code should use the `@each` directive.
+
+```js
+assert(code.match(/@each /g));
+```
+
+Your `.blue-bg` class should have a `background-color` of blue.
+
+```js
+assert($('.blue-bg').css('background-color') == 'rgb(0, 0, 255)');
+```
+
+Your `.black-bg` class should have a `background-color` of black.
+
+```js
+assert($('.black-bg').css('background-color') == 'rgb(0, 0, 0)');
+```
+
+Your `.red-bg` class should have a `background-color` of red.
+
+```js
+assert($('.red-bg').css('background-color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+
+  @each $color in blue, black, red {
+    .#{$color}-bg {background-color: $color;}
+  }
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
+
+---
+
+```html
+<style type='text/scss'>
+
+  $colors: (color1: blue, color2: black, color3: red);
+
+  @each $key, $color in $colors {
+    .#{$color}-bg {background-color: $color;}
+  }
+
+  div {
+    height: 200px;
+    width: 200px;
+  }
+</style>
+
+<div class="blue-bg"></div>
+<div class="black-bg"></div>
+<div class="red-bg"></div>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
new file mode 100644
index 0000000000..f2d8bd73b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-for-to-create-a-sass-loop.md
@@ -0,0 +1,139 @@
+---
+id: 587d7dbe367417b2b2512bb9
+title: Use @for to Create a Sass Loop
+challengeType: 0
+forumTopicId: 301462
+dashedName: use-for-to-create-a-sass-loop
+---
+
+# --description--
+
+The `@for` directive adds styles in a loop, very similar to a `for` loop in JavaScript.
+
+`@for` is used in two ways: "start through end" or "start to end". The main difference is that the "start **to** end" *excludes* the end number as part of the count, and "start **through** end" *includes* the end number as part of the count.
+
+Here's a start **through** end example:
+
+```scss
+@for $i from 1 through 12 {
+  .col-#{$i} { width: 100%/12 * $i; }
+}
+```
+
+The `#{$i}` part is the syntax to combine a variable (`i`) with text to make a string. When the Sass file is converted to CSS, it looks like this:
+
+```scss
+.col-1 {
+  width: 8.33333%;
+}
+
+.col-2 {
+  width: 16.66667%;
+}
+
+...
+
+.col-12 {
+  width: 100%;
+}
+```
+
+This is a powerful way to create a grid layout. Now you have twelve options for column widths available as CSS classes.
+
+# --instructions--
+
+Write a `@for` directive that takes a variable `$j` that goes from 1 **to** 6.
+
+It should create 5 classes called `.text-1` to `.text-5` where each has a `font-size` set to 15px multiplied by the index.
+
+# --hints--
+
+Your code should use the `@for` directive.
+
+```js
+assert(code.match(/@for /g));
+```
+
+Your `.text-1` class should have a `font-size` of 15px.
+
+```js
+assert($('.text-1').css('font-size') == '15px');
+```
+
+Your `.text-2` class should have a `font-size` of 30px.
+
+```js
+assert($('.text-2').css('font-size') == '30px');
+```
+
+Your `.text-3` class should have a `font-size` of 45px.
+
+```js
+assert($('.text-3').css('font-size') == '45px');
+```
+
+Your `.text-4` class should have a `font-size` of 60px.
+
+```js
+assert($('.text-4').css('font-size') == '60px');
+```
+
+Your `.text-5` class should have a `font-size` of 75px.
+
+```js
+assert($('.text-5').css('font-size') == '75px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+</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>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+
+@for $i from 1 through 5 {
+  .text-#{$i} { font-size: 15px * $i; }
+}
+
+</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>
+```
+
+---
+
+```html
+<style type='text/scss'>
+
+@for $i from 1 to 6 {
+  .text-#{$i} { font-size: 15px * $i; }
+}
+
+</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>
+```
diff --git a/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
new file mode 100644
index 0000000000..e13d113b23
--- /dev/null
+++ b/curriculum/challenges/portuguese/03-front-end-libraries/sass/use-if-and-else-to-add-logic-to-your-styles.md
@@ -0,0 +1,145 @@
+---
+id: 587d7dbe367417b2b2512bb8
+title: Use @if and @else to Add Logic To Your Styles
+challengeType: 0
+forumTopicId: 301463
+dashedName: use-if-and-else-to-add-logic-to-your-styles
+---
+
+# --description--
+
+The `@if` directive in Sass is useful to test for a specific case - it works just like the `if` statement in JavaScript.
+
+```scss
+@mixin make-bold($bool) {
+  @if $bool == true {
+    font-weight: bold;
+  }
+}
+```
+
+And just like in JavaScript, `@else if` and `@else` test for more conditions:
+
+```scss
+@mixin text-effect($val) {
+  @if $val == danger {
+    color: red;
+  }
+  @else if $val == alert {
+    color: yellow;
+  }
+  @else if $val == success {
+    color: green;
+  }
+  @else {
+    color: black;
+  }
+}
+```
+
+# --instructions--
+
+Create a mixin called `border-stroke` that takes a parameter `$val`. The mixin should check for the following conditions using `@if`, `@else if`, and `@else`:
+
+```scss
+light - 1px solid black
+medium - 3px solid black
+heavy - 6px solid black
+```
+
+If `$val` is not `light`, `medium`, or `heavy`, the border should be set to `none`.
+
+# --hints--
+
+Your code should declare a mixin named `border-stroke` which has a parameter named `$val`.
+
+```js
+assert(code.match(/@mixin\s+?border-stroke\s*?\(\s*?\$val\s*?\)\s*?{/gi));
+```
+
+Your mixin should have an `@if` statement to check if `$val` is `light`, and to set the `border` to `1px solid black`.
+
+```js
+assert(
+  code.match(
+    /@if\s+?\$val\s*?===?\s*?light\s*?{\s*?border\s*?:\s*?1px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else if` statement to check if `$val` is `medium`, and to set the `border` to `3px solid black`.
+
+```js
+assert(
+  code.match(
+    /@else\s+?if\s+?\$val\s*?===?\s*?medium\s*?{\s*?border\s*?:\s*?3px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else if` statement to check if `$val` is `heavy`, and to set the `border` to `6px solid black`.
+
+```js
+assert(
+  code.match(
+    /@else\s+?if\s+?\$val\s*?===?\s*?heavy\s*?{\s*?border\s*?:\s*?6px\s+?solid\s+?black\s*?;\s*?}/gi
+  )
+);
+```
+
+Your mixin should have an `@else` statement to set the `border` to `none`.
+
+```js
+assert(code.match(/@else\s*?{\s*?border\s*?:\s*?none\s*?;\s*?}/gi));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<style type='text/scss'>
+
+
+
+  #box {
+    width: 150px;
+    height: 150px;
+    background-color: red;
+    @include border-stroke(medium);
+  }
+</style>
+
+<div id="box"></div>
+```
+
+# --solutions--
+
+```html
+<style type='text/scss'>
+  @mixin border-stroke($val) {
+    @if $val == light {
+      border: 1px solid black;
+    }
+    @else if $val == medium {
+      border: 3px solid black;
+    }
+    @else if $val == heavy {
+      border: 6px solid black;
+    }
+    @else {
+      border: none;
+    }
+  }
+
+
+  #box {
+    width: 150px;
+    height: 150px;
+    background-color: red;
+    @include border-stroke(medium);
+  }
+</style>
+
+<div id="box"></div>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-001.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-001.md
new file mode 100644
index 0000000000..63cbcbf8a5
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-001.md
@@ -0,0 +1,33 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9de
+title: Part 1
+challengeType: 0
+dashedName: part-1
+---
+
+# --description--
+
+Welcome to the dashboard project! You will be using the JavaScript data visualization library, D3, to build a visualization of your social media followers. It will consist of a line graph, a pie chart, and a legend.
+
+First, you need to create the HTML file. Start by adding the `<!DOCTYPE html>` declaration at the top of the file to tell the browser what type of document it's reading.
+
+# --hints--
+
+test-text
+
+```js
+assert(/<!DOCTYPE\s+html\s*>/gi.test(code));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-002.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-002.md
new file mode 100644
index 0000000000..8217f0cb0b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-002.md
@@ -0,0 +1,43 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9df
+title: Part 2
+challengeType: 0
+dashedName: part-2
+---
+
+# --description--
+
+Next, add opening and closing `html`, `head` and `body` tags below the doctype. Be sure to nest them properly.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /<!DOCTYPE\s+html\s*>\s*<html\s*>\s*<head\s*>\s*<\/head\s*>\s*<body\s*>\s*<\/body\s*>\s*<\/html\s*>/gi.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-003.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-003.md
new file mode 100644
index 0000000000..17dd77aaba
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-003.md
@@ -0,0 +1,51 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e0
+title: Part 3
+challengeType: 0
+dashedName: part-3
+---
+
+# --description--
+
+In the head, add a `title` of `D3 Dashboard`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /<head\s*>\s*<title\s*>D3 Dashboard<\/title\s*>\s*<\/head\s*>/g.test(code)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+
+  
+  </head>
+
+  <body>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-004.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-004.md
new file mode 100644
index 0000000000..c4df481a13
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-004.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e1
+title: Part 4
+challengeType: 0
+dashedName: part-4
+---
+
+# --description--
+
+Below the title, link to your external stylesheet by adding a `link` element with a `rel` attribute of `stylesheet` and an `href` attribute of `./dashboard.css`. Remember that link elements do not need a closing tag. You will be adding some styles to this file shortly.
+
+# --hints--
+
+test-text
+
+```js
+const link = code.match(/<link\s+[\s\S]+?[^>]>/gi)[0];
+assert(
+  /rel\s*=\s*('|")\s*stylesheet\s*\1/gi.test(link) &&
+    /href\s*=\s*('|")\s*(.\/)?dashboard\.css\s*\1/gi.test(link)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+
+    
+  </head>
+
+  <body>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+  </head>
+
+  <body>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-005.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-005.md
new file mode 100644
index 0000000000..cb9d694707
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-005.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e2
+title: Part 5
+challengeType: 0
+dashedName: part-5
+---
+
+# --description--
+
+Next, add a container for the dashboard. Put an empty `div` element in the body with class of `dashboard`. You will be appending all the dashboard elements to this div.
+
+# --hints--
+
+test-text
+
+```js
+assert($('div.dashboard').length === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+  </head>
+
+  <body>
+
+  
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+
+    
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-006.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-006.md
new file mode 100644
index 0000000000..a3528d92d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-006.md
@@ -0,0 +1,55 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e3
+title: Part 6
+challengeType: 0
+dashedName: part-6
+---
+
+# --description--
+
+You are now looking at the stylesheet that you linked to earlier. At the top of this file, target the `body` of the HTML document and give it a `background-color` of `#ccc`.
+
+# --hints--
+
+test-text
+
+```js
+const body = code.match(/body\s*{[\s\S]+?[^}]}/g)[0];
+assert(/background-color\s*:\s*#ccc\s*(;|})/gi.test(body));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+
+
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-007.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-007.md
new file mode 100644
index 0000000000..2268fc1bd6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-007.md
@@ -0,0 +1,66 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e4
+title: Part 7
+challengeType: 0
+dashedName: part-7
+---
+
+# --description--
+
+Next, target the `dashboard` class you created and give it a `width` of `980px` and a `height` of `500px`.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('width') === '980px' && dashboard.css('height') === '500px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+
+
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;  
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-008.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-008.md
new file mode 100644
index 0000000000..6b8e174e01
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-008.md
@@ -0,0 +1,73 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e5
+title: Part 8
+challengeType: 0
+dashedName: part-8
+---
+
+# --description--
+
+Give the dashboard a `background-color` of `white` and a `box-shadow` of `5px 5px 5px 5px #888` to give it a little depth.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('background-color') === 'rgb(255, 255, 255)' &&
+    dashboard.css('box-shadow') === 'rgb(136, 136, 136) 5px 5px 5px 5px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+
+  
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-009.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-009.md
new file mode 100644
index 0000000000..210943e452
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-009.md
@@ -0,0 +1,73 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e6
+title: Part 9
+challengeType: 0
+dashedName: part-9
+---
+
+# --description--
+
+Now you can see your dashboard element. Center it by adding a `margin` of `auto` to it.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = code.match(/.dashboard\s*{[\s\S]+?[^}]}/g)[0];
+assert(/margin\s*:\s*auto\s*(;|})/g.test(dashboard));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+
+
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-010.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-010.md
new file mode 100644
index 0000000000..2144211195
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-010.md
@@ -0,0 +1,75 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e7
+title: Part 10
+challengeType: 0
+dashedName: part-10
+---
+
+# --description--
+
+Give the container some space by adding a `padding` of `100px 10px` to the `body` element.
+
+# --hints--
+
+test-text
+
+```js
+const body = code.match(/body\s*{[\s\S]+?[^}]}/g)[0];
+assert(/padding\s*:\s*100px\s*10px\s*(;|})/g.test(body));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+
+  
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-011.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-011.md
new file mode 100644
index 0000000000..511106ee13
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-011.md
@@ -0,0 +1,81 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e8
+title: Part 11
+challengeType: 0
+dashedName: part-11
+---
+
+# --description--
+
+Later on, you will be adding more elements to the dashboard container. Set the `display` to `flex` and the `align-items` to `center` so those items will be vertically centered.
+
+# --hints--
+
+test-text
+
+```js
+const dashboard = $('.dashboard');
+assert(
+  dashboard.css('display') === 'flex' &&
+    dashboard.css('align-items') === 'center'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+
+  
+}
+</style>
+```
+
+# --solutions--
+
+```html
+<style>
+body {
+  background-color: #ccc;
+  padding: 100px 10px;
+}
+
+.dashboard {
+  width: 980px;
+  height: 500px;
+  background-color: white;
+  box-shadow: 5px 5px 5px 5px #888;
+  margin: auto;
+  display: flex;
+  align-items: center;  
+}
+</style>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-012.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-012.md
new file mode 100644
index 0000000000..18c1bd58cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-012.md
@@ -0,0 +1,79 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9e9
+title: Part 12
+challengeType: 0
+dashedName: part-12
+---
+
+# --description--
+
+Back in the HTML file, add a `script` tag at the bottom of the head element and give it a `src` attribute of `./d3-5.9.2.min.js`. Don't forget the closing tag. This will add the D3 library to your project from a downloaded copy.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[0];
+assert(/src\s*=\s*('|")\s*(\.\/)?d3-5.9.2.min.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+
+    
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+
+    
+ </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-013.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-013.md
new file mode 100644
index 0000000000..d37a6a0bd4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-013.md
@@ -0,0 +1,96 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ea
+title: Part 13
+challengeType: 0
+dashedName: part-13
+---
+
+# --description--
+
+Add another `script` below the one you just added. Give it a `src` attribute of `./data.js`.
+
+This adds a `data` variable to your project that contains your number of social media followers, it is an array of objects. Each object has the year and your followers for three different platforms. You will see what it looks like shortly.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[1];
+assert(/src\s*=\s*('|")\s*(\.\/)?data.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+
+    
+ </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-014.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-014.md
new file mode 100644
index 0000000000..97d9c04dfa
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-014.md
@@ -0,0 +1,95 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9eb
+title: Part 14
+challengeType: 0
+dashedName: part-14
+---
+
+# --description--
+
+Add a third script just before the closing body tag. It will be the JavaScript file you will use to create the rest of the dashboard. Give the script a `src` of `./dashboard.js`.
+
+# --hints--
+
+test-text
+
+```js
+const script = code.match(/<script\s+[\s\S]+?[^>]>\s*<\/script\s*>/gi)[2];
+assert(/src\s*=\s*('|")\s*(\.\/)?dashboard.js\s*\1/gi.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<style>
+  body {
+    background-color: #ccc;
+    padding: 100px 10px;
+  }
+
+  .dashboard {
+    width: 980px;
+    height: 500px;
+    background-color: white;
+    box-shadow: 5px 5px 5px 5px #888;
+    margin: auto;
+    display: flex;
+    align-items: center;
+  }
+</style>
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+```
+
+## --seed-contents--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    
+  </body>
+</html>
+```
+
+# --solutions--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <link rel="stylesheet" href="./dashboard.css">
+    <script src="./d3-5.9.2.min.js"></script>
+    <script src="./data.js"></script>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+
+    <script src="dashboard.js"></script>
+  </body>
+</html>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-015.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-015.md
new file mode 100644
index 0000000000..fe6efc7f29
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-015.md
@@ -0,0 +1,103 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ec
+title: Part 15
+challengeType: 0
+dashedName: part-15
+---
+
+# --description--
+
+The script at the top is the `data.js` file you added. I have placed it here so you can see the data and recommend taking a look at it. The second script is the one you just added and where you will build the rest of the project.
+
+In the second script, create three `const` variables; `svgMargin` with a value of `70`, `svgWidth` with a value of `700`, and `svgHeight` equal to `500`. The first part of the dashboard will be a line graph. It will use these variables as its dimensions.
+
+The line graph will have the years from your data variable across the bottom, and a scale on the left to show the numbers of followers. Each platform will have a line going across the graph that shows how many followers you had for each year.
+
+# --hints--
+
+test-text
+
+```js
+assert(svgMargin === 70 && svgWidth === 700 && svgHeight === 500);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500;
+  
+
+</script>  
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-016.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-016.md
new file mode 100644
index 0000000000..6926b11aee
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-016.md
@@ -0,0 +1,108 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ed
+title: Part 16
+challengeType: 0
+dashedName: part-16
+---
+
+# --description--
+
+Add three more variables; `twitterColor` with a value of `#7cd9d1`, `tumblrColor` equal to `#f6dd71`, and `instagramColor` at `#fd9b98`. Make sure those Hex values are strings. These will be colors used to represent the different platforms throughout the project.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  twitterColor === '#7cd9d1' &&
+    tumblrColor === '#f6dd71' &&
+    instagramColor === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500;
+  
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-017.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-017.md
new file mode 100644
index 0000000000..82a2efd50c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-017.md
@@ -0,0 +1,113 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ee
+title: Part 17
+challengeType: 0
+dashedName: part-17
+---
+
+# --description--
+
+When you added the D3 library earlier, it put an object named `d3` in your project with a bunch of functions. One of them is `select`; you can use dot notation to access this and the other functions from the object. Create a new variable named `lineGraph` and use `d3.select` to select the `.dashboard` element. Here's an example of something similar:
+
+```js
+const variableName = d3.select('.className')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(lineGraph._groups[0][0] === $('.dashboard')[0]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-018.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-018.md
new file mode 100644
index 0000000000..d358d508c9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-018.md
@@ -0,0 +1,117 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ef
+title: Part 18
+challengeType: 0
+dashedName: part-18
+---
+
+# --description--
+
+Your dashboard element is now "selected". D3 has a number of functions for working with a selection; one of them is `append`. It is used to add an element. Chain the `append` function to your selection and use it to add an `svg` element. Here's an example of how that might be done:
+
+```js
+const variableName = d3.select('selectedElement')
+  .append('elementToAdd')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(lineGraph._groups[0][0] === $('svg')[0]);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-019.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-019.md
new file mode 100644
index 0000000000..d55cc0b777
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-019.md
@@ -0,0 +1,124 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f0
+title: Part 19
+challengeType: 0
+dashedName: part-19
+---
+
+# --description--
+
+You can't see it, but there is now an `svg` element nested in your dashboard container. When you appended it, it became the "selection" for this area of code. Any functions you chain after it will be used on this selection.
+
+`attr` is a function to set attributes. You need to pass it the attribute you want to set, and the value you want to give it. Here's an example of how to chain `attr` to a selection:
+
+```js
+const variableName = d3.select('element')
+  .append('element')
+  .attr('attribute', 'value')
+```
+
+Chain an `attr` function to the selection that sets the `width` as the `svgWidth` variable you created earlier. When using a variable as a value, you do not need to put it in any kind of quotations.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].attributes.width.value === '700');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-020.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-020.md
new file mode 100644
index 0000000000..73034422e9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-020.md
@@ -0,0 +1,116 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f1
+title: Part 20
+challengeType: 0
+dashedName: part-20
+---
+
+# --description--
+
+Chain another `attr` function that sets the `height` as the `svgHeight` variable you created.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].attributes.height.value === '500');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-021.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-021.md
new file mode 100644
index 0000000000..ad1b8a3e0a
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-021.md
@@ -0,0 +1,123 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f2
+title: Part 21
+challengeType: 0
+dashedName: part-21
+---
+
+# --description--
+
+Your line graph needs some scales so it knows how to translate the data into visual distances. The first one is the scale for the y-axis. It will be to show the number of followers. D3 has many utilities for creating scales. You want to use it's `scaleLinear` method for this scale.
+
+Create a new `const` named `yScale`, and set it equal to `d3.scaleLinear()`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof yScale === 'function' && /yScale\s*=\s*d3\.scaleLinear/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-022.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-022.md
new file mode 100644
index 0000000000..65b5d9a684
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-022.md
@@ -0,0 +1,123 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f3
+title: Part 22
+challengeType: 0
+dashedName: part-22
+---
+
+# --description--
+
+D3 has a bunch of functions for working with scales as well. One of them is `domain`. It takes an array that is used to describe the highest and lowest values of the data for this scale. After a quick look at the data, the values of the "followers" go from about 0 to 5000. Chain the `domain` function to the `yScale` and pass it the array `[0, 5000]`.
+
+# --hints--
+
+test-text
+
+```js
+const domain = yScale.domain();
+assert(domain.length === 2 && domain[0] === 0 && domain[1] === 5000);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-023.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-023.md
new file mode 100644
index 0000000000..fef2d72f1b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-023.md
@@ -0,0 +1,129 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f4
+title: Part 23
+challengeType: 0
+dashedName: part-23
+---
+
+# --description--
+
+The `range` function describes how to map the domain values for display on the graph. For example, a value of 5000 followers can't use 5000 as it y-coordinate on the SVG or it would be off the graph. You need to tell the range where the top and bottom of the graph is so the scale can give appropriate values for the y-coordinate.
+
+Chain the `range` function below the `domain` and pass it an array with `svgHeight - svgMargin` and `svgMargin` as the values. That will translate to `[430, 70]`. This is where the top and bottom of the graph are. So a data point of 5000 followers will map to a value of 430 to use as its y-coordinate and 0 followers will use 70 as its y-coordinate. Any value in between will scale linearly.
+
+Your graph will have a margin around it for things like axes and labels. The actual line data will display on the inside of this margin area, which is why you use those values. This will become more clear as you progress through the project.
+
+# --hints--
+
+test-text
+
+```js
+const range = yScale.range();
+assert(range.length === 2 && range[0] === 430 && range[1] === 70);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+
+</script>  
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-024.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-024.md
new file mode 100644
index 0000000000..1cbbe6313f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-024.md
@@ -0,0 +1,129 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f5
+title: Part 24
+challengeType: 0
+dashedName: part-24
+---
+
+# --description--
+
+Create a new `const` named `xScale`. Use it to create another linear scale like you did for the y-scale. This will be the horizontal or "x" axis.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof xScale === 'function' && /xScale\s*=\s*d3\.scaleLinear/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-025.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-025.md
new file mode 100644
index 0000000000..3d66e7f8c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-025.md
@@ -0,0 +1,131 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f6
+title: Part 25
+challengeType: 0
+dashedName: part-25
+---
+
+# --description--
+
+The `year` values of your data will be used for the x-scale. Chain the `domain` function to `xScale` and pass it an array with the first and last years of your data.
+
+# --hints--
+
+test-text
+
+```js
+const domain = xScale.domain();
+assert(domain.length === 2 && domain[0] === 2012 && domain[1] === 2020);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-026.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-026.md
new file mode 100644
index 0000000000..339cb6906b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-026.md
@@ -0,0 +1,133 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f7
+title: Part 26
+challengeType: 0
+dashedName: part-26
+---
+
+# --description--
+
+The range for this scale will go from the left of your graph to the right, with 2012 on the left and 2020 on the right. Add the `range` function to the `xScale` and pass it an array with the values: `svgMargin` and `svgWidth - svgMargin`. This will translate to `[70, 630]`. So 2012 will use 70 as is x-coordinate and 2020 will use 630 as its x-coordinate.
+
+# --hints--
+
+test-text
+
+```js
+const range = xScale.range();
+assert(range.length === 2 && range[0] === 70 && range[1] === 630);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+
+</script>  
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-027.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-027.md
new file mode 100644
index 0000000000..022abdca4b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-027.md
@@ -0,0 +1,138 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f8
+title: Part 27
+challengeType: 0
+dashedName: part-27
+---
+
+# --description--
+
+The two scales you defined will be used to create the axes and lines. First is the y-axis, it will be a line with some labels on the left of the graph. Create a new `const` named `yAxis` and set it equal to `d3.axisLeft(yScale)`. This will use the information from the `yScale` variable to build the axis.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof yAxis === 'function' &&
+    /yAxis\s*=\s*d3\.axisLeft\(\s*yScale\)/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-028.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-028.md
new file mode 100644
index 0000000000..4fbb726a6e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-028.md
@@ -0,0 +1,142 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9f9
+title: Part 28
+challengeType: 0
+dashedName: part-28
+---
+
+# --description--
+
+Create a new `const` named `xAxis` and set the value equal to `d3.axisBottom(xScale)`. This will create another axis for the bottom of the graph using the information from `xScale`. Although the axes do not display yet, they have the information they need to display correctly.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof xAxis === 'function' &&
+    /xAxis\s*=\s*d3\.axisBottom\(\s*xScale\)/.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-029.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-029.md
new file mode 100644
index 0000000000..cf95b345c5
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-029.md
@@ -0,0 +1,143 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fa
+title: Part 29
+challengeType: 0
+dashedName: part-29
+---
+
+# --description--
+
+On a new line, append a new `g` element to your `lineGraph` variable. `lineGraph.append('g')` will do that for you. This will add a `g` to your SVG and be for displaying the y-axis. `g` is an SVG element that stands for "group".
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg')[0].children[0] === $('g')[0] && $('g').length === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-030.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-030.md
new file mode 100644
index 0000000000..2ff020ff1a
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-030.md
@@ -0,0 +1,147 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fb
+title: Part 30
+challengeType: 0
+dashedName: part-30
+---
+
+# --description--
+
+`call` is another function to use with selections. Chain a `call` function to the selection and pass your `yAxis` variable to it. This will draw your y-axis on the SVG.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.tick').length === 11 && /\.call\(\s*yAxis\s*\)/.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-031.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-031.md
new file mode 100644
index 0000000000..d5d5ea704c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-031.md
@@ -0,0 +1,151 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fc
+title: Part 31
+challengeType: 0
+dashedName: part-31
+---
+
+# --description--
+
+After all that work, something is finally displayed on the graph. It's the y-axis and all the numbers are hidden on the left.
+
+Move the axis your `svgMargin` to the right by chaining an `attr` function to the selection. Use it to set the `transform` to `translate(${svgMargin}, 0)`. Use a template literal (backticks) to set the value so you can put your variable in there.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g')[0].attributes.transform.nodeValue === 'translate(70, 0)');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-032.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-032.md
new file mode 100644
index 0000000000..75ba3f4f93
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-032.md
@@ -0,0 +1,150 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fd
+title: Part 32
+challengeType: 0
+dashedName: part-32
+---
+
+# --description--
+
+`style` is a function similar to `attr`, but is more for manipulating CSS styles rather than element attributes. Add a `style` function to the selection that sets the `font` to `10px verdana`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g')[0].attributes.style.nodeValue === 'font: 10px verdana;');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-033.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-033.md
new file mode 100644
index 0000000000..acb146f6fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-033.md
@@ -0,0 +1,153 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9fe
+title: Part 33
+challengeType: 0
+dashedName: part-33
+---
+
+# --description--
+
+On a new line, append another `g` element to your `lineGraph` variable like you did before. This one will be for the x-axis.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g').length === 13);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-034.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-034.md
new file mode 100644
index 0000000000..16484edb39
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-034.md
@@ -0,0 +1,156 @@
+---
+id: 5d8a4cfbe6b6180ed9a1c9ff
+title: Part 34
+challengeType: 0
+dashedName: part-34
+---
+
+# --description--
+
+Use the `call` function to draw the x-axis onto the SVG like you did for the y-axis.
+
+# --hints--
+
+test-text
+
+```js
+assert($('g').length === 22);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+    
+  lineGraph.append('g')
+    .call(xAxis)
+
+  
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-035.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-035.md
new file mode 100644
index 0000000000..9bf085e53a
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-035.md
@@ -0,0 +1,158 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca00
+title: Part 35
+challengeType: 0
+dashedName: part-35
+---
+
+# --description--
+
+The axis has the right size and labels, but needs to be moved down. Use the `attr` function to set the `transform` like you did before. This time move it down your `svgHeight` minus the `svgMargin`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg > g')[1].attributes.transform.nodeValue === 'translate(0, 430)');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+    
+  lineGraph.append('g')
+    .call(xAxis)
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-036.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-036.md
new file mode 100644
index 0000000000..195a51db40
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-036.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca01
+title: Part 36
+challengeType: 0
+dashedName: part-36
+---
+
+# --description--
+
+The axis labels are `text` elements within the `g`, you can use the `selectAll` function to select them. Chain the `selectAll` function to select the `text` elements in this group. You can do that like this:
+
+```js
+.selectAll('element')
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.attr\('transform', `translate\(0, \$\{svgHeight - svgMargin\}\)`\)\s*\.selectAll\s*\(\s*('|"|`)text\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-037.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-037.md
new file mode 100644
index 0000000000..0b758f6fc0
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-037.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca02
+title: Part 37
+challengeType: 0
+dashedName: part-37
+---
+
+# --description--
+
+I want the text elements to be rotated slightly. Chain the `style` function to set the `transform` to `translate(-12px, 0) rotate(-50deg)`. This will put them at an angle.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) =>
+      index.style.transform === 'translate(-12px) rotate(-50deg)' ||
+      index.style.transform === 'translate(-12px, 0px) rotate(-50deg)'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+
+  
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-038.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-038.md
new file mode 100644
index 0000000000..5322ee5fe7
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-038.md
@@ -0,0 +1,168 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca03
+title: Part 38
+challengeType: 0
+dashedName: part-38
+---
+
+# --description--
+
+Add another `style` function to set the `text-anchor` to `end`. This will change the spot that each text element rotates around to the `end` of the element so they will align better.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) => index.style['text-anchor'] === 'end'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+
+  
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-039.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-039.md
new file mode 100644
index 0000000000..93a1681382
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-039.md
@@ -0,0 +1,173 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca04
+title: Part 39
+challengeType: 0
+dashedName: part-39
+---
+
+# --description--
+
+Add two more `style` functions; one to set the `cursor` to `pointer`, and another to set the `font` to `10px verdana`.
+
+You will add some hover effects later, so the pointer will make for a better experience.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.tick > text').filter(
+    (node, index) =>
+      index.style.cursor === 'pointer' && index.style.font === '10px verdana'
+  ).length === 9
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-040.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-040.md
new file mode 100644
index 0000000000..ff7ddccaef
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-040.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca05
+title: Part 40
+challengeType: 0
+dashedName: part-40
+---
+
+# --description--
+
+There are a number of D3 functions to work with how the "ticks" or your axis labels are displayed; one of them is `ticks`. Go back to where you defined the `yAxis` variable and chain a `ticks` function to it and pass it these two arguments: `6, '~s'`.
+
+The `6` will set the number of ticks used to 6, and the `~s` will make the labels display the number of thousands followed by a `k`. For example, `4000` will become `4k`.
+
+# --hints--
+
+test-text
+
+```js
+const ticks = $('.tick > text');
+assert(
+  ticks[0].innerHTML === '0k' &&
+    ticks[1].innerHTML === '1k' &&
+    ticks[2].innerHTML === '2k' &&
+    ticks[3].innerHTML === '3k' &&
+    ticks[4].innerHTML === '4k' &&
+    ticks[5].innerHTML === '5k'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+
+
+  const xAxis = d3.axisBottom(xScale)
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-041.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-041.md
new file mode 100644
index 0000000000..a0d2f25c86
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-041.md
@@ -0,0 +1,171 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca06
+title: Part 41
+challengeType: 0
+dashedName: part-41
+---
+
+# --description--
+
+Go back to where you defined your `xAis` variable and chain the `tickFormat` function to it. Pass it `d3.format('')`. This will remove the commas in the year labels of the x-axis.
+
+# --hints--
+
+test-text
+
+```js
+const ticks = $('.tick > text');
+assert(ticks[6].innerHTML === '2012' && ticks[14].innerHTML === '2020');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-042.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-042.md
new file mode 100644
index 0000000000..0c55ad53c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-042.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca07
+title: Part 42
+challengeType: 0
+dashedName: part-42
+---
+
+# --description--
+
+In the same spot, chain the `tickPadding` function to the `xAxis` and pass it `10`. This will add a little padding to the ticks so the labels are better aligned.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.tickFormat\(d3\.format\((''\)\)\s*\.tickPadding\s*\(\s*10\s*\))/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-043.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-043.md
new file mode 100644
index 0000000000..383f6dd20f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-043.md
@@ -0,0 +1,178 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca08
+title: Part 43
+challengeType: 0
+dashedName: part-43
+---
+
+# --description--
+
+The axes and labels are looking good. Next, you will start to add some of the lines for the data. First is the line for the Twitter data. On a new line, create a new `const` named `twitterLine` and set it equal to `d3.line()`. `line` is a D3 function for creating a line.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*twitterLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-044.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-044.md
new file mode 100644
index 0000000000..d72f1948ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-044.md
@@ -0,0 +1,192 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca09
+title: Part 44
+challengeType: 0
+dashedName: part-44
+---
+
+# --description--
+
+The line needs x and y values for each point of data. Chain `x` to the line and pass it a "d function". Here's how that will look:
+
+```js
+.x(d => d.year)
+```
+
+You will be passing your `data` array to this line function, where it will go through each item in the array(`d`) and create an x value based on the year(`d.year`).
+
+This is the first place you have seen a "d function". These are common in D3 and that is how I will refer to them throughout this project.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const twitterLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*d\.year\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => d.year)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-045.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-045.md
new file mode 100644
index 0000000000..260d37d795
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-045.md
@@ -0,0 +1,183 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0a
+title: Part 45
+challengeType: 0
+dashedName: part-45
+---
+
+# --description--
+
+Instead of simply using the year(`d.year`) for the x-coordinate, you need to pass each year to the `xScale` so it can set the appropriate coordinate based on your scale.
+
+In the "d function" you created, return `xScale(d.year)` instead of `d.year`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.x\s*\(d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => d.year)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-046.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-046.md
new file mode 100644
index 0000000000..89137d7597
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-046.md
@@ -0,0 +1,189 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0b
+title: Part 46
+challengeType: 0
+dashedName: part-46
+---
+
+# --description--
+
+Chain the `y` function to the line and pass it a "d function" that returns your `yScale` with `d.followers.twitter` as its argument.
+
+This is similar to how you set the x values. It will use the values of your Twitter followers and your `yScale` to set the y coordinate for each item.
+
+These "d functions" use implicit returns. But if you add curly brackets and a return statement, you can put any JavaScript in there that you want. Including `console.log` statements that can be useful for debugging.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.twitter\s*\)\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+
+    
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-047.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-047.md
new file mode 100644
index 0000000000..07e8df9e86
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-047.md
@@ -0,0 +1,189 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0c
+title: Part 47
+challengeType: 0
+dashedName: part-47
+---
+
+# --description--
+
+The first line is created and ready to be displayed, which will take a couple steps. On a new line, `append` a `path` element to your `lineGraph` variable. This is similar to how you appended the `g` before.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 3 &&
+    /lineGraph\.append\((`|'|")path\1\)/gi.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+
+    
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-048.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-048.md
new file mode 100644
index 0000000000..ec0cb07a7c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-048.md
@@ -0,0 +1,193 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0d
+title: Part 48
+challengeType: 0
+dashedName: part-48
+---
+
+# --description--
+
+Tell the path what data to use. Add an `attr` function and set the `d` to `twitterLine(data)`. This will the build the path using the `twitterLine` function you created and your data variable.
+
+Note that the `d` in this case is a path attribute for drawing a line and is different from a "d function".
+
+After you have added your code, take a look at the data flow to help understand what is happening. You pass the data array to your `twitterLine` function where it sets the x and y values using your "d functions". The "d functions" go through each item in the array, passing part of the item to each scale to find the appropriate coordinates. When it's done, the value you are setting here is created and sent back. The result ends up being a confusing string of numbers and coordinates to tell the path how to be drawn.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[2].getAttribute('d').length === 151);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-049.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-049.md
new file mode 100644
index 0000000000..780407ba26
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-049.md
@@ -0,0 +1,199 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0e
+title: Part 49
+challengeType: 0
+dashedName: part-49
+---
+
+# --description--
+
+Add three more `attr` functions to the path; one to set the `stroke` to your `twitterColor` variable, another to set the `stroke-width` to `3`, and a third to set the `fill` to `transparent`.
+
+# --hints--
+
+test-text
+
+```js
+const twitterPath = $('svg path')[2];
+assert(
+  twitterPath.getAttribute('stroke') === '#7cd9d1' &&
+    twitterPath.getAttribute('stroke-width') == '3' &&
+    twitterPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-050.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-050.md
new file mode 100644
index 0000000000..48465e56c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-050.md
@@ -0,0 +1,198 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca0f
+title: Part 50
+challengeType: 0
+dashedName: part-50
+---
+
+# --description--
+
+On a new line, create a new `const` named `tumblrLine` and set it equal to `d3.line()`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*tumblrLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-051.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-051.md
new file mode 100644
index 0000000000..f648e20fdc
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-051.md
@@ -0,0 +1,204 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca10
+title: Part 51
+challengeType: 0
+dashedName: part-51
+---
+
+# --description--
+
+Set the `x` values for `tumblrLine` using another "d function". Use your `xScale` and the `d.year` to calculcate their values just like you did for the Twitter line.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const tumblrLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-052.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-052.md
new file mode 100644
index 0000000000..10547d63c1
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-052.md
@@ -0,0 +1,207 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca11
+title: Part 52
+challengeType: 0
+dashedName: part-52
+---
+
+# --description--
+
+Set the `y` values for `tumblrLine` using a "d function" again. Use your `yScale` and `d.followers.tumblr` to calculcate their values just like you did for the Twitter line.
+
+The x values for each line will be the same, but the y values will use the data from the different platforms.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.tumblr\s*\)\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-053.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-053.md
new file mode 100644
index 0000000000..88f5b9b4ce
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-053.md
@@ -0,0 +1,209 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca12
+title: Part 53
+challengeType: 0
+dashedName: part-53
+---
+
+# --description--
+
+On a new line, `append` a `path` element to the `lineGraph` variable. This one will be for displaying the `tumblrLine`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 4 &&
+    code.match(/lineGraph\.append\((`|'|")path\1\)/gi).length === 2
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-054.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-054.md
new file mode 100644
index 0000000000..5e0ecb4239
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-054.md
@@ -0,0 +1,209 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca13
+title: Part 54
+challengeType: 0
+dashedName: part-54
+---
+
+# --description--
+
+Tell the new path how to be drawn by setting the `d` attribute to `tumblrLine(data)` using the `attr` function.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[3].getAttribute('d').length === 115);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-055.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-055.md
new file mode 100644
index 0000000000..69e492e771
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-055.md
@@ -0,0 +1,218 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca14
+title: Part 55
+challengeType: 0
+dashedName: part-55
+---
+
+# --description--
+
+Add three `attr` functions to the selection; one to set the `stroke` to your `tumblrColor` variable, another to set the `stroke-width` to `3`, and a third to set the `fill` to `transparent`.
+
+# --hints--
+
+test-text
+
+```js
+const tumblrPath = $('svg path')[3];
+assert(
+  tumblrPath.getAttribute('stroke') === '#f6dd71' &&
+    tumblrPath.getAttribute('stroke-width') == '3' &&
+    tumblrPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-056.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-056.md
new file mode 100644
index 0000000000..49da077e90
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-056.md
@@ -0,0 +1,218 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca15
+title: Part 56
+challengeType: 0
+dashedName: part-56
+---
+
+# --description--
+
+Two lines down, only one more to add for the Instagram followers. On a new line, create a new `const` named `instagramLine` and use the D3 `line` function to create another line like you did for the other two.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*instagramLine\s*=\s*d3\s*\.\s*line\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-057.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-057.md
new file mode 100644
index 0000000000..5a0a51555b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-057.md
@@ -0,0 +1,226 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca16
+title: Part 57
+challengeType: 0
+dashedName: part-57
+---
+
+# --description--
+
+Appropriately set the `x` values for `instagramLine` like you did for the other two lines.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const instagramLine = d3\.line\(\)\s*\.x\s*\(\s*d\s*=>\s*xScale\s*\(\s*d\.year\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-058.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-058.md
new file mode 100644
index 0000000000..66f4ae49a3
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-058.md
@@ -0,0 +1,229 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca17
+title: Part 58
+challengeType: 0
+dashedName: part-58
+---
+
+# --description--
+
+Appropriately set the `y` values for `instagramLine` like you did for the other two lines. Use the Instagram followers data this time.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.y\s*\(\s*d\s*=>\s*yScale\s*\(\s*d\.followers.instagram\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-059.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-059.md
new file mode 100644
index 0000000000..b30967efed
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-059.md
@@ -0,0 +1,231 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca18
+title: Part 59
+challengeType: 0
+dashedName: part-59
+---
+
+# --description--
+
+On a new line, `append` a new `path` for the Instagram line like you did for the other two lines.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg path').length === 5 &&
+    code.match(/lineGraph\.append\((`|'|")path\1\)/gi).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-060.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-060.md
new file mode 100644
index 0000000000..1d1a2461c9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-060.md
@@ -0,0 +1,230 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca19
+title: Part 60
+challengeType: 0
+dashedName: part-60
+---
+
+# --description--
+
+Use your `instagramLine` variable and your data to set the `d` attribute for this path like you did for the other two.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg path')[4].getAttribute('d').length === 171);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-061.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-061.md
new file mode 100644
index 0000000000..78de28a793
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-061.md
@@ -0,0 +1,239 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1a
+title: Part 61
+challengeType: 0
+dashedName: part-61
+---
+
+# --description--
+
+Set the `stroke`, `stroke-width`, and `fill` attributes to their appropriate values for this line. The `stroke-width` and `fill` are the same as the other two.
+
+# --hints--
+
+test-text
+
+```js
+const instagramPath = $('svg path')[4];
+assert(
+  instagramPath.getAttribute('stroke') === '#fd9b98' &&
+    instagramPath.getAttribute('stroke-width') == '3' &&
+    instagramPath.getAttribute('fill') === 'transparent'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+
+  
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-062.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-062.md
new file mode 100644
index 0000000000..72e1323994
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-062.md
@@ -0,0 +1,247 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1b
+title: Part 62
+challengeType: 0
+dashedName: part-62
+---
+
+# --description--
+
+Okay, your graph is coming along. All the lines are drawn, but they look a little plain. The next series of code additions will add circles to each point on each line. First is the Twitter line. On a new line, use the `selectAll` function on your `lineGraph` variable and pass it the string `twitter-circles`. It will look like this:
+
+```js
+lineGraph.selectAll('twitter-circles')
+```
+
+`twitter-circles` don't exist and this selection will be an empty array, but it's needed. For now, you can just think of this string as a reference, similar to a variable name, so you know what elements you are working with.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*twitter-circles\1\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-063.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-063.md
new file mode 100644
index 0000000000..c09620b08b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-063.md
@@ -0,0 +1,246 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1c
+title: Part 63
+challengeType: 0
+dashedName: part-63
+---
+
+# --description--
+
+Add the D3 `data` function to your selection and pass it the data array like this:
+
+```js
+.data(data)
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.data\s*\(\s*data\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', '3')
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+
+
+
+</script> 
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-064.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-064.md
new file mode 100644
index 0000000000..ec2fac2892
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-064.md
@@ -0,0 +1,248 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1d
+title: Part 64
+challengeType: 0
+dashedName: part-64
+---
+
+# --description--
+
+Next, chain the `enter()` function to the selection.
+
+The enter function identifies elements that need to be added when the data array is longer than the selection array. This is why you wanted the `selectAll` to be an empty array before.
+
+In this case, the `twitter-circles` selection has a length of 0, and the data array has a length of 9. So nine elements will be added when you use `append` in the next step.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.data\(data\)\s*\.enter\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+
+
+
+</script> 
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+    .data(data)
+    .enter()
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-065.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-065.md
new file mode 100644
index 0000000000..8edf0ab0b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-065.md
@@ -0,0 +1,246 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1e
+title: Part 65
+challengeType: 0
+dashedName: part-65
+---
+
+# --description--
+
+Add the `append` function to the selection, and use it to add `circle` elements. This will add the nine `circle` elements for your Twitter circles. They will be invisible to start, but the elements are there.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 9);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')  
+    .data(data)
+    .enter()
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-066.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-066.md
new file mode 100644
index 0000000000..81dd24789e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-066.md
@@ -0,0 +1,250 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca1f
+title: Part 66
+challengeType: 0
+dashedName: part-66
+---
+
+# --description--
+
+Each circle needs a `cx` and `cy` attribute so it knows where to display on the SVG. These are similar to the x and y coordinates for the lines and will be calculated in the same way. The difference is that, for circles, the `cx` and `cy` are attributes, so you need to use the `attr` function.
+
+Use the `attr` function to set the `cx` to `d => xScale(d.year)`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('cx') == '70');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-067.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-067.md
new file mode 100644
index 0000000000..c3828efd81
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-067.md
@@ -0,0 +1,252 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca20
+title: Part 67
+challengeType: 0
+dashedName: part-67
+---
+
+# --description--
+
+Next, set the `cy` attribute to `d => xScale(d.followers.twitter)`.
+
+As a reminder, this will pass each value of your Twitter followers to the `xScale` function where it will determine the y coordinate to use.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('cy') == '243.232');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-068.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-068.md
new file mode 100644
index 0000000000..3d5c6c2bc9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-068.md
@@ -0,0 +1,252 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca21
+title: Part 68
+challengeType: 0
+dashedName: part-68
+---
+
+# --description--
+
+Circles also need an `r` (radius) attribute so they know how big to be. Use the `attr` function to set the `r` to `6`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].getAttribute('r') == '6');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-069.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-069.md
new file mode 100644
index 0000000000..20564296fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-069.md
@@ -0,0 +1,258 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca22
+title: Part 69
+challengeType: 0
+dashedName: part-69
+---
+
+# --description--
+
+The circles are now visible, but I don't like the color. Use the appropriate function to set the `fill` to `white` and the `stroke` to your `twitterColor` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[0].getAttribute('fill') === 'white' &&
+    $('svg circle')[0].getAttribute('stroke') === '#7cd9d1'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-070.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-070.md
new file mode 100644
index 0000000000..42f78cc15b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-070.md
@@ -0,0 +1,258 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca23
+title: Part 70
+challengeType: 0
+dashedName: part-70
+---
+
+# --description--
+
+Use the `style` function to set the `cursor` to `pointer`. Like your year labels, this will be an indicator for a hover effect you will add later.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[0].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-071.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-071.md
new file mode 100644
index 0000000000..56f09feeba
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-071.md
@@ -0,0 +1,263 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca24
+title: Part 71
+challengeType: 0
+dashedName: part-71
+---
+
+# --description--
+
+On a new line, use the `selectAll` function on your `lineGraph` variable again and pass it the string `tumblr-circles` this time. The next few steps will be for adding circles to the Tumblr line.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*tumblr-circles\1\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-072.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-072.md
new file mode 100644
index 0000000000..3161f8adfb
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-072.md
@@ -0,0 +1,268 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca25
+title: Part 72
+challengeType: 0
+dashedName: part-72
+---
+
+# --description--
+
+Add the same `data`, `enter`, and `append` functions here that you added for the `twitter-circles`, passing in the same arguments. Make sure they are in the same order.
+
+Remember that this will take the difference in length between the `tumblr-circles` selection(0) and the data array(9) and append that many circle elements.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 18);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-073.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-073.md
new file mode 100644
index 0000000000..1f860b9f0f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-073.md
@@ -0,0 +1,274 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca26
+title: Part 73
+challengeType: 0
+dashedName: part-73
+---
+
+# --description--
+
+Set the `cx` and `cy` attributes for the Tumblr circles to their appropriate values.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[9].getAttribute('cx') == '70' &&
+    $('svg circle')[9].getAttribute('cy') == '401.128'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-074.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-074.md
new file mode 100644
index 0000000000..c84eb37bed
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-074.md
@@ -0,0 +1,280 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca27
+title: Part 74
+challengeType: 0
+dashedName: part-74
+---
+
+# --description--
+
+Use the `attr` function to set the `r` to `6`, the `fill` to `white`, and the `stroke` to your `tumblrColor` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[9].getAttribute('r') == '6' &&
+    $('svg circle')[9].getAttribute('fill') === 'white' &&
+    $('svg circle')[9].getAttribute('stroke') === '#f6dd71'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-075.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-075.md
new file mode 100644
index 0000000000..72c22fb688
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-075.md
@@ -0,0 +1,280 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca28
+title: Part 75
+challengeType: 0
+dashedName: part-75
+---
+
+# --description--
+
+Set the `cursor` to `pointer` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[9].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-076.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-076.md
new file mode 100644
index 0000000000..5840013fba
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-076.md
@@ -0,0 +1,287 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca29
+title: Part 76
+challengeType: 0
+dashedName: part-76
+---
+
+# --description--
+
+The circles have been added to two of the lines and look good, on to the last one. On a new line, create another empty selection like you did before. Use the string: `instagram-circles` this time.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /lineGraph\s*\.\s*selectAll\s*\((`|'|")\s*instagram-circles\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-077.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-077.md
new file mode 100644
index 0000000000..038b25fe6f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-077.md
@@ -0,0 +1,288 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2a
+title: Part 77
+challengeType: 0
+dashedName: part-77
+---
+
+# --description--
+
+Add the three functions necessary to append the new circle elements. Remember that they won't actually be visible yet.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle').length === 27);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-078.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-078.md
new file mode 100644
index 0000000000..37dfd3a218
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-078.md
@@ -0,0 +1,296 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2b
+title: Part 78
+challengeType: 0
+dashedName: part-78
+---
+
+# --description--
+
+Appropriately set the `cx` and `cy` attributes for the Instagram circles.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[18].getAttribute('cx') == '70' &&
+    $('svg circle')[18].getAttribute('cy') == '424.024'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-079.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-079.md
new file mode 100644
index 0000000000..050c462974
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-079.md
@@ -0,0 +1,302 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2c
+title: Part 79
+challengeType: 0
+dashedName: part-79
+---
+
+# --description--
+
+Appropriately set the radius (`r`), `fill`, and `stroke` for these circles.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg circle')[18].getAttribute('r') == '6' &&
+    $('svg circle')[18].getAttribute('fill') === 'white' &&
+    $('svg circle')[18].getAttribute('stroke') === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-080.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-080.md
new file mode 100644
index 0000000000..a5d57e2bdc
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-080.md
@@ -0,0 +1,302 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2d
+title: Part 80
+challengeType: 0
+dashedName: part-80
+---
+
+# --description--
+
+Apply the appropriate `cursor` style for these circles.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg circle')[18].style.cursor === 'pointer');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-081.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-081.md
new file mode 100644
index 0000000000..58692f5eb8
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-081.md
@@ -0,0 +1,309 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2e
+title: Part 81
+challengeType: 0
+dashedName: part-81
+---
+
+# --description--
+
+The line graph is looking good. All the empty space to the right will be for the pie graph and legend. Create a new `const` named `rightDashboard` and set equal to `d3.select('.dashboard')`. This will select your dashboard container again which currently only has the SVG element as a child.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*rightDashboard\s*=\s*d3\.select\s*\((`|'|")\.dashboard\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-082.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-082.md
new file mode 100644
index 0000000000..189c7e257e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-082.md
@@ -0,0 +1,312 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca2f
+title: Part 82
+challengeType: 0
+dashedName: part-82
+---
+
+# --description--
+
+Use `append` to add a `div` element to the selection. This will put a div as another child of the dashboard container to hold the pie graph and legend.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const rightDashboard = d3\.select\((`|'|")\.dashboard\1\)\s*\.append\s*\(\s*(`|'|")div\2\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-083.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-083.md
new file mode 100644
index 0000000000..06544d55f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-083.md
@@ -0,0 +1,315 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca30
+title: Part 83
+challengeType: 0
+dashedName: part-83
+---
+
+# --description--
+
+Create a new `const` named `pieGraph` and set it equal to `rightDashboard.append('svg')`. This will add an SVG element for the pie graph as a child of the div you just added. The pie graph will have three slices, one for each platform. It will display a percentage of how many followers each platform has for the displayed year.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*pieGraph\s*=\s*rightDashboard\s*\.\s*append\s*\((`|'|")svg\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-084.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-084.md
new file mode 100644
index 0000000000..ff5d59d875
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-084.md
@@ -0,0 +1,318 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca31
+title: Part 84
+challengeType: 0
+dashedName: part-84
+---
+
+# --description--
+
+Add two `attr` functions that set the `width` and `height` of the new SVG to `200`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('svg')[1].getAttribute('width') == '200' &&
+    $('svg')[1].getAttribute('height') == '200'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-085.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-085.md
new file mode 100644
index 0000000000..254821537e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-085.md
@@ -0,0 +1,319 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca32
+title: Part 85
+challengeType: 0
+dashedName: part-85
+---
+
+# --description--
+
+Create a new `const` named `pieArc` and set it equal to `d3.arc()`. This will be used to create the angles for the lines of the pie chart using the D3 arc generator.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pieArc\s*=\s*d3\s*\.\s*arc\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-086.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-086.md
new file mode 100644
index 0000000000..24d2528df9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-086.md
@@ -0,0 +1,324 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca33
+title: Part 86
+challengeType: 0
+dashedName: part-86
+---
+
+# --description--
+
+Chain the function `outerRadius(100)` to the arc. This will set the outer radius of the pie chart to 100.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieArc = d3\.arc\(\)\s*\.\s*outerRadius\s*\(\s*100\s*\)/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-087.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-087.md
new file mode 100644
index 0000000000..158785f17c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-087.md
@@ -0,0 +1,328 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca34
+title: Part 87
+challengeType: 0
+dashedName: part-87
+---
+
+# --description--
+
+Chain `innerRadius` to the arc and pass it `0` (zero). This is set to zero to make a traditional pie chart, you would use a larger inner radius to create a doughnut chart.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieArc = d3\.arc\(\)\s*\.outerRadius\(100\)\s*\.\s*innerRadius\s*\(\s*0\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-088.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-088.md
new file mode 100644
index 0000000000..0374b5d205
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-088.md
@@ -0,0 +1,329 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca35
+title: Part 88
+challengeType: 0
+dashedName: part-88
+---
+
+# --description--
+
+The pie chart needs a new scale to set the colors. Create a new `const` named `pieColors` and set it equal to `d3.scaleOrdinal()`. An ordinal scale is for a set of data that will have exactly one item in the range specifically for it.
+
+In this case, each platform of followers you have will map directly to a single color with nothing in between.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pieColors\s*=\s*d3\s*\.\s*scaleOrdinal\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-089.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-089.md
new file mode 100644
index 0000000000..d370af97db
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-089.md
@@ -0,0 +1,334 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca36
+title: Part 89
+challengeType: 0
+dashedName: part-89
+---
+
+# --description--
+
+Set the `domain` of the scale to `data[8].followers`. This will be three items, one for each platform.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieColors = d3\.scaleOrdinal\(\)\s*\.\s*domain\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-090.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-090.md
new file mode 100644
index 0000000000..2ab27a1292
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-090.md
@@ -0,0 +1,336 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca37
+title: Part 90
+challengeType: 0
+dashedName: part-90
+---
+
+# --description--
+
+Since the domain has three items, the range also needs to have three items. If it had less, the values would repeat, putting the same color on the pie chart multiple times. Add the `range` function to the scale and pass it an array with your three color variables. Put them in the same order in which they are defined.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.domain\(data\[8\]\.followers\)\s*\.\s*range\s*\(\s*\[\s*twitterColor\s*,\s*tumblrColor\s*,\s*instagramColor\s*\]\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-091.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-091.md
new file mode 100644
index 0000000000..ca30c57807
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-091.md
@@ -0,0 +1,335 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca38
+title: Part 91
+challengeType: 0
+dashedName: part-91
+---
+
+# --description--
+
+Create a new `const` named `pie` and set it equal to `d3.pie()`. This is the D3 pie chart generator.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*pie\s*=\s*d3\s*\.\s*pie\s*\(\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-092.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-092.md
new file mode 100644
index 0000000000..78810ee7c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-092.md
@@ -0,0 +1,344 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca39
+title: Part 92
+challengeType: 0
+dashedName: part-92
+---
+
+# --description--
+
+Chain a `value` function to `pie` and pass it `d => d.value`. Each piece of data(`d`) will have a `key`(platform) and a `value`(number of followers), you want to return the number of followers here. The pie function will create an array of objects from these values that describe the angles and sizes the pie chart needs.
+
+In a few steps, you will make an array out of your data variable that will be passed to this function.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pie = d3\.pie\(\)\s*\.\s*value\s*\(\s*d\s*=>\s*d\.value\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+
+    
+  
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-093.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-093.md
new file mode 100644
index 0000000000..d04e9e9cd4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-093.md
@@ -0,0 +1,345 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3a
+title: Part 93
+challengeType: 0
+dashedName: part-93
+---
+
+# --description--
+
+Create a new `const` named `pieGraphData` and set the value equal to `pieGraph.selectAll('pieSlices')`. This is an empty selection similar circles you created earlier.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*pieGraphData\s*=\s*pieGraph\s*\.\s*selectAll\s*\(\s*(`|'|")pieSlices\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+
+    
+  
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-094.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-094.md
new file mode 100644
index 0000000000..2f7ab8d169
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-094.md
@@ -0,0 +1,348 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3b
+title: Part 94
+challengeType: 0
+dashedName: part-94
+---
+
+# --description--
+
+Add the `data` function to the selection. Pass it your `pie` function with an empty array as its argument for now. The next step will get the correct array to put there.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieGraphData = pieGraph\.selectAll\((`|'|")pieSlices\1\)\s*\.\s*data\s*\(pie\s*\(\s*\[\s*\]\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie([]))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-095.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-095.md
new file mode 100644
index 0000000000..aa0739df56
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-095.md
@@ -0,0 +1,367 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3c
+title: Part 95
+challengeType: 0
+dashedName: part-95
+---
+
+# --description--
+
+You want the array passed to `pie` to be an array of key/value objects for the 2020 followers. `d3.entries` will build that array for you. Here's how that looks:
+
+```js
+d3.entries(data[8].followers))
+```
+
+The array it builds looks like this:
+
+```js
+[
+  { key: 'twitter', value: 2845 },
+  { key: 'tumblr', value: 2040 },
+  { key: 'instagram', value: 4801 }
+]
+```
+
+This is where the `value` comes from in your `pie` variable.
+
+Add the `d3.entries` function as your `pie` argument. Use it to create the above array.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const pieGraphData = pieGraph\.selectAll\((`|'|")pieSlices\1\)\s*\.\s*data\s*\(pie\s*\(\s*d3\s*\.\s*entries\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie([]))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-096.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-096.md
new file mode 100644
index 0000000000..9360d253ba
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-096.md
@@ -0,0 +1,350 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3d
+title: Part 96
+challengeType: 0
+dashedName: part-96
+---
+
+# --description--
+
+Add the `enter` function to the current selection. Just like before, the initial selection here has a length of zero and the data has a length of three. So when you append elements in the next step, three will be created; one for each slice of the pie.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.data\(pie\(d3\.entries\(data\[8\]\.followers\)\)\)\s*\.\s*enter\s*\(\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-097.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-097.md
new file mode 100644
index 0000000000..951024b7ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-097.md
@@ -0,0 +1,348 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3e
+title: Part 97
+challengeType: 0
+dashedName: part-97
+---
+
+# --description--
+
+Use `append` to add three `g` elements for the pie.
+
+# --hints--
+
+test-text
+
+```js
+assert($('svg g').length === 20);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-098.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-098.md
new file mode 100644
index 0000000000..50c6cb583e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-098.md
@@ -0,0 +1,351 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca3f
+title: Part 98
+challengeType: 0
+dashedName: part-98
+---
+
+# --description--
+
+On a new line, `append` a `path` element to your `pieGraphData` variable. This is where you will start to draw the pie chart.
+
+# --hints--
+
+test-text
+
+```js
+assert(/pieGraphData\s*\.\s*append\s*\((`|'|")path\1\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  pieGraphData.append('path')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-099.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-099.md
new file mode 100644
index 0000000000..8955c72ecd
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-099.md
@@ -0,0 +1,352 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca40
+title: Part 99
+challengeType: 0
+dashedName: part-99
+---
+
+# --description--
+
+Set the `d` attribute to your `pieArc` variable. Just like the `d` in your lines, this is an SVG attribute for path elements that describes how to draw things. Your `pieArc` variable will determine what this value is for you.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div svg path')[0].getAttribute('d').length === 94);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+  pieGraphData.append('path')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-100.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-100.md
new file mode 100644
index 0000000000..db5e69b6b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-100.md
@@ -0,0 +1,372 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca41
+title: Part 100
+challengeType: 0
+dashedName: part-100
+---
+
+# --description--
+
+The pie graph is being drawn at the `0, 0` coordinates of the SVG. Back on your `pieGraphData` variable, add an attribute that changes the `transform` to `translate(100, 100)`.
+
+Since the pie chart has a radius of 100, and the SVG is 200 by 200, this will move it so it is centered.
+
+# --hints--
+
+test-text
+
+```js
+const transform = $('.dashboard div svg g')[0].getAttribute('transform');
+assert(/translate\s*\(\s*100\s*,\s*100\s*\)/g.test(transform));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3
+    .select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3
+    .scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3
+    .scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale).ticks(6, '~s');
+
+  const xAxis = d3
+    .axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph
+    .append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph
+    .append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph
+    .append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph
+    .append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph
+    .append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  lineGraph
+    .selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer');
+
+  const rightDashboard = d3.select('.dashboard').append('div');
+
+  const pieGraph = rightDashboard
+    .append('svg')
+    .attr('width', 200)
+    .attr('height', 200);
+
+  const pieArc = d3
+    .arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3
+    .scaleOrdinal()
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie().value(d => d.value);
+
+  const pieGraphData = pieGraph
+    .selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-101.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-101.md
new file mode 100644
index 0000000000..016740db33
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-101.md
@@ -0,0 +1,377 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca42
+title: Part 101
+challengeType: 0
+dashedName: part-101
+---
+
+# --description--
+
+Back at the bottom, where you draw the chart. Use the `attr` function to set the `fill` to a "d function". In the "d function", use your `pieColors` scale to get the color value for the platform(`d.data.key`). So when each platform is passed to your scale, is will get the appropriate color to use as the fill from the scales range.
+
+# --hints--
+
+test-text
+
+```js
+const pathsArr = $('.dashboard div svg g path');
+assert(
+  pathsArr[0].getAttribute('fill') === '#7cd9d1' &&
+    pathsArr[1].getAttribute('fill') === '#f6dd71' &&
+    pathsArr[2].getAttribute('fill') === '#fd9b98'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3
+    .select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3
+    .scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3
+    .scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale).ticks(6, '~s');
+
+  const xAxis = d3
+    .axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph
+    .append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph
+    .append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana');
+
+  const twitterLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph
+    .append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph
+    .append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3
+    .line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph
+    .append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  lineGraph
+    .selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer');
+
+  lineGraph
+    .selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer');
+
+  const rightDashboard = d3.select('.dashboard').append('div');
+
+  const pieGraph = rightDashboard
+    .append('svg')
+    .attr('width', 200)
+    .attr('height', 200);
+
+  const pieArc = d3
+    .arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3
+    .scaleOrdinal()
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie().value(d => d.value);
+
+  const pieGraphData = pieGraph
+    .selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-102.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-102.md
new file mode 100644
index 0000000000..e7d9c7423c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-102.md
@@ -0,0 +1,364 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca43
+title: Part 102
+challengeType: 0
+dashedName: part-102
+---
+
+# --description--
+
+Next, set the `stroke` to `white` and the `stroke-width` to `2`.
+
+# --hints--
+
+test-text
+
+```js
+const pathsArr = $('.dashboard div svg g path');
+assert(
+  pathsArr[0].getAttribute('stroke') === 'white' &&
+    pathsArr[0].getAttribute('stroke-width') == 2
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-103.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-103.md
new file mode 100644
index 0000000000..2e7f2196cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-103.md
@@ -0,0 +1,365 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca44
+title: Part 103
+challengeType: 0
+dashedName: part-103
+---
+
+# --description--
+
+Your chart needs some labels in each slice. On a new line, append `text` elements to your `pieGraphData` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(/pieGraphData\s*\.\s*append\s*\((`|'|")text\1\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-104.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-104.md
new file mode 100644
index 0000000000..0cb9c6cda4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-104.md
@@ -0,0 +1,381 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca47
+title: Part 104
+challengeType: 0
+dashedName: part-104
+---
+
+# --description--
+
+Chain a `text` function to set the text of each pie slice to a percentage. Set the value to a "d function" with curly brackets and leave the function empty for now. It should look like this:
+
+```js
+.text(d => {
+
+})
+```
+
+The method for getting the percent of each slice will take a few steps:
+
+1.  Find the total number of followers for the displayed year
+2.  Divide the followers of a single platform by that total
+3.  Turn it into a string to display
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.append\('text'\)\s*\.text\s*\(\s*d\s*=>\s*\{\s*\}\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-105.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-105.md
new file mode 100644
index 0000000000..9fe69b81a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-105.md
@@ -0,0 +1,383 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca48
+title: Part 105
+challengeType: 0
+dashedName: part-105
+---
+
+# --description--
+
+In the function you just created, create a `const` named `values`. Use the `d3.values` function to get the values of the 2020 followers and set the result to your `values` variable. Here's how to get the values:
+
+```js
+d3.values(data[8].followers)
+```
+
+It will be an array with the values of the followers for the three platforms in 2020.
+
+Note that this "d function" has curly brackets. So you could `console.log(values)` in there to see it's value.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*values\s*=\s*d3\s*\.\s*values\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\);?/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-106.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-106.md
new file mode 100644
index 0000000000..0de087f1cc
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-106.md
@@ -0,0 +1,372 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca49
+title: Part 106
+challengeType: 0
+dashedName: part-106
+---
+
+# --description--
+
+Since you want to find what percent each of those `values` is, you first need to add them all up. `d3.sum` will do that for you. Create a new `const` named `sum` and set it equal to `d3.sum(values)`.
+
+# --hints--
+
+test-text
+
+```js
+assert(/const\s*sum\s*=\s*d3\s*\.\s*sum\s*\(\s*values\s*\)\s*;?/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-107.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-107.md
new file mode 100644
index 0000000000..9663f711d9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-107.md
@@ -0,0 +1,376 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4a
+title: Part 107
+challengeType: 0
+dashedName: part-107
+---
+
+# --description--
+
+Create another variable named `percent` and set it equal to `d.data.value` divided by your `sum` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*percent\s*=\s*d\s*\.\s*data\s*\.\s*value\s*\/\s*sum;?/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+
+
+    })
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-108.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-108.md
new file mode 100644
index 0000000000..2997d10be6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-108.md
@@ -0,0 +1,388 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4b
+title: Part 108
+challengeType: 0
+dashedName: part-108
+---
+
+# --description--
+
+Your percent values are numbers less than one. You will need to multiply it by 100, round of the decimals, and add a `%` sign. Use a template literal to return this to the `text` function:
+
+```js
+${Math.round(percent * 100)}%
+```
+
+Don't forget that you need a `return` statement here since you aren't using an implicit return.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /return\s*`\$\{\s*Math\s*\.\s*round\s*\(\s*percent\s*\*\s*100\s*\)\s*\}%`;?\s*\}\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+
+
+    })
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-109.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-109.md
new file mode 100644
index 0000000000..194c4a19ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-109.md
@@ -0,0 +1,388 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4c
+title: Part 109
+challengeType: 0
+dashedName: part-109
+---
+
+# --description--
+
+The text elements are at the center of the pie graph, you need to use the `centroid` from the D3 arc API to tell them where to go. Add an `attr` function to set the `transform` to a `d` function that returns this template literal: `translate(${ pieArc.centroid(d) })`
+
+The `centroid` function will find the midpoint of each slice for each text element.
+
+# --hints--
+
+test-text
+
+```js
+const transform = $('.dashboard div svg g text')[0]
+  .getAttribute('transform')
+  .replace('translate(', '')
+  .replace(')', '')
+  .split(',');
+assert(transform[0] < 39 && transform[1] > 31);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-110.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-110.md
new file mode 100644
index 0000000000..731a5184b1
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-110.md
@@ -0,0 +1,389 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4d
+title: Part 110
+challengeType: 0
+dashedName: part-110
+---
+
+# --description--
+
+The function you just added, placed the start of the text at the midpoint of each slice. Change the `style` of the text to give it a `text-anchor` of `middle` so the middle of the text is in the middle of the slice.
+
+After that, set the `font` to `10px verdana`.
+
+# --hints--
+
+test-text
+
+```js
+const text = $('.dashboard div svg g text')[0];
+assert(
+  text.style.textAnchor === 'middle' &&
+    text.style.font.toLowerCase() === '10px verdana'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-111.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-111.md
new file mode 100644
index 0000000000..e191bb7684
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-111.md
@@ -0,0 +1,391 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4e
+title: Part 111
+challengeType: 0
+dashedName: part-111
+---
+
+# --description--
+
+The last component you are going to add is a legend to display the name of each platform and the number of followers for the year. Create a new `const` named `legend` and use it to `append` a `table` to your `rightDashboard` variable. This looks similar to the code where you created your `pieGraph` variable.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legend\s*=\s*rightDashboard\s*\.\s*append\s*\(\s*('|"|`)\s*table\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-112.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-112.md
new file mode 100644
index 0000000000..680c56e08b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-112.md
@@ -0,0 +1,394 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca4f
+title: Part 112
+challengeType: 0
+dashedName: part-112
+---
+
+# --description--
+
+Give the table a `width` of `200` and a `height` of `120` using `attr`.
+
+# --hints--
+
+test-text
+
+```js
+const table = $('.dashboard div table')[0];
+assert(
+  table.getAttribute('width') == 200 && table.getAttribute('height') == 120
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-113.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-113.md
new file mode 100644
index 0000000000..c0c7b38cef
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-113.md
@@ -0,0 +1,396 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca50
+title: Part 113
+challengeType: 0
+dashedName: part-113
+---
+
+# --description--
+
+Set the `font` to `12px verdana` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table')[0].style.font.toLowerCase() === '12px verdana'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-114.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-114.md
new file mode 100644
index 0000000000..0492d13020
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-114.md
@@ -0,0 +1,401 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca51
+title: Part 114
+challengeType: 0
+dashedName: part-114
+---
+
+# --description--
+
+Create a new `const` named `legendTitle` and use it to `append` a `thead` to your `legend` variable. `thead` is used with the HTML table element and is for the top row of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legendTitle\s*=\s*legend\s*\.\s*append\s*\(\s*('|"|`)\s*thead\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-115.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-115.md
new file mode 100644
index 0000000000..4d4098f707
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-115.md
@@ -0,0 +1,401 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca52
+title: Part 115
+challengeType: 0
+dashedName: part-115
+---
+
+# --description--
+
+`append` a `tr` element to the selection and then append a `th` element right after it. `tr` is for defining a row of the table, and `th` is for defining the header cells of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th').length === 1);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-116.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-116.md
new file mode 100644
index 0000000000..39ced1543d
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-116.md
@@ -0,0 +1,404 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca53
+title: Part 116
+challengeType: 0
+dashedName: part-116
+---
+
+# --description--
+
+Use the `text` function to set the text of the selection to `2020 followers`.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th').text() === '2020 followers');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-117.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-117.md
new file mode 100644
index 0000000000..bf9e34eda4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-117.md
@@ -0,0 +1,406 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca54
+title: Part 117
+challengeType: 0
+dashedName: part-117
+---
+
+# --description--
+
+Your table is going to have three columns, one for the platform name, one for the color it is using on your dashboard, and a third to display the number of followers. So you want the title to take up all three columns. Set the `colspan` attribute of the `th` to `3` so it spans all three of these columns.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table thead tr th')[0].getAttribute('colspan') == 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+    
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-118.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-118.md
new file mode 100644
index 0000000000..0c3e750347
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-118.md
@@ -0,0 +1,412 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca55
+title: Part 118
+challengeType: 0
+dashedName: part-118
+---
+
+# --description--
+
+Create a new `const` named `legendRows` and use it to `append` a `tbody` element to your `legend` variable similar to how you added the `thead`. `tbody` is for the main content of an HTML table.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const\s*legendRows\s*=\s*legend\s*\.\s*append\s*\(\s*('|"|`)\s*tbody\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+    
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-119.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-119.md
new file mode 100644
index 0000000000..68b03ce851
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-119.md
@@ -0,0 +1,417 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca56
+title: Part 119
+challengeType: 0
+dashedName: part-119
+---
+
+# --description--
+
+Add a `selectAll` function to the selection and pass it the string `tr`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /const legendRows = legend\.append\('tbody\s*'\)\s*\.\s*selectAll\s*\(\s*('|"|`)\s*tr\s*\1\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.selectAll('pieSliceText')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-120.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-120.md
new file mode 100644
index 0000000000..aa30807012
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-120.md
@@ -0,0 +1,417 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca57
+title: Part 120
+challengeType: 0
+dashedName: part-120
+---
+
+# --description--
+
+Use the `data` function to set the data for the rows to an array of your 2020 followers. To get the array use `d3.entries(data[8].followers)`. Remember, this will create an array of key/value pairs of your followers for that year.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  /\.selectAll\('tr'\)\s*\.\s*data\s*\(\s*d3\s*\.\s*entries\s*\(\s*data\s*\[\s*8\s*\]\s*\.\s*followers\s*\)\s*\)/g.test(
+    code
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-121.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-121.md
new file mode 100644
index 0000000000..ee08e49dda
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-121.md
@@ -0,0 +1,418 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca58
+title: Part 121
+challengeType: 0
+dashedName: part-121
+---
+
+# --description--
+
+Add the `enter` and `append` functions to the selection. Pass the string `tr` to the append function to add three table row elements. These elements will be for displaying each platform's name.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-122.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-122.md
new file mode 100644
index 0000000000..777a09d553
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-122.md
@@ -0,0 +1,422 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca59
+title: Part 122
+challengeType: 0
+dashedName: part-122
+---
+
+# --description--
+
+On a new line, `append` a `td` to your `legendRows` variable. `td` is for an individual cell in the row of the table.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-123.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-123.md
new file mode 100644
index 0000000000..562a3d4fd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-123.md
@@ -0,0 +1,426 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5a
+title: Part 123
+challengeType: 0
+dashedName: part-123
+---
+
+# --description--
+
+Use the `text` function to set the text of each `td` to the `key` of each data point by using a "d function" to return `d.key`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td').text() === 'twittertumblrinstagram'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-124.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-124.md
new file mode 100644
index 0000000000..0e33d97bc6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-124.md
@@ -0,0 +1,431 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5b
+title: Part 124
+challengeType: 0
+dashedName: part-124
+---
+
+# --description--
+
+This is the first column of your table. Set the `align` attribute to `right` to align the text to the right of each cell.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[0]
+    .getAttribute('align')
+    .toLowerCase() === 'right'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-125.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-125.md
new file mode 100644
index 0000000000..915e877e04
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-125.md
@@ -0,0 +1,430 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5c
+title: Part 125
+challengeType: 0
+dashedName: part-125
+---
+
+# --description--
+
+On a new line, append another `td` element to your `legendRows` variable. This will be for colored squares in the center column.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 6);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-126.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-126.md
new file mode 100644
index 0000000000..1acfc7b1f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-126.md
@@ -0,0 +1,437 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5d
+title: Part 126
+challengeType: 0
+dashedName: part-126
+---
+
+# --description--
+
+Set the `align` attribute to `center`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[1]
+    .getAttribute('align')
+    .toLowerCase() === 'center'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-127.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-127.md
new file mode 100644
index 0000000000..c2d8ad27c4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-127.md
@@ -0,0 +1,435 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5e
+title: Part 127
+challengeType: 0
+dashedName: part-127
+---
+
+# --description--
+
+Append a `div` element to the selection. Each `div` will be a small square for each color.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td div').length === 3);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-128.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-128.md
new file mode 100644
index 0000000000..7a09ef3ed3
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-128.md
@@ -0,0 +1,438 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca5f
+title: Part 128
+challengeType: 0
+dashedName: part-128
+---
+
+# --description--
+
+Set the `width` to `16px` and the `height` to `16px` using the `style` function.
+
+# --hints--
+
+test-text
+
+```js
+const div = $('.dashboard div table tbody tr td div')[0];
+assert(div.style.width == '16px' && div.style.height === '16px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-129.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-129.md
new file mode 100644
index 0000000000..992537b3e6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-129.md
@@ -0,0 +1,443 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca60
+title: Part 129
+challengeType: 0
+dashedName: part-129
+---
+
+# --description--
+
+Using the `style` function again, set the `background-color` of each div to a "d function". Using the "d function", pass the key(`d.key`) of each data point to your `pieColors` scale so it knows what color to use.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td div')[0].style.backgroundColor ===
+    'rgb(124, 217, 209)'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-130.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-130.md
new file mode 100644
index 0000000000..2cb143184e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-130.md
@@ -0,0 +1,443 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca61
+title: Part 130
+challengeType: 0
+dashedName: part-130
+---
+
+# --description--
+
+On a new line, append another `td` to the `legendRows` variable for the last group of items. It will display the number of followers for each platform.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td').length === 9);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-131.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-131.md
new file mode 100644
index 0000000000..470b5a68e2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-131.md
@@ -0,0 +1,446 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca62
+title: Part 131
+challengeType: 0
+dashedName: part-131
+---
+
+# --description--
+
+Set the `text` to a "d function" that returns the value(`d.value`) for each data point.
+
+# --hints--
+
+test-text
+
+```js
+assert($('.dashboard div table tbody tr td')[2].innerHTML === '2845');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-132.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-132.md
new file mode 100644
index 0000000000..cb3e63813d
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-132.md
@@ -0,0 +1,450 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca63
+title: Part 132
+challengeType: 0
+dashedName: part-132
+---
+
+# --description--
+
+Set the `align` attribute to `left` for this selection.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  $('.dashboard div table tbody tr td')[2]
+    .getAttribute('align')
+    .toLowerCase() === 'left'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-133.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-133.md
new file mode 100644
index 0000000000..0aa86bfb00
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-133.md
@@ -0,0 +1,448 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca64
+title: Part 133
+challengeType: 0
+dashedName: part-133
+---
+
+# --description--
+
+The legend has all the information is needs, but the title looks a little misaligned. Go to where you created your `legendTitle` variable and set the `position` to `relative` and the `left` to `20px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const th = $('.dashboard div table thead tr th')[0];
+assert(th.style.position === 'relative' && th.style.left === '20px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-134.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-134.md
new file mode 100644
index 0000000000..1daa93dc49
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-134.md
@@ -0,0 +1,453 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca65
+title: Part 134
+challengeType: 0
+dashedName: part-134
+---
+
+# --description--
+
+The legend and pie graph look a little off as well. Go to where you created your `legend` variable and add a `position` of `relative` and a `top` of `30px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const table = $('.dashboard div table')[0];
+assert(table.style.position === 'relative' && table.style.top === '30px');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>  
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-135.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-135.md
new file mode 100644
index 0000000000..3acf263d2b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-135.md
@@ -0,0 +1,464 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca66
+title: Part 135
+challengeType: 0
+dashedName: part-135
+---
+
+# --description--
+
+Lastly, where you created your `pieGraph` variable, add a `position` of `relative` and a `left` of `20px` using `style` functions.
+
+# --hints--
+
+test-text
+
+```js
+const pieGraph = $('.dashboard div svg')[0];
+assert(
+  pieGraph.style.position === 'relative' && pieGraph.style.left === '20px'
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+
+
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+</script>  
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+
+
+
+
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-136.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-136.md
new file mode 100644
index 0000000000..6ab6c4a6be
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-136.md
@@ -0,0 +1,476 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca67
+title: Part 136
+challengeType: 0
+dashedName: part-136
+---
+
+# --description--
+
+Finally! You have all the elements displayed and they look good. The last thing you will do is make it so you can see the data from whatever year you want.
+
+Wrap all the code in the script you've been working with in a function named `drawDashboard` and give it a parameter named `year`. Then, at the bottom of the script, call the function you created and pass it the number `2020`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  typeof drawDashboard === 'function' &&
+    /<\/script>\s*<script>\s*function\s*drawDashboard\s*\(\s*year\s*\)\s*\{/g.test(
+      code
+    ) &&
+    /\}\s*drawDashboard\s*\(\s*2020\s*\)\s*;?\s*<\/script>\s*$/g.test(code)
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+
+
+  const svgMargin = 70,
+    svgWidth = 700,
+    svgHeight = 500,
+    twitterColor = '#7cd9d1',
+    tumblrColor = '#f6dd71',
+    instagramColor = '#fd9b98';
+
+  const lineGraph = d3.select('.dashboard')
+    .append('svg')
+    .attr('width', svgWidth)
+    .attr('height', svgHeight);
+
+  const yScale = d3.scaleLinear()
+    .domain([0, 5000])
+    .range([svgHeight - svgMargin, svgMargin]);
+
+  const xScale = d3.scaleLinear()
+    .domain([2012, 2020])
+    .range([svgMargin, svgWidth - svgMargin]);
+
+  const yAxis = d3.axisLeft(yScale)
+    .ticks(6, '~s');
+
+  const xAxis = d3.axisBottom(xScale)
+    .tickFormat(d3.format(''))
+    .tickPadding(10);
+
+  lineGraph.append('g')
+    .call(yAxis)
+    .attr('transform', `translate(${svgMargin}, 0)`)
+    .style('font', '10px verdana');
+
+  lineGraph.append('g')
+    .call(xAxis)
+    .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+    .selectAll('text')
+    .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+    .style('text-anchor', 'end')
+    .style('cursor', 'pointer')
+    .style('font', '10px verdana')
+
+  const twitterLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.twitter));
+
+  lineGraph.append('path')
+    .attr('d', twitterLine(data))
+    .attr('stroke', twitterColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const tumblrLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.tumblr));
+
+  lineGraph.append('path')
+    .attr('d', tumblrLine(data))
+    .attr('stroke', tumblrColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+
+  const instagramLine = d3.line()
+    .x(d => xScale(d.year))
+    .y(d => yScale(d.followers.instagram));
+
+  lineGraph.append('path')
+    .attr('d', instagramLine(data))
+    .attr('stroke', instagramColor)
+    .attr('stroke-width', 3)
+    .attr('fill', 'transparent');
+    
+  lineGraph.selectAll('twitter-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.twitter))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', twitterColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('tumblr-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.tumblr))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', tumblrColor)
+    .style('cursor', 'pointer')
+
+  lineGraph.selectAll('instagram-circles')
+    .data(data)
+    .enter()
+    .append('circle')
+    .attr('cx', d => xScale(d.year))
+    .attr('cy', d => yScale(d.followers.instagram))
+    .attr('r', 6)
+    .attr('fill', 'white')
+    .attr('stroke', instagramColor)
+    .style('cursor', 'pointer')
+
+  const rightDashboard = d3.select('.dashboard')
+    .append('div');
+
+  const pieGraph = rightDashboard.append('svg')
+    .attr('width', 200)
+    .attr('height', 200)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const pieArc = d3.arc()
+    .outerRadius(100)
+    .innerRadius(0);
+
+  const pieColors = d3.scaleOrdinal()  
+    .domain(data[8].followers)
+    .range([twitterColor, tumblrColor, instagramColor]);
+
+  const pie = d3.pie()
+    .value(d => d.value);
+    
+  const pieGraphData = pieGraph.selectAll('pieSlices')
+    .data(pie(d3.entries(data[8].followers)))
+    .enter()
+    .append('g')
+    .attr('transform', 'translate(100, 100)');
+
+  pieGraphData.append('path')
+    .attr('d', pieArc)
+    .attr('fill', d => pieColors(d.data.key))
+    .attr('stroke', 'white')
+    .attr('stroke-width', 2);
+
+  pieGraphData.append('text')
+    .text(d => {
+      const values = d3.values(data[8].followers);
+      const sum = d3.sum(values);
+      const percent = d.data.value/sum;
+      return `${ Math.round(percent*100) }%`;
+    })
+    .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+    .style('text-anchor', 'middle')
+    .style('font', '10px verdana');
+
+  const legend = rightDashboard.append('table')
+    .attr('width', 200)
+    .attr('height', 120)
+    .style('font', '12px verdana')
+    .style('position', 'relative')
+    .style('top', '30px');
+
+  const legendTitle = legend.append('thead')
+    .append('tr')
+    .append('th')
+    .text('2020 followers')
+    .attr('colspan', 3)
+    .style('position', 'relative')
+    .style('left', '20px');
+
+  const legendRows = legend.append('tbody')
+    .selectAll('tr')
+    .data(d3.entries(data[8].followers))
+    .enter()
+    .append('tr');
+
+  legendRows.append('td')  
+    .text(d => d.key)
+    .attr('align', 'right');
+
+  legendRows.append('td')
+    .attr('align', 'center')
+    .append('div')
+    .style('width', '16px')
+    .style('height', '16px')
+    .style('background-color', d => pieColors(d.key))
+
+  legendRows.append('td')
+    .text(d => d.value)
+    .attr('align', 'left');
+
+
+
+
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-137.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-137.md
new file mode 100644
index 0000000000..736bc47dd7
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-137.md
@@ -0,0 +1,484 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca68
+title: Part 137
+challengeType: 0
+dashedName: part-137
+---
+
+# --description--
+
+At the top of the function create a new `const` named `index`. You are going to use it to find the item in the `data` array with the year that is passed to the function.
+
+Use JavaScript's `findIndex` function to set your `index` variable to the index of the item in the `data` array where the year is the same as the year passed to your `drawDashboard` function. Here's an example:
+
+```js
+array.findIndex(d => 
+  // find the index where the year passed to 
+  // drawDashboard equals the year of the array
+)
+```
+
+After this, you will be able to use `data[index]` to get that item in the array.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /var index = data.findIndex\(function \(d\) \{\s*return (year === d\.year|d.year === year);\s*\}\);/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-138.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-138.md
new file mode 100644
index 0000000000..763f870eeb
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-138.md
@@ -0,0 +1,479 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6a
+title: Part 138
+challengeType: 0
+dashedName: part-138
+---
+
+# --description--
+
+There are four places in the file where you used `data[8]` to set data to the year 2020. Change all five of them to `data[index]` so you can pass in any year to the function to display the data from that year.
+
+The five spots are:
+
+1.  The `domain` for `pieColors`.
+2.  The `data` for `pieGraphData`.
+3.  The `text` for your pie slice text.
+4.  The `data` for your `legendRows`.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  !/data\[8\]/g.test(code) && code.match(/data\s*\[\s*index\s*\]/g).length === 4
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[8].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[8].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[8].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[8].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-139.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-139.md
new file mode 100644
index 0000000000..fa2774a18d
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-139.md
@@ -0,0 +1,485 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6b
+title: Part 139
+challengeType: 0
+dashedName: part-139
+---
+
+# --description--
+
+Go to where you `call` the `xAxis` and create a `mouseover` event for the labels. Chain the `on` function to them, pass it the string `mouseover`, and give it a value of a "d function" that calls `drawDashboard` with `d` as the argument. It will look like this:
+
+```js
+.on('mouseover', d => drawDashboard(d))
+```
+
+So now, when you hover a label, the function will be called with the year that is being hovered.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\);\s*\}\)/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-140.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-140.md
new file mode 100644
index 0000000000..de5fea91df
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-140.md
@@ -0,0 +1,478 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6c
+title: Part 140
+challengeType: 0
+dashedName: part-140
+---
+
+# --description--
+
+There's a problem, each time you hover a label it adds all the elements to the container again. If you empty the container at the top of the function, it will redraw them where they need to be.
+
+Go back to the top of the function and use `d3.select` to select the `.dashboard` element and chain the `html` function to it with an empty string as it parameter. Empty means no spaces.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(/d3\.select\(('|"|`)\.dashboard\1\)\.html\(('|"|`)\2\)/g.test(script));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+
+
+
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-141.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-141.md
new file mode 100644
index 0000000000..0e35de8505
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-141.md
@@ -0,0 +1,489 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6d
+title: Part 141
+challengeType: 0
+dashedName: part-141
+---
+
+# --description--
+
+Now when you hover a label, you can see the data for the different years.
+
+Where you created the `text` elements for the x-axis labels, change the `font` to `bold 10px verdana` for the currently displayed year.
+
+To do this, create a "d function" in the `font` value area and return the above sting if `d` equals `year`. Otherwise, return the string that is currently there (`10px verdana`). It's easiest to use a ternary operator for this.
+
+Here's a hint:
+
+```js
+.style('font', d => d === year ? )
+```
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  Object.values($('.dashboard svg g text')).filter(
+    (el) => el.style && el.style.font.toLowerCase() === 'bold 10px verdana'
+  ).length === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', '10px verdana')
+
+
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+  
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-142.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-142.md
new file mode 100644
index 0000000000..ca70f946f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-142.md
@@ -0,0 +1,481 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6e
+title: Part 142
+challengeType: 0
+dashedName: part-142
+---
+
+# --description--
+
+Create another `mouseover` event for when you hover one of the `twitter-circles`. It will look like the other `mouseover` event you created except the `drawDashboard` function will take `d.year` instead of `d`.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\.year\);\s*\}\)/g.test(
+    script
+  )
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+
+  
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-143.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-143.md
new file mode 100644
index 0000000000..adb5ee8ab4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-143.md
@@ -0,0 +1,483 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca6f
+title: Part 143
+challengeType: 0
+dashedName: part-143
+---
+
+# --description--
+
+Similar to how you made the text bold for the label of the displayed year; change the `fill` of the `twitter-circles` to your `twitterColor` for the currently displayed year. To do this, use a "d function" that returns the `twitterColor` when `d.year` equals `year`, and leave it `white` if it doesn't.
+
+# --hints--
+
+test-text
+
+```js
+assert(
+  Object.values($('.dashboard svg circle')).filter(
+    (el) => el.getAttribute && el.getAttribute('fill') === '#7cd9d1'
+  ).length === 1
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-144.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-144.md
new file mode 100644
index 0000000000..26ea98aa97
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-144.md
@@ -0,0 +1,490 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca70
+title: Part 144
+challengeType: 0
+dashedName: part-144
+---
+
+# --description--
+
+Add a `mouseover` event to the `tumblr-circles` and `instagram-circles` in the same way that you did for the `twitter-circles`.
+
+After that, you will be able hover any of the circles or year labels to get the information for that year.
+
+# --hints--
+
+test-text
+
+```js
+const script = $('.dashboard').siblings('script')[1].innerHTML;
+assert(
+  script.match(
+    /\.on\(('|"|`)mouseover\1, function \(d\) \{\s*return drawDashboard\(d\.year\);\s*\}\)/g
+  ).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+
+
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+
+
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-145.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-145.md
new file mode 100644
index 0000000000..52d84a5440
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-145.md
@@ -0,0 +1,494 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca71
+title: Part 145
+challengeType: 0
+dashedName: part-145
+---
+
+# --description--
+
+Change the `fill` of the `tumblr-circles` and `instagram-circles` to use a "d function" that returns their respective color variables when `d.year` equals `year`, leave it `white` when they don't. This is similar to how you set the fill of the Twitter circles.
+
+Then, all of the circles will get filled in for the currently displayed year.
+
+# --hints--
+
+test-text
+
+```js
+const circles = Object.values($('.dashboard svg circle'));
+assert(
+  circles.filter(
+    (el) =>
+      el.getAttribute &&
+      (el.getAttribute('fill') === '#7cd9d1' ||
+        el.getAttribute('fill') === '#f6dd71' ||
+        el.getAttribute('fill') === '#fd9b98')
+  ).length === 3
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', 'white')
+
+
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-146.md b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-146.md
new file mode 100644
index 0000000000..421629433d
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/d3-dashboard/part-146.md
@@ -0,0 +1,483 @@
+---
+id: 5d8a4cfbe6b6180ed9a1ca72
+title: Part 146
+challengeType: 0
+dashedName: part-146
+---
+
+# --description--
+
+The last thing is that the legend title always shows 2020. Change the `text` of the `legendTitle` to a template literal that shows the currently displayed year followed by a space and `followers`.
+
+That's it, your dashboard is finished! Don't forget to admire your hard work.
+
+# --hints--
+
+test-text
+
+```js
+assert(/\.text\s*\(\s*`\s*\$\{\s*year\s*\} followers`\s*\)/g.test(code));
+```
+
+# --seed--
+
+## --before-user-code--
+
+```html
+<!DOCTYPE html>
+<html>
+  <head>
+    <title>D3 Dashboard</title>
+    <style>
+      body {
+        background-color: #ccc;
+        padding: 100px 10px;
+      }
+
+      .dashboard {
+        width: 980px;
+        height: 500px;
+        background-color: white;
+        box-shadow: 5px 5px 5px 5px #888;
+        margin: auto;
+        display: flex;
+        align-items: center;
+      }
+    </style>
+  </head>
+
+  <body>
+    <div class="dashboard"></div>
+  </body>
+</html>
+```
+
+## --seed-contents--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text('2020 followers')
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
+
+# --solutions--
+
+```html
+<script>
+  const data = [ 
+    { year: 2012, followers: { twitter: 2594, tumblr:  401, instagram:   83 }},
+    { year: 2013, followers: { twitter: 3049, tumblr:  440, instagram:  192 }},
+    { year: 2014, followers: { twitter: 3511, tumblr:  415, instagram:  511 }},
+    { year: 2015, followers: { twitter: 3619, tumblr:  492, instagram: 1014 }},
+    { year: 2016, followers: { twitter: 4046, tumblr:  543, instagram: 2066 }},
+    { year: 2017, followers: { twitter: 3991, tumblr:  701, instagram: 3032 }},
+    { year: 2018, followers: { twitter: 3512, tumblr: 1522, instagram: 4512 }},
+    { year: 2019, followers: { twitter: 3274, tumblr: 1989, instagram: 4715 }},
+    { year: 2020, followers: { twitter: 2845, tumblr: 2040, instagram: 4801 }}
+  ];
+</script>
+<script>
+  function drawDashboard(year) {
+    d3.select('.dashboard').html('');
+    const index = data.findIndex(d => d.year === year);
+
+    const svgMargin = 70,
+      svgWidth = 700,
+      svgHeight = 500,
+      twitterColor = '#7cd9d1',
+      tumblrColor = '#f6dd71',
+      instagramColor = '#fd9b98';
+
+    const lineGraph = d3.select('.dashboard')
+      .append('svg')
+      .attr('width', svgWidth)
+      .attr('height', svgHeight);
+
+    const yScale = d3.scaleLinear()
+      .domain([0, 5000])
+      .range([svgHeight - svgMargin, svgMargin]);
+
+    const xScale = d3.scaleLinear()
+      .domain([2012, 2020])
+      .range([svgMargin, svgWidth - svgMargin]);
+
+    const yAxis = d3.axisLeft(yScale)
+      .ticks(6, '~s');
+
+    const xAxis = d3.axisBottom(xScale)
+      .tickFormat(d3.format(''))
+      .tickPadding(10);
+
+    lineGraph.append('g')
+      .call(yAxis)
+      .attr('transform', `translate(${svgMargin}, 0)`)
+      .style('font', '10px verdana');
+
+    lineGraph.append('g')
+      .call(xAxis)
+      .attr('transform', `translate(0, ${svgHeight - svgMargin})`)
+      .selectAll('text')
+      .style('transform', 'translate(-12px, 0) rotate(-50deg)')
+      .style('text-anchor', 'end')
+      .style('cursor', 'pointer')
+      .style('font', d => d === year ? 'bold 10px verdana' : '10px verdana')
+      .on('mouseover', d => drawDashboard(d));
+
+    const twitterLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.twitter));
+
+    lineGraph.append('path')
+      .attr('d', twitterLine(data))
+      .attr('stroke', twitterColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const tumblrLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.tumblr));
+
+    lineGraph.append('path')
+      .attr('d', tumblrLine(data))
+      .attr('stroke', tumblrColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+
+    const instagramLine = d3.line()
+      .x(d => xScale(d.year))
+      .y(d => yScale(d.followers.instagram));
+
+    lineGraph.append('path')
+      .attr('d', instagramLine(data))
+      .attr('stroke', instagramColor)
+      .attr('stroke-width', 3)
+      .attr('fill', 'transparent');
+      
+    lineGraph.selectAll('twitter-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.twitter))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? twitterColor : 'white')
+      .attr('stroke', twitterColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('tumblr-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.tumblr))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? tumblrColor : 'white')
+      .attr('stroke', tumblrColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    lineGraph.selectAll('instagram-circles')
+      .data(data)
+      .enter()
+      .append('circle')
+      .attr('cx', d => xScale(d.year))
+      .attr('cy', d => yScale(d.followers.instagram))
+      .attr('r', 6)
+      .attr('fill', d => d.year === year ? instagramColor : 'white')
+      .attr('stroke', instagramColor)
+      .style('cursor', 'pointer')
+      .on('mouseover', d => drawDashboard(d.year));
+
+    const rightDashboard = d3.select('.dashboard')
+      .append('div');
+
+    const pieGraph = rightDashboard.append('svg')
+      .attr('width', 200)
+      .attr('height', 200)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const pieArc = d3.arc()
+      .outerRadius(100)
+      .innerRadius(0);
+
+    const pieColors = d3.scaleOrdinal()  
+      .domain(data[index].followers)
+      .range([twitterColor, tumblrColor, instagramColor]);
+
+    const pie = d3.pie()
+      .value(d => d.value);
+      
+    const pieGraphData = pieGraph.selectAll('pieSlices')
+      .data(pie(d3.entries(data[index].followers)))
+      .enter()
+      .append('g')
+      .attr('transform', 'translate(100, 100)');
+
+    pieGraphData.append('path')
+      .attr('d', pieArc)
+      .attr('fill', d => pieColors(d.data.key))
+      .attr('stroke', 'white')
+      .attr('stroke-width', 2);
+
+    pieGraphData.append('text')
+      .text(d => {
+        const values = d3.values(data[index].followers);
+        const sum = d3.sum(values);
+        const percent = d.data.value/sum;
+        return `${ Math.round(percent*100) }%`;
+      })
+      .attr('transform', d => `translate(${pieArc.centroid(d)})`)
+      .style('text-anchor', 'middle')
+      .style('font', '10px verdana');
+
+    const legend = rightDashboard.append('table')
+      .attr('width', 200)
+      .attr('height', 120)
+      .style('font', '12px verdana')
+      .style('position', 'relative')
+      .style('top', '30px');
+
+    const legendTitle = legend.append('thead')
+      .append('tr')
+      .append('th')
+      .text(`${year} followers`)
+
+
+      .attr('colspan', 3)
+      .style('position', 'relative')
+      .style('left', '20px');
+
+    const legendRows = legend.append('tbody')
+      .selectAll('tr')
+      .data(d3.entries(data[index].followers))
+      .enter()
+      .append('tr');
+
+    legendRows.append('td')  
+      .text(d => d.key)
+      .attr('align', 'right');
+
+    legendRows.append('td')
+      .attr('align', 'center')
+      .append('div')
+      .style('width', '16px')
+      .style('height', '16px')
+      .style('background-color', d => pieColors(d.key))
+
+    legendRows.append('td')
+      .text(d => d.value)
+      .attr('align', 'left');
+  }
+
+  drawDashboard(2020);
+</script>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
new file mode 100644
index 0000000000..33794d33d4
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-bar-chart.md
@@ -0,0 +1,53 @@
+---
+id: bd7168d8c242eddfaeb5bd13
+title: Visualize Data with a Bar Chart
+challengeType: 3
+forumTopicId: 301464
+dashedName: visualize-data-with-a-bar-chart
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/GrZVaM>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My chart should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My chart should have a `g` element x-axis with a corresponding `id="x-axis"`.
+
+**User Story #3:** My chart should have a `g` element y-axis with a corresponding `id="y-axis"`.
+
+**User Story #4:** Both axes should contain multiple tick labels, each with a corresponding `class="tick"`.
+
+**User Story #5:** My chart should have a `rect` element for each data point with a corresponding `class="bar"` displaying the data.
+
+**User Story #6:** Each bar should have the properties `data-date` and `data-gdp` containing `date` and `GDP` values.
+
+**User Story #7:** The bar elements' `data-date` properties should match the order of the provided data.
+
+**User Story #8:** The bar elements' `data-gdp` properties should match the order of the provided data.
+
+**User Story #9:** Each bar element's height should accurately represent the data's corresponding `GDP`.
+
+**User Story #10:** The `data-date` attribute and its corresponding bar element should align with the corresponding value on the x-axis.
+
+**User Story #11:** The `data-gdp` attribute and its corresponding bar element should align with the corresponding value on the y-axis.
+
+**User Story #12:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #13:** My tooltip should have a `data-date` property that corresponds to the `data-date` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/GDP-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`.
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
new file mode 100644
index 0000000000..65592f0262
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-choropleth-map.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fa6367417b2b2512bbf
+title: Visualize Data with a Choropleth Map
+challengeType: 3
+forumTopicId: 301465
+dashedName: visualize-data-with-a-choropleth-map
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/EZKqza>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My choropleth should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My choropleth should have a description element with a corresponding `id="description"`.
+
+**User Story #3:** My choropleth should have counties with a corresponding `class="county"` that represent the data.
+
+**User Story #4:** There should be at least 4 different fill colors used for the counties.
+
+**User Story #5:** My counties should each have `data-fips` and `data-education` properties containing their corresponding `fips` and `education` values.
+
+**User Story #6:** My choropleth should have a county for each provided data point.
+
+**User Story #7:** The counties should have `data-fips` and `data-education` values that match the sample data.
+
+**User Story #8:** My choropleth should have a legend with a corresponding `id="legend"`.
+
+**User Story #9:** There should be at least 4 different fill colors used for the legend.
+
+**User Story #10:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #11:** My tooltip should have a `data-education` property that corresponds to the `data-education` of the active area.
+
+Here are the datasets you will need to complete this project:  
+
+-   **US Education Data:**`https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/for_user_education.json`
+-   **US County Data:**`https://cdn.freecodecamp.org/testable-projects-fcc/data/choropleth_map/counties.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
new file mode 100644
index 0000000000..6a8ea226fb
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-heat-map.md
@@ -0,0 +1,61 @@
+---
+id: bd7188d8c242eddfaeb5bd13
+title: Visualize Data with a Heat Map
+challengeType: 3
+forumTopicId: 301466
+dashedName: visualize-data-with-a-heat-map
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JEXgeY>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My heat map should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My heat map should have a description with a corresponding `id="description"`.
+
+**User Story #3:** My heat map should have an x-axis with a corresponding `id="x-axis"`.
+
+**User Story #4:** My heat map should have a y-axis with a corresponding `id="y-axis"`.
+
+**User Story #5:** My heat map should have `rect` elements with a `class="cell"` that represent the data.
+
+**User Story #6:** There should be at least 4 different fill colors used for the cells.
+
+**User Story #7:** Each cell will have the properties `data-month`, `data-year`, `data-temp` containing their corresponding `month`, `year`, and `temperature` values.
+
+**User Story #8:** The `data-month`, `data-year` of each cell should be within the range of the data.
+
+**User Story #9:** My heat map should have cells that align with the corresponding month on the y-axis.
+
+**User Story #10:** My heat map should have cells that align with the corresponding year on the x-axis.
+
+**User Story #11:** My heat map should have multiple tick labels on the y-axis with the full month name.
+
+**User Story #12:** My heat map should have multiple tick labels on the x-axis with the years between 1754 and 2015.
+
+**User Story #13:** My heat map should have a legend with a corresponding `id="legend"`.
+
+**User Story #14:** My legend should contain `rect` elements.
+
+**User Story #15:** The `rect` elements in the legend should use at least 4 different fill colors.
+
+**User Story #16:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #17:** My tooltip should have a `data-year` property that corresponds to the `data-year` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/global-temperature.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
new file mode 100644
index 0000000000..03d20ab5d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-scatterplot-graph.md
@@ -0,0 +1,57 @@
+---
+id: bd7178d8c242eddfaeb5bd13
+title: Visualize Data with a Scatterplot Graph
+challengeType: 3
+forumTopicId: 301467
+dashedName: visualize-data-with-a-scatterplot-graph
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bgpXyK>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** I can see a title element that has a corresponding `id="title"`.
+
+**User Story #2:** I can see an x-axis that has a corresponding `id="x-axis"`.
+
+**User Story #3:** I can see a y-axis that has a corresponding `id="y-axis"`.
+
+**User Story #4:** I can see dots, that each have a class of `dot`, which represent the data being plotted.
+
+**User Story #5:** Each dot should have the properties `data-xvalue` and `data-yvalue` containing their corresponding `x` and `y` values.
+
+**User Story #6:** The `data-xvalue` and `data-yvalue` of each dot should be within the range of the actual data and in the correct data format. For `data-xvalue`, integers (full years) or `Date` objects are acceptable for test evaluation. For `data-yvalue` (minutes), use `Date` objects.
+
+**User Story #7:** The `data-xvalue` and its corresponding dot should align with the corresponding point/value on the x-axis.
+
+**User Story #8:** The `data-yvalue` and its corresponding dot should align with the corresponding point/value on the y-axis.
+
+**User Story #9:** I can see multiple tick labels on the y-axis with `%M:%S` time format.
+
+**User Story #10:** I can see multiple tick labels on the x-axis that show the year.
+
+**User Story #11:** I can see that the range of the x-axis labels are within the range of the actual x-axis data.
+
+**User Story #12:** I can see that the range of the y-axis labels are within the range of the actual y-axis data.
+
+**User Story #13:** I can see a legend containing descriptive text that has `id="legend"`.
+
+**User Story #14:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #15:** My tooltip should have a `data-year` property that corresponds to the `data-xvalue` of the active area.
+
+Here is the dataset you will need to complete this project: `https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/cyclist-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
new file mode 100644
index 0000000000..0409447ea7
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-projects/visualize-data-with-a-treemap-diagram.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fa6367417b2b2512bc0
+title: Visualize Data with a Treemap Diagram
+challengeType: 3
+forumTopicId: 301468
+dashedName: visualize-data-with-a-treemap-diagram
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KaNGNR>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story) and get all of the tests to pass. Give it your own personal style.
+
+You can use HTML, JavaScript, CSS, and the D3 svg-based visualization library. The tests require axes to be generated using the D3 axis property, which automatically generates ticks along the axis. These ticks are required for passing the D3 tests because their positions are used to determine alignment of graphed elements. You will find information about generating axes at <https://github.com/d3/d3/blob/master/API.md#axes-d3-axis>. Required (non-virtual) DOM elements are queried on the moment of each test. If you use a frontend framework (like Vue for example), the test results may be inaccurate for dynamic content. We hope to accommodate them eventually, but these frameworks are not currently supported for D3 projects.
+
+**User Story #1:** My tree map should have a title with a corresponding `id="title"`.
+
+**User Story #2:** My tree map should have a description with a corresponding `id="description"`.
+
+**User Story #3:** My tree map should have `rect` elements with a corresponding `class="tile"` that represent the data.
+
+**User Story #4:** There should be at least 2 different fill colors used for the tiles.
+
+**User Story #5:** Each tile should have the properties `data-name`, `data-category`, and `data-value` containing their corresponding `name`, `category`, and `value`.
+
+**User Story #6:** The area of each tile should correspond to the `data-value` amount: tiles with a larger `data-value` should have a bigger area.
+
+**User Story #7:** My tree map should have a legend with corresponding `id="legend"`.
+
+**User Story #8:** My legend should have `rect` elements with a corresponding `class="legend-item"`.
+
+**User Story #9:** The `rect` elements in the legend should use at least 2 different fill colors.
+
+**User Story #10:** I can mouse over an area and see a tooltip with a corresponding `id="tooltip"` which displays more information about the area.
+
+**User Story #11:** My tooltip should have a `data-value` property that corresponds to the `data-value` of the active area.
+
+For this project you can use any of the following datasets:  
+
+-   **Kickstarter Pledges:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/kickstarter-funding-data.json`
+-   **Movie Sales:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/movie-data.json`
+-   **Video Game Sales:** `https://cdn.freecodecamp.org/testable-projects-fcc/data/tree_map/video-game-sales-data.json`
+
+You can build your project by <a href='https://codepen.io/pen?template=MJjpwO' target='_blank' rel='nofollow'>using this CodePen template</a> and clicking `Save` to create your own pen. Or you can use this CDN link to run the tests in any environment you like: `https://cdn.freecodecamp.org/testable-projects-fcc/v1/bundle.js`
+
+Once you're done, submit the URL to your working project with all its tests passing.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
new file mode 100644
index 0000000000..beb4f34992
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-hover-effect-to-a-d3-element.md
@@ -0,0 +1,118 @@
+---
+id: 587d7faa367417b2b2512bd4
+title: Add a Hover Effect to a D3 Element
+challengeType: 6
+forumTopicId: 301469
+dashedName: add-a-hover-effect-to-a-d3-element
+---
+
+# --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 `attr()` method. Then the `:hover` pseudo-class for your new class holds the style rules for any hover effects.
+
+# --instructions--
+
+Use the `attr()` method to add a class of `bar` to all the `rect` elements. This changes the `fill` color of the bar to brown when you mouse over it.
+
+# --hints--
+
+Your `rect` elements should have a class of `bar`.
+
+```js
+assert($('rect').attr('class').trim().split(/\s+/g).includes('bar'));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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
+       .attr('class', 'bar')
+       // 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>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
new file mode 100644
index 0000000000..28ee20400f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-a-tooltip-to-a-d3-element.md
@@ -0,0 +1,175 @@
+---
+id: 587d7faa367417b2b2512bd6
+title: Add a Tooltip to a D3 Element
+challengeType: 6
+forumTopicId: 301470
+dashedName: add-a-tooltip-to-a-d3-element
+---
+
+# --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 `title` element.
+
+`title` pairs with the `text()` method to dynamically add data to the bars.
+
+# --instructions--
+
+Append a `title` element under each `rect` node. Then call the `text()` method with a callback function so the text displays the data value.
+
+# --hints--
+
+Your code should have 9 `title` elements.
+
+```js
+assert($('title').length == 9);
+```
+
+The first `title` element should have tooltip text of `12`.
+
+```js
+assert($('title').eq(0).text() == '12');
+```
+
+The second `title` element should have tooltip text of `31`.
+
+```js
+assert($('title').eq(1).text() == '31');
+```
+
+The third `title` element should have tooltip text of `22`.
+
+```js
+assert($('title').eq(2).text() == '22');
+```
+
+The fourth `title` element should have tooltip text of `17`.
+
+```js
+assert($('title').eq(3).text() == '17');
+```
+
+The fifth `title` element should have tooltip text of `25`.
+
+```js
+assert($('title').eq(4).text() == '25');
+```
+
+The sixth `title` element should have tooltip text of `18`.
+
+```js
+assert($('title').eq(5).text() == '18');
+```
+
+The seventh `title` element should have tooltip text of `29`.
+
+```js
+assert($('title').eq(6).text() == '29');
+```
+
+The eighth `title` element should have tooltip text of `14`.
+
+```js
+assert($('title').eq(7).text() == '14');
+```
+
+The ninth `title` element should have tooltip text of `9`.
+
+```js
+assert($('title').eq(8).text() == '9');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+       .append("title")
+       .text((d) => d)
+       
+
+    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>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
new file mode 100644
index 0000000000..f8ad572913
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-attributes-to-the-circle-elements.md
@@ -0,0 +1,211 @@
+---
+id: 587d7fab367417b2b2512bd8
+title: Add Attributes to the Circle Elements
+challengeType: 6
+forumTopicId: 301471
+dashedName: add-attributes-to-the-circle-elements
+---
+
+# --description--
+
+The last challenge created the `circle` elements for each point in the `dataset`, and appended them to the SVG canvas. But D3 needs more information about the position and size of each `circle` to display them correctly.
+
+A `circle` in SVG has three main attributes. The `cx` and `cy` attributes are the coordinates. They tell D3 where to position the *center* of the shape on the SVG canvas. The radius (`r` attribute) gives the size of the `circle`.
+
+Just like the `rect` `y` coordinate, the `cy` attribute for a `circle` 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 `data(dataset)` run once per item in `dataset`. The `d` parameter in the callback function refers to the current item in `dataset`, which is an array for each point. You use bracket notation, like `d[0]`, to access the values in that array.
+
+# --instructions--
+
+Add `cx`, `cy`, and `r` attributes to the `circle` elements. The `cx` value should be the first number in the array for each item in `dataset`. The `cy` 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 `r` value should be `5` for all circles.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+The first `circle` element should have a `cx` value of `34`, a `cy` value of `422`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(0).attr('cx') == '34' &&
+    $('circle').eq(0).attr('cy') == '422' &&
+    $('circle').eq(0).attr('r') == '5'
+);
+```
+
+The second `circle` element should have a `cx` value of `109`, a `cy` value of `220`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(1).attr('cx') == '109' &&
+    $('circle').eq(1).attr('cy') == '220' &&
+    $('circle').eq(1).attr('r') == '5'
+);
+```
+
+The third `circle` element should have a `cx` value of `310`, a `cy` value of `380`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(2).attr('cx') == '310' &&
+    $('circle').eq(2).attr('cy') == '380' &&
+    $('circle').eq(2).attr('r') == '5'
+);
+```
+
+The fourth `circle` element should have a `cx` value of `79`, a `cy` value of `89`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(3).attr('cx') == '79' &&
+    $('circle').eq(3).attr('cy') == '89' &&
+    $('circle').eq(3).attr('r') == '5'
+);
+```
+
+The fifth `circle` element should have a `cx` value of `420`, a `cy` value of `280`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(4).attr('cx') == '420' &&
+    $('circle').eq(4).attr('cy') == '280' &&
+    $('circle').eq(4).attr('r') == '5'
+);
+```
+
+The sixth `circle` element should have a `cx` value of `233`, a `cy` value of `355`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(5).attr('cx') == '233' &&
+    $('circle').eq(5).attr('cy') == '355' &&
+    $('circle').eq(5).attr('r') == '5'
+);
+```
+
+The seventh `circle` element should have a `cx` value of `333`, a `cy` value of `404`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(6).attr('cx') == '333' &&
+    $('circle').eq(6).attr('cy') == '404' &&
+    $('circle').eq(6).attr('r') == '5'
+);
+```
+
+The eighth `circle` element should have a `cx` value of `222`, a `cy` value of `167`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(7).attr('cx') == '222' &&
+    $('circle').eq(7).attr('cy') == '167' &&
+    $('circle').eq(7).attr('r') == '5'
+);
+```
+
+The ninth `circle` element should have a `cx` value of `78`, a `cy` value of `180`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(8).attr('cx') == '78' &&
+    $('circle').eq(8).attr('cy') == '180' &&
+    $('circle').eq(8).attr('r') == '5'
+);
+```
+
+The tenth `circle` element should have a `cx` value of `21`, a `cy` value of `377`, and an `r` value of `5`.
+
+```js
+assert(
+  $('circle').eq(9).attr('cx') == '21' &&
+    $('circle').eq(9).attr('cy') == '377' &&
+    $('circle').eq(9).attr('r') == '5'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => d[0])
+       .attr("cy", (d) => h - d[1])
+       .attr("r", 5)
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
new file mode 100644
index 0000000000..20dcceba1b
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-axes-to-a-visualization.md
@@ -0,0 +1,198 @@
+---
+id: 587d7fad367417b2b2512bdf
+title: Add Axes to a Visualization
+challengeType: 6
+forumTopicId: 301472
+dashedName: add-axes-to-a-visualization
+---
+
+# --description--
+
+Another way to improve the scatter plot is to add an x-axis and a y-axis.
+
+D3 has two methods, `axisLeft()` and `axisBottom()`, to render the y-axis and x-axis, respectively. Here's an example to create the x-axis based on the `xScale` in the previous challenges:
+
+```js
+const xAxis = d3.axisBottom(xScale);
+```
+
+The next step is to render the axis on the SVG canvas. To do so, you can use a general SVG component, the `g` element. The `g` stands for group. Unlike `rect`, `circle`, and `text`, an axis is just a straight line when it's rendered. Because it is a simple shape, using `g` works. The last step is to apply a `transform` 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 `transforms`, but positioning an axis needs `translate`. When it's applied to the `g` element, it moves the whole group over and down by the given amounts. Here's an example:
+
+```js
+const xAxis = d3.axisBottom(xScale);
+
+svg.append("g")
+   .attr("transform", "translate(0, " + (h - padding) + ")")
+   .call(xAxis);
+```
+
+The above code places the x-axis at the bottom of the SVG canvas. Then it's passed as an argument to the `call()` method. The y-axis works in the same way, except the `translate` argument is in the form `(x, 0)`. Because `translate` is a string in the `attr()` method above, you can use concatenation to include variable values for its arguments.
+
+# --instructions--
+
+The scatter plot now has an x-axis. Create a y-axis in a variable named `yAxis` using the `axisLeft()` method. Then render the axis using a `g` element. Make sure to use a `transform` attribute to translate the axis by the amount of padding units right, and `0` units down. Remember to `call()` the axis.
+
+# --hints--
+
+Your code should use the `axisLeft()` method with `yScale` passed as the argument.
+
+```js
+assert(code.match(/\.axisLeft\(yScale\)/g));
+```
+
+The y-axis `g` element should have a `transform` attribute to translate the axis by `(60, 0)`.
+
+```js
+assert(
+  $('g')
+    .eq(10)
+    .attr('transform')
+    .match(/translate\(60\s*?,\s*?0\)/g)
+);
+```
+
+Your code should call the `yAxis`.
+
+```js
+assert(code.match(/\.call\(\s*yAxis\s*\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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);
+    // Add your code below this line
+    const yAxis = undefined;
+    // Add your code above this line
+
+    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>
+```
+
+# --solutions--
+
+```html
+<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);
+    
+    const yAxis = d3.axisLeft(yScale);
+    
+
+    svg.append("g")
+       .attr("transform", "translate(0," + (h - padding) + ")")
+       .call(xAxis);
+
+    svg.append("g")
+       .attr("transform", "translate(" + padding + ",0)")
+       .call(yAxis)
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
new file mode 100644
index 0000000000..a2911cf178
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-classes-with-d3.md
@@ -0,0 +1,93 @@
+---
+id: 587d7fa7367417b2b2512bc8
+title: Add Classes with D3
+challengeType: 6
+forumTopicId: 301473
+dashedName: add-classes-with-d3
+---
+
+# --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 `attr()` method to add any HTML attribute to an element, including a class name.
+
+The `attr()` method works the same way that `style()` 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:
+
+```js
+selection.attr("class", "container");
+```
+
+Note that the `class` parameter will remain the same whenever you need to add a class and only the `container` parameter will change.
+
+# --instructions--
+
+Add the `attr()` method to the code in the editor and put a class of `bar` on the `div` elements.
+
+# --hints--
+
+Your `div` elements should have a class of `bar`.
+
+```js
+assert($('div').attr('class').trim().split(/\s+/g).includes('bar'));
+```
+
+Your code should use the `attr()` method.
+
+```js
+assert(code.match(/\.attr/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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
+      .attr("class","bar");
+      // Add your code above this line
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
new file mode 100644
index 0000000000..ea44782e9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-document-elements-with-d3.md
@@ -0,0 +1,105 @@
+---
+id: 587d7fa6367417b2b2512bc2
+title: Add Document Elements with D3
+challengeType: 6
+forumTopicId: 301474
+dashedName: add-document-elements-with-d3
+---
+
+# --description--
+
+D3 has several methods that let you add and change elements in your document.
+
+The `select()` 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:
+
+```js
+const anchor = d3.select("a");
+```
+
+The above example finds the first anchor tag on the page and saves an HTML node for it in the variable `anchor`. 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 `append()` and `text()`.
+
+The `append()` 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 `text()` 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:
+
+```js
+d3.select("ul")
+  .append("li")
+  .text("Very important item");
+```
+
+D3 allows you to chain several methods together with periods to perform a number of actions in a row.
+
+# --instructions--
+
+Use the `select` method to select the `body` tag in the document. Then `append` an `h1` tag to it, and add the text `Learning D3` into the `h1` element.
+
+# --hints--
+
+The `body` should have one `h1` element.
+
+```js
+assert($('body').children('h1').length == 1);
+```
+
+The `h1` element should have the text `Learning D3` in it.
+
+```js
+assert($('h1').text() == 'Learning D3');
+```
+
+Your code should access the `d3` object.
+
+```js
+assert(code.match(/d3/g));
+```
+
+Your code should use the `select` method.
+
+```js
+assert(code.match(/\.select/g));
+```
+
+Your code should use the `append` method.
+
+```js
+assert(code.match(/\.append/g));
+```
+
+Your code should use the `text` method.
+
+```js
+assert(code.match(/\.text/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    // Add your code below this line
+
+
+
+    // Add your code above this line
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    d3.select("body")
+      .append("h1")
+      .text("Learning D3")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
new file mode 100644
index 0000000000..9c538755d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-inline-styling-to-elements.md
@@ -0,0 +1,76 @@
+---
+id: 587d7fa7367417b2b2512bc6
+title: Add Inline Styling to Elements
+challengeType: 6
+forumTopicId: 301475
+dashedName: add-inline-styling-to-elements
+---
+
+# --description--
+
+D3 lets you add inline CSS styles on dynamic elements with the `style()` method.
+
+The `style()` method takes a comma-separated key-value pair as an argument. Here's an example to set the selection's text color to blue:
+
+```js
+selection.style("color","blue");
+```
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to make all the displayed text have a `font-family` of `verdana`.
+
+# --hints--
+
+Your `h2` elements should have a `font-family` of `verdana`.
+
+```js
+assert($('h2').css('font-family') == 'verdana');
+```
+
+Your code should use the `style()` method.
+
+```js
+assert(code.match(/\.style/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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"))
+      .style("font-family", "verdana")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
new file mode 100644
index 0000000000..d0da292c76
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-d3-elements.md
@@ -0,0 +1,153 @@
+---
+id: 587d7faa367417b2b2512bd2
+title: Add Labels to D3 Elements
+challengeType: 6
+forumTopicId: 301476
+dashedName: add-labels-to-d3-elements
+---
+
+# --description--
+
+D3 lets you label a graph element, such as a bar, using the SVG `text` element.
+
+Like the `rect` element, a `text` element needs to have `x` and `y` 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.
+
+# --instructions--
+
+The code in the editor already binds the data to each new `text` element. First, append `text` nodes to the `svg`. Next, add attributes for the `x` and `y` coordinates. They should be calculated the same way as the `rect` ones, except the `y` value for the `text` should make the label sit 3 units higher than the bar. Finally, use the D3 `text()` method to set the label equal to the data point value.
+
+**Note:** For the label to sit higher than the bar, decide if the `y` value for the `text` should be 3 greater or 3 less than the `y` value for the bar.
+
+# --hints--
+
+The first `text` element should have a label of `12` and a `y` value of `61`.
+
+```js
+assert($('text').eq(0).text() == '12' && $('text').eq(0).attr('y') == '61');
+```
+
+The second `text` element should have a label of `31` and a `y` value of `4`.
+
+```js
+assert($('text').eq(1).text() == '31' && $('text').eq(1).attr('y') == '4');
+```
+
+The third `text` element should have a label of `22` and a `y` value of `31`.
+
+```js
+assert($('text').eq(2).text() == '22' && $('text').eq(2).attr('y') == '31');
+```
+
+The fourth `text` element should have a label of `17` and a `y` value of `46`.
+
+```js
+assert($('text').eq(3).text() == '17' && $('text').eq(3).attr('y') == '46');
+```
+
+The fifth `text` element should have a label of `25` and a `y` value of `22`.
+
+```js
+assert($('text').eq(4).text() == '25' && $('text').eq(4).attr('y') == '22');
+```
+
+The sixth `text` element should have a label of `18` and a `y` value of `43`.
+
+```js
+assert($('text').eq(5).text() == '18' && $('text').eq(5).attr('y') == '43');
+```
+
+The seventh `text` element should have a label of `29` and a `y` value of `10`.
+
+```js
+assert($('text').eq(6).text() == '29' && $('text').eq(6).attr('y') == '10');
+```
+
+The eighth `text` element should have a label of `14` and a `y` value of `55`.
+
+```js
+assert($('text').eq(7).text() == '14' && $('text').eq(7).attr('y') == '55');
+```
+
+The ninth `text` element should have a label of `9` and a `y` value of `70`.
+
+```js
+assert($('text').eq(8).text() == '9' && $('text').eq(8).attr('y') == '70');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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()
+       .append("text")
+       .attr("x", (d, i) => i * 30)
+       .attr("y", (d, i) => h - (3 * d) - 3)
+       .text((d) => d)
+  </script>
+<body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
new file mode 100644
index 0000000000..0ad9ff3fba
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/add-labels-to-scatter-plot-circles.md
@@ -0,0 +1,224 @@
+---
+id: 587d7fab367417b2b2512bd9
+title: Add Labels to Scatter Plot Circles
+challengeType: 6
+forumTopicId: 301477
+dashedName: add-labels-to-scatter-plot-circles
+---
+
+# --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 (`x`) and second (`y`) fields of each item in `dataset`.
+
+The `text` nodes need `x` and `y` attributes to position it on the SVG canvas. In this challenge, the `y` value (which determines height) can use the same value that the `circle` uses for its `cy` attribute. The `x` value can be slightly larger than the `cx` value of the `circle`, so the label is visible. This will push the label to the right of the plotted point.
+
+# --instructions--
+
+Label each point on the scatter plot using the `text` 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 `x` attribute so it's `5` units more than the value you used for the `cx` attribute on the `circle`. Set the `y` attribute the same way that's used for the `cy` value on the `circle`.
+
+# --hints--
+
+Your code should have 10 `text` elements.
+
+```js
+assert($('text').length == 10);
+```
+
+The first label should have text of `34, 78`, an `x` value of `39`, and a `y` value of `422`.
+
+```js
+assert(
+  $('text').eq(0).text() == '34, 78' &&
+    $('text').eq(0).attr('x') == '39' &&
+    $('text').eq(0).attr('y') == '422'
+);
+```
+
+The second label should have text of `109, 280`, an `x` value of `114`, and a `y` value of `220`.
+
+```js
+assert(
+  $('text').eq(1).text() == '109, 280' &&
+    $('text').eq(1).attr('x') == '114' &&
+    $('text').eq(1).attr('y') == '220'
+);
+```
+
+The third label should have text of `310, 120`, an `x` value of `315`, and a `y` value of `380`.
+
+```js
+assert(
+  $('text').eq(2).text() == '310, 120' &&
+    $('text').eq(2).attr('x') == '315' &&
+    $('text').eq(2).attr('y') == '380'
+);
+```
+
+The fourth label should have text of `79, 411`, an `x` value of `84`, and a `y` value of `89`.
+
+```js
+assert(
+  $('text').eq(3).text() == '79, 411' &&
+    $('text').eq(3).attr('x') == '84' &&
+    $('text').eq(3).attr('y') == '89'
+);
+```
+
+The fifth label should have text of `420, 220`, an `x` value of `425`, and a `y` value of `280`.
+
+```js
+assert(
+  $('text').eq(4).text() == '420, 220' &&
+    $('text').eq(4).attr('x') == '425' &&
+    $('text').eq(4).attr('y') == '280'
+);
+```
+
+The sixth label should have text of `233, 145`, an `x` value of `238`, and a `y` value of `355`.
+
+```js
+assert(
+  $('text').eq(5).text() == '233, 145' &&
+    $('text').eq(5).attr('x') == '238' &&
+    $('text').eq(5).attr('y') == '355'
+);
+```
+
+The seventh label should have text of `333, 96`, an `x` value of `338`, and a `y` value of `404`.
+
+```js
+assert(
+  $('text').eq(6).text() == '333, 96' &&
+    $('text').eq(6).attr('x') == '338' &&
+    $('text').eq(6).attr('y') == '404'
+);
+```
+
+The eighth label should have text of `222, 333`, an `x` value of `227`, and a `y` value of `167`.
+
+```js
+assert(
+  $('text').eq(7).text() == '222, 333' &&
+    $('text').eq(7).attr('x') == '227' &&
+    $('text').eq(7).attr('y') == '167'
+);
+```
+
+The ninth label should have text of `78, 320`, an `x` value of `83`, and a `y` value of `180`.
+
+```js
+assert(
+  $('text').eq(8).text() == '78, 320' &&
+    $('text').eq(8).attr('x') == '83' &&
+    $('text').eq(8).attr('y') == '180'
+);
+```
+
+The tenth label should have text of `21, 123`, an `x` value of `26`, and a `y` value of `377`.
+
+```js
+assert(
+  $('text').eq(9).text() == '21, 123' &&
+    $('text').eq(9).attr('x') == '26' &&
+    $('text').eq(9).attr('y') == '377'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+       .attr("x", (d) => d[0] + 5)
+       .attr("y", (d) => h - d[1])
+       .text((d) => (d[0] + ", " + d[1]))
+       
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
new file mode 100644
index 0000000000..1ed6ae7d5e
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-styles-based-on-data.md
@@ -0,0 +1,123 @@
+---
+id: 587d7fa7367417b2b2512bc7
+title: Change Styles Based on Data
+challengeType: 6
+forumTopicId: 301479
+dashedName: change-styles-based-on-data
+---
+
+# --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 `style()` method to change the styling for different elements.
+
+For example, you may want to color a data point blue if it has a value less than 20, and red otherwise. You can use a callback function in the `style()` method and include the conditional logic. The callback function uses the `d` parameter to represent the data point:
+
+```js
+selection.style("color", (d) => {
+
+});
+```
+
+The `style()` method is not limited to setting the `color` - it can be used with other CSS properties as well.
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to set the `color` of the `h2` elements conditionally. Write the callback function so if the data value is less than 20, it returns red, otherwise it returns green.
+
+**Note:** You can use if-else logic, or the ternary operator.
+
+# --hints--
+
+The first `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(0).css('color') == 'rgb(255, 0, 0)');
+```
+
+The second `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(1).css('color') == 'rgb(0, 128, 0)');
+```
+
+The third `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(2).css('color') == 'rgb(0, 128, 0)');
+```
+
+The fourth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(3).css('color') == 'rgb(255, 0, 0)');
+```
+
+The fifth `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(4).css('color') == 'rgb(0, 128, 0)');
+```
+
+The sixth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(5).css('color') == 'rgb(255, 0, 0)');
+```
+
+The seventh `h2` should have a `color` of green.
+
+```js
+assert($('h2').eq(6).css('color') == 'rgb(0, 128, 0)');
+```
+
+The eighth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(7).css('color') == 'rgb(255, 0, 0)');
+```
+
+The ninth `h2` should have a `color` of red.
+
+```js
+assert($('h2').eq(8).css('color') == 'rgb(255, 0, 0)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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"))
+      .style("color", (d) => d < 20 ? "red" : "green")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
new file mode 100644
index 0000000000..4e0d47f93c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-color-of-an-svg-element.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fa9367417b2b2512bd1
+title: Change the Color of an SVG Element
+challengeType: 6
+forumTopicId: 301480
+dashedName: change-the-color-of-an-svg-element
+---
+
+# --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 `rect` shape is colored with the `fill` attribute. It supports hex codes, color names, and rgb values, as well as more complex options like gradients and transparency.
+
+# --instructions--
+
+Add an `attr()` method to set the `fill` of all the bars to the color navy.
+
+# --hints--
+
+The bars should all have a `fill` color of navy.
+
+```js
+assert($('rect').css('fill') == 'rgb(0, 0, 128)');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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");
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
new file mode 100644
index 0000000000..9112736602
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/change-the-presentation-of-a-bar-chart.md
@@ -0,0 +1,161 @@
+---
+id: 587d7fa8367417b2b2512bca
+title: Change the Presentation of a Bar Chart
+challengeType: 6
+forumTopicId: 301481
+dashedName: change-the-presentation-of-a-bar-chart
+---
+
+# --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 `bar` 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
+
+# --instructions--
+
+First, add a `margin` of `2px` to the `bar` class in the `style` tag. Next, change the callback function in the `style()` method so it returns a value `10` times the original data value (plus the `px`).
+
+**Note:** Multiplying each data point by the *same* constant only alters the scale. It's like zooming in, and it doesn't change the meaning of the underlying data.
+
+# --hints--
+
+The first `div` should have a `height` of `120` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(0).css('height') == '120px' &&
+    $('div').eq(0).css('margin-right') == '2px'
+);
+```
+
+The second `div` should have a `height` of `310` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(1).css('height') == '310px' &&
+    $('div').eq(1).css('margin-right') == '2px'
+);
+```
+
+The third `div` should have a `height` of `220` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(2).css('height') == '220px' &&
+    $('div').eq(2).css('margin-right') == '2px'
+);
+```
+
+The fourth `div` should have a `height` of `170` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(3).css('height') == '170px' &&
+    $('div').eq(3).css('margin-right') == '2px'
+);
+```
+
+The fifth `div` should have a `height` of `250` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(4).css('height') == '250px' &&
+    $('div').eq(4).css('margin-right') == '2px'
+);
+```
+
+The sixth `div` should have a `height` of `180` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(5).css('height') == '180px' &&
+    $('div').eq(5).css('margin-right') == '2px'
+);
+```
+
+The seventh `div` should have a `height` of `290` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(6).css('height') == '290px' &&
+    $('div').eq(6).css('margin-right') == '2px'
+);
+```
+
+The eighth `div` should have a `height` of `140` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(7).css('height') == '140px' &&
+    $('div').eq(7).css('margin-right') == '2px'
+);
+```
+
+The ninth `div` should have a `height` of `90` pixels and a `margin` of `2` pixels.
+
+```js
+assert(
+  $('div').eq(8).css('height') == '90px' &&
+    $('div').eq(8).css('margin-right') == '2px'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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")
+      .style("height", (d) => (d + "px")) // Change this line
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<style>
+  .bar {
+    width: 25px;
+    height: 100px;
+    margin: 2px;
+    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")
+      .style("height", (d) => (d * 10 + "px"))
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
new file mode 100644
index 0000000000..e988030673
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-bar-for-each-data-point-in-the-set.md
@@ -0,0 +1,110 @@
+---
+id: 587d7fa8367417b2b2512bcd
+title: Create a Bar for Each Data Point in the Set
+challengeType: 6
+forumTopicId: 301482
+dashedName: create-a-bar-for-each-data-point-in-the-set
+---
+
+# --description--
+
+The last challenge added only one rectangle to the `svg` element to represent a bar. Here, you'll combine what you've learned so far about `data()`, `enter()`, and SVG shapes to create and append a rectangle for each data point in `dataset`.
+
+A previous challenge showed the format for how to create and append a `div` for each item in `dataset`:
+
+```js
+d3.select("body").selectAll("div")
+  .data(dataset)
+  .enter()
+  .append("div")
+```
+
+There are a few differences working with `rect` elements instead of `div` elements. The `rect` elements must be appended to an `svg` element, not directly to the `body`. Also, you need to tell D3 where to place each `rect` within the `svg` area. The bar placement will be covered in the next challenge.
+
+# --instructions--
+
+Use the `data()`, `enter()`, and `append()` methods to create and append a `rect` for each item in `dataset`. The bars should display all on top of each other; this will be fixed in the next challenge.
+
+# --hints--
+
+Your document should have 9 `rect` elements.
+
+```js
+assert($('rect').length == 9);
+```
+
+Your code should use the `data()` method.
+
+```js
+assert(code.match(/\.data/g));
+```
+
+Your code should use the `enter()` method.
+
+```js
+assert(code.match(/\.enter/g));
+```
+
+Your code should use the `append()` method.
+
+```js
+assert(code.match(/\.append/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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", 0)
+       .attr("y", 0)
+       .attr("width", 25)
+       .attr("height", 100);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
new file mode 100644
index 0000000000..d118740df6
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-linear-scale-with-d3.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fab367417b2b2512bda
+title: Create a Linear Scale with D3
+challengeType: 6
+forumTopicId: 301483
+dashedName: create-a-linear-scale-with-d3
+---
+
+# --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. `scales` 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 `x` and `y` 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 `scaleLinear()`:
+
+```js
+const scale = d3.scaleLinear()
+```
+
+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.
+
+# --instructions--
+
+Change the `scale` variable to create a linear scale. Then set the `output` variable to the scale called with an input argument of `50`.
+
+# --hints--
+
+The text in the `h2` should be `50`.
+
+```js
+assert($('h2').text() == '50');
+```
+
+Your code should use the `scaleLinear()` method.
+
+```js
+assert(code.match(/\.scaleLinear/g));
+```
+
+The `output` variable should call `scale` with an argument of `50`.
+
+```js
+assert(output == 50 && code.match(/scale\(\s*?50\s*?\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    // Add your code below this line
+
+    const scale = undefined; // Create the scale here
+    const output = scale(); // Call scale with an argument here
+
+    // Add your code above this line
+
+    d3.select("body")
+      .append("h2")
+      .text(output);
+
+  </script>
+</body>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+
+    const scale = d3.scaleLinear();
+    const output = scale(50); 
+
+    d3.select("body")
+      .append("h2")
+      .text(output);
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
new file mode 100644
index 0000000000..5f4bd1e056
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/create-a-scatterplot-with-svg-circles.md
@@ -0,0 +1,103 @@
+---
+id: 587d7fab367417b2b2512bd7
+title: Create a Scatterplot with SVG Circles
+challengeType: 6
+forumTopicId: 301484
+dashedName: create-a-scatterplot-with-svg-circles
+---
+
+# --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 `x` and `y` axes, and are used to position the circle in the visualization.
+
+SVG has a `circle` tag to create the circle shape. It works a lot like the `rect` elements you used for the bar chart.
+
+# --instructions--
+
+Use the `data()`, `enter()`, and `append()` methods to bind `dataset` to new `circle` elements that are appended to the SVG canvas.
+
+**Note:** The circles won't be visible because we haven't set their attributes yet. We'll do that in the next challenge.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
new file mode 100644
index 0000000000..71a39ddaf1
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/display-shapes-with-svg.md
@@ -0,0 +1,103 @@
+---
+id: 587d7fa8367417b2b2512bcc
+title: Display Shapes with SVG
+challengeType: 6
+forumTopicId: 301485
+dashedName: display-shapes-with-svg
+---
+
+# --description--
+
+The last challenge created an `svg` element with a given width and height, which was visible because it had a `background-color` applied to it in the `style` tag. The code made space for the given width and height.
+
+The next step is to create a shape to put in the `svg` 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 (`<rect>`) SVG shape could create a bar in a bar chart.
+
+When you place a shape into the `svg` area, you can specify where it goes with `x` and `y` coordinates. The origin point of (0, 0) is in the upper-left corner. Positive values for `x` push the shape to the right, and positive values for `y` push the shape down from the origin point.
+
+To place a shape in the middle of the 500 (width) x 100 (height) `svg` from last challenge, the `x` coordinate would be 250 and the `y` coordinate would be 50.
+
+An SVG `rect` has four attributes. There are the `x` and `y` coordinates for where it is placed in the `svg` area. It also has a `height` and `width` to specify the size.
+
+# --instructions--
+
+Add a `rect` shape to the `svg` using `append()`, and give it a `width` attribute of `25` and `height` attribute of `100`. Also, give the `rect` `x` and `y` attributes each set to `0`.
+
+# --hints--
+
+Your document should have 1 `rect` element.
+
+```js
+assert($('rect').length == 1);
+```
+
+The `rect` element should have a `width` attribute set to `25`.
+
+```js
+assert($('rect').attr('width') == '25');
+```
+
+The `rect` element should have a `height` attribute set to `100`.
+
+```js
+assert($('rect').attr('height') == '100');
+```
+
+The `rect` element should have an `x` attribute set to `0`.
+
+```js
+assert($('rect').attr('x') == '0');
+```
+
+The `rect` element should have a `y` attribute set to `0`.
+
+```js
+assert($('rect').attr('y') == '0');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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)
+                  .append("rect")
+                  .attr("width", 25)
+                  .attr("height", 100)
+                  .attr("x", 0)
+                  .attr("y", 0);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
new file mode 100644
index 0000000000..33463161a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-change-the-height-of-each-bar.md
@@ -0,0 +1,145 @@
+---
+id: 587d7fa9367417b2b2512bcf
+title: Dynamically Change the Height of Each Bar
+challengeType: 6
+forumTopicId: 301486
+dashedName: dynamically-change-the-height-of-each-bar
+---
+
+# --description--
+
+The height of each bar can be set to the value of the data point in the array, similar to how the `x` value was set dynamically.
+
+```js
+selection.attr("property", (d, i) => {
+
+})
+```
+
+Here `d` would be the data point value, and `i` would be the index of the data point in the array.
+
+# --instructions--
+
+Change the callback function for the `height` attribute to return the data value times 3.
+
+**Note:** 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.
+
+# --hints--
+
+The first `rect` should have a `height` of `36`.
+
+```js
+assert($('rect').eq(0).attr('height') == '36');
+```
+
+The second `rect` should have a `height` of `93`.
+
+```js
+assert($('rect').eq(1).attr('height') == '93');
+```
+
+The third `rect` should have a `height` of `66`.
+
+```js
+assert($('rect').eq(2).attr('height') == '66');
+```
+
+The fourth `rect` should have a `height` of `51`.
+
+```js
+assert($('rect').eq(3).attr('height') == '51');
+```
+
+The fifth `rect` should have a `height` of `75`.
+
+```js
+assert($('rect').eq(4).attr('height') == '75');
+```
+
+The sixth `rect` should have a `height` of `54`.
+
+```js
+assert($('rect').eq(5).attr('height') == '54');
+```
+
+The seventh `rect` should have a `height` of `87`.
+
+```js
+assert($('rect').eq(6).attr('height') == '87');
+```
+
+The eighth `rect` should have a `height` of `42`.
+
+```js
+assert($('rect').eq(7).attr('height') == '42');
+```
+
+The ninth `rect` should have a `height` of `27`.
+
+```js
+assert($('rect').eq(8).attr('height') == '27');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => {
+         return d * 3
+       });
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
new file mode 100644
index 0000000000..ad10065163
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/dynamically-set-the-coordinates-for-each-bar.md
@@ -0,0 +1,151 @@
+---
+id: 587d7fa9367417b2b2512bce
+title: Dynamically Set the Coordinates for Each Bar
+challengeType: 6
+forumTopicId: 301487
+dashedName: dynamically-set-the-coordinates-for-each-bar
+---
+
+# --description--
+
+The last challenge created and appended a rectangle to the `svg` element for each point in `dataset` to represent a bar. Unfortunately, they were all stacked on top of each other.
+
+The placement of a rectangle is handled by the `x` and `y` attributes. They tell D3 where to start drawing the shape in the `svg` 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 `y` value stays the same (at 0) for all bars. The `x` value, however, needs to change as you add new bars. Remember that larger `x` values push items farther to the right. As you go through the array elements in `dataset`, the `x` value should increase.
+
+The `attr()` 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 `d`) and one for the index of the data point in the array. The second argument for the index is optional. Here's the format:
+
+```js
+selection.attr("property", (d, i) => {
+
+})
+```
+
+It's important to note that you do NOT need to write a `for` loop or use `forEach()` to iterate over the items in the data set. Recall that the `data()` method parses the data set, and any method that's chained after `data()` is run once for each item in the data set.
+
+# --instructions--
+
+Change the `x` attribute callback function so it returns the index times 30.
+
+**Note:** Each bar has a width of 25, so increasing each `x` value by 30 adds some space between the bars. Any value greater than 25 would work in this example.
+
+# --hints--
+
+The first `rect` should have an `x` value of `0`.
+
+```js
+assert($('rect').eq(0).attr('x') == '0');
+```
+
+The second `rect` should have an `x` value of `30`.
+
+```js
+assert($('rect').eq(1).attr('x') == '30');
+```
+
+The third `rect` should have an `x` value of `60`.
+
+```js
+assert($('rect').eq(2).attr('x') == '60');
+```
+
+The fourth `rect` should have an `x` value of `90`.
+
+```js
+assert($('rect').eq(3).attr('x') == '90');
+```
+
+The fifth `rect` should have an `x` value of `120`.
+
+```js
+assert($('rect').eq(4).attr('x') == '120');
+```
+
+The sixth `rect` should have an `x` value of `150`.
+
+```js
+assert($('rect').eq(5).attr('x') == '150');
+```
+
+The seventh `rect` should have an `x` value of `180`.
+
+```js
+assert($('rect').eq(6).attr('x') == '180');
+```
+
+The eighth `rect` should have an `x` value of `210`.
+
+```js
+assert($('rect').eq(7).attr('x') == '210');
+```
+
+The ninth `rect` should have an `x` value of `240`.
+
+```js
+assert($('rect').eq(8).attr('x') == '240');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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) => {
+         return i * 30
+       })
+       .attr("y", 0)
+       .attr("width", 25)
+       .attr("height", 100);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
new file mode 100644
index 0000000000..66156ef887
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/invert-svg-elements.md
@@ -0,0 +1,143 @@
+---
+id: 587d7fa9367417b2b2512bd0
+title: Invert SVG Elements
+challengeType: 6
+forumTopicId: 301488
+dashedName: invert-svg-elements
+---
+
+# --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 `x` coordinate of 0 places a shape on the left edge of the SVG area. A `y` coordinate of 0 places a shape on the top edge of the SVG area. Higher `x` values push the rectangle to the right. Higher `y` values push the rectangle down.
+
+To make the bars right-side-up, you need to change the way the `y` 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 `y` coordinate needs a value of 100. If the data point value were 1, you would start with a `y` 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 `y` coordinate would be 99.
+
+The `y` coordinate that is `y = heightOfSVG - heightOfBar` would place the bars right-side-up.
+
+# --instructions--
+
+Change the callback function for the `y` attribute to set the bars right-side-up. Remember that the `height` of the bar is 3 times the data value `d`.
+
+**Note:** In general, the relationship is `y = h - m * d`, where `m` is the constant that scales the data points.
+
+# --hints--
+
+The first `rect` should have a `y` value of `64`.
+
+```js
+assert($('rect').eq(0).attr('y') == h - dataset[0] * 3);
+```
+
+The second `rect` should have a `y` value of `7`.
+
+```js
+assert($('rect').eq(1).attr('y') == h - dataset[1] * 3);
+```
+
+The third `rect` should have a `y` value of `34`.
+
+```js
+assert($('rect').eq(2).attr('y') == h - dataset[2] * 3);
+```
+
+The fourth `rect` should have a `y` value of `49`.
+
+```js
+assert($('rect').eq(3).attr('y') == h - dataset[3] * 3);
+```
+
+The fifth `rect` should have a `y` value of `25`.
+
+```js
+assert($('rect').eq(4).attr('y') == h - dataset[4] * 3);
+```
+
+The sixth `rect` should have a `y` value of `46`.
+
+```js
+assert($('rect').eq(5).attr('y') == h - dataset[5] * 3);
+```
+
+The seventh `rect` should have a `y` value of `13`.
+
+```js
+assert($('rect').eq(6).attr('y') == h - dataset[6] * 3);
+```
+
+The eighth `rect` should have a `y` value of `58`.
+
+```js
+assert($('rect').eq(7).attr('y') == h - dataset[7] * 3);
+```
+
+The ninth `rect` should have a `y` value of `73`.
+
+```js
+assert($('rect').eq(8).attr('y') == h - dataset[8] * 3);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
new file mode 100644
index 0000000000..f5fba672e9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/learn-about-svg-in-d3.md
@@ -0,0 +1,93 @@
+---
+id: 587d7fa8367417b2b2512bcb
+title: Learn About SVG in D3
+challengeType: 6
+forumTopicId: 301489
+dashedName: learn-about-svg-in-d3
+---
+
+# --description--
+
+<dfn>SVG</dfn> stands for <dfn>Scalable Vector Graphics</dfn>.
+
+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 `svg` tag.
+
+CSS can be scalable when styles use relative units (such as `vh`, `vw`, or percentages), but using SVG is more flexible to build data visualizations.
+
+# --instructions--
+
+Add an `svg` node to the `body` using `append()`. Give it a `width` attribute set to the provided `w` constant and a `height` attribute set to the provided `h` constant using the `attr()` or `style()` methods for each. You'll see it in the output because there's a `background-color` of pink applied to it in the `style` tag.
+
+**Note:** When using `attr()` 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.
+
+# --hints--
+
+Your document should have 1 `svg` element.
+
+```js
+assert($('svg').length == 1);
+```
+
+The `svg` element should have a `width` attribute set to `500` or styled to have a width of `500px`.
+
+```js
+assert($('svg').attr('width') == '500' || $('svg').css('width') == '500px');
+```
+
+The `svg` element should have a `height` attribute set to `100` or styled to have a height of `100px`.
+
+```js
+assert($('svg').attr('height') == '100' || $('svg').css('height') == '100px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+                  .append("svg")
+                  .attr("width", w)
+                  .attr("height", h)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
new file mode 100644
index 0000000000..bf0acc7b43
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/select-a-group-of-elements-with-d3.md
@@ -0,0 +1,82 @@
+---
+id: 587d7fa6367417b2b2512bc3
+title: Select a Group of Elements with D3
+challengeType: 6
+forumTopicId: 301490
+dashedName: select-a-group-of-elements-with-d3
+---
+
+# --description--
+
+D3 also has the `selectAll()` 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:
+
+```js
+const anchors = d3.selectAll("a");
+```
+
+Like the `select()` method, `selectAll()` supports method chaining, and you can use it with other methods.
+
+# --instructions--
+
+Select all of the `li` tags in the document, and change their text to the string `list item` by chaining the `.text()` method.
+
+# --hints--
+
+There should be 3 `li` elements on the page, and the text in each one should say `list item`. Capitalization and spacing should match exactly.
+
+```js
+assert(
+  $('li')
+    .text()
+    .match(/list item/g).length == 3
+);
+```
+
+Your code should access the `d3` object.
+
+```js
+assert(code.match(/d3/g));
+```
+
+Your code should use the `selectAll` method.
+
+```js
+assert(code.match(/\.selectAll/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <ul>
+    <li>Example</li>
+    <li>Example</li>
+    <li>Example</li>
+  </ul>
+  <script>
+    d3.selectAll("li")
+      .text("list item")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
new file mode 100644
index 0000000000..5a678c5dd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/set-a-domain-and-a-range-on-a-scale.md
@@ -0,0 +1,106 @@
+---
+id: 587d7fac367417b2b2512bdb
+title: Set a Domain and a Range on a Scale
+challengeType: 6
+forumTopicId: 301491
+dashedName: set-a-domain-and-a-range-on-a-scale
+---
+
+# --description--
+
+By default, scales use the identity relationship. This means the input value maps to the output value. However, scales can be much more flexible and interesting.
+
+Say a dataset has values ranging from 50 to 480. This is the input information for a scale, also known as the <dfn>domain</dfn>.
+
+You want to map those points along the `x` axis on the SVG canvas, between 10 units and 500 units. This is the output information, also known as the <dfn>range</dfn>.
+
+The `domain()` and `range()` methods set these values for the scale. Both methods take an array of at least two elements as an argument. Here's an example:
+
+```js
+scale.domain([50, 480]);
+scale.range([10, 500]);
+scale(50)
+scale(480)
+scale(325)
+scale(750)
+d3.scaleLinear()
+```
+
+In order, the following values would be displayed in the console: `10`, `500`, `323.37`, and `807.67`.
+
+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.
+
+# --instructions--
+
+Create a scale and set its domain to `[250, 500]` and range to `[10, 150]`.
+
+**Note:** You can chain the `domain()` and `range()` methods onto the `scale` variable.
+
+# --hints--
+
+Your code should use the `domain()` method.
+
+```js
+assert(code.match(/\.domain/g));
+```
+
+The `domain()` of the `scale` should be set to `[250, 500]`.
+
+```js
+assert(JSON.stringify(scale.domain()) == JSON.stringify([250, 500]));
+```
+
+Your code should use the `range()` method.
+
+```js
+assert(code.match(/\.range/g));
+```
+
+The `range()` of the `scale` should be set to `[10, 150]`.
+
+```js
+assert(JSON.stringify(scale.range()) == JSON.stringify([10, 150]));
+```
+
+The text in the `h2` should be `-102`.
+
+```js
+assert($('h2').text() == '-102');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const scale = d3.scaleLinear();
+    scale.domain([250, 500])
+    scale.range([10, 150])
+    const output = scale(50);
+    d3.select("body")
+      .append("h2")
+      .text(output);
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/style-d3-labels.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
new file mode 100644
index 0000000000..934932f51f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/style-d3-labels.md
@@ -0,0 +1,110 @@
+---
+id: 587d7faa367417b2b2512bd3
+title: Style D3 Labels
+challengeType: 6
+forumTopicId: 301492
+dashedName: style-d3-labels
+---
+
+# --description--
+
+D3 methods can add styles to the bar labels. The `fill` attribute sets the color of the text for a `text` node. The `style()` method sets CSS rules for other styles, such as `font-family` or `font-size`.
+
+# --instructions--
+
+Set the `font-size` of the `text` elements to `25px`, and the color of the text to red.
+
+# --hints--
+
+The labels should all have a `fill` color of red.
+
+```js
+assert($('text').css('fill') == 'rgb(255, 0, 0)');
+```
+
+The labels should all have a `font-size` of `25` pixels.
+
+```js
+assert($('text').css('font-size') == '25px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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)
+       .style("font-size", 25)
+       .attr("fill", "red")
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
new file mode 100644
index 0000000000..27dd13a1b9
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/update-the-height-of-an-element-dynamically.md
@@ -0,0 +1,137 @@
+---
+id: 587d7fa8367417b2b2512bc9
+title: Update the Height of an Element Dynamically
+challengeType: 6
+forumTopicId: 301493
+dashedName: update-the-height-of-an-element-dynamically
+---
+
+# --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 `div` for each data point in the array
+
+2) Give each `div` a dynamic height, using a callback function in the `style()` method that sets height equal to the data value
+
+Recall the format to set a style using a callback function:
+
+```js
+selection.style("cssProperty", (d) => d)
+```
+
+# --instructions--
+
+Add the `style()` method to the code in the editor to set the `height` property for each element. Use a callback function to return the value of the data point with the string `px` added to it.
+
+# --hints--
+
+The first `div` should have a `height` of `12` pixels.
+
+```js
+assert($('div').eq(0)[0].style.height === '12px');
+```
+
+The second `div` should have a `height` of `31` pixels.
+
+```js
+assert($('div').eq(1)[0].style.height === '31px');
+```
+
+The third `div` should have a `height` of `22` pixels.
+
+```js
+assert($('div').eq(2)[0].style.height === '22px');
+```
+
+The fourth `div` should have a `height` of `17` pixels.
+
+```js
+assert($('div').eq(3)[0].style.height === '17px');
+```
+
+The fifth `div` should have a `height` of `25` pixels.
+
+```js
+assert($('div').eq(4)[0].style.height === '25px');
+```
+
+The sixth `div` should have a `height` of `18` pixels.
+
+```js
+assert($('div').eq(5)[0].style.height === '18px');
+```
+
+The seventh `div` should have a `height` of `29` pixels.
+
+```js
+assert($('div').eq(6)[0].style.height === '29px');
+```
+
+The eighth `div` should have a `height` of `14` pixels.
+
+```js
+assert($('div').eq(7)[0].style.height === '14px');
+```
+
+The ninth `div` should have a `height` of `9` pixels.
+
+```js
+assert($('div').eq(8)[0].style.height === '9px');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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")
+      .style('height', d => `${d}px`)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
new file mode 100644
index 0000000000..e02248743c
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-a-pre-defined-scale-to-place-elements.md
@@ -0,0 +1,347 @@
+---
+id: 587d7fac367417b2b2512bde
+title: Use a Pre-Defined Scale to Place Elements
+challengeType: 6
+forumTopicId: 301494
+dashedName: use-a-pre-defined-scale-to-place-elements
+---
+
+# --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 `x` and `y` attributes for `rect` or `text` elements, or `cx` and `cy` for `circles`. Here's an example:
+
+```js
+shape
+  .attr("x", (d) => xScale(d[0]))
+```
+
+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 `text()` method for a tooltip or label.
+
+# --instructions--
+
+Use `xScale` and `yScale` to position both the `circle` and `text` shapes onto the SVG canvas. For the `circles`, apply the scales to set the `cx` and `cy` attributes. Give them a radius of `5` units, too.
+
+For the `text` elements, apply the scales to set the `x` and `y` 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 `xScale`.
+
+# --hints--
+
+Your code should have 10 `circle` elements.
+
+```js
+assert($('circle').length == 10);
+```
+
+The first `circle` element should have a `cx` value of approximately `91` and a `cy` value of approximately `368` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(0).attr('cx')) == '91' &&
+    Math.round($('circle').eq(0).attr('cy')) == '368' &&
+    $('circle').eq(0).attr('r') == '5'
+);
+```
+
+The second `circle` element should have a `cx` value of approximately `159` and a `cy` value of approximately `181` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(1).attr('cx')) == '159' &&
+    Math.round($('circle').eq(1).attr('cy')) == '181' &&
+    $('circle').eq(1).attr('r') == '5'
+);
+```
+
+The third `circle` element should have a `cx` value of approximately `340` and a `cy` value of approximately `329` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(2).attr('cx')) == '340' &&
+    Math.round($('circle').eq(2).attr('cy')) == '329' &&
+    $('circle').eq(2).attr('r') == '5'
+);
+```
+
+The fourth `circle` element should have a `cx` value of approximately `131` and a `cy` value of approximately `60` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(3).attr('cx')) == '131' &&
+    Math.round($('circle').eq(3).attr('cy')) == '60' &&
+    $('circle').eq(3).attr('r') == '5'
+);
+```
+
+The fifth `circle` element should have a `cx` value of approximately `440` and a `cy` value of approximately `237` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(4).attr('cx')) == '440' &&
+    Math.round($('circle').eq(4).attr('cy')) == '237' &&
+    $('circle').eq(4).attr('r') == '5'
+);
+```
+
+The sixth `circle` element should have a `cx` value of approximately `271` and a `cy` value of approximately `306` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(5).attr('cx')) == '271' &&
+    Math.round($('circle').eq(5).attr('cy')) == '306' &&
+    $('circle').eq(5).attr('r') == '5'
+);
+```
+
+The seventh `circle` element should have a `cx` value of approximately `361` and a `cy` value of approximately `351` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(6).attr('cx')) == '361' &&
+    Math.round($('circle').eq(6).attr('cy')) == '351' &&
+    $('circle').eq(6).attr('r') == '5'
+);
+```
+
+The eighth `circle` element should have a `cx` value of approximately `261` and a `cy` value of approximately `132` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(7).attr('cx')) == '261' &&
+    Math.round($('circle').eq(7).attr('cy')) == '132' &&
+    $('circle').eq(7).attr('r') == '5'
+);
+```
+
+The ninth `circle` element should have a `cx` value of approximately `131` and a `cy` value of approximately `144` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(8).attr('cx')) == '131' &&
+    Math.round($('circle').eq(8).attr('cy')) == '144' &&
+    $('circle').eq(8).attr('r') == '5'
+);
+```
+
+The tenth `circle` element should have a `cx` value of approximately `79` and a `cy` value of approximately `326` after applying the scales. It should also have an `r` value of `5`.
+
+```js
+assert(
+  Math.round($('circle').eq(9).attr('cx')) == '79' &&
+    Math.round($('circle').eq(9).attr('cy')) == '326' &&
+    $('circle').eq(9).attr('r') == '5'
+);
+```
+
+Your code should have 10 `text` elements.
+
+```js
+assert($('text').length == 10);
+```
+
+The first label should have an `x` value of approximately `100` and a `y` value of approximately `368` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(0).attr('x')) == '100' &&
+    Math.round($('text').eq(0).attr('y')) == '368'
+);
+```
+
+The second label should have an `x` value of approximately `168` and a `y` value of approximately `181` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(1).attr('x')) == '168' &&
+    Math.round($('text').eq(1).attr('y')) == '181'
+);
+```
+
+The third label should have an `x` value of approximately `350` and a `y` value of approximately `329` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(2).attr('x')) == '350' &&
+    Math.round($('text').eq(2).attr('y')) == '329'
+);
+```
+
+The fourth label should have an `x` value of approximately `141` and a `y` value of approximately `60` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(3).attr('x')) == '141' &&
+    Math.round($('text').eq(3).attr('y')) == '60'
+);
+```
+
+The fifth label should have an `x` value of approximately `449` and a `y` value of approximately `237` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(4).attr('x')) == '449' &&
+    Math.round($('text').eq(4).attr('y')) == '237'
+);
+```
+
+The sixth label should have an `x` value of approximately `280` and a `y` value of approximately `306` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(5).attr('x')) == '280' &&
+    Math.round($('text').eq(5).attr('y')) == '306'
+);
+```
+
+The seventh label should have an `x` value of approximately `370` and a `y` value of approximately `351` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(6).attr('x')) == '370' &&
+    Math.round($('text').eq(6).attr('y')) == '351'
+);
+```
+
+The eighth label should have an `x` value of approximately `270` and a `y` value of approximately `132` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(7).attr('x')) == '270' &&
+    Math.round($('text').eq(7).attr('y')) == '132'
+);
+```
+
+The ninth label should have an `x` value of approximately `140` and a `y` value of approximately `144` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(8).attr('x')) == '140' &&
+    Math.round($('text').eq(8).attr('y')) == '144'
+);
+```
+
+The tenth label should have an `x` value of approximately `88` and a `y` value of approximately `326` after applying the scales.
+
+```js
+assert(
+  Math.round($('text').eq(9).attr('x')) == '88' &&
+    Math.round($('text').eq(9).attr('y')) == '326'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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", 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]))
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
new file mode 100644
index 0000000000..92889986bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-dynamic-scales.md
@@ -0,0 +1,156 @@
+---
+id: 587d7fac367417b2b2512bdd
+title: Use Dynamic Scales
+challengeType: 6
+forumTopicId: 301495
+dashedName: use-dynamic-scales
+---
+
+# --description--
+
+The D3 `min()` and `max()` 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 `domain()` method passes information to the scale about the raw data values for the plot. The `range()` 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 `max()` method with a callback function based on the x values in the arrays. The range uses the SVG canvas' width (`w`), but it includes some padding, too. This puts space between the scatter plot dots and the edge of the SVG canvas.
+
+```js
+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 = 30;
+const xScale = d3.scaleLinear()
+  .domain([0, d3.max(dataset, (d) => d[0])])
+  .range([padding, w - padding]);
+```
+
+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 `range()` method forces the plot to start at 30 along that line (instead of 0), and end at 470 (instead of 500).
+
+# --instructions--
+
+Use the `yScale` 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 (`h`) and include padding.
+
+**Note:** 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.
+
+# --hints--
+
+The text in the `h2` should be `30`.
+
+```js
+assert(output == 30 && $('h2').text() == '30');
+```
+
+The `domain()` of yScale should be equivalent to `[0, 411]`.
+
+```js
+assert(JSON.stringify(yScale.domain()) == JSON.stringify([0, 411]));
+```
+
+The `range()` of yScale should be equivalent to `[470, 30]`.
+
+```js
+assert(JSON.stringify(yScale.range()) == JSON.stringify([470, 30]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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 = 30;
+
+    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 output = yScale(411);
+    d3.select("body")
+      .append("h2")
+      .text(output)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
new file mode 100644
index 0000000000..786b313b21
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/use-the-d3.max-and-d3.min-functions-to-find-minimum-and-maximum-values-in-a-dataset.md
@@ -0,0 +1,91 @@
+---
+id: 587d7fac367417b2b2512bdc
+title: >-
+  Use the d3.max and d3.min Functions to Find Minimum and Maximum Values in a
+  Dataset
+challengeType: 6
+forumTopicId: 301496
+dashedName: >-
+  use-the-d3-max-and-d3-min-functions-to-find-minimum-and-maximum-values-in-a-dataset
+---
+
+# --description--
+
+The D3 methods `domain()` and `range()` 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 - `min()` and `max()` to return this information. Here's an example:
+
+```js
+const exampleData = [34, 234, 73, 90, 6, 52];
+d3.min(exampleData)
+d3.max(exampleData)
+```
+
+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 `min()` and `max()` methods take a callback function. In this example, the callback function's argument `d` 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:
+
+```js
+const locationData = [[1, 7],[6, 3],[8, 3]];
+const minX = d3.min(locationData, (d) => d[0]);
+```
+
+`minX` would have the value `1`.
+
+# --instructions--
+
+The `positionData` array holds sub arrays of x, y, and z coordinates. Use a D3 method to find the maximum value of the z coordinate (the third value) from the arrays and save it in the `output` variable.
+
+# --hints--
+
+The text in the `h2` should be `8`.
+
+```js
+assert(output == 8 && $('h2').text() == '8');
+```
+
+Your code should use the `max()` method.
+
+```js
+assert(
+  code.match(/\.max/g),
+  'Your code should use the <code>max()</code> method.'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<body>
+  <script>
+    const positionData = [[1, 7, -4],[6, 3, 8],[2, 9, 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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const positionData = [[1, 7, -4],[6, 3, 8],[2, 9, 3]]
+
+    const output = d3.max(positionData, (d) => d[2])
+
+    d3.select("body")
+      .append("h2")
+      .text(output)
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
new file mode 100644
index 0000000000..bcf31464ca
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-data-in-d3.md
@@ -0,0 +1,105 @@
+---
+id: 587d7fa7367417b2b2512bc4
+title: Work with Data in D3
+challengeType: 6
+forumTopicId: 301497
+dashedName: work-with-data-in-d3
+---
+
+# --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 `data()` 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 `enter()` method for this purpose.
+
+When `enter()` is combined with the `data()` 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 `ul` element and creates a new list item based on the number of entries in the array:
+
+```html
+<body>
+  <ul></ul>
+  <script>
+    const dataset = ["a", "b", "c"];
+    d3.select("ul").selectAll("li")
+      .data(dataset)
+      .enter()
+      .append("li")
+      .text("New item");
+  </script>
+</body>
+```
+
+It may seem confusing to select elements that don't exist yet. This code is telling D3 to first select the `ul` on the page. Next, select all list items, which returns an empty selection. Then the `data()` method reviews the dataset and runs the following code three times, once for each item in the array. The `enter()` method sees there are no `li` elements on the page, but it needs 3 (one for each piece of data in `dataset`). New `li` elements are appended to the `ul` and have the text `New item`.
+
+# --instructions--
+
+Select the `body` node, then select all `h2` elements. Have D3 create and append an `h2` tag for each item in the `dataset` array. The text in the `h2` should say `New Title`. Your code should use the `data()` and `enter()` methods.
+
+# --hints--
+
+Your document should have 9 `h2` elements.
+
+```js
+assert($('h2').length == 9);
+```
+
+The text in the `h2` elements should say `New Title`. The capitalization and spacing should match exactly.
+
+```js
+assert(
+  $('h2')
+    .text()
+    .match(/New Title/g).length == 9
+);
+```
+
+Your code should use the `data()` method.
+
+```js
+assert(code.match(/\.data/g));
+```
+
+Your code should use the `enter()` method.
+
+```js
+assert(code.match(/\.enter/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<body>
+  <script>
+    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];
+
+    d3.select("body")
+      .selectAll("h2")
+      .data(dataset)
+      .enter()
+      .append("h2")
+      .text("New Title")
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
new file mode 100644
index 0000000000..3b4a59ff1f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/data-visualization-with-d3/work-with-dynamic-data-in-d3.md
@@ -0,0 +1,122 @@
+---
+id: 587d7fa7367417b2b2512bc5
+title: Work with Dynamic Data in D3
+challengeType: 6
+forumTopicId: 301498
+dashedName: work-with-dynamic-data-in-d3
+---
+
+# --description--
+
+The last two challenges cover the basics of displaying data dynamically with D3 using the `data()` and `enter()` methods. These methods take a data set and, together with the `append()` method, create a new DOM element for each entry in the data set.
+
+In the previous challenge, you created a new `h2` element for each item in the `dataset` array, but they all contained the same text, `New Title`. This is because you have not made use of the data that is bound to each of the `h2` elements.
+
+The D3 `text()` method can take a string or a callback function as an argument:
+
+```js
+selection.text((d) => d)
+```
+
+In the example above, the parameter `d` refers to a single entry in the dataset that a selection is bound to.
+
+Using the current example as context, the first `h2` element is bound to 12, the second `h2` element is bound to 31, the third `h2` element is bound to 22, and so on.
+
+# --instructions--
+
+Change the `text()` method so that each `h2` element displays the corresponding value from the `dataset` array with a single space and the string `USD`. For example, the first heading should be `12 USD`.
+
+# --hints--
+
+The first `h2` should have the text `12 USD`.
+
+```js
+assert($('h2').eq(0).text() == '12 USD');
+```
+
+The second `h2` should have the text `31 USD`.
+
+```js
+assert($('h2').eq(1).text() == '31 USD');
+```
+
+The third `h2` should have the text `22 USD`.
+
+```js
+assert($('h2').eq(2).text() == '22 USD');
+```
+
+The fourth `h2` should have the text `17 USD`.
+
+```js
+assert($('h2').eq(3).text() == '17 USD');
+```
+
+The fifth `h2` should have the text `25 USD`.
+
+```js
+assert($('h2').eq(4).text() == '25 USD');
+```
+
+The sixth `h2` should have the text `18 USD`.
+
+```js
+assert($('h2').eq(5).text() == '18 USD');
+```
+
+The seventh `h2` should have the text `29 USD`.
+
+```js
+assert($('h2').eq(6).text() == '29 USD');
+```
+
+The eighth `h2` should have the text `14 USD`.
+
+```js
+assert($('h2').eq(7).text() == '14 USD');
+```
+
+The ninth `h2` should have the text `9 USD`.
+
+```js
+assert($('h2').eq(8).text() == '9 USD');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<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`);
+
+  </script>
+</body>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
new file mode 100644
index 0000000000..50b0ee7a2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/access-the-json-data-from-an-api.md
@@ -0,0 +1,167 @@
+---
+id: 587d7fae367417b2b2512be4
+title: Access the JSON Data from an API
+challengeType: 6
+forumTopicId: 301499
+dashedName: 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 `[ ]`. This means that the returned data is an array. The second character in the JSON data is a curly `{` 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 `"id":0` 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 `"codeNames":["Juggernaut","Mrs. Wallace","ButterCup"]`. 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` property of the first cat photo - note that the parsed JSON data in the editor is saved in a variable called `json`:
+
+```js
+console.log(json[0].altText);
+```
+
+The console would display the string `A white cat wearing a green helmet shaped melon on its head.`.
+
+# --instructions--
+
+For the cat with the `id` of 2, print to the console the second value in the `codeNames` array. You should use bracket and dot notation on the object (which is saved in the variable `json`) to access the value.
+
+# --hints--
+
+Your code should use bracket and dot notation to access the proper code name, and print `Loki` to the console.
+
+```js
+assert(
+  code.match(
+    /console\s*\.\s*log\s*\(\s*json\s*\[2\]\s*(\.\s*codeNames|\[\s*('|`|")codeNames\2\s*\])\s*\[\s*1\s*\]\s*\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        const 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        const json = JSON.parse(req.responseText);
+        document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+        // Add your code below this line
+        console.log(json[2].codeNames[1]);
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
new file mode 100644
index 0000000000..4550322262
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/change-text-with-click-events.md
@@ -0,0 +1,140 @@
+---
+id: 587d7fad367417b2b2512be2
+title: Change Text with click Events
+challengeType: 6
+forumTopicId: 301500
+dashedName: 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 `message` to say `Here is the message`.
+
+This works by adding the following code within the click event:
+
+```js
+document.getElementsByClassName('message')[0].textContent="Here is the message";
+```
+
+# --instructions--
+
+Add code inside the `onclick` event handler to change the text inside the `message` element to say `Here is the message`.
+
+# --hints--
+
+Your code should use the `document.getElementsByClassName` method to select the element with class `message` and set its `textContent` to the given string.
+
+```js
+assert(
+  code.match(
+    /document\s*\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\s*\.textContent\s*?=\s*?('|")Here is the message\2/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick = function(){
+      // Add your code below this line
+      document.getElementsByClassName('message')[0].textContent = "Here is the message";
+      // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
new file mode 100644
index 0000000000..8678469f29
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/convert-json-data-to-html.md
@@ -0,0 +1,199 @@
+---
+id: 587d7fae367417b2b2512be5
+title: Convert JSON Data to HTML
+challengeType: 6
+forumTopicId: 16807
+dashedName: 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 `forEach` 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 `let html = "";`.
+
+Then, loop through the JSON, adding HTML to the variable that wraps the key names in `strong` tags, followed by the value. When the loop is finished, you render it.
+
+Here's the code that does this:
+
+```js
+let html = "";
+json.forEach(function(val) {
+  const keys = Object.keys(val);
+  html += "<div class = 'cat'>";
+  keys.forEach(function(key) {
+    html += "<strong>" + key + "</strong>: " + val[key] + "<br>";
+  });
+  html += "</div><br>";
+});
+```
+
+**Note:** For this challenge, you need to add new HTML elements to the page, so you cannot rely on `textContent`. Instead, you need to use `innerHTML`, which can make a site vulnerable to cross-site scripting attacks.
+
+# --instructions--
+
+Add a `forEach` method to loop over the JSON data and create the HTML elements to display it.
+
+Here is some example JSON:
+
+```json
+[
+  {
+    "id":0,
+      "imageLink":"https://s3.amazonaws.com/freecodecamp/funny-cat.jpg",
+      "altText":"A white cat wearing a green helmet shaped melon on its head. ",
+      "codeNames":[ "Juggernaut", "Mrs. Wallace", "Buttercup"
+    ]
+  }
+]
+```
+
+# --hints--
+
+Your code should store the data in the `html` variable
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/html(\+=|=html\+)/g))
+```
+
+Your code should use a `forEach` method to loop over the JSON data from the API.
+
+```js
+assert(code.match(/json\.forEach/g));
+```
+
+Your code should wrap the key names in `strong` tags.
+
+```js
+assert(code.match(/<strong>.+<\/strong>/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let html = "";
+        // Add your code below this line
+        json.forEach(function(val) {
+          var keys = Object.keys(val);
+          html += "<div class = 'cat'>";
+          keys.forEach(function(key) {
+          html += "<strong>" + key + "</strong>: " + val[key] + "<br>";
+        });
+        html += "</div><br>";
+        });
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
new file mode 100644
index 0000000000..bed1c43e98
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-geolocation-data-to-find-a-users-gps-coordinates.md
@@ -0,0 +1,98 @@
+---
+id: 587d7faf367417b2b2512be8
+title: Get Geolocation Data to Find A User's GPS Coordinates
+challengeType: 6
+forumTopicId: 18188
+dashedName: get-geolocation-data-to-find-a-users-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:
+
+```js
+if (navigator.geolocation){
+  navigator.geolocation.getCurrentPosition(function(position) {
+    document.getElementById('data').innerHTML="latitude: " + position.coords.latitude + "<br>longitude: " + position.coords.longitude;
+  });
+}
+```
+
+First, it checks if the `navigator.geolocation` object exists. If it does, the `getCurrentPosition` 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 `position` object's values for latitude and longitude using dot notation and updates the HTML.
+
+# --instructions--
+
+Add the example code inside the `script` tags to check a user's current location and insert it into the HTML.
+
+# --hints--
+
+Your code should use `navigator.geolocation` to access the user's current location.
+
+```js
+assert(code.match(/navigator\.geolocation\.getCurrentPosition/g));
+```
+
+Your code should use `position.coords.latitude` to display the user's latitudinal location.
+
+```js
+assert(code.match(/position\.coords\.latitude/g));
+```
+
+Your code should use `position.coords.longitude` to display the user's longitudinal location.
+
+```js
+assert(code.match(/position\.coords\.longitude/g));
+```
+
+You should display the user's position within the `div` element with `id="data"`.
+
+```js
+assert(
+  code.match(/document\.getElementById\(\s*?('|")data\1\s*?\)\.innerHTML/g)
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  // Add your code below this line
+
+
+  // Add your code above this line
+</script>
+<h4>You are here:</h4>
+<div id="data">
+
+</div>
+```
+
+# --solutions--
+
+```html
+<script>
+  // Add your code below this line
+  if (navigator.geolocation) {
+    navigator.geolocation.getCurrentPosition(function(position) {
+      document.getElementById('data').innerHTML = "latitude: " + position.coords.latitude + "<br>longitude: " + position.coords.longitude;
+    });
+  }
+  // Add your code above this line
+</script>
+<h4>You are here:</h4>
+<div id="data">
+
+</div>
+
+</section>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
new file mode 100644
index 0000000000..f1a4c26f29
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-fetch-method.md
@@ -0,0 +1,174 @@
+---
+id: 5ccfad82bb2dc6c965a848e5
+title: Get JSON with the JavaScript fetch method
+challengeType: 6
+forumTopicId: 301501
+dashedName: get-json-with-the-javascript-fetch-method
+---
+
+# --description--
+
+Another way to request external data is to use the JavaScript `fetch()` method. It is equivalent to `XMLHttpRequest`, but the syntax is considered easier to understand.
+
+Here is the code for making a GET request to `/json/cats.json`
+
+```js
+
+fetch('/json/cats.json')
+	.then(response => response.json())
+	.then(data => {
+		document.getElementById('message').innerHTML = JSON.stringify(data);
+	})
+
+```
+
+Take a look at each piece of this code.
+
+The first line is the one that makes the request. So, `fetch(URL)` makes a `GET` request to the URL specified. The method returns a Promise.
+
+After a Promise is returned, if the request was successful, the `then` method is executed, which takes the response and converts it to JSON format.
+
+The `then` method also returns a Promise, which is handled by the next `then` method. The argument in the second `then` is the JSON object you are looking for!
+
+Now, it selects the element that will receive the data by using `document.getElementById()`. Then it modifies the HTML code of the element by inserting a string created from the JSON object returned from the request.
+
+# --instructions--
+
+Update the code to create and send a `GET` request to the freeCodeCamp Cat Photo API. But this time, using the `fetch` method instead of `XMLHttpRequest`.
+
+# --hints--
+
+Your code should make a `GET` request with `fetch`.
+
+```js
+assert(code.match(/fetch\s*\(\s*('|")\/json\/cats\.json\1\s*\)/g));
+```
+
+Your code should use `then` to convert the response to JSON.
+
+```js
+assert(
+  code.match(
+    /\.then\s*\(\s*\(?(?<var>\w+)\)?\s*=>\s*\k<var>\s*\.json\s*\(\s*\)\s*\)/g
+  )
+);
+```
+
+Your code should use `then` to handle the data converted to JSON by the other `then`.
+
+```js
+assert(__helpers.removeWhiteSpace(code).match(/\.then\(\(?\w+\)?=>{[^}]*}\)/g));
+```
+
+Your code should get the element with id `message` and change its inner HTML to the string of JSON data.
+
+```js
+assert(
+  __helpers.removeWhiteSpace(code).match(
+    /document\.getElementById\(('|")message\1\)\.innerHTML=JSON\.stringify\(?\w+\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick= () => {
+      // 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 id="message" class="box">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick= () => {
+      fetch('/json/cats.json')
+        .then(response => response.json())
+        .then(data => {
+          document.getElementById('message').innerHTML=JSON.stringify(data);
+        })
+    };
+  });
+</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 id="message" class="box">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
new file mode 100644
index 0000000000..0136675396
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/get-json-with-the-javascript-xmlhttprequest-method.md
@@ -0,0 +1,196 @@
+---
+id: 587d7fae367417b2b2512be3
+title: Get JSON with the JavaScript XMLHttpRequest Method
+challengeType: 6
+forumTopicId: 301502
+dashedName: 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 `{` and a `}`.
+
+These properties and their values are often referred to as "key-value pairs".
+
+However, JSON transmitted by APIs are sent as `bytes`, and your application receives it as a `string`. These can be converted into JavaScript objects, but they are not JavaScript objects by default. The `JSON.parse` 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:
+
+```js
+const req = new XMLHttpRequest();
+req.open("GET",'/json/cats.json',true);
+req.send();
+req.onload = function(){
+  const json = JSON.parse(req.responseText);
+  document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+};
+```
+
+Here's a review of what each piece is doing. The JavaScript `XMLHttpRequest` object has a number of properties and methods that are used to transfer data. First, an instance of the `XMLHttpRequest` object is created and saved in the `req` variable. Next, the `open` method initializes a request - this example is requesting data from an API, therefore is a `GET` request. The second argument for `open` is the URL of the API you are requesting data from. The third argument is a Boolean value where `true` makes it an asynchronous request. The `send` method sends the request. Finally, the `onload` event handler parses the returned data and applies the `JSON.stringify` method to convert the JavaScript object into a string. This string is then inserted as the message text.
+
+# --instructions--
+
+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.
+
+# --hints--
+
+Your code should create a new `XMLHttpRequest`.
+
+```js
+assert(code.match(/new\s+?XMLHttpRequest\(\s*?\)/g));
+```
+
+Your code should use the `open` method to initialize a `GET` request to the freeCodeCamp Cat Photo API.
+
+```js
+assert(
+  code.match(
+    /\.open\(\s*?('|")GET\1\s*?,\s*?('|")\/json\/cats\.json\2\s*?,\s*?true\s*?\)/g
+  )
+);
+```
+
+Your code should use the `send` method to send the request.
+
+```js
+assert(code.match(/\.send\(\s*\)/g));
+```
+
+Your code should have an `onload` event handler set to a function.
+
+```js
+assert(
+  code.match(/\.onload\s*=\s*(function|\(\s*?\))\s*?(\(\s*?\)|\=\>)\s*?{/g)
+);
+```
+
+Your code should use the `JSON.parse` method to parse the `responseText`.
+
+```js
+assert(code.match(/JSON\s*\.parse\(\s*.*\.responseText\s*\)/g));
+```
+
+Your code should get the element with class `message` and change its inner HTML to the string of JSON data.
+
+```js
+assert(
+  code.match(
+    /document\s*\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\s*\.innerHTML\s*?=\s*?JSON\.stringify\(.+?\)/g
+  )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded',function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open('GET', '/json/cats.json', true);
+      req.send();
+      req.onload = () => {
+        const json = JSON.parse(req.responseText);
+        document.getElementsByClassName('message')[0].innerHTML = JSON.stringify(json);
+      };
+    };
+  });
+</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>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
new file mode 100644
index 0000000000..5d57a07236
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/handle-click-events-with-javascript-using-the-onclick-property.md
@@ -0,0 +1,140 @@
+---
+id: 587d7fad367417b2b2512be1
+title: Handle Click Events with JavaScript using the onclick property
+challengeType: 6
+forumTopicId: 301503
+dashedName: 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 `DOMContentLoaded`. Here's the code that does this:
+
+```js
+document.addEventListener('DOMContentLoaded', function() {
+
+});
+```
+
+You can implement event handlers that go inside of the `DOMContentLoaded` function. You can implement an `onclick` event handler which triggers when the user clicks on the element with id `getMessage`, by adding the following code:
+
+```js
+document.getElementById('getMessage').onclick = function(){};
+```
+
+# --instructions--
+
+Add a click event handler inside of the `DOMContentLoaded` function for the element with id of `getMessage`.
+
+# --hints--
+
+Your code should use the `document.getElementById` method to select the `getMessage` element.
+
+```js
+assert(code.match(/document\s*\.getElementById\(\s*?('|")getMessage\1\s*?\)/g));
+```
+
+Your code should add an `onclick` event handler.
+
+```js
+assert(typeof document.getElementById('getMessage').onclick === 'function');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    // Add your code below this line
+    document.getElementById('getMessage').onclick = function(){ };
+    // 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>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
new file mode 100644
index 0000000000..059f7dce49
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/post-data-with-the-javascript-xmlhttprequest-method.md
@@ -0,0 +1,206 @@
+---
+id: 587d7faf367417b2b2512be9
+title: Post Data with the JavaScript XMLHttpRequest Method
+challengeType: 6
+forumTopicId: 301504
+dashedName: 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 `XMLHttpRequest` method is also used to post data to a server. Here's an example:
+
+```js
+const xhr = new XMLHttpRequest();
+xhr.open('POST', url, true);
+xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8');
+xhr.onreadystatechange = function () {
+  if (xhr.readyState === 4 && xhr.status === 201){
+    const serverResponse = JSON.parse(xhr.response);
+    document.getElementsByClassName('message')[0].textContent = serverResponse.userName + serverResponse.suffix;
+  }
+};
+const body = JSON.stringify({ userName: userName, suffix: ' loves cats!' });
+xhr.send(body);
+```
+
+You've seen several of these methods before. Here the `open` method initializes the request as a `POST` to the given URL of the external resource, and uses the `true` Boolean to make it asynchronous. The `setRequestHeader` method sets the value of an HTTP request header, which contains information about the sender and the request. It must be called after the `open` method, but before the `send` method. The two parameters are the name of the header and the value to set as the body of that header. Next, the `onreadystatechange` event listener handles a change in the state of the request. A `readyState` of `4` means the operation is complete, and a `status` of `201` means it was a successful request. The document's HTML can be updated. Finally, the `send` method sends the request with the `body` value, which the `userName` key was given by the user in the `input` field.
+
+# --instructions--
+
+Update the code so it makes a `POST` request to the API endpoint. Then type your name in the input field and click `Send Message`. Your AJAX function should replace `Reply from Server will be here.` with data from the server. Format the response to display your name appended with the text ` loves cats`.
+
+# --hints--
+
+Your code should create a new `XMLHttpRequest`.
+
+```js
+assert(code.match(/new\s+?XMLHttpRequest\(\s*?\)/g));
+```
+
+Your code should use the `open` method to initialize a `POST` request to the server.
+
+```js
+assert(code.match(/\.open\(\s*?('|")POST\1\s*?,\s*?url\s*?,\s*?true\s*?\)/g));
+```
+
+Your code should use the `setRequestHeader` method.
+
+```js
+assert(
+  code.match(
+    /\.setRequestHeader\(\s*?('|")Content-Type\1\s*?,\s*?('|")application\/json;\s*charset=UTF-8\2\s*?\)/g
+  )
+);
+```
+
+Your code should have an `onreadystatechange` event handler set to a function.
+
+```js
+assert(code.match(/\.onreadystatechange\s*?=/g));
+```
+
+Your code should get the element with class `message` and change its `textContent` to `userName loves cats`
+
+```js
+assert(
+  code.match(
+    /document\.getElementsByClassName\(\s*?('|")message\1\s*?\)\[0\]\.textContent\s*?=\s*?.+?\.userName\s*?\+\s*?.+?\.suffix/g
+  )
+);
+```
+
+Your code should use the `send` method.
+
+```js
+assert(code.match(/\.send\(\s*?body\s*?\)/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('sendMessage').onclick = function(){
+
+      const userName = document.getElementById('name').value;
+      const url = 'https://jsonplaceholder.typicode.com/posts';
+      // 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('sendMessage').onclick = function(){
+
+      const userName = document.getElementById('name').value;
+      const url = 'https://jsonplaceholder.typicode.com/posts';
+      // Add your code below this line
+      const xhr = new XMLHttpRequest();
+      xhr.open('POST', url, true);
+      xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8');
+      xhr.onreadystatechange = function () {
+        if (xhr.readyState === 4 && xhr.status === 201){
+          const serverResponse = JSON.parse(xhr.response);
+          document.getElementsByClassName('message')[0].textContent = serverResponse.userName + serverResponse.suffix;
+       }
+     };
+     const body = JSON.stringify({ userName: userName, suffix: ' loves cats!' });
+     xhr.send(body);
+      // 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">
+  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>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
new file mode 100644
index 0000000000..749e3e3589
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/pre-filter-json-to-get-the-data-you-need.md
@@ -0,0 +1,171 @@
+---
+id: 587d7fae367417b2b2512be7
+title: Pre-filter JSON to Get the Data You Need
+challengeType: 6
+forumTopicId: 18257
+dashedName: 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 `filter` method to filter out the cat whose `id` key has a value of `1`.
+
+Here's the code to do this:
+
+```js
+json = json.filter(function(val) {
+  return (val.id !== 1);
+});
+```
+
+# --instructions--
+
+Add code to `filter` the json data to remove the cat with the `id` value of `1`.
+
+# --hints--
+
+Your code should use the `filter` method.
+
+```js
+assert(code.match(/json\.filter/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload=function(){
+        let json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json', true);
+      req.send();
+      req.onload = function(){
+        let json = JSON.parse(req.responseText);
+        let html = "";
+        // Add your code below this line
+        json = json.filter(function(val) {
+          return (val.id !== 1);
+        });
+
+        // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
new file mode 100644
index 0000000000..2091e71567
--- /dev/null
+++ b/curriculum/challenges/portuguese/04-data-visualization/json-apis-and-ajax/render-images-from-data-sources.md
@@ -0,0 +1,163 @@
+---
+id: 587d7fae367417b2b2512be6
+title: Render Images from Data Sources
+challengeType: 6
+forumTopicId: 18265
+dashedName: render-images-from-data-sources
+---
+
+# --description--
+
+The last few challenges showed that each object in the JSON array contains an `imageLink` key with a value that is the URL of a cat's image.
+
+When you're looping through these objects, you can use this `imageLink` property to display this image in an `img` element.
+
+Here's the code that does this:
+
+```js
+html += "<img src = '" + val.imageLink + "' " + "alt='" + val.altText + "'>";
+```
+
+# --instructions--
+
+Add code to use the `imageLink` and `altText` properties in an `img` tag.
+
+# --hints--
+
+You should use the `imageLink` property to display the images.
+
+```js
+assert(code.match(/val\.imageLink/g));
+```
+
+You should use the `altText` for the `alt` attribute values of the images.
+
+```js
+assert(code.match(/val\.altText/g));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req=new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let 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>
+```
+
+# --solutions--
+
+```html
+<script>
+  document.addEventListener('DOMContentLoaded', function(){
+    document.getElementById('getMessage').onclick = function(){
+      const req = new XMLHttpRequest();
+      req.open("GET",'/json/cats.json',true);
+      req.send();
+      req.onload = function(){
+        const json = JSON.parse(req.responseText);
+        let html = "";
+        json.forEach(function(val) {
+          html += "<div class = 'cat'>";
+          // Add your code below this line
+          html += "<img src = '" + val.imageLink + "' " + "alt='" + val.altText + "'>";
+          // 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">
+  The message will go here
+</p>
+<p>
+  <button id="getMessage">
+    Get Message
+  </button>
+</p>
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
new file mode 100644
index 0000000000..433855e9c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/exercise-tracker.md
@@ -0,0 +1,255 @@
+---
+id: 5a8b073d06fa14fcfde687aa
+title: Exercise Tracker
+challengeType: 4
+forumTopicId: 301505
+dashedName: exercise-tracker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://exercise-tracker.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-exercisetracker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  const url = getUserInput('url');
+  assert(
+    !/.*\/exercise-tracker\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You can `POST` to `/api/users` with form data `username` to create a new user. The returned response will be an object with `username` and `_id` properties.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    assert.exists(_id);
+    assert.exists(username);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can make a `GET` request to `/api/users` to get an array of all users. Each element in the array is an object containing a user's `username` and `_id`.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users');
+  if (res.ok) {
+    const data = await res.json();
+    assert.isArray(data);
+    assert.isString(data[0].username);
+    assert.isString(data[0]._id);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can `POST` to `/api/users/:_id/exercises` with form data `description`, `duration`, and optionally `date`. If no date is supplied, the current date will be used. The response returned will be the user object with the exercise fields added.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: 'Mon Jan 01 1990'
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-01`
+    });
+    if (addRes.ok) {
+      const actual = await addRes.json();
+      assert.deepEqual(actual, expected);
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can make a `GET` request to `/api/users/:_id/logs` to retrieve a full exercise log of any user. The returned response will be the user object with a `log` array of all the exercises added. Each log item has the `description`, `duration`, and `date` properties.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}`
+    });
+    if (addRes.ok) {
+      const logRes = await fetch(url + `/api/users/${_id}/logs`);
+      if (logRes.ok) {
+        const { log } = await logRes.json();
+        assert.isArray(log);
+        assert.equal(1, log.length);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+A request to a user's log (`/api/users/:_id/logs`) returns an object with a `count` property representing the number of exercises returned.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}`
+    });
+    if (addRes.ok) {
+      const logRes = await fetch(url + `/api/users/${_id}/logs`);
+      if (logRes.ok) {
+        const { count } = await logRes.json();
+        assert(count);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${addRes.status} ${addRes.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can add `from`, `to` and `limit` parameters to a `/api/users/:_id/logs` request to retrieve part of the log of any user. `from` and `to` are dates in `yyyy-mm-dd` format. `limit` is an integer of how many logs to send back.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/users', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `username=fcc_test_${Date.now()}`.substr(0, 29)
+  });
+  if (res.ok) {
+    const { _id, username } = await res.json();
+    const expected = {
+      username,
+      description: 'test',
+      duration: 60,
+      _id,
+      date: new Date().toDateString()
+    };
+    const addExerciseRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-01`
+    });
+    const addExerciseTwoRes = await fetch(url + `/api/users/${_id}/exercises`, {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+      body: `description=${expected.description}&duration=${expected.duration}&date=1990-01-02`
+    });
+    if (addExerciseRes.ok && addExerciseTwoRes.ok) {
+      const logRes = await fetch(
+        url + `/api/users/${_id}/logs?from=1989-12-31&to=1990-01-03`
+      );
+      if (logRes.ok) {
+        const { log } = await logRes.json();
+        assert.isArray(log);
+        assert.equal(2, log.length);
+      } else {
+        throw new Error(`${logRes.status} ${logRes.statusText}`);
+      }
+      const limitRes = await fetch(
+        url + `/api/users/${_id}/logs?limit=1`
+      );
+      if (limitRes.ok) {
+        const { log } = await limitRes.json();
+        assert.isArray(log);
+        assert.equal(1, log.length);
+      } else {
+        throw new Error(`${limitRes.status} ${limitRes.statusText}`);
+      }
+    } else {
+      throw new Error(`${res.status} ${res.statusText}`);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
new file mode 100644
index 0000000000..da459a9f3f
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/file-metadata-microservice.md
@@ -0,0 +1,88 @@
+---
+id: bd7158d8c443edefaeb5bd0f
+title: File Metadata Microservice
+challengeType: 4
+forumTopicId: 301506
+dashedName: file-metadata-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://file-metadata-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-filemetadata/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-filemetadata) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+**HINT:** You can use the `multer` npm package to handle file uploading.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/file-metadata-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can submit a form that includes a file upload.
+
+```js
+async (getUserInput) => {
+  const site = await fetch(getUserInput('url'));
+  const data = await site.text();
+  const doc = new DOMParser().parseFromString(data, 'text/html');
+  assert(doc.querySelector('input[type="file"]'));
+};
+```
+
+The form file input field has the `name` attribute set to `upfile`.
+
+```js
+async (getUserInput) => {
+  const site = await fetch(getUserInput('url'));
+  const data = await site.text();
+  const doc = new DOMParser().parseFromString(data, 'text/html');
+  assert(doc.querySelector('input[name="upfile"]'));
+};
+```
+
+When you submit a file, you receive the file `name`, `type`, and `size` in bytes within the JSON response.
+
+```js
+async (getUserInput) => {
+  const formData = new FormData();
+  const fileData = await fetch(
+    'https://cdn.freecodecamp.org/weather-icons/01d.png'
+  );
+  const file = await fileData.blob();
+  formData.append('upfile', file, 'icon');
+  const data = await fetch(getUserInput('url') + '/api/fileanalyse', {
+    method: 'POST',
+    body: formData
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'size');
+  assert.equal(parsed.name, 'icon');
+  assert.equal(parsed.type, 'image/png');
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
new file mode 100644
index 0000000000..de86d19ddb
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/request-header-parser-microservice.md
@@ -0,0 +1,77 @@
+---
+id: bd7158d8c443edefaeb5bdff
+title: Request Header Parser Microservice
+challengeType: 4
+forumTopicId: 301507
+dashedName: request-header-parser-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://request-header-parser-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-headerparser/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-headerparser) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/request-header-parser-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+A request to `/api/whoami` should return a JSON object with your IP address in the `ipaddress` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.ipaddress && data.ipaddress.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/whoami` should return a JSON object with your preferred language in the `language` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.language && data.language.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/whoami` should return a JSON object with your software in the `software` key.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/whoami').then(
+    (data) => assert(data.software && data.software.length > 0),
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
new file mode 100644
index 0000000000..00cee8bcd6
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/timestamp-microservice.md
@@ -0,0 +1,154 @@
+---
+id: bd7158d8c443edefaeb5bdef
+title: Timestamp Microservice
+challengeType: 4
+forumTopicId: 301508
+dashedName: timestamp-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://timestamp-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-timestamp/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-timestamp) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/timestamp-microservice\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+A request to `/api/:date?` with a valid date should return a JSON object with a `unix` key that is a Unix timestamp of the input date in milliseconds
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/2016-12-25').then(
+    (data) => {
+      assert.equal(
+        data.unix,
+        1482624000000,
+        'Should be a valid unix timestamp'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/:date?` with a valid date should return a JSON object with a `utc` key that is a string of the input date in the format: `Thu, 01 Jan 1970 00:00:00 GMT`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/2016-12-25').then(
+    (data) => {
+      assert.equal(
+        data.utc,
+        'Sun, 25 Dec 2016 00:00:00 GMT',
+        'Should be a valid UTC date string'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+A request to `/api/1451001600000` should return `{ unix: 1451001600000, utc: "Fri, 25 Dec 2015 00:00:00 GMT" }`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/1451001600000').then(
+    (data) => {
+      assert(
+        data.unix === 1451001600000 &&
+          data.utc === 'Fri, 25 Dec 2015 00:00:00 GMT'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+Your project can handle dates that can be successfully parsed by `new Date(date_string)`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/05 October 2011').then(
+    (data) => {
+      assert(
+        data.unix === 1317772800000 &&
+          data.utc === 'Wed, 05 Oct 2011 00:00:00 GMT'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+If the input date string is invalid, the api returns an object having the structure `{ error : "Invalid Date" }`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api/this-is-not-a-date').then(
+    (data) => {
+      assert.equal(data.error.toLowerCase(), 'invalid date');
+    },
+    (xhr) => {
+      assert(xhr.responseJSON.error.toLowerCase() === 'invalid date');
+    }
+  );
+```
+
+An empty date parameter should return the current time in a JSON object with a `unix` key
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api').then(
+    (data) => {
+      var now = Date.now();
+      assert.approximately(data.unix, now, 20000);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+An empty date parameter should return the current time in a JSON object with a `utc` key
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/api').then(
+    (data) => {
+      var now = Date.now();
+      var serverTime = new Date(data.utc).getTime();
+      assert.approximately(serverTime, now, 20000);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
new file mode 100644
index 0000000000..34bf3e3fa6
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/apis-and-microservices-projects/url-shortener-microservice.md
@@ -0,0 +1,119 @@
+---
+id: bd7158d8c443edefaeb5bd0e
+title: URL Shortener Microservice
+challengeType: 4
+forumTopicId: 301509
+dashedName: url-shortener-microservice
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://url-shortener-microservice.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-urlshortener/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-urlshortener) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+**HINT:** Do not forget to use a body parsing middleware to handle the POST requests. Also, you can use the function `dns.lookup(host, cb)` from the `dns` core module to verify a submitted URL.
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/url-shortener-microservice\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can POST a URL to `/api/shorturl` and get a JSON response with `original_url` and `short_url` properties. Here's an example: `{ original_url : 'https://freeCodeCamp.org', short_url : 1}`
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const urlVariable = Date.now();
+  const fullUrl = `${url}/?v=${urlVariable}`
+  const res = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=${fullUrl}`
+  });
+  if (res.ok) {
+    const { short_url, original_url } = await res.json();
+    assert.isNotNull(short_url);
+    assert.strictEqual(original_url, `${url}/?v=${urlVariable}`);
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+When you visit `/api/shorturl/<short_url>`, you will be redirected to the original URL.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const urlVariable = Date.now();
+  const fullUrl = `${url}/?v=${urlVariable}`
+  let shortenedUrlVariable;
+  const postResponse = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=${fullUrl}`
+  });
+  if (postResponse.ok) {
+    const { short_url } = await postResponse.json();
+    shortenedUrlVariable = short_url;
+  } else {
+    throw new Error(`${postResponse.status} ${postResponse.statusText}`);
+  }
+  const getResponse = await fetch(
+    url + '/api/shorturl/' + shortenedUrlVariable
+  );
+  if (getResponse) {
+    const { redirected, url } = getResponse;
+    assert.isTrue(redirected);
+    assert.strictEqual(url,fullUrl);
+  } else {
+    throw new Error(`${getResponse.status} ${getResponse.statusText}`);
+  }
+};
+```
+
+If you pass an invalid URL that doesn't follow the valid `http://www.example.com` format, the JSON response will contain `{ error: 'invalid url' }`
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/shorturl', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+    body: `url=ftp:/john-doe.org`
+  });
+  if (res.ok) {
+    const { error } = await res.json();
+    assert.isNotNull(error);
+    assert.strictEqual(error.toLowerCase(), 'invalid url');
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
new file mode 100644
index 0000000000..d68ab003f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/chain-middleware-to-create-a-time-server.md
@@ -0,0 +1,79 @@
+---
+id: 587d7fb1367417b2b2512bf4
+title: Chain Middleware to Create a Time Server
+challengeType: 2
+forumTopicId: 301510
+dashedName: chain-middleware-to-create-a-time-server
+---
+
+# --description--
+
+Middleware can be mounted at a specific route using `app.METHOD(path, middlewareFunction)`. Middleware can also be chained inside route definition.
+
+Look at the following example:
+
+```js
+app.get('/user', function(req, res, next) {
+  req.user = getTheUserSync();  // Hypothetical synchronous operation
+  next();
+}, function(req, res) {
+  res.send(req.user);
+});
+```
+
+This approach is useful to split the server operations into smaller units. That leads 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.
+
+# --instructions--
+
+In the route `app.get('/now', ...)` chain a middleware function and the final handler. In the middleware function you should add the current time to the request object in the `req.time` key. You can use `new Date().toString()`. In the handler, respond with a JSON object, taking the structure `{time: req.time}`.
+
+**Note:** 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.
+
+# --hints--
+
+The /now endpoint should have mounted middleware
+
+```js
+(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);
+    }
+  );
+```
+
+The /now endpoint should return a time that is +/- 20 secs from now
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
new file mode 100644
index 0000000000..8398c13973
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-data-from-post-requests.md
@@ -0,0 +1,78 @@
+---
+id: 587d7fb2367417b2b2512bf8
+title: Get Data from POST Requests
+challengeType: 2
+forumTopicId: 301511
+dashedName: get-data-from-post-requests
+---
+
+# --description--
+
+Mount a POST handler at the path `/name`. 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 `req.body`. Have a look at the usual library example:
+
+<blockquote>route: POST '/library'<br>urlencoded_body: userId=546&#x26;bookId=6754 <br>req.body: {userId: '546', bookId: '6754'}</blockquote>
+
+Respond with the same JSON object as before: `{name: 'firstname lastname'}`. 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 correspondence 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.
+
+# --hints--
+
+Test 1 : Your API endpoint should respond with the correct name
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your API endpoint should respond with the correct name
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
new file mode 100644
index 0000000000..0d301a9f5e
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-query-parameter-input-from-the-client.md
@@ -0,0 +1,67 @@
+---
+id: 587d7fb2367417b2b2512bf6
+title: Get Query Parameter Input from the Client
+challengeType: 2
+forumTopicId: 301512
+dashedName: 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 `req.query`. Some characters, like the percent (%), cannot be in URLs and have to be encoded in a different format 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&#x26;bookId=6754' <br>req.query: {userId: '546', bookId: '6754'}</blockquote>
+
+# --instructions--
+
+Build an API endpoint, mounted at `GET /name`. Respond with a JSON document, taking the structure `{ name: 'firstname lastname'}`. The first and last name parameters should be encoded in a query string e.g. `?first=firstname&last=lastname`.
+
+**Note:** In the following exercise you are going to receive data from a POST request, at the same `/name` route path. If you want, you can use the method `app.route(path).get(handler).post(handler)`. 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.
+
+# --hints--
+
+Test 1 : Your API endpoint should respond with the correct name
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your API endpoint should respond with the correct name
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
new file mode 100644
index 0000000000..b0055f569e
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/get-route-parameter-input-from-the-client.md
@@ -0,0 +1,65 @@
+---
+id: 587d7fb2367417b2b2512bf5
+title: Get Route Parameter Input from the Client
+challengeType: 2
+forumTopicId: 301513
+dashedName: get-route-parameter-input-from-the-client
+---
+
+# --description--
+
+When building an API, we have to allow users to communicate to 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 by 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 `req.params` object.
+
+<blockquote>route_path: '/user/:userId/book/:bookId'<br>actual_request_URL: '/user/546/book/6754' <br>req.params: {userId: '546', bookId: '6754'}</blockquote>
+
+# --instructions--
+
+Build an echo server, mounted at the route `GET /:word/echo`. Respond with a JSON object, taking the structure `{echo: word}`. You can find the word to be repeated at `req.params.word`. You can test your route from your browser's address bar, visiting some matching routes, e.g. `your-app-rootpath/freecodecamp/echo`.
+
+# --hints--
+
+Test 1 : Your echo server should repeat words correctly
+
+```js
+(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);
+    }
+  );
+```
+
+Test 2 : Your echo server should repeat words correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
new file mode 100644
index 0000000000..2a2faa35c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/implement-a-root-level-request-logger-middleware.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb1367417b2b2512bf3
+title: Implement a Root-Level Request Logger Middleware
+challengeType: 2
+forumTopicId: 301514
+dashedName: implement-a-root-level-request-logger-middleware
+---
+
+# --description--
+
+Earlier, you were introduced to the `express.static()` 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 information to the request or response objects. They can also end the cycle by sending a 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 triggers calling the 3rd argument, `next()`.
+
+Look at the following example:
+
+```js
+function(req, res, next) {
+  console.log("I'm a middleware...");
+  next();
+}
+```
+
+Let’s suppose you 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, you are going to build root-level middleware. As you have seen in challenge 4, to mount a middleware function at root level, you can use the `app.use(<mware-function>)` method. 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 `app.post(<mware-function>)`. Analogous methods exist for all the HTTP verbs (GET, DELETE, PUT, …).
+
+# --instructions--
+
+Build a simple logger. For every request, it should log to the console a string taking the following format: `method path - ip`. An example would look like this: `GET /json - ::ffff:127.0.0.1`. Note that there is a space between `method` and `path` and that the dash separating `path` and `ip` is surrounded by a space on both sides. You can get the request method (http verb), the relative route path, and the caller’s ip from the request object using `req.method`, `req.path` and `req.ip`. Remember to call `next()` 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.
+
+**Note:** 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.
+
+# --hints--
+
+Root level logger middleware should be active
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
new file mode 100644
index 0000000000..5876dde8e5
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/meet-the-node-console.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb0367417b2b2512bed
+title: Meet the Node console
+challengeType: 2
+forumTopicId: 301515
+dashedName: meet-the-node-console
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-express/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-express) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+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 console output in a terminal. On Replit, a terminal is open in the right pane by default.
+
+We recommend to keep the terminal open while working at these challenges. By reading the output in the terminal, you can see any errors that may occur.
+
+# --instructions--
+
+Modify the `myApp.js` file to log "Hello World" to the console.
+
+# --hints--
+
+`"Hello World"` should be in the console
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
new file mode 100644
index 0000000000..1d61867322
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-an-html-file.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb0367417b2b2512bef
+title: Serve an HTML File
+challengeType: 2
+forumTopicId: 301516
+dashedName: serve-an-html-file
+---
+
+# --description--
+
+You can respond to requests with a file using the `res.sendFile(path)` method. You can put it inside the `app.get('/', ...)` 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 `__dirname` to calculate the path like this:
+
+```js
+absolutePath = __dirname + relativePath/file.ext
+```
+
+# --instructions--
+
+Send the `/views/index.html` file as a response to GET requests to the `/` path. If you view your live 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 routes from top to bottom, and executes the handler for the first match. You have to comment out the preceding solution, or the server will keep responding with a string.
+
+# --hints--
+
+Your app should serve the file views/index.html
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
new file mode 100644
index 0000000000..1e977061c7
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-json-on-a-specific-route.md
@@ -0,0 +1,47 @@
+---
+id: 587d7fb1367417b2b2512bf1
+title: Serve JSON on a Specific Route
+challengeType: 2
+forumTopicId: 301517
+dashedName: serve-json-on-a-specific-route
+---
+
+# --description--
+
+While an HTML server serves 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 `/json`. You can do it as usual, with the `app.get()` method. Inside the route handler, use the method `res.json()`, 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 `{key: data}`. `data` can be 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.
+
+# --instructions--
+
+Serve the object `{"message": "Hello json"}` as a response, in JSON format, to GET requests to the `/json` route. Then point your browser to `your-app-url/json`, you should see the message on the screen.
+
+# --hints--
+
+The endpoint `/json` should serve the json object `{"message": "Hello json"}`
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
new file mode 100644
index 0000000000..f3e2796c54
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/serve-static-assets.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb0367417b2b2512bf0
+title: Serve Static Assets
+challengeType: 2
+forumTopicId: 301518
+dashedName: 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 `express.static(path)`, where the `path` parameter is the absolute path of the folder containing the assets.
+
+If you don’t know what middleware is... don’t worry, we will discuss in detail later. Basically, middleware are functions that intercept route handlers, adding some kind of information. A middleware needs to be mounted using the method `app.use(path, middlewareFunction)`. The first `path` argument is optional. If you don’t pass it, the middleware will be executed for all requests.
+
+# --instructions--
+
+Mount the `express.static()` middleware to the path `/public` with `app.use()`. The absolute path to the assets folder is `__dirname + /public`.
+
+Now your app should be able to serve a CSS stylesheet. Note that the `/public/style.css` file is referenced in the `/views/index.html` in the project boilerplate. Your front-page should look a little better now!
+
+# --hints--
+
+Your app should serve asset files from the `/public` directory to the `/public` path
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/style.css').then(
+    (data) => {
+      assert.match(
+        data,
+        /body\s*\{[^\}]*\}/,
+        'Your app does not serve static assets'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
new file mode 100644
index 0000000000..e8e3e82fc5
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/start-a-working-express-server.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb0367417b2b2512bee
+title: Start a Working Express Server
+challengeType: 2
+forumTopicId: 301519
+dashedName: start-a-working-express-server
+---
+
+# --description--
+
+In the first two lines of the file `myApp.js`, you can see how easy it is to create an Express app object. This object has several methods, and you will learn many of them in these challenges. One fundamental method is `app.listen(port)`. It tells your server to listen on a given port, putting it in running state. For testing reasons, we need the app to be running in the background so we added this method in the `server.js` file for you.
+
+Let’s serve our first string! In Express, routes takes the following structure: `app.METHOD(PATH, HANDLER)`. 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 `function(req, res) {...}`, where req is the request object, and res is the response object. For example, the handler
+
+```js
+function(req, res) {
+  res.send('Response String');
+}
+```
+
+will serve the string 'Response String'.
+
+# --instructions--
+
+Use the `app.get()` 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 the preview if you are using Replit.
+
+**Note:** All the code for these lessons should be added in between the few lines of code we have started you off with.
+
+# --hints--
+
+Your app should serve the string 'Hello Express'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
new file mode 100644
index 0000000000..9e0c3a879b
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-body-parser-to-parse-post-requests.md
@@ -0,0 +1,61 @@
+---
+id: 587d7fb2367417b2b2512bf7
+title: Use body-parser to Parse POST Requests
+challengeType: 2
+forumTopicId: 301520
+dashedName: 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 REST convention, POST is used to send data to create new items in the database (a new user, or a new blog post). You don’t have a database in this project, but you 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. The body is a part of the HTTP request, also called the payload. Even though the data is not visible in the URL, this does not mean that it is private. To see why, look at the raw content of an HTTP POST request:
+
+```http
+POST /path/subpath HTTP/1.0
+From: john@example.com
+User-Agent: someBrowser/1.0
+Content-Type: application/x-www-form-urlencoded
+Content-Length: 20
+
+name=John+Doe&age=25
+```
+
+As you can see, the body is encoded like the query string. This is the default format used by HTML forms. With Ajax, you can also use JSON 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, you will use a urlencoded body. To parse the data coming from POST requests, you have to install the `body-parser` package. This package allows you to use a series of middleware, which can decode data in different formats.
+
+# --instructions--
+
+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 urlencoded data is returned by `bodyParser.urlencoded({extended: false})`. Pass to `app.use()` the function returned by the previous method call. As usual, the middleware must be mounted before all the routes which need it.
+
+**Note:** `extended=false` 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.
+
+# --hints--
+
+The 'body-parser' middleware should be mounted
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
new file mode 100644
index 0000000000..e953553f4b
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/basic-node-and-express/use-the-.env-file.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb1367417b2b2512bf2
+title: Use the .env File
+challengeType: 2
+forumTopicId: 301521
+dashedName: use-the--env-file
+---
+
+# --description--
+
+The `.env` 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 `process.env.VAR_NAME`. The `process.env` 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 `.env` 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. `VAR_NAME=value`. Usually, you will put each variable definition on a separate line.
+
+# --instructions--
+
+Let's add an environment variable as a configuration option.
+
+Create a `.env` file in the root of your project directory, and store the variable `MESSAGE_STYLE=uppercase` in it.
+
+Then, in the `/json` GET route handler you created in the last challenge, transform the response object's message to uppercase if `process.env.MESSAGE_STYLE` equals `uppercase`. The response object should either be `{"message": "Hello json"}` or `{"message": "HELLO JSON"}`, depending on the `MESSAGE_STYLE` value.
+
+**Note:** If you are using Replit, you cannot create a `.env` file. Instead, use the built-in <dfn>SECRETS</dfn> tab to add the variable.
+
+# --hints--
+
+The response of the endpoint `/json` should change according to the environment variable `MESSAGE_STYLE`
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
new file mode 100644
index 0000000000..d4f4da4d68
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-description-to-your-package.json.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb3367417b2b2512bfc
+title: Add a Description to Your package.json
+challengeType: 2
+forumTopicId: 301522
+dashedName: add-a-description-to-your-package-json
+---
+
+# --description--
+
+The next part of a good package.json file is the `description` field; where a short, but informative description about your project belongs.
+
+If you some day plan to publish a package to npm, 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, it’s a great way to summarize what a project does. It’s just as important in any Node.js project 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. Here's an example:
+
+```json
+"description": "A project that does something awesome",
+```
+
+# --instructions--
+
+Add a `description` to the package.json file of your project.
+
+**Note:** Remember to use double-quotes for field-names (") and commas (,) to separate fields.
+
+# --hints--
+
+package.json should have a valid "description" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
new file mode 100644
index 0000000000..d97b013401
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-license-to-your-package.json.md
@@ -0,0 +1,48 @@
+---
+id: 587d7fb4367417b2b2512bfe
+title: Add a License to Your package.json
+challengeType: 2
+forumTopicId: 301523
+dashedName: add-a-license-to-your-package-json
+---
+
+# --description--
+
+The `license` field is where you inform users of what they are allowed to do with your project.
+
+Some common licenses for open source projects include MIT and BSD. License information is not required, and 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. Here's an example of the license field:
+
+```json
+"license": "MIT",
+```
+
+# --instructions--
+
+Fill the `license` field in the package.json file of your project as you find suitable.
+
+# --hints--
+
+package.json should have a valid "license" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
new file mode 100644
index 0000000000..a5b3b8b245
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-a-version-to-your-package.json.md
@@ -0,0 +1,46 @@
+---
+id: 587d7fb4367417b2b2512bff
+title: Add a Version to Your package.json
+challengeType: 2
+forumTopicId: 301525
+dashedName: add-a-version-to-your-package-json
+---
+
+# --description--
+
+A `version` is one of the required fields of your package.json file. This field describes the current version of your project. Here's an example:
+
+```json
+"version": "1.2.0",
+```
+
+# --instructions--
+
+Add a `version` to the package.json file of your project.
+
+# --hints--
+
+package.json should have a valid "version" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
new file mode 100644
index 0000000000..33c9742e8b
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/add-keywords-to-your-package.json.md
@@ -0,0 +1,84 @@
+---
+id: 587d7fb4367417b2b2512bfd
+title: Add Keywords to Your package.json
+challengeType: 2
+forumTopicId: 301526
+dashedName: add-keywords-to-your-package-json
+---
+
+# --description--
+
+The `keywords` field is where you can describe your project using related keywords. Here's an example:
+
+```json
+"keywords": [ "descriptive", "related", "words" ],
+```
+
+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 file of your project.
+
+One of the keywords should be "freecodecamp".
+
+# --hints--
+
+package.json should have a valid "keywords" key
+
+```js
+(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);
+    }
+  );
+```
+
+"keywords" field should be an Array
+
+```js
+(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);
+    }
+  );
+```
+
+"keywords" should include "freecodecamp"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
new file mode 100644
index 0000000000..18523e17aa
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/expand-your-project-with-external-packages-from-npm.md
@@ -0,0 +1,77 @@
+---
+id: 587d7fb4367417b2b2512c00
+title: Expand Your Project with External Packages from npm
+challengeType: 2
+forumTopicId: 301527
+dashedName: 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 file.
+
+In this section, packages your project requires are stored using the following format:
+
+```json
+"dependencies": {
+  "package-name": "version",
+  "express": "4.14.0"
+}
+
+```
+
+# --instructions--
+
+Add version "2.14.0" of the "moment" package to the `dependencies` field of your package.json file.
+
+**Note:** Moment is a handy library for working with time and dates.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should be "2.14.0"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
new file mode 100644
index 0000000000..7c3ce74460
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/how-to-use-package.json-the-core-of-any-node.js-project-or-npm-package.md
@@ -0,0 +1,60 @@
+---
+id: 587d7fb3367417b2b2512bfb
+title: 'How to Use package.json, the Core of Any Node.js Project or npm Package'
+challengeType: 2
+forumTopicId: 301528
+dashedName: how-to-use-package-json-the-core-of-any-node-js-project-or-npm-package
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-npm/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-npm) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+The `package.json` file is the center of any Node.js project or npm package. It stores information about your project, similar to how the &lt;head> section of an HTML document describes the content of a webpage. It consists of a single JSON object where information is stored in key-value pairs. There are only two required fields; "name" and "version", but it’s good practice to provide additional information about your project that could be useful to future users or maintainers.
+
+If you look at the file tree of your project, you will find the package.json file on the top level of the tree. This is the file that you will be improving in the next couple of challenges.
+
+One of the most common pieces of information in this file is the `author` field. It specifies who created the project, and can consist of a string or an object with contact or other details. An object is recommended for bigger projects, but a simple string like the following example will do for this project.
+
+```json
+"author": "Jane Doe",
+```
+
+# --instructions--
+
+Add your name as the `author` of the project in the package.json file.
+
+**Note:** Remember that you’re writing JSON, so all field names must use double-quotes (") and be separated with a comma (,).
+
+# --hints--
+
+package.json should have a valid "author" key
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
new file mode 100644
index 0000000000..c1b6abac8a
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/manage-npm-dependencies-by-understanding-semantic-versioning.md
@@ -0,0 +1,73 @@
+---
+id: 587d7fb5367417b2b2512c01
+title: Manage npm Dependencies By Understanding Semantic Versioning
+challengeType: 2
+forumTopicId: 301529
+dashedName: manage-npm-dependencies-by-understanding-semantic-versioning
+---
+
+# --description--
+
+`Versions` of the npm packages in the dependencies section of your package.json file 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 projects can expect if they update.
+
+Knowing SemVer can be useful when you develop software that uses 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 don’t work today. This is how Semantic Versioning works according to the official website:
+
+```json
+"package": "MAJOR.MINOR.PATCH"
+```
+
+The MAJOR version should increment when you make incompatible API changes. The MINOR version should increment when you add functionality in a backwards-compatible manner. The PATCH version should increment 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.
+
+# --instructions--
+
+In the dependencies section of your package.json file, change the `version` of moment to match MAJOR version 2, MINOR version 10 and PATCH version 2
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should be "2.10.2"
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.equal(
+        packJson.dependencies.moment,
+        '2.10.2',
+        'Wrong version of "moment". It should be 2.10.2'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
new file mode 100644
index 0000000000..b1b7b32731
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/remove-a-package-from-your-dependencies.md
@@ -0,0 +1,52 @@
+---
+id: 587d7fb5367417b2b2512c04
+title: Remove a Package from Your Dependencies
+challengeType: 2
+forumTopicId: 301530
+dashedName: remove-a-package-from-your-dependencies
+---
+
+# --description--
+
+You have now tested a few ways you can manage dependencies of your project by using the package.json's dependencies section. You have also included external packages by adding them to the file and even told npm what types of versions you want, by using special characters such 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 package from your dependencies.
+
+This same method applies to removing other fields in your package.json as well
+
+# --instructions--
+
+Remove the moment package from your dependencies.
+
+**Note:** Make sure you have the right amount of commas after removing it.
+
+# --hints--
+
+"dependencies" should not include "moment"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
new file mode 100644
index 0000000000..a39adcd533
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-caret-character-to-use-the-latest-minor-version-of-a-dependency.md
@@ -0,0 +1,75 @@
+---
+id: 587d7fb5367417b2b2512c03
+title: Use the Caret-Character to Use the Latest Minor Version of a Dependency
+challengeType: 2
+forumTopicId: 301531
+dashedName: 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 allows 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.
+
+Your current version of moment should be "~2.10.2" which allows npm to install to the latest 2.10.x version. If you were to use the caret (^) as a version prefix instead, npm would be allowed to update to any 2.x.x version.
+
+```json
+"package": "^1.3.8"
+```
+
+This would allow updates to any 1.x.x version of the package.
+
+# --instructions--
+
+Use the caret (`^`) to prefix the version of moment in your dependencies and allow npm to update it to any new MINOR release.
+
+**Note:** The version numbers themselves should not be changed.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should match "^2.x.x"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
new file mode 100644
index 0000000000..564df74a9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/managing-packages-with-npm/use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency.md
@@ -0,0 +1,75 @@
+---
+id: 587d7fb5367417b2b2512c02
+title: Use the Tilde-Character to Always Use the Latest Patch Version of a Dependency
+challengeType: 2
+forumTopicId: 301532
+dashedName: use-the-tilde-character-to-always-use-the-latest-patch-version-of-a-dependency
+---
+
+# --description--
+
+In the last challenge, you 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 an npm dependency to update to the latest PATCH version, you can prefix the dependency’s version with the tilde (`~`) character. Here's an example of how to allow updates to any 1.3.x version.
+
+```json
+"package": "~1.3.8"
+```
+
+# --instructions--
+
+In the package.json file, your current rule for how npm may upgrade moment is to use a specific version (2.10.2). But now, you want to allow the latest 2.10.x version.
+
+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:** The version numbers themselves should not be changed.
+
+# --hints--
+
+"dependencies" should include "moment"
+
+```js
+(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);
+    }
+  );
+```
+
+"moment" version should match "~2.10.2"
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
new file mode 100644
index 0000000000..12be099f8a
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
@@ -0,0 +1,76 @@
+---
+id: 587d7fb9367417b2b2512c12
+title: Chain Search Query Helpers to Narrow Search Results
+challengeType: 2
+forumTopicId: 301533
+dashedName: 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()`. You always need to pass your callback to this last method. There are many query helpers, here we'll use the most commonly used.
+
+# --instructions--
+
+Modify the `queryChain` function to find people who like the food specified by the variable named `foodToSearch`. 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()`.
+
+# --hints--
+
+Chaining query helpers should succeed
+
+```js
+(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: 'Bob', age: 23, favoriteFoods: ['pizza', 'nachos'] },
+      { 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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
new file mode 100644
index 0000000000..1e7e686d23
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-a-model.md
@@ -0,0 +1,88 @@
+---
+id: 587d7fb6367417b2b2512c07
+title: Create a Model
+challengeType: 2
+forumTopicId: 301535
+dashedName: create-a-model
+---
+
+# --description--
+
+**C**RUD Part I - CREATE
+
+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.
+
+Replit is a real server, and in real servers the interactions with the database happen in handler functions. These functions 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!
+
+```js
+/* Example */
+
+const someFunc = function(done) {
+  //... do something (risky) ...
+  if (error) return done(error);
+  done(null, result);
+};
+```
+
+# --instructions--
+
+Create a person schema called `personSchema` having this prototype:
+
+```markup
+- Person Prototype -
+--------------------
+name : string [required]
+age :  number
+favoriteFoods : array of strings (*)
+```
+
+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 [Mongoose docs](http://mongoosejs.com/docs/guide.html).
+
+Now, create a model called `Person` from the `personSchema`.
+
+# --hints--
+
+Creating an instance from a mongoose schema should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
new file mode 100644
index 0000000000..ae385b6b21
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-and-save-a-record-of-a-model.md
@@ -0,0 +1,56 @@
+---
+id: 587d7fb6367417b2b2512c09
+title: Create and Save a Record of a Model
+challengeType: 2
+forumTopicId: 301536
+dashedName: create-and-save-a-record-of-a-model
+---
+
+# --description--
+
+In this challenge you will have to create and save a record of a model.
+
+# --instructions--
+
+Within the `createAndSavePerson` function, create a document instance using the `Person` model constructor you built before. Pass to the constructor an object having the fields `name`, `age`, and `favoriteFoods`. Their types must conform to the ones in the `personSchema`. 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.
+
+```js
+/* Example */
+
+// ...
+person.save(function(err, data) {
+  //   ...do your stuff here...
+});
+```
+
+# --hints--
+
+Creating and saving a db item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
new file mode 100644
index 0000000000..08812efbd1
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/create-many-records-with-model.create.md
@@ -0,0 +1,68 @@
+---
+id: 587d7fb7367417b2b2512c0a
+title: Create Many Records with model.create()
+challengeType: 2
+forumTopicId: 301537
+dashedName: 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.
+
+# --instructions--
+
+Modify the `createManyPeople` function to create many people using `Model.create()` with the argument `arrayOfPeople`.
+
+**Note:** You can reuse the model you instantiated in the previous exercise.
+
+# --hints--
+
+Creating many db items at once should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
new file mode 100644
index 0000000000..7709b5fd5d
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-many-documents-with-model.remove.md
@@ -0,0 +1,57 @@
+---
+id: 587d7fb8367417b2b2512c11
+title: Delete Many Documents with model.remove()
+challengeType: 2
+forumTopicId: 301538
+dashedName: delete-many-documents-with-model-remove
+---
+
+# --description--
+
+`Model.remove()` is useful to delete all the documents matching given criteria.
+
+# --instructions--
+
+Modify the `removeManyPeople` function to delete all the people whose name is within the variable `nameToRemove`, using `Model.remove()`. Pass it to a query document with the `name` field set, and a callback.
+
+**Note:** The `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.
+
+# --hints--
+
+Deleting many items at once should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
new file mode 100644
index 0000000000..f010b51c40
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/delete-one-document-using-model.findbyidandremove.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb8367417b2b2512c10
+title: Delete One Document Using model.findByIdAndRemove
+challengeType: 2
+forumTopicId: 301539
+dashedName: delete-one-document-using-model-findbyidandremove
+---
+
+# --description--
+
+`findByIdAndRemove` and `findOneAndRemove` are like the previous update methods. They pass the removed document to the db. As usual, use the function argument `personId` as the search key.
+
+# --instructions--
+
+Modify the `removeById` function to delete one person by the person's `_id`. You should use one of the methods `findByIdAndRemove()` or `findOneAndRemove()`.
+
+# --hints--
+
+Deleting an item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
new file mode 100644
index 0000000000..88c275d62d
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/install-and-set-up-mongoose.md
@@ -0,0 +1,85 @@
+---
+id: 587d7fb6367417b2b2512c06
+title: Install and Set Up Mongoose
+challengeType: 2
+forumTopicId: 301540
+dashedName: install-and-set-up-mongoose
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-mongomongoose/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-mongomongoose) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+In this challenge, you will set up a MongoDB Atlas database and import the required packages to connect to it.
+
+Follow <a href='https://www.freecodecamp.org/news/get-started-with-mongodb-atlas/' rel='noopener noreferrer' target='_blank'>this tutorial</a> to set up a hosted database on MongoDB Atlas.
+
+# --instructions--
+
+Add `mongodb` and `mongoose` to the project’s `package.json`. Then, require mongoose as `mongoose` in `myApp.js`. Create a `.env` file and add a `MONGO_URI` variable to it. Its value should be your MongoDB Atlas database URI. Be sure to surround the URI with single or double quotes, and remember that you can't use spaces around the `=` in environment variables. For example, `MONGO_URI='VALUE'`. When you are done, connect to the database using the following syntax:
+
+```js
+mongoose.connect(<Your URI>, { useNewUrlParser: true, useUnifiedTopology: true });
+```
+
+# --hints--
+
+"mongodb" dependency should be in package.json
+
+```js
+(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);
+    }
+  );
+```
+
+"mongoose" dependency should be in package.json
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/file/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(packJson.dependencies, 'mongoose');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+"mongoose" should be connected to a database
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/is-mongoose-ok').then(
+    (data) => {
+      assert.isTrue(data.isMongooseOk, 'mongoose is not connected');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
new file mode 100644
index 0000000000..ecbb514dac
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-classic-updates-by-running-find-edit-then-save.md
@@ -0,0 +1,54 @@
+---
+id: 587d7fb8367417b2b2512c0e
+title: 'Perform Classic Updates by Running Find, Edit, then Save'
+challengeType: 2
+forumTopicId: 301541
+dashedName: 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 bound 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.
+
+# --instructions--
+
+Modify the `findEditThenSave` function to find a person by `_id` (use any of the above methods) with the parameter `personId` as search key. Add `"hamburger"` to the list of the person's `favoriteFoods` (you can use `Array.push()`). Then - inside the find callback - `save()` the updated `Person`.
+
+**Note:** This may be tricky, if in your Schema, you declared `favoriteFoods` as an Array, without specifying the type (i.e. `[String]`). In that case, `favoriteFoods` defaults to Mixed type, and you have to manually mark it as edited using `document.markModified('edited-field')`. See [Mongoose documentation](https://mongoosejs.com/docs/schematypes.html#Mixed)
+
+# --hints--
+
+Find-edit-update an item should succeed
+
+```js
+(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 is 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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
new file mode 100644
index 0000000000..ddd4ecd80a
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/perform-new-updates-on-a-document-using-model.findoneandupdate.md
@@ -0,0 +1,58 @@
+---
+id: 587d7fb8367417b2b2512c0f
+title: Perform New Updates on a Document Using model.findOneAndUpdate()
+challengeType: 2
+forumTopicId: 301542
+dashedName: 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.
+
+# --instructions--
+
+Modify the `findAndUpdate` function to find a person by `Name` and set the person's age to `20`. Use the function parameter `personName` as the search key.
+
+**Note:** You should return the updated document. To 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.
+
+# --hints--
+
+findOneAndUpdate an item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
new file mode 100644
index 0000000000..a3e22a5b1e
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.find-to-search-your-database.md
@@ -0,0 +1,53 @@
+---
+id: 587d7fb7367417b2b2512c0b
+title: Use model.find() to Search Your Database
+challengeType: 2
+forumTopicId: 301543
+dashedName: use-model-find-to-search-your-database
+---
+
+# --description--
+
+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. Read more in the docs.
+
+# --instructions--
+
+Modify the `findPeopleByName` function to find all the people having a given name, using <code>Model.find() -\> [Person]</code>
+
+Use the function argument `personName` as the search key.
+
+# --hints--
+
+Find all items corresponding to a criteria should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
new file mode 100644
index 0000000000..36c2b551e1
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findbyid-to-search-your-database-by-id.md
@@ -0,0 +1,48 @@
+---
+id: 587d7fb7367417b2b2512c0d
+title: Use model.findById() to Search Your Database By _id
+challengeType: 2
+forumTopicId: 301544
+dashedName: 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 Mongoose provides a dedicated method for it.
+
+# --instructions--
+
+Modify the `findPersonById` to find the only person having a given `_id`, using `Model.findById() -> Person`. Use the function argument `personId` as the search key.
+
+# --hints--
+
+Find an item by Id should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
new file mode 100644
index 0000000000..e7f9c78278
--- /dev/null
+++ b/curriculum/challenges/portuguese/05-apis-and-microservices/mongodb-and-mongoose/use-model.findone-to-return-a-single-matching-document-from-your-database.md
@@ -0,0 +1,51 @@
+---
+id: 587d7fb7367417b2b2512c0c
+title: Use model.findOne() to Return a Single Matching Document from Your Database
+challengeType: 2
+forumTopicId: 301545
+dashedName: use-model-findone-to-return-a-single-matching-document-from-your-database
+---
+
+# --description--
+
+`Model.findOne()` behaves like `Model.find()`, but it returns only one document (not an array), even if there are multiple items. It is especially useful when searching by properties that you have declared as unique.
+
+# --instructions--
+
+Modify the `findOneByFood` function to find just one person which has a certain food in the person's favorites, using `Model.findOne() -> Person`. Use the function argument `food` as search key.
+
+# --hints--
+
+Find one item should succeed
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/announce-new-users.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/announce-new-users.md
new file mode 100644
index 0000000000..fca0105f3d
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/announce-new-users.md
@@ -0,0 +1,90 @@
+---
+id: 589fc832f9fc0f352b528e78
+title: Announce New Users
+challengeType: 2
+forumTopicId: 301546
+dashedName: announce-new-users
+---
+
+# --description--
+
+Many chat rooms are able to announce 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 a feature. The most logical way of doing so is sending 3 pieces of data with the event: the name of the user who connected/disconnected, the current user count, and if that name connected or disconnected.
+
+Change the event name to `'user'`, and pass an object along containing the fields 'name', 'currentUsers', and 'connected' (to be `true` in case of connection, or `false` for disconnection of the user sent). Be sure to change both 'user count' events and set the disconnect one to send `false` for the field 'connected' instead of `true` like the event emitted on connect.
+
+```js
+io.emit('user', {
+  name: socket.request.user.name,
+  currentUsers,
+  connected: true
+});
+```
+
+Now your client will have all the necessary information to correctly display the current user count and announce when a user connects or disconnects! To handle this event on the client side we should listen for `'user'`, then update the current user count by using jQuery to change the text of `#num-users` to `'{NUMBER} users online'`, as well as append a `<li>` to the unordered list with id `messages` with `'{NAME} has {joined/left} the chat.'`.
+
+An implementation of this could look like the following:
+
+```js
+socket.on('user', data => {
+  $('#num-users').text(data.currentUsers + ' users online');
+  let message =
+    data.name +
+    (data.connected ? ' has joined the chat.' : ' has left the chat.');
+  $('#messages').append($('<li>').html('<b>' + message + '</b>'));
+});
+```
+
+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 [here](https://gist.github.com/camperbot/bf95a0f74b756cf0771cd62c087b8286).
+
+# --hints--
+
+Event `'user'` should be emitted with name, currentUsers, and connected.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.emit.*('|")user\1.*name.*currentUsers.*connected/gis,
+        'You should have an event emitted named user sending name, currentUsers, and connected'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Client should properly handle and display the new data from event `'user'`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/client.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")user\1[^]*num-users/gi,
+        'You should change the text of "#num-users" within on your client within the "user" event listener to show the current users connected'
+      );
+      assert.match(
+        data,
+        /socket.on.*('|")user\1[^]*messages.*li/gi,
+        'You should append a list item to "#messages" on your client within the "user" event listener to announce a user came or went'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
new file mode 100644
index 0000000000..0d29b5c99a
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-strategies.md
@@ -0,0 +1,96 @@
+---
+id: 5895f70df9fc0f352b528e68
+title: Authentication Strategies
+challengeType: 2
+forumTopicId: 301547
+dashedName: authentication-strategies
+---
+
+# --description--
+
+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 hundreds of strategies, visit Passport's site [here](http://passportjs.org/).
+
+Add `passport-local@~1.0.0` as a dependency and add it to your server as follows: `const LocalStrategy = require('passport-local');`
+
+Now you will have to tell passport to **use** an instantiated LocalStrategy 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!
+
+```js
+passport.use(new LocalStrategy(
+  function(username, password, done) {
+    myDataBase.findOne({ username: username }, function (err, user) {
+      console.log('User '+ username +' attempted to log in.');
+      if (err) { return done(err); }
+      if (!user) { return done(null, false); }
+      if (password !== user.password) { return done(null, false); }
+      return done(null, user);
+    });
+  }
+));
+```
+
+This is defining the process to use 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 `user`'s object is returned and they are authenticated.
+
+Many strategies are set up using different settings, but generally it is easy to set it up based on the README in that strategy's repository. 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. 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/53b495c02b92adeee0aa1bd3f3be8a4b).
+
+# --hints--
+
+Passport-local should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+Passport-local should be correctly required and setup.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
new file mode 100644
index 0000000000..ce5af55213
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/authentication-with-socket.io.md
@@ -0,0 +1,150 @@
+---
+id: 589fc831f9fc0f352b528e77
+title: Authentication with Socket.IO
+challengeType: 2
+forumTopicId: 301548
+dashedName: authentication-with-socket-io
+---
+
+# --description--
+
+Currently, you cannot determine who is connected to your web socket. While `req.user` contains the user object, that's only when your user interacts with the web server, and with web sockets you have no `req` (request) and therefore 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!
+
+Add `passport.socketio@~3.7.0`, `connect-mongo@~3.2.0`, and `cookie-parser@~1.4.5` as dependencies and require them as `passportSocketIo`, `MongoStore`, and `cookieParser` respectively. Also, we need to initialize a new memory store, from `express-session` which we previously required. It should look like this:
+
+```js
+const MongoStore = require('connect-mongo')(session);
+const URI = process.env.MONGO_URI;
+const store = new MongoStore({ url: URI });
+```
+
+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 like this:
+
+```js
+io.use(
+  passportSocketIo.authorize({
+    cookieParser: cookieParser,
+    key: 'express.sid',
+    secret: process.env.SESSION_SECRET,
+    store: store,
+    success: onAuthorizeSuccess,
+    fail: onAuthorizeFail
+  })
+);
+```
+
+Be sure to add the `key` and `store` to the `session` middleware mounted on the app. This is necessary to tell *SocketIO* which session to relate to.
+
+<hr>
+
+Now, define the `success`, and `fail` callback functions:
+
+```js
+function onAuthorizeSuccess(data, accept) {
+  console.log('successful connection to socket.io');
+
+  accept(null, true);
+}
+
+function onAuthorizeFail(data, message, error, accept) {
+  if (error) throw new Error(message);
+  console.log('failed connection to socket.io:', message);
+  accept(null, false);
+}
+```
+
+The user object is now accessible on your socket object as `socket.request.user`. For example, now you can add the following:
+
+```js
+console.log('user ' + socket.request.user.name + ' connected');
+```
+
+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 [here](https://gist.github.com/camperbot/1414cc9433044e306dd7fd0caa1c6254).
+
+# --hints--
+
+`passport.socketio` should be a dependency.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(
+        packJson.dependencies,
+        'passport.socketio',
+        'Your project should list "passport.socketio" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+`cookie-parser` should be a dependency.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      var packJson = JSON.parse(data);
+      assert.property(
+        packJson.dependencies,
+        'cookie-parser',
+        'Your project should list "cookie-parser" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+passportSocketIo should be properly required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require\((['"])passport\.socketio\1\)/gi,
+        'You should correctly require and instantiate "passport.socketio"'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+passportSocketIo should be properly setup.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io\.use\(\s*\w+\.authorize\(/,
+        'You should register "passport.socketio" as socket.io middleware and provide it correct options'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
new file mode 100644
index 0000000000..f6cf40e834
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/clean-up-your-project-with-modules.md
@@ -0,0 +1,64 @@
+---
+id: 589690e6f9fc0f352b528e6e
+title: Clean Up Your Project with Modules
+challengeType: 2
+forumTopicId: 301549
+dashedName: clean-up-your-project-with-modules
+---
+
+# --description--
+
+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:
+
+```js
+module.exports = function (app, myDataBase) {
+
+}
+```
+
+Now, in the top of your server file, require these files like so: `const routes = require('./routes.js');` Right after you establish a successful connection with the database, instantiate each of them like so: `routes(app, myDataBase)`
+
+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` function, since it was specifically created for routing. Now, you will have to correctly add the dependencies in which are used, such as `const passport = require('passport');`, 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 (**except for the route in the catch block**)!
+
+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 `auth(app, myDataBase)` in the server in the same spot.
+
+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 [here](https://gist.github.com/camperbot/2d06ac5c7d850d8cf073d2c2c794cc92).
+
+# --hints--
+
+Modules should be present.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require\s*\(('|")\.\/routes(\.js)?\1\)/gi,
+        'You should have required your new files'
+      );
+      assert.match(
+        data,
+        /client\s*\.db[^]*routes/gi,
+        'Your new modules should be called after your connection to the database'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
new file mode 100644
index 0000000000..1b9e03a3b5
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/communicate-by-emitting.md
@@ -0,0 +1,107 @@
+---
+id: 589fc831f9fc0f352b528e75
+title: Communicate by Emitting
+challengeType: 2
+forumTopicId: 301550
+dashedName: communicate-by-emitting
+---
+
+# --description--
+
+<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 emitting the current count of connected users each time a new user connects!
+
+Start by adding a variable to keep track of the users, just before where you are currently listening for connections.
+
+```js
+let currentUsers = 0;
+```
+
+Now, when someone connects, you should increment the count before emitting the count. So, you will want to add the incrementer within the connection listener.
+
+```js
+++currentUsers;
+```
+
+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`.
+
+```js
+io.emit('user count', currentUsers);
+```
+
+Now, you can implement a way for your client to listen for this event! Similar to listening for a connection on the server, you will use the `on` keyword.
+
+```js
+socket.on('user count', function(data) {
+  console.log(data);
+});
+```
+
+Now, try loading up your app, 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/28ef7f1078f56eb48c7b1aeea35ba1f5).
+
+# --hints--
+
+currentUsers should be defined.
+
+```js
+(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);
+    }
+  );
+```
+
+Server should emit the current user count at each new connection.
+
+```js
+(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);
+    }
+  );
+```
+
+Your client should be listening for 'user count' event.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
new file mode 100644
index 0000000000..e34d3a458a
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/create-new-middleware.md
@@ -0,0 +1,87 @@
+---
+id: 5895f70df9fc0f352b528e6a
+title: Create New Middleware
+challengeType: 2
+forumTopicId: 301551
+dashedName: create-new-middleware
+---
+
+# --description--
+
+As is, any user can just go to `/profile` whether they have 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 `ensureAuthenticated(req, res, next)`, which will check if a user is authenticated by calling passport's `isAuthenticated` method on the `request` which, in turn, checks if `req.user` is defined. If it is, then `next()` 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:
+
+```js
+function ensureAuthenticated(req, res, next) {
+  if (req.isAuthenticated()) {
+    return next();
+  }
+  res.redirect('/');
+};
+```
+
+Now add *ensureAuthenticated* as a middleware to the request for the profile page before the argument to the get request containing the function that renders the page.
+
+```js
+app
+ .route('/profile')
+ .get(ensureAuthenticated, (req,res) => {
+    res.render(process.cwd() + '/views/pug/profile');
+ });
+```
+
+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 [here](https://gist.github.com/camperbot/ae49b8778cab87e93284a91343da0959).
+
+# --hints--
+
+Middleware ensureAuthenticated should be implemented and on our /profile route.
+
+```js
+(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);
+    }
+  );
+```
+
+A Get request to /profile should correctly redirect to / since we are not authenticated.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
new file mode 100644
index 0000000000..2873c18ff2
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/handle-a-disconnect.md
@@ -0,0 +1,69 @@
+---
+id: 589fc831f9fc0f352b528e76
+title: Handle a Disconnect
+challengeType: 2
+forumTopicId: 301552
+dashedName: handle-a-disconnect
+---
+
+# --description--
+
+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 you have to listen for it on each socket instead of on the whole server.
+
+To do this, add another listener inside the existing `'connect'` listener that listens for `'disconnect'` on the socket with no data passed through. You can test this functionality by just logging that a user has disconnected to the console.
+
+```js
+socket.on('disconnect', () => {
+  /*anything you want to do on disconnect*/
+});
+```
+
+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!
+
+**Note:** 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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/ab1007b76069884fb45b215d3c4496fa).
+
+# --hints--
+
+Server should handle the event disconnect from a socket.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(data, /socket.on.*('|")disconnect('|")/gi, '');
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Your client should be listening for 'user count' event.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
new file mode 100644
index 0000000000..43459f9438
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/hashing-your-passwords.md
@@ -0,0 +1,86 @@
+---
+id: 58a25c98f9fc0f352b528e7f
+title: Hashing Your Passwords
+challengeType: 2
+forumTopicId: 301553
+dashedName: hashing-your-passwords
+---
+
+# --description--
+
+Going back to the information security section, you may remember that storing plaintext passwords is *never* okay. Now it is time to implement BCrypt to solve this issue.
+
+Add `bcrypt@~5.0.0` 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 registration route, you insert a user's password into the database like so: `password: req.body.password`. An easy way to implement saving a hash instead is to add the following before your database logic `const hash = bcrypt.hashSync(req.body.password, 12);`, and replacing the `req.body.password` in the database saving with just `password: hash`.
+
+Finally, on our authentication strategy, we check for the following in our code before completing the process: `if (password !== user.password) { return done(null, false); }`. After making the previous changes, now `user.password` 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:
+
+```js
+if (!bcrypt.compareSync(password, user.password)) { 
+  return done(null, false);
+}
+```
+
+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. If you're running into errors, you can check out the project completed up to this point [here](https://gist.github.com/camperbot/dc16cca09daea4d4151a9c36a1fab564).
+
+# --hints--
+
+BCrypt should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+BCrypt should be correctly required and implemented.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')bcrypt\1/gi,
+        'You should have required bcrypt'
+      );
+      assert.match(
+        data,
+        /bcrypt.hashSync/gi,
+        'You should use hash the password in the registration'
+      );
+      assert.match(
+        data,
+        /bcrypt.compareSync/gi,
+        'You should compare the password to the hash in your strategy'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
new file mode 100644
index 0000000000..bd17bbb9a6
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-put-a-profile-together.md
@@ -0,0 +1,57 @@
+---
+id: 5895f70ef9fc0f352b528e6b
+title: How to Put a Profile Together
+challengeType: 2
+forumTopicId: 301554
+dashedName: how-to-put-a-profile-together
+---
+
+# --description--
+
+Now that we can ensure the user accessing the `/profile` is authenticated, we can use the information contained in `req.user` on our page!
+
+Pass an object containing the property `username` and value of `req.user.username` as the second argument for the render method of the profile view. Then, go to your `profile.pug` view, and add the following line below the existing `h1` element, and at the same level of indentation:
+
+```pug
+h2.center#welcome Welcome, #{username}!
+```
+
+This creates an `h2` element with the class '`center`' and id '`welcome`' containing the text '`Welcome,`' followed by the username.
+
+Also, in `profile.pug`, add a link referring to the `/logout` route, which will host the logic to unauthenticate a user.
+
+```pug
+a(href='/logout') Logout
+```
+
+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 [here](https://gist.github.com/camperbot/136b3ad611cc80b41cab6f74bb460f6a).
+
+# --hints--
+
+You should correctly add a Pug render variable to /profile.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
new file mode 100644
index 0000000000..ba78302a8c
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/how-to-use-passport-strategies.md
@@ -0,0 +1,79 @@
+---
+id: 5895f70df9fc0f352b528e69
+title: How to Use Passport Strategies
+challengeType: 2
+forumTopicId: 301555
+dashedName: how-to-use-passport-strategies
+---
+
+# --description--
+
+In the `index.pug` file supplied, there is actually a login form. It has previously been hidden because of the inline JavaScript `if showLogin` with the form indented after it. Before `showLogin` as a variable was never defined, so 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 `showLogin: true`. When you refresh your page, you should then see the form! This form is set up to **POST** on `/login`, 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 `function(req,res)` with your response! The middleware to use is `passport.authenticate('local')`.
+
+`passport.authenticate` can also take some options as an argument such as: `{ failureRedirect: '/' }` which is incredibly useful, so be sure to add that in as well. The response after using the middleware (which will only be called if the authentication middleware passes) should be to redirect the user to `/profile` and that route should render the view `profile.pug`.
+
+If the authentication was successful, the user object will be saved in `req.user`.
+
+At this point, if you enter a username and password in the form, it should redirect to the home page `/`, and the console of your server should display `'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 [here](https://gist.github.com/camperbot/7ad011ac54612ad53188b500c5e99cb9).
+
+# --hints--
+
+All steps should be correctly implemented in the server.js.
+
+```js
+(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);
+    }
+  );
+```
+
+A POST request to /login should correctly redirect to /.
+
+```js
+(getUserInput) =>
+  $.post(getUserInput('url') + '/login').then(
+    (data) => {
+      assert.match(
+        data,
+        /Looks like this page is being rendered from Pug into HTML!/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
new file mode 100644
index 0000000000..03d737f4aa
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implement-the-serialization-of-a-passport-user.md
@@ -0,0 +1,91 @@
+---
+id: 5895f70cf9fc0f352b528e67
+title: Implement the Serialization of a Passport User
+challengeType: 2
+forumTopicId: 301556
+dashedName: implement-the-serialization-of-a-passport-user
+---
+
+# --description--
+
+Right now, we're not loading an actual user 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 your database's connection string (for example: `mongodb+srv://:@cluster0-jvwxi.mongodb.net/?retryWrites=true&w=majority`) to the environment variable `MONGO_URI`. This is used in the `connection.js` file.
+
+*You can set up a free database on [MongoDB Atlas](https://www.mongodb.com/cloud/atlas).*
+
+Now we want to 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 this, you will want to encompass your serialization and your app routes in the following code:
+
+```js
+myDB(async client => {
+  const myDataBase = await client.db('database').collection('users');
+
+  // Be sure to change the title
+  app.route('/').get((req, res) => {
+    //Change the response to render the Pug template
+    res.render('pug', {
+      title: 'Connected to Database',
+      message: 'Please login'
+    });
+  });
+
+  // Serialization and deserialization here...
+
+  // Be sure to add this...
+}).catch(e => {
+  app.route('/').get((req, res) => {
+    res.render('pug', { title: e, message: 'Unable to login' });
+  });
+});
+// app.listen out here...
+```
+
+Be sure to uncomment the `myDataBase` code in `deserializeUser`, and edit your `done(null, null)` to include the `doc`.
+
+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 [here](https://gist.github.com/camperbot/175f2f585a2d8034044c7e8857d5add7).
+
+# --hints--
+
+Database connection should be present.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/').then(
+    (data) => {
+      assert.match(
+        data,
+        /Connected to Database/gi,
+        'You successfully connected to the database!'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Deserialization should now be correctly using the DB and `done(null, null)` should be called with the `doc`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /null,\s*doc/gi,
+        'The callback in deserializeUser of (null, null) should be altered to (null, doc)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
new file mode 100644
index 0000000000..43740bdac5
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-ii.md
@@ -0,0 +1,114 @@
+---
+id: 589a69f5f9fc0f352b528e71
+title: Implementation of Social Authentication II
+challengeType: 2
+forumTopicId: 301557
+dashedName: implementation-of-social-authentication-ii
+---
+
+# --description--
+
+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@~1.1.0` to your project and require it in your `auth.js` as `GithubStrategy` like this: `const GitHubStrategy = require('passport-github').Strategy;`. Do not forget to require and configure `dotenv` to use your environment variables.
+
+To set up the GitHub strategy, you have to tell Passport to use an instantiated `GitHubStrategy`, which accepts 2 arguments: an object (containing `clientID`, `clientSecret`, and `callbackURL`) and a function to be called when a user is successfully authenticated, which 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 *scope* as well which determines what kind of information your request is asking to be returned and asks the user to approve such access. The current strategy we are implementing has its usage outlined [here](https://github.com/jaredhanson/passport-github/), but we're going through it all right here on freeCodeCamp!
+
+Here's how your new strategy should look at this point:
+
+```js
+passport.use(new GitHubStrategy({
+  clientID: process.env.GITHUB_CLIENT_ID,
+  clientSecret: process.env.GITHUB_CLIENT_SECRET,
+  callbackURL: /*INSERT CALLBACK URL ENTERED INTO GITHUB HERE*/
+},
+  function(accessToken, refreshToken, profile, cb) {
+    console.log(profile);
+    //Database logic here with callback containing our user object
+  }
+));
+```
+
+Your authentication won't be successful yet, and it will actually throw an error without the database logic and callback, but it should log your GitHub profile to your console if you try it!
+
+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 [here](https://gist.github.com/camperbot/ff3a1166684c1b184709ac0bee30dee6).
+
+# --hints--
+
+passport-github dependency should be added.
+
+```js
+(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);
+    }
+  );
+```
+
+passport-github should be required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')passport-github("|')/gi,
+        'You should have required passport-github'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+GitHub strategy should be setup correctly thus far.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /passport\.use.*new GitHubStrategy/gi,
+        'Passport should use a new GitHubStrategy'
+      );
+      assert.match(
+        data,
+        /callbackURL:\s*("|').*("|')/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
new file mode 100644
index 0000000000..6e6b65cf56
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication-iii.md
@@ -0,0 +1,80 @@
+---
+id: 589a8eb3f9fc0f352b528e72
+title: Implementation of Social Authentication III
+challengeType: 2
+forumTopicId: 301558
+dashedName: implementation-of-social-authentication-iii
+---
+
+# --description--
+
+The final part of the strategy is handling the profile returned from GitHub. We need to load the user's 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 *id* 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 where `console.log(profile);` currently is:
+
+```js
+myDataBase.findOneAndUpdate(
+  { id: profile.id },
+  {
+    $setOnInsert: {
+      id: profile.id,
+      name: profile.displayName || 'John Doe',
+      photo: profile.photos[0].value || '',
+      email: Array.isArray(profile.emails)
+        ? profile.emails[0].value
+        : 'No public email',
+      created_on: new Date(),
+      provider: profile.provider || ''
+    },
+    $set: {
+      last_login: new Date()
+    },
+    $inc: {
+      login_count: 1
+    }
+  },
+  { upsert: true, new: true },
+  (err, doc) => {
+    return cb(null, doc.value);
+  }
+);
+```
+
+`findOneAndUpdate` allows you to search for an object and update it. If the object doesn't exist, it will be inserted and made available to the callback function. In this example, we always set `last_login`, increment the `login_count` by `1`, and only populate the majority of the fields when a new object (new user) is inserted. Notice the use of default values. Sometimes a profile returned won't have all the information filled out or the user will keep it private. In this case, you 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 the project completed up to this point [here](https://gist.github.com/camperbot/183e968f0e01d81dde015d45ba9d2745).
+
+# --hints--
+
+GitHub strategy setup should be complete.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/auth.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /GitHubStrategy[^]*myDataBase/gi,
+        'Strategy should use now use the database to search for the user'
+      );
+      assert.match(
+        data,
+        /GitHubStrategy[^]*return cb/gi,
+        'Strategy should return the callback function "cb"'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
new file mode 100644
index 0000000000..2912bbed16
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/implementation-of-social-authentication.md
@@ -0,0 +1,82 @@
+---
+id: 589a69f5f9fc0f352b528e70
+title: Implementation of Social Authentication
+challengeType: 2
+forumTopicId: 301559
+dashedName: implementation-of-social-authentication
+---
+
+# --description--
+
+The basic path this kind of authentication will follow in your app is:
+
+1.  User clicks a button or link sending them to our route to authenticate using a specific strategy (e.g. GitHub).
+2.  Your route calls `passport.authenticate('github')` which redirects them to GitHub.
+3.  The page the user lands on, on GitHub, allows them to login if they aren't already. It then asks them to approve access to their profile from our app.
+4.  The user is then returned to our app at a specific callback url with their profile if they are approved.
+5.  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.
+
+Strategies with OAuth require you to have at least a *Client ID* and a *Client Secret* which is a way for the service 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--**THEY ARE NOT TO BE SHARED** and should never be uploaded to a public repository or written directly in your code. A common practice is to put them in your `.env` file and reference them like so: `process.env.GITHUB_CLIENT_ID`. For this challenge we're going to use the GitHub strategy.
+
+Obtaining your *Client ID and Secret* from GitHub is done in your account profile settings under 'developer settings', then '[OAuth applications](https://github.com/settings/developers)'. Click 'Register a new application', name your app, paste in the url to your Replit homepage (**Not the project code's url**), 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 for us to handle after authenticating on GitHub. Save the returned information as `'GITHUB_CLIENT_ID'` and `'GITHUB_CLIENT_SECRET'` in your `.env` file.
+
+In your `routes.js` file, add `showSocialAuth: true` to the homepage route, after `showRegistration: true`. Now, create 2 routes accepting GET requests: `/auth/github` and `/auth/github/callback`. The first should only call passport to authenticate `'github'`. 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:
+
+```js
+app.route('/login')
+  .post(passport.authenticate('local', { failureRedirect: '/' }), (req,res) => {
+    res.redirect('/profile');
+  });
+```
+
+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 [here](https://gist.github.com/camperbot/1f7f6f76adb178680246989612bea21e).
+
+# --hints--
+
+Route /auth/github should be correct.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/routes.js').then(
+    (data) => {
+      assert.match(
+        data.replace(/\s/g, ''),
+        /('|")\/auth\/github\/?\1[^]*?get.*?passport.authenticate.*?github/gi,
+        'Route auth/github should only call passport.authenticate with github'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Route /auth/github/callback should be correct.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/routes.js').then(
+    (data) => {
+      assert.match(
+        data.replace(/\s/g, ''),
+        /('|")\/auth\/github\/callback\/?\1[^]*?get.*?passport.authenticate.*?github.*?failureRedirect:("|')\/\2/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
new file mode 100644
index 0000000000..ba023ef1b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/logging-a-user-out.md
@@ -0,0 +1,81 @@
+---
+id: 58965611f9fc0f352b528e6c
+title: Logging a User Out
+challengeType: 2
+forumTopicId: 301560
+dashedName: logging-a-user-out
+---
+
+# --description--
+
+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 `req.logout();` before redirecting.
+
+```js
+app.route('/logout')
+  .get((req, res) => {
+    req.logout();
+    res.redirect('/');
+});
+```
+
+You may have noticed that 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:
+
+```js
+app.use((req, res, next) => {
+  res.status(404)
+    .type('text')
+    .send('Not Found');
+});
+```
+
+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 [here](https://gist.github.com/camperbot/c3eeb8a3ebf855e021fd0c044095a23b).
+
+# --hints--
+
+`req.Logout` should be called in your `/logout` route.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /req.logout/gi,
+        'You should be calling req.logout() in your /logout route'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Logout should redirect to the home page.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
new file mode 100644
index 0000000000..a18599d868
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/registration-of-new-users.md
@@ -0,0 +1,205 @@
+---
+id: 58966a17f9fc0f352b528e6d
+title: Registration of New Users
+challengeType: 2
+forumTopicId: 301561
+dashedName: registration-of-new-users
+---
+
+# --description--
+
+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--`showRegistration: true`. 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 **POST** on `/register`, 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 *OR* 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, call *next* to go to step 2, authenticating the new user, which we've already written the logic for in our POST */login* route.
+
+```js
+app.route('/register')
+  .post((req, res, next) => {
+    myDataBase.findOne({ username: req.body.username }, function(err, user) {
+      if (err) {
+        next(err);
+      } else if (user) {
+        res.redirect('/');
+      } else {
+        myDataBase.insertOne({
+          username: req.body.username,
+          password: req.body.password
+        },
+          (err, doc) => {
+            if (err) {
+              res.redirect('/');
+            } else {
+              // The inserted document is held within
+              // the ops property of the doc
+              next(null, doc.ops[0]);
+            }
+          }
+        )
+      }
+    })
+  },
+    passport.authenticate('local', { failureRedirect: '/' }),
+    (req, res, next) => {
+      res.redirect('/profile');
+    }
+  );
+```
+
+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 [here](https://gist.github.com/camperbot/b230a5b3bbc89b1fa0ce32a2aa7b083e).
+
+**NOTE:** From this point onwards, issues can arise relating to the use of the *picture-in-picture* browser. If you are using an online IDE which offers a preview of the app within the editor, it is recommended to open this preview in a new tab.
+
+# --hints--
+
+You should register route and display on home.
+
+```js
+(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);
+    }
+  );
+```
+
+Registering should work.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const user = `freeCodeCampTester${Date.now()}`;
+  const xhttp = new XMLHttpRequest();
+  xhttp.onreadystatechange = function () {
+    if (this.readyState == 4 && this.status == 200) {
+      test(this);
+    } else {
+      throw new Error(`${this.status} ${this.statusText}`);
+    }
+  };
+  xhttp.open('POST', url + '/register', true);
+  xhttp.setRequestHeader('Content-type', 'application/x-www-form-urlencoded');
+  xhttp.send(`username=${user}&password=${user}`);
+  function test(xhttpRes) {
+    const data = xhttpRes.responseText;
+    assert.match(
+      data,
+      /Profile/gi,
+      'Register should work, and redirect successfully to the profile.'
+    );
+  }
+};
+```
+
+Login should work.
+
+```js
+async (getUserInput) => {
+  const url = getUserInput('url');
+  const user = `freeCodeCampTester${Date.now()}`;
+  const xhttpReg = new XMLHttpRequest();
+  xhttpReg.onreadystatechange = function () {
+    if (this.readyState == 4 && this.status == 200) {
+      login();
+    } else {
+      throw new Error(`${this.status} ${this.statusText}`);
+    }
+  };
+  xhttpReg.open('POST', url + '/register', true);
+  xhttpReg.setRequestHeader(
+    'Content-type',
+    'application/x-www-form-urlencoded'
+  );
+  xhttpReg.send(`username=${user}&password=${user}`);
+  function login() {
+    const xhttp = new XMLHttpRequest();
+    xhttp.onreadystatechange = function () {
+      if (this.readyState == 4 && this.status == 200) {
+        test(this);
+      } else {
+        throw new Error(`${this.status} ${this.statusText}`);
+      }
+    };
+    xhttp.open('POST', url + '/login', true);
+    xhttp.setRequestHeader('Content-type', 'application/x-www-form-urlencoded');
+    xhttp.send(`username=${user}&password=${user}`);
+  }
+  function test(xhttpRes) {
+    const data = xhttpRes.responseText;
+    assert.match(
+      data,
+      /Profile/gi,
+      'Login should work if previous test was done successfully and redirect successfully to the profile.'
+    );
+    assert.match(
+      data,
+      new RegExp(user, 'g'),
+      'The profile should properly display the welcome to the user logged in'
+    );
+  }
+};
+```
+
+Logout should work.
+
+```js
+(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);
+    }
+  );
+```
+
+Profile should no longer work after logout.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
new file mode 100644
index 0000000000..e74551d1f9
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/send-and-display-chat-messages.md
@@ -0,0 +1,79 @@
+---
+id: 589fc832f9fc0f352b528e79
+title: Send and Display Chat Messages
+challengeType: 2
+forumTopicId: 301562
+dashedName: send-and-display-chat-messages
+---
+
+# --description--
+
+It's time you start allowing clients to send a chat message to the server to emit to all the clients! In your `client.js` file, you should see there is already a block of code handling when the message form is submitted.
+
+```js
+$('form').submit(function() {
+  /*logic*/
+});
+```
+
+Within the form submit code, you should emit an event after you define `messageToSend` but before you clear the text box `#m`. The event should be named `'chat message'` and the data should just be `messageToSend`.
+
+```js
+socket.emit('chat message', messageToSend);
+```
+
+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 received, it should emit the event `'chat message'` to all sockets `io.emit` with the data being an object containing `name` and `message`.
+
+In `client.js`, you should now listen for event `'chat message'` and, when received, append a list item to `#messages` 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 completed up to this point [here](https://gist.github.com/camperbot/d7af9864375207e254f73262976d2016).
+
+# --hints--
+
+Server should listen for `'chat message'` and then emit it properly.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")chat message('|")[^]*io.emit.*('|")chat message('|").*name.*message/gis,
+        '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);
+    }
+  );
+```
+
+Client should properly handle and display the new data from event `'chat message'`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/public/client.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /socket.on.*('|")chat message('|")[^]*messages.*li/gis,
+        '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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
new file mode 100644
index 0000000000..32b3ab7963
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/serialization-of-a-user-object.md
@@ -0,0 +1,131 @@
+---
+id: 5895f70cf9fc0f352b528e66
+title: Serialization of a User Object
+challengeType: 2
+forumTopicId: 301563
+dashedName: serialization-of-a-user-object
+---
+
+# --description--
+
+Serialization and deserialization are important concepts in regards to authentication. To serialize an object means to convert its contents into a small *key* that can then be deserialized into the original object. This is what allows us to know who has communicated with the server without having to send the authentication data, like the 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 `passport.serializeUser( OURFUNCTION )` and `passport.deserializeUser( OURFUNCTION )`
+
+The `serializeUser` is called with 2 arguments, the full user object and a callback used by passport. A unique key to identify that user should be returned in the callback, the easiest one to use being the user's `_id` in the object. It should be unique as it is 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 full user object to the callback. To make a query search for a Mongo `_id`, you will have to create `const ObjectID = require('mongodb').ObjectID;`, and then to use it you call `new ObjectID(THE_ID)`. Be sure to add `mongodb@~3.6.0` as a dependency. You can see this in the examples below:
+
+```js
+passport.serializeUser((user, done) => {
+  done(null, user._id);
+});
+
+passport.deserializeUser((id, done) => {
+  myDataBase.findOne({ _id: new ObjectID(id) }, (err, doc) => {
+    done(null, null);
+  });
+});
+```
+
+NOTE: This `deserializeUser` will throw an error until we set up the DB in the next step, so for now comment out the whole block and just call `done(null, null)` in the function `deserializeUser`.
+
+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 [here](https://gist.github.com/camperbot/7068a0d09e61ec7424572b366751f048).
+
+# --hints--
+
+You should serialize user function correctly.
+
+```js
+(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,\s*user._id/gi,
+        'There should be a callback in your serializeUser with (null, user._id)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+You should deserialize user function correctly.
+
+```js
+(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,\s*null/gi,
+        'There should be a callback in your deserializeUser with (null, null) for now'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+MongoDB should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+Mongodb should be properly required including the ObjectId.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /require.*("|')mongodb\1/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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
new file mode 100644
index 0000000000..0a89bd5293
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-a-template-engine.md
@@ -0,0 +1,116 @@
+---
+id: 5895f700f9fc0f352b528e63
+title: Set up a Template Engine
+challengeType: 2
+forumTopicId: 301564
+dashedName: set-up-a-template-engine
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-advancednode/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-advancednode) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+A template engine enables you to use static template files (such as those written in *Pug*) in your app. At runtime, the template engine replaces variables in a template file with actual values which can be supplied by your server. Then it transforms the template into a static HTML file that is sent to the client. This approach makes it easier to design an HTML page and allows for displaying variables on the page without needing to make an API call from the client.
+
+Add `pug@~3.0.0` as a dependency in your `package.json` file.
+
+Express needs to know which template engine you are using. We will use the `set` method to assign `pug` as the `view engine` property's value: `app.set('view engine', 'pug')`
+
+Your page will not load until you correctly render the index file in the `views/pug` directory.
+
+Change the argument of the `res.render()` declaration in the `/` route to be the file path to the `views/pug` directory. The path can be a relative path (relative to views), or an absolute path, and does not require a file extension.
+
+If all went as planned, your app home page will stop showing the message "`Pug template is not defined.`" and will now display a message indicating you've successfully rendered the Pug template!
+
+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 [here](https://gist.github.com/camperbot/3515cd676ea4dfceab4e322f59a37791).
+
+# --hints--
+
+Pug should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+View engine should be Pug.
+
+```js
+(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);
+    }
+  );
+```
+
+Use the correct ExpressJS method to render the index page from the response.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/').then(
+    (data) => {
+      assert.match(
+        data,
+        /FCC Advanced Node and Express/gi,
+        'You successfully rendered the Pug template!'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Pug should be working.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-passport.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
new file mode 100644
index 0000000000..98c406d1d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-passport.md
@@ -0,0 +1,132 @@
+---
+id: 5895f70cf9fc0f352b528e65
+title: Set up Passport
+challengeType: 2
+forumTopicId: 301565
+dashedName: set-up-passport
+---
+
+# --description--
+
+It's time to set up *Passport* 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 *key* 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. `passport@~0.4.1`
+
+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! `express-session@~1.17.1`
+
+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 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!
+
+```js
+app.use(session({
+  secret: process.env.SESSION_SECRET,
+  resave: true,
+  saveUninitialized: true,
+  cookie: { secure: false }
+}));
+```
+
+As well you can go ahead and tell your express app to **use** 'passport.initialize()' and 'passport.session()'. (For example, `app.use(passport.initialize());`)
+
+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 [here](https://gist.github.com/camperbot/4068a7662a2f9f5d5011074397d6788c).
+
+# --hints--
+
+Passport and Express-session should be dependencies.
+
+```js
+(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);
+    }
+  );
+```
+
+Dependencies should be correctly required.
+
+```js
+(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);
+    }
+  );
+```
+
+Express app should use new dependencies.
+
+```js
+(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);
+    }
+  );
+```
+
+Session and session secret should be correctly set up.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
new file mode 100644
index 0000000000..9da23f8cac
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/set-up-the-environment.md
@@ -0,0 +1,148 @@
+---
+id: 589fc830f9fc0f352b528e74
+title: Set up the Environment
+challengeType: 2
+forumTopicId: 301566
+dashedName: set-up-the-environment
+---
+
+# --description--
+
+The following challenges will make use of the `chat.pug` file. So, in your `routes.js` file, add a GET route pointing to `/chat` which makes use of `ensureAuthenticated`, and renders `chat.pug`, with `{ user: req.user }` passed as an argument to the response. Now, alter your existing `/auth/github/callback` route to set the `req.session.user_id = req.user.id`, and redirect to `/chat`.
+
+Add `socket.io@~2.3.0` as a dependency and require/instantiate it in your server defined as follows, with `http` (comes built-in with Nodejs):
+
+```javascript
+const http = require('http').createServer(app);
+const io = require('socket.io')(http);
+```
+
+Now that the *http* server is mounted on the *express app*, you need to listen from the *http* server. Change the line with `app.listen` to `http.listen`.
+
+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 that's emitted, and a function with which the data is passed though. In the case of our connection listener, we use *socket* to define the data in the second argument. A socket is an individual client who is connected.
+
+To listen for connections to your server, add the following within your database connection:
+
+```javascript
+io.on('connection', socket => {
+  console.log('A user has connected');
+});
+```
+
+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:
+
+```js
+/*global io*/
+let socket = io();
+```
+
+The comment suppresses 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'!
+
+**Note:**`io()` works only when connecting to a socket hosted on the same url/server. For connecting to an external socket hosted elsewhere, you would use `io.connect('URL');`.
+
+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 [here](https://gist.github.com/camperbot/aae41cf59debc1a4755c9a00ee3859d1).
+
+# --hints--
+
+`socket.io` should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+You should correctly require and instantiate `http` as `http`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /http.*=.*require.*('|")http\1/gi,
+        'Your project should list "http" as a dependency'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+You should correctly require and instantiate `socket.io` as `io`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.*=.*require.*('|")socket.io\1.*http/gi,
+        'You should correctly require and instantiate socket.io as io.'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Socket.IO should be listening for connections.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /io.on.*('|")connection\1.*socket/gi,
+        'io should listen for "connection" and socket should be the 2nd arguments variable'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+Your client should connect to your server.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
new file mode 100644
index 0000000000..3f605fa3ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/advanced-node-and-express/use-a-template-engines-powers.md
@@ -0,0 +1,53 @@
+---
+id: 5895f70bf9fc0f352b528e64
+title: Use a Template Engine's Powers
+challengeType: 2
+forumTopicId: 301567
+dashedName: use-a-template-engines-powers
+---
+
+# --description--
+
+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 able to use a variable by referencing the variable name as `#{variable_name}` inline with other text on an element or by using an equal sign on the element without a space such as `p=variable_name` which assigns the variable's value to the p element's text.
+
+We strongly recommend looking at the syntax and structure of Pug [here](https://github.com/pugjs/pug) on GitHub's 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 *title* and *message*.
+
+To pass those along from our server, you will need to add an object as a second argument to your *res.render* with the variables and their values. For example, pass this object along setting the variables for your index view: `{title: 'Hello', message: 'Please login'}`
+
+It should look like: `res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});` Now refresh your page and you should see those values rendered in your view in the correct spot as laid out in your index.pug file!
+
+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 [here](https://gist.github.com/camperbot/4af125119ed36e6e6a8bb920db0c0871).
+
+# --hints--
+
+Pug should correctly render variables.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
new file mode 100644
index 0000000000..df609ee419
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/assert-deep-equality-with-.deepequal-and-.notdeepequal.md
@@ -0,0 +1,79 @@
+---
+id: 587d824c367417b2b2512c4c
+title: Assert Deep Equality with .deepEqual and .notDeepEqual
+challengeType: 2
+forumTopicId: 301587
+dashedName: assert-deep-equality-with--deepequal-and--notdeepequal
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`deepEqual()` asserts that two objects are deep equal.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#7` in the `Equality` suite, change each `assert` to either `assert.deepEqual` or `assert.notDeepEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=6').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `deepEqual` vs. `notDeepEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `deepEqual` vs. `notDeepEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
new file mode 100644
index 0000000000..30f1e51eee
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/compare-the-properties-of-two-elements.md
@@ -0,0 +1,109 @@
+---
+id: 587d824c367417b2b2512c4d
+title: Compare the Properties of Two Elements
+challengeType: 2
+forumTopicId: 301588
+dashedName: compare-the-properties-of-two-elements
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#8` in the `Comparisons` suite, change each `assert` to either `assert.isAbove` or `assert.isAtMost` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `isAbove` vs. `isAtMost`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
new file mode 100644
index 0000000000..9f855975a0
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/learn-how-javascript-assertions-work.md
@@ -0,0 +1,75 @@
+---
+id: 587d824a367417b2b2512c46
+title: Learn How JavaScript Assertions Work
+challengeType: 2
+forumTopicId: 301589
+dashedName: learn-how-javascript-assertions-work
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-mochachai/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-mochachai) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#1` in the `Basic Assertions` suite, change each `assert` to either `assert.isNull` or `assert.isNotNull` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=0').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isNull` vs. `isNotNull`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isNull` vs. `isNotNull`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
new file mode 100644
index 0000000000..f9ca69d575
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iii---put-method.md
@@ -0,0 +1,140 @@
+---
+id: 587d824f367417b2b2512c5a
+title: Run Functional Tests on an API Response using Chai-HTTP III - PUT method
+challengeType: 2
+forumTopicId: 301590
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+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:
+
+```json
+{
+  "surname": [last name of a traveller of the past]
+}
+```
+
+The route responds with :
+
+```json
+{
+  "name": [first name], "surname": [last name], "dates": [birth - death years]
+}
+```
+
+See the server code for more details.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'send {surname: "Colombo"}'` test (`// #3`):
+
+Send the following JSON response as a payload:
+
+```json
+{
+  "surname": "Colombo"
+}
+```
+
+Check for the following, within the `request.end` callback:
+
+1.  `status`
+2.  `type`
+3.  `body.name`
+4.  `body.surname`
+
+Follow the assertion order above - we rely on it. Be sure to remove `assert.fail()`, once complete.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' to be 200.
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.type' to be 'application/json'.
+
+```js
+(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.match(data.assertions[1].args[1], /('|")application\/json\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.name' to be 'Cristoforo'.
+
+```js
+(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.match(data.assertions[2].args[1], /('|")Cristoforo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.surname' to be 'Colombo'.
+
+```js
+(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.match(data.assertions[3].args[1], /('|")Colombo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
new file mode 100644
index 0000000000..c4644a785f
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-an-api-response-using-chai-http-iv---put-method.md
@@ -0,0 +1,124 @@
+---
+id: 587d824f367417b2b2512c5b
+title: Run Functional Tests on an API Response using Chai-HTTP IV - PUT method
+challengeType: 2
+forumTopicId: 301591
+dashedName: run-functional-tests-on-an-api-response-using-chai-http-iv---put-method
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/). This exercise is similar to the preceding one. Look at it for the details.
+
+Now that you have seen how it is done, it is your turn to do it from scratch.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'send {surname: "da Verrazzano"}'` test (`// #4`):
+
+Send the following JSON response as a payload to the `/travellers` route:
+
+```json
+{
+  "surname": "da Verrazzano"
+}
+```
+
+Check for the following, within a `request.end` callback:
+
+1.  `status`
+2.  `type`
+3.  `body.name`
+4.  `body.surname`
+
+Follow the assertion order above - we rely on it. Be sure to remove `assert.fail()`, once complete.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' to be 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.type' to be 'application/json'
+
+```js
+(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.match(data.assertions[1].args[1], /('|")application\/json\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.name' to be 'Giovanni'
+
+```js
+(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.match(data.assertions[2].args[1], /('|")Giovanni\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.body.surname' to be 'da Verrazzano'
+
+```js
+(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.match(data.assertions[3].args[1], /('|")da Verrazzano\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
new file mode 100644
index 0000000000..53d2c7459e
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http-ii.md
@@ -0,0 +1,75 @@
+---
+id: 587d824f367417b2b2512c59
+title: Run Functional Tests on API Endpoints using Chai-HTTP II
+challengeType: 2
+forumTopicId: 301592
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'Test GET /hello with your name'` test (`// #2`) to assert the `status` and the `text` response to make the test pass.
+
+Send your name in the query, appending `?name=<your_name>` to the route. The endpoint responds with `'hello <your_name>'`.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=1').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' == 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.text' == 'hello Guest'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
new file mode 100644
index 0000000000..dc99b2d46a
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-on-api-endpoints-using-chai-http.md
@@ -0,0 +1,101 @@
+---
+id: 587d824e367417b2b2512c58
+title: Run Functional Tests on API Endpoints using Chai-HTTP
+challengeType: 2
+forumTopicId: 301593
+dashedName: run-functional-tests-on-api-endpoints-using-chai-http
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+Mocha allows testing asyncronous operations. There is a small (BIG) difference. Can you spot it?
+
+We can test our API endpoints using a plugin, called `chai-http`. Let's see how it works. And remember, API calls are asynchronous.
+
+The following is an example of a test using `chai-http` for the `'GET /hello?name=[name] => "hello [name]"'` suite. The test sends a name string in a url query string (`?name=John`) using a `GET`request to the `server`. In the `end` method's callback function, the response object (`res`) is received and contains the `status` property. The first `assert.equal` checks if the status is equal to `200`. The second `assert.equal` checks that the response string (`res.text`) is equal to `"hello John"`.
+
+```js
+suite('GET /hello?name=[name] => "hello [name]"', function () {
+  test("?name=John", function (done) {
+    chai
+      .request(server)
+      .get("/hello?name=John")
+      .end(function (err, res) {
+        assert.equal(res.status, 200, "response status should be 200");
+        assert.equal(
+          res.text,
+          "hello John",
+          'response should be "hello John"'
+        );
+        done();
+      });
+  });
+```
+
+Notice the `done` parameter in the test's callback function. Calling it at the end without an argument is necessary to signal successful asynchronous completion.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, alter the `'Test GET /hello with no name'` test (`// #1`) to assert the `status` and the `text` response to make the test pass. Do not alter the arguments passed to the asserts.
+
+There should be no name in the query; the endpoint responds with `hello Guest`.
+
+# --hints--
+
+All tests should pass
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=0').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should test for 'res.status' == 200
+
+```js
+(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);
+    }
+  );
+```
+
+You should test for 'res.text' == 'hello Guest'
+
+```js
+(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.match(data.assertions[1].args[1], /('|")hello Guest\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
new file mode 100644
index 0000000000..d34360de18
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser-ii.md
@@ -0,0 +1,115 @@
+---
+id: 5f8884f4c46685731aabfc41
+title: Run Functional Tests Using a Headless Browser II
+challengeType: 2
+forumTopicId: 301594
+dashedName: run-functional-tests-using-a-headless-browser-ii
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, in the `'submit "surname" : "Vespucci" - write your e2e test...'` test (`// #6`), automate filling-in and submitting the form from scratch:
+
+1.  Fill in the form with the `surname` of `Vespucci`
+2.  Submit it pressing `'submit'` button
+
+Within the callback:
+
+1.  assert that status is `200`
+2.  assert that the text inside the element `span#name` is `'Amerigo'`
+3.  assert that the text inside the element `span#surname` is `'Vespucci'`
+4.  assert that the element(s) `span#dates` exist and their count is `1`
+
+Do not forget to to remove the `assert.fail()` call.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the headless browser request succeeded.
+
+```js
+(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);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#name' is 'Amerigo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'browser.text');
+      assert.match(data.assertions[1].args[0], /('|")span#name\1/);
+      assert.match(data.assertions[1].args[1], /('|")Amerigo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#surname' is 'Vespucci'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'browser.text');
+      assert.match(data.assertions[2].args[0], /('|")span#surname\1/);
+      assert.match(data.assertions[2].args[1], /('|")Vespucci\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the element 'span#dates' exist and its count is 1.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(
+    (data) => {
+      assert.equal(data.assertions[3].method, 'browser.elements');
+      assert.match(data.assertions[3].args[0], /('|")span#dates\1/);
+      assert.equal(data.assertions[3].args[1], 1);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
new file mode 100644
index 0000000000..3da3211b67
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/run-functional-tests-using-a-headless-browser.md
@@ -0,0 +1,140 @@
+---
+id: 587d8250367417b2b2512c5d
+title: Run Functional Tests using a Headless Browser
+challengeType: 2
+forumTopicId: 301595
+dashedName: run-functional-tests-using-a-headless-browser
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+In the HTML main view we provided a input form. It sends data to the `PUT /travellers` endpoint that we used above with an Ajax request. When the request successfully completes, the client code appends a `<div>` containing the info returned by the call to the DOM. Here is an example of how to interact with this form:
+
+```js
+test('#test - submit the input "surname" : "Polo"', function (done) {
+  browser.fill('surname', 'Polo').pressButton('submit', function () {
+    browser.assert.success();
+    browser.assert.text('span#name', 'Marco');
+    browser.assert.text('span#surname', 'Polo');
+    browser.assert.elements('span#dates', 1);
+    done();
+  });
+}
+```
+
+First, the `fill` method of the `browser` object fills the `surname` field of the form with the value `'Polo'`. Immediately after, the `pressButton` method invokes the `submit` event listener of the form. The `pressButton` method is asynchronous.
+
+Then, once a response is received from the AJAX request, a few assertions are made confirming:
+
+1.  The status of the response is `200`
+2.  The text within the `<span id='name'></span>` element matches `'Marco'`
+3.  The text within the `<span id='surname'></span>` element matches `'Polo'`
+4.  There is `1` `<span id='dates'></span>` element.
+
+Finally, the `done` callback is invoked, which is needed due to the asynchronous test.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, in the `'submit "surname" : "Colombo" - write your e2e test...'` test (`// #5`), automate filling-in and submitting the form:
+
+1.  Fill in the form
+2.  Submit it pressing `'submit'` button.
+
+Within the callback:
+
+1.  assert that status is OK `200`
+2.  assert that the text inside the element `span#name` is `'Cristoforo'`
+3.  assert that the text inside the element `span#surname` is `'Colombo'`
+4.  assert that the element(s) `span#dates` exist and their count is `1`
+
+Do not forget to remove the `assert.fail()` call.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the headless browser request succeeded.
+
+```js
+(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);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#name' is 'Cristoforo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'browser.text');
+      assert.match(data.assertions[1].args[0], /('|")span#name\1/);
+      assert.match(data.assertions[1].args[1], /('|")Cristoforo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the text inside the element 'span#surname' is 'Colombo'.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'browser.text');
+      assert.match(data.assertions[2].args[0], /('|")span#surname\1/);
+      assert.match(data.assertions[2].args[1], /('|")Colombo\1/);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should assert that the element 'span#dates' exist and its count is 1.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(
+    (data) => {
+      assert.equal(data.assertions[3].method, 'browser.elements');
+      assert.match(data.assertions[3].args[0], /('|")span#dates\1/);
+      assert.equal(data.assertions[3].args[1], 1);
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
new file mode 100644
index 0000000000..7bf0765de5
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/simulate-actions-using-a-headless-browser.md
@@ -0,0 +1,76 @@
+---
+id: 587d824f367417b2b2512c5c
+title: Simulate Actions Using a Headless Browser
+challengeType: 2
+dashedName: simulate-actions-using-a-headless-browser
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+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. This kind of tool is particularly useful for testing web pages, as it is 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 Replit. There are many other (more powerful) options.
+
+Mocha allows you to prepare the ground running some code before the actual tests. This can be useful for example to create items in the database, which will be used in the successive tests.
+
+With a headless browser, before the actual testing, we need to **visit** the page we are going to inspect. The `suiteSetup` 'hook' is executed only once at the suite startup. Other different hook types can be executed before each test, after each test, or at the end of a suite. See the Mocha docs for more information.
+
+# --instructions--
+
+Within `tests/2_functional-tests.js`, immediately after the `Browser` declaration, add your project URL to the `site` property of the variable:
+
+```js
+Browser.site = 'https://sincere-cone.gomix.me'; // Your URL here
+```
+
+If you are testing on a local environment replace the line above with
+
+```js
+Browser.localhost('example.com', process.env.PORT || 3000);
+```
+
+Within `tests/2_functional-tests.js`, at the root level of the `'Functional Tests with Zombie.js'` suite, instantiate a new instance of the `Browser` object with the following code:
+
+```js
+const browser = new Browser();
+```
+
+Then, use the `suiteSetup` hook to direct the `browser` to the `/` route with the following code:
+
+```js
+suiteSetup(function(done) {
+  return browser.visit('/', done);
+});
+```
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=functional').then(
+    (data) => {
+      data.slice(0, 4).forEach((test) => {
+        assert.equal(test.state, 'passed');
+      })
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
new file mode 100644
index 0000000000..a12fe6397b
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-for-truthiness.md
@@ -0,0 +1,101 @@
+---
+id: 587d824b367417b2b2512c49
+title: Test for Truthiness
+challengeType: 2
+forumTopicId: 301596
+dashedName: test-for-truthiness
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isTrue()` will test for the boolean value `true` and `isNotTrue()` will pass when given anything but the boolean value of `true`.
+
+```js
+assert.isTrue(true, 'this will pass with the boolean value true');
+assert.isTrue('true', 'this will NOT pass with the string value "true"');
+assert.isTrue(1, 'this will NOT pass with the number value 1');
+```
+
+`isFalse()` and `isNotFalse()` also exist, and behave similarly to their true counterparts except they look for the boolean value of `false`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#4` in the `Basic Assertions` suite, change each `assert` to either `assert.isTrue` or `assert.isNotTrue` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isTrue` vs. `isNotTrue`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
new file mode 100644
index 0000000000..60bf0f0bd1
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-string-contains-a-substring.md
@@ -0,0 +1,79 @@
+---
+id: 587d824d367417b2b2512c53
+title: Test if a String Contains a Substring
+challengeType: 2
+forumTopicId: 301597
+dashedName: test-if-a-string-contains-a-substring
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`include()` and `notInclude()` work for strings too! `include()` asserts that the actual string contains the expected substring.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#14` in the `Strings` suite, change each `assert` to either `assert.include` or `assert.notInclude` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=13').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `include` vs. `notInclude`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `include` vs. `notInclude`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
new file mode 100644
index 0000000000..7cddc15804
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-falls-within-a-specific-range.md
@@ -0,0 +1,87 @@
+---
+id: 587d824c367417b2b2512c4f
+title: Test if a Value Falls within a Specific Range
+challengeType: 2
+forumTopicId: 301598
+dashedName: test-if-a-value-falls-within-a-specific-range
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+```javascript
+.approximately(actual, expected, delta, [message])
+```
+
+Asserts that the `actual` is equal to `expected`, to within a +/- `delta` range.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#10` in the `Comparisons` suite, change each `assert` to `assert.approximately` to make the test pass (should evaluate to `true`).
+
+Choose the minimum range (3rd parameter) to make the test always pass. It should be less than 1.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct range for the first assertion - `approximately(actual, expected, range)`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.assertions[0].method, 'approximately');
+      assert.equal(
+        data.assertions[0].args[2],
+        0.5,
+        "weirdNumbers(0.5) is in the range (0.5, 1.5]. It's within 1 +/- 0.5"
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct range for the second assertion - `approximately(actual, expected, range)`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=9').then(
+    (data) => {
+      assert.equal(data.assertions[1].method, 'approximately');
+      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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
new file mode 100644
index 0000000000..9fa5b147ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-a-string.md
@@ -0,0 +1,93 @@
+---
+id: 587d824d367417b2b2512c52
+title: Test if a Value is a String
+challengeType: 2
+forumTopicId: 301599
+dashedName: test-if-a-value-is-a-string
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isString` or `isNotString` asserts that the actual value is a string.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#13` in the `Strings` suite, change each `assert` to either `assert.isString` or `assert.isNotString` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isString` vs. `isNotString`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isString` vs. `isNotString`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isString` vs. `isNotString`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
new file mode 100644
index 0000000000..3ed6428022
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-an-array.md
@@ -0,0 +1,77 @@
+---
+id: 587d824d367417b2b2512c50
+title: Test if a Value is an Array
+challengeType: 2
+forumTopicId: 301600
+dashedName: test-if-a-value-is-an-array
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#11` in the `Arrays` suite, change each `assert` to either `assert.isArray` or `assert.isNotArray` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isArray` vs. `isNotArray`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isArray` vs. `isNotArray`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
new file mode 100644
index 0000000000..55b278c0df
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-value-is-of-a-specific-data-structure-type.md
@@ -0,0 +1,133 @@
+---
+id: 587d824e367417b2b2512c56
+title: Test if a Value is of a Specific Data Structure Type
+challengeType: 2
+forumTopicId: 301601
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`#typeOf` asserts that value's type is the given string, as determined by `Object.prototype.toString`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#17` in the `Objects` suite, change each `assert` to either `assert.typeOf` or `assert.notTypeOf` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(
+    (data) => {
+      assert.equal(
+        data.assertions[2].method,
+        'notTypeOf',
+        'Plane.wings is a Number (not a String)'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fifth assertion - `typeOf` vs. `notTypeOf`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
new file mode 100644
index 0000000000..426165f522
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-a-variable-or-function-is-defined.md
@@ -0,0 +1,95 @@
+---
+id: 587d824b367417b2b2512c47
+title: Test if a Variable or Function is Defined
+challengeType: 2
+forumTopicId: 301602
+dashedName: test-if-a-variable-or-function-is-defined
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#2` in the `Basic Assertions` suite, change each `assert` to either `assert.isDefined()` or `assert.isUndefined()` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isDefined` vs. `isUndefined`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
new file mode 100644
index 0000000000..0938de8bfc
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-array-contains-an-item.md
@@ -0,0 +1,77 @@
+---
+id: 587d824d367417b2b2512c51
+title: Test if an Array Contains an Item
+challengeType: 2
+forumTopicId: 301603
+dashedName: test-if-an-array-contains-an-item
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#12` in the `Arrays` suite, change each `assert` to either `assert.include` or `assert.notInclude` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=11').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `include` vs. `notInclude`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `include` vs. `notInclude`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
new file mode 100644
index 0000000000..54540528da
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-has-a-property.md
@@ -0,0 +1,93 @@
+---
+id: 587d824e367417b2b2512c55
+title: Test if an Object has a Property
+challengeType: 2
+forumTopicId: 301604
+dashedName: test-if-an-object-has-a-property
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`property` asserts that the actual object has a given property.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#16` in the `Objects` suite, change each `assert` to either `assert.property` or `assert.notProperty` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `property` vs. `notProperty`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `property` vs. `notProperty`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `property` vs. `notProperty`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
new file mode 100644
index 0000000000..6855c8a644
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-an-object-is-an-instance-of-a-constructor.md
@@ -0,0 +1,115 @@
+---
+id: 587d824e367417b2b2512c57
+title: Test if an Object is an Instance of a Constructor
+challengeType: 2
+forumTopicId: 301605
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`#instanceOf` asserts that an object is an instance of a constructor.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#18` in the `Objects` suite, change each `assert` to either `assert.instanceOf` or `assert.notInstanceOf` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `instanceOf` vs. `notInstanceOf`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
new file mode 100644
index 0000000000..66f6d98b9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/test-if-one-value-is-below-or-at-least-as-large-as-another.md
@@ -0,0 +1,109 @@
+---
+id: 587d824c367417b2b2512c4e
+title: Test if One Value is Below or At Least as Large as Another
+challengeType: 2
+forumTopicId: 301606
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#9` in the `Comparisons` suite, change each `assert` to either `assert.isBelow` or `assert.isAtLeast` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(
+        data.assertions[1].method,
+        'isAtLeast',
+        '2 * Math.random() is at least 0'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(data.assertions[2].method, 'isBelow', '1 is smaller than 2');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `isBelow` vs. `isAtLeast`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(
+    (data) => {
+      assert.equal(
+        data.assertions[3].method,
+        'isBelow',
+        '2/3 (0.6666) is smaller than 1'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
new file mode 100644
index 0000000000..cf5da7e951
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-assert.isok-and-assert.isnotok.md
@@ -0,0 +1,87 @@
+---
+id: 587d824b367417b2b2512c48
+title: Use Assert.isOK and Assert.isNotOK
+challengeType: 2
+forumTopicId: 301607
+dashedName: use-assert-isok-and-assert-isnotok
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`isOk()` will test for a truthy value, and `isNotOk()` will test for a falsy value.
+
+To learn more about truthy and falsy values, try our [Falsy Bouncer](https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer) challenge.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#3` in the `Basic Assertions` suite, change each `assert` to either `assert.isOk()` or `assert.isNotOk()` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `isOk` vs. `isNotOk`.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(
+    (data) => {
+      assert.equal(data.assertions[0].method, 'isNotOk', 'Null is falsy');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `isOk` vs. `isNotOk`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `isOk` vs. `isNotOk`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
new file mode 100644
index 0000000000..676b8b07b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-regular-expressions-to-test-a-string.md
@@ -0,0 +1,79 @@
+---
+id: 587d824d367417b2b2512c54
+title: Use Regular Expressions to Test a String
+challengeType: 2
+forumTopicId: 301608
+dashedName: use-regular-expressions-to-test-a-string
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`match()` asserts that the actual value matches the second argument regular expression.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#15` in the `Strings` suite, change each `assert` to either `assert.match` or `assert.notMatch` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=14').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `match` vs. `notMatch`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `match` vs. `notMatch`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
new file mode 100644
index 0000000000..2878f794bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-double-equals-to-assert-equality.md
@@ -0,0 +1,111 @@
+---
+id: 587d824b367417b2b2512c4a
+title: Use the Double Equals to Assert Equality
+challengeType: 2
+forumTopicId: 301609
+dashedName: use-the-double-equals-to-assert-equality
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`equal()` compares objects using `==`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#5` in the `Equality` suite, change each `assert` to either `assert.equal` or `assert.notEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `equal` vs. `notEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `equal` vs. `notEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
new file mode 100644
index 0000000000..b8e6aeedd2
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-and-testing-with-chai/use-the-triple-equals-to-assert-strict-equality.md
@@ -0,0 +1,111 @@
+---
+id: 587d824b367417b2b2512c4b
+title: Use the Triple Equals to Assert Strict Equality
+challengeType: 2
+forumTopicId: 301610
+dashedName: use-the-triple-equals-to-assert-strict-equality
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-mochachai), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-mochachai/).
+
+`strictEqual()` compares objects using `===`.
+
+# --instructions--
+
+Within `tests/1_unit-tests.js` under the test labelled `#6` in the `Equality` suite, change each `assert` to either `assert.strictEqual` or `assert.notStrictEqual` to make the test pass (should evaluate to `true`). Do not alter the arguments passed to the asserts.
+
+# --hints--
+
+All tests should pass.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(
+    (data) => {
+      assert.equal(data.state, 'passed');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+You should choose the correct method for the first assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the second assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the third assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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);
+    }
+  );
+```
+
+You should choose the correct method for the fourth assertion - `strictEqual` vs. `notStrictEqual`.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/american-british-translator.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
new file mode 100644
index 0000000000..0f778edc57
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/american-british-translator.md
@@ -0,0 +1,337 @@
+---
+id: 5e601c0d5ac9d0ecd8b94afe
+title: American British Translator
+challengeType: 4
+forumTopicId: 462358
+dashedName: american-british-translator
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://american-british-translator.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-american-british-english-translator/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-american-british-english-translator) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+-   All logic can go into `/components/translator.js`
+-   Complete the `/api/translate` route in `/routes/api.js`
+-   Create all of the unit/functional tests in `tests/1_unit-tests.js` and `tests/2_functional-tests.js`
+-   See the JavaScript files in `/components` for the different spelling and terms your application should translate
+-   To run the tests on Replit, set `NODE_ENV` to `test` without quotes in the `.env` file
+-   To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+-   Translate `Mangoes are my favorite fruit.` to British English
+-   Translate `I ate yogurt for breakfast.` to British English
+-   Translate `We had a party at my friend's condo.` to British English
+-   Translate `Can you toss this in the trashcan for me?` to British English
+-   Translate `The parking lot was full.` to British English
+-   Translate `Like a high tech Rube Goldberg machine.` to British English
+-   Translate `To play hooky means to skip class or work.` to British English
+-   Translate `No Mr. Bond, I expect you to die.` to British English
+-   Translate `Dr. Grosh will see you now.` to British English
+-   Translate `Lunch is at 12:15 today.` to British English
+-   Translate `We watched the footie match for a while.` to American English
+-   Translate `Paracetamol takes up to an hour to work.` to American English
+-   Translate `First, caramelise the onions.` to American English
+-   Translate `I spent the bank holiday at the funfair.` to American English
+-   Translate `I had a bicky then went to the chippy.` to American English
+-   Translate `I've just got bits and bobs in my bum bag.` to American English
+-   Translate `The car boot sale at Boxted Airfield was called off.` to American English
+-   Translate `Have you met Mrs Kalyani?` to American English
+-   Translate `Prof Joyner of King's College, London.` to American English
+-   Translate `Tea time is usually around 4 or 4.30.` to American English
+-   Highlight translation in `Mangoes are my favorite fruit.`
+-   Highlight translation in `I ate yogurt for breakfast.`
+-   Highlight translation in `We watched the footie match for a while.`
+-   Highlight translation in `Paracetamol takes up to an hour to work.`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Translation with text and locale fields: POST request to `/api/translate`
+-   Translation with text and invalid locale field: POST request to `/api/translate`
+-   Translation with missing text field: POST request to `/api/translate`
+-   Translation with missing locale field: POST request to `/api/translate`
+-   Translation with empty text: POST request to `/api/translate`
+-   Translation with text that needs no translation: POST request to `/api/translate`
+
+# --hints--
+
+I can provide my own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/american-british-translator\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You can `POST` to `/api/translate` with a body containing `text` with the text to translate and `locale` with either `american-to-british` or `british-to-american`. The returned object should contain the submitted `text` and `translation` with the translated text.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Mangoes are my favorite fruit.';
+    const locale = 'american-to-british';
+    const output = {
+      text: 'Mangoes are my favorite fruit.',
+      translation:
+        'Mangoes are my <span class="highlight">favourite</span> fruit.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `/api/translate` route should handle the way time is written in American and British English. For example, ten thirty is written as "10.30" in British English and "10:30" in American English. The `span` element should wrap the entire time string, i.e. `<span class="highlight">10:30</span>`.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Lunch is at 12:15 today.';
+    const locale = 'american-to-british';
+    const output = {
+      text: text,
+      translation: 'Lunch is at <span class="highlight">12.15</span> today.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `/api/translate` route should also handle the way titles/honorifics are abbreviated in American and British English. For example, Doctor Wright is abbreviated as "Dr Wright" in British English and "Dr. Wright" in American English. See `/public/american-to-british-titles.js` for the different titles your application should handle.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Dr. Grosh will see you now.';
+    const locale = 'american-to-british';
+    const output = {
+      text: text,
+      translation: '<span class="highlight">Dr</span> Grosh will see you now.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+Wrap any translated spelling or terms with `<span class="highlight">...</span>` tags so they appear in green.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = 'Mangoes are my favorite fruit.';
+    const locale = 'american-to-british';
+    const output = {
+      text: 'Mangoes are my favorite fruit.',
+      translation:
+        'Mangoes are my <span class="highlight">favourite</span> fruit.'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If one or more of the required fields is missing, return `{ error: 'Required field(s) missing' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'american-to-british';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'Required field(s) missing');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `text` is empty, return `{ error: 'No text to translate' }`
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'american-to-british';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text: '', locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'No text to translate');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `locale` does not match one of the two specified locales, return `{ error: 'Invalid value for locale field' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const text = "Ceci n'est pas une pipe";
+    const locale = 'french-to-american';
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.property(parsed, 'error');
+    assert.equal(parsed.error, 'Invalid value for locale field');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If `text` requires no translation, return `"Everything looks good to me!"` for the `translation` value.
+
+```js
+async (getUserInput) => {
+  try {
+    const locale = 'british-to-american';
+    const output = {
+      text: 'SaintPeter and nhcarrigan give their regards!',
+      translation: 'Everything looks good to me!'
+    };
+    let data = await fetch(getUserInput('url') + '/api/translate', {
+      method: 'POST',
+      headers: { 'Content-Type': 'application/json' },
+      body: JSON.stringify({ text: output.text, locale })
+    });
+    let parsed = await data.json();
+    assert.isObject(parsed);
+    assert.isObject(parsed);
+    assert.property(parsed, 'text');
+    assert.property(parsed, 'translation');
+    assert.deepEqual(parsed, output);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 24 unit tests are complete and passing. See `/tests/1_unit-tests.js` for the expected behavior you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const unitTests = getTests.filter((test) => {
+      return !!test.context.match(/Unit Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 24, 'At least 24 tests passed');
+    unitTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 6 functional tests are complete and passing. See `/tests/2_functional-tests.js` for the functionality you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const functTests = getTests.filter((test) => {
+      return !!test.context.match(/Functional Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 6, 'At least 6 tests passed');
+    functTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/issue-tracker.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
new file mode 100644
index 0000000000..a2fce8e7c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/issue-tracker.md
@@ -0,0 +1,369 @@
+---
+id: 587d8249367417b2b2512c42
+title: Issue Tracker
+challengeType: 4
+forumTopicId: 301569
+dashedName: issue-tracker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://issue-tracker.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-issuetracker/) and complete your project locally.
+-   Use [this Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-issuetracker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+-   Complete the necessary routes in `/routes/api.js`
+-   Create all of the functional tests in `tests/2_functional-tests.js`
+-   Copy the `sample.env` file to `.env` and set the variables appropriately
+-   To run the tests uncomment `NODE_ENV=test` in your `.env` file
+-   To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Create an issue with every field: POST request to `/api/issues/{project}`
+-   Create an issue with only required fields: POST request to `/api/issues/{project}`
+-   Create an issue with missing required fields: POST request to `/api/issues/{project}`
+-   View issues on a project: GET request to `/api/issues/{project}`
+-   View issues on a project with one filter: GET request to `/api/issues/{project}`
+-   View issues on a project with multiple filters: GET request to `/api/issues/{project}`
+-   Update one field on an issue: PUT request to `/api/issues/{project}`
+-   Update multiple fields on an issue: PUT request to `/api/issues/{project}`
+-   Update an issue with missing `_id`: PUT request to `/api/issues/{project}`
+-   Update an issue with no fields to update: PUT request to `/api/issues/{project}`
+-   Update an issue with an invalid `_id`: PUT request to `/api/issues/{project}`
+-   Delete an issue: DELETE request to `/api/issues/{project}`
+-   Delete an issue with an invalid `_id`: DELETE request to `/api/issues/{project}`
+-   Delete an issue with missing `_id`: DELETE request to `/api/issues/{project}`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(!/.*\/issue-tracker\.freecodecamp\.rocks/.test(getUserInput('url')));
+};
+```
+
+You can send a `POST` request to `/api/issues/{projectname}` with form data containing the required fields `issue_title`, `issue_text`, `created_by`, and optionally `assigned_to` and `status_text`.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'Faux Issue Title',
+      issue_text: 'Functional Test - Required Fields Only',
+      created_by: 'fCC'
+    };
+    const data = await $.post(
+      getUserInput('url') + '/api/issues/fcc-project',
+      test_data
+    );
+    assert.isObject(data);
+    assert.nestedInclude(data, test_data);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+The `POST` request to `/api/issues/{projectname}` will return the created object, and must include all of the submitted fields. Excluded optional fields will be returned as empty strings. Additionally, include `created_on` (date/time), `updated_on` (date/time), `open` (boolean, `true` for open - default value, `false` for closed), and `_id`.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'Faux Issue Title 2',
+      issue_text: 'Functional Test - Every field filled in',
+      created_by: 'fCC',
+      assigned_to: 'Chai and Mocha'
+    };
+    const data = await $.post(
+      getUserInput('url') + '/api/issues/fcc-project',
+      test_data
+    );
+    assert.isObject(data);
+    assert.nestedInclude(data, test_data);
+    assert.property(data, 'created_on');
+    assert.isNumber(Date.parse(data.created_on));
+    assert.property(data, 'updated_on');
+    assert.isNumber(Date.parse(data.updated_on));
+    assert.property(data, 'open');
+    assert.isBoolean(data.open);
+    assert.isTrue(data.open);
+    assert.property(data, '_id');
+    assert.isNotEmpty(data._id);
+    assert.property(data, 'status_text');
+    assert.isEmpty(data.status_text);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+If you send a `POST` request to `/api/issues/{projectname}` without the required fields, returned will be the error `{ error: 'required field(s) missing' }`
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = { created_by: 'fCC' };
+    const data = await $.post(getUserInput('url') + '/api/issues/fcc-project', {
+      created_by: 'fCC'
+    });
+    assert.isObject(data);
+    assert.property(data, 'error');
+    assert.equal(data.error, 'required field(s) missing');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `GET` request to `/api/issues/{projectname}` for an array of all issues for that specific `projectname`, with all the fields present for each issue.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = { issue_text: 'Get Issues Test', created_by: 'fCC' };
+    const url =
+      getUserInput('url') +
+      '/api/issues/get_issues_test_' +
+      Date.now().toString().substring(7);
+    const data1 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 1' })
+    );
+    assert.isObject(data1);
+    const data2 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 2' })
+    );
+    assert.isObject(data2);
+    const data3 = await $.post(
+      url,
+      Object.assign(test_data, { issue_title: 'Faux Issue 3' })
+    );
+    assert.isObject(data3);
+    const getIssues = await $.get(url);
+    assert.isArray(getIssues);
+    assert.lengthOf(getIssues, 3);
+    let re = new RegExp('Faux Issue \\d');
+    getIssues.forEach((issue) => {
+      assert.property(issue, 'issue_title');
+      assert.match(issue.issue_title, re);
+      assert.property(issue, 'issue_text');
+      assert.property(issue, 'created_by');
+      assert.property(issue, 'assigned_to');
+      assert.property(issue, 'status_text');
+      assert.property(issue, 'open');
+      assert.property(issue, 'created_on');
+      assert.property(issue, 'updated_on');
+      assert.property(issue, '_id');
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `GET` request to `/api/issues/{projectname}` and filter the request by also passing along any field and value as a URL query (ie. `/api/issues/{project}?open=false`). You can pass one or more field/value pairs at once.
+
+```js
+async (getUserInput) => {
+  try {
+    let test_data = {
+      issue_title: 'To be Filtered',
+      issue_text: 'Filter Issues Test'
+    };
+    const url =
+      getUserInput('url') +
+      '/api/issues/get_issues_test_' +
+      Date.now().toString().substring(7);
+    const data1 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Bob' })
+    );
+    const data2 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Bob' })
+    );
+    const data3 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Alice', assigned_to: 'Eric' })
+    );
+    const data4 = await $.post(
+      url,
+      Object.assign(test_data, { created_by: 'Carol', assigned_to: 'Eric' })
+    );
+    const getSingle = await $.get(url + '?created_by=Alice');
+    assert.isArray(getSingle);
+    assert.lengthOf(getSingle, 3);
+    const getMultiple = await $.get(url + '?created_by=Alice&assigned_to=Bob');
+    assert.isArray(getMultiple);
+    assert.lengthOf(getMultiple, 2);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `PUT` request to `/api/issues/{projectname}` with an `_id` and one or more fields to update. On success, the `updated_on` field should be updated, and returned should be `{  result: 'successfully updated', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    let initialData = {
+      issue_title: 'Issue to be Updated',
+      issue_text: 'Functional Test - Put target',
+      created_by: 'fCC'
+    };
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const itemToUpdate = await $.post(url, initialData);
+    const updateSucccess = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: itemToUpdate._id, issue_text: 'New Issue Text' }
+    });
+    assert.isObject(updateSucccess);
+    assert.deepEqual(updateSucccess, {
+      result: 'successfully updated',
+      _id: itemToUpdate._id
+    });
+    const getUpdatedId = await $.get(url + '?_id=' + itemToUpdate._id);
+    assert.isArray(getUpdatedId);
+    assert.isObject(getUpdatedId[0]);
+    assert.isAbove(
+      Date.parse(getUpdatedId[0].updated_on),
+      Date.parse(getUpdatedId[0].created_on)
+    );
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+When the `PUT` request sent to `/api/issues/{projectname}` does not include an `_id`, the return value is `{ error: 'missing _id' }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const badUpdate = await $.ajax({ url: url, type: 'PUT' });
+    assert.isObject(badUpdate);
+    assert.property(badUpdate, 'error');
+    assert.equal(badUpdate.error, 'missing _id');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+When the `PUT` request sent to `/api/issues/{projectname}` does not include update fields, the return value is `{ error: 'no update field(s) sent', '_id': _id }`. On any other error, the return value is `{ error: 'could not update', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const badUpdate = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: '5f665eb46e296f6b9b6a504d' }
+    });
+    assert.deepEqual(badUpdate, {
+      error: 'no update field(s) sent',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+    const badIdUpdate = await $.ajax({
+      url: url,
+      type: 'PUT',
+      data: { _id: '5f665eb46e296f6b9b6a504d', issue_text: 'New Issue Text' }
+    });
+    assert.deepEqual(badIdUpdate, {
+      error: 'could not update',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a `DELETE` request to `/api/issues/{projectname}` with an `_id` to delete an issue. If no `_id` is sent, the return value is `{ error: 'missing _id' }`. On success, the return value is `{ result: 'successfully deleted', '_id': _id }`. On failure, the return value is `{ error: 'could not delete', '_id': _id }`.
+
+```js
+async (getUserInput) => {
+  try {
+    let initialData = {
+      issue_title: 'Issue to be Deleted',
+      issue_text: 'Functional Test - Delete target',
+      created_by: 'fCC'
+    };
+    const url = getUserInput('url') + '/api/issues/fcc-project';
+    const itemToDelete = await $.post(url, initialData);
+    assert.isObject(itemToDelete);
+    const deleteSuccess = await $.ajax({
+      url: url,
+      type: 'DELETE',
+      data: { _id: itemToDelete._id }
+    });
+    assert.isObject(deleteSuccess);
+    assert.deepEqual(deleteSuccess, {
+      result: 'successfully deleted',
+      _id: itemToDelete._id
+    });
+    const noId = await $.ajax({ url: url, type: 'DELETE' });
+    assert.isObject(noId);
+    assert.deepEqual(noId, { error: 'missing _id' });
+    const badIdDelete = await $.ajax({
+      url: url,
+      type: 'DELETE',
+      data: { _id: '5f665eb46e296f6b9b6a504d', issue_text: 'New Issue Text' }
+    });
+    assert.isObject(badIdDelete);
+    assert.deepEqual(badIdDelete, {
+      error: 'could not delete',
+      _id: '5f665eb46e296f6b9b6a504d'
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 14 functional tests are complete and passing.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    assert.isAtLeast(getTests.length, 14, 'At least 14 tests passed');
+    getTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
new file mode 100644
index 0000000000..e99c8953c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/metric-imperial-converter.md
@@ -0,0 +1,318 @@
+---
+id: 587d8249367417b2b2512c41
+title: Metric-Imperial Converter
+challengeType: 4
+forumTopicId: 301570
+dashedName: metric-imperial-converter
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://metric-imperial-converter.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/) and complete your project locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-metricimpconverter) to complete your project.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+- Complete the necessary conversion logic in `/controllers/convertHandler.js`
+- Complete the necessary routes in `/routes/api.js`
+- Copy the `sample.env` file to `.env` and set the variables appropriately
+- To run the tests uncomment `NODE_ENV=test` in your `.env` file
+- To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+- `convertHandler` should correctly read a whole number input.
+- `convertHandler` should correctly read a decimal number input.
+- `convertHandler` should correctly read a fractional input.
+- `convertHandler` should correctly read a fractional input with a decimal.
+- `convertHandler` should correctly return an error on a double-fraction (i.e. `3/2/3`).
+- `convertHandler` should correctly default to a numerical input of `1` when no numerical input is provided.
+- `convertHandler` should correctly read each valid input unit.
+- `convertHandler` should correctly return an error for an invalid input unit.
+- `convertHandler` should return the correct return unit for each valid input unit.
+- `convertHandler` should correctly return the spelled-out string unit for each valid input unit.
+- `convertHandler` should correctly convert `gal` to `L`.
+- `convertHandler` should correctly convert `L` to `gal`.
+- `convertHandler` should correctly convert `mi` to `km`.
+- `convertHandler` should correctly convert `km` to `mi`.
+- `convertHandler` should correctly convert `lbs` to `kg`.
+- `convertHandler` should correctly convert `kg` to `lbs`.
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+- Convert a valid input such as `10L`: `GET` request to `/api/convert`.
+- Convert an invalid input such as `32g`: `GET` request to `/api/convert`.
+- Convert an invalid number such as `3/7.2/4kg`: `GET` request to `/api/convert`.
+- Convert an invalid number AND unit such as `3/7.2/4kilomegagram`: `GET` request to `/api/convert`.
+- Convert with no number such as `kg`: `GET` request to `/api/convert`.
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+getUserInput => {
+  assert(
+    !/.*\/metric-imperial-converter\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+You 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)
+
+```js
+
+```
+
+You can convert `'gal'` to `'L'` and vice versa. (1 gal to 3.78541 L)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1gal');
+    assert.equal(data1.returnNum, 3.78541);
+    assert.equal(data1.returnUnit, 'L');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10gal');
+    assert.equal(data2.returnNum, 37.8541);
+    assert.equal(data2.returnUnit, 'L');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1l');
+    assert.equal(data3.returnNum, 0.26417);
+    assert.equal(data3.returnUnit, 'gal');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10l');
+    assert.equal(data4.returnNum, 2.64172);
+    assert.equal(data4.returnUnit, 'gal');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can convert `'lbs'` to `'kg'` and vice versa. (1 lbs to 0.453592 kg)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1lbs');
+    assert.equal(data1.returnNum, 0.45359);
+    assert.equal(data1.returnUnit, 'kg');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10lbs');
+    assert.equal(data2.returnNum, 4.53592);
+    assert.equal(data2.returnUnit, 'kg');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1kg');
+    assert.equal(data3.returnNum, 2.20462);
+    assert.equal(data3.returnUnit, 'lbs');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10kg');
+    assert.equal(data4.returnNum, 22.04624);
+    assert.equal(data4.returnUnit, 'lbs');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can convert `'mi'` to `'km'` and vice versa. (1 mi to 1.60934 km)
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1mi');
+    assert.equal(data1.returnNum, 1.60934);
+    assert.equal(data1.returnUnit, 'km');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10mi');
+    assert.equal(data2.returnNum, 16.0934);
+    assert.equal(data2.returnUnit, 'km');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1km');
+    assert.equal(data3.returnNum, 0.62137);
+    assert.equal(data3.returnUnit, 'mi');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10km');
+    assert.equal(data4.returnNum, 6.21373);
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+All incoming units should be accepted in both upper and lower case, but should be returned in both the `initUnit` and `returnUnit` in lower case, except for liter, which should be represented as an uppercase `'L'`.
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=1gal');
+    assert.equal(data1.initUnit, 'gal');
+    assert.equal(data1.returnUnit, 'L');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=10L');
+    assert.equal(data2.initUnit, 'L');
+    assert.equal(data2.returnUnit, 'gal');
+    const data3 = await $.get(getUserInput('url') + '/api/convert?input=1l');
+    assert.equal(data3.initUnit, 'L');
+    assert.equal(data3.returnUnit, 'gal');
+    const data4 = await $.get(getUserInput('url') + '/api/convert?input=10KM');
+    assert.equal(data4.initUnit, 'km');
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If the unit of measurement is invalid, returned will be `'invalid unit'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(getUserInput('url') + '/api/convert?input=1min');
+    assert(data.error === 'invalid unit' || data === 'invalid unit');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If the number is invalid, returned will be `'invalid number'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(
+      getUserInput('url') + '/api/convert?input=1//2gal'
+    );
+    assert(data.error === 'invalid number' || data === 'invalid number');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+If both the unit and number are invalid, returned will be `'invalid number and unit'`.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(
+      getUserInput('url') + '/api/convert?input=1//2min'
+    );
+    assert(
+      data.error === 'invalid number and unit' ||
+        data === 'invalid number and unit'
+    );
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+You can use fractions, decimals or both in the parameter (ie. 5, 1/2, 2.5/6), but if nothing is provided it will default to 1.
+
+```js
+async getUserInput => {
+  try {
+    const data1 = await $.get(getUserInput('url') + '/api/convert?input=mi');
+    assert.approximately(data1.initNum, 1, 0.001);
+    assert.approximately(data1.returnNum, 1.60934, 0.001);
+    assert.equal(data1.returnUnit, 'km');
+    const data2 = await $.get(getUserInput('url') + '/api/convert?input=1/5mi');
+    assert.approximately(data2.initNum, 1 / 5, 0.1);
+    assert.approximately(data2.returnNum, 0.32187, 0.001);
+    assert.equal(data2.returnUnit, 'km');
+    const data3 = await $.get(
+      getUserInput('url') + '/api/convert?input=1.5/7km'
+    );
+    assert.approximately(data3.initNum, 1.5 / 7, 0.001);
+    assert.approximately(data3.returnNum, 0.13315, 0.001);
+    assert.equal(data3.returnUnit, 'mi');
+    const data4 = await $.get(
+      getUserInput('url') + '/api/convert?input=3/2.7km'
+    );
+    assert.approximately(data4.initNum, 3 / 2.7, 0.001);
+    assert.approximately(data4.returnNum, 0.69041, 0.001);
+    assert.equal(data4.returnUnit, 'mi');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+Your return will consist of the `initNum`, `initUnit`, `returnNum`, `returnUnit`, and `string` spelling out units in the format `'{initNum} {initUnitString} converts to {returnNum} {returnUnitString}'` with the result rounded to 5 decimals.
+
+```js
+async getUserInput => {
+  try {
+    const data = await $.get(getUserInput('url') + '/api/convert?input=2mi');
+    assert.equal(data.initNum, 2);
+    assert.equal(data.initUnit, 'mi');
+    assert.approximately(data.returnNum, 3.21868, 0.001);
+    assert.equal(data.returnUnit, 'km', 'returnUnit did not match');
+    assert.equal(data.string, '2 miles converts to 3.21868 kilometers');
+  } catch (xhr) {
+    throw new Error(xhr.responseText || xhr.message);
+  }
+};
+```
+
+All 16 unit tests are complete and passing.
+
+```js
+async getUserInput => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const unitTests = getTests.filter(test => {
+      return !!test.context.match(/Unit Tests/gi);
+    });
+    assert.isAtLeast(unitTests.length, 16, 'At least 16 tests passed');
+    unitTests.forEach(test => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 5 functional tests are complete and passing.
+
+```js
+async getUserInput => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const functTests = getTests.filter(test => {
+      return !!test.context.match(/Functional Tests/gi);
+    });
+    assert.isAtLeast(functTests.length, 5, 'At least 5 tests passed');
+    functTests.forEach(test => {
+      assert.equal(test.state, 'passed', 'Tests in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/personal-library.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/personal-library.md
new file mode 100644
index 0000000000..f0bec1330e
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/personal-library.md
@@ -0,0 +1,221 @@
+---
+id: 587d824a367417b2b2512c43
+title: Personal Library
+challengeType: 4
+forumTopicId: 301571
+dashedName: personal-library
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://personal-library.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-library) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-library) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  Add your MongoDB connection string to `.env` without quotes as `DB`
+    Example: `DB=mongodb://admin:pass@1234.mlab.com:1234/fccpersonallib`
+2.  In your `.env` file set `NODE_ENV` to `test`, without quotes
+3.  You need to create all routes within `routes/api.js`
+4.  You will create all functional tests in `tests/2_functional-tests.js`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/personal-library\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You can send a <b>POST</b> request to `/api/books` with `title` as part of the form data to add a book.  The returned response will be an object with the `title` and a unique `_id` as keys.  If `title` is not included in the request, the returned response should be the string `missing required field title`.
+
+```js
+async (getUserInput) => {
+  try {
+    let data1 = await $.post(getUserInput('url') + '/api/books', {
+      title: 'Faux Book 1'
+    });
+    assert.isObject(data1);
+    assert.property(data1, 'title');
+    assert.equal(data1.title, 'Faux Book 1');
+    assert.property(data1, '_id');
+    let data2 = await $.post(getUserInput('url') + '/api/books');
+    assert.isString(data2);
+    assert.equal(data2, 'missing required field title');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>GET</b> request to `/api/books` and receive a JSON response representing all the books. The JSON response will be an array of objects with each object (book) containing `title`, `_id`, and `commentcount` properties.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let a = $.post(url, { title: 'Faux Book A' });
+    let b = $.post(url, { title: 'Faux Book B' });
+    let c = $.post(url, { title: 'Faux Book C' });
+    await Promise.all([a, b, c]).then(async () => {
+      let data = await $.get(url);
+      assert.isArray(data);
+      assert.isAtLeast(data.length, 3);
+      data.forEach((book) => {
+        assert.isObject(book);
+        assert.property(book, 'title');
+        assert.isString(book.title);
+        assert.property(book, '_id');
+        assert.property(book, 'commentcount');
+        assert.isNumber(book.commentcount);
+      });
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>GET</b> request to `/api/books/{_id}` to retrieve a single object of a book containing the properties `title`, `_id`, and a `comments` array (empty array if no comments present). If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let noBook = await $.get(url + '/5f665eb46e296f6b9b6a504d');
+    assert.isString(noBook);
+    assert.equal(noBook, 'no book exists');
+    let sampleBook = await $.post(url, { title: 'Faux Book Alpha' });
+    assert.isObject(sampleBook);
+    let bookId = sampleBook._id;
+    let bookQuery = await $.get(url + '/' + bookId);
+    assert.isObject(bookQuery);
+    assert.property(bookQuery, 'title');
+    assert.equal(bookQuery.title, 'Faux Book Alpha');
+    assert.property(bookQuery, 'comments');
+    assert.isArray(bookQuery.comments);
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>POST</b> request containing `comment` as the form body data to `/api/books/{_id}` to add a comment to a book. The returned response will be the books object similar to <b>GET</b> `/api/books/{_id}` request in an earlier test. If `comment` is not included in the request, return the string `missing required field comment`. If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let commentTarget = await $.post(url, { title: 'Notable Book' });
+    assert.isObject(commentTarget);
+    let bookId = commentTarget._id;
+    let bookCom1 = await $.post(url + '/' + bookId, {
+      comment: 'This book is fab!'
+    });
+    let bookCom2 = await $.post(url + '/' + bookId, {
+      comment: 'I did not care for it'
+    });
+    assert.isObject(bookCom2);
+    assert.property(bookCom2, '_id');
+    assert.property(bookCom2, 'title');
+    assert.property(bookCom2, 'comments');
+    assert.lengthOf(bookCom2.comments, 2);
+    bookCom2.comments.forEach((comment) => {
+      assert.isString(comment);
+      assert.oneOf(comment, ['This book is fab!', 'I did not care for it']);
+    });
+    let commentErr = await $.post(url + '/' + bookId);
+    assert.isString(commentErr);
+    assert.equal(commentErr, 'missing required field comment');
+    let failingComment = await $.post(url + '/5f665eb46e296f6b9b6a504d', {
+      comment: 'Never Seen Comment'
+    });
+    assert.isString(failingComment);
+    assert.equal(failingComment, 'no book exists');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>DELETE</b> request to `/api/books/{_id}` to delete a book from the collection. The returned response will be the string `delete successful` if successful. If no book is found, return the string `no book exists`.
+
+```js
+async (getUserInput) => {
+  try {
+    let url = getUserInput('url') + '/api/books';
+    let deleteTarget = await $.post(url, { title: 'Deletable Book' });
+    assert.isObject(deleteTarget);
+    let bookId = deleteTarget._id;
+    let doDelete = await $.ajax({ url: url + '/' + bookId, type: 'DELETE' });
+    assert.isString(doDelete);
+    assert.equal(doDelete, 'delete successful');
+    let failingDelete = await $.ajax({
+      url: url + '/5f665eb46e296f6b9b6a504d',
+      type: 'DELETE'
+    });
+    assert.isString(failingDelete);
+    assert.equal(failingDelete, 'no book exists');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+You can send a <b>DELETE</b> request to `/api/books` to delete all books in the database. The returned response will be the string `'complete delete successful` if successful.
+
+```js
+async (getUserInput) => {
+  try {
+    const deleteAll = await $.ajax({
+      url: getUserInput('url') + '/api/books',
+      type: 'DELETE'
+    });
+    assert.isString(deleteAll);
+    assert.equal(deleteAll, 'complete delete successful');
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 10 functional tests required are complete and passing.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    assert.isAtLeast(getTests.length, 10, 'At least 10 tests passed');
+    getTests.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
new file mode 100644
index 0000000000..79f9512fc1
--- /dev/null
+++ b/curriculum/challenges/portuguese/06-quality-assurance/quality-assurance-projects/sudoku-solver.md
@@ -0,0 +1,379 @@
+---
+id: 5e601bf95ac9d0ecd8b94afd
+title: Sudoku Solver
+challengeType: 4
+forumTopicId: 462357
+dashedName: sudoku-solver
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://sudoku-solver.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freecodecamp/boilerplate-project-sudoku-solver) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-sudoku-solver) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+- All puzzle logic can go into `/controllers/sudoku-solver.js`
+  - The `validate` function should take a given puzzle string and check it to see if it has 81 valid characters for the input.
+  - The `check` functions should be validating against the *current* state of the board.
+  - The `solve` function should handle solving any given valid puzzle string, not just the test inputs and solutions. You are expected to write out the logic to solve this.
+- All routing logic can go into `/routes/api.js`
+- See the `puzzle-strings.js` file in `/controllers` for some sample puzzles your application should solve
+- To run the challenge tests on this page, set `NODE_ENV` to `test` without quotes in the `.env` file
+- To run the tests in the console, use the command `npm run test`. To open the Replit console, press Ctrl+Shift+P (Cmd if on a Mac) and type "open shell"
+
+Write the following tests in `tests/1_unit-tests.js`:
+
+-   Logic handles a valid puzzle string of 81 characters
+-   Logic handles a puzzle string with invalid characters (not 1-9 or `.`)
+-   Logic handles a puzzle string that is not 81 characters in length
+-   Logic handles a valid row placement
+-   Logic handles an invalid row placement
+-   Logic handles a valid column placement
+-   Logic handles an invalid column placement
+-   Logic handles a valid region (3x3 grid) placement
+-   Logic handles an invalid region (3x3 grid) placement
+-   Valid puzzle strings pass the solver
+-   Invalid puzzle strings fail the solver
+-   Solver returns the the expected solution for an incomplete puzzle
+
+Write the following tests in `tests/2_functional-tests.js`
+
+-   Solve a puzzle with valid puzzle string: POST request to `/api/solve`
+-   Solve a puzzle with missing puzzle string: POST request to `/api/solve`
+-   Solve a puzzle with invalid characters: POST request to `/api/solve`
+-   Solve a puzzle with incorrect length: POST request to `/api/solve`
+-   Solve a puzzle that cannot be solved: POST request to `/api/solve`
+-   Check a puzzle placement with all fields: POST request to `/api/check`
+-   Check a puzzle placement with single placement conflict: POST request to `/api/check`
+-   Check a puzzle placement with multiple placement conflicts: POST request to `/api/check`
+-   Check a puzzle placement with all placement conflicts: POST request to `/api/check`
+-   Check a puzzle placement with missing required fields: POST request to `/api/check`
+-   Check a puzzle placement with invalid characters: POST request to `/api/check`
+-   Check a puzzle placement with incorrect length: POST request to `/api/check`
+-   Check a puzzle placement with invalid placement coordinate: POST request to `/api/check`
+-   Check a puzzle placement with invalid placement value: POST request to `/api/check`
+
+# --hints--
+
+You should provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  const url = getUserInput('url');
+  assert(!/.*\/sudoku-solver\.freecodecamp\.rocks/.test(getUserInput('url')));
+};
+```
+
+You can `POST` `/api/solve` with form data containing `puzzle` which will be a string containing a combination of numbers (1-9) and periods `.` to represent empty spaces. The returned object will contain a `solution` property with the solved puzzle.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output =
+    '769235418851496372432178956174569283395842761628713549283657194516924837947381625';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'solution');
+  assert.equal(parsed.solution, output);
+};
+```
+
+If the object submitted to `/api/solve` is missing `puzzle`, the returned value will be `{ error: 'Required field missing' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Required field missing';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ notpuzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` contains values which are not numbers or periods, the returned value will be `{ error: 'Invalid characters in puzzle' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    'AA9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid characters in puzzle';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` is greater or less than 81 characters, the returned value will be `{ error: 'Expected puzzle to be 81 characters long' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Expected puzzle to be 81 characters long';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/solve` is invalid or cannot be solved, the returned value will be `{ error: 'Puzzle cannot be solved' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9.9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Puzzle cannot be solved';
+  const data = await fetch(getUserInput('url') + '/api/solve', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+You can `POST` to `/api/check` an object containing `puzzle`, `coordinate`, and `value` where the `coordinate` is the letter A-I indicating the row, followed by a number 1-9 indicating the column, and `value` is a number from 1-9.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '7';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isTrue(parsed.valid);
+};
+```
+
+The return value from the `POST` to `/api/check` will be an object containing a `valid` property, which is `true` if the number may be placed at the provided coordinate and `false` if the number may not. If false, the returned object will also contain a `conflict` property which is an array containing the strings `"row"`, `"column"`, and/or `"region"` depending on which makes the placement invalid.
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const conflict = ['row', 'column'];
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isFalse(parsed.valid);
+  assert.property(parsed, 'conflict');
+  assert.include(parsed.conflict, 'row');
+  assert.include(parsed.conflict, 'column');
+};
+```
+
+If `value` submitted to `/api/check` is already placed in `puzzle` on that `coordinate`, the returned value will be an object containing a `valid` property with `true` if `value` is not conflicting.
+
+```js
+async (getUserInput) => {
+  const input =
+  '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'C3';
+  const value = '2';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'valid');
+  assert.isTrue(parsed.valid);
+};
+```
+
+If the puzzle submitted to `/api/check` contains values which are not numbers or periods, the returned value will be `{ error: 'Invalid characters in puzzle' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    'AA9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const output = 'Invalid characters in puzzle';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the puzzle submitted to `/api/check` is greater or less than 81 characters, the returned value will be `{ error: 'Expected puzzle to be 81 characters long' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const coordinate = 'A1';
+  const value = '1';
+  const output = 'Expected puzzle to be 81 characters long';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the object submitted to `/api/check` is missing `puzzle`, `coordinate` or `value`, the returned value will be `{ error: Required field(s) missing }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Required field(s) missing';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the coordinate submitted to `api/check` does not point to an existing grid cell, the returned value will be `{ error: 'Invalid coordinate'}`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid coordinate';
+  const coordinate = 'XZ18';
+  const value = '7';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+If the `value` submitted to `/api/check` is not a number between 1 and 9, the returned values will be `{ error: 'Invalid value' }`
+
+```js
+async (getUserInput) => {
+  const input =
+    '..9..5.1.85.4....2432......1...69.83.9.....6.62.71...9......1945....4.37.4.3..6..';
+  const output = 'Invalid value';
+  const coordinate = 'A1';
+  const value = 'X';
+  const data = await fetch(getUserInput('url') + '/api/check', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify({ puzzle: input, coordinate, value })
+  });
+  const parsed = await data.json();
+  assert.property(parsed, 'error');
+  assert.equal(parsed.error, output);
+};
+```
+
+All 12 unit tests are complete and passing. See `/tests/1_unit-tests.js` for the expected behavior you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const units = getTests.filter((el) => el.context.includes('UnitTests'));
+    assert.isAtLeast(units.length, 12, 'At least 12 tests passed');
+    units.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+All 14 functional tests are complete and passing. See `/tests/2_functional-tests.js` for the functionality you should write tests for.
+
+```js
+async (getUserInput) => {
+  try {
+    const getTests = await $.get(getUserInput('url') + '/_api/get-tests');
+    assert.isArray(getTests);
+    const funcs = getTests.filter((el) =>
+      el.context.includes('Functional Tests')
+    );
+    assert.isAtLeast(funcs.length, 14, 'At least 14 tests passed');
+    funcs.forEach((test) => {
+      assert.equal(test.state, 'passed', 'Test in Passed State');
+      assert.isAtLeast(
+        test.assertions.length,
+        1,
+        'At least one assertion per test'
+      );
+    });
+  } catch (err) {
+    throw new Error(err.responseText || err.message);
+  }
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
new file mode 100644
index 0000000000..a1797e50eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/build-your-own-functions.md
@@ -0,0 +1,67 @@
+---
+id: 5e7b9f060b6c005b0e76f05b
+title: Build your own Functions
+challengeType: 11
+videoId: nLDychdBwUg
+dashedName: build-your-own-functions
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=ksvGhDsjtpw)
+
+# --question--
+
+## --text--
+
+What will the following Python program print out?:
+
+```python
+def fred():
+    print("Zap")
+def jane():
+    print("ABC")
+
+jane()
+fred()
+jane()
+```
+
+## --answers--
+
+<pre>Zap
+ABC
+jane
+fred
+jane</pre>
+
+---
+
+<pre>Zap
+ABC
+Zap</pre>
+
+---
+
+<pre>ABC
+Zap
+jane</pre>
+
+---
+
+<pre>ABC
+Zap
+ABC</pre>
+
+---
+
+<pre>Zap
+Zap
+Zap</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
new file mode 100644
index 0000000000..011f26213e
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/comparing-and-sorting-tuples.md
@@ -0,0 +1,57 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06d
+title: Comparing and Sorting Tuples
+challengeType: 11
+videoId: dZXzBXUxxCs
+dashedName: comparing-and-sorting-tuples
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=EhQxwzyT16E)
+
+# --question--
+
+## --text--
+
+Which does the same thing as the following code?:
+
+```python
+lst = []
+for key, val in counts.items():
+    newtup = (val, key)
+    lst.append(newtup)
+lst = sorted(lst, reverse=True)
+print(lst)
+```
+
+## --answers--
+
+```python
+print( sorted( [ (v,k) for k,v in counts.items() ], reverse=True ) )
+```
+
+---
+
+```python
+print( [ (k,v) for k,v in counts.items().sorted() ] )
+```
+
+---
+
+```python
+print( sorted( [ (v,k) for k,v in counts.keys() ] ) )
+```
+
+---
+
+```python
+print( [ (k,v) for k,v in counts.values().sort() ] )
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
new file mode 100644
index 0000000000..2e973cd5f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/conditional-execution.md
@@ -0,0 +1,50 @@
+---
+id: 5e7b9f050b6c005b0e76f058
+title: Conditional Execution
+challengeType: 11
+videoId: gz_IfIsZQtc
+dashedName: conditional-execution
+---
+
+# --question--
+
+## --text--
+
+Which code is indented correctly to print "Yes" if x = 0 and y = 10?
+
+## --answers--
+
+```python
+if 0 == x:
+if y == 10:
+print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+    if y == 10:
+    print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+if y == 10:
+    print("Yes")
+```
+
+---
+
+```python
+if 0 == x:
+    if y == 10:
+        print("Yes")
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
new file mode 100644
index 0000000000..b4030f10ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-mailing-lists.md
@@ -0,0 +1,52 @@
+---
+id: 5e7b9f6a0b6c005b0e76f097
+title: 'Data Visualization: Mailing Lists'
+challengeType: 11
+videoId: RYdW660KkaQ
+dashedName: data-visualization-mailing-lists
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: Geodata](https://www.youtube.com/watch?v=KfhslNzopxo)
+
+\- [Exercise: Gmane Model](https://www.youtube.com/watch?v=wSpl1-7afAk)
+
+\- [Exercise: Gmane Spider](https://www.youtube.com/watch?v=H3w4lOFBUOI)
+
+\- [Exercise: Gmane Viz](https://www.youtube.com/watch?v=LRqVPMEXByw)
+
+\- [Exercise: Page Rank](https://www.youtube.com/watch?v=yFRAZBkBDBs)
+
+\- [Exercise: Page Spider](https://www.youtube.com/watch?v=sXedPQ_AnWA)
+
+\- [Exercise: Page Viz](https://www.youtube.com/watch?v=Fm0hpkxsZoo)
+
+# --question--
+
+## --text--
+
+Which is a common JavaScript visualization library?
+
+## --answers--
+
+DataViz.js
+
+---
+
+D3
+
+---
+
+Lowcharts
+
+---
+
+DATA6
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
new file mode 100644
index 0000000000..fd0b04359a
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/data-visualization-page-rank.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f6a0b6c005b0e76f096
+title: 'Data Visualization: Page Rank'
+challengeType: 11
+videoId: 6-w_qIUwaxU
+dashedName: data-visualization-page-rank
+---
+
+# --question--
+
+## --text--
+
+How does the PageRank algorithm work?
+
+## --answers--
+
+It determines which pages are most highly connected.
+
+---
+
+It ranks pages based on view counts.
+
+---
+
+It figures out which pages contain the most important content.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
new file mode 100644
index 0000000000..e11c4968a0
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-and-loops.md
@@ -0,0 +1,49 @@
+---
+id: 5e7b9f0a0b6c005b0e76f069
+title: Dictionaries and Loops
+challengeType: 11
+videoId: EEmekKiKG70
+dashedName: dictionaries-and-loops
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=PrhZ9qwBDD8)
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+counts = { 'chuck' : 1 , 'annie' : 42, 'jan': 100}
+for key in counts:
+    if counts[key] > 10:
+        print(key, counts[key])
+```
+
+## --answers--
+
+<pre>annie 42
+jan 100</pre>
+
+---
+
+<pre>chuck 1
+annie 42
+jan 100</pre>
+
+---
+
+<pre>chuck 1</pre>
+
+---
+
+<pre>[Error]</pre>
+
+## --video-solution--
+
+1
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
new file mode 100644
index 0000000000..f1f0855d93
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/dictionaries-common-applications.md
@@ -0,0 +1,43 @@
+---
+id: 5e7b9f090b6c005b0e76f068
+title: 'Dictionaries: Common Applications'
+challengeType: 11
+videoId: f17xPfIXct0
+dashedName: dictionaries-common-applications
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```python
+counts = { 'quincy' : 1 , 'mrugesh' : 42, 'beau': 100, '0': 10}
+print(counts.get('kris', 0))
+```
+
+## --answers--
+
+2
+
+---
+
+quincy
+
+---
+
+0
+
+---
+
+10
+
+---
+
+[will return error]
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
new file mode 100644
index 0000000000..dff23f6561
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/files-as-a-sequence.md
@@ -0,0 +1,40 @@
+---
+id: 5e7b9f080b6c005b0e76f063
+title: Files as a Sequence
+challengeType: 11
+videoId: cIA0EokbaHE
+dashedName: files-as-a-sequence
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=il1j4wkte2E)
+
+# --question--
+
+## --text--
+
+What does the word 'continue' do in the middle of a loop?
+
+## --answers--
+
+Skips to the code directly after the loop.
+
+---
+
+Skips to the next line in the code.
+
+---
+
+Skips to the next iteration of the loop.
+
+---
+
+Skips the next block of code.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
new file mode 100644
index 0000000000..06951beb68
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-expressions.md
@@ -0,0 +1,52 @@
+---
+id: 5e7b9f050b6c005b0e76f057
+title: Intermediate Expressions
+challengeType: 11
+videoId: dKgUaIa5ATg
+dashedName: intermediate-expressions
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise 1](https://youtu.be/t_4DPwsaGDY)
+
+\- [Exercise 2](https://youtu.be/wgkC8SxraAQ)
+
+# --question--
+
+## --text--
+
+What will print out after running this code:
+
+```python
+width = 15
+height = 12.0
+print(height/3)
+```
+
+## --answers--
+
+39
+
+---
+
+4
+
+---
+
+4.0
+
+---
+
+5.0
+
+---
+
+5
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
new file mode 100644
index 0000000000..216b951cc5
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/intermediate-strings.md
@@ -0,0 +1,49 @@
+---
+id: 5e7b9f070b6c005b0e76f061
+title: Intermediate Strings
+challengeType: 11
+videoId: KgT_fYLXnyk
+dashedName: intermediate-strings
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=1bSqHot-KwE)
+
+# --question--
+
+## --text--
+
+What is the value of i in the following code?
+
+```python
+word = "bananana"
+i = word.find("na")
+```
+
+## --answers--
+
+nanana
+
+---
+
+2
+
+---
+
+3
+
+---
+
+True
+
+---
+
+na
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
new file mode 100644
index 0000000000..04796a35f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-elements-of-python.md
@@ -0,0 +1,36 @@
+---
+id: 5e6a54c358d3af90110a60a3
+title: 'Introduction: Elements of Python'
+challengeType: 11
+videoId: aRY_xjL35v0
+dashedName: introduction-elements-of-python
+---
+
+# --question--
+
+## --text--
+
+What will the following program print out:
+
+```python
+x = 43
+x = x + 1
+print(x)
+```
+
+## --answers--
+
+x
+
+---
+
+x + 1
+
+---
+
+44
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
new file mode 100644
index 0000000000..02afa120f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-hardware-achitecture.md
@@ -0,0 +1,30 @@
+---
+id: 5e6a54af58d3af90110a60a1
+title: 'Introduction: Hardware Architecture'
+challengeType: 11
+videoId: H6qtjRTfSog
+dashedName: introduction-hardware-architecture
+---
+
+# --question--
+
+## --text--
+
+Where are your programs stored when they are running?
+
+## --answers--
+
+Hard Drive.
+
+---
+
+Memory.
+
+---
+
+Central Processing Unit.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
new file mode 100644
index 0000000000..a9ad7a9e2b
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-python-as-a-language.md
@@ -0,0 +1,39 @@
+---
+id: 5e6a54ba58d3af90110a60a2
+title: 'Introduction: Python as a Language'
+challengeType: 11
+videoId: 0QeGbZNS_bY
+dashedName: introduction-python-as-a-language
+---
+
+# --question--
+
+## --text--
+
+What will print out after running these two lines of code:
+
+```python
+x = 6
+print(x)
+```
+
+## --answers--
+
+x
+
+---
+
+6
+
+---
+
+x = 6
+
+---
+
+(x)
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
new file mode 100644
index 0000000000..f1549dbb07
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/introduction-why-program.md
@@ -0,0 +1,38 @@
+---
+id: 5e6a54a558d3af90110a60a0
+title: 'Introduction: Why Program?'
+challengeType: 11
+videoId: 3muQV-Im3Z0
+dashedName: introduction-why-program
+---
+
+# --description--
+
+More resources:
+
+\- [Install Python on Windows](https://youtu.be/F7mtLrYzZP8)
+
+\- [Install Python on MacOS](https://youtu.be/wfLnZP-4sZw)
+
+# --question--
+
+## --text--
+
+Who should learn to program?
+
+## --answers--
+
+College students.
+
+---
+
+People who want to become software developers.
+
+---
+
+Everyone.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
new file mode 100644
index 0000000000..6438238f03
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-definite-loops.md
@@ -0,0 +1,39 @@
+---
+id: 5e7b9f070b6c005b0e76f05d
+title: 'Iterations: Definite Loops'
+challengeType: 11
+videoId: hiRTRAqNlpE
+dashedName: iterations-definite-loops
+---
+
+# --question--
+
+## --text--
+
+How many lines will the following code print?:
+
+```python
+for i in [2,1,5]:
+    print(i)
+```
+
+## --answers--
+
+1
+
+---
+
+2
+
+---
+
+3
+
+---
+
+5
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
new file mode 100644
index 0000000000..d0f5059a2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-loop-idioms.md
@@ -0,0 +1,45 @@
+---
+id: 5e7b9f070b6c005b0e76f05e
+title: 'Iterations: Loop Idioms'
+challengeType: 11
+videoId: AelGAcoMXbI
+dashedName: iterations-loop-idioms
+---
+
+# --question--
+
+## --text--
+
+Below is code to find the smallest value from a list of values. One line has an error that will cause the code to not work as expected. Which line is it?:
+
+```python
+smallest = None
+print("Before:", smallest)
+for itervar in [3, 41, 12, 9, 74, 15]:
+    if smallest is None or itervar < smallest:
+        smallest = itervar
+        break
+    print("Loop:", itervar, smallest)
+print("Smallest:", smallest)
+```
+
+## --answers--
+
+3
+
+---
+
+4
+
+---
+
+6
+
+---
+
+7
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
new file mode 100644
index 0000000000..829fe70011
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/iterations-more-patterns.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f070b6c005b0e76f05f
+title: 'Iterations: More Patterns'
+challengeType: 11
+videoId: 9Wtqo6vha1M
+dashedName: iterations-more-patterns
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=kjxXZQw0uPg)
+
+# --question--
+
+## --text--
+
+Which of these evaluates to False?
+
+## --answers--
+
+```python
+0 == 0.0
+```
+
+---
+
+```python
+0 is 0.0
+```
+
+---
+
+```python
+0 is not 0.0
+```
+
+---
+
+```python
+0 = 0.0
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
new file mode 100644
index 0000000000..5bf4c6df17
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/loops-and-iterations.md
@@ -0,0 +1,51 @@
+---
+id: 5e7b9f060b6c005b0e76f05c
+title: Loops and Iterations
+challengeType: 11
+videoId: dLA-szNRnUY
+dashedName: loops-and-iterations
+---
+
+# --question--
+
+## --text--
+
+What will the following code print out?:
+
+```python
+n = 0
+while True:
+    if n == 3:
+        break
+    print(n)
+    n = n + 1
+```
+
+## --answers--
+
+<pre>0
+1
+2</pre>
+
+---
+
+<pre>0
+1
+2
+3</pre>
+
+---
+
+<pre>1
+2</pre>
+
+---
+
+<pre>1
+2
+3</pre>
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
new file mode 100644
index 0000000000..36e76238d4
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/make-a-relational-database.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f170b6c005b0e76f08b
+title: Make a Relational Database
+challengeType: 11
+videoId: MQ5z4bdF92U
+dashedName: make-a-relational-database
+---
+
+# --question--
+
+## --text--
+
+What SQL command would you use to retrieve all users that have the email address `quincy@freecodecamp.org`?
+
+## --answers--
+
+```sql
+SELECT Users WHERE email="quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT Users WHERE email IS "quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT ALL Users WHERE email="quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT * FROM Users WHERE email IS "quincy@freecodecamp.org"
+```
+
+---
+
+```sql
+SELECT * FROM Users WHERE email="quincy@freecodecamp.org"
+```
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
new file mode 100644
index 0000000000..135632d2b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/more-conditional-structures.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f060b6c005b0e76f059
+title: More Conditional Structures
+challengeType: 11
+videoId: HdL82tAZR20
+dashedName: more-conditional-structures
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise 1](https://www.youtube.com/watch?v=crLerB4ZxMI)
+
+\- [Exercise 2](https://www.youtube.com/watch?v=KJN3-7HH6yk)
+
+# --question--
+
+## --text--
+
+Given the following code:
+
+```python
+temp = "5 degrees"
+cel = 0
+fahr = float(temp)
+cel = (fahr - 32.0) * 5.0 / 9.0
+print(cel)
+```
+
+Which line/lines should be surrounded by `try` block?
+
+## --answers--
+
+1
+
+---
+
+3
+
+---
+
+3,4
+
+---
+
+4
+
+---
+
+None
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
new file mode 100644
index 0000000000..7196aa02da
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-protocol.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0c0b6c005b0e76f072
+title: Networking Protocol
+challengeType: 11
+videoId: c6vZGescaSc
+dashedName: networking-protocol
+---
+
+# --question--
+
+## --text--
+
+What type of HTTP request is usually used to access a website?
+
+## --answers--
+
+POST
+
+---
+
+GET
+
+---
+
+WEB
+
+---
+
+ACCESS
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
new file mode 100644
index 0000000000..bf0c895949
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-text-processing.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f0c0b6c005b0e76f074
+title: 'Networking: Text Processing'
+challengeType: 11
+videoId: Pv_pJgVu8WI
+dashedName: networking-text-processing
+---
+
+# --question--
+
+## --text--
+
+Which type of encoding do most websites use?
+
+## --answers--
+
+UTF-8
+
+---
+
+UTF-16
+
+---
+
+UTF-32
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
new file mode 100644
index 0000000000..a8f26e7a47
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-using-urllib-in-python.md
@@ -0,0 +1,37 @@
+---
+id: 5e7b9f0d0b6c005b0e76f075
+title: 'Networking: Using urllib in Python'
+challengeType: 11
+videoId: 7lFM1T_CxBs
+dashedName: networking-using-urllib-in-python
+---
+
+# --question--
+
+## --text--
+
+What will the output of the following code be like?:
+
+```python
+import urllib.request
+fhand = urllib.request.urlopen('http://data.pr4e.org/romeo.txt')
+for line in fhand:
+    print(line.decode().strip())
+```
+
+## --answers--
+
+Just contents of "romeo.txt".
+
+---
+
+A header and the contents of "romeo.txt".
+
+---
+
+A header, a footer, and the contents of "romeo.txt".
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
new file mode 100644
index 0000000000..ed31a3848a
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-web-scraping-with-python.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f0d0b6c005b0e76f076
+title: 'Networking: Web Scraping with Python'
+challengeType: 11
+videoId: Uyioq2q4cEg
+dashedName: networking-web-scraping-with-python
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: socket1](https://www.youtube.com/watch?v=dWLdI143W-g)
+
+\- [Exercise: urllib](https://www.youtube.com/watch?v=8yis2DvbBkI)
+
+\- [Exercise: urllinks](https://www.youtube.com/watch?v=g9flPDG9nnY)
+
+# --question--
+
+## --text--
+
+What Python library is used for parsing HTML documents and extracting data from HTML documents?
+
+## --answers--
+
+socket
+
+---
+
+http
+
+---
+
+BeautifulSoup
+
+---
+
+PrettyBiscuit
+
+---
+
+WonderfulSalad
+
+---
+
+HttpParser
+
+---
+
+GrunkleStan
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
new file mode 100644
index 0000000000..b90462a16d
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-with-python.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0c0b6c005b0e76f071
+title: Networking with Python
+challengeType: 11
+videoId: _kJvneKVdNM
+dashedName: networking-with-python
+---
+
+# --question--
+
+## --text--
+
+What Python library gives access to TCP Sockets?
+
+## --answers--
+
+tcp
+
+---
+
+socket
+
+---
+
+http
+
+---
+
+port
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
new file mode 100644
index 0000000000..41fc6959e0
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/networking-write-a-web-browser.md
@@ -0,0 +1,50 @@
+---
+id: 5e7b9f0c0b6c005b0e76f073
+title: 'Networking: Write a Web Browser'
+challengeType: 11
+videoId: zjyT9DaAjx4
+dashedName: networking-write-a-web-browser
+---
+
+# --question--
+
+## --text--
+
+What does the following code create?:
+
+```py
+import socket
+
+mysock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+mysock.connect(('data.pr4e.org', 80))
+cmd = 'GET http://data.pr4e.org/romeo.txt HTTP/1.0\r\n\r\n'.encode()
+mysock.send(cmd)
+
+while True:
+    data = mysock.recv(512)
+    if len(data) < 1:
+        break
+    print(data.decode(),end='')
+mysock.close()
+```
+
+## --answers--
+
+A simple web server.
+
+---
+
+A simple email client.
+
+---
+
+A simple todo list.
+
+---
+
+A simple web browser.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
new file mode 100644
index 0000000000..c85eabd257
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/object-lifecycle.md
@@ -0,0 +1,67 @@
+---
+id: 5e7b9f170b6c005b0e76f087
+title: Object Lifecycle
+challengeType: 11
+videoId: p1r3h_AMMIM
+dashedName: object-lifecycle
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+class PartyAnimal:
+    x = 0
+    name = ''
+    def __init__(self, nam):
+        self.name = nam
+        print(self.name,'constructed')
+    def party(self):
+        self.x = self.x + 1
+        print(self.name,'party count',self.x)
+
+q = PartyAnimal('Quincy')
+m = PartyAnimal('Miya')
+
+q.party()
+m.party()
+q.party()
+```
+
+## --answers--
+
+<pre>
+Quincy constructed
+Miya constructed
+Quincy party count 1
+Miya party count 2
+Quincy party count 3
+</pre>
+
+---
+
+<pre>
+Quincy constructed
+Miya constructed
+Quincy party count 1
+Miya party count 1
+Quincy party count 2
+</pre>
+
+---
+
+<pre>
+Quincy constructed
+Quincy party count 1
+Quincy party count 2
+Miya constructed
+Miya party count 1
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
new file mode 100644
index 0000000000..41d127dc0f
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-a-sample-class.md
@@ -0,0 +1,58 @@
+---
+id: 5e7b9f160b6c005b0e76f086
+title: 'Objects: A Sample Class'
+challengeType: 11
+videoId: FiABKEuaSJ8
+dashedName: objects-a-sample-class
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+class PartyAnimal:
+    x = 0
+    def party(self):
+        self.x = self.x + 2
+        print(self.x)
+
+an = PartyAnimal()
+an.party()
+an.party()
+```
+
+## --answers--
+
+<pre>
+So far 1
+So far 2
+</pre>
+
+---
+
+<pre>
+0
+0
+</pre>
+
+---
+
+<pre>
+2
+2
+</pre>
+
+---
+
+<pre>
+2
+4
+</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
new file mode 100644
index 0000000000..1de3c04012
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/objects-inheritance.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f170b6c005b0e76f088
+title: 'Objects: Inheritance'
+challengeType: 11
+videoId: FBL3alYrxRM
+dashedName: objects-inheritance
+---
+
+# --question--
+
+## --text--
+
+What is inheritance in object-oriented programming?
+
+## --answers--
+
+A new class created when a parent class is extended.
+
+---
+
+A constructed instance of a class.
+
+---
+
+The ability to create a new class by extending an existing class.
+
+---
+
+A method that is called at the moment when a class is being used to construct an object.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
new file mode 100644
index 0000000000..0c86c3bd09
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-dictionaries.md
@@ -0,0 +1,55 @@
+---
+id: 5e7b9f090b6c005b0e76f067
+title: Python Dictionaries
+challengeType: 11
+videoId: dnzvfimrRMg
+dashedName: python-dictionaries
+---
+
+# --question--
+
+## --text--
+
+What does dict equal after running this code?:
+
+```python
+dict = {"Fri": 20, "Thu": 6, "Sat": 1}
+dict["Thu"] = 13
+dict["Sat"] = 2
+dict["Sun"] = 9
+```
+
+## --answers--
+
+```python
+{'Fri': 20, 'Thu': 6, 'Sat': 1}
+```
+
+---
+
+```python
+{'Fri': 20, 'Thu': 6, 'Sat': 1, 'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+---
+
+```python
+{'Sun': 9}
+```
+
+---
+
+```python
+{'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+---
+
+```python
+{'Fri': 20, 'Thu': 13, 'Sat': 2, 'Sun': 9}
+```
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-functions.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-functions.md
new file mode 100644
index 0000000000..2f4bb2bbd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-functions.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f060b6c005b0e76f05a
+title: Python Functions
+challengeType: 11
+videoId: 3JGF-n3tDPU
+dashedName: python-functions
+---
+
+# --question--
+
+## --text--
+
+What is the purpose of the "def" keyword in Python?
+
+## --answers--
+
+It is slang that means "The following code is really cool."
+
+---
+
+It indicates the start of a function.
+
+---
+
+It indicates that the following indented section of code is to be stored for later.
+
+---
+
+It indicates the start of a function, and the following indented section of code is to be stored for later.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-lists.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-lists.md
new file mode 100644
index 0000000000..be78cd10c7
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-lists.md
@@ -0,0 +1,39 @@
+---
+id: 5e7b9f080b6c005b0e76f064
+title: Python Lists
+challengeType: 11
+videoId: Y0cvfDpYC_c
+dashedName: python-lists
+---
+
+# --question--
+
+## --text--
+
+What is the value of x after running this code:
+
+```python
+fruit = "banana"
+x = fruit[1]
+```
+
+## --answers--
+
+banana
+
+---
+
+a
+
+---
+
+b
+
+---
+
+True
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-objects.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-objects.md
new file mode 100644
index 0000000000..6082df58eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/python-objects.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f160b6c005b0e76f085
+title: Python Objects
+challengeType: 11
+videoId: uJxGeTYy0us
+dashedName: python-objects
+---
+
+# --question--
+
+## --text--
+
+Which is NOT true about objects in Python?
+
+## --answers--
+
+Objects get created and used.
+
+---
+
+Objects are bits of code and data.
+
+---
+
+Objects hide detail.
+
+---
+
+Objects are one of the five standard data types.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/reading-files.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/reading-files.md
new file mode 100644
index 0000000000..9be11dc4f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/reading-files.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f080b6c005b0e76f062
+title: Reading Files
+challengeType: 11
+videoId: Fo1tW09KIwo
+dashedName: reading-files
+---
+
+# --question--
+
+## --text--
+
+What is used to indicate a new line in a string?
+
+## --answers--
+
+\\n
+
+---
+
+{new_line}
+
+---
+
+{n}
+
+---
+
+/n
+
+---
+
+/new
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
new file mode 100644
index 0000000000..87a9824144
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-matching-and-extracting-data.md
@@ -0,0 +1,41 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06f
+title: 'Regular Expressions: Matching and Extracting Data'
+challengeType: 11
+videoId: LaCZnTbQGkE
+dashedName: regular-expressions-matching-and-extracting-data
+---
+
+# --question--
+
+## --text--
+
+What will the following program print?:
+
+```python
+import re
+s = 'A message from csev@umich.edu to cwen@iupui.edu about meeting @2PM'
+lst = re.findall('\\S+@\\S+', s)
+print(lst)
+```
+
+## --answers--
+
+['csev@umich.edu', 'cwen@iupui.edu']
+
+---
+
+['csev@umich.edu']
+
+---
+
+['umich.edu', 'iupui.edu']
+
+---
+
+['csev@', 'cwen@']
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
new file mode 100644
index 0000000000..cf1d7b3825
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions-practical-applications.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f0b0b6c005b0e76f070
+title: 'Regular Expressions: Practical Applications'
+challengeType: 11
+videoId: xCjFU9G6x48
+dashedName: regular-expressions-practical-applications
+---
+
+# --question--
+
+## --text--
+
+What will search for a "$" in a regular expression?
+
+## --answers--
+
+$
+
+---
+
+\\dollar\\
+
+---
+
+\\$
+
+---
+
+!$
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
new file mode 100644
index 0000000000..0bff237a4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/regular-expressions.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f0b0b6c005b0e76f06e
+title: Regular Expressions
+challengeType: 11
+videoId: Yud_COr6pZo
+dashedName: regular-expressions
+---
+
+# --question--
+
+## --text--
+
+Which regex matches only a white space character?
+
+## --answers--
+
+\\S
+
+---
+
+\\s
+
+---
+
+.
+
+---
+
+\_
+
+---
+
+\\.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
new file mode 100644
index 0000000000..21f07615fc
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-database-design.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f180b6c005b0e76f08c
+title: Relational Database Design
+challengeType: 11
+videoId: AqdfbrpkbHk
+dashedName: relational-database-design
+---
+
+# --question--
+
+## --text--
+
+What is the best practice for how many times a piece of string data should be stored in a database?
+
+## --answers--
+
+0
+
+---
+
+1
+
+---
+
+2
+
+---
+
+3
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
new file mode 100644
index 0000000000..26732397d0
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-and-sqlite.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f170b6c005b0e76f08a
+title: Relational Databases and SQLite
+challengeType: 11
+videoId: QlNod5-kFpA
+dashedName: relational-databases-and-sqlite
+---
+
+# --question--
+
+## --text--
+
+Which is NOT a primary data structure in a database?
+
+## --answers--
+
+index
+
+---
+
+table
+
+---
+
+row
+
+---
+
+column
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
new file mode 100644
index 0000000000..451e8b5107
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-join-operation.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f180b6c005b0e76f08f
+title: 'Relational Databases: Join Operation'
+challengeType: 11
+videoId: jvDw3D9GKac
+dashedName: relational-databases-join-operation
+---
+
+# --question--
+
+## --text--
+
+When using a JOIN clause in an SQL statement, what does ON do?
+
+## --answers--
+
+It indicates what tables to perform the JOIN on.
+
+---
+
+It specifies the fields to use for the JOIN.
+
+---
+
+It indicates how the two tables are to be joined.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
new file mode 100644
index 0000000000..252eca3a88
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-many-to-many-relationships.md
@@ -0,0 +1,48 @@
+---
+id: 5e7b9f190b6c005b0e76f090
+title: 'Relational Databases: Many-to-many Relationships'
+challengeType: 11
+videoId: z-SBYcvEQOc
+dashedName: relational-databases-many-to-many-relationships
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: Email](https://www.youtube.com/watch?v=uQ3Qv1z_Vao)
+
+\- [Exercise: Roster](https://www.youtube.com/watch?v=qEkUEAz8j3o)
+
+\- [Exercise: Tracks](https://www.youtube.com/watch?v=I-E7avcPeSE)
+
+\- [Exercise: Twfriends](https://www.youtube.com/watch?v=RZRAoBFIH6A)
+
+\- [Exercise: Twspider](https://www.youtube.com/watch?v=xBaJddvJL4A)
+
+# --question--
+
+## --text--
+
+Which is an example of a many-to-many relationship?
+
+## --answers--
+
+teacher to student
+
+---
+
+customer to order
+
+---
+
+book to pages
+
+---
+
+city to country
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
new file mode 100644
index 0000000000..87e0754a62
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/relational-databases-relationship-building.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f180b6c005b0e76f08e
+title: 'Relational Databases: Relationship Building'
+challengeType: 11
+videoId: CSbqczsHVnc
+dashedName: relational-databases-relationship-building
+---
+
+# --question--
+
+## --text--
+
+What does the INSERT command do in SQL?
+
+## --answers--
+
+It defines a new row by listing the fields we want to include followed by the values we want placed in the new row.
+
+---
+
+It defines a new column by listing the rows we want to include followed by the values we want placed in the new column.
+
+---
+
+It defines a new table by listing the rows and fields we want to include followed by the values that we want placed in the table.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
new file mode 100644
index 0000000000..03b88fb678
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/representing-relationships-in-a-relational-database.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f180b6c005b0e76f08d
+title: Representing Relationships in a Relational Database
+challengeType: 11
+videoId: '-orenCNdC2Q'
+dashedName: representing-relationships-in-a-relational-database
+---
+
+# --question--
+
+## --text--
+
+What is a foreign key?
+
+## --answers--
+
+A key that is not supposed to be there.
+
+---
+
+A key that uses non-latin characters.
+
+---
+
+A number that points to the primary key of an associated row in a different table.
+
+---
+
+A key that the "real world" might use to look up a row.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
new file mode 100644
index 0000000000..51ab3b952b
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-and-lists.md
@@ -0,0 +1,47 @@
+---
+id: 5e7b9f090b6c005b0e76f066
+title: Strings and Lists
+challengeType: 11
+videoId: lxcFa7ldCi0
+dashedName: strings-and-lists
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise](https://www.youtube.com/watch?v=-9TfJF2dwHI)
+
+# --question--
+
+## --text--
+
+What does n equal in this code?
+
+```python
+words = 'His e-mail is q-lar@freecodecamp.org'
+pieces = words.split()
+parts = pieces[3].split('-')
+n = parts[1]
+```
+
+## --answers--
+
+mail
+
+---
+
+q
+
+---
+
+lar
+
+---
+
+`lar@freecodecamp.org`
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
new file mode 100644
index 0000000000..2136025df6
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/strings-in-python.md
@@ -0,0 +1,59 @@
+---
+id: 5e7b9f070b6c005b0e76f060
+title: Strings in Python
+challengeType: 11
+videoId: LYZj207fKpQ
+dashedName: strings-in-python
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+for n in "banana":
+    print(n)
+```
+
+## --answers--
+
+<pre>
+n
+n
+</pre>
+
+---
+
+<pre>
+0
+1
+</pre>
+
+---
+
+<pre>
+0
+1
+2
+3
+4
+5
+</pre>
+
+---
+
+<pre>
+b
+a
+n
+a
+n
+a
+</pre>
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
new file mode 100644
index 0000000000..e11e5398ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/the-tuples-collection.md
@@ -0,0 +1,59 @@
+---
+id: 5e7b9f0a0b6c005b0e76f06c
+title: The Tuples Collection
+challengeType: 11
+videoId: 3Lxpladfh2k
+dashedName: the-tuples-collection
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+d = dict()
+d['quincy'] = 1
+d['beau'] = 5
+d['kris'] = 9
+for (k,i) in d.items():
+    print(k, i)
+```
+
+## --answers--
+
+<pre>
+k i
+k i
+k i
+</pre>
+
+---
+
+<pre>
+quincy 0
+beau 1
+kris 2
+</pre>
+
+---
+
+<pre>
+quincy 1
+beau 5
+kris 9
+</pre>
+
+---
+
+<pre>
+1 quincy
+5 beau
+9 kris
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/using-web-services.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
new file mode 100644
index 0000000000..5c2f7814c1
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/using-web-services.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07a
+title: Using Web Services
+challengeType: 11
+videoId: oNl1OVDPGKE
+dashedName: using-web-services
+---
+
+# --question--
+
+## --text--
+
+What are the two most common ways to send data over the internet?
+
+## --answers--
+
+JSON and TXT
+
+---
+
+JSON and XML
+
+---
+
+XML and TXT
+
+---
+
+XML and PHP
+
+---
+
+PHP and TXT
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
new file mode 100644
index 0000000000..50b6caa84b
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/variables-expressions-and-statements.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f050b6c005b0e76f056
+title: 'Variables, Expressions, and Statements'
+challengeType: 11
+videoId: nELR-uyyrok
+dashedName: variables-expressions-and-statements
+---
+
+# --question--
+
+## --text--
+
+What is the symbol used in an assignment statement?
+
+## --answers--
+
+~
+
+---
+
+&
+
+---
+
+=
+
+---
+
+\|
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
new file mode 100644
index 0000000000..c258b56bce
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/visualizing-data-with-python.md
@@ -0,0 +1,38 @@
+---
+id: 5e7b9f690b6c005b0e76f095
+title: Visualizing Data with Python
+challengeType: 11
+videoId: e3lydkH0prw
+dashedName: visualizing-data-with-python
+---
+
+# --question--
+
+## --text--
+
+Most data needs to be \_\_\_\_\_\_ before using it.
+
+## --answers--
+
+converted to JSON format
+
+---
+
+graphed
+
+---
+
+cleaned
+
+---
+
+memorized
+
+---
+
+turned into song
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
new file mode 100644
index 0000000000..992602d0c6
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-api-rate-limiting-and-security.md
@@ -0,0 +1,46 @@
+---
+id: 5e7b9f150b6c005b0e76f080
+title: 'Web Services: API Rate Limiting and Security'
+challengeType: 11
+videoId: pI-g0lI8ngs
+dashedName: web-services-api-rate-limiting-and-security
+---
+
+# --description--
+
+More resources:
+
+\- [Exercise: GeoJSON](https://www.youtube.com/watch?v=TJGJN0T8tak)
+
+\- [Exercise: JSON](https://www.youtube.com/watch?v=vTmw5RtfGMY)
+
+\- [Exercise: Twitter](https://www.youtube.com/watch?v=2c7YwhvpCro)
+
+\- [Exercise: XML](https://www.youtube.com/watch?v=AopYOlDa-vY)
+
+# --question--
+
+## --text--
+
+When making a request from the Twitter API, what information must always be sent with the request?
+
+## --answers--
+
+Twitter username
+
+---
+
+date range
+
+---
+
+search term
+
+---
+
+key
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
new file mode 100644
index 0000000000..285380bd7b
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-apis.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f150b6c005b0e76f07f
+title: 'Web Services: APIs'
+challengeType: 11
+videoId: oUNn1psfBJg
+dashedName: web-services-apis
+---
+
+# --question--
+
+## --text--
+
+What does API stand for?
+
+## --answers--
+
+Application Portable Intelligence
+
+---
+
+Associate Programming International
+
+---
+
+Application Program Interface
+
+---
+
+Action Portable Interface
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-json.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
new file mode 100644
index 0000000000..336373054c
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-json.md
@@ -0,0 +1,56 @@
+---
+id: 5e7b9f140b6c005b0e76f07d
+title: 'Web Services: JSON'
+challengeType: 11
+videoId: ZJE-U56BppM
+dashedName: web-services-json
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?:
+
+```python
+import json
+data = '''
+  [
+    { "id" : "001",
+      "x" : "2",
+     "name" : "Quincy"
+    } ,
+    { "id" : "009",
+      "x" : "7",
+      "name" : "Mrugesh"
+    }
+  ]
+'''
+info = json.loads(data)
+print(info[1]['name'])
+```
+
+## --answers--
+
+Quincy
+
+---
+
+Mrugesh
+
+---
+
+001
+
+---
+
+009
+
+---
+
+[Error]
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
new file mode 100644
index 0000000000..614f5336a3
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-service-oriented-approach.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f140b6c005b0e76f07e
+title: 'Web Services: Service Oriented Approach'
+challengeType: 11
+videoId: muerlsCHExI
+dashedName: web-services-service-oriented-approach
+---
+
+# --question--
+
+## --text--
+
+With a services oriented approach to developing web apps, where is the data located?
+
+## --answers--
+
+Spread across many computer systems connected via the internet or internal network.
+
+---
+
+Within different services on the main web server.
+
+---
+
+On a separate database server.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
new file mode 100644
index 0000000000..8ccc87accb
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml-schema.md
@@ -0,0 +1,30 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07c
+title: 'Web Services: XML Schema'
+challengeType: 11
+videoId: yWU9kTxW-nc
+dashedName: web-services-xml-schema
+---
+
+# --question--
+
+## --text--
+
+What is XSD?
+
+## --answers--
+
+The W3C Schema specification for XML.
+
+---
+
+The standard JSON schema from MOZ.
+
+---
+
+Extensible Situational Driver
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
new file mode 100644
index 0000000000..efda106867
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/web-services-xml.md
@@ -0,0 +1,43 @@
+---
+id: 5e7b9f0e0b6c005b0e76f07b
+title: 'Web Services: XML'
+challengeType: 11
+videoId: _pZ0srbg7So
+dashedName: web-services-xml
+---
+
+# --question--
+
+## --text--
+
+What is wrong with the following XML?:
+
+```xml
+<person>
+  <name>Chuck</name>
+  <phone type="intl">
+    +1 734 303 4456
+  <email hide="yes" />
+</person>
+```
+
+## --answers--
+
+Email tag is missing closing tag.
+
+---
+
+Spacing will cause XML to be invalid.
+
+---
+
+Phone tag is missing closing tag.
+
+---
+
+Plain text should be encoded using UTF-8.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
new file mode 100644
index 0000000000..dbeda928ee
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/python-for-everybody/working-with-lists.md
@@ -0,0 +1,34 @@
+---
+id: 5e7b9f090b6c005b0e76f065
+title: Working with Lists
+challengeType: 11
+videoId: lCnHfTHkhbE
+dashedName: working-with-lists
+---
+
+# --question--
+
+## --text--
+
+Which method is used to add an item at the end of a list?
+
+## --answers--
+
+insert
+
+---
+
+push
+
+---
+
+append
+
+---
+
+new
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
new file mode 100644
index 0000000000..adf4f36e7c
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/arithmetic-formatter.md
@@ -0,0 +1,44 @@
+---
+id: 5e44412c903586ffb414c94c
+title: Arithmetic Formatter
+challengeType: 10
+forumTopicId: 462359
+dashedName: arithmetic-formatter
+---
+
+# --description--
+
+Create a function that receives a list of strings that are arithmetic problems and returns the problems arranged vertically and side-by-side.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-arithmetic-formatter).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+<ul>
+
+# --hints--
+
+It should correctly format an arithmetic problem and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
new file mode 100644
index 0000000000..de8c1f893b
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/budget-app.md
@@ -0,0 +1,44 @@
+---
+id: 5e44413e903586ffb414c94e
+title: Budget App
+challengeType: 10
+forumTopicId: 462361
+dashedName: budget-app
+---
+
+# --description--
+
+Create a "Category" class that can be used to create different budget categories.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-budget-app).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should create a Category class and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
new file mode 100644
index 0000000000..8c7067f044
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/polygon-area-calculator.md
@@ -0,0 +1,44 @@
+---
+id: 5e444147903586ffb414c94f
+title: Polygon Area Calculator
+challengeType: 10
+forumTopicId: 462363
+dashedName: polygon-area-calculator
+---
+
+# --description--
+
+In this project you will use object oriented programming to create a Rectangle class and a Square class. The Square class should be a subclass of Rectangle and inherit methods and attributes.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-polygon-area-calculator).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should create a Rectangle class and Square class and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
new file mode 100644
index 0000000000..b89b308ffd
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/probability-calculator.md
@@ -0,0 +1,42 @@
+---
+id: 5e44414f903586ffb414c950
+title: Probability Calculator
+challengeType: 10
+forumTopicId: 462364
+dashedName: probability-calculator
+---
+
+# --description--
+
+Write a program to determine the approximate probability of drawing certain balls randomly from a hat.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-probability-calculator). After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should correctly calculate probabilities and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
new file mode 100644
index 0000000000..1f6e988b81
--- /dev/null
+++ b/curriculum/challenges/portuguese/07-scientific-computing-with-python/scientific-computing-with-python-projects/time-calculator.md
@@ -0,0 +1,42 @@
+---
+id: 5e444136903586ffb414c94d
+title: Time Calculator
+challengeType: 10
+forumTopicId: 462360
+dashedName: time-calculator
+---
+
+# --description--
+
+Write a function named "add_time" that can add a duration to a start time and return the result.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-time-calculator). After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you everything you need to know to complete this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should correctly add times and pass all tests.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
new file mode 100644
index 0000000000..9a24560aa9
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-a.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c14d
+title: Data Analysis Example A
+challengeType: 11
+videoId: nVAaxZ34khk
+dashedName: data-analysis-example-a
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/FreeCodeCamp-Pandas-Real-Life-Example)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What does the shape of our dataframe tell us?
+
+## --answers--
+
+The size in gigabytes the dataframe we loaded into memory is.
+
+---
+
+How many rows and columns our dataframe has.
+
+---
+
+How many rows the source data had before loading.
+
+---
+
+How many columns the source data had before loading.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
new file mode 100644
index 0000000000..67f603c129
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-analysis-example-b.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14e
+title: Data Analysis Example B
+challengeType: 11
+videoId: 0kJz0q0pvgQ
+dashedName: data-analysis-example-b
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/FreeCodeCamp-Pandas-Real-Life-Example)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What does the `loc` method allow you to do?
+
+## --answers--
+
+Retrieve a subset of rows and columns by supplying integer-location arguments.
+
+---
+
+Access a group of rows and columns by supplying label(s) arguments.
+
+---
+
+Returns the first `n` rows based on the integer argument supplied.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
new file mode 100644
index 0000000000..13cd90fb08
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-and-visualizations.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c160
+title: Data Cleaning and Visualizations
+challengeType: 11
+videoId: mHjxzFS5_Z0
+dashedName: data-cleaning-and-visualizations
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+When using Matplotlib's global API, what does the order of numbers mean here?
+
+```py
+plt.subplot(1, 2, 1)
+```
+
+## --answers--
+
+My figure will have one column, two rows, and I am going to start drawing in the first (left) plot.
+
+---
+
+I am going to start drawing in the first (left) plot, my figure will have two rows, and my figure will have one column.
+
+---
+
+My figure will have one row, two columns, and I am going to start drawing in the first (left) plot.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
new file mode 100644
index 0000000000..cf159cead1
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-duplicates.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c15f
+title: Data Cleaning Duplicates
+challengeType: 11
+videoId: kj7QqjXhH6A
+dashedName: data-cleaning-duplicates
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+The Python method `.duplicated()` returns a boolean Series for your DataFrame. `True` is the return value for rows that:
+
+## --answers--
+
+contain a duplicate, where the value for the row contains the first occurrence of that value.
+
+---
+
+contain a duplicate, where the value for the row is at least the second occurrence of that value.
+
+---
+
+contain a duplicate, where the value for the row contains either the first or second occurrence.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
new file mode 100644
index 0000000000..575be65eef
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-introduction.md
@@ -0,0 +1,58 @@
+---
+id: 5e9a093a74c4063ca6f7c15d
+title: Data Cleaning Introduction
+challengeType: 11
+videoId: ovYNhnltVxY
+dashedName: data-cleaning-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+import numpy as np
+
+s = pd.Series(['a', 3, np.nan, 1, np.nan])
+
+print(s.notnull().sum())
+```
+
+## --answers--
+
+3
+
+---
+
+<pre>0     True
+1     True
+2    False
+3     True
+4    False
+dtype: bool</pre>
+
+---
+
+<pre>0    False
+1    False
+2     True
+3    False
+4     True
+dtype: bool</pre>
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
new file mode 100644
index 0000000000..887af41702
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/data-cleaning-with-dataframes.md
@@ -0,0 +1,70 @@
+---
+id: 5e9a093a74c4063ca6f7c15e
+title: Data Cleaning with DataFrames
+challengeType: 11
+videoId: sTMN_pdI6S0
+dashedName: data-cleaning-with-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/data-cleaning-rmotr-freecodecamp)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+import numpy as np
+
+s = pd.Series([np.nan, 1, 2, np.nan, 3])
+s = s.fillna(method='ffill')
+
+print(s)
+```
+
+## --answers--
+
+<pre>
+0    1.0
+1    1.0
+2    2.0
+3    3.0
+4    3.0
+dtype: float64
+</pre>
+
+---
+
+<pre>
+0    NaN
+1    1.0
+2    2.0
+3    2.0
+4    3.0
+dtype: float64
+</pre>
+
+---
+
+<pre>
+0    NaN
+1    1.0
+2    2.0
+3    NaN
+4    3.0
+dtype: float64
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
new file mode 100644
index 0000000000..1dd69ee8d9
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/how-to-use-jupyter-notebooks-intro.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14f
+title: How to use Jupyter Notebooks Intro
+challengeType: 11
+videoId: h8caJq2Bb9w
+dashedName: how-to-use-jupyter-notebooks-intro
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is **not** allowed in a Jupyter Notebook's cell?
+
+## --answers--
+
+Markdown
+
+---
+
+Python code
+
+---
+
+An Excel sheet
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
new file mode 100644
index 0000000000..a907b1568d
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/introduction-to-data-analysis.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c14c
+title: Introduction to Data Analysis
+challengeType: 11
+videoId: VJrP2FUzKP0
+dashedName: introduction-to-data-analysis
+---
+
+# --description--
+
+More resources:
+
+\- [Slides](https://docs.google.com/presentation/d/1cUIt8b2ySz-85_ykfeuuWsurccwTAuFPn782pZBzFsU/edit?usp=sharing)
+
+# --question--
+
+## --text--
+
+Which of the following is **not** part of Data Analysis?
+
+## --answers--
+
+Building statistical models and data visualizations.
+
+---
+
+Picking a desired conclusion for the analysis.
+
+---
+
+Fixing incorrect values and removing invalid data.
+
+---
+
+Transforming data into an appropriate data structure.
+
+## --video-solution--
+
+2
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
new file mode 100644
index 0000000000..b886303b16
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-cells.md
@@ -0,0 +1,38 @@
+---
+id: 5e9a093a74c4063ca6f7c150
+title: Jupyter Notebooks Cells
+challengeType: 11
+videoId: 5PPegAs9aLA
+dashedName: jupyter-notebooks-cells
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What are the three main types of Jupyter Notebook Cell?
+
+## --answers--
+
+Code, Markdown, and Python
+
+---
+
+Code, Markdown, and Raw
+
+---
+
+Markdown, Python, and Raw
+
+## --video-solution--
+
+2
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
new file mode 100644
index 0000000000..7bc910fcc4
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/jupyter-notebooks-importing-and-exporting-data.md
@@ -0,0 +1,47 @@
+---
+id: 5e9a093a74c4063ca6f7c151
+title: Jupyter Notebooks Importing and Exporting Data
+challengeType: 11
+videoId: k1msxD3JIxE
+dashedName: jupyter-notebooks-importing-and-exporting-data
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-interactive-jupyterlab-tutorial)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What kind of data can you import and work with in a Jupyter Notebook?
+
+## --answers--
+
+Excel files.
+
+---
+
+CSV files.
+
+---
+
+XML files.
+
+---
+
+Data from an API.
+
+---
+
+All of the above.
+
+## --video-solution--
+
+5
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
new file mode 100644
index 0000000000..454f7c5646
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-algebra-and-size.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c157
+title: Numpy Algebra and Size
+challengeType: 11
+videoId: XAT97YLOKD8
+dashedName: numpy-algebra-and-size
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the relationship between size of objects (such as lists and datatypes) in memory in Python's standard library and the NumPy library? Knowing this, what are the implications for performance?
+
+## --answers--
+
+Standard Python objects take up much more memory to store than NumPy objects; operations on comparable standard Python and NumPy objects complete in roughly the same time.
+
+---
+
+NumPy objects take up much more memory than standard Python objects; operations on NumPy objects complete very quickly compared to comparable objects in standard Python.
+
+---
+
+NumPy objects take up much less memory than Standard Python objects; operations on Standard Python objects complete very quickly compared to comparable objects on NumPy Object.
+
+---
+
+Standard Python objects take up more memory than NumPy objects; operations on NumPy objects complete very quickly compared to comparable objects in standard Python.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
new file mode 100644
index 0000000000..b5504e836e
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-arrays.md
@@ -0,0 +1,59 @@
+---
+id: 5e9a093a74c4063ca6f7c154
+title: Numpy Arrays
+challengeType: 11
+videoId: VDYVFHBL1AM
+dashedName: numpy-arrays
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+A = np.array([
+    ['a', 'b', 'c'],
+    ['d', 'e', 'f'],
+    ['g', 'h', 'i']
+])
+
+print(A[:, :2])
+```
+
+## --answers--
+
+```py
+[['a' 'b']]
+```
+
+---
+
+```py
+[['b' 'c']
+['e' 'f']
+['h' 'i']]
+```
+
+---
+
+```py
+[['a' 'b']
+['d' 'e']
+['g' 'h']]
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
new file mode 100644
index 0000000000..f271dff4b0
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-boolean-arrays.md
@@ -0,0 +1,57 @@
+---
+id: 5e9a093a74c4063ca6f7c156
+title: Numpy Boolean Arrays
+challengeType: 11
+videoId: N1ttsMmcVMM
+dashedName: numpy-boolean-arrays
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+a = np.arange(5)
+
+print(a <= 3)
+```
+
+## --answers--
+
+```python
+[False, False, False, False, True]
+```
+
+---
+
+```python
+[5]
+```
+
+---
+
+```python
+[0, 1, 2, 3]
+```
+
+---
+
+```python
+[True, True, True, True, False]
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
new file mode 100644
index 0000000000..fc38697f40
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-a.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c152
+title: Numpy Introduction A
+challengeType: 11
+videoId: P-JjV6GBCmk
+dashedName: numpy-introduction-a
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+Why is Numpy an important, but unpopular Python library?
+
+## --answers--
+
+Often you won't work directly with Numpy.
+
+---
+
+It is extremely slow.
+
+---
+
+Working with Numpy is difficult.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
new file mode 100644
index 0000000000..a863e42074
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-introduction-b.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c153
+title: Numpy Introduction B
+challengeType: 11
+videoId: YIqgrNLAZkA
+dashedName: numpy-introduction-b
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+About how much memory does the integer `5` consume in plain Python?
+
+## --answers--
+
+32 bits
+
+---
+
+20 bytes
+
+---
+
+16 bytes
+
+---
+
+8 bits
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
new file mode 100644
index 0000000000..0072c84019
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/numpy-operations.md
@@ -0,0 +1,50 @@
+---
+id: 5e9a093a74c4063ca6f7c155
+title: Numpy Operations
+challengeType: 11
+videoId: eqSVcJbaPdk
+dashedName: numpy-operations
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-numpy)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the value of `a` after you run the following code?
+
+```py
+a = np.arange(5)
+a + 20
+```
+
+## --answers--
+
+```python
+[20, 21, 22, 24, 24]
+```
+
+---
+
+```python
+[0, 1, 2, 3, 4]
+```
+
+---
+
+```python
+[25, 26, 27, 28, 29]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
new file mode 100644
index 0000000000..3d17a73a55
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-conditional-selection-and-modifying-dataframes.md
@@ -0,0 +1,73 @@
+---
+id: 5e9a093a74c4063ca6f7c15b
+title: Pandas Conditional Selection and Modifying DataFrames
+challengeType: 11
+videoId: BFlH0fN5xRQ
+dashedName: pandas-conditional-selection-and-modifying-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.DataFrame({
+    'Certificates': [8, 2, 5, 6],
+    'Time (in months)': [16, 5, 9, 12]
+})
+names = ['Tom', 'Kris', 'Ahmad', 'Beau']
+
+certificates_earned.index = names
+longest_streak = pd.Series([13, 11, 9, 7], index=names)
+certificates_earned['Longest streak'] = longest_streak
+
+print(certificates_earned)
+```
+
+## --answers--
+
+<pre>
+Tom      13
+Kris     11
+Ahmad     9
+Beau      7
+Name: Longest streak, dtype: int64
+</pre>
+
+---
+
+<pre>
+      Certificates  Time (in months)  Longest streak
+Tom               8                16              13
+Kris              2                 5              11
+Ahmad             5                 9               9
+Beau              6                12               7
+</pre>
+
+---
+
+<pre>
+      Certificates   Longest streak
+Tom               8               13
+Kris              2               11
+Ahmad             5                9
+Beau              6                7
+</pre>
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
new file mode 100644
index 0000000000..7d20f76c4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-creating-columns.md
@@ -0,0 +1,58 @@
+---
+id: 5e9a093a74c4063ca6f7c15c
+title: Pandas Creating Columns
+challengeType: 11
+videoId: _sSo2XZoB3E
+dashedName: pandas-creating-columns
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What code would add a "Certificates per month" column to the `certificates_earned` DataFrame like the one below?
+
+<pre>      Certificates  Time (in months)  Certificates per month
+Tom               8                16                    0.50
+Kris              2                 5                    0.40
+Ahmad             5                 9                    0.56
+Beau              6                12                    0.50</pre>
+
+## --answers--
+
+```py
+certificates_earned['Certificates'] /
+certificates_earned['Time (in months)']
+```
+
+---
+
+```py
+certificates_earned['Certificates per month'] = round(
+    certificates_earned['Certificates'] /
+    certificates_earned['Time (in months)']
+)
+```
+
+---
+
+```py
+certificates_earned['Certificates per month'] = round(
+    certificates_earned['Certificates'] /
+    certificates_earned['Time (in months)'], 2
+)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
new file mode 100644
index 0000000000..fd5eedb176
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-dataframes.md
@@ -0,0 +1,66 @@
+---
+id: 5e9a093a74c4063ca6f7c15a
+title: Pandas DataFrames
+challengeType: 11
+videoId: 7SgFBYXaiH0
+dashedName: pandas-dataframes
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.DataFrame({
+    'Certificates': [8, 2, 5, 6],
+    'Time (in months)': [16, 5, 9, 12]
+})
+
+certificates_earned.index = ['Tom', 'Kris', 'Ahmad', 'Beau']
+
+print(certificates_earned.iloc[2])
+```
+
+## --answers--
+
+<pre>
+Tom      16
+Kris      5
+Ahmad     9
+Beau     12
+Name: Time (in months), dtype: int64
+</pre>
+
+---
+
+<pre>
+Certificates         6
+Time (in months)    12
+Name: Beau, dtype: int64
+</pre>
+
+---
+
+<pre>
+Certificates        5
+Time (in months)    9
+Name: Ahmad, dtype: int64
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
new file mode 100644
index 0000000000..1107f217f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-indexing-and-conditional-selection.md
@@ -0,0 +1,65 @@
+---
+id: 5e9a093a74c4063ca6f7c159
+title: Pandas Indexing and Conditional Selection
+challengeType: 11
+videoId: '-ZOrgV_aA9A'
+dashedName: pandas-indexing-and-conditional-selection
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.Series(
+    [8, 2, 5, 6],
+    index=['Tom', 'Kris', 'Ahmad', 'Beau']
+)
+
+print(certificates_earned[certificates_earned > 5])
+```
+
+## --answers--
+
+<pre>
+Tom      True
+Kris     False
+Ahmad    False
+Beau     True
+dtype: int64
+</pre>
+
+---
+
+<pre>
+Tom      8
+Ahmad    5
+Beau     6
+dtype: int64
+</pre>
+
+---
+
+<pre>
+Tom      8
+Beau     6
+dtype: int64
+</pre>
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
new file mode 100644
index 0000000000..45a30bc050
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/pandas-introduction.md
@@ -0,0 +1,68 @@
+---
+id: 5e9a093a74c4063ca6f7c158
+title: Pandas Introduction
+challengeType: 11
+videoId: 0xACW-8cZU0
+dashedName: pandas-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/freecodecamp-intro-to-pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What will the following code print out?
+
+```py
+import pandas as pd
+
+certificates_earned = pd.Series(
+    [8, 2, 5, 6],
+    index=['Tom', 'Kris', 'Ahmad', 'Beau']
+)
+
+print(certificates_earned)
+```
+
+## --answers--
+
+```
+Tom      8
+Kris     2
+Ahmad    5
+Beau     6
+dtype: int64
+```
+
+---
+
+```
+Kris     2
+Ahmad    5
+Beau     6
+Tom      8
+dtype: int64
+```
+
+---
+
+```
+Tom      8
+Kris     2
+Ahmad    5
+Beau     6
+Name: certificates_earned dtype: int64
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
new file mode 100644
index 0000000000..284a5eabab
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/parsing-html-and-saving-data.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c164
+title: Parsing HTML and Saving Data
+challengeType: 11
+videoId: bJaqnTWQmb0
+dashedName: parsing-html-and-saving-data
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What Python library has the `.read_html()` method we can we use for parsing HTML documents and extracting tables?
+
+## --answers--
+
+BeautifierSoupy
+
+---
+
+WebReader
+
+---
+
+HTTP-master
+
+---
+
+Pandas
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
new file mode 100644
index 0000000000..75a9a71e77
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-functions-and-collections.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c166
+title: Python Functions and Collections
+challengeType: 11
+videoId: NzpU17ZVlUw
+dashedName: python-functions-and-collections
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What is the main difference between lists and tuples in Python?
+
+## --answers--
+
+Tuples are immutable.
+
+---
+
+Lists are ordered.
+
+---
+
+Tuples are unordered.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
new file mode 100644
index 0000000000..f67c83c389
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-introduction.md
@@ -0,0 +1,43 @@
+---
+id: 5e9a093a74c4063ca6f7c165
+title: Python Introduction
+challengeType: 11
+videoId: PrQV9JkLhb4
+dashedName: python-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How do we define blocks of code in the body of functions in Python?
+
+## --answers--
+
+We use a set of curly braces, one on either side of each new block of our code.
+
+---
+
+We use indentation, usually right-aligned 4 spaces.
+
+---
+
+We do not denote blocks of code.
+
+---
+
+We could use curly braces or indentation to denote blocks of code.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
new file mode 100644
index 0000000000..4d4350768f
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/python-iteration-and-modules.md
@@ -0,0 +1,56 @@
+---
+id: 5e9a093a74c4063ca6f7c167
+title: Python Iteration and Modules
+challengeType: 11
+videoId: XzosGWLafrY
+dashedName: python-iteration-and-modules
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/ds-content-python-under-10-minutes)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How would you iterate over and print the keys and values of a dictionary named `user`?
+
+## --answers--
+
+```python
+for key in user.items():
+    print(key)
+```
+
+---
+
+```python
+for key, value in user.all():
+    print(key, value)
+    print(value)
+```
+
+---
+
+```python
+for key, value in user.items():
+    print(key, value)
+```
+
+---
+
+```python
+for key, value in user
+    print(key, value)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
new file mode 100644
index 0000000000..18d6487a0a
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-csv-and-txt.md
@@ -0,0 +1,55 @@
+---
+id: 5e9a093a74c4063ca6f7c162
+title: Reading Data CSV and TXT
+challengeType: 11
+videoId: ViGEv0zOzUk
+dashedName: reading-data-csv-and-txt
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+How would you import the CSV file `data.csv` and store it in a DataFrame using the Pandas module?
+
+## --answers--
+
+```python
+import pandas as pd
+df = pd.csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+df = pd.read_csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+pd.read_csv("data.csv")
+```
+
+---
+
+```python
+import pandas as pd
+df = pd.csv_reader("data.csv")
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
new file mode 100644
index 0000000000..5502a07e7a
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-from-databases.md
@@ -0,0 +1,39 @@
+---
+id: 5e9a093a74c4063ca6f7c163
+title: Reading Data from Databases
+challengeType: 11
+videoId: MtgXS1MofRw
+dashedName: reading-data-from-databases
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+What method does a `Cursor` instance have and what does it allow?
+
+## --answers--
+
+The `Cursor` instance has a `.run()` method which allows you to run SQL queries.
+
+---
+
+The `Cursor` instance has a `.select()` method which allows you to select records.
+
+---
+
+The `Cursor` instance has an `.execute()` method which will receive SQL parameters to run against the database.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
new file mode 100644
index 0000000000..a16b2d0176
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-course/reading-data-introduction.md
@@ -0,0 +1,72 @@
+---
+id: 5e9a093a74c4063ca6f7c161
+title: Reading Data Introduction
+challengeType: 11
+videoId: cDnt02BcHng
+dashedName: reading-data-introduction
+---
+
+# --description--
+
+*Instead of using notebooks.ai like it shows in the video, you can use Google Colab instead.*
+
+More resources:
+
+-   [Notebooks on GitHub](https://github.com/ine-rmotr-curriculum/RDP-Reading-Data-with-Python-and-Pandas)
+-   [How to open Notebooks from GitHub using Google Colab.](https://colab.research.google.com/github/googlecolab/colabtools/blob/master/notebooks/colab-github-demo.ipynb)
+
+# --question--
+
+## --text--
+
+Given a file named `certificates.csv` with these contents:
+
+<pre>
+Name$Certificates$Time (in months)
+Tom$8$16
+Kris$2$5
+Ahmad$5$9
+Beau$6$12
+</pre>
+
+Fill in the blanks for the missing arguments below:
+
+```py
+import csv
+
+with open(__A__, 'r') as fp:
+    reader = csv.reader(fp, delimiter=__B__)
+    next(reader)
+    for index, values in enumerate(reader):
+        name, certs_num, months_num = values
+        print(f"{name} earned {__C__} certificates in {months_num} months")
+```
+
+## --answers--
+
+A: `'certificates.csv'`
+
+B: `'-'`
+
+C: `values`
+
+---
+
+A: `'certificates.csv'`
+
+B: `'$'`
+
+C: `certs_num`
+
+---
+
+A: `'certificates'`
+
+B: `'$'`
+
+C: `certs_num`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
new file mode 100644
index 0000000000..135049889c
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/demographic-data-analyzer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7e5ac417301a38fb929
+title: Demographic Data Analyzer
+challengeType: 10
+forumTopicId: 462367
+dashedName: demographic-data-analyzer
+---
+
+# --description--
+
+In this challenge you must analyze demographic data using Pandas. You are given a dataset of demographic data that was extracted from the 1994 Census database.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-demographic-data-analyzer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
new file mode 100644
index 0000000000..c1e596625d
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/mean-variance-standard-deviation-calculator.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7e5ac417301a38fb928
+title: Mean-Variance-Standard Deviation Calculator
+challengeType: 10
+forumTopicId: 462366
+dashedName: mean-variance-standard-deviation-calculator
+---
+
+# --description--
+
+Create a function that uses Numpy to output the mean, variance, and standard deviation of the rows, columns, and elements in a 3 x 3 matrix.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-mean-variance-standard-deviation-calculator).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
new file mode 100644
index 0000000000..d8ef3d60c9
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/medical-data-visualizer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f7f8ac417301a38fb92a
+title: Medical Data Visualizer
+challengeType: 10
+forumTopicId: 462368
+dashedName: medical-data-visualizer
+---
+
+# --description--
+
+In this project, you will visualize and make calculations from medical examination data using matplotlib, seaborn, and pandas.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-medical-data-visualizer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
new file mode 100644
index 0000000000..f0501c882b
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/page-view-time-series-visualizer.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f802ac417301a38fb92b
+title: Page View Time Series Visualizer
+challengeType: 10
+forumTopicId: 462369
+dashedName: page-view-time-series-visualizer
+---
+
+# --description--
+
+For this project you will visualize time series data using a line chart, bar chart, and box plots. You will use Pandas, matplotlib, and seaborn to visualize a dataset containing the number of page views each day on the freeCodeCamp.org forum from 2016-05-09 to 2019-12-03. The data visualizations will help you understand the patterns in visits and identify yearly and monthly growth.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-page-view-time-series-visualizer).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
new file mode 100644
index 0000000000..a708eedae1
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/data-analysis-with-python-projects/sea-level-predictor.md
@@ -0,0 +1,33 @@
+---
+id: 5e4f5c4b570f7e3a4949899f
+title: Sea Level Predictor
+challengeType: 10
+forumTopicId: 462370
+dashedName: sea-level-predictor
+---
+
+# --description--
+
+In this project, you will analyze a dataset of the global average sea level change since 1880. You will use the data to predict the sea level change through year 2050.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-sea-level-predictor).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the data analysis with Python curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
new file mode 100644
index 0000000000..3c833be5ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/accessing-and-changing-elements,-rows,-columns.md
@@ -0,0 +1,50 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed4
+title: 'Accessing and Changing Elements, Rows, Columns'
+challengeType: 11
+videoId: v-7Y7koJ_N0
+dashedName: accessing-and-changing-elements-rows-columns
+---
+
+# --question--
+
+## --text--
+
+What code would change the values in the 3rd column of both of the following Numpy arrays to 20?
+
+```py
+a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
+
+# Output:
+# [[ 1  2  20  4  5]
+# [ 6  7 20  9 10]]
+```
+
+## --answers--
+
+```python
+a[:, 3] = 20
+```
+
+---
+
+```python
+a[2, :] = 20
+```
+
+---
+
+```python
+a[:, 2] = 20
+```
+
+---
+
+```python
+a[1, 2] = 20
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/basics-of-numpy.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/basics-of-numpy.md
new file mode 100644
index 0000000000..57b1924af7
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/basics-of-numpy.md
@@ -0,0 +1,45 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed3
+title: Basics of Numpy
+challengeType: 11
+videoId: f9QrZrKQMLI
+dashedName: basics-of-numpy
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```python
+b = np.array([[1.0,2.0,3.0],[3.0,4.0,5.0]])
+print(b)
+```
+
+## --answers--
+
+```python
+[[1.0 2.0 3.0]
+[3.0 4.0 5.0]]
+```
+
+---
+
+```python
+[[1. 2. 3.]
+[3. 4. 5.]]
+```
+
+---
+
+```python
+[[1. 3.]
+[2. 4.]
+[3. 5.]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/copying-arrays-warning.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/copying-arrays-warning.md
new file mode 100644
index 0000000000..afe7b8d83e
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/copying-arrays-warning.md
@@ -0,0 +1,44 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed7
+title: Copying Arrays Warning
+challengeType: 11
+videoId: iIoQ0_L0GvA
+dashedName: copying-arrays-warning
+---
+
+# --question--
+
+## --text--
+
+What is the value of `a` after running the following code?
+
+```py
+import numpy as np
+
+a = np.array([1, 2, 3, 4, 5])
+b = a
+b[2] = 20
+```
+
+## --answers--
+
+```python
+[1 2 3 4 5]
+```
+
+---
+
+```python
+[1 2 20 4 5]
+```
+
+---
+
+```python
+[1 20 3 4 5]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initialize-array-problem.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initialize-array-problem.md
new file mode 100644
index 0000000000..34e8f27604
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initialize-array-problem.md
@@ -0,0 +1,61 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed6
+title: Initialize Array Problem
+challengeType: 11
+videoId: 0jGfH8BPfOk
+dashedName: initialize-array-problem
+---
+
+# --question--
+
+## --text--
+
+What is another way to produce the following array?
+
+```py
+[[0. 0. 0. 0. 0. 0. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 5. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 1. 1. 1. 1. 1. 0.]
+[0. 0. 0. 0. 0. 0. 0.]]
+```
+
+## --answers--
+
+```py
+output = np.ones((7, 7))
+
+z = np.zeros((5, 5))
+z[2, 2] = 5
+
+output[1:1, -1:-1] = z
+```
+
+---
+
+```py
+output = np.zeros((7,7))
+
+z = np.ones((5, 5))
+z[2, 2] = 5
+
+output[1:-1, 1:-1] = z
+```
+
+---
+
+```py
+output = np.ones((7, 7))
+
+z = np.zeros((5, 5))
+z[3, 3] = 5
+
+output[1:-1, 1:-1] = z
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initializing-different-arrays.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initializing-different-arrays.md
new file mode 100644
index 0000000000..a6957cc7e4
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/initializing-different-arrays.md
@@ -0,0 +1,44 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed5
+title: Initializing Different Arrays
+challengeType: 11
+videoId: CEykdsKT4U4
+dashedName: initializing-different-arrays
+---
+
+# --question--
+
+## --text--
+
+What will the following code print?
+
+```py
+a = np.array([[1, 2, 3, 4, 5], [6, 7, 8, 9, 10]])
+
+print(np.full_like(a, 100))
+```
+
+## --answers--
+
+```py
+[[100 100 100 100 100]]
+```
+
+---
+
+```py
+[[100 100 100 100 100]
+[100 100 100 100 100]]
+```
+
+---
+
+```py
+[[ 1  2  3  4  5]
+[ 6  7 20  9 10]]
+```
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
new file mode 100644
index 0000000000..5afa96f450
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/loading-data-and-advanced-indexing.md
@@ -0,0 +1,56 @@
+---
+id: 5e9a0a8e09c5df3cc3600eda
+title: Loading Data and Advanced Indexing
+challengeType: 11
+videoId: tUdBZ7pF8Jg
+dashedName: loading-data-and-advanced-indexing
+---
+
+# --question--
+
+## --text--
+
+Given a file named `data.txt` with these contents:
+
+<pre>
+29,97,32,100,45
+15,88,5,75,22
+</pre>
+
+What code would produce the following array?
+
+```py
+[29. 32. 45. 15.  5. 22.]
+```
+
+## --answers--
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = np.any(filedata < 50)
+
+print(output)
+```
+
+---
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = np.all(filedata < 50, axis=1)
+
+print(output)
+```
+
+---
+
+```py
+filedata = np.genfromtxt('data.txt', delimiter=',')
+output = filedata[filedata < 50]
+
+print(output)
+```
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/mathematics.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/mathematics.md
new file mode 100644
index 0000000000..f3b1a3c111
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/mathematics.md
@@ -0,0 +1,49 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed8
+title: Mathematics
+challengeType: 11
+videoId: 7txegvyhtVk
+dashedName: mathematics
+---
+
+# --question--
+
+## --text--
+
+What is the value of `b` after running the following code?
+
+```py
+import numpy as np
+
+a = np.array(([1, 2, 3, 4, 5], [6, 7, 8, 9, 10]))
+b = np.max(a, axis=1).sum()
+```
+
+## --answers--
+
+```py
+10
+```
+
+---
+
+```py
+7
+```
+
+---
+
+```py
+5
+```
+
+---
+
+```py
+15
+```
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/reorganizing-arrays.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/reorganizing-arrays.md
new file mode 100644
index 0000000000..7e4903c864
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/reorganizing-arrays.md
@@ -0,0 +1,49 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed9
+title: Reorganizing Arrays
+challengeType: 11
+videoId: VNWAQbEM-C8
+dashedName: reorganizing-arrays
+---
+
+# --question--
+
+## --text--
+
+What code would produce the following array?
+
+```py
+[[1. 1.]
+[1. 1.]
+[1. 1.]
+[1. 1.]]
+```
+
+## --answers--
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((4, 2))
+print(b)
+```
+
+---
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((2, 4))
+print(b)
+```
+
+---
+
+```py
+a = np.ones((2, 4))
+b = a.reshape((8, 1))
+print(b)
+```
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/what-is-numpy.md b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/what-is-numpy.md
new file mode 100644
index 0000000000..03b2f65fc7
--- /dev/null
+++ b/curriculum/challenges/portuguese/08-data-analysis-with-python/numpy/what-is-numpy.md
@@ -0,0 +1,34 @@
+---
+id: 5e9a0a8e09c5df3cc3600ed2
+title: What is NumPy
+challengeType: 11
+videoId: 5Nwfs5Ej85Q
+dashedName: what-is-numpy
+---
+
+# --question--
+
+## --text--
+
+Why are Numpy arrays faster than regular Python lists?
+
+## --answers--
+
+Numpy does not perform type checking while iterating through objects.
+
+---
+
+Numpy uses fixed types.
+
+---
+
+Numpy uses contiguous memory.
+
+---
+
+All of the above.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-projects/anonymous-message-board.md b/curriculum/challenges/portuguese/09-information-security/information-security-projects/anonymous-message-board.md
new file mode 100644
index 0000000000..10b7e3ad58
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-projects/anonymous-message-board.md
@@ -0,0 +1,172 @@
+---
+id: 587d824a367417b2b2512c45
+title: Anonymous Message Board
+challengeType: 4
+forumTopicId: 301568
+dashedName: anonymous-message-board
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://anonymous-message-board.freecodecamp.rocks/>.
+
+Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-messageboard/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-messageboard) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  Set `NODE_ENV` to test without quotes when ready to write tests and DB to your databases connection string (in `.env`)
+2.  Recommended to create controllers/handlers and handle routing in `routes/api.js`
+3.  You will add any security features to `server.js`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Creating a new thread: POST request to `/api/threads/{board}`
+-   Viewing the 10 most recent threads with 3 replies each: GET request to `/api/threads/{board}`
+-   Deleting a thread with the incorrect password: DELETE request to `/api/threads/{board}` with an invalid `delete_password`
+-   Deleting a thread with the correct password: DELETE request to `/api/threads/{board}` with a valid `delete_password`
+-   Reporting a thread: PUT request to `/api/threads/{board}`
+-   Creating a new reply: POST request to `/api/replies/{board}`
+-   Viewing a single thread with all replies: GET request to `/api/replies/{board}`
+-   Deleting a reply with the incorrect password: DELETE request to `/api/replies/{board}` with an invalid `delete_password`
+-   Deleting a reply with the correct password: DELETE request to `/api/replies/{board}` with a valid `delete_password`
+-   Reporting a reply: PUT request to `/api/replies/{board}`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/anonymous-message-board\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+Only allow your site to be loaded in an iFrame on your own pages.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['x-frame-options']?.includes('SAMEORIGIN'));
+};
+```
+
+Do not allow DNS prefetching.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['x-dns-prefetch-control']?.includes('off'));
+};
+```
+
+Only allow your site to send the referrer for your own pages.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(parsed.headers['referrer-policy']?.includes('same-origin'));
+};
+```
+
+You can send a POST request to `/api/threads/{board}` with form data including `text` and `delete_password`. The saved database record will have at least the fields `_id`, `text`, `created_on`(date & time), `bumped_on`(date & time, starts same as `created_on`), `reported` (boolean), `delete_password`, & `replies` (array).
+
+```js
+async (getUserInput) => {
+  const date = new Date();
+  const text = `fcc_test_${date}`;
+  const deletePassword = 'delete_me';
+  const data = { text, delete_password: deletePassword };
+  const url = getUserInput('url');
+  const res = await fetch(url + '/api/threads/fcc_test', {
+    method: 'POST',
+    headers: { 'Content-Type': 'application/json' },
+    body: JSON.stringify(data)
+  });
+  if (res.ok) {
+    const checkData = await fetch(url + '/api/threads/fcc_test');
+    const parsed = await checkData.json();
+    try {
+      assert.equal(parsed[0].text, text);
+      assert.isNotNull(parsed[0]._id);
+      assert.equal(new Date(parsed[0].created_on).toDateString(), date.toDateString());
+      assert.equal(parsed[0].bumped_on, parsed[0].created_on);
+      assert.isArray(parsed[0].replies);
+    } catch (err) {
+      throw new Error(err.responseText || err.message);
+    }
+  } else {
+    throw new Error(`${res.status} ${res.statusText}`);
+  }
+};
+```
+
+You can send a POST request to `/api/replies/{board}` with form data including `text`, `delete_password`, & `thread_id`. This will update the `bumped_on` date to the comment's date. In the thread's `replies` array, an object will be saved with at least the properties `_id`, `text`, `created_on`, `delete_password`, & `reported`.
+
+```js
+
+```
+
+You can send a GET request to `/api/threads/{board}`. Returned will be an array of the most recent 10 bumped threads on the board with only the most recent 3 replies for each. The `reported` and `delete_password` fields will not be sent to the client.
+
+```js
+
+```
+
+You can send a GET request to `/api/replies/{board}?thread_id={thread_id}`. Returned will be the entire thread with all its replies, also excluding the same fields from the client as the previous test.
+
+```js
+
+```
+
+You can send a DELETE request to `/api/threads/{board}` and pass along the `thread_id` & `delete_password` to delete the thread. Returned will be the string `incorrect password` or `success`.
+
+```js
+
+```
+
+You can send a DELETE request to `/api/replies/{board}` and pass along the `thread_id`, `reply_id`, & `delete_password`. Returned will be the string `incorrect password` or `success`. On success, the text of the `reply_id` will be changed to `[deleted]`.
+
+```js
+
+```
+
+You can send a PUT request to `/api/threads/{board}` and pass along the `thread_id`. Returned will be the string `success`. The `reported` value of the `thread_id` will be changed to `true`.
+
+```js
+
+```
+
+You can send a PUT request to `/api/replies/{board}` and pass along the `thread_id` & `reply_id`. Returned will be the string `success`. The `reported` value of the `reply_id` will be changed to `true`.
+
+```js
+
+```
+
+All 10 functional tests are complete and passing.
+
+```js
+
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-projects/port-scanner.md b/curriculum/challenges/portuguese/09-information-security/information-security-projects/port-scanner.md
new file mode 100644
index 0000000000..d4b4d6cb89
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-projects/port-scanner.md
@@ -0,0 +1,43 @@
+---
+id: 5e46f979ac417301a38fb932
+title: Port Scanner
+challengeType: 10
+forumTopicId: 462372
+helpCategory: Python
+dashedName: port-scanner
+---
+
+# --description--
+
+Create a port scanner using Python.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-port-scanner).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you some of the Python skills required for this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md b/curriculum/challenges/portuguese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
new file mode 100644
index 0000000000..99f371813e
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-projects/secure-real-time-multiplayer-game.md
@@ -0,0 +1,175 @@
+---
+id: 5e601c775ac9d0ecd8b94aff
+title: Secure Real Time Multiplayer Game
+challengeType: 4
+forumTopicId: 462375
+dashedName: secure-real-time-multiplayer-game
+---
+
+# --description--
+
+Develop a 2D real time multiplayer game using the HTML Canvas API and [Socket.io](https://socket.io/) that is functionally similar to this: <https://secure-real-time-multiplayer-game.freecodecamp.rocks/>. Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-secure-real-time-multiplayer-game) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --instructions--
+
+**Note**: `helmet@^3.21.3` is needed for the user stories. This means you will need to use the previous version of Helmet's docs, for information on how to achieve the user stories.
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/secure-real-time-multiplayer-game\.freecodecamp\.rocks/.test(
+      getUserInput('url')
+    )
+  );
+};
+```
+
+Multiple players can connect to a server and play.
+
+```js
+
+```
+
+Each player has an avatar.
+
+```js
+
+```
+
+Each player is represented by an object created by the `Player` class in `Player.mjs`.
+
+```js
+
+```
+
+At a minimum, each player object should contain a unique `id`, a `score`, and `x` and `y` coordinates representing the player's current position.
+
+```js
+
+```
+
+The game has at least one type of collectible item. Complete the `Collectible` class in `Collectible.mjs` to implement this.
+
+```js
+
+```
+
+At a minimum, each collectible item object created by the `Collectible` class should contain a unique `id`, a `value`, and `x` and `y` coordinates representing the item's current position.
+
+```js
+
+```
+
+Players can use the WASD and/or arrow keys to move their avatar. Complete the `movePlayer` method in `Player.mjs` to implement this.
+
+```js
+
+```
+
+The `movePlayer` method should accept two arguments: a string of "up", "down", "left", or "right", and a number for the amount of pixels the player's position should change. `movePlayer` should adjust the `x` and `y` coordinates of the player object it's called from.
+
+```js
+
+```
+
+The player's score should be used to calculate their rank among the other players. Complete the `calculateRank` method in the `Player` class to implement this.
+
+```js
+
+```
+
+The `calculateRank` method should accept an array of objects representing all connected players and return the string `Rank: currentRanking/totalPlayers`. For example, in a game with two players, if Player A has a score of 3 and Player B has a score of 5, `calculateRank` for Player A should return `Rank: 2/2`.
+
+```js
+
+```
+
+Players can collide with a collectible item. Complete the `collision` method in `Player.mjs` to implement this.
+
+```js
+
+```
+
+The `collision` method should accept a collectible item's object as an argument. If the player's avatar intersects with the item, the `collision` method should return `true`.
+
+```js
+
+```
+
+All players are kept in sync.
+
+```js
+
+```
+
+Players can disconnect from the game at any time.
+
+```js
+
+```
+
+Prevent the client from trying to guess / sniff the MIME type.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-content-type-options'], 'nosniff');
+};
+```
+
+Prevent cross-site scripting (XSS) attacks.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-xss-protection'], '1; mode=block');
+};
+```
+
+Nothing from the website is cached in the client.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['surrogate-control'], 'no-store');
+  assert.equal(
+    parsed.headers['cache-control'],
+    'no-store, no-cache, must-revalidate, proxy-revalidate'
+  );
+  assert.equal(parsed.headers['pragma'], 'no-cache');
+  assert.equal(parsed.headers['expires'], '0');
+};
+```
+
+The headers say that the site is powered by "PHP 7.4.3" even though it isn't (as a security measure).
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.equal(parsed.headers['x-powered-by'], 'PHP 7.4.3');
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-projects/sha-1-password-cracker.md b/curriculum/challenges/portuguese/09-information-security/information-security-projects/sha-1-password-cracker.md
new file mode 100644
index 0000000000..50bb715271
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-projects/sha-1-password-cracker.md
@@ -0,0 +1,43 @@
+---
+id: 5e46f983ac417301a38fb933
+title: SHA-1 Password Cracker
+challengeType: 10
+forumTopicId: 462374
+helpCategory: Python
+dashedName: sha-1-password-cracker
+---
+
+# --description--
+
+For this project you will learn about the importance of good security by creating a password cracker to figure out passwords that were hashed using SHA-1.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-SHA-1-password-cracker).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the Python curriculum. For now, here are some videos on the freeCodeCamp.org YouTube channel that will teach you some of the Python skills required for this project:
+
+<ul>
+  <li>
+    <a href='https://www.freecodecamp.org/news/python-for-everybody/'>Python for Everybody Video Course</a> (14 hours)
+  </li>
+  <li>
+    <a href='https://www.freecodecamp.org/news/learn-python-basics-in-depth-video-course/'>Learn Python Video Course</a> (2 hours)
+  </li>
+</ul>
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-projects/stock-price-checker.md b/curriculum/challenges/portuguese/09-information-security/information-security-projects/stock-price-checker.md
new file mode 100644
index 0000000000..2a0a1ea2fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-projects/stock-price-checker.md
@@ -0,0 +1,134 @@
+---
+id: 587d824a367417b2b2512c44
+title: Stock Price Checker
+challengeType: 4
+forumTopicId: 301572
+dashedName: stock-price-checker
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://stock-price-checker.freecodecamp.rocks/>.
+
+Since all reliable stock price APIs require an API key, we've built a workaround. Use <https://stock-price-checker-proxy.freecodecamp.rocks/> to get up-to-date stock price information without needing to sign up for your own key.
+
+Working on this project will involve you writing your code using one of the following methods:
+
+-   Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-project-stockchecker/) and complete your project locally.
+-   Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-project-stockchecker) to complete your project.
+-   Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your projects source code in the `GitHub Link` field.
+
+# --instructions--
+
+1.  SET `NODE_ENV` to `test` without quotes and set `DB` to your MongoDB connection string
+2.  Complete the project in `routes/api.js` or by creating a handler/controller
+3.  You will add any security features to `server.js`
+4.  You will create all of the functional tests in `tests/2_functional-tests.js`
+
+Write the following tests in `tests/2_functional-tests.js`:
+
+-   Viewing one stock: GET request to `/api/stock-prices/`
+-   Viewing one stock and liking it: GET request to `/api/stock-prices/`
+-   Viewing the same stock and liking it again: GET request to `/api/stock-prices/`
+-   Viewing two stocks: GET request to `/api/stock-prices/`
+-   Viewing two stocks and liking them: GET request to `/api/stock-prices/`
+
+# --hints--
+
+You can provide your own project, not the example URL.
+
+```js
+(getUserInput) => {
+  assert(
+    !/.*\/stock-price-checker\.freecodecamp\.rocks/.test(getUserInput('url'))
+  );
+};
+```
+
+You should set the content security policies to only allow loading of scripts and CSS from your server.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(getUserInput('url') + '/_api/app-info');
+  const parsed = await data.json();
+  assert.isTrue(
+    parsed.headers['content-security-policy'].includes("script-src 'self'")
+  );
+  assert.isTrue(
+    parsed.headers['content-security-policy'].includes("style-src 'self'")
+  );
+};
+```
+
+You can send a `GET` request to `/api/stock-prices`, passing a NASDAQ stock symbol to a `stock` query parameter. The returned object will contain a property named `stockData`.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG'
+  );
+  const parsed = await data.json();
+  assert.property(parsed, 'stockData');
+};
+```
+
+The `stockData` property includes the `stock` symbol as a string, the `price` as a number, and `likes` as a number.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG'
+  );
+  const parsed = await data.json();
+  const ticker = parsed.stockData;
+  assert.typeOf(ticker.price, 'number');
+  assert.typeOf(ticker.likes, 'number');
+  assert.typeOf(ticker.stock, 'string');
+};
+```
+
+You can also pass along a `like` field as `true` (boolean) to have your like added to the stock(s). Only 1 like per IP should be accepted.
+
+```js
+
+```
+
+If you pass along 2 stocks, the returned value will be an array with information about both stocks. Instead of `likes`, it will display `rel_likes` (the difference between the likes on both stocks) for both `stockData` objects.
+
+```js
+async (getUserInput) => {
+  const data = await fetch(
+    getUserInput('url') + '/api/stock-prices?stock=GOOG&stock=MSFT'
+  );
+  const parsed = await data.json();
+  const ticker = parsed.stockData;
+  assert.typeOf(ticker, 'array');
+  assert.property(ticker[0], 'rel_likes');
+  assert.property(ticker[1], 'rel_likes');
+};
+```
+
+All 5 functional tests are complete and passing.
+
+```js
+async (getUserInput) => {
+  const tests = await fetch(getUserInput('url') + '/_api/get-tests');
+  const parsed = await tests.json();
+  assert.isTrue(parsed.length >= 5);
+  parsed.forEach((test) => {
+    assert.equal(test.state, 'passed');
+  });
+};
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
new file mode 100644
index 0000000000..9d5cba3e75
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/ask-browsers-to-access-your-site-via-https-only-with-helmet.hsts.md
@@ -0,0 +1,63 @@
+---
+id: 587d8248367417b2b2512c3c
+title: Ask Browsers to Access Your Site via HTTPS Only with helmet.hsts()
+challengeType: 2
+forumTopicId: 301573
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Configure `helmet.hsts()` to use HTTPS for the next 90 days. Pass the config object `{maxAge: timeInSeconds, force: true}`. You can create a variable `ninetyDaysInSeconds = 90*24*60*60;` to use for the `timeInSeconds`. Replit 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 Replit header, after inspecting it for testing.
+
+Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate.
+
+# --hints--
+
+helmet.hsts() middleware should be mounted correctly
+
+```js
+(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);
+    }
+  );
+```
+
+maxAge should be equal to 7776000 s (90 days)
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/app-info').then(
+    (data) => {
+      assert.match(
+        data.headers['strict-transport-security'],
+        /^max-age=7776000;?/
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
new file mode 100644
index 0000000000..1ea172a936
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/avoid-inferring-the-response-mime-type-with-helmet.nosniff.md
@@ -0,0 +1,42 @@
+---
+id: 587d8248367417b2b2512c3a
+title: Avoid Inferring the Response MIME Type with helmet.noSniff()
+challengeType: 2
+forumTopicId: 301574
+dashedName: avoid-inferring-the-response-mime-type-with-helmet-nosniff
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/). Browsers can use content or MIME sniffing to override response `Content-Type` headers to guess and process the data using an implicit content type. 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`, instructing the browser to not bypass the provided `Content-Type`.
+
+# --instructions--
+
+Use the `helmet.noSniff()` method on your server.
+
+# --hints--
+
+helmet.noSniff() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
new file mode 100644
index 0000000000..8f96da298a
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -0,0 +1,50 @@
+---
+id: 587d8249367417b2b2512c40
+title: Configure Helmet Using the ‘parent’ helmet() Middleware
+challengeType: 2
+forumTopicId: 301575
+dashedName: configure-helmet-using-the-parent-helmet-middleware
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+`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:**
+
+```js
+app.use(helmet({
+  frameguard: {         // configure
+    action: 'deny'
+  },
+  contentSecurityPolicy: {    // enable and configure
+    directives: {
+      defaultSrc: ["'self'"],
+      styleSrc: ['style.com'],
+    }
+  },
+  dnsPrefetchControl: false     // disable
+}))
+```
+
+We introduced each middleware separately for teaching purposes and for ease of testing. Using the ‘parent’ `helmet()` middleware is easy to implement in a real project.
+
+# --hints--
+
+no tests - it's a descriptive challenge
+
+```js
+assert(true);
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
new file mode 100644
index 0000000000..b12dedf8de
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-client-side-caching-with-helmet.nocache.md
@@ -0,0 +1,47 @@
+---
+id: 587d8249367417b2b2512c3e
+title: Disable Client-Side Caching with helmet.noCache()
+challengeType: 2
+forumTopicId: 301576
+dashedName: disable-client-side-caching-with-helmet-nocache
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.noCache()` method on your server.
+
+# --hints--
+
+helmet.noCache() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
new file mode 100644
index 0000000000..3a855aebb7
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/disable-dns-prefetching-with-helmet.dnsprefetchcontrol.md
@@ -0,0 +1,44 @@
+---
+id: 587d8248367417b2b2512c3d
+title: Disable DNS Prefetching with helmet.dnsPrefetchControl()
+challengeType: 2
+forumTopicId: 301577
+dashedName: disable-dns-prefetching-with-helmet-dnsprefetchcontrol
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.dnsPrefetchControl()` method on your server.
+
+# --hints--
+
+helmet.dnsPrefetchControl() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
new file mode 100644
index 0000000000..0165afc950
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-asynchronously.md
@@ -0,0 +1,81 @@
+---
+id: 58a25bcff9fc0f352b528e7d
+title: Hash and Compare Passwords Asynchronously
+challengeType: 2
+forumTopicId: 301578
+dashedName: hash-and-compare-passwords-asynchronously
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+As hashing is designed to be computationally intensive, it is recommended to do so asynchronously on your server as to avoid blocking incoming connections while you hash. All you have to do to hash a password asynchronous is call
+
+```js
+bcrypt.hash(myPlaintextPassword, saltRounds, (err, hash) => {
+  /*Store hash in your db*/
+});
+```
+
+# --instructions--
+
+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.
+
+```js
+bcrypt.compare(myPlaintextPassword, hash, (err, res) => {
+  /*res == true or false*/
+});
+```
+
+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.
+
+```js
+bcrypt.hash('passw0rd!', 13, (err, hash) => {
+  console.log(hash);
+  //$2a$12$Y.PHPE15wR25qrrtgGkiYe2sXo98cjuMCG1YwSI5rJW1DSJp0gEYS
+  bcrypt.compare('passw0rd!', hash, (err, res) => {
+    console.log(res); //true
+  });
+});
+
+```
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+Async hash should be generated and correctly compared.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
new file mode 100644
index 0000000000..f7efd69368
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hash-and-compare-passwords-synchronously.md
@@ -0,0 +1,66 @@
+---
+id: 58a25bcff9fc0f352b528e7e
+title: Hash and Compare Passwords Synchronously
+challengeType: 2
+forumTopicId: 301579
+dashedName: hash-and-compare-passwords-synchronously
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+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
+
+```js
+var hash = bcrypt.hashSync(myPlaintextPassword, saltRounds);
+```
+
+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 won't 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:
+
+```js
+var result = bcrypt.compareSync(myPlaintextPassword, hash);
+```
+
+with the result being a boolean true or false.
+
+# --instructions--
+
+Add the function in and log the result to the console to see it working.
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+Sync hash should be generated and correctly compared.
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
new file mode 100644
index 0000000000..fbf4faceb1
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/hide-potentially-dangerous-information-using-helmet.hidepoweredby.md
@@ -0,0 +1,40 @@
+---
+id: 587d8247367417b2b2512c37
+title: Hide Potentially Dangerous Information Using helmet.hidePoweredBy()
+challengeType: 2
+forumTopicId: 301580
+dashedName: hide-potentially-dangerous-information-using-helmet-hidepoweredby
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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. Use the `helmet.hidePoweredBy()` middleware to remove the X-Powered-By header.
+
+# --hints--
+
+helmet.hidePoweredBy() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
new file mode 100644
index 0000000000..2e89c44399
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/install-and-require-helmet.md
@@ -0,0 +1,53 @@
+---
+id: 587d8247367417b2b2512c36
+title: Install and Require Helmet
+challengeType: 2
+forumTopicId: 301581
+dashedName: install-and-require-helmet
+---
+
+# --description--
+
+Working on these challenges will involve you writing your code using one of the following methods:
+
+- Clone [this GitHub repo](https://github.com/freeCodeCamp/boilerplate-infosec/) and complete these challenges locally.
+- Use [our Replit starter project](https://replit.com/github/freeCodeCamp/boilerplate-infosec) to complete these challenges.
+- Use a site builder of your choice to complete the project. Be sure to incorporate all the files from our GitHub repo.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field.
+
+Helmet helps you secure your Express apps by setting various HTTP headers.
+
+# --instructions--
+
+All your code for these lessons goes in the `myApp.js` file between the lines of code we have started you off with. Do not change or delete the code we have added for you.
+
+Install Helmet version `3.21.3`, then require it. You can install a specific version of a package with `npm install --save-exact package@version`, or by adding it to your `package.json` directly.
+
+# --hints--
+
+`helmet` version `3.21.3` should be in `package.json`
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/package.json').then(
+    (data) => {
+      const packJson = JSON.parse(data);
+      const helmet = packJson.dependencies.helmet;
+      assert(helmet === '3.21.3' || helmet === '^3.21.3');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
new file mode 100644
index 0000000000..33b43cd3be
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-clickjacking-with-helmet.frameguard.md
@@ -0,0 +1,64 @@
+---
+id: 587d8247367417b2b2512c38
+title: Mitigate the Risk of Clickjacking with helmet.frameguard()
+challengeType: 2
+forumTopicId: 301582
+dashedName: mitigate-the-risk-of-clickjacking-with-helmet-frameguard
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use `helmet.frameguard()` passing with the configuration object `{action: 'deny'}`.
+
+# --hints--
+
+helmet.frameguard() middleware should be mounted correctly
+
+```js
+(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);
+    }
+  );
+```
+
+helmet.frameguard() 'action' should be set to 'DENY'
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
new file mode 100644
index 0000000000..82389f8d83
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/mitigate-the-risk-of-cross-site-scripting-xss-attacks-with-helmet.xssfilter.md
@@ -0,0 +1,52 @@
+---
+id: 587d8247367417b2b2512c39
+title: >-
+  Mitigate the Risk of Cross Site Scripting (XSS) Attacks with
+  helmet.xssFilter()
+challengeType: 2
+forumTopicId: 301583
+dashedName: 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 [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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. &lt;, >.
+
+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.
+
+# --instructions--
+
+Use `helmet.xssFilter()` to sanitize input sent to your server.
+
+# --hints--
+
+helmet.xssFilter() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
new file mode 100644
index 0000000000..995e6f8fc5
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/prevent-ie-from-opening-untrusted-html-with-helmet.ienoopen.md
@@ -0,0 +1,44 @@
+---
+id: 587d8248367417b2b2512c3b
+title: Prevent IE from Opening Untrusted HTML with helmet.ieNoOpen()
+challengeType: 2
+forumTopicId: 301584
+dashedName: prevent-ie-from-opening-untrusted-html-with-helmet-ienoopen
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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.
+
+# --instructions--
+
+Use the `helmet.ieNoOpen()` method on your server.
+
+# --hints--
+
+helmet.ieNoOpen() middleware should be mounted correctly
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
new file mode 100644
index 0000000000..8c75941837
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/set-a-content-security-policy-with-helmet.contentsecuritypolicy.md
@@ -0,0 +1,71 @@
+---
+id: 587d8249367417b2b2512c3f
+title: Set a Content Security Policy with helmet.contentSecurityPolicy()
+challengeType: 2
+forumTopicId: 301585
+dashedName: set-a-content-security-policy-with-helmet-contentsecuritypolicy
+---
+
+# --description--
+
+As a reminder, this project is being built upon the following starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-infosec), or cloned from [GitHub](https://github.com/freeCodeCamp/boilerplate-infosec/).
+
+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 an allowed list 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 is 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.
+
+# --instructions--
+
+In this exercise, use `helmet.contentSecurityPolicy()`. Configure it by adding a `directives` object. In the object, set the `defaultSrc` to `["'self'"]` (the list of allowed sources must be in an array), in order to trust only your website address by default. Also set the `scriptSrc` directive so that you only allow scripts to be downloaded from your website (`'self'`), 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.
+
+# --hints--
+
+helmet.contentSecurityPolicy() middleware should be mounted correctly
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/app-info').then(
+    (data) => {
+      assert.include(data.appStack, 'csp');
+    },
+    (xhr) => {
+      throw new Error(xhr.responseText);
+    }
+  );
+```
+
+Your csp config is not correct. defaultSrc should be ["'self'"] and scriptSrc should be ["'self'", 'trusted-cdn.com']
+
+```js
+(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--
+
+```js
+/**
+  Backend challenges don't need solutions,
+  because they would need to be tested against a full working project.
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
new file mode 100644
index 0000000000..673ecb35c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/information-security-with-helmetjs/understand-bcrypt-hashes.md
@@ -0,0 +1,72 @@
+---
+id: 58a25bcef9fc0f352b528e7c
+title: Understand BCrypt Hashes
+challengeType: 2
+forumTopicId: 301586
+dashedName: understand-bcrypt-hashes
+---
+
+# --description--
+
+For the following challenges, you will be working with a new starter project that is different from the previous one. You can find the new starter project on [Replit](https://replit.com/github/freeCodeCamp/boilerplate-bcrypt), or clone it from [GitHub](https://github.com/freeCodeCamp/boilerplate-bcrypt/).
+
+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 an algorithm and returning a fixed length result. To further complicate this process and make it more secure, you can also *salt* 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 `$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm` which does have a structure. The first small bit of data `$2a` is defining what kind of hash algorithm was used. The next portion `$13` defines the *cost*. 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 `$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm`, looks like one large string of numbers, periods, and letters but it is actually two separate pieces of information. The first 22 characters is the salt in plain text, and the rest is the hashed password!
+
+# --instructions--
+
+To begin using BCrypt, add it as a dependency in your project and require it as 'bcrypt' in your server.
+
+Add all your code for these lessons in the `server.js` file between the code we have started you off with. Do not change or delete the code we have added for you.
+
+Submit your page when you think you've got it right.
+
+# --hints--
+
+BCrypt should be a dependency.
+
+```js
+(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);
+    }
+  );
+```
+
+BCrypt should be properly required.
+
+```js
+(getUserInput) =>
+  $.get(getUserInput('url') + '/_api/server.js').then(
+    (data) => {
+      assert.match(
+        data,
+        /bcrypt.*=.*require.*('|")bcrypt('|")/gi,
+        'You should correctly require and instantiate socket.io as io.'
+      );
+    },
+    (xhr) => {
+      throw new Error(xhr.statusText);
+    }
+  );
+```
+
+# --solutions--
+
+```js
+/**
+  Backend challenges don't need solutions, 
+  because they would need to be tested against a full working project. 
+  Please check our contributing guidelines to learn more.
+*/
+```
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
new file mode 100644
index 0000000000..a808410376
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/creating-a-tcp-client.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db0
+title: Creating a TCP Client
+challengeType: 11
+videoId: ugYfJNTawks
+dashedName: creating-a-tcp-client
+---
+
+# --question--
+
+## --text--
+
+Which socket object method lets you set the maximum amount of data your client accepts at once?
+
+## --answers--
+
+`.recv(1024)`
+
+---
+
+`.decode('ascii')`
+
+---
+
+`.connect(host, port)`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
new file mode 100644
index 0000000000..88f5f3fcfe
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-banner-grabber.md
@@ -0,0 +1,43 @@
+---
+id: 5ea9997bbec2e9bc47e94db3
+title: Developing a Banner Grabber
+challengeType: 11
+videoId: CeGW761BIsA
+dashedName: developing-a-banner-grabber
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks to complete the `banner` function below:
+
+```py
+def banner(ip, port):
+    s = socket.socket()
+    s.__A__((ip, __B__))
+    print(s.recv(1024))
+```
+
+## --answers--
+
+A: `connect`
+
+B: `port`
+
+---
+
+A: `getsockname`
+
+B: `'1-1024'`
+
+---
+
+A: `connect`
+
+B: `int(port)`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
new file mode 100644
index 0000000000..a35002583e
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-a-port-scanner.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db4
+title: Developing a Port Scanner
+challengeType: 11
+videoId: z_qkqZS7KZ4
+dashedName: developing-a-port-scanner
+---
+
+# --question--
+
+## --text--
+
+What is the main difference between the `.connect()` and `.connect_ex()` methods?
+
+## --answers--
+
+There is no difference between the two methods.
+
+---
+
+If there is an error or if no host is found, `.connect()` returns an error code while `.connect_ex()` raises an exception.
+
+---
+
+If there is an error or if no host is found, `.connect()` raises an exception while `.connect_ex()` returns an error code.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
new file mode 100644
index 0000000000..8f26492699
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-1.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db1
+title: Developing an Nmap Scanner part 1
+challengeType: 11
+videoId: jYk9XaGoAnk
+dashedName: developing-an-nmap-scanner-part-1
+---
+
+# --question--
+
+## --text--
+
+What is the correct command to install the Python 3 version of the `python-nmap` library?
+
+## --answers--
+
+`sudo apt install python-nmap`
+
+---
+
+`pip install python-nmap`
+
+---
+
+`pip3 install python-nmap`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
new file mode 100644
index 0000000000..ab3a65968f
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/developing-an-nmap-scanner-part-2.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94db2
+title: Developing an Nmap Scanner part 2
+challengeType: 11
+videoId: a98PscnUsTg
+dashedName: developing-an-nmap-scanner-part-2
+---
+
+# --question--
+
+## --text--
+
+Which of the following allows you to scan for UDP ports between 21 to 443?
+
+## --answers--
+
+`.scan(ip_addr, '21-443', '-v -sU')`
+
+---
+
+`.scan(ip_addr, '1-1024', '-v -sS')`
+
+---
+
+`.scan(ip_addr, '21-443', '-v -sS')`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/introduction-and-setup.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/introduction-and-setup.md
new file mode 100644
index 0000000000..c243ea2954
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/introduction-and-setup.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94dae
+title: Introduction and Setup
+challengeType: 11
+videoId: XeQ7ZKtb998
+dashedName: introduction-and-setup
+---
+
+# --question--
+
+## --text--
+
+What code editor and extension does the instructor recommend for developing penetration testing tools in Python?
+
+## --answers--
+
+Atom and the atom-python-run extension.
+
+---
+
+VSCode and Microsoft's Python extension.
+
+---
+
+Sublime Text and the Anaconda package.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
new file mode 100644
index 0000000000..7a0f528118
--- /dev/null
+++ b/curriculum/challenges/portuguese/09-information-security/python-for-penetration-testing/understanding-sockets-and-creating-a-tcp-server.md
@@ -0,0 +1,30 @@
+---
+id: 5ea9997bbec2e9bc47e94daf
+title: Understanding Sockets and Creating a TCP Server
+challengeType: 11
+videoId: F1QI9tNuDQg
+dashedName: understanding-sockets-and-creating-a-tcp-server
+---
+
+# --question--
+
+## --text--
+
+Which of the following functions creates a socket object?
+
+## --answers--
+
+`socket.bind((host, port))`
+
+---
+
+`socket.gethostbyname()`
+
+---
+
+`socket.socket(socket.AF_INET, socket.SOCK_STREAM)`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
new file mode 100644
index 0000000000..f5fa4e3e8c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/find-the-symmetric-difference.md
@@ -0,0 +1,150 @@
+---
+id: a3f503de51cf954ede28891d
+title: Find the Symmetric Difference
+challengeType: 5
+forumTopicId: 301611
+dashedName: find-the-symmetric-difference
+---
+
+# --description--
+
+The mathematical term <dfn>symmetric difference</dfn> (`△` or `⊕`) of two sets is the set of elements which are in either of the two sets but not in both. For example, for sets `A = {1, 2, 3}` and `B = {2, 3, 4}`, `A △ B = {1, 4}`.
+
+Symmetric difference is a binary operation, which means it operates on only two elements. So to evaluate an expression involving symmetric differences among *three* elements (`A △ B △ C`), you must complete one operation at a time. Thus, for sets `A` and `B` above, and `C = {2, 3}`, `A △ B △ C = (A △ B) △ C = {1, 4} △ {2, 3} = {1, 2, 3, 4}`.
+
+# --instructions--
+
+Create a function that takes two or more arrays and returns an array of their symmetric difference. The returned array must contain only unique values (*no duplicates*).
+
+# --hints--
+
+`sym([1, 2, 3], [5, 2, 1, 4])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3], [5, 2, 1, 4]).length, 3);
+```
+
+`sym([1, 2, 3, 3], [5, 2, 1, 4])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3, 3], [5, 2, 1, 4]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3, 3], [5, 2, 1, 4])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3, 3], [5, 2, 1, 4]).length, 3);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4, 5])` should return `[3, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5]);
+```
+
+`sym([1, 2, 3], [5, 2, 1, 4, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3);
+```
+
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should return `[1, 4, 5]`
+
+```js
+assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5]);
+```
+
+`sym([1, 2, 5], [2, 3, 5], [3, 4, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]).length, 3);
+```
+
+`sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])` should return `[1, 4, 5]`.
+
+```js
+assert.sameMembers(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]), [1, 4, 5]);
+```
+
+`sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])` should contain only three elements.
+
+```js
+assert.equal(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]).length, 3);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])` should return `[2, 3, 4, 6, 7]`.
+
+```js
+assert.sameMembers(
+  sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]),
+  [2, 3, 4, 6, 7]
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])` should contain only five elements.
+
+```js
+assert.equal(
+  sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]).length,
+  5
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])` should return `[1, 2, 4, 5, 6, 7, 8, 9]`.
+
+```js
+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]
+);
+```
+
+`sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])` should contain only eight elements.
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sym(args) {
+  return args;
+}
+
+sym([1, 2, 3], [5, 2, 1, 4]);
+```
+
+# --solutions--
+
+```js
+function sym() {
+  var arrays = [].slice.call(arguments);
+  return arrays.reduce(function (symDiff, arr) {
+    return symDiff.concat(arr).filter(function (val, idx, theArr) {
+      return theArr.indexOf(val) === idx
+        && (symDiff.indexOf(val) === -1 || arr.indexOf(val) === -1);
+    });
+  });
+}
+sym([1, 2, 3], [5, 2, 1, 4]);
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-bubble-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-bubble-sort.md
new file mode 100644
index 0000000000..6cf8150f25
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-bubble-sort.md
@@ -0,0 +1,140 @@
+---
+id: 8d5123c8c441eddfaeb5bdef
+title: Implement Bubble Sort
+challengeType: 1
+forumTopicId: 301612
+dashedName: 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.
+
+**Instructions:** Write a function `bubbleSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`bubbleSort` should be a function.
+
+```js
+assert(typeof bubbleSort == 'function');
+```
+
+`bubbleSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    bubbleSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`bubbleSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`bubbleSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  bubbleSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function bubbleSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+bubbleSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function bubbleSort(array) {
+  for (let i = 0; i < array.length; i++) {
+    let swapped = false;
+    for (let j = 1; j < array.length; j++) {
+      if (array[j - 1] > array[j]) {
+        let temp = array[j-1];
+        array[j-1] =  array[j];
+        array[j] = temp;
+        swapped = true;
+      }
+    }
+    if (swapped === false) {
+      break;
+    }
+  }
+  return array;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-insertion-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-insertion-sort.md
new file mode 100644
index 0000000000..ce4a857bea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-insertion-sort.md
@@ -0,0 +1,131 @@
+---
+id: 587d8259367417b2b2512c86
+title: Implement Insertion Sort
+challengeType: 1
+forumTopicId: 301613
+dashedName: 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.
+
+**Instructions:** Write a function `insertionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`insertionSort` should be a function.
+
+```js
+assert(typeof insertionSort == 'function');
+```
+
+`insertionSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    insertionSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`insertionSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`insertionSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  insertionSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function insertionSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+insertionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function insertionSort (array) {
+  for (let currentIndex = 0; currentIndex < array.length; currentIndex++) {
+    let current = array[currentIndex];
+    let j = currentIndex - 1;
+    while (j > -1 && array[j] > current) {
+      array[j + 1] = array[j];
+      j--;
+    }
+    array[j + 1] = current;
+  }
+  return array;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-merge-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-merge-sort.md
new file mode 100644
index 0000000000..ab1dca4381
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-merge-sort.md
@@ -0,0 +1,158 @@
+---
+id: 587d825c367417b2b2512c8f
+title: Implement Merge Sort
+challengeType: 1
+forumTopicId: 301614
+dashedName: implement-merge-sort
+---
+
+# --description--
+
+Another common intermediate sorting algorithm 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:
+
+**1)** Recursively split the input array in half until a sub-array with only one element is produced.
+
+**2)** Merge each sorted sub-array together to produce the final sorted array.
+
+Merge sort is an efficient sorting method, with time complexity of *O(nlog(n))*. 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.
+
+**Instructions:** Write a function `mergeSort` 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 `merge`, which is responsible for merging two sorted arrays, and another function, for instance `mergeSort`, which is responsible for the recursion that produces single-item arrays to feed into merge. Good luck!
+
+# --hints--
+
+`mergeSort` should be a function.
+
+```js
+assert(typeof mergeSort == 'function');
+```
+
+`mergeSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    mergeSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`mergeSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`mergeSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  mergeSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function mergeSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function mergeSort(array) {
+  if (array.length === 1) {
+    return array;
+  } else {
+    const splitIndex = Math.floor(array.length / 2);
+    return merge(
+      mergeSort(array.slice(0, splitIndex)),
+      mergeSort(array.slice(splitIndex))
+    );
+  }
+
+  // Merge two sorted arrays
+  function merge(array1, array2) {
+    let merged = [];
+    while (array1.length && array2.length) {
+      if (array1[0] < array2[0]) {
+        merged.push(array1.shift());
+      } else if (array1[0] > array2[0]) {
+        merged.push(array2.shift());
+      } else {
+        merged.push(array1.shift(), array2.shift());
+      }
+    }
+
+    // After looping ends, one array is empty, and other array contains only
+    // values greater than all values in `merged`
+    return [...merged, ...array1, ...array2];
+  }
+}
+
+mergeSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-quick-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-quick-sort.md
new file mode 100644
index 0000000000..53ac770885
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-quick-sort.md
@@ -0,0 +1,142 @@
+---
+id: 587d825a367417b2b2512c89
+title: Implement Quick Sort
+challengeType: 1
+forumTopicId: 301615
+dashedName: 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 *O(nlog(n))* performance on average. It is also relatively easy to implement. These attributes make it a popular and useful sorting method.
+
+**Instructions:** Write a function `quickSort` 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.
+
+# --hints--
+
+`quickSort` should be a function.
+
+```js
+assert(typeof quickSort == 'function');
+```
+
+`quickSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    quickSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`quickSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  quickSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function quickSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function quickSort(array) {
+  if (array.length === 0) {
+    return [];
+  } else {
+    const pivotValue = array[0];
+
+    // Sort elements into three piles
+    let lesser = [];
+    let equal = [];
+    let greater = [];
+    for (let e of array) {
+      if (e < pivotValue) {
+        lesser.push(e);
+      } else if (e > pivotValue) {
+        greater.push(e);
+      } else {
+        equal.push(e);
+      }
+    }
+
+    return [...quickSort(lesser), ...equal, ...quickSort(greater)];
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-selection-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-selection-sort.md
new file mode 100644
index 0000000000..1a1b082090
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/implement-selection-sort.md
@@ -0,0 +1,134 @@
+---
+id: 587d8259367417b2b2512c85
+title: Implement Selection Sort
+challengeType: 1
+forumTopicId: 301616
+dashedName: 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.
+
+**Instructions**: Write a function `selectionSort` which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.
+
+# --hints--
+
+`selectionSort` should be a function.
+
+```js
+assert(typeof selectionSort == 'function');
+```
+
+`selectionSort` should return a sorted array (least to greatest).
+
+```js
+assert(
+  isSorted(
+    selectionSort([
+      1,
+      4,
+      2,
+      8,
+      345,
+      123,
+      43,
+      32,
+      5643,
+      63,
+      123,
+      43,
+      2,
+      55,
+      1,
+      234,
+      92
+    ])
+  )
+);
+```
+
+`selectionSort` should return an array that is unchanged except for order.
+
+```js
+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]
+);
+```
+
+`selectionSort` should not use the built-in `.sort()` method.
+
+```js
+assert(isBuiltInSortUsed());
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+
+function isBuiltInSortUsed(){
+  let sortUsed = false;
+  Array.prototype.sort = () => sortUsed = true;
+  selectionSort([0, 1]);
+  return !sortUsed;
+}
+```
+
+## --seed-contents--
+
+```js
+function selectionSort(array) {
+  // Only change code below this line
+  return array;
+  // Only change code above this line
+}
+
+
+selectionSort([1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]);
+```
+
+# --solutions--
+
+```js
+function selectionSort(array) {
+  for (let i = 0; i < array.length-1; i++) {
+    let minimumIndex = i;
+    for (let j = i+1; j < array.length; j++){
+      if (array[j] < array[minimumIndex]) {
+        minimumIndex = j;
+      }
+    }
+    let value = array[minimumIndex];
+    array[minimumIndex] = array[i];
+    array[i] = value;
+  }
+    return array;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/inventory-update.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/inventory-update.md
new file mode 100644
index 0000000000..e21c765a5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/inventory-update.md
@@ -0,0 +1,228 @@
+---
+id: a56138aff60341a09ed6c480
+title: Inventory Update
+challengeType: 5
+forumTopicId: 16019
+dashedName: inventory-update
+---
+
+# --description--
+
+Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. Update the current existing inventory item quantities (in `arr1`). If an item cannot be found, add the new item and quantity into the inventory array. The returned inventory array should be in alphabetical order by item.
+
+# --hints--
+
+The function `updateInventory` should return an array.
+
+```js
+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']
+    ]
+  )
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return an array with a length of 6.
+
+```js
+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
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return `[[88, "Bowling Ball"], [2, "Dirty Sock"], [3, "Hair Pin"], [3, "Half-Eaten Apple"], [5, "Microphone"], [7, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]], [])` should return `[[21, "Bowling Ball"], [2, "Dirty Sock"], [1, "Hair Pin"], [5, "Microphone"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([], [[2, "Hair Pin"], [3, "Half-Eaten Apple"], [67, "Bowling Ball"], [7, "Toothpaste"]])` should return `[[67, "Bowling Ball"], [2, "Hair Pin"], [3, "Half-Eaten Apple"], [7, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+`updateInventory([[0, "Bowling Ball"], [0, "Dirty Sock"], [0, "Hair Pin"], [0, "Microphone"]], [[1, "Hair Pin"], [1, "Half-Eaten Apple"], [1, "Bowling Ball"], [1, "Toothpaste"]])` should return `[[1, "Bowling Ball"], [0, "Dirty Sock"], [1, "Hair Pin"], [1, "Half-Eaten Apple"], [0, "Microphone"], [1, "Toothpaste"]]`.
+
+```js
+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']
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function updateInventory(arr1, arr2) {
+    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--
+
+```js
+function updateInventory(arr1, arr2) {
+  arr2.forEach(function(item) {
+    createOrUpdate(arr1, item);
+  });
+  // All inventory must be accounted for or you're fired!
+  return arr1;
+}
+
+function createOrUpdate(arr1, item) {
+  var index = -1;
+  while (++index < arr1.length) {
+    if (arr1[index][1] === item[1]) {
+      arr1[index][0] += item[0];
+      return;
+    }
+    if (arr1[index][1] > item[1]) {
+      break;
+    }
+  }
+  arr1.splice(index, 0, item);
+}
+
+// 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);
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/no-repeats-please.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/no-repeats-please.md
new file mode 100644
index 0000000000..7fc964e03f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/no-repeats-please.md
@@ -0,0 +1,126 @@
+---
+id: a7bf700cd123b9a54eef01d5
+title: No Repeats Please
+challengeType: 5
+forumTopicId: 16037
+dashedName: 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, `aab` should return 2 because it has 6 total permutations (`aab`, `aab`, `aba`, `aba`, `baa`, `baa`), but only 2 of them (`aba` and `aba`) don't have the same letter (in this case `a`) repeating.
+
+# --hints--
+
+`permAlone("aab")` should return a number.
+
+```js
+assert.isNumber(permAlone('aab'));
+```
+
+`permAlone("aab")` should return 2.
+
+```js
+assert.strictEqual(permAlone('aab'), 2);
+```
+
+`permAlone("aaa")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaa'), 0);
+```
+
+`permAlone("aabb")` should return 8.
+
+```js
+assert.strictEqual(permAlone('aabb'), 8);
+```
+
+`permAlone("abcdefa")` should return 3600.
+
+```js
+assert.strictEqual(permAlone('abcdefa'), 3600);
+```
+
+`permAlone("abfdefa")` should return 2640.
+
+```js
+assert.strictEqual(permAlone('abfdefa'), 2640);
+```
+
+`permAlone("zzzzzzzz")` should return 0.
+
+```js
+assert.strictEqual(permAlone('zzzzzzzz'), 0);
+```
+
+`permAlone("a")` should return 1.
+
+```js
+assert.strictEqual(permAlone('a'), 1);
+```
+
+`permAlone("aaab")` should return 0.
+
+```js
+assert.strictEqual(permAlone('aaab'), 0);
+```
+
+`permAlone("aaabb")` should return 12.
+
+```js
+assert.strictEqual(permAlone('aaabb'), 12);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permAlone(str) {
+  return str;
+}
+
+permAlone('aab');
+```
+
+# --solutions--
+
+```js
+function permAlone(str) {
+  return permuter(str).filter(function(perm) {
+    return !perm.match(/(.)\1/g);
+  }).length;
+}
+
+function permuter(str) {
+  // http://staff.roguecc.edu/JMiller/JavaScript/permute.html
+  //permArr: Global array which holds the list of permutations
+  //usedChars: Global utility array which holds a list of "currently-in-use" characters
+  var permArr = [], usedChars = [];
+  function permute(input) {
+    //convert input into a char array (one element for each character)
+    var i, ch, chars = input.split("");
+    for (i = 0; i < chars.length; i++) {
+      //get and remove character at index "i" from char array
+      ch = chars.splice(i, 1);
+      //add removed character to the end of used characters
+      usedChars.push(ch);
+      //when there are no more characters left in char array to add, add used chars to list of permutations
+      if (chars.length === 0) permArr[permArr.length] = usedChars.join("");
+      //send characters (minus the removed one from above) from char array to be permuted
+      permute(chars.join(""));
+      //add removed character back into char array in original position
+      chars.splice(i, 0, ch);
+      //remove the last character used off the end of used characters array
+      usedChars.pop();
+    }
+  }
+  permute(str);
+  return permArr;
+}
+
+permAlone('aab');
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/pairwise.md b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/pairwise.md
new file mode 100644
index 0000000000..215b2fda0a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/algorithms/pairwise.md
@@ -0,0 +1,100 @@
+---
+id: a3f503de51cfab748ff001aa
+title: Pairwise
+challengeType: 5
+forumTopicId: 301617
+dashedName: pairwise
+---
+
+# --description--
+
+Given an array `arr`, find element pairs whose sum equal the second argument `arg` 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 instance, `pairwise([1, 1, 2], 3)` creates a pair `[2, 1]` using the 1 at index 0 rather than the 1 at index 1, because 0+2 &lt; 1+2.
+
+For example `pairwise([7, 9, 11, 13, 15], 20)` returns `6`. The pairs that sum to 20 are `[7, 13]` and `[9, 11]`. We can then write out the array with their indices and values.
+
+<div style='margin-left: 2em;'>
+
+| Index | 0 | 1 | 2  | 3  | 4  |
+| ----- | - | - | -- | -- | -- |
+| Value | 7 | 9 | 11 | 13 | 15 |
+
+</div>
+
+Below we'll take their corresponding indices and add them.
+
+<div style='margin-left: 2em;'>
+
+7 + 13 = 20 → Indices 0 + 3 = 3  
+9 + 11 = 20 → Indices 1 + 2 = 3  
+3 + 3 = 6 → Return `6`
+
+</div>
+
+# --hints--
+
+`pairwise([1, 4, 2, 3, 0, 5], 7)` should return 11.
+
+```js
+assert.deepEqual(pairwise([1, 4, 2, 3, 0, 5], 7), 11);
+```
+
+`pairwise([1, 3, 2, 4], 4)` should return 1.
+
+```js
+assert.deepEqual(pairwise([1, 3, 2, 4], 4), 1);
+```
+
+`pairwise([1, 1, 1], 2)` should return 1.
+
+```js
+assert.deepEqual(pairwise([1, 1, 1], 2), 1);
+```
+
+`pairwise([0, 0, 0, 0, 1, 1], 1)` should return 10.
+
+```js
+assert.deepEqual(pairwise([0, 0, 0, 0, 1, 1], 1), 10);
+```
+
+`pairwise([], 100)` should return 0.
+
+```js
+assert.deepEqual(pairwise([], 100), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pairwise(arr, arg) {
+  return arg;
+}
+
+pairwise([1,4,2,3,0,5], 7);
+```
+
+# --solutions--
+
+```js
+function pairwise(arr, arg) {
+  var sum = 0;
+  arr.forEach(function(e, i, a) {
+    if (e != null) {
+      var diff = arg-e;
+      a[i] = null;
+      var dix = a.indexOf(diff);
+      if (dix !== -1) {
+        sum += dix;
+        sum += i;
+        a[dix] = null;
+      }
+    }
+  });
+  return sum;
+}
+
+pairwise([1,4,2,3,0,5], 7);
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
new file mode 100644
index 0000000000..35a51fab5f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.md
@@ -0,0 +1,191 @@
+---
+id: 587d8257367417b2b2512c7b
+title: Add a New Element to a Binary Search Tree
+challengeType: 1
+forumTopicId: 301618
+dashedName: add-a-new-element-to-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 respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better:
+
+<div style='width: 100%; display: flex; justify-content: center; align-items: center;'><img style='width: 100%; max-width: 350px; background-color: var(--gray-05);' src='https://user-images.githubusercontent.com/18563015/32136009-1e665d98-bbd6-11e7-9133-63184f9f9182.png'></div>
+
+Now this ordered relationship is very easy to see. Note that every value to the left of 8, the root node, is less than 8, and every value to the right is greater than 8. Also notice that this relationship applies to each of the subtrees as well. For example, the first left child is a subtree. 3 is the parent node, and it has exactly two child nodes — by the rules governing binary search trees, we know without even looking that the left child of this node (and any of its children) will be less than 3, and the right child (and any of its children) will be greater than 3 (but also less than the structure's root value), and so on.
+
+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, you 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `add`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The add method should add elements according to the binary search tree rules.
+
+```js
+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);
+    const expectedResult = [1, 4, 7, 8, 34, 45, 73, 87];
+    const result = test.inOrder();
+    return expectedResult.toString() === result.toString();
+  })()
+);
+```
+
+Adding an element that already exists should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    inOrder() {
+      if (!this.root) {
+        return null;
+      }
+      var result = new Array();
+      function traverseInOrder(node) {
+        node.left && traverseInOrder(node.left);
+        result.push(node.value);
+        node.right && traverseInOrder(node.right);
+      }
+      traverseInOrder(this.root);
+      return result;
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function Node(value) {
+  this.value = value;
+  this.left = null;
+  this.right = null;
+}
+function BinarySearchTree() {
+  this.root = null;
+  this.add = function(element) {
+    let current = this.root;
+    if (!current) {
+      this.root = new Node(element);
+      return;
+    } else {
+      const searchTree = function(current) {
+        if (current.value > element) {
+          if (current.left) {
+            return searchTree(current.left);
+          } else {
+            current.left = new Node(element);
+            return;
+          }
+        } else if (current.value < element) {
+          if (current.right) {
+            return searchTree(current.right);
+          } else {
+            current.right = new Node(element);
+            return;
+          }
+        } else {
+          return null;
+        }
+      };
+      return searchTree(current);
+    }
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
new file mode 100644
index 0000000000..3ca9c8c0f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.md
@@ -0,0 +1,161 @@
+---
+id: 587d8252367417b2b2512c67
+title: Add Elements at a Specific Index in a Linked List
+challengeType: 1
+forumTopicId: 301619
+dashedName: 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 could not be added. **Note:** Remember to check if the given index is a negative or is longer than the length of the linked list.
+
+# --hints--
+
+Your `addAt` method should reassign `head` to the new node when the given index is 0.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.addAt(0, 'cat');
+    return test.head().element === 'cat';
+  })()
+);
+```
+
+Your `addAt` method should increase the length of the linked list by one for each new node added to the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.addAt(0, 'cat');
+    return test.size() === 3;
+  })()
+);
+```
+
+Your `addAt` method should return `false` if a node was unable to be added.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.addAt(4, 'cat') === false;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+    length++;
+  };
+
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+    length++;
+  };
+  this.addAt = function (index, element) {
+    if (index > length || index < 0) {
+      return false;
+    }
+    var newNode = new Node(element);
+    var currentNode = head;
+    if (index === 0) {
+      head = newNode;
+    } else {
+      var previousNode = null;
+      var i = 0;
+      while (currentNode && i < index) {
+        previousNode = currentNode;
+        currentNode = currentNode.next;
+        i++;
+      }
+      previousNode.next = newNode;
+    }
+    newNode.next = currentNode;
+    length++;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-list.md
new file mode 100644
index 0000000000..72868a02d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-list.md
@@ -0,0 +1,91 @@
+---
+id: 587d8256367417b2b2512c77
+title: Adjacency List
+challengeType: 1
+forumTopicId: 301620
+dashedName: 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 `Node1` is connected to `Node2` and `Node3`, and that information is consistent with the connections `Node2` and `Node3` show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then `Node2: Node1` would mean there the directed edge is pointing from `Node2` towards `Node1`. We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.
+
+```js
+var undirectedG = {
+  Node1: ["Node2", "Node3"],
+  Node2: ["Node1"],
+  Node3: ["Node1"]
+};
+```
+
+This can also be more simply represented as an array where the nodes just have numbers rather than string labels.
+
+```js
+var undirectedGArr = [
+  [1, 2], // Node1
+  [0],    // Node2
+  [0]     // Node3
+];
+```
+
+# --instructions--
+
+Create a social network as an undirected graph with 4 nodes/people named `James`, `Jill`, `Jenny`, and `Jeff`. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny.
+
+# --hints--
+
+`undirectedAdjList` should only contain four nodes.
+
+```js
+assert(Object.keys(undirectedAdjList).length === 4);
+```
+
+There should be an edge between `Jeff` and `James`.
+
+```js
+assert(
+  undirectedAdjList.James.indexOf('Jeff') !== -1 &&
+    undirectedAdjList.Jeff.indexOf('James') !== -1
+);
+```
+
+There should be an edge between `Jill` and `Jenny`.
+
+```js
+assert(
+  undirectedAdjList.Jill.indexOf('Jenny') !== -1 &&
+    undirectedAdjList.Jill.indexOf('Jenny') !== -1
+);
+```
+
+There should be an edge between `Jeff` and `Jenny`.
+
+```js
+assert(
+  undirectedAdjList.Jeff.indexOf('Jenny') !== -1 &&
+    undirectedAdjList.Jenny.indexOf('Jeff') !== -1
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var undirectedAdjList = {};
+```
+
+# --solutions--
+
+```js
+var undirectedAdjList = {
+  James: ['Jeff'],
+  Jill: ['Jenny'],
+  Jenny: ['Jill', 'Jeff'],
+  Jeff: ['James', 'Jenny']
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-matrix.md
new file mode 100644
index 0000000000..a852fb9b08
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/adjacency-matrix.md
@@ -0,0 +1,108 @@
+---
+id: 587d8256367417b2b2512c78
+title: Adjacency Matrix
+challengeType: 1
+forumTopicId: 301621
+dashedName: 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.
+
+**Note**: The numbers to the top and left of the matrix are just labels for the nodes. Inside the matrix, ones mean there exists an edge between the vertices (nodes) representing the row and column. Finally, zeros mean there is no edge or relationship.
+
+<pre>
+    1 2 3
+  \------
+1 | 0 1 1
+2 | 1 0 0
+3 | 1 0 0
+</pre>
+
+Above is a very simple, undirected graph where you have three nodes, where the first node is connected to the second and third node. Below is a JavaScript implementation of the same thing.
+
+```js
+var adjMat = [
+  [0, 1, 1],
+  [1, 0, 0],
+  [1, 0, 0]
+];
+```
+
+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.
+
+```js
+var adjMatDirected = [
+  [0, 1, 0],
+  [0, 0, 1],
+  [0, 0, 0]
+];
+```
+
+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 (`0` or `1`). You can have different weights depending on your application.
+
+# --instructions--
+
+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.
+
+# --hints--
+
+`undirectedAdjList` should only contain five nodes.
+
+```js
+assert(
+  adjMatUndirected.length === 5 &&
+    adjMatUndirected
+      .map(function (x) {
+        return x.length === 5;
+      })
+      .reduce(function (a, b) {
+        return a && b;
+      })
+);
+```
+
+There should be an edge between the first and fourth node.
+
+```js
+assert(adjMatUndirected[0][3] === 1 && adjMatUndirected[3][0] === 1);
+```
+
+There should be an edge between the first and third node.
+
+```js
+assert(adjMatUndirected[0][2] === 1 && adjMatUndirected[2][0] === 1);
+```
+
+There should be an edge between the third and fifth node.
+
+```js
+assert(adjMatUndirected[2][4] === 1 && adjMatUndirected[4][2] === 1);
+```
+
+There should be an edge between the fourth and fifth node.
+
+```js
+assert(adjMatUndirected[3][4] === 1 && adjMatUndirected[4][3] === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var adjMatUndirected = [];
+```
+
+# --solutions--
+
+```js
+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]
+];
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/breadth-first-search.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/breadth-first-search.md
new file mode 100644
index 0000000000..1207024135
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/breadth-first-search.md
@@ -0,0 +1,182 @@
+---
+id: 587d825c367417b2b2512c90
+title: Breadth-First Search
+challengeType: 1
+forumTopicId: 301622
+dashedName: 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 and visits all its neighbors that are one edge away. It then goes on to visit each of their neighbors and so on until all nodes have been reached.
+
+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.
+
+Visually, this is what the algorithm is doing. ![Breadth first search algorithm moving through a tree](https://camo.githubusercontent.com/2f57e6239884a1a03402912f13c49555dec76d06/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f342f34362f416e696d617465645f4246532e676966)
+
+The grey shading represents a node getting added into the queue and the black shading represents a node getting removed from the queue. See how every time a node gets removed from the queue (node turns black), all their neighbors get added into the queue (node turns grey).
+
+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, or number of edges away from, the start node. You'll want to start all your distances with some large number, like `Infinity`. This prevents counting issues for when 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.
+
+# --instructions--
+
+Write a function `bfs()` 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 `0` and `n - 1`, where `n` 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 `Infinity`.
+
+# --hints--
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return `{0: 1, 1: 0, 2: 1, 3: 2}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `1` should return `{0: 1, 1: 0, 2: 1, 3: Infinity}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return `{0: 0, 1: 1, 2: 2, 3: 3}`
+
+```js
+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 });
+  })()
+);
+```
+
+The input graph `[[0, 1], [1, 0]]` with a start node of `0` should return `{0: 0, 1: 1}`
+
+```js
+assert(
+  (function () {
+    var graph = [
+      [0, 1],
+      [1, 0]
+    ];
+    var results = bfs(graph, 0);
+    return isEquivalent(results, { 0: 0, 1: 1 });
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+// 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;
+}
+```
+
+## --seed-contents--
+
+```js
+function bfs(graph, root) {
+  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));
+```
+
+# --solutions--
+
+```js
+function bfs(graph, root) {
+  var nodesLen = {};
+  // Set all distances to infinity
+  for (var i = 0; i < graph.length; i++) {
+    nodesLen[i] = Infinity;
+  }
+  nodesLen[root] = 0; // ...except root node
+  var queue = [root]; // Keep track of nodes to visit
+  var current; // Current node traversing
+  // Keep on going until no more nodes to traverse
+  while (queue.length !== 0) {
+    current = queue.shift();
+    // Get adjacent nodes from current node
+    var curConnected = graph[current]; // Get layer of edges from current
+    var neighborIdx = []; // List of nodes with edges
+    var idx = curConnected.indexOf(1); // Get first edge connection
+    while (idx !== -1) {
+      neighborIdx.push(idx); // Add to list of neighbors
+      idx = curConnected.indexOf(1, idx + 1); // Keep on searching
+    }
+    // Loop through neighbors and get lengths
+    for (var j = 0; j < neighborIdx.length; j++) {
+      // Increment distance for nodes traversed
+      if (nodesLen[neighborIdx[j]] === Infinity) {
+        nodesLen[neighborIdx[j]] = nodesLen[current] + 1;
+        queue.push(neighborIdx[j]); // Add new neighbors to queue
+      }
+    }
+  }
+  return nodesLen;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..e45bd5a51a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.md
@@ -0,0 +1,175 @@
+---
+id: 587d8257367417b2b2512c7c
+title: Check if an Element is Present in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301623
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `isPresent`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.isPresent == 'function';
+  })()
+);
+```
+
+The `isPresent` method should correctly check for the presence or absence of elements added to the tree.
+
+```js
+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)
+    );
+  })()
+);
+```
+
+`isPresent` should handle cases where the tree is empty.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.isPresent = function (value) {
+    var current = this.root
+    while (current) {
+      if (value === current.value) {
+        return true;
+      }
+      current = value < current.value ? current.left : current.right;
+    }
+    return false;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
new file mode 100644
index 0000000000..ddaf38f231
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/check-if-binary-search-tree.md
@@ -0,0 +1,136 @@
+---
+id: 5cc0c1b32479e176caf3b422
+title: Check if Tree is Binary Search Tree
+challengeType: 1
+forumTopicId: 301624
+dashedName: check-if-tree-is-binary-search-tree
+---
+
+# --description--
+
+Since you already know what a binary search tree is, this challenge will establish how it is you can tell that a tree is a binary search tree or not.
+
+The main distinction of a binary search tree is that the nodes are ordered in an organized fashion. Nodes have at most 2 child nodes (placed to the right and/or left) based on if the child node's value is greater than or equal to (right) or less than (left) the parent node.
+
+# --instructions--
+
+In this challenge, you will create a utility for your tree. Write a JavaScript method `isBinarySearchTree` which takes a tree as an input and returns a boolean value for whether the tree is a binary search tree or not. Use recursion whenever possible.
+
+# --hints--
+
+Your Binary Search Tree should return true when checked with `isBinarySearchTree()`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    test.push(1);
+    test.push(5);
+    test.push(3);
+    test.push(2);
+    test.push(4);
+    return isBinarySearchTree(test) == true;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype.push = function(val) {
+  var root = this.root;
+
+  if (!root) {
+    this.root = new Node(val);
+    return;
+  }
+
+  var currentNode = root;
+  var newNode = new Node(val);
+
+  while (currentNode) {
+    if (val < currentNode.value) {
+      if (!currentNode.left) {
+        currentNode.left = newNode;
+        break;
+      } else {
+        currentNode = currentNode.left;
+      }
+    } else {
+      if (!currentNode.right) {
+        currentNode.right = newNode;
+        break;
+      } else {
+        currentNode = currentNode.right;
+      }
+    }
+  }
+};
+```
+
+## --seed-contents--
+
+```js
+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;
+}
+function isBinarySearchTree(tree) {
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+}
+function isBinarySearchTree(tree) {
+  if (tree.root == null) {
+    return null;
+  } else {
+    let isBST = true;
+    function checkTree(node) {
+      if (node.left != null) {
+        const left = node.left;
+        if (left.value > node.value) {
+          isBST = false;
+        } else {
+          checkTree(left);
+        }
+      }
+      if (node.right != null) {
+        const right = node.right;
+        if (right.value < node.value) {
+          isBST = false;
+        } else {
+          checkTree(right);
+        }
+      }
+    }
+    checkTree(tree.root);
+    return isBST;
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-circular-queue.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
new file mode 100644
index 0000000000..16ff688fab
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-circular-queue.md
@@ -0,0 +1,235 @@
+---
+id: 587d8255367417b2b2512c75
+title: Create a Circular Queue
+challengeType: 1
+forumTopicId: 301625
+dashedName: create-a-circular-queue
+---
+
+# --description--
+
+In this challenge you will be creating a Circular Queue. A circular queue is a queue that writes to the end of a collection then begins overwriting itself at the beginning of the collection. This type of data structure is useful in certain situations. For example, a circular queue can be used for streaming media. Once the queue is full, new media data will overwrite old data.
+
+A good way to illustrate this concept is with an array of length `5`:
+
+```js
+[null, null, null, null, null]
+ ^Read @ 0
+ ^Write @ 0
+```
+
+Here the read and write are both at position `0`. Now the queue gets 3 new records `a`, `b`, and `c`. Our queue now looks like:
+
+```js
+[a, b, c, null, null]
+ ^Read @ 0
+          ^Write @ 3
+```
+
+As the read head reads, it can remove values or keep them:
+
+```js
+[null, null, null, null, null]
+                   ^Read @ 3
+                   ^Write @ 3
+```
+
+Now we write the values `d`, `e`, and `f` to the queue. Once the write reaches the end of the array it loops back to the beginning:
+
+```js
+[f, null, null, d, e]
+                ^Read @ 3
+    ^Write @ 1
+```
+
+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 `enqueue` and `dequeue` methods which allow you to read from and write to the queue. The class itself should also accept an integer argument which you can use to specify the size of the queue when created. 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. The `enqueue` method should return the item you enqueued if it is successful; otherwise it will return `null`.
+
+Likewise, the read pointer should advance forward as you dequeue items. When you dequeue an item, that item should be returned. If you cannot dequeue an item, you should return `null`.
+
+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.
+
+# --hints--
+
+The `enqueue` method should add items to the circular queue.
+
+```js
+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;
+  })()
+);
+```
+
+You should not enqueue items past the read pointer.
+
+```js
+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;
+  })()
+);
+```
+
+The `dequeue` method should dequeue items from the queue.
+
+```js
+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
+    );
+  })()
+);
+```
+
+After an item is dequeued, its position in the queue should be reset to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+Trying to dequeue past the write pointer should return `null` and does not advance the write pointer.
+
+```js
+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
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+  }
+}
+```
+
+# --solutions--
+
+```js
+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
+    console.log(this.write, this.max);
+    if (this.queue[this.write] === null) {
+      this.queue[this.write++] = item;
+
+      if (this.write > this.max) {
+        this.write = 0;
+      }
+      return item;
+    }
+    return null;
+    // Only change code above this line
+  }
+
+  dequeue() {
+    // Only change code below this line
+    if (this.queue[this.read] !== null) {
+      let item = this.queue[this.read];
+      this.queue[this.read++] = null;
+      if (this.read > this.max) {
+        this.read = 0;
+      }
+      return item;
+    }
+    return null;
+    // Only change code above this line
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
new file mode 100644
index 0000000000..8e727deba5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-doubly-linked-list.md
@@ -0,0 +1,216 @@
+---
+id: 587d825a367417b2b2512c87
+title: Create a Doubly Linked List
+challengeType: 1
+forumTopicId: 301626
+dashedName: 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.
+
+# --instructions--
+
+We've provided a `Node` object and started our `DoublyLinkedList`. Let's add two methods to our doubly linked list called `add` and `remove`. The `add` method should add the given element to the list while the `remove` 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 `null`.
+
+# --hints--
+
+The DoublyLinkedList data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called add.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.add == undefined) {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.remove == undefined) {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Removing an item from an empty list should return null.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return test.remove(100) == null;
+  })()
+);
+```
+
+The add method should add items to the list.
+
+```js
+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';
+  })()
+);
+```
+
+Each node should keep track of the previous node.
+
+```js
+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';
+  })()
+);
+```
+
+The first item should be removable from the list.
+
+```js
+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';
+  })()
+);
+```
+
+The last item should be removable from the list.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+DoublyLinkedList.prototype = Object.assign(
+  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;
+    };
+  }
+});
+```
+
+## --seed-contents--
+
+```js
+var Node = function(data, prev) {
+  this.data = data;
+  this.prev = prev;
+  this.next = null;
+};
+var DoublyLinkedList = function() {
+  this.head = null;
+  this.tail = null;
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-hash-table.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-hash-table.md
new file mode 100644
index 0000000000..05f5c099bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-hash-table.md
@@ -0,0 +1,260 @@
+---
+id: 587d825b367417b2b2512c8e
+title: Create a Hash Table
+challengeType: 1
+forumTopicId: 301627
+dashedName: 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(1) 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!
+
+**Note:** The `remove` method tests won't pass until the `add` and `lookup` methods are correctly implemented.
+
+# --hints--
+
+The HashTable data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test === 'object';
+  })()
+);
+```
+
+The HashTable should have an add method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+The HashTable should have a lookup method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.lookup === 'function';
+  })()
+);
+```
+
+The HashTable should have a remove method.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+The add method should add key value pairs and the lookup method should return the values associated with a given key.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+    return test.lookup('key') === 'value';
+  })()
+);
+```
+
+The remove method should accept a key as input and should remove the associated key value pair.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    var hashValue = hash('key');
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+
+    test.remove('key');
+    return !test.collection.hasOwnProperty(hashValue);
+  })()
+);
+```
+
+The remove method should only remove the correct key value pair.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    var hashValue = hash('key');
+    if (typeof HashTable !== 'undefined') {
+      test = new HashTable();
+    }
+    test.add('key', 'value');
+    test.add('yek', 'value');
+    test.add('altKey', 'value');
+
+    test.remove('yek');
+    if (test.lookup('yek') || !test.lookup('key') || !test.lookup('altKey')) {
+      return false;
+    }
+
+    test.remove('key');
+
+    return !test.collection.hasOwnProperty(hashValue) && test.lookup('altKey');
+  })()
+);
+```
+
+Items should be added using the hash function.
+
+```js
+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 && called % 3 === 0;
+  })()
+);
+```
+
+The hash table should handle collisions.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+var called = 0;
+var hash = string => {
+  called++;
+  var hash = 0;
+  for (var i = 0; i < string.length; i++) {
+    hash += string.charCodeAt(i);
+  }
+  return hash;
+};
+```
+
+## --seed-contents--
+
+```js
+var called = 0;
+var hash = string => {
+  called++;
+  var hashed = 0;
+  for (var i = 0; i < string.length; i++) {
+    hashed += string.charCodeAt(i);
+  }
+  return hashed;
+};
+var HashTable = function() {
+  this.collection = {};
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+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 = {};
+  // Only change code below this line
+
+  this.add = function(key, val) {
+    var theHash = hash(key);
+    if (!this.collection.hasOwnProperty(theHash)) {
+      this.collection[theHash] = {};
+    }
+    this.collection[theHash][key] = val;
+  }
+
+  this.remove = function(key) {
+    var theHash = hash(key);
+    var hashedObj = this.collection[theHash];
+    if (hashedObj.hasOwnProperty(key)) {
+      delete hashedObj[key];
+    }
+    if (!Object.keys(hashedObj).length) {
+      delete this.collection[theHash];
+    }
+  }
+
+  this.lookup = function(key) {
+    var theHash = hash(key);
+    if (this.collection.hasOwnProperty(theHash)) {
+      return this.collection[theHash][key];
+    }
+    return null
+  }
+  // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
new file mode 100644
index 0000000000..0c768cf0a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-linked-list-class.md
@@ -0,0 +1,145 @@
+---
+id: 587d8251367417b2b2512c62
+title: Create a Linked List Class
+challengeType: 1
+forumTopicId: 301628
+dashedName: create-a-linked-list-class
+---
+
+# --description--
+
+Let's create a `linked list` class. Every linked list should start out with a few basic properties: a `head` (the first item in your list) and a `length` (number of items in your list). Sometimes you'll see implementations of linked lists that incorporate a `tail` 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 `length` 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 `add` method.
+
+If our list is empty, adding an element to our linked list is straightforward enough: we just wrap that element in a `Node` class, and we assign that node to the `head` 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 `next` property. To add a node to the list, find the last node in the list, and point that last node's `next` property at our new node. (Hint: you know you've reached the end of a linked list when a node's `next` property is `null`.)
+
+# --instructions--
+
+Write an add method that assigns the first node you push to the linked list to the `head`; after that, whenever adding a node, every node should be referenced by the previous node's `next` property.
+
+Note
+
+Your list's `length` should increase by one every time an element is added to the linked list.
+
+# --hints--
+
+Your `LinkedList` class should have a `add` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+Your `LinkedList` class should assign `head` to the first node added.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    return test.head().element === 'cat';
+  })()
+);
+```
+
+The previous `node` in your `LinkedList` class should have reference to the newest node created.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.head().next.element === 'dog';
+  })()
+);
+```
+
+The  `size` of your `LinkedList` class should equal the amount of nodes in the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    return test.size() === 2;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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
+  };
+}
+```
+
+# --solutions--
+
+```js
+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
+    if (head == null) {
+      head = new Node(element);
+    } 
+    else {
+      let currentNode = head;
+      while (currentNode.next != null) {
+        // currentNode.next will be last node of linked list after loop
+        currentNode = currentNode.next;
+      }
+      currentNode.next = new Node(element);
+    }
+    length++;
+    // Only change code above this line
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
new file mode 100644
index 0000000000..ac3d5754d0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-map-data-structure.md
@@ -0,0 +1,204 @@
+---
+id: 8d5823c8c441eddfaeb5bdef
+title: Create a Map Data Structure
+challengeType: 1
+forumTopicId: 301629
+dashedName: create-a-map-data-structure
+---
+
+# --description--
+
+The next few challenges will cover maps and hash tables. Maps are data structures 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 `Map` object provided here as a wrapper around a JavaScript `object`. Create the following methods and operations on the Map object:
+
+<ul>
+<li><code>add</code> accepts a <code>key, value</code> pair to add to the map.</li>
+<li><code>remove</code> accepts a key and removes the associated <code>key, value</code> pair</li>
+<li><code>get</code> accepts a <code>key</code> and returns the stored <code>value</code></li>
+<li><code>has</code> accepts a <code>key</code> and returns <dfn>true</dfn> if the key exists or <dfn>false</dfn> if it doesn't.</li>
+<li><code>values</code> returns an array of all the values in the map</li>
+<li><code>size</code> returns the number of items in the map</li>
+<li><code>clear</code> empties the map</li>
+</ul>
+
+# --hints--
+
+The Map data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The Map object should have the following methods: add, remove, get, has, values, clear, and size.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+The add method should add items to the map.
+
+```js
+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() == 2;
+  })()
+);
+```
+
+The has method should return true for added items and false for absent items.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    test.add('test', 'value');
+    return test.has('test') && !test.has('false');
+  })()
+);
+```
+
+The get method should accept keys as input and should return the associated values.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof Map !== 'undefined') {
+      test = new Map();
+    }
+    test.add('abc', 'def');
+    return test.get('abc') == 'def';
+  })()
+);
+```
+
+The values method should return all the values stored in the map as strings in an array.
+
+```js
+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
+    );
+  })()
+);
+```
+
+The clear method should empty the map and the size method should return the number of items present in the map.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var Map = function() {
+  this.collection = {};
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+var Map = function() {
+    this.collection = {};
+    // Only change code below this line
+
+    this.add = function(key,value) {
+      this.collection[key] = value;
+    }
+
+    this.remove = function(key) {
+      delete this.collection[key];
+    }
+
+    this.get = function(key) {
+      return this.collection[key];
+    }
+
+    this.has = function(key) {
+      return this.collection.hasOwnProperty(key)
+    }
+
+    this.values = function() {
+      return Object.values(this.collection);
+    }
+
+    this.size = function() {
+      return Object.keys(this.collection).length;
+    }
+
+    this.clear = function() {
+      for(let item of Object.keys(this.collection)) {
+        delete this.collection[item];
+      }
+    }
+    // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
new file mode 100644
index 0000000000..c381e3940b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-priority-queue-class.md
@@ -0,0 +1,231 @@
+---
+id: 587d8255367417b2b2512c74
+title: Create a Priority Queue Class
+challengeType: 1
+forumTopicId: 301630
+dashedName: 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:
+
+```js
+[['kitten', 2], ['dog', 2], ['rabbit', 2]]
+```
+
+Here the second value (an integer) represents item priority. If we enqueue `['human', 1]` with a priority of `1` (assuming lower priorities are given precedence) it would then be the first item to be dequeued. The collection would look like this:
+
+```js
+[['human', 1], ['kitten', 2], ['dog', 2], ['rabbit', 2]]
+```
+
+We’ve started writing a `PriorityQueue` in the code editor. You will need to add an `enqueue` method for adding items with a priority, a `dequeue` method for removing and returning items, a `size` method to return the number of items in the queue, a `front` method to return the element at the front of the queue, and finally an `isEmpty` method that will return `true` if the queue is empty or `false` if it is not.
+
+The `enqueue` should accept items with the format shown above (`['human', 1]`) where `1` represents the priority. `dequeue` and `front` should return only the item's name, not its priority.
+
+# --hints--
+
+Your `PriorityQueue` class should have a `enqueue` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.enqueue === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `dequeue` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.dequeue === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have a `front` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.front === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `PriorityQueue` class should correctly keep track of the current number of items using the `size` method as items are enqueued and dequeued.
+
+```js
+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;
+  })()
+);
+```
+
+The `front` method should return the correct item at the front of the queue as items are enqueued and dequeued.
+
+```js
+assert(
+  (function () {
+    var test = new PriorityQueue();
+    test.enqueue(['David Brown', 2]);
+    var front1 = test.front();
+    test.enqueue(['Jon Snow', 1]);
+    var front2 = test.front();
+    test.dequeue();
+    test.enqueue(['A', 3]);
+    var front3 = test.front();
+    test.enqueue(['B', 3]);
+    test.enqueue(['C', 3]);
+    test.dequeue();
+    var front4 = test.front();
+    return (
+      front1 === 'David Brown' &&
+      front2 === 'Jon Snow' &&
+      front3 === 'David Brown' &&
+      front4 === 'A'
+    );
+  })()
+);
+```
+
+The `isEmpty` method should return `true` when the queue is empty.
+
+```js
+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();
+  })()
+);
+```
+
+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.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function PriorityQueue () {
+  this.collection = [];
+  this.printCollection = function() {
+    console.log(this.collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function PriorityQueue() {
+  this.collection = [];
+  this.printCollection = function () {
+    console.log(this.collection);
+  };
+  // Only change code below this line
+  this.enqueue = function (newitem) {
+    if (this.isEmpty()) {
+      return this.collection.push(newitem);
+    }
+
+    this.collection = this.collection.reverse();
+    var found_index = this.collection.findIndex(function (item) {
+      return newitem[1] >= item[1];
+    });
+    if (found_index === -1) {
+      this.collection.push(newitem);
+    } else {
+      this.collection.splice(found_index, 0, newitem);
+    }
+    this.collection = this.collection.reverse();
+  };
+  this.dequeue = function () {
+    if (!this.isEmpty()) {
+      return this.collection.shift()[0];
+    } else {
+      return "The queue is empty.";
+    }
+  };
+  this.size = function () {
+    return this.collection.length;
+  };
+  this.front = function () {
+    return this.collection[0][0];
+  };
+  this.isEmpty = function () {
+    return this.size() > 0 ? false : true;
+  };
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-queue-class.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-queue-class.md
new file mode 100644
index 0000000000..306b90e0c0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-queue-class.md
@@ -0,0 +1,174 @@
+---
+id: 587d8250367417b2b2512c60
+title: Create a Queue Class
+challengeType: 1
+forumTopicId: 301631
+dashedName: 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.
+
+# --hints--
+
+Your `Queue` class should have a `enqueue` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.enqueue === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `dequeue` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.dequeue === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `front` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.front === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+Your `Queue` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+The `dequeue` method should remove and return the front element of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    test.enqueue('John');
+    return test.dequeue() === 'Smith';
+  })()
+);
+```
+
+The `front` method should return value of the front element of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    test.enqueue('John');
+    return test.front() === 'Smith';
+  })()
+);
+```
+
+The `size` method should return the length of the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    return test.size() === 1;
+  })()
+);
+```
+
+The `isEmpty` method should return `false` if there are elements in the queue
+
+```js
+assert(
+  (function () {
+    var test = new Queue();
+    test.enqueue('Smith');
+    return !test.isEmpty();
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Queue() {
+  var collection = [];
+  this.print = function() {
+    console.log(collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function Queue () { 
+    var collection = [];
+    this.print = function() {
+        console.log(collection);
+    };
+    // Only change code below this line
+    this.enqueue = function(item) {
+        collection.push(item);
+    }
+
+    this.dequeue = function() {
+        return collection.shift();
+    }
+
+    this.front = function() {
+        return collection[0];
+    }
+
+    this.size = function(){
+        return collection.length;
+    }
+
+    this.isEmpty = function() {
+        return collection.length === 0 ? true : false;
+    }
+    // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-set-class.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-set-class.md
new file mode 100644
index 0000000000..8dae14f764
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-set-class.md
@@ -0,0 +1,219 @@
+---
+id: 8d1323c8c441eddfaeb5bdef
+title: Create a Set Class
+challengeType: 1
+forumTopicId: 301632
+dashedName: create-a-set-class
+---
+
+# --description--
+
+In this exercise we are going to create a class named `Set` to emulate an abstract data structure called "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. We can see how the ES6 `Set` object works in the example below:
+
+```js
+const set1 = new Set([1, 2, 3, 5, 5, 2, 0]);
+console.log(set1);
+// output: {1, 2, 3, 5, 0}
+console.log(set1.has(1));
+// output: true
+console.log(set1.has(6));
+// output: false
+```
+
+First, we will create an add method that adds a value to our set collection as long as the value does not already exist in the set. Then we will create a remove method that removes a value from the set collection if it already exists. And finally, we will create a size method that returns the number of elements inside the set collection.
+
+# --instructions--
+
+Create an `add` method that adds a unique value to the set collection and returns `true` if the value was successfully added and `false` otherwise.
+
+Create a `remove` method that accepts a value and checks if it exists in the set. If it does, then this method should remove it from the set collection, and return `true`. Otherwise, it should return `false`. Create a `size` method that returns the size of the set collection.
+
+# --hints--
+
+Your `Set` class should have an `add` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.add === 'function';
+  })()
+);
+```
+
+Your `add` method should not add duplicate values.
+
+```js
+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;
+  })()
+);
+```
+
+Your `add` method should return `true` when a value has been successfully added.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    var result = test.add('a');
+    return result != undefined && result === true;
+  })()
+);
+```
+
+Your `add` method should return `false` when a duplicate value is added.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    var result = test.add('a');
+    return result != undefined && result === false;
+  })()
+);
+```
+
+Your `Set` class should have a `remove` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+Your `remove` method should only remove items that are present in the set.
+
+```js
+assert.deepEqual(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    test.add('b');
+    test.remove('c');
+    return test.values();
+  })(),
+  ['a', 'b']
+);
+```
+
+Your `remove` method should remove the given item from the set.
+
+```js
+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;
+  })()
+);
+```
+
+Your `Set` class should have a `size` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.size === 'function';
+  })()
+);
+```
+
+The `size` method should return the number of elements in the collection.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    test.add('a');
+    test.add('b');
+    test.remove('a');
+    return test.size() === 1;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // Dictionary will hold the items of our set
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  // This method will return all the values in the set
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-stack-class.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-stack-class.md
new file mode 100644
index 0000000000..c4a493c439
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-stack-class.md
@@ -0,0 +1,167 @@
+---
+id: 587d8250367417b2b2512c5f
+title: Create a Stack Class
+challengeType: 1
+forumTopicId: 301633
+dashedName: 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 `push` and `pop` method, stacks have other useful methods. Let's add a `peek`, `isEmpty`, and `clear` method to our stack class.
+
+# --instructions--
+
+Write a `push` method that pushes an element to the top of the stack, a `pop` method that removes and returns the element on the top of the stack, a `peek` method that looks at the top element in the stack, an `isEmpty` method that checks if the stack is empty, and a `clear` method that removes all elements from the stack. Normally stacks don't have this, but we've added a `print` helper method that console logs the collection.
+
+# --hints--
+
+Your `Stack` class should have a `push` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.push === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `pop` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.pop === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `peek` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.peek === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `Stack` class should have a `clear` method.
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return typeof test.clear === 'function';
+  })()
+);
+```
+
+The `peek` method should return the top element of the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    return test.peek() === 'CS50' && test.peek() === 'CS50';
+  })()
+);
+```
+
+The `pop` method should remove and return the top element of the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    return test.pop() === 'CS50' && test.pop() === 'CS61';
+  })()
+);
+```
+
+The `isEmpty` method should return true if a stack does not contain any elements
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    return test.isEmpty();
+  })()
+);
+```
+
+The `clear` method should remove all element from the stack
+
+```js
+assert(
+  (function () {
+    var test = new Stack();
+    test.push('CS61');
+    test.push('CS50');
+    test.clear();
+    return test.isEmpty();
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Stack() {
+  var collection = [];
+  this.print = function() {
+    console.log(collection);
+  };
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Stack {
+  constructor() {
+    this.collection = [];
+  }
+  print() {
+    console.log(this.collection);
+  }
+  push(val) {
+    this.collection.push(val);
+  }
+  pop() {
+    return this.collection.pop();
+  }
+  peek() {
+    return this.collection[this.collection.length - 1];
+  }
+  isEmpty() {
+    return this.collection.length === 0;
+  }
+  clear() {
+    return (this.collection.length = 0);
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
new file mode 100644
index 0000000000..1586e0b2e8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-a-trie-search-tree.md
@@ -0,0 +1,151 @@
+---
+id: 587d8259367417b2b2512c84
+title: Create a Trie Search Tree
+challengeType: 1
+forumTopicId: 301634
+dashedName: 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.
+
+# --hints--
+
+The Trie should have an add method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.add == 'function';
+  })()
+);
+```
+
+The Trie should have a print method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+The Trie should have an isWord method.
+
+```js
+assert(
+  (function testTrie() {
+    var test = false;
+    if (typeof Trie !== 'undefined') {
+      test = new Trie();
+    } else {
+      return false;
+    }
+    return typeof test.isWord == 'function';
+  })()
+);
+```
+
+The print method should return all items added to the trie as strings in an array.
+
+```js
+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
+    );
+  })()
+);
+```
+
+The isWord method should return true only for words added to the trie and false for all other words.
+
+```js
+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')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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() {
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
new file mode 100644
index 0000000000..7e6822ef67
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-an-es6-javascript-map.md
@@ -0,0 +1,43 @@
+---
+id: 587d825b367417b2b2512c8d
+title: Create an ES6 JavaScript Map
+challengeType: 1
+forumTopicId: 301635
+dashedName: 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: `.has(key)` returns true or false based on the presence of a key `.get(key)` returns the value associated with a key `.set(key, value)` sets a new key, value pair `.delete(key)` removes a key, value pair `.clear()` removes all key, value pairs `.entries()` returns an array of all the keys in insertion order `.values()` 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 `freeCodeCamp`, `Awesome!` to it.
+
+# --hints--
+
+The myMap object should exist.
+
+```js
+assert(typeof myMap === 'object');
+```
+
+myMap should contain the key value pair `freeCodeCamp`, `Awesome!`.
+
+```js
+assert(myMap.get('freeCodeCamp') === 'Awesome!');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
new file mode 100644
index 0000000000..1727a24ed0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.md
@@ -0,0 +1,92 @@
+---
+id: 587d8254367417b2b2512c70
+title: Create and Add to Sets in ES6
+challengeType: 1
+forumTopicId: 301636
+dashedName: 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 `Set` 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:
+
+```js
+var set = new Set();
+```
+
+You can create a set with a value:
+
+```js
+var set = new Set(1);
+```
+
+You can create a set with an array:
+
+```js
+var set = new Set([1, 2, 3]);
+```
+
+Once you have created a set, you can add the values you wish using the `add` method:
+
+```js
+var set = new Set([1, 2, 3]);
+set.add([4, 5, 6]);
+```
+
+As a reminder, a set is a data structure that cannot contain duplicate values:
+
+```js
+var set = new Set([1, 2, 3, 1, 2, 3]);
+// set contains [1, 2, 3] only
+```
+
+# --instructions--
+
+For this exercise, return a set with the following values: `1, 2, 3, 'Taco', 'Cat', 'Awesome'`
+
+# --hints--
+
+Your `Set` should only contain the values `1, 2, 3, Taco, Cat, Awesome`.
+
+```js
+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')
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet() {
+  var set = new Set([1, 2, 3, 3, 2, 1, 2, 3, 1]);
+  // Only change code below this line
+
+  // Only change code above this line
+  console.log(Array.from(set));
+  return set;
+}
+
+checkSet();
+```
+
+# --solutions--
+
+```js
+function checkSet(){var set = new Set([1,2,3,'Taco','Cat','Awesome']);
+return set;}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..43d58845d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.md
@@ -0,0 +1,195 @@
+---
+id: 587d8258367417b2b2512c80
+title: Delete a Leaf Node in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301637
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..db24b0b29e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.md
@@ -0,0 +1,285 @@
+---
+id: 587d8258367417b2b2512c81
+title: Delete a Node with One Child in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301638
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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';
+  })()
+);
+```
+
+The `remove` method should remove nodes with one child.
+
+```js
+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';
+  })()
+);
+```
+
+Removing the root in a tree with two nodes should set the second to be the root.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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
+    // Only change code below this line
+  };
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..aab61e9c37
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.md
@@ -0,0 +1,399 @@
+---
+id: 587d8258367417b2b2512c82
+title: Delete a Node with Two Children in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301639
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `remove`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+Trying to remove an element that does not exist should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+If the root node has no children, deleting it should set the root to `null`.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove leaf nodes from the tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `remove` method should remove nodes with one child.
+
+```js
+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';
+  })()
+);
+```
+
+Removing the root in a tree with two nodes should set the second to be the root.
+
+```js
+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';
+  })()
+);
+```
+
+The `remove` method should remove nodes with two children while maintaining the binary search tree structure.
+
+```js
+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';
+  })()
+);
+```
+
+The root should be removable on a tree of three nodes.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  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;
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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
+    // Only change code below this line
+  };
+}
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/depth-first-search.md
new file mode 100644
index 0000000000..7d86343817
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/depth-first-search.md
@@ -0,0 +1,208 @@
+---
+id: 587d825d367417b2b2512c96
+title: Depth-First Search
+challengeType: 1
+forumTopicId: 301640
+dashedName: 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.
+
+The animation below shows how the algorithm works. The algorithm starts with the top node and visits the nodes in the numbered order.
+
+<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966'>
+
+Notice how, unlike breadth-first search, every time a node is visited, it doesn't visit all of its neighbors. Instead, it first visits one of its neighbors and continues down that path until there are no more nodes to be visited on that path.
+
+To implement this algorithm, you'll want to use a stack. A stack is an array where the last element added is the first to be removed. This is also known as a <dfn>Last-In-First-Out</dfn> data structure. A stack is helpful in depth-first search algorithms because, as we add neighbors to the stack, we want to visit the most recently added neighbors first and remove them from the stack.
+
+A simple output of this algorithm is a list of nodes which are reachable from a given node. Therefore, you'll also want to keep track of the nodes you visit.
+
+# --instructions--
+
+Write a function `dfs()` that takes an undirected, adjacency matrix `graph` and a node label `root` as parameters. The node label will just be the numeric value of the node between `0` and `n - 1`, where `n` is the total number of nodes in the graph.
+
+Your function should output an array of all nodes reachable from `root`.
+
+# --hints--
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with `0`, `1`, `2`, and `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]` with a start node of `1` should return an array with four elements.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]` with a start node of `3` should return an array with one element.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with `2` and `3`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `3` should return an array with two elements.
+
+```js
+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
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with `0` and `1`.
+
+```js
+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]
+);
+```
+
+The input graph `[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]` with a start node of `0` should return an array with two elements.
+
+```js
+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
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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));
+```
+
+# --solutions--
+
+```js
+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;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
new file mode 100644
index 0000000000..b049822d4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.md
@@ -0,0 +1,346 @@
+---
+id: 587d8257367417b2b2512c7d
+title: Find the Minimum and Maximum Height of a Binary Search Tree
+challengeType: 1
+forumTopicId: 301641
+dashedName: 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 `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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMinHeight`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMinHeight == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMaxHeight`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMaxHeight == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `isBalanced`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.isBalanced == 'function';
+  })()
+);
+```
+
+The `findMinHeight` method should return the minimum height of the tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMaxHeight` method should return the maximum height of the tree.
+
+```js
+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;
+  })()
+);
+```
+
+An empty tree should return a height of `-1`.
+
+```js
+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;
+  })()
+);
+```
+
+The `isBalanced` method should return `false` if the tree is an unbalanced binary search tree.
+
+```js
+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() === false;
+  })()
+);
+```
+
+The `isBalanced` method should return `true` if the tree is a balanced binary search tree.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    if (typeof test.isBalanced !== 'function') {
+      return false;
+    }
+    test.add(10);
+    test.add(3);
+    test.add(22);
+    test.add(1);
+    test.add(4);
+    test.add(17);
+    test.add(32);
+    return test.isBalanced() === true;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+  this.findMinHeight = function(root = this.root) {
+    // empty tree.
+    if (root === null) {
+      return -1;
+    }
+    // leaf node.
+    if (root.left === null && root.right === null) {
+      return 0;
+    }
+    if (root.left === null) {
+      return this.findMinHeight(root.right) + 1;
+    }
+    if (root.right === null) {
+      return this.findMinHeight(root.left) + 1;
+    }
+    const lHeight = this.findMinHeight(root.left);
+    const rHeight = this.findMinHeight(root.right);
+    return Math.min(lHeight, rHeight) + 1;
+  };
+  this.findMaxHeight = function(root = this.root) {
+    // empty tree.
+    if (root === null) {
+      return -1;
+    }
+    // leaf node.
+    if (root.left === null && root.right === null) {
+      return 0;
+    }
+    if (root.left === null) {
+      return this.findMaxHeight(root.right) + 1;
+    }
+    if (root.right === null) {
+      return this.findMaxHeight(root.left) + 1;
+    }
+    const lHeight = this.findMaxHeight(root.left);
+    const rHeight = this.findMaxHeight(root.right);
+    return Math.max(lHeight, rHeight) + 1;
+  };
+  this.isBalanced = function(root = this.root) {
+    if (root === null) {
+      return true;
+    }
+
+    if (root.left === null && root.right === null) {
+      return true;
+    }
+
+    if (root.left === null) {
+      return this.findMaxHeight(root.right) <= 0;
+    }
+
+    if (root.right === null) {
+      return this.findMaxHeight(root.left) <= 0;
+    }
+
+    const lHeight = this.findMaxHeight(root.left);
+    const rHeight = this.findMaxHeight(root.right);
+    if (Math.abs(lHeight - rHeight) > 1) {
+      return false;
+    }
+    return this.isBalanced(root.left) && this.isBalanced(root.right);
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..590820dd49
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.md
@@ -0,0 +1,369 @@
+---
+id: 587d8256367417b2b2512c7a
+title: Find the Minimum and Maximum Value in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301642
+dashedName: find-the-minimum-and-maximum-value-in-a-binary-search-tree
+---
+
+# --description--
+
+In this challenge you will define two methods, `findMin` and `findMax`. These methods should return the minimum and maximum value held in the binary search tree (don't worry about adding values to the tree for now, we have added some in the background). 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`.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMin`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMin == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `findMax`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.findMax == 'function';
+  })()
+);
+```
+
+The `findMin` method should return the minimum value in the binary search tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMax` method should return the maximum value in the binary search tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `findMin` and `findMax` methods should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.findMin = function() {
+    // Empty tree.
+    if (!this.root) {
+      return null;
+    }
+    let currentNode = this.root;
+    while (currentNode.left) {
+      currentNode = currentNode.left;
+    }
+    return currentNode.value;
+  };
+  this.findMax = function() {
+    // Empty tree.
+    if (!this.root) {
+      return null;
+    }
+    let currentNode = this.root;
+    while (currentNode.right) {
+      currentNode = currentNode.right;
+    }
+    return currentNode.value;
+  };
+  this.add = function(value) {
+    // Empty tree.
+    if (!this.root) {
+      this.root = new Node(value);
+      return undefined;
+    }
+    return this.addNode(this.root, value);
+  };
+  this.addNode = function(node, value) {
+    // Check if value already exists.
+    if (node.value === value) return null;
+    if (value < node.value) {
+      if (node.left) {
+        return this.addNode(node.left, value);
+      } else {
+        node.left = new Node(value);
+        return undefined;
+      }
+    } else {
+      if (node.right) {
+        return this.addNode(node.right, value);
+      } else {
+        node.right = new Node(value);
+        return undefined;
+      }
+    }
+  };
+  this.isPresent = function(value) {
+    if (!this.root) {
+      return null;
+    }
+    return this.isNodePresent(this.root, value);
+  };
+  this.isNodePresent = function(node, value) {
+    if (node.value === value) return true;
+    if (value < node.value) {
+      return node.left ? this.isNodePresent(node.left, value) : false;
+    } else {
+      return node.right ? this.isNodePresent(node.right, value) : false;
+    }
+    return false;
+  };
+  this.findMinHeight = function() {
+    if (!this.root) {
+      return -1;
+    }
+    let heights = {};
+    let height = 0;
+    this.traverseTree(this.root, height, heights);
+    return Math.min(...Object.keys(heights));
+  };
+  this.findMaxHeight = function() {
+    if (!this.root) {
+      return -1;
+    }
+    let heights = {};
+    let height = 0;
+    this.traverseTree(this.root, height, heights);
+    return Math.max(...Object.keys(heights));
+  };
+  this.traverseTree = function(node, height, heights) {
+    if (node.left === null && node.right === null) {
+      return (heights[height] = true);
+    }
+    if (node.left) {
+      this.traverseTree(node.left, height + 1, heights);
+    }
+    if (node.right) {
+      this.traverseTree(node.right, height + 1, heights);
+    }
+  };
+  this.isBalanced = function() {
+    return this.findMaxHeight() > this.findMinHeight() + 1;
+  };
+  // DFS tree traversal.
+  this.inorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      if (node.left) traverseInOrder(node.left);
+      result.push(node.value);
+      if (node.right) traverseInOrder(node.right);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  this.preorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      result.push(node.value);
+      if (node.left) traverseInOrder(node.left);
+      if (node.right) traverseInOrder(node.right);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  this.postorder = function() {
+    if (!this.root) return null;
+    let result = [];
+
+    function traverseInOrder(node) {
+      if (node.left) traverseInOrder(node.left);
+      if (node.right) traverseInOrder(node.right);
+      result.push(node.value);
+    }
+    traverseInOrder(this.root);
+    return result;
+  };
+  // BFS tree traversal.
+  this.levelOrder = function() {
+    if (!this.root) return null;
+    let queue = [this.root];
+    let result = [];
+    while (queue.length) {
+      let node = queue.shift();
+      result.push(node.value);
+      if (node.left) queue.push(node.left);
+      if (node.right) queue.push(node.right);
+    }
+    return result;
+  };
+  this.reverseLevelOrder = function() {
+    if (!this.root) return null;
+    let queue = [this.root];
+    let result = [];
+    while (queue.length) {
+      let node = queue.shift();
+      result.push(node.value);
+      if (node.right) queue.push(node.right);
+      if (node.left) queue.push(node.left);
+    }
+    return result;
+  };
+  // Delete a leaf node.
+}
+let bst = new BinarySearchTree();
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
new file mode 100644
index 0000000000..d3b5a44d78
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.md
@@ -0,0 +1,144 @@
+---
+id: 587d825b367417b2b2512c8c
+title: Implement Heap Sort with a Min Heap
+challengeType: 1
+forumTopicId: 301643
+dashedName: 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.
+
+# --hints--
+
+The MinHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MinHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MinHeap should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+MinHeap should have a method called sort.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MinHeap !== 'undefined') {
+      test = new MinHeap();
+    } else {
+      return false;
+    }
+    return typeof test.sort == 'function';
+  })()
+);
+```
+
+The sort method should return an array containing all items added to the min heap in sorted order.
+
+```js
+assert(
+  (() => {
+    if (typeof MinHeap === 'undefined') {
+      return false;
+    }
+
+    const heap = new MinHeap();
+    const arr = createRandomArray(25);
+
+    for (let i of arr) {
+      heap.insert(i);
+    }
+
+    const result = heap.sort();
+    arr.sort((a, b) => a - b);
+
+    for (let i = 0; i < arr.length; i++) {
+      if (arr[i] !== result[i]) {
+        return false;
+      }
+    }
+    return true;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSorted(a){
+  for(let i = 0; i < a.length - 1; i++)
+    if(a[i] > a[i + 1])
+      return false;
+  return true;
+}
+// Generate a randomly filled array
+function createRandomArray(size = 5){
+  let a = new Array(size);
+  for(let i = 0; i < size; i++)
+    a[i] = Math.floor(Math.random() * 100);
+  
+  return a;
+}
+const array = createRandomArray(25);
+
+var MinHeap = function() {
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/incidence-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/incidence-matrix.md
new file mode 100644
index 0000000000..068b629cdd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/incidence-matrix.md
@@ -0,0 +1,110 @@
+---
+id: 587d8256367417b2b2512c79
+title: Incidence Matrix
+challengeType: 1
+forumTopicId: 301644
+dashedName: 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 `incidence matrix` 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.
+
+```js
+var incMat = [
+  [0, 1, 1, 1],
+  [1, 1, 0, 0],
+  [1, 0, 0, 1],
+  [0, 0, 1, 0]
+];
+```
+
+To make a directed graph, use `-1` for an edge leaving a particular node and `1` for an edge entering a node.
+
+```js
+var incMatDirected = [
+  [ 0, -1,  1, -1],
+  [-1,  1,  0,  0],
+  [ 1,  0,  0,  1],
+  [ 0,  0, -1,  0]
+];
+```
+
+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 (`0` or `1`). You can have different weights depending on your application. A different weight is represented as numbers greater than 1.
+
+# --instructions--
+
+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 the 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. The fourth edge is between the fourth and second node. All edge weights are one and the edge order matters.
+
+# --hints--
+
+`incMatUndirected` should only contain five nodes.
+
+```js
+assert(
+  incMatUndirected.length === 5 &&
+    incMatUndirected
+      .map(function (x) {
+        return x.length === 4;
+      })
+      .reduce(function (a, b) {
+        return a && b;
+      })
+);
+```
+
+There should be a first edge between the first and second node.
+
+```js
+assert(incMatUndirected[0][0] === 1 && incMatUndirected[1][0] === 1);
+```
+
+There should be a second edge between the second and third node.
+
+```js
+assert(incMatUndirected[1][1] === 1 && incMatUndirected[2][1] === 1);
+```
+
+There should be a third edge between the third and fifth node.
+
+```js
+assert(incMatUndirected[2][2] === 1 && incMatUndirected[4][2] === 1);
+```
+
+There should be a fourth edge between the second and fourth node.
+
+```js
+assert(incMatUndirected[1][3] === 1 && incMatUndirected[3][3] === 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var incMatUndirected = [
+
+];
+```
+
+# --solutions--
+
+```js
+var incMatUndirected = [[1, 0, 0, 0],[1, 1, 0, 1],[0, 1, 1, 0],[0, 0, 0, 1],[0, 0, 1, 0]];
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
new file mode 100644
index 0000000000..74e6b693f7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.md
@@ -0,0 +1,153 @@
+---
+id: 587d825a367417b2b2512c8a
+title: Insert an Element into a Max Heap
+challengeType: 1
+forumTopicId: 301703
+dashedName: 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 min heap:
+
+```js
+[ 6, 22, 30, 37, 63, 48, 42, 76 ]
+```
+
+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: `Math.floor((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:
+
+```js
+[ null, 6, 22, 30, 37, 63, 48, 42, 76 ]
+```
+
+An element's left child: `i * 2`
+
+An element's right child: `i * 2 + 1`
+
+An element's parent: `Math.floor(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--
+
+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:
+
+<ol>
+  <li>Add the new element to the end of the array.</li>
+  <li>If the element is larger than its parent, switch them.</li>
+  <li>Continue switching until the new element is either smaller than its parent or you reach the root of the tree.</li>
+</ol>
+
+Finally, add a `print` method which returns an array of all the items that have been added to the heap.
+
+# --hints--
+
+The MaxHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MaxHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called print.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+The insert method should add elements according to the max heap property.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var MaxHeap = function() {
+  // Only change code below this line
+    
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+var MaxHeap = function() {
+    // Only change code below this line
+    this.heap = [null];
+    this.insert = (ele) => {
+        var index = this.heap.length;
+        var arr = [...this.heap];
+        arr.push(ele);
+        while (ele > arr[Math.floor(index / 2)] && index > 1) {
+            arr[index] = arr[Math.floor(index / 2)];
+            arr[Math.floor(index / 2)] = ele;
+            index = arr[Math.floor(index / 2)];
+        }
+        this.heap = arr;
+    }
+    this.print = () => {
+        return this.heap.slice(1);
+    }
+    // Only change code above this line
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/invert-a-binary-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
new file mode 100644
index 0000000000..bb2226fac8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/invert-a-binary-tree.md
@@ -0,0 +1,192 @@
+---
+id: 587d8259367417b2b2512c83
+title: Invert a Binary Tree
+challengeType: 1
+forumTopicId: 301704
+dashedName: 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!
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `invert`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.invert == 'function';
+  })()
+);
+```
+
+The `invert` method should correctly invert the tree structure.
+
+```js
+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';
+  })()
+);
+```
+
+Inverting an empty tree should return `null`.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        };
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        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;
+      };
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  this.invert = function(node = this.root) {
+    if (node) {
+      const temp = node.left;
+      node.left = node.right;
+      node.right = temp;
+      this.invert(node.left);
+      this.invert(node.right);
+    }
+    return node;
+  }
+    // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
new file mode 100644
index 0000000000..19ea0d3c26
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/learn-how-a-stack-works.md
@@ -0,0 +1,71 @@
+---
+id: 587d8250367417b2b2512c5e
+title: Learn how a Stack Works
+challengeType: 1
+forumTopicId: 301705
+dashedName: 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 `push()` method that pushes JavaScript objects at the top of the stack; and `pop()` method, that removes the JavaScript object that's at the top of the stack at the current moment.
+
+# --instructions--
+
+Here we have a stack of homework assignments represented as an array: `"BIO12"` is at the base, and `"PSY44"` is at the top of the stack.
+
+Modify the given array and treat it like a `stack` using the JavaScript methods mentioned above. Remove the top element `"PSY44"` from the stack. Then add `"CS50"` to be the new top element of the stack.
+
+# --hints--
+
+`homeworkStack` should only contain 4 elements.
+
+```js
+assert(homeworkStack.length === 4);
+```
+
+The last element in `homeworkStack` should be `"CS50"`.
+
+```js
+assert(homeworkStack[3] === 'CS50');
+```
+
+`homeworkStack` should not contain `"PSY44"`.
+
+```js
+assert(homeworkStack.indexOf('PSY44') === -1);
+```
+
+The initial declaration of the `homeworkStack` should not be changed.
+
+```js
+assert(
+  code.match(/=/g).length === 1 &&
+    /homeworkStack\s*=\s*\["BIO12"\s*,\s*"HIS80"\s*,\s*"MAT122"\s*,\s*"PSY44"\]/.test(
+      code
+    )
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var homeworkStack = ["BIO12","HIS80","MAT122","PSY44"];
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
new file mode 100644
index 0000000000..8c40ae5161
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.md
@@ -0,0 +1,219 @@
+---
+id: 587d8254367417b2b2512c6e
+title: Perform a Difference on Two Sets of Data
+challengeType: 1
+forumTopicId: 301706
+dashedName: 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 `Set` data structure called `difference`. 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 `Set` as an argument and return the `difference` of the two sets.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the difference of setA and setB is: `setA.difference(setB) = ['c']`.
+
+# --hints--
+
+Your `Set` class should have a `difference` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.difference === 'function';
+  })()
+);
+```
+
+Your `difference` method should return the proper collection.
+
+```js
+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 &&
+      DeepEqual(differenceSetAB.values(), ['a', 'b'])
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // This is our intersection method
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
new file mode 100644
index 0000000000..71d0bc063e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.md
@@ -0,0 +1,302 @@
+---
+id: 587d8254367417b2b2512c6f
+title: Perform a Subset Check on Two Sets of Data
+challengeType: 1
+forumTopicId: 301707
+dashedName: 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 `Set` data structure called `isSubsetOf`. This will compare the first set against the second, and if the first set is fully contained within the second, it will return `true`.
+
+For example, if `setA = ['a','b']` and `setB = ['a','b','c','d']`, then `setA` is a subset of `setB`, so `setA.isSubsetOf(setB)` should return `true`.
+
+# --hints--
+
+Your `Set` class should have a `isSubsetOf` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.isSubsetOf === 'function';
+  })()
+);
+```
+
+The first Set() should be contained in the second Set
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b'].isSubsetOf(['a', 'b', 'c', 'd'])` should return `true`
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b', 'c'].isSubsetOf(['a', 'b'])` should return `false`
+
+```js
+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 aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === false;
+  })()
+);
+```
+
+`[].isSubsetOf([])` should return `true`
+
+```js
+assert(
+  (function () {
+    var setA = new Set();
+    var setB = new Set();
+    var aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === true;
+  })()
+);
+```
+
+`['a', 'b'].isSubsetOf(['c', 'd'])` should return `false`
+
+```js
+assert(
+  (function () {
+    var setA = new Set();
+    var setB = new Set();
+    setA.add('a');
+    setA.add('b');
+    setB.add('c');
+    setB.add('d');
+    var aIsSubsetOfB = setA.isSubsetOf(setB);
+    return aIsSubsetOfB === false;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // This is our intersection method
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }  
+
+  difference(set) {
+    const newSet = new Set();
+
+    this.values().forEach(value => {
+      if (!set.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+
+  isSubsetOf(set) {
+    for(const value of this.values()){
+      if(!set.dictionary[value]) return false;
+    }
+    return true
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
new file mode 100644
index 0000000000..04ecfb767f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.md
@@ -0,0 +1,155 @@
+---
+id: 587d8253367417b2b2512c6c
+title: Perform a Union on Two Sets
+challengeType: 1
+forumTopicId: 301708
+dashedName: 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 `Set` data structure called `union`. This method should take another `Set` as an argument and return the `union` of the two sets, excluding any duplicate values.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the union of setA and setB is: `setA.union(setB) = ['a', 'b', 'c', 'd', 'e']`.
+
+# --hints--
+
+Your `Set` class should have a `union` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.union === 'function';
+  })()
+);
+```
+
+The union of a Set containing values ["a", "b", "c"] and a Set containing values ["c", "d"] should return a new Set containing values ["a", "b", "c", "d"].
+
+```js
+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
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.values(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.values(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = element;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
new file mode 100644
index 0000000000..e2bef36377
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.md
@@ -0,0 +1,184 @@
+---
+id: 587d8253367417b2b2512c6d
+title: Perform an Intersection on Two Sets of Data
+challengeType: 1
+forumTopicId: 301709
+dashedName: 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 `Set` data structure called `intersection`. An intersection of sets represents all values that are common to two or more sets. This method should take another `Set` as an argument and return the `intersection` of the two sets.
+
+For example, if `setA = ['a','b','c']` and `setB = ['a','b','d','e']`, then the intersection of setA and setB is: `setA.intersection(setB) = ['a', 'b']`.
+
+# --hints--
+
+Your `Set` class should have a `intersection` method.
+
+```js
+assert(
+  (function () {
+    var test = new Set();
+    return typeof test.intersection === 'function';
+  })()
+);
+```
+
+The proper collection should be returned.
+
+```js
+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'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+class Set {
+  constructor() {
+    // This will hold the set
+    this.dictionary = {};
+    this.length = 0;
+  }
+  // This method will check for the presence of an element and return true or false
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+  // This method will return all the values in the set
+  values() {
+    return Object.keys(this.dictionary);
+  }
+  // This method will add an element to the set
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will remove an element from a set
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+  // This method will return the size of the set
+  size() {
+    return this.length;
+  }
+  // This is our union method 
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+class Set {
+  constructor() {
+    this.dictionary = {};
+    this.length = 0;
+  }
+
+  has(element) {
+    return this.dictionary[element] !== undefined;
+  }
+
+  values() {
+    return Object.keys(this.dictionary);
+  }
+
+  add(element) {
+    if (!this.has(element)) {
+      this.dictionary[element] = true;
+      this.length++;
+      return true;
+    }
+
+    return false;
+  }
+
+  remove(element) {
+    if (this.has(element)) {
+      delete this.dictionary[element];
+      this.length--;
+      return true;
+    }
+
+    return false;
+  }
+
+  size() {
+    return this.length;
+  }
+
+  union(set) {
+    const newSet = new Set();
+    this.values().forEach(value => {
+      newSet.add(value);
+    })
+    set.values().forEach(value => {
+      newSet.add(value);
+    })
+
+    return newSet;
+  }
+
+  intersection(set) {
+    const newSet = new Set();
+
+    let largeSet;
+    let smallSet;
+    if (this.dictionary.length > set.length) {
+      largeSet = this;
+      smallSet = set;
+    } else {
+      largeSet = set;
+      smallSet = this;
+    }
+
+    smallSet.values().forEach(value => {
+      if (largeSet.dictionary[value]) {
+        newSet.add(value);
+      }
+    })
+
+    return newSet;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
new file mode 100644
index 0000000000..858073f211
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.md
@@ -0,0 +1,143 @@
+---
+id: 587d825b367417b2b2512c8b
+title: Remove an Element from a Max Heap
+challengeType: 1
+forumTopicId: 301710
+dashedName: 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:
+
+<ol>
+  <li>Move the last element in the heap into the root position.</li>
+  <li>If either child of the root is greater than it, swap the root with the child of greater value.</li>
+  <li>Continue swapping until the parent is greater than both children or you reach the last level in the tree.</li>
+</ol>
+
+# --instructions--
+
+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.
+
+# --hints--
+
+The MaxHeap data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+MaxHeap should have a method called print.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.print == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called insert.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.insert == 'function';
+  })()
+);
+```
+
+MaxHeap should have a method called remove.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof MaxHeap !== 'undefined') {
+      test = new MaxHeap();
+    } else {
+      return false;
+    }
+    return typeof test.remove == 'function';
+  })()
+);
+```
+
+The remove method should remove the greatest element from the max heap while maintaining the max heap property.
+
+```js
+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';
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var MaxHeap = function() {
+  this.heap = [null];
+  this.insert = (ele) => {
+    var index = this.heap.length;
+    var arr = [...this.heap];
+    arr.push(ele);
+    while (ele > arr[Math.floor(index / 2)] && index > 1) {
+      arr[index] = arr[Math.floor(index / 2)];
+      arr[Math.floor(index / 2)] = ele;
+      index = arr[Math.floor(index / 2)];
+    }
+    this.heap = arr;
+  }
+  this.print = () => {
+    return this.heap.slice(1);
+  }
+  // Only change code below this line
+
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
new file mode 100644
index 0000000000..9a8e59f77f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.md
@@ -0,0 +1,242 @@
+---
+id: 587d8251367417b2b2512c65
+title: Remove Elements from a Linked List by Index
+challengeType: 1
+forumTopicId: 301711
+dashedName: 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 `removeAt` method that removes the `element` at a given `index`. The method should be called `removeAt(index)`. To remove an `element` at a certain `index`, 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 `head` of our list, we start with a `currentIndex` variable that starts at `0`. The `currentIndex` should increment by one for each node we pass.
+
+Just like our `remove(element)` method, which [we covered in a previous lesson](/learn/coding-interview-prep/data-structures/remove-elements-from-a-linked-list), 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.
+
+# --instructions--
+
+Write a `removeAt(index)` method that removes and returns a node at a given `index`. The method should return `null` if the given `index` is either negative, or greater than or equal to the `length` of the linked list.
+
+**Note:** Remember to keep count of the `currentIndex`.
+
+# --hints--
+
+Your `LinkedList` class should have a `removeAt` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.removeAt === 'function';
+  })()
+);
+```
+
+Your `removeAt` method should reduce the `length` of the linked list by one.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.removeAt(1);
+    return test.size() === 2;
+  })()
+);
+```
+
+Your `removeAt` method should remove the element at the specified index from the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.add('bird');
+    test.removeAt(1);
+    return (
+      JSON.stringify(test.head()) ===
+      '{"element":"cat","next":{"element":"kitten","next":{"element":"bird","next":null}}}'
+    );
+  })()
+);
+```
+
+When only one element is present in the linked list, your `removeAt` method should remove and return the element at specified index, and reduce the length of the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    var removedItem = test.removeAt(0);
+    return test.head() === null && test.size() === 0 && removedItem === 'cat';
+  })()
+);
+```
+
+Your `removeAt` method should return the element of the removed node.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.removeAt(1) === 'dog';
+  })()
+);
+```
+
+Your `removeAt` method should return `null` and the linked list should not change if the given index is less than `0`.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    var removedItem = test.removeAt(-1);
+    return (
+      removedItem === null &&
+      JSON.stringify(test.head()) ===
+        '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+Your `removeAt` method should return `null` and the linked list should not change if the given index is greater than or equal to the `length` of the list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    var removedItem = test.removeAt(3);
+    return (
+      removedItem === null &&
+      JSON.stringify(test.head()) ===
+        '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var currentNode = head;
+
+      while(currentNode.next){
+        currentNode  = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  // Only change code below this line
+
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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 {
+      var currentNode = head;
+
+      while (currentNode.next) {
+        currentNode = currentNode.next;
+      }
+
+      currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  this.removeAt = function (index) {
+    var currentNode = head;
+    var previous = head;
+    var count = 0;
+    if (index >= length || index < 0) {
+      return null;
+    }
+    if (index === 0) {
+      var removed = head.element;
+      head = currentNode.next;
+    } else {
+      while (count < index) {
+        previous = currentNode;
+        currentNode = currentNode.next;
+        count++;
+      }
+      var removed = previous.next.element;
+      previous.next = currentNode.next;
+    }
+    length--;
+    return removed;
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
new file mode 100644
index 0000000000..871cf51e9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.md
@@ -0,0 +1,210 @@
+---
+id: 587d8251367417b2b2512c63
+title: Remove Elements from a Linked List
+challengeType: 1
+forumTopicId: 301712
+dashedName: remove-elements-from-a-linked-list
+---
+
+# --description--
+
+The next important method that any implementation of a linked list will need is a `remove` 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 `next` 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 `next` property to the middle element's `next` 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 `head` element, we reassign the `head` to the second node of the linked list.
+
+# --instructions--
+
+Write a `remove` method that takes an element and removes it from the linked list.
+
+**Note:** The `length` of the list should decrease by one every time an element is removed from the linked list.
+
+# --hints--
+
+Your `LinkedList` class should have a `remove` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.remove === 'function';
+  })()
+);
+```
+
+Your `remove` method should reassign `head` to the second node when the first node is removed.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.remove('cat');
+    return test.head().element === 'dog';
+  })()
+);
+```
+
+Your `remove` method should decrease the `length` of the linked list by one for every node removed.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('hamster');
+    test.remove('cat');
+    test.remove('fish');
+    return test.size() === 2;
+  })()
+);
+```
+
+Your `remove` method should reassign the reference of the previous node of the removed node to the removed node's `next` reference.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('snake');
+    test.add('kitten');
+    test.remove('snake');
+    return test.head().next.next.element === 'kitten';
+  })()
+);
+```
+
+Your `remove` method should not change the linked list if the element does not exist in the linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    test.remove('elephant');
+    return (
+      JSON.stringify(test.head()) ===
+      '{"element":"cat","next":{"element":"dog","next":{"element":"kitten","next":null}}}'
+    );
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var 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
+  };
+}
+```
+
+# --solutions--
+
+```js
+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 {
+        var currentNode = head;
+
+        while(currentNode.next){
+            currentNode  = currentNode.next;
+        }
+
+        currentNode.next = node;
+    }
+
+    length++;
+  };
+
+  this.remove = function(element){
+    if (head === null) {
+      return;
+    }
+    var previous;
+    var currentNode = head;
+
+    while (currentNode.next !== null && currentNode.element !== element) {
+      previous = currentNode;
+      currentNode = currentNode.next;
+    }
+    
+    if (currentNode.next === null && currentNode.element !== element) {
+      return;
+    }
+    else if (previous) {
+      previous.next = currentNode.next;
+    } else {
+      head = currentNode.next;
+    }
+
+    length--;
+  };
+} 
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
new file mode 100644
index 0000000000..b676bb7eeb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.md
@@ -0,0 +1,64 @@
+---
+id: 587d8254367417b2b2512c71
+title: Remove items from a set in ES6
+challengeType: 1
+forumTopicId: 301713
+dashedName: remove-items-from-a-set-in-es6
+---
+
+# --description--
+
+Let's practice removing items from an ES6 Set using the `delete` method.
+
+First, create an ES6 Set:
+
+```js
+var set = new Set([1,2,3]);
+```
+
+Now remove an item from your Set with the `delete` method.
+
+```js
+set.delete(1);
+console.log([...set]) // should return [ 2, 3 ]
+```
+
+# --instructions--
+
+Now, create a set with the integers 1, 2, 3, 4, & 5.
+
+Remove the values 2 and 5, and then return the set.
+
+# --hints--
+
+Your Set should contain the values 1, 3, & 4
+
+```js
+assert(
+  (function () {
+    var test = checkSet();
+    return test.has(1) && test.has(3) && test.has(4) && test.size === 3;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(){
+   var set = null;
+   return set;
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(){
+var set = new Set([1,2,3,4,5]);
+set.delete(2);
+set.delete(5);
+return set;}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
new file mode 100644
index 0000000000..18293576f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.md
@@ -0,0 +1,205 @@
+---
+id: 587d825a367417b2b2512c88
+title: Reverse a Doubly Linked List
+challengeType: 1
+forumTopicId: 301714
+dashedName: 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.
+
+# --hints--
+
+The DoublyLinkedList data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The DoublyLinkedList should have a method called reverse.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    if (test.reverse == undefined) {
+      return false;
+    }
+    return typeof test.reverse == 'function';
+  })()
+);
+```
+
+Reversing an empty list should return null.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    return test.reverse() == null;
+  })()
+);
+```
+
+The reverse method should reverse the list.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    test.add(58);
+    test.add(61);
+    test.add(32);
+    test.add(95);
+    test.add(41);
+    test.reverse();
+    return test.print().join('') == '4195326158';
+  })()
+);
+```
+
+The next and previous references should be correctly maintained when a list is reversed.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof DoublyLinkedList !== 'undefined') {
+      test = new DoublyLinkedList();
+    }
+    test.add(11);
+    test.add(22);
+    test.add(33);
+    test.add(44);
+    test.add(55);
+    test.reverse();
+    return test.printReverse().join('') == '1122334455';
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+DoublyLinkedList.prototype = Object.assign(
+  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;
+      };
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+var Node = function(data, prev) {
+  this.data = data;
+  this.prev = prev;
+  this.next = null;
+};
+var DoublyLinkedList = function() {
+  this.head = null;
+  this.tail = null;
+  // Only change code below this line
+  
+  // Only change code above this line
+};
+```
+
+# --solutions--
+
+```js
+  var Node = function(data, prev) {
+    this.data = data;
+    this.prev = prev;
+    this.next = null;
+  };
+  var DoublyLinkedList = function() {
+    this.head = null;
+    this.tail = null;
+
+    this.reverse = function() {
+      if (!this.head || !this.head.next) {
+        return this.head
+      }
+
+      let tail;
+      let temp;
+      let current = this.head;
+      while(current !== null) {
+        if(!tail) tail = current;
+        temp = current.prev;
+        current.prev = current.next;
+        current.next = temp;
+        current = current.prev;
+      }
+
+      this.head = temp.prev;
+      this.tail = tail
+    }
+  };
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
new file mode 100644
index 0000000000..03361689fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/search-within-a-linked-list.md
@@ -0,0 +1,293 @@
+---
+id: 587d8251367417b2b2512c64
+title: Search within a Linked List
+challengeType: 1
+forumTopicId: 301715
+dashedName: 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 `Stack` and `Queue` 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 `indexOf` method that takes an `element` as an argument, and returns that element's `index` in the linked list. If the element is not found in the linked list, return `-1`.
+
+Let's also implement a method that does the opposite: an `elementAt` method that takes an `index` as an argument and returns the `element` at the given `index`. If no `element` is found, return `undefined`.
+
+# --instructions--
+
+Write an `isEmpty` method that checks if the linked list is empty, an `indexOf` method that returns the `index` of a given element, and an `elementAt` that returns an `element` at a given `index.`
+
+# --hints--
+
+Your `LinkedList` class should have an `isEmpty` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.isEmpty === 'function';
+  })()
+);
+```
+
+Your `isEmpty` method should return `false` when there is at least one element in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.isEmpty() === false;
+  })()
+);
+```
+
+Your `isEmpty` method should return `true` when there are no elements in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return test.isEmpty() === true;
+  })()
+);
+```
+
+Your `LinkedList` class should have an `indexOf` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.indexOf === 'function';
+  })()
+);
+```
+
+Your `indexOf` method should return the index of a given element found in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.indexOf('cat') === 0;
+  })()
+);
+```
+
+Your `indexOf` method should return `-1` if the given element is not found in linked list
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.indexOf('pony') === -1;
+  })()
+);
+```
+
+Your `LinkedList` class should have an `elementAt` method.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    return typeof test.elementAt === 'function';
+  })()
+);
+```
+
+Your `elementAt` method should return the element found at a given index in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.elementAt(1) === 'dog';
+  })()
+);
+```
+
+Your `elementAt` method should return `undefined` if the given element is not found at a given index in linked list.
+
+```js
+assert(
+  (function () {
+    var test = new LinkedList();
+    test.add('cat');
+    test.add('dog');
+    test.add('kitten');
+    return test.elementAt(5) === undefined;
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+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 {
+      var 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
+}
+```
+
+# --solutions--
+
+```js
+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 {
+        var 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 --;
+  };
+
+  this.indexOf = function(element) {
+    if (head === null) return -1
+
+    let current = head;
+    let index = 0;
+
+    while (current.element !== element && current.next !== null) {
+      current = current.next;
+      index++
+    }
+
+    if (current.element !== element && current.next === null) {
+      return -1
+    }
+
+    return index;
+  }
+
+  this.elementAt = function(index) {
+    if (head === null) return undefined;
+
+    let current = head;
+    let currentIndex = 0;
+
+    while (currentIndex !== index && current.next !== null) {
+      current = current.next;
+      currentIndex++
+    }
+
+    if (currentIndex !== index && current.next === null) {
+      return undefined;
+    }
+
+    return current.element;
+  }
+
+  this.isEmpty = function() {
+    return length === 0;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/typed-arrays.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/typed-arrays.md
new file mode 100644
index 0000000000..b992af729a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/typed-arrays.md
@@ -0,0 +1,94 @@
+---
+id: 587d8253367417b2b2512c6a
+title: Typed Arrays
+challengeType: 1
+forumTopicId: 301716
+dashedName: typed-arrays
+---
+
+# --description--
+
+Arrays are JavaScript objects that can hold a lot of different elements.
+
+```js
+var complexArr = [1, 5, "2", "Word", {"name": "James"}];
+```
+
+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'><tbody><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></tbody></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 `Int16Array`.
+
+```js
+var i8 = new Int16Array(3);
+console.log(i8);
+// Returns [0, 0, 0]
+```
+
+You can also create a <dfn>buffer</dfn> to assign how much data (in bytes) you want the array to take up. **Note**  
+To create typed arrays using buffers, you need to assign the number of bytes to be a multiple of the bytes listed above.
+
+```js
+// Create same Int16Array array differently
+var byteSize = 6; // Needs to be multiple of 2
+var buffer = new ArrayBuffer(byteSize);
+var i8View = new Int16Array(buffer);
+buffer.byteLength; // Returns 6
+i8View.byteLength; // Returns 6
+console.log(i8View); // Returns [0, 0, 0]
+```
+
+<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>.
+
+```js
+i8View[0] = 42;
+console.log(i8View); // Returns [42, 0, 0]
+```
+
+**Note**  
+Typed arrays do not have some of the methods traditional arrays have such as `.pop()` or `.push()`. Typed arrays also fail `Array.isArray()` that checks if something is an array. Although simpler, this can be an advantage for less-sophisticated JavaScript engines to implement them.
+
+# --instructions--
+
+First create a `buffer` that is 64-bytes. Then create a `Int32Array` typed array with a view of it called `i32View`.
+
+# --hints--
+
+Your `buffer` should be 64 bytes large.
+
+```js
+assert(buffer.byteLength === 64);
+```
+
+Your `i32View` view of your buffer should be 64 bytes large.
+
+```js
+assert(i32View.byteLength === 64);
+```
+
+Your `i32View` view of your buffer should be 16 elements long.
+
+```js
+assert(i32View.length === 16);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var buffer;
+var i32View;
+```
+
+# --solutions--
+
+```js
+var buffer = new ArrayBuffer(64);
+var i32View = new Int32Array(buffer);
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
new file mode 100644
index 0000000000..55d4ac67de
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.md
@@ -0,0 +1,73 @@
+---
+id: 587d8255367417b2b2512c72
+title: Use .has and .size on an ES6 Set
+challengeType: 1
+forumTopicId: 301717
+dashedName: 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
+
+```js
+var set = new Set([1,2,3]);
+```
+
+The .has method will check if the value is contained within the set.
+
+```js
+var hasTwo = set.has(2);
+```
+
+The .size method will return an integer representing the size of the Set
+
+```js
+var howBig = set.size;
+```
+
+# --instructions--
+
+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.
+
+# --hints--
+
+`checkSet([4, 5, 6], 3)` should return [ false, 3 ]
+
+```js
+assert(
+  (function () {
+    var test = checkSet([4, 5, 6], 3);
+    return DeepEqual(test, [false, 3]);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(arrToBeSet, checkValue){
+
+   // Only change code below this line
+
+   // Only change code above this line
+
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(arrToBeSet, checkValue){
+var set = new Set(arrToBeSet);
+var result = [
+set.has(checkValue),
+set.size
+];
+return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..d048a3a43c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.md
@@ -0,0 +1,261 @@
+---
+id: 587d8258367417b2b2512c7f
+title: Use Breadth First Search in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301718
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `levelOrder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.levelOrder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `reverseLevelOrder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.reverseLevelOrder == 'function';
+  })()
+);
+```
+
+The `levelOrder` method should return an array of the tree node values explored in level order.
+
+```js
+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';
+  })()
+);
+```
+
+The `reverseLevelOrder` method should return an array of the tree node values explored in reverse level order.
+
+```js
+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';
+  })()
+);
+```
+
+The `levelOrder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `reverseLevelOrder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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;
+  // Only change code below this line
+  this.levelOrder = (root = this.root) => {
+    if(!root) return null;
+    let queue = [root];
+    let results = [];
+    while(queue.length > 0) {
+      let node = queue.shift();
+      results.push(node.value);
+      if(node.left) queue.push(node.left);
+      if(node.right) queue.push(node.right);
+    }
+    return results;
+  }
+
+  this.reverseLevelOrder = (root = this.root) => {
+    if(!root) return null;
+    let queue = [root];
+    let results = [] ;
+    while ( queue.length > 0) {
+      let node = queue.shift();
+      results.push(node.value);
+      if(node.right) queue.push(node.right);
+      if(node.left ) queue.push(node.left);
+    }
+    return results;
+  }
+  // Only change code above this line
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
new file mode 100644
index 0000000000..8dc78340bf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.md
@@ -0,0 +1,328 @@
+---
+id: 587d8257367417b2b2512c7e
+title: Use Depth First Search in a Binary Search Tree
+challengeType: 1
+forumTopicId: 301719
+dashedName: 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.
+
+# --hints--
+
+The `BinarySearchTree` data structure should exist.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    }
+    return typeof test == 'object';
+  })()
+);
+```
+
+The binary search tree should have a method called `inorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.inorder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `preorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.preorder == 'function';
+  })()
+);
+```
+
+The binary search tree should have a method called `postorder`.
+
+```js
+assert(
+  (function () {
+    var test = false;
+    if (typeof BinarySearchTree !== 'undefined') {
+      test = new BinarySearchTree();
+    } else {
+      return false;
+    }
+    return typeof test.postorder == 'function';
+  })()
+);
+```
+
+The `inorder` method should return an array of the node values that result from an inorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `preorder` method should return an array of the node values that result from a preorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `postorder` method should return an array of the node values that result from a postorder traversal.
+
+```js
+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';
+  })()
+);
+```
+
+The `inorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `preorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+The `postorder` method should return `null` for an empty tree.
+
+```js
+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;
+  })()
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+BinarySearchTree.prototype = Object.assign(
+  BinarySearchTree.prototype,
+  {
+    add: function(value) {
+      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;
+        }
+      }
+
+      var node = this.root;
+      if (node == null) {
+        this.root = new Node(value);
+        return;
+      } else {
+        return searchTree(node);
+      }
+    }
+  }
+);
+```
+
+## --seed-contents--
+
+```js
+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;
+  // Only change code below this line
+  
+  // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+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.result = [];
+
+  this.inorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    if (node.left) this.inorder(node.left);
+    this.result.push(node.value);
+    if (node.right) this.inorder(node.right);
+    return this.result;
+  };
+  this.preorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    this.result.push(node.value);
+    if (node.left) this.preorder(node.left);
+    if (node.right) this.preorder(node.right);
+    return this.result;
+  };
+  this.postorder = function(node) {
+    if (!node) node = this.root;
+    if (!node) return null;
+
+    if (node.left) this.postorder(node.left);
+    if (node.right) this.postorder(node.right);
+    this.result.push(node.value);
+
+    return this.result;
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
new file mode 100644
index 0000000000..79ba7313b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.md
@@ -0,0 +1,59 @@
+---
+id: 587d8255367417b2b2512c73
+title: Use Spread and Notes for ES5 Set() Integration
+challengeType: 1
+forumTopicId: 301720
+dashedName: use-spread-and-notes-for-es5-set-integration
+---
+
+# --description--
+
+Do you remember the ES6 spread operator `...`?
+
+`...` can take iterable objects in ES6 and turn them into arrays.
+
+Let's create a Set, and check out the spread function.
+
+```js
+var set = new Set([1,2,3]);
+var setToArr = [...set]
+console.log(setToArr) // returns [ 1, 2, 3 ]
+```
+
+# --instructions--
+
+In this exercise we will pass a set object to the `checkSet` function. It should return an array containing the values of the Set.
+
+Now you've successfully learned how to use the ES6 `Set()` object, good job!
+
+# --hints--
+
+`checkSet(new Set([1,2,3,4,5,6,7])` should return `[1, 2, 3, 4, 5, 6, 7]`.
+
+```js
+assert(
+  (function () {
+    var test = checkSet(new Set([1, 2, 3, 4, 5, 6, 7]));
+    return DeepEqual(test, [1, 2, 3, 4, 5, 6, 7]);
+  })()
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function checkSet(set){
+   // Only change code below this line
+
+   // Only change code above this line
+}
+```
+
+# --solutions--
+
+```js
+function checkSet(set){
+return [...set];}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
new file mode 100644
index 0000000000..c746995d5d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.md
@@ -0,0 +1,55 @@
+---
+id: 587d8251367417b2b2512c61
+title: Work with Nodes in a Linked List
+challengeType: 1
+forumTopicId: 301721
+dashedName: 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 `element` itself, and a reference to the next `node`.
+
+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.
+
+# --instructions--
+
+In our code editor, we've created two nodes, `Kitten` and `Puppy`, and we've manually connected the `Kitten` node to the `Puppy` node.
+
+Create a `Cat` and `Dog` node and manually add them to the line.
+
+# --hints--
+
+Your `Puppy` node should have a reference to a `Cat` node.
+
+```js
+assert(Puppy.next.element === 'Cat');
+```
+
+Your `Cat` node should have a reference to a `Dog` node.
+
+```js
+assert(Cat.next.element === 'Dog');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+var Node = function(element) {
+  this.element = element;
+  this.next = null;
+};
+var Kitten = new Node('Kitten');
+var Puppy = new Node('Puppy');
+
+Kitten.next = Puppy;
+// Only change code below this line
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
new file mode 100644
index 0000000000..ff256d48a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.md
@@ -0,0 +1,73 @@
+---
+id: 5900f36e1000cf542c50fe80
+title: 'Problem 1: Multiples of 3 and 5'
+challengeType: 5
+forumTopicId: 301722
+dashedName: problem-1-multiples-of-3-and-5
+---
+
+# --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 `number`.
+
+# --hints--
+
+`multiplesOf3and5(10)` should return a number.
+
+```js
+assert(typeof multiplesOf3and5(10) === 'number');
+```
+
+`multiplesOf3and5(49)` should return 543.
+
+```js
+assert.strictEqual(multiplesOf3and5(49), 543);
+```
+
+`multiplesOf3and5(1000)` should return 233168.
+
+```js
+assert.strictEqual(multiplesOf3and5(1000), 233168);
+```
+
+`multiplesOf3and5(8456)` should return 16687353.
+
+```js
+assert.strictEqual(multiplesOf3and5(8456), 16687353);
+```
+
+`multiplesOf3and5(19564)` should return 89301183.
+
+```js
+assert.strictEqual(multiplesOf3and5(19564), 89301183);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function multiplesOf3and5(number) {
+
+  return true;
+}
+
+multiplesOf3and5(1000);
+```
+
+# --solutions--
+
+```js
+const multiplesOf3and5 = (number) => {
+  var total = 0;
+
+  for(var i = 0; i < number; i++) {
+    if(i % 3 == 0 || i % 5 == 0) {
+      total += i;
+    }
+  }
+  return total;
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
new file mode 100644
index 0000000000..d1194e13f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.md
@@ -0,0 +1,81 @@
+---
+id: 5900f3761000cf542c50fe89
+title: 'Problem 10: Summation of primes'
+challengeType: 5
+forumTopicId: 301723
+dashedName: problem-10-summation-of-primes
+---
+
+# --description--
+
+The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
+
+Find the sum of all the primes below `n`.
+
+# --hints--
+
+`primeSummation(17)` should return a number.
+
+```js
+assert(typeof primeSummation(17) === 'number');
+```
+
+`primeSummation(17)` should return 41.
+
+```js
+assert.strictEqual(primeSummation(17), 41);
+```
+
+`primeSummation(2001)` should return 277050.
+
+```js
+assert.strictEqual(primeSummation(2001), 277050);
+```
+
+`primeSummation(140759)` should return 873608362.
+
+```js
+assert.strictEqual(primeSummation(140759), 873608362);
+```
+
+`primeSummation(2000000)` should return 142913828922.
+
+```js
+assert.strictEqual(primeSummation(2000000), 142913828922);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeSummation(n) {
+
+  return true;
+}
+
+primeSummation(2000000);
+```
+
+# --solutions--
+
+```js
+function primeSummation(n) {
+  if (n < 3) { return 0 };
+  let nums = [0, 0, 2];
+  for (let i = 3; i < n; i += 2){
+    nums.push(i);
+    nums.push(0);
+  }
+  let sum = 2;
+  for (let i = 3; i < n; i += 2){
+    if (nums[i] !== 0){
+      sum += nums[i];
+      for (let j = i*i; j < n; j += i){
+        nums[j] = 0;
+      }
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
new file mode 100644
index 0000000000..1d44675e28
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.md
@@ -0,0 +1,87 @@
+---
+id: 5900f3d01000cf542c50fee3
+title: 'Problem 100: Arranged probability'
+challengeType: 5
+forumTopicId: 301724
+dashedName: problem-100-arranged-probability
+---
+
+# --description--
+
+If a box contains twenty-one colored 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)} = \frac{15}{21}×\frac{14}{20} = \frac{1}{2}$$
+
+The next such arrangement, for which there is exactly a 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 `limit` discs in total, determine the number of blue discs that the box would contain.
+
+# --hints--
+
+`arrangedProbability(20)` should return a number.
+
+```js
+assert(typeof arrangedProbability(10) === 'number');
+```
+
+`arrangedProbability(20)` should return `15`.
+
+```js
+assert.strictEqual(arrangedProbability(20), 15);
+```
+
+`arrangedProbability(100)` should return `85`.
+
+```js
+assert.strictEqual(arrangedProbability(100), 85);
+```
+
+`arrangedProbability(100000)` should return `97513`.
+
+```js
+assert.strictEqual(arrangedProbability(100000), 97513);
+```
+
+`arrangedProbability(1000000000)` should return `3822685023`.
+
+```js
+assert.strictEqual(arrangedProbability(1000000000), 3822685023);
+```
+
+`arrangedProbability(1000000000000)` should return `756872327473`.
+
+```js
+assert.strictEqual(arrangedProbability(1000000000000), 756872327473);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function arrangedProbability(limit) {
+
+  return true;
+}
+
+arrangedProbability(20);
+```
+
+# --solutions--
+
+```js
+function arrangedProbability(limit) {
+  // Based on https://www.mathblog.dk/project-euler-100-blue-discs-two-blue/
+  let blue = 15;
+  let discs = 21;
+
+  while (discs < limit) {
+    const nextBlue = 3 * blue + 2 * discs - 2;
+    const nextDiscs = 4 * blue + 3 * discs - 3;
+
+    blue = nextBlue;
+    discs = nextDiscs;
+  }
+  return blue;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
new file mode 100644
index 0000000000..7573114475
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.md
@@ -0,0 +1,52 @@
+---
+id: 5900f3d21000cf542c50fee4
+title: 'Problem 101: Optimum polynomial'
+challengeType: 5
+forumTopicId: 301725
+dashedName: problem-101-optimum-polynomial
+---
+
+# --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.
+
+# --hints--
+
+`euler101()` should return 37076114526.
+
+```js
+assert.strictEqual(euler101(), 37076114526);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler101() {
+
+  return true;
+}
+
+euler101();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
new file mode 100644
index 0000000000..9705afbc6f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.md
@@ -0,0 +1,156 @@
+---
+id: 5900f3d21000cf542c50fee5
+title: 'Problem 102: Triangle containment'
+challengeType: 5
+forumTopicId: 301726
+dashedName: problem-102-triangle-containment
+---
+
+# --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:
+
+```js
+const exampleTriangles = [
+  [[-340, 495], [-153, -910], [835, -947]],
+  [[-175, 41], [-421, -714], [574, -645]]
+];
+```
+
+It can be verified that first triangle contains the origin, whereas second triangle does not.
+
+Using the `triangles` array containing coordinates of triangles, find the number of triangles for which the interior contains the origin.
+
+# --hints--
+
+`triangleContainment(exampleTriangles)` should return a number.
+
+```js
+assert(typeof triangleContainment(_exampleTriangles) === 'number');
+```
+
+`triangleContainment(exampleTriangles)` should return `1`.
+
+```js
+assert.strictEqual(triangleContainment(_exampleTriangles), 1);
+```
+
+`triangleContainment(testTriangles1)` should return `19`.
+
+```js
+assert.strictEqual(triangleContainment(_testTriangles1), 19);
+```
+
+`triangleContainment(testTriangles2)` should return `228`.
+
+```js
+assert.strictEqual(triangleContainment(_testTriangles2), 228);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _exampleTriangles = [
+  [[-340, 495], [-153, -910], [835, -947]],
+  [[-175, 41], [-421, -714], [574, -645]]
+];
+const _testTriangles1 = [
+  [[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]]
+];
+const _testTriangles2 = [
+  [[-340,495],[-153,-910],[835,-947]],[[-175,41],[-421,-714],[574,-645]],[[-547,712],[-352,579],[951,-786]],[[419,-864],[-83,650],[-399,171]],[[-429,-89],[-357,-930],[296,-29]],[[-734,-702],[823,-745],[-684,-62]],[[-971,762],[925,-776],[-663,-157]],[[162,570],[628,485],[-807,-896]],[[641,91],[-65,700],[887,759]],[[215,-496],[46,-931],[422,-30]],[[-119,359],[668,-609],[-358,-494]],[[440,929],[968,214],[760,-857]],[[-700,785],[838,29],[-216,411]],[[-770,-458],[-325,-53],[-505,633]],[[-752,-805],[349,776],[-799,687]],[[323,5],[561,-36],[919,-560]],[[-907,358],[264,320],[204,274]],[[-728,-466],[350,969],[292,-345]],[[940,836],[272,-533],[748,185]],[[411,998],[813,520],[316,-949]],[[-152,326],[658,-762],[148,-651]],[[330,507],[-9,-628],[101,174]],[[551,-496],[772,-541],[-702,-45]],[[-164,-489],[-90,322],[631,-59]],[[673,366],[-4,-143],[-606,-704]],[[428,-609],[801,-449],[740,-269]],[[453,-924],[-785,-346],[-853,111]],[[-738,555],[-181,467],[-426,-20]],[[958,-692],[784,-343],[505,-569]],[[620,27],[263,54],[-439,-726]],[[804,87],[998,859],[871,-78]],[[-119,-453],[-709,-292],[-115,-56]],[[-626,138],[-940,-476],[-177,-274]],[[-11,160],[142,588],[446,158]],[[538,727],[550,787],[330,810]],[[420,-689],[854,-546],[337,516]],[[872,-998],[-607,748],[473,-192]],[[653,440],[-516,-985],[808,-857]],[[374,-158],[331,-940],[-338,-641]],[[137,-925],[-179,771],[734,-715]],[[-314,198],[-115,29],[-641,-39]],[[759,-574],[-385,355],[590,-603]],[[-189,-63],[-168,204],[289,305]],[[-182,-524],[-715,-621],[911,-255]],[[331,-816],[-833,471],[168,126]],[[-514,581],[-855,-220],[-731,-507]],[[129,169],[576,651],[-87,-458]],[[783,-444],[-881,658],[-266,298]],[[603,-430],[-598,585],[368,899]],[[43,-724],[962,-376],[851,409]],[[-610,-646],[-883,-261],[-482,-881]],[[-117,-237],[978,641],[101,-747]],[[579,125],[-715,-712],[208,534]],[[672,-214],[-762,372],[874,533]],[[-564,965],[38,715],[367,242]],[[500,951],[-700,-981],[-61,-178]],[[-382,-224],[-959,903],[-282,-60]],[[-355,295],[426,-331],[-591,655]],[[892,128],[958,-271],[-993,274]],[[-454,-619],[302,138],[-790,-874]],[[-642,601],[-574,159],[-290,-318]],[[266,-109],[257,-686],[54,975]],[[162,628],[-478,840],[264,-266]],[[466,-280],[982,1],[904,-810]],[[721,839],[730,-807],[777,981]],[[-129,-430],[748,263],[943,96]],[[434,-94],[410,-990],[249,-704]],[[237,42],[122,-732],[44,-51]],[[909,-116],[-229,545],[292,717]],[[824,-768],[-807,-370],[-262,30]],[[675,58],[332,-890],[-651,791]],[[363,825],[-717,254],[684,240]],[[405,-715],[900,166],[-589,422]],[[-476,686],[-830,-319],[634,-807]],[[633,837],[-971,917],[-764,207]],[[-116,-44],[-193,-70],[908,809]],[[-26,-252],[998,408],[70,-713]],[[-601,645],[-462,842],[-644,-591]],[[-160,653],[274,113],[-138,687]],[[369,-273],[-181,925],[-167,-693]],[[-338,135],[480,-967],[-13,-840]],[[-90,-270],[-564,695],[161,907]],[[607,-430],[869,-713],[461,-469]],[[919,-165],[-776,522],[606,-708]],[[-203,465],[288,207],[-339,-458]],[[-453,-534],[-715,975],[838,-677]],[[-973,310],[-350,934],[546,-805]],[[-835,385],[708,-337],[-594,-772]],[[-14,914],[900,-495],[-627,594]],[[833,-713],[-213,578],[-296,699]],[[-27,-748],[484,455],[915,291]],[[270,889],[739,-57],[442,-516]],[[119,811],[-679,905],[184,130]],[[-678,-469],[925,553],[612,482]],[[101,-571],[-732,-842],[644,588]],[[-71,-737],[566,616],[957,-663]],[[-634,-356],[90,-207],[936,622]],[[598,443],[964,-895],[-58,529]],[[847,-467],[929,-742],[91,10]],[[-633,829],[-780,-408],[222,-30]],[[-818,57],[275,-38],[-746,198]],[[-722,-825],[-549,597],[-391,99]],[[-570,908],[430,873],[-103,-360]],[[342,-681],[512,434],[542,-528]],[[297,850],[479,609],[543,-357]],[[9,784],[212,548],[56,859]],[[-152,560],[-240,-969],[-18,713]],[[140,-133],[34,-635],[250,-163]],[[-272,-22],[-169,-662],[989,-604]],[[471,-765],[355,633],[-742,-118]],[[-118,146],[942,663],[547,-376]],[[583,16],[162,264],[715,-33]],[[-230,-446],[997,-838],[561,555]],[[372,397],[-729,-318],[-276,649]],[[92,982],[-970,-390],[-922,922]],[[-981,713],[-951,-337],[-669,670]],[[-999,846],[-831,-504],[7,-128]],[[455,-954],[-370,682],[-510,45]],[[822,-960],[-892,-385],[-662,314]],[[-668,-686],[-367,-246],[530,-341]],[[-723,-720],[-926,-836],[-142,757]],[[-509,-134],[384,-221],[-873,-639]],[[-803,-52],[-706,-669],[373,-339]],[[933,578],[631,-616],[770,555]],[[741,-564],[-33,-605],[-576,275]],[[-715,445],[-233,-730],[734,-704]],[[120,-10],[-266,-685],[-490,-17]],[[-232,-326],[-457,-946],[-457,-116]],[[811,52],[639,826],[-200,147]],[[-329,279],[293,612],[943,955]],[[-721,-894],[-393,-969],[-642,453]],[[-688,-826],[-352,-75],[371,79]],[[-809,-979],[407,497],[858,-248]],[[-485,-232],[-242,-582],[-81,849]],[[141,-106],[123,-152],[806,-596]],[[-428,57],[-992,811],[-192,478]],[[864,393],[122,858],[255,-876]],[[-284,-780],[240,457],[354,-107]],[[956,605],[-477,44],[26,-678]],[[86,710],[-533,-815],[439,327]],[[-906,-626],[-834,763],[426,-48]],[[201,-150],[-904,652],[475,412]],[[-247,149],[81,-199],[-531,-148]],[[923,-76],[-353,175],[-121,-223]],[[427,-674],[453,472],[-410,585]],[[931,776],[-33,85],[-962,-865]],[[-655,-908],[-902,208],[869,792]],[[-316,-102],[-45,-436],[-222,885]],[[-309,768],[-574,653],[745,-975]],[[896,27],[-226,993],[332,198]],[[323,655],[-89,260],[240,-902]],[[501,-763],[-424,793],[813,616]],[[993,375],[-938,-621],[672,-70]],[[-880,-466],[-283,770],[-824,143]],[[63,-283],[886,-142],[879,-116]],[[-964,-50],[-521,-42],[-306,-161]],[[724,-22],[866,-871],[933,-383]],[[-344,135],[282,966],[-80,917]],[[-281,-189],[420,810],[362,-582]],[[-515,455],[-588,814],[162,332]],[[555,-436],[-123,-210],[869,-943]],[[589,577],[232,286],[-554,876]],[[-773,127],[-58,-171],[-452,125]],[[-428,575],[906,-232],[-10,-224]],[[437,276],[-335,-348],[605,878]],[[-964,511],[-386,-407],[168,-220]],[[307,513],[912,-463],[-423,-416]],[[-445,539],[273,886],[-18,760]],[[-396,-585],[-670,414],[47,364]],[[143,-506],[754,906],[-971,-203]],[[-544,472],[-180,-541],[869,-465]],[[-779,-15],[-396,890],[972,-220]],[[-430,-564],[503,182],[-119,456]],[[89,-10],[-739,399],[506,499]],[[954,162],[-810,-973],[127,870]],[[890,952],[-225,158],[828,237]],[[-868,952],[349,465],[574,750]],[[-915,369],[-975,-596],[-395,-134]],[[-135,-601],[575,582],[-667,640]],[[413,890],[-560,-276],[-555,-562]],[[-633,-269],[561,-820],[-624,499]],[[371,-92],[-784,-593],[864,-717]],[[-971,655],[-439,367],[754,-951]],[[172,-347],[36,279],[-247,-402]],[[633,-301],[364,-349],[-683,-387]],[[-780,-211],[-713,-948],[-648,543]],[[72,58],[762,-465],[-66,462]],[[78,502],[781,-832],[713,836]],[[-431,-64],[-484,-392],[208,-343]],[[-64,101],[-29,-860],[-329,844]],[[398,391],[828,-858],[700,395]],[[578,-896],[-326,-604],[314,180]],[[97,-321],[-695,185],[-357,852]],[[854,839],[283,-375],[951,-209]],[[194,96],[-564,-847],[162,524]],[[-354,532],[494,621],[580,560]],[[419,-678],[-450,926],[-5,-924]],[[-661,905],[519,621],[-143,394]],[[-573,268],[296,-562],[-291,-319]],[[-211,266],[-196,158],[564,-183]],[[18,-585],[-398,777],[-581,864]],[[790,-894],[-745,-604],[-418,70]],[[848,-339],[150,773],[11,851]],[[-954,-809],[-53,-20],[-648,-304]],[[658,-336],[-658,-905],[853,407]],[[-365,-844],[350,-625],[852,-358]],[[986,-315],[-230,-159],[21,180]],[[-15,599],[45,-286],[-941,847]],[[-613,-68],[184,639],[-987,550]],[[334,675],[-56,-861],[923,340]],[[-848,-596],[960,231],[-28,-34]],[[707,-811],[-994,-356],[-167,-171]],[[-470,-764],[72,576],[-600,-204]],[[379,189],[-542,-576],[585,800]],[[440,540],[-445,-563],[379,-334]],[[-155,64],[514,-288],[853,106]],[[-304,751],[481,-520],[-708,-694]],[[-709,132],[594,126],[-844,63]],[[723,471],[421,-138],[-962,892]],[[-440,-263],[39,513],[-672,-954]],[[775,809],[-581,330],[752,-107]],[[-376,-158],[335,-708],[-514,578]],[[-343,-769],[456,-187],[25,413]],[[548,-877],[-172,300],[-500,928]],[[938,-102],[423,-488],[-378,-969]],[[-36,564],[-55,131],[958,-800]],[[-322,511],[-413,503],[700,-847]],[[-966,547],[-88,-17],[-359,-67]],[[637,-341],[-437,-181],[527,-153]],[[-74,449],[-28,3],[485,189]],[[-997,658],[-224,-948],[702,-807]],[[-224,736],[-896,127],[-945,-850]],[[-395,-106],[439,-553],[-128,124]],[[-841,-445],[-758,-572],[-489,212]],[[633,-327],[13,-512],[952,771]],[[-940,-171],[-6,-46],[-923,-425]],[[-142,-442],[-817,-998],[843,-695]],[[340,847],[-137,-920],[-988,-658]],[[-653,217],[-679,-257],[651,-719]],[[-294,365],[-41,342],[74,-892]],[[690,-236],[-541,494],[408,-516]],[[180,-807],[225,790],[494,59]],[[707,605],[-246,656],[284,271]],[[65,294],[152,824],[442,-442]],[[-321,781],[-540,341],[316,415]],[[420,371],[-2,545],[995,248]],[[56,-191],[-604,971],[615,449]],[[-981,-31],[510,592],[-390,-362]],[[-317,-968],[913,365],[97,508]],[[832,63],[-864,-510],[86,202]],[[-483,456],[-636,340],[-310,676]],[[981,-847],[751,-508],[-962,-31]],[[-157,99],[73,797],[63,-172]],[[220,858],[872,924],[866,-381]],[[996,-169],[805,321],[-164,971]],[[896,11],[-625,-973],[-782,76]],[[578,-280],[730,-729],[307,-905]],[[-580,-749],[719,-698],[967,603]],[[-821,874],[-103,-623],[662,-491]],[[-763,117],[661,-644],[672,-607]],[[592,787],[-798,-169],[-298,690]],[[296,644],[-526,-762],[-447,665]],[[534,-818],[852,-120],[57,-379]],[[-986,-549],[-329,294],[954,258]],[[-133,352],[-660,-77],[904,-356]],[[748,343],[215,500],[317,-277]],[[311,7],[910,-896],[-809,795]],[[763,-602],[-753,313],[-352,917]],[[668,619],[-474,-597],[-650,650]],[[-297,563],[-701,-987],[486,-902]],[[-461,-740],[-657,233],[-482,-328]],[[-446,-250],[-986,-458],[-629,520]],[[542,-49],[-327,-469],[257,-947]],[[121,-575],[-634,-143],[-184,521]],[[30,504],[455,-645],[-229,-945]],[[-12,-295],[377,764],[771,125]],[[-686,-133],[225,-25],[-376,-143]],[[-6,-46],[338,270],[-405,-872]],[[-623,-37],[582,467],[963,898]],[[-804,869],[-477,420],[-475,-303]],[[94,41],[-842,-193],[-768,720]],[[-656,-918],[415,645],[-357,460]],[[-47,-486],[-911,468],[-608,-686]],[[-158,251],[419,-394],[-655,-895]],[[272,-695],[979,508],[-358,959]],[[-776,650],[-918,-467],[-690,-534]],[[-85,-309],[-626,167],[-366,-429]],[[-880,-732],[-186,-924],[970,-875]],[[517,645],[-274,962],[-804,544]],[[721,402],[104,640],[478,-499]],[[198,684],[-134,-723],[-452,-905]],[[-245,745],[239,238],[-826,441]],[[-217,206],[-32,462],[-981,-895]],[[-51,989],[526,-173],[560,-676]],[[-480,-659],[-976,-580],[-727,466]],[[-996,-90],[-995,158],[-239,642]],[[302,288],[-194,-294],[17,924]],[[-943,969],[-326,114],[-500,103]],[[-619,163],[339,-880],[230,421]],[[-344,-601],[-795,557],[565,-779]],[[590,345],[-129,-202],[-125,-58]],[[-777,-195],[159,674],[775,411]],[[-939,312],[-665,810],[121,855]],[[-971,254],[712,815],[452,581]],[[442,-9],[327,-750],[61,757]],[[-342,869],[869,-160],[390,-772]],[[620,601],[565,-169],[-69,-183]],[[-25,924],[-817,964],[321,-970]],[[-64,-6],[-133,978],[825,-379]],[[601,436],[-24,98],[-115,940]],[[-97,502],[614,-574],[922,513]],[[-125,262],[-946,695],[99,-220]],[[429,-721],[719,-694],[197,-558]],[[326,689],[-70,-908],[-673,338]],[[-468,-856],[-902,-254],[-358,305]],[[-358,530],[542,355],[-253,-47]],[[-438,-74],[-362,963],[988,788]],[[137,717],[467,622],[319,-380]],[[-86,310],[-336,851],[918,-288]],[[721,395],[646,-53],[255,-425]],[[255,175],[912,84],[-209,878]],[[-632,-485],[-400,-357],[991,-608]],[[235,-559],[992,-297],[857,-591]],[[87,-71],[148,130],[647,578]],[[-290,-584],[-639,-788],[-21,592]],[[386,984],[625,-731],[-993,-336]],[[-538,634],[-209,-828],[-150,-774]],[[-754,-387],[607,-781],[976,-199]],[[412,-798],[-664,295],[709,-537]],[[-412,932],[-880,-232],[561,852]],[[-656,-358],[-198,-964],[-433,-848]],[[-762,-668],[-632,186],[-673,-11]],[[-876,237],[-282,-312],[-83,682]],[[403,73],[-57,-436],[-622,781]],[[-587,873],[798,976],[-39,329]],[[-369,-622],[553,-341],[817,794]],[[-108,-616],[920,-849],[-679,96]],[[290,-974],[234,239],[-284,-321]],[[-22,394],[-417,-419],[264,58]],[[-473,-551],[69,923],[591,-228]],[[-956,662],[-113,851],[-581,-794]],[[-258,-681],[413,-471],[-637,-817]],[[-866,926],[992,-653],[-7,794]],[[556,-350],[602,917],[831,-610]],[[188,245],[-906,361],[492,174]],[[-720,384],[-818,329],[638,-666]],[[-246,846],[890,-325],[-59,-850]],[[-118,-509],[620,-762],[-256,15]],[[-787,-536],[-452,-338],[-399,813]],[[458,560],[525,-311],[-608,-419]],[[494,-811],[-825,-127],[-812,894]],[[-801,890],[-629,-860],[574,925]],[[-709,-193],[-213,138],[-410,-403]],[[861,91],[708,-187],[5,-222]],[[789,646],[777,154],[90,-49]],[[-267,-830],[-114,531],[591,-698]],[[-126,-82],[881,-418],[82,652]],[[-894,130],[-726,-935],[393,-815]],[[-142,563],[654,638],[-712,-597]],[[-759,60],[-23,977],[100,-765]],[[-305,595],[-570,-809],[482,762]],[[-161,-267],[53,963],[998,-529]],[[-300,-57],[798,353],[703,486]],[[-990,696],[-764,699],[-565,719]],[[-232,-205],[566,571],[977,369]],[[740,865],[151,-817],[-204,-293]],[[94,445],[-768,229],[537,-406]],[[861,620],[37,-424],[-36,656]],[[390,-369],[952,733],[-464,569]],[[-482,-604],[959,554],[-705,-626]],[[-396,-615],[-991,108],[272,-723]],[[143,780],[535,142],[-917,-147]],[[138,-629],[-217,-908],[905,115]],[[915,103],[-852,64],[-468,-642]],[[570,734],[-785,-268],[-326,-759]],[[738,531],[-332,586],[-779,24]],[[870,440],[-217,473],[-383,415]],[[-296,-333],[-330,-142],[-924,950]],[[118,120],[-35,-245],[-211,-652]],[[61,634],[153,-243],[838,789]],[[726,-582],[210,105],[983,537]],[[-313,-323],[758,234],[29,848]],[[-847,-172],[-593,733],[-56,617]],[[54,255],[-512,156],[-575,675]],[[-873,-956],[-148,623],[95,200]],[[700,-370],[926,649],[-978,157]],[[-639,-202],[719,130],[747,222]],[[194,-33],[955,943],[505,114]],[[-226,-790],[28,-930],[827,783]],[[-392,-74],[-28,714],[218,-612]],[[209,626],[-888,-683],[-912,495]],[[487,751],[614,933],[631,445]],[[-348,-34],[-411,-106],[835,321]],[[-689,872],[-29,-800],[312,-542]],[[-52,566],[827,570],[-862,-77]],[[471,992],[309,-402],[389,912]],[[24,520],[-83,-51],[555,503]],[[-265,-317],[283,-970],[-472,690]],[[606,526],[137,71],[-651,150]],[[217,-518],[663,66],[-605,-331]],[[-562,232],[-76,-503],[205,-323]],[[842,-521],[546,285],[625,-186]],[[997,-927],[344,909],[-546,974]],[[-677,419],[81,121],[-705,771]],[[719,-379],[-944,-797],[784,-155]],[[-378,286],[-317,-797],[-111,964]],[[-288,-573],[784,80],[-532,-646]],[[-77,407],[-248,-797],[769,-816]],[[-24,-637],[287,-858],[-927,-333]],[[-902,37],[894,-823],[141,684]],[[125,467],[-177,-516],[686,399]],[[-321,-542],[641,-590],[527,-224]],[[-400,-712],[-876,-208],[632,-543]],[[-676,-429],[664,-242],[-269,922]],[[-608,-273],[-141,930],[687,380]],[[786,-12],[498,494],[310,326]],[[-739,-617],[606,-960],[804,188]],[[384,-368],[-243,-350],[-459,31]],[[-550,397],[320,-868],[328,-279]],[[969,-179],[853,864],[-110,514]],[[910,793],[302,-822],[-285,488]],[[-605,-128],[218,-283],[-17,-227]],[[16,324],[667,708],[750,3]],[[485,-813],[19,585],[71,930]],[[-218,816],[-687,-97],[-732,-360]],[[-497,-151],[376,-23],[3,315]],[[-412,-989],[-610,-813],[372,964]],[[-878,-280],[87,381],[-311,69]],[[-609,-90],[-731,-679],[150,585]],[[889,27],[-162,605],[75,-770]],[[448,617],[-988,0],[-103,-504]],[[-800,-537],[-69,627],[608,-668]],[[534,686],[-664,942],[830,920]],[[-238,775],[495,932],[-793,497]],[[-343,958],[-914,-514],[-691,651]],[[568,-136],[208,359],[728,28]],[[286,912],[-794,683],[556,-102]],[[-638,-629],[-484,445],[-64,-497]],[[58,505],[-801,-110],[872,632]],[[-390,777],[353,267],[976,369]],[[-993,515],[105,-133],[358,-572]],[[964,996],[355,-212],[-667,38]],[[-725,-614],[-35,365],[132,-196]],[[237,-536],[-416,-302],[312,477]],[[-664,574],[-210,224],[48,-925]],[[869,-261],[-256,-240],[-3,-698]],[[712,385],[32,-34],[916,-315]],[[895,-409],[-100,-346],[728,-624]],[[-806,327],[-450,889],[-781,-939]],[[-586,-403],[698,318],[-939,899]],[[557,-57],[-920,659],[333,-51]],[[-441,232],[-918,-205],[246,1]],[[783,167],[-797,-595],[245,-736]],[[-36,-531],[-486,-426],[-813,-160]],[[777,-843],[817,313],[-228,-572]],[[735,866],[-309,-564],[-81,190]],[[-413,645],[101,719],[-719,218]],[[-83,164],[767,796],[-430,-459]],[[122,779],[-15,-295],[-96,-892]],[[462,379],[70,548],[834,-312]],[[-630,-534],[124,187],[-737,114]],[[-299,-604],[318,-591],[936,826]],[[-879,218],[-642,-483],[-318,-866]],[[-691,62],[-658,761],[-895,-854]],[[-822,493],[687,569],[910,-202]],[[-223,784],[304,-5],[541,925]],[[-914,541],[737,-662],[-662,-195]],[[-622,615],[414,358],[881,-878]],[[339,745],[-268,-968],[-280,-227]],[[-364,855],[148,-709],[-827,472]],[[-890,-532],[-41,664],[-612,577]],[[-702,-859],[971,-722],[-660,-920]],[[-539,-605],[737,149],[973,-802]],[[800,42],[-448,-811],[152,511]],[[-933,377],[-110,-105],[-374,-937]],[[-766,152],[482,120],[-308,390]],[[-568,775],[-292,899],[732,890]],[[-177,-317],[-502,-259],[328,-511]],[[612,-696],[-574,-660],[132,31]],[[-119,563],[-805,-864],[179,-672]],[[425,-627],[183,-331],[839,318]],[[-711,-976],[-749,152],[-916,261]],[[181,-63],[497,211],[262,406]],[[-537,700],[-859,-765],[-928,77]],[[892,832],[231,-749],[-82,613]],[[816,216],[-642,-216],[-669,-912]],[[-6,624],[-937,-370],[-344,268]],[[737,-710],[-869,983],[-324,-274]],[[565,952],[-547,-158],[374,-444]],[[51,-683],[645,-845],[515,636]],[[-953,-631],[114,-377],[-764,-144]],[[-8,470],[-242,-399],[-675,-730]],[[-540,689],[-20,47],[-607,590]],[[-329,-710],[-779,942],[-388,979]],[[123,829],[674,122],[203,563]],[[46,782],[396,-33],[386,610]],[[872,-846],[-523,-122],[-55,-190]],[[388,-994],[-525,974],[127,596]],[[781,-680],[796,-34],[-959,-62]],[[-749,173],[200,-384],[-745,-446]],[[379,618],[136,-250],[-224,970]],[[-58,240],[-921,-760],[-901,-626]],[[366,-185],[565,-100],[515,688]],[[489,999],[-893,-263],[-637,816]],[[838,-496],[-316,-513],[419,479]],[[107,676],[-15,882],[98,-397]],[[-999,941],[-903,-424],[670,-325]],[[171,-979],[835,178],[169,-984]],[[-609,-607],[378,-681],[184,402]],[[-316,903],[-575,-800],[224,983]],[[591,-18],[-460,551],[-167,918]],[[-756,405],[-117,441],[163,-320]],[[456,24],[6,881],[-836,-539]],[[-489,-585],[915,651],[-892,-382]],[[-177,-122],[73,-711],[-386,591]],[[181,724],[530,686],[-131,241]],[[737,288],[886,216],[233,33]],[[-548,-386],[-749,-153],[-85,-982]],[[-835,227],[904,160],[-99,25]],[[-9,-42],[-162,728],[840,-963]],[[217,-763],[870,771],[47,-846]],[[-595,808],[-491,556],[337,-900]],[[-134,281],[-724,441],[-134,708]],[[-789,-508],[651,-962],[661,315]],[[-839,-923],[339,402],[41,-487]],[[300,-790],[48,703],[-398,-811]],[[955,-51],[462,-685],[960,-717]],[[910,-880],[592,-255],[-51,-776]],[[-885,169],[-793,368],[-565,458]],[[-905,940],[-492,-630],[-535,-988]],[[245,797],[763,869],[-82,550]],[[-310,38],[-933,-367],[-650,824]],[[-95,32],[-83,337],[226,990]],[[-218,-975],[-191,-208],[-785,-293]],[[-672,-953],[517,-901],[-247,465]],[[681,-148],[261,-857],[544,-923]],[[640,341],[446,-618],[195,769]],[[384,398],[-846,365],[671,815]],[[578,576],[-911,907],[762,-859]],[[548,-428],[144,-630],[-759,-146]],[[710,-73],[-700,983],[-97,-889]],[[-46,898],[-973,-362],[-817,-717]],[[151,-81],[-125,-900],[-478,-154]],[[483,615],[-537,-932],[181,-68]],[[786,-223],[518,25],[-306,-12]],[[-422,268],[-809,-683],[635,468]],[[983,-734],[-694,-608],[-110,4]],[[-786,-196],[749,-354],[137,-8]],[[-181,36],[668,-200],[691,-973]],[[-629,-838],[692,-736],[437,-871]],[[-208,-536],[-159,-596],[8,197]],[[-3,370],[-686,170],[913,-376]],[[44,-998],[-149,-993],[-200,512]],[[-519,136],[859,497],[536,434]],[[77,-985],[972,-340],[-705,-837]],[[-381,947],[250,360],[344,322]],[[-26,131],[699,750],[707,384]],[[-914,655],[299,193],[406,955]],[[-883,-921],[220,595],[-546,794]],[[-599,577],[-569,-404],[-704,489]],[[-594,-963],[-624,-460],[880,-760]],[[-603,88],[-99,681],[55,-328]],[[976,472],[139,-453],[-531,-860]],[[192,-290],[513,-89],[666,432]],[[417,487],[575,293],[567,-668]],[[655,711],[-162,449],[-980,972]],[[-505,664],[-685,-239],[603,-592]],[[-625,-802],[-67,996],[384,-636]],[[365,-593],[522,-666],[-200,-431]],[[-868,708],[560,-860],[-630,-355]],[[-702,785],[-637,-611],[-597,960]],[[-137,-696],[-93,-803],[408,406]],[[891,-123],[-26,-609],[-610,518]],[[133,-832],[-198,555],[708,-110]],[[791,617],[-69,487],[696,315]],[[-900,694],[-565,517],[-269,-416]],[[914,135],[-781,600],[-71,-600]],[[991,-915],[-422,-351],[-837,313]],[[-840,-398],[-302,21],[590,146]],[[62,-558],[-702,-384],[-625,831]],[[-363,-426],[-924,-496],[792,-908]],[[73,361],[-817,-466],[400,922]],[[-626,-164],[-626,860],[-524,286]],[[255,26],[-944,809],[-606,986]],[[-457,-256],[-103,50],[-867,-871]],[[-223,803],[196,480],[612,136]],[[-820,-928],[700,780],[-977,721]],[[717,332],[53,-933],[-128,793]],[[-602,-648],[562,593],[890,702]],[[-469,-875],[-527,911],[-475,-222]],[[110,-281],[-552,-536],[-816,596]],[[-981,654],[413,-981],[-75,-95]],[[-754,-742],[-515,894],[-220,-344]],[[795,-52],[156,408],[-603,76]],[[474,-157],[423,-499],[-807,-791]],[[260,688],[40,-52],[702,-122]],[[-584,-517],[-390,-881],[302,-504]],[[61,797],[665,708],[14,668]],[[366,166],[458,-614],[564,-983]],[[72,539],[-378,796],[381,-824]],[[-485,201],[-588,842],[736,379]],[[-149,-894],[-298,705],[-303,-406]],[[660,-935],[-580,521],[93,633]],[[-382,-282],[-375,-841],[-828,171]],[[-567,743],[-100,43],[144,122]],[[-281,-786],[-749,-551],[296,304]],[[11,-426],[-792,212],[857,-175]],[[594,143],[-699,289],[315,137]],[[341,596],[-390,107],[-631,-804]],[[-751,-636],[-424,-854],[193,651]],[[-145,384],[749,675],[-786,517]],[[224,-865],[-323,96],[-916,258]],[[-309,403],[-388,826],[35,-270]],[[-942,709],[222,158],[-699,-103]],[[-589,842],[-997,29],[-195,-210]],[[264,426],[566,145],[-217,623]],[[217,965],[507,-601],[-453,507]],[[-206,307],[-982,4],[64,-292]],[[676,-49],[-38,-701],[550,883]],[[5,-850],[-438,659],[745,-773]],[[933,238],[-574,-570],[91,-33]],[[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]],[[848,462],[100,-381],[135,242]],[[330,718],[-24,-190],[860,-78]],[[479,458],[941,108],[-866,-653]],[[212,980],[962,-962],[115,841]],[[-827,-474],[-206,881],[323,765]],[[506,-45],[-30,-293],[524,-133]],[[832,-173],[547,-852],[-561,-842]],[[-397,-661],[-708,819],[-545,-228]],[[521,51],[-489,852],[36,-258]],[[227,-164],[189,465],[-987,-882]],[[-73,-997],[641,-995],[449,-615]],[[151,-995],[-638,415],[257,-400]],[[-663,-297],[-748,537],[-734,198]],[[-585,-401],[-81,-782],[-80,-105]],[[99,-21],[238,-365],[-704,-368]],[[45,416],[849,-211],[-371,-1]],[[-404,-443],[795,-406],[36,-933]],[[272,-363],[981,-491],[-380,77]],[[713,-342],[-366,-849],[643,911]],[[-748,671],[-537,813],[961,-200]],[[-194,-909],[703,-662],[-601,188]],[[281,500],[724,286],[267,197]],[[-832,847],[-595,820],[-316,637]],[[520,521],[-54,261],[923,-10]],[[4,-808],[-682,-258],[441,-695]],[[-793,-107],[-969,905],[798,446]],[[-108,-739],[-590,69],[-855,-365]],[[380,-623],[-930,817],[468,713]],[[759,-849],[-236,433],[-723,-931]],[[95,-320],[-686,124],[-69,-329]],[[-655,518],[-210,-523],[284,-866]],[[144,303],[639,70],[-171,269]],[[173,-333],[947,-304],[55,40]],[[274,878],[-482,-888],[-835,375]],[[-982,-854],[-36,-218],[-114,-230]],[[905,-979],[488,-485],[-479,114]],[[877,-157],[553,-530],[-47,-321]],[[350,664],[-881,442],[-220,-284]],[[434,-423],[-365,878],[-726,584]],[[535,909],[-517,-447],[-660,-141]],[[-966,191],[50,353],[182,-642]],[[-785,-634],[123,-907],[-162,511]],[[146,-850],[-214,814],[-704,25]],[[692,1],[521,492],[-637,274]],[[-662,-372],[-313,597],[983,-647]],[[-962,-526],[68,-549],[-819,231]],[[740,-890],[-318,797],[-666,948]],[[-190,-12],[-468,-455],[948,284]],[[16,478],[-506,-888],[628,-154]],[[272,630],[-976,308],[433,3]],[[-169,-391],[-132,189],[302,-388]],[[109,-784],[474,-167],[-265,-31]],[[-177,-532],[283,464],[421,-73]],[[650,635],[592,-138],[1,-387]],[[-932,703],[-827,-492],[-355,686]],[[586,-311],[340,-618],[645,-434]],[[-951,736],[647,-127],[-303,590]],[[188,444],[903,718],[-931,500]],[[-872,-642],[-296,-571],[337,241]],[[23,65],[152,125],[880,470]],[[512,823],[-42,217],[823,-263]],[[180,-831],[-380,886],[607,762]],[[722,443],[-149,-216],[-115,759]],[[-19,660],[-36,901],[923,231]],[[562,-322],[-626,-968],[194,-825]],[[204,-920],[938,784],[362,150]],[[-410,-266],[-715,559],[-672,124]],[[-198,446],[-140,454],[-461,-447]],[[83,-346],[830,-493],[-759,-382]],[[-881,601],[581,234],[-134,-925]],[[-494,914],[-42,899],[235,629]],[[-390,50],[956,437],[774,-700]],[[-514,514],[44,-512],[-576,-313]],[[63,-688],[808,-534],[-570,-399]],[[-726,572],[-896,102],[-294,-28]],[[-688,757],[401,406],[955,-511]],[[-283,423],[-485,480],[-767,908]],[[-541,952],[-594,116],[-854,451]],[[-273,-796],[236,625],[-626,257]],[[-407,-493],[373,826],[-309,297]],[[-750,955],[-476,641],[-809,713]],[[8,415],[695,226],[-111,2]],[[733,209],[152,-920],[401,995]],[[921,-103],[-919,66],[871,-947]],[[-907,89],[-869,-214],[851,-559]],[[-307,748],[524,-755],[314,-711]],[[188,897],[-72,-763],[482,103]],[[545,-821],[-232,-596],[-334,-754]],[[-217,-788],[-820,388],[-200,-662]],[[779,160],[-723,-975],[-142,-998]],[[-978,-519],[-78,-981],[842,904]],[[-504,-736],[-295,21],[-472,-482]],[[391,115],[-705,574],[652,-446]],[[813,-988],[865,830],[-263,487]],[[194,80],[774,-493],[-761,-872]],[[-415,-284],[-803,7],[-810,670]],[[-484,-4],[881,-872],[55,-852]],[[-379,822],[-266,324],[-48,748]],[[-304,-278],[406,-60],[959,-89]],[[404,756],[577,-643],[-332,658]],[[291,460],[125,491],[-312,83]],[[311,-734],[-141,582],[282,-557]],[[-450,-661],[-981,710],[-177,794]],[[328,264],[-787,971],[-743,-407]],[[-622,518],[993,-241],[-738,229]],[[273,-826],[-254,-917],[-710,-111]],[[809,770],[96,368],[-818,725]],[[-488,773],[502,-342],[534,745]],[[-28,-414],[236,-315],[-484,363]],[[179,-466],[-566,713],[-683,56]],[[560,-240],[-597,619],[916,-940]],[[893,473],[872,-868],[-642,-461]],[[799,489],[383,-321],[-776,-833]],[[980,490],[-508,764],[-512,-426]],[[917,961],[-16,-675],[440,559]],[[-812,212],[784,-987],[-132,554]],[[-886,454],[747,806],[190,231]],[[910,341],[21,-66],[708,725]],[[29,929],[-831,-494],[-303,389]],[[-103,492],[-271,-174],[-515,529]],[[-292,119],[419,788],[247,-951]],[[483,543],[-347,-673],[664,-549]],[[-926,-871],[-437,337],[162,-877]],[[299,472],[-771,5],[-88,-643]],[[-103,525],[-725,-998],[264,22]],[[-505,708],[550,-545],[823,347]],[[-738,931],[59,147],[-156,-259]],[[456,968],[-162,889],[132,-911]],[[535,120],[968,-517],[-864,-541]],[[24,-395],[-593,-766],[-565,-332]],[[834,611],[825,-576],[280,629]],[[211,-548],[140,-278],[-592,929]],[[-999,-240],[-63,-78],[793,573]],[[-573,160],[450,987],[529,322]],[[63,353],[315,-187],[-461,577]],[[189,-950],[-247,656],[289,241]],[[209,-297],[397,664],[-805,484]],[[-655,452],[435,-556],[917,874]],[[253,-756],[262,-888],[-778,-214]],[[793,-451],[323,-251],[-401,-458]],[[-396,619],[-651,-287],[-668,-781]],[[698,720],[-349,742],[-807,546]],[[738,280],[680,279],[-540,858]],[[-789,387],[530,-36],[-551,-491]],[[162,579],[-427,-272],[228,710]],[[689,356],[917,-580],[729,217]],[[-115,-638],[866,424],[-82,-194]],[[411,-338],[-917,172],[227,-29]],[[-612,63],[630,-976],[-64,-204]],[[-200,911],[583,-571],[682,-579]],[[91,298],[396,-183],[788,-955]],[[141,-873],[-277,149],[-396,916]],[[321,958],[-136,573],[541,-777]],[[797,-909],[-469,-877],[988,-653]],[[784,-198],[129,883],[-203,399]],[[-68,-810],[223,-423],[-467,-512]],[[531,-445],[-603,-997],[-841,641]],[[-274,-242],[174,261],[-636,-158]],[[-574,494],[-796,-798],[-798,99]],[[95,-82],[-613,-954],[-753,986]],[[-883,-448],[-864,-401],[938,-392]],[[913,930],[-542,-988],[310,410]],[[506,-99],[43,512],[790,-222]],[[724,31],[49,-950],[260,-134]],[[-287,-947],[-234,-700],[56,588]],[[-33,782],[-144,948],[105,-791]],[[548,-546],[-652,-293],[881,-520]],[[691,-91],[76,991],[-631,742]],[[-520,-429],[-244,-296],[724,-48]],[[778,646],[377,50],[-188,56]],[[-895,-507],[-898,-165],[-674,652]],[[654,584],[-634,177],[-349,-620]],[[114,-980],[355,62],[182,975]],[[516,9],[-442,-298],[274,-579]],[[-238,262],[-431,-896],[506,-850]],[[47,748],[846,821],[-537,-293]],[[839,726],[593,285],[-297,840]],[[634,-486],[468,-304],[-887,-567]],[[-864,914],[296,-124],[335,233]],[[88,-253],[-523,-956],[-554,803]],[[-587,417],[281,-62],[-409,-363]],[[-136,-39],[-292,-768],[-264,876]],[[-127,506],[-891,-331],[-744,-430]],[[778,584],[-750,-129],[-479,-94]],[[-876,-771],[-987,-757],[180,-641]],[[-777,-694],[411,-87],[329,190]],[[-347,-999],[-882,158],[-754,232]],[[-105,918],[188,237],[-110,-591]],[[-209,703],[-838,77],[838,909]],[[-995,-339],[-762,750],[860,472]],[[185,271],[-289,173],[811,-300]],[[2,65],[-656,-22],[36,-139]],[[765,-210],[883,974],[961,-905]],[[-212,295],[-615,-840],[77,474]],[[211,-910],[-440,703],[-11,859]],[[-559,-4],[-196,841],[-277,969]],[[-73,-159],[-887,126],[978,-371]],[[-569,633],[-423,-33],[512,-393]],[[503,143],[-383,-109],[-649,-998]],[[-663,339],[-317,-523],[-2,596]],[[690,-380],[570,378],[-652,132]],[[72,-744],[-930,399],[-525,935]],[[865,-983],[115,37],[995,826]],[[594,-621],[-872,443],[188,-241]],[[-1000,291],[754,234],[-435,-869]],[[-868,901],[654,-907],[59,181]],[[-868,-793],[-431,596],[-446,-564]],[[900,-944],[-680,-796],[902,-366]],[[331,430],[943,853],[-851,-942]],[[315,-538],[-354,-909],[139,721]],[[170,-884],[-225,-818],[-808,-657]],[[-279,-34],[-533,-871],[-972,552]],[[691,-986],[-800,-950],[654,-747]],[[603,988],[899,841],[-630,591]],[[876,-949],[809,562],[602,-536]],[[-693,363],[-189,495],[738,-1000]],[[-383,431],[-633,297],[665,959]],[[-740,686],[-207,-803],[188,-520]],[[-820,226],[31,-339],[10,121]],[[-312,-844],[624,-516],[483,621]],[[-822,-529],[69,-278],[800,328]],[[834,-82],[-759,420],[811,-264]],[[-960,-240],[-921,561],[173,46]],[[-324,909],[-790,-814],[-2,-785]],[[976,334],[-290,-891],[704,-581]],[[150,-798],[689,-823],[237,-639]],[[-551,-320],[876,-502],[-622,-628]],[[-136,845],[904,595],[-702,-261]],[[-857,-377],[-522,-101],[-943,-805]],[[-682,-787],[-888,-459],[-752,-985]],[[-571,-81],[623,-133],[447,643]],[[-375,-158],[72,-387],[-324,-696]],[[-660,-650],[340,188],[569,526]],[[727,-218],[16,-7],[-595,-988]],[[-966,-684],[802,-783],[-272,-194]],[[115,-566],[-888,47],[712,180]],[[-237,-69],[45,-272],[981,-812]],[[48,897],[439,417],[50,325]],[[348,616],[180,254],[104,-784]],[[-730,811],[-548,612],[-736,790]],[[138,-810],[123,930],[65,865]],[[-768,-299],[-49,-895],[-692,-418]],[[487,-531],[802,-159],[-12,634]],[[808,-179],[552,-73],[470,717]],[[720,-644],[886,-141],[625,144]],[[-485,-505],[-347,-244],[-916,66]],[[600,-565],[995,-5],[324,227]],[[-771,-35],[904,-482],[753,-303]],[[-701,65],[426,-763],[-504,-479]],[[409,733],[-823,475],[64,718]],[[865,975],[368,893],[-413,-433]],[[812,-597],[-970,819],[813,624]],[[193,-642],[-381,-560],[545,398]],[[711,28],[-316,771],[717,-865]],[[-509,462],[809,-136],[786,635]],[[618,-49],[484,169],[635,547]],[[-747,685],[-882,-496],[-332,82]],[[-501,-851],[870,563],[290,570]],[[-279,-829],[-509,397],[457,816]],[[-508,80],[850,-188],[483,-326]],[[860,-100],[360,119],[-205,787]],[[-870,21],[-39,-827],[-185,932]],[[826,284],[-136,-866],[-330,-97]],[[-944,-82],[745,899],[-97,365]],[[929,262],[564,632],[-115,632]],[[244,-276],[713,330],[-897,-214]],[[-890,-109],[664,876],[-974,-907]],[[716,249],[816,489],[723,141]],[[-96,-560],[-272,45],[-70,645]],[[762,-503],[414,-828],[-254,-646]],[[909,-13],[903,-422],[-344,-10]],[[658,-486],[743,545],[50,674]],[[-241,507],[-367,18],[-48,-241]],[[886,-268],[884,-762],[120,-486]],[[-412,-528],[879,-647],[223,-393]],[[851,810],[234,937],[-726,797]],[[-999,942],[839,-134],[-996,-189]],[[100,979],[-527,-521],[378,800]],[[544,-844],[-832,-530],[-77,-641]],[[43,889],[31,442],[-934,-503]],[[-330,-370],[-309,-439],[173,547]],[[169,945],[62,-753],[-542,-597]],[[208,751],[-372,-647],[-520,70]],[[765,-840],[907,-257],[379,918]],[[334,-135],[-689,730],[-427,618]],[[137,-508],[66,-695],[78,169]],[[-962,-123],[400,-417],[151,969]],[[328,689],[666,427],[-555,-642]],[[-907,343],[605,-341],[-647,582]],[[-667,-363],[-571,818],[-265,-399]],[[525,-938],[904,898],[725,692]],[[-176,-802],[-858,-9],[780,275]],[[580,170],[-740,287],[691,-97]],[[365,557],[-375,361],[-288,859]],[[193,737],[842,-808],[520,282]],[[-871,65],[-799,836],[179,-720]],[[958,-144],[744,-789],[797,-48]],[[122,582],[662,912],[68,757]],[[595,241],[-801,513],[388,186]],[[-103,-677],[-259,-731],[-281,-857]],[[921,319],[-696,683],[-88,-997]],[[775,200],[78,858],[648,768]],[[316,821],[-763,68],[-290,-741]],[[564,664],[691,504],[760,787]],[[694,-119],[973,-385],[309,-760]],[[777,-947],[-57,990],[74,19]],[[971,626],[-496,-781],[-602,-239]],[[-651,433],[11,-339],[939,294]],[[-965,-728],[560,569],[-708,-247]]
+];
+```
+
+## --seed-contents--
+
+```js
+function triangleContainment(triangles) {
+
+  return true;
+}
+
+const testTriangles1 = [
+  [[-866,121],[-928,358],[459,-843]],[[-568,-631],[-352,-580],[-349,189]],[[-737,849],[-963,-486],[-662,970]],[[135,334],[-967,-71],[-365,-792]],[[789,21],[-227,51],[990,-275]],[[240,412],[-886,230],[591,256]],[[-609,472],[-853,-754],[959,661]],[[401,521],[521,314],[929,982]],[[-499,784],[-208,71],[-302,296]],[[-557,-948],[-553,-526],[-864,793]],[[270,-626],[828,44],[37,14]],[[-412,224],[617,-593],[502,699]],[[41,-908],[81,562],[-849,163]],[[165,917],[761,-197],[331,-341]],[[-687,314],[799,755],[-969,648]],[[-164,25],[578,439],[-334,-576]],[[213,535],[874,-177],[-551,24]],[[-689,291],[-795,-225],[-496,-125]],[[465,461],[558,-118],[-568,-909]],[[567,660],[-810,46],[-485,878]],[[-147,606],[685,-690],[-774,984]],[[568,-886],[-43,854],[-738,616]],[[-800,386],[-614,585],[764,-226]],[[-518,23],[-225,-732],[-79,440]],[[-173,-291],[-689,636],[642,-447]],[[-598,-16],[227,410],[496,211]],[[-474,-930],[-656,-321],[-420,36]],[[-435,165],[-819,555],[540,144]],[[-969,149],[828,568],[394,648]],[[65,-848],[257,720],[-625,-851]],[[981,899],[275,635],[465,-877]],[[80,290],[792,760],[-191,-321]],[[-605,-858],[594,33],[706,593]],[[585,-472],[318,-35],[354,-927]],[[-365,664],[803,581],[-965,-814]],[[-427,-238],[-480,146],[-55,-606]],[[879,-193],[250,-890],[336,117]],[[-226,-322],[-286,-765],[-836,-218]],[[-913,564],[-667,-698],[937,283]],[[872,-901],[810,-623],[-52,-709]],[[473,171],[717,38],[-429,-644]],[[225,824],[-219,-475],[-180,234]],[[-530,-797],[-948,238],[851,-623]],[[85,975],[-363,529],[598,28]],[[-799,166],[-804,210],[-769,851]],[[-687,-158],[885,736],[-381,-461]],[[447,592],[928,-514],[-515,-661]],[[-399,-777],[-493,80],[-544,-78]],[[-884,631],[171,-825],[-333,551]],[[191,268],[-577,676],[137,-33]],[[212,-853],[709,798],[583,-56]],[[-908,-172],[-540,-84],[-135,-56]],[[303,311],[406,-360],[-240,811]],[[798,-708],[824,59],[234,-57]],[[491,693],[-74,585],[-85,877]],[[509,-65],[-936,329],[-51,722]],[[-122,858],[-52,467],[-77,-609]],[[850,760],[547,-495],[-953,-952]],[[-460,-541],[890,910],[286,724]],[[-914,843],[-579,-983],[-387,-460]],[[989,-171],[-877,-326],[-899,458]],[[846,175],[-915,540],[-1000,-982]],[[-852,-920],[-306,496],[530,-18]],[[338,-991],[160,85],[-455,-661]],[[-186,-311],[-460,-563],[-231,-414]],[[-932,-302],[959,597],[793,748]],[[-366,-402],[-788,-279],[514,53]],[[-940,-956],[447,-956],[211,-285]],[[564,806],[-911,-914],[934,754]],[[575,-858],[-277,15],[409,-714]]
+];
+
+triangleContainment(testTriangles1);
+```
+
+# --solutions--
+
+```js
+function triangleContainment(triangles) {
+  function isInTriangle(triangle, point) {
+    // Based on https://stackoverflow.com/a/14382692
+    const area = triangleArea(triangle);
+    const s = getS(area, point, triangle);
+    const t = getT(area, point, triangle);
+
+    if (s > 0 && t > 0 && 1 - s - t > 0) {
+      return true;
+    }
+    return false;
+  }
+
+  function getS(area, point, triangle) {
+    return (
+      (1 / (2 * area)) *
+      (triangle.A.y * triangle.C.x -
+        triangle.A.x * triangle.C.y +
+        point.x * (triangle.C.y - triangle.A.y) +
+        point.y * (triangle.A.x - triangle.C.x))
+    );
+  }
+
+  function getT(area, point, triangle) {
+    return (
+      (1 / (2 * area)) *
+      (triangle.A.x * triangle.B.y -
+        triangle.A.y * triangle.B.x +
+        point.x * (triangle.A.y - triangle.B.y) +
+        point.y * (triangle.B.x - triangle.A.x))
+    );
+  }
+
+  function triangleArea(triangle) {
+    return (
+      0.5 *
+      (-triangle.B.y * triangle.C.x +
+        triangle.A.y * (-triangle.B.x + triangle.C.x) +
+        triangle.A.x * (triangle.B.y - triangle.C.y) +
+        triangle.B.x * triangle.C.y)
+    );
+  }
+
+  function parseTriangle(triangle) {
+    const points = [];
+    for (let i = 0; i < triangle.length; i++) {
+      const [coordinateX, coordinateY] = triangle[i];
+      points.push({ x: coordinateX, y: coordinateY });
+    }
+    const [pointA, pointB, pointC] = points;
+    return {
+      A: pointA,
+      B: pointB,
+      C: pointC
+    };
+  }
+
+  const origin = { x: 0, y: 0 };
+
+  let trianglesInside = 0;
+  for (let i = 0; i < triangles.length; i++) {
+    const triangle = parseTriangle(triangles[i]);
+
+    if (isInTriangle(triangle, origin)) {
+      trianglesInside++;
+    }
+  }
+  return trianglesInside;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
new file mode 100644
index 0000000000..1ba5808084
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3d61000cf542c50fee7
+title: 'Problem 103: Special subset sums: optimum'
+challengeType: 5
+forumTopicId: 301727
+dashedName: problem-103-special-subset-sums-optimum
+---
+
+# --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.
+
+# --hints--
+
+`euler103()` should return 20313839404245.
+
+```js
+assert.strictEqual(euler103(), 20313839404245);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler103() {
+
+  return true;
+}
+
+euler103();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
new file mode 100644
index 0000000000..625840f94a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3d51000cf542c50fee6
+title: 'Problem 104: Pandigital Fibonacci ends'
+challengeType: 5
+forumTopicId: 301728
+dashedName: problem-104-pandigital-fibonacci-ends
+---
+
+# --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.
+
+# --hints--
+
+`euler104()` should return 329468.
+
+```js
+assert.strictEqual(euler104(), 329468);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler104() {
+
+  return true;
+}
+
+euler104();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
new file mode 100644
index 0000000000..28d4d6ac86
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3d61000cf542c50fee8
+title: 'Problem 105: Special subset sums: testing'
+challengeType: 5
+forumTopicId: 301729
+dashedName: problem-105-special-subset-sums-testing
+---
+
+# --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.
+
+# --hints--
+
+`euler105()` should return 73702.
+
+```js
+assert.strictEqual(euler105(), 73702);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler105() {
+
+  return true;
+}
+
+euler105();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
new file mode 100644
index 0000000000..bb1db2e260
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3d71000cf542c50fee9
+title: 'Problem 106: Special subset sums: meta-testing'
+challengeType: 5
+forumTopicId: 301730
+dashedName: problem-106-special-subset-sums-meta-testing
+---
+
+# --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.
+
+# --hints--
+
+`euler106()` should return 21384.
+
+```js
+assert.strictEqual(euler106(), 21384);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler106() {
+
+  return true;
+}
+
+euler106();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
new file mode 100644
index 0000000000..f51dfe801d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-107-minimal-network.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3d91000cf542c50feea
+title: 'Problem 107: Minimal network'
+challengeType: 5
+forumTopicId: 301731
+dashedName: problem-107-minimal-network
+---
+
+# --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.
+
+# --hints--
+
+`euler107()` should return 259679.
+
+```js
+assert.strictEqual(euler107(), 259679);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler107() {
+
+  return true;
+}
+
+euler107();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
new file mode 100644
index 0000000000..d216cfa9fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3d91000cf542c50feeb
+title: 'Problem 108: Diophantine Reciprocals I'
+challengeType: 5
+forumTopicId: 301732
+dashedName: problem-108-diophantine-reciprocals-i
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers.
+
+1/`x` + 1/`y` = 1/`n`
+
+For `n` = 4 there are exactly three distinct solutions:
+
+1/5 + 1/20 = 1/4  
+1/6 + 1/12 = 1/4  
+1/8 + 1/8 = 1/4
+
+What is the least value of `n` for which the number of distinct solutions exceeds one-thousand?
+
+# --hints--
+
+`diophantineOne()` should return 180180.
+
+```js
+assert.strictEqual(diophantineOne(), 180180);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineOne() {
+
+  return true;
+}
+
+diophantineOne();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-109-darts.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-109-darts.md
new file mode 100644
index 0000000000..e7a580b45b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-109-darts.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3db1000cf542c50feec
+title: 'Problem 109: Darts'
+challengeType: 5
+forumTopicId: 301733
+dashedName: problem-109-darts
+---
+
+# --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?
+
+# --hints--
+
+`euler109()` should return 38182.
+
+```js
+assert.strictEqual(euler109(), 38182);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler109() {
+
+  return true;
+}
+
+euler109();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
new file mode 100644
index 0000000000..d7610e3ac3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.md
@@ -0,0 +1,182 @@
+---
+id: 5900f3781000cf542c50fe8a
+title: 'Problem 11: Largest product in a grid'
+challengeType: 5
+forumTopicId: 301734
+dashedName: problem-11-largest-product-in-a-grid
+---
+
+# --description--
+
+In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
+
+<div style='text-align: center;'>
+  08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08<br>
+  49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00<br>
+  81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65<br>
+  52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91<br>
+  22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80<br>
+  24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50<br>
+  32 98 81 28 64 23 67 10 <span style='color: red'><b>26</b></span> 38 40 67 59 54 70 66 18 38 64 70<br>
+  67 26 20 68 02 62 12 20 95 <span style='color: red'><b>63</b></span> 94 39 63 08 40 91 66 49 94 21<br>
+  24 55 58 05 66 73 99 26 97 17 <span style='color: red'><b>78</b></span> 78 96 83 14 88 34 89 63 72<br>
+  21 36 23 09 75 00 76 44 20 45 35 <span style='color: red'><b>14</b></span> 00 61 33 97 34 31 33 95<br>
+  78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92<br>
+  16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57<br>
+  86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58<br>
+  19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40<br>
+  04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66<br>
+  88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69<br>
+  04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36<br>
+  20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16<br>
+  20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54<br>
+  01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48<br>
+</div>
+
+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 a given `arr` grid?
+
+# --hints--
+
+`largestGridProduct(testGrid)` should return a number.
+
+```js
+assert(typeof largestGridProduct(testGrid) === 'number');
+```
+
+`largestGridProduct(testGrid)` should return 14169081.
+
+```js
+assert.strictEqual(largestGridProduct(testGrid), 14169081);
+```
+
+`largestGridProduct(grid)` should return 70600674.
+
+```js
+assert.strictEqual(largestGridProduct(grid), 70600674);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestGridProduct(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+const grid = [
+  [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
+  [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
+  [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
+  [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 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, 3, 45, 2, 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, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
+  [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
+  [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
+  [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
+  [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
+  [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
+  [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
+  [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
+  [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
+  [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
+  [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
+  [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
+  [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
+];
+
+const testGrid = [
+  [40, 17, 81, 18, 57],
+  [74, 4, 36, 16, 29],
+  [36, 42, 69, 73, 45],
+  [51, 54, 69, 16, 92],
+  [7, 97, 57, 32, 16]
+];
+
+largestGridProduct(testGrid);
+```
+
+# --solutions--
+
+```js
+function largestGridProduct(arr) {
+  let maxProduct = 0;
+  let currProduct = 0;
+
+  function maxProductChecker(n) {
+    if (n > maxProduct) {
+      return maxProduct = n;
+    }
+  }
+
+  // loop rows
+  for (let r = 0; r < arr.length; r++) {
+    // loop columns
+    for (let c = 0; c < arr[r].length; c++) {
+      const limit = arr[r].length - 3;
+
+      // check horizontal
+      if (c < limit) {
+        currProduct = arr[r][c] * arr[r][c + 1] * arr[r][c + 2] * arr[r][c + 3];
+        maxProductChecker(currProduct);
+      }
+
+      // check vertical
+      if (r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c] * arr[r + 2][c] * arr[r + 3][c];
+        maxProductChecker(currProduct);
+      }
+
+      // check diagonal [\]
+      if (c < limit && r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c + 1] * arr[r + 2][c + 2] * arr[r + 3][c + 3];
+        maxProductChecker(currProduct);
+      }
+
+      // check diagonal [/]
+      if (c > 3 && r < limit) {
+        currProduct = arr[r][c] * arr[r + 1][c - 1] * arr[r + 2][c - 2] * arr[r + 3][c - 3];
+        maxProductChecker(currProduct);
+      }
+    }
+  }
+
+  return maxProduct;
+}
+
+ const grid = [  [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
+  [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
+  [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
+  [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 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, 3, 45, 2, 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, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
+  [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
+  [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
+  [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
+  [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
+  [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
+  [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
+  [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
+  [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
+  [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
+  [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
+  [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
+  [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
+];
+
+const testGrid = [
+  [40, 17, 81, 18, 57],
+  [74, 4, 36, 16, 29],
+  [36, 42, 69, 73, 45],
+  [51, 54, 69, 16, 92],
+  [7, 97, 57, 32, 16]
+];
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
new file mode 100644
index 0000000000..c50c81a164
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3db1000cf542c50feed
+title: 'Problem 110: Diophantine Reciprocals II'
+challengeType: 5
+forumTopicId: 301735
+dashedName: problem-110-diophantine-reciprocals-ii
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers.
+
+1/`x` + 1/`y` = 1/`n`
+
+It can be verified that when `n` = 1260 there are 113 distinct solutions and this is the least value of `n` for which the total number of distinct solutions exceeds one hundred.
+
+What is the least value of `n` for which the number of distinct solutions exceeds four million?
+
+# --hints--
+
+`diophantineTwo()` should return 9350130049860600.
+
+```js
+assert.strictEqual(diophantineTwo(), 9350130049860600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineTwo() {
+
+  return true;
+}
+
+diophantineTwo();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
new file mode 100644
index 0000000000..920085b1f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3db1000cf542c50feee
+title: 'Problem 111: Primes with runs'
+challengeType: 5
+forumTopicId: 301736
+dashedName: problem-111-primes-with-runs
+---
+
+# --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).
+
+# --hints--
+
+`euler111()` should return 612407567715.
+
+```js
+assert.strictEqual(euler111(), 612407567715);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler111() {
+
+  return true;
+}
+
+euler111();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
new file mode 100644
index 0000000000..cd998d5bde
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f3dd1000cf542c50feef
+title: 'Problem 112: Bouncy numbers'
+challengeType: 5
+forumTopicId: 301738
+dashedName: problem-112-bouncy-numbers
+---
+
+# --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%.
+
+# --hints--
+
+`euler112()` should return 1587000.
+
+```js
+assert.strictEqual(euler112(), 1587000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler112() {
+
+  return true;
+}
+
+euler112();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
new file mode 100644
index 0000000000..bc28697a24
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3dd1000cf542c50fef0
+title: 'Problem 113: Non-bouncy numbers'
+challengeType: 5
+forumTopicId: 301739
+dashedName: problem-113-non-bouncy-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler113()` should return 51161058134250.
+
+```js
+assert.strictEqual(euler113(), 51161058134250);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler113() {
+
+  return true;
+}
+
+euler113();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
new file mode 100644
index 0000000000..c9ec66c9aa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e01000cf542c50fef2
+title: 'Problem 114: Counting block combinations I'
+challengeType: 5
+forumTopicId: 301740
+dashedName: problem-114-counting-block-combinations-i
+---
+
+# --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).
+
+# --hints--
+
+`euler114()` should return 16475640049.
+
+```js
+assert.strictEqual(euler114(), 16475640049);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler114() {
+
+  return true;
+}
+
+euler114();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
new file mode 100644
index 0000000000..069a8a2c38
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.md
@@ -0,0 +1,50 @@
+---
+id: 5900f3df1000cf542c50fef1
+title: 'Problem 115: Counting block combinations II'
+challengeType: 5
+forumTopicId: 301741
+dashedName: problem-115-counting-block-combinations-ii
+---
+
+# --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.
+
+# --hints--
+
+`euler115()` should return 168.
+
+```js
+assert.strictEqual(euler115(), 168);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler115() {
+
+  return true;
+}
+
+euler115();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
new file mode 100644
index 0000000000..1f61195dea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3e01000cf542c50fef3
+title: 'Problem 116: Red, green or blue tiles'
+challengeType: 5
+forumTopicId: 301742
+dashedName: problem-116-red-green-or-blue-tiles
+---
+
+# --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.
+
+# --hints--
+
+`euler116()` should return 20492570929.
+
+```js
+assert.strictEqual(euler116(), 20492570929);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler116() {
+
+  return true;
+}
+
+euler116();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
new file mode 100644
index 0000000000..80f46d1201
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e21000cf542c50fef4
+title: 'Problem 117: Red, green, and blue tiles'
+challengeType: 5
+forumTopicId: 301743
+dashedName: problem-117-red-green-and-blue-tiles
+---
+
+# --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.
+
+# --hints--
+
+`euler117()` should return 100808458960497.
+
+```js
+assert.strictEqual(euler117(), 100808458960497);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler117() {
+
+  return true;
+}
+
+euler117();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
new file mode 100644
index 0000000000..8bcd4b5dcd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3e21000cf542c50fef5
+title: 'Problem 118: Pandigital prime sets'
+challengeType: 5
+forumTopicId: 301744
+dashedName: problem-118-pandigital-prime-sets
+---
+
+# --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?
+
+# --hints--
+
+`euler118()` should return 44680.
+
+```js
+assert.strictEqual(euler118(), 44680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler118() {
+
+  return true;
+}
+
+euler118();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
new file mode 100644
index 0000000000..40853a1314
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e41000cf542c50fef6
+title: 'Problem 119: Digit power sum'
+challengeType: 5
+forumTopicId: 301745
+dashedName: problem-119-digit-power-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler119()` should return 248155780267521.
+
+```js
+assert.strictEqual(euler119(), 248155780267521);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler119() {
+
+  return true;
+}
+
+euler119();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
new file mode 100644
index 0000000000..b14276a81e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.md
@@ -0,0 +1,139 @@
+---
+id: 5900f3781000cf542c50fe8b
+title: 'Problem 12: Highly divisible triangular number'
+challengeType: 5
+forumTopicId: 301746
+dashedName: problem-12-highly-divisible-triangular-number
+---
+
+# --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:
+
+<div style='text-align: center;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
+
+Let us list the factors of the first seven triangle numbers:
+
+<div style='padding-left: 4em;'><b>1:</b> 1</div>
+<div style='padding-left: 4em;'><b>3:</b> 1, 3</div>
+<div style='padding-left: 4em;'><b>6:</b> 1, 2, 3, 6</div>
+<div style='padding-left: 4em;'><b>10:</b> 1, 2, 5, 10</div>
+<div style='padding-left: 4em;'><b>15:</b> 1, 3, 5, 15</div>
+<div style='padding-left: 4em;'><b>21:</b> 1, 3, 7, 21</div>
+<div style='padding-left: 4em;'><b>28:</b> 1, 2, 4, 7, 14, 28</div>
+
+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 `n` divisors?
+
+# --hints--
+
+`divisibleTriangleNumber(5)` should return a number.
+
+```js
+assert(typeof divisibleTriangleNumber(5) === 'number');
+```
+
+`divisibleTriangleNumber(5)` should return 28.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(5), 28);
+```
+
+`divisibleTriangleNumber(23)` should return 630.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(23), 630);
+```
+
+`divisibleTriangleNumber(167)` should return 1385280.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(167), 1385280);
+```
+
+`divisibleTriangleNumber(374)` should return 17907120.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(374), 17907120);
+```
+
+`divisibleTriangleNumber(500)` should return 76576500.
+
+```js
+assert.strictEqual(divisibleTriangleNumber(500), 76576500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function divisibleTriangleNumber(n) {
+
+  return true;
+}
+
+divisibleTriangleNumber(500);
+```
+
+# --solutions--
+
+```js
+function divisibleTriangleNumber(n) {
+  if (n === 1) return 3;
+  let counter = 1;
+  let triangleNumber = counter++;
+
+
+ while (noOfFactors(triangleNumber) < n) {
+   triangleNumber += counter++;
+ }
+return triangleNumber;
+}
+
+function noOfFactors(num) {
+  const primeFactors = getPrimeFactors(num);
+  let prod = 1;
+  for(let p in primeFactors) {
+    prod *= (primeFactors[p] + 1)
+  }
+  return prod;
+}
+
+function getPrimeFactors(num) {
+  let n = num;
+  let primes = {};
+
+  let p = 2;
+  let sqrt = Math.sqrt(num);
+
+  function checkAndUpdate(inc) {
+    if (n % p === 0) {
+      const curr = primes[p];
+      if (curr) {
+        primes[p]++
+      } else {
+        primes[p] = 1;
+      }
+      n /= p;
+    } else {
+      p += inc;
+    }
+  }
+
+  while(p === 2 && p <= n) {
+    checkAndUpdate(1);
+  }
+
+  while (p <= n && p <= sqrt) {
+    checkAndUpdate(2);
+  }
+  if(Object.keys(primes).length === 0) {
+    primes[num] = 1;
+  } else if(n !== 1) {
+    primes[n] = 1;
+  }
+  return primes;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-120-square-remainders.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
new file mode 100644
index 0000000000..6bcf398e78
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-120-square-remainders.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3e41000cf542c50fef7
+title: 'Problem 120: Square remainders'
+challengeType: 5
+forumTopicId: 301747
+dashedName: problem-120-square-remainders
+---
+
+# --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.
+
+# --hints--
+
+`euler120()` should return 333082500.
+
+```js
+assert.strictEqual(euler120(), 333082500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler120() {
+
+  return true;
+}
+
+euler120();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
new file mode 100644
index 0000000000..1cc716c41c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e51000cf542c50fef8
+title: 'Problem 121: Disc game prize fund'
+challengeType: 5
+forumTopicId: 301748
+dashedName: problem-121-disc-game-prize-fund
+---
+
+# --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.
+
+# --hints--
+
+`euler121()` should return 2269.
+
+```js
+assert.strictEqual(euler121(), 2269);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler121() {
+
+  return true;
+}
+
+euler121();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
new file mode 100644
index 0000000000..7da1b4274e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.md
@@ -0,0 +1,52 @@
+---
+id: 5900f3e61000cf542c50fef9
+title: 'Problem 122: Efficient exponentiation'
+challengeType: 5
+forumTopicId: 301749
+dashedName: problem-122-efficient-exponentiation
+---
+
+# --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).
+
+# --hints--
+
+`euler122()` should return 1582.
+
+```js
+assert.strictEqual(euler122(), 1582);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler122() {
+
+  return true;
+}
+
+euler122();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
new file mode 100644
index 0000000000..cb7b7afda1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3e71000cf542c50fefa
+title: 'Problem 123: Prime square remainders'
+challengeType: 5
+forumTopicId: 301750
+dashedName: problem-123-prime-square-remainders
+---
+
+# --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.
+
+# --hints--
+
+`euler123()` should return 21035.
+
+```js
+assert.strictEqual(euler123(), 21035);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler123() {
+
+  return true;
+}
+
+euler123();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
new file mode 100644
index 0000000000..1dfc34dc9b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3e81000cf542c50fefb
+title: 'Problem 124: Ordered radicals'
+challengeType: 5
+forumTopicId: 301751
+dashedName: problem-124-ordered-radicals
+---
+
+# --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).
+
+# --hints--
+
+`euler124()` should return 21417.
+
+```js
+assert.strictEqual(euler124(), 21417);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler124() {
+
+  return true;
+}
+
+euler124();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
new file mode 100644
index 0000000000..460f5e2a23
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3e91000cf542c50fefc
+title: 'Problem 125: Palindromic sums'
+challengeType: 5
+forumTopicId: 301752
+dashedName: problem-125-palindromic-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler125()` should return 2906969179.
+
+```js
+assert.strictEqual(euler125(), 2906969179);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler125() {
+
+  return true;
+}
+
+euler125();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
new file mode 100644
index 0000000000..fe9b4a6aa8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3ea1000cf542c50fefd
+title: 'Problem 126: Cuboid layers'
+challengeType: 5
+forumTopicId: 301753
+dashedName: problem-126-cuboid-layers
+---
+
+# --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.
+
+# --hints--
+
+`euler126()` should return 18522.
+
+```js
+assert.strictEqual(euler126(), 18522);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler126() {
+
+  return true;
+}
+
+euler126();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
new file mode 100644
index 0000000000..665e17c0a7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-127-abc-hits.md
@@ -0,0 +1,62 @@
+---
+id: 5900f3ec1000cf542c50fefe
+title: 'Problem 127: abc-hits'
+challengeType: 5
+forumTopicId: 301754
+dashedName: problem-127-abc-hits
+---
+
+# --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 &lt; b
+
+a + b = c
+
+rad(abc) &lt; c
+
+For example, (5, 27, 32) is an abc-hit, because:
+
+GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1
+
+5 &lt; 27
+
+5 + 27 = 32
+
+rad(4320) = 30 &lt; 32
+
+It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c &lt; 1000, with ∑c = 12523.
+
+Find ∑c for c &lt; 120000.
+
+# --hints--
+
+`euler127()` should return 18407904.
+
+```js
+assert.strictEqual(euler127(), 18407904);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler127() {
+
+  return true;
+}
+
+euler127();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
new file mode 100644
index 0000000000..7bdd624234
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3ec1000cf542c50feff
+title: 'Problem 128: Hexagonal tile differences'
+challengeType: 5
+forumTopicId: 301755
+dashedName: problem-128-hexagonal-tile-differences
+---
+
+# --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.
+
+# --hints--
+
+`euler128()` should return 14516824220.
+
+```js
+assert.strictEqual(euler128(), 14516824220);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler128() {
+
+  return true;
+}
+
+euler128();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
new file mode 100644
index 0000000000..0d8f6c2916
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ef1000cf542c50ff01
+title: 'Problem 129: Repunit divisibility'
+challengeType: 5
+forumTopicId: 301756
+dashedName: problem-129-repunit-divisibility
+---
+
+# --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.
+
+# --hints--
+
+`euler129()` should return 1000023.
+
+```js
+assert.strictEqual(euler129(), 1000023);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler129() {
+
+  return true;
+}
+
+euler129();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-13-large-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
new file mode 100644
index 0000000000..05775850cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-13-large-sum.md
@@ -0,0 +1,286 @@
+---
+id: 5900f37a1000cf542c50fe8c
+title: 'Problem 13: Large sum'
+challengeType: 5
+forumTopicId: 301757
+dashedName: problem-13-large-sum
+---
+
+# --description--
+
+Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
+
+<div style='padding-left: 4em;'>
+  37107287533902102798797998220837590246510135740250<br>
+  46376937677490009712648124896970078050417018260538<br>
+  74324986199524741059474233309513058123726617309629<br>
+  91942213363574161572522430563301811072406154908250<br>
+  23067588207539346171171980310421047513778063246676<br>
+  89261670696623633820136378418383684178734361726757<br>
+  28112879812849979408065481931592621691275889832738<br>
+  44274228917432520321923589422876796487670272189318<br>
+  47451445736001306439091167216856844588711603153276<br>
+  70386486105843025439939619828917593665686757934951<br>
+  62176457141856560629502157223196586755079324193331<br>
+  64906352462741904929101432445813822663347944758178<br>
+  92575867718337217661963751590579239728245598838407<br>
+  58203565325359399008402633568948830189458628227828<br>
+  80181199384826282014278194139940567587151170094390<br>
+  35398664372827112653829987240784473053190104293586<br>
+  86515506006295864861532075273371959191420517255829<br>
+  71693888707715466499115593487603532921714970056938<br>
+  54370070576826684624621495650076471787294438377604<br>
+  53282654108756828443191190634694037855217779295145<br>
+  36123272525000296071075082563815656710885258350721<br>
+  45876576172410976447339110607218265236877223636045<br>
+  17423706905851860660448207621209813287860733969412<br>
+  81142660418086830619328460811191061556940512689692<br>
+  51934325451728388641918047049293215058642563049483<br>
+  62467221648435076201727918039944693004732956340691<br>
+  15732444386908125794514089057706229429197107928209<br>
+  55037687525678773091862540744969844508330393682126<br>
+  18336384825330154686196124348767681297534375946515<br>
+  80386287592878490201521685554828717201219257766954<br>
+  78182833757993103614740356856449095527097864797581<br>
+  16726320100436897842553539920931837441497806860984<br>
+  48403098129077791799088218795327364475675590848030<br>
+  87086987551392711854517078544161852424320693150332<br>
+  59959406895756536782107074926966537676326235447210<br>
+  69793950679652694742597709739166693763042633987085<br>
+  41052684708299085211399427365734116182760315001271<br>
+  65378607361501080857009149939512557028198746004375<br>
+  35829035317434717326932123578154982629742552737307<br>
+  94953759765105305946966067683156574377167401875275<br>
+  88902802571733229619176668713819931811048770190271<br>
+  25267680276078003013678680992525463401061632866526<br>
+  36270218540497705585629946580636237993140746255962<br>
+  24074486908231174977792365466257246923322810917141<br>
+  91430288197103288597806669760892938638285025333403<br>
+  34413065578016127815921815005561868836468420090470<br>
+  23053081172816430487623791969842487255036638784583<br>
+  11487696932154902810424020138335124462181441773470<br>
+  63783299490636259666498587618221225225512486764533<br>
+  67720186971698544312419572409913959008952310058822<br>
+  95548255300263520781532296796249481641953868218774<br>
+  76085327132285723110424803456124867697064507995236<br>
+  37774242535411291684276865538926205024910326572967<br>
+  23701913275725675285653248258265463092207058596522<br>
+  29798860272258331913126375147341994889534765745501<br>
+  18495701454879288984856827726077713721403798879715<br>
+  38298203783031473527721580348144513491373226651381<br>
+  34829543829199918180278916522431027392251122869539<br>
+  40957953066405232632538044100059654939159879593635<br>
+  29746152185502371307642255121183693803580388584903<br>
+  41698116222072977186158236678424689157993532961922<br>
+  62467957194401269043877107275048102390895523597457<br>
+  23189706772547915061505504953922979530901129967519<br>
+  86188088225875314529584099251203829009407770775672<br>
+  11306739708304724483816533873502340845647058077308<br>
+  82959174767140363198008187129011875491310547126581<br>
+  97623331044818386269515456334926366572897563400500<br>
+  42846280183517070527831839425882145521227251250327<br>
+  55121603546981200581762165212827652751691296897789<br>
+  32238195734329339946437501907836945765883352399886<br>
+  75506164965184775180738168837861091527357929701337<br>
+  62177842752192623401942399639168044983993173312731<br>
+  32924185707147349566916674687634660915035914677504<br>
+  99518671430235219628894890102423325116913619626622<br>
+  73267460800591547471830798392868535206946944540724<br>
+  76841822524674417161514036427982273348055556214818<br>
+  97142617910342598647204516893989422179826088076852<br>
+  87783646182799346313767754307809363333018982642090<br>
+  10848802521674670883215120185883543223812876952786<br>
+  71329612474782464538636993009049310363619763878039<br>
+  62184073572399794223406235393808339651327408011116<br>
+  66627891981488087797941876876144230030984490851411<br>
+  60661826293682836764744779239180335110989069790714<br>
+  85786944089552990653640447425576083659976645795096<br>
+  66024396409905389607120198219976047599490197230297<br>
+  64913982680032973156037120041377903785566085089252<br>
+  16730939319872750275468906903707539413042652315011<br>
+  94809377245048795150954100921645863754710598436791<br>
+  78639167021187492431995700641917969777599028300699<br>
+  15368713711936614952811305876380278410754449733078<br>
+  40789923115535562561142322423255033685442488917353<br>
+  44889911501440648020369068063960672322193204149535<br>
+  41503128880339536053299340368006977710650566631954<br>
+  81234880673210146739058568557934581403627822703280<br>
+  82616570773948327592232845941706525094512325230608<br>
+  22918802058777319719839450180888072429661980811197<br>
+  77158542502016545090413245809786882778948721859617<br>
+  72107838435069186155435662884062257473692284509516<br>
+  20849603980134001723930671666823555245252804609722<br>
+  53503534226472524250874054075591789781264330331690<br>
+</div>
+
+# --hints--
+
+`largeSum(testNums)` should return a number.
+
+```js
+assert(typeof largeSum(testNums) === 'number');
+```
+
+`largeSum(testNums)` should return 8348422521.
+
+```js
+assert.strictEqual(largeSum(testNums), 8348422521);
+```
+
+`largeSum(fiftyDigitNums)` should return 5537376230.
+
+```js
+assert.strictEqual(largeSum(fiftyDigitNums), 5537376230);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const fiftyDigitNums = [
+  '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'
+];
+
+const testNums = [
+  '37107287533902102798797998220837590246510135740250',
+  '46376937677490009712648124896970078050417018260538'
+];
+```
+
+## --seed-contents--
+
+```js
+function largeSum(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testNums = [
+  '37107287533902102798797998220837590246510135740250',
+  '46376937677490009712648124896970078050417018260538'
+];
+
+largeSum(testNums);
+```
+
+# --solutions--
+
+```js
+function largeSum(arr) {
+
+  let sum = 0;
+
+  arr.forEach(function(num) {
+    sum += parseInt(num, 10);
+  });
+
+  sum = sum.toString(10);
+
+  sum = sum.substr(0, 1) + sum.substr(2);
+
+  let firstTen = sum.slice(0, 10);
+  return parseInt(firstTen, 10);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
new file mode 100644
index 0000000000..0f3c2c7a3c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3ee1000cf542c50ff00
+title: 'Problem 130: Composites with prime repunit property'
+challengeType: 5
+forumTopicId: 301758
+dashedName: problem-130-composites-with-prime-repunit-property
+---
+
+# --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).
+
+# --hints--
+
+`euler130()` should return 149253.
+
+```js
+assert.strictEqual(euler130(), 149253);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler130() {
+
+  return true;
+}
+
+euler130();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
new file mode 100644
index 0000000000..729f8689fb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ef1000cf542c50ff02
+title: 'Problem 131: Prime cube partnership'
+challengeType: 5
+forumTopicId: 301759
+dashedName: problem-131-prime-cube-partnership
+---
+
+# --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?
+
+# --hints--
+
+`euler131()` should return 173.
+
+```js
+assert.strictEqual(euler131(), 173);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler131() {
+
+  return true;
+}
+
+euler131();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
new file mode 100644
index 0000000000..d71927659b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f11000cf542c50ff03
+title: 'Problem 132: Large repunit factors'
+challengeType: 5
+forumTopicId: 301760
+dashedName: problem-132-large-repunit-factors
+---
+
+# --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).
+
+# --hints--
+
+`euler132()` should return 843296.
+
+```js
+assert.strictEqual(euler132(), 843296);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler132() {
+
+  return true;
+}
+
+euler132();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
new file mode 100644
index 0000000000..649dd7f1f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f21000cf542c50ff04
+title: 'Problem 133: Repunit nonfactors'
+challengeType: 5
+forumTopicId: 301761
+dashedName: problem-133-repunit-nonfactors
+---
+
+# --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).
+
+# --hints--
+
+`euler133()` should return 453647705.
+
+```js
+assert.strictEqual(euler133(), 453647705);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler133() {
+
+  return true;
+}
+
+euler133();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
new file mode 100644
index 0000000000..a21b71ea01
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f21000cf542c50ff05
+title: 'Problem 134: Prime pair connection'
+challengeType: 5
+forumTopicId: 301762
+dashedName: problem-134-prime-pair-connection
+---
+
+# --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.
+
+# --hints--
+
+`euler134()` should return 18613426663617120.
+
+```js
+assert.strictEqual(euler134(), 18613426663617120);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler134() {
+
+  return true;
+}
+
+euler134();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-135-same-differences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
new file mode 100644
index 0000000000..f0de3b5c58
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-135-same-differences.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f31000cf542c50ff06
+title: 'Problem 135: Same differences'
+challengeType: 5
+forumTopicId: 301763
+dashedName: problem-135-same-differences
+---
+
+# --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?
+
+# --hints--
+
+`euler135()` should return 4989.
+
+```js
+assert.strictEqual(euler135(), 4989);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler135() {
+
+  return true;
+}
+
+euler135();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
new file mode 100644
index 0000000000..34fda8a4ee
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3f51000cf542c50ff07
+title: 'Problem 136: Singleton difference'
+challengeType: 5
+forumTopicId: 301764
+dashedName: problem-136-singleton-difference
+---
+
+# --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?
+
+# --hints--
+
+`euler136()` should return 2544559.
+
+```js
+assert.strictEqual(euler136(), 2544559);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler136() {
+
+  return true;
+}
+
+euler136();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
new file mode 100644
index 0000000000..2863f66aa1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.md
@@ -0,0 +1,54 @@
+---
+id: 5900f3f51000cf542c50ff08
+title: 'Problem 137: Fibonacci golden nuggets'
+challengeType: 5
+forumTopicId: 301765
+dashedName: problem-137-fibonacci-golden-nuggets
+---
+
+# --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.
+
+# --hints--
+
+`euler137()` should return 1120149658760.
+
+```js
+assert.strictEqual(euler137(), 1120149658760);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler137() {
+
+  return true;
+}
+
+euler137();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
new file mode 100644
index 0000000000..5675e1f938
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3f61000cf542c50ff09
+title: 'Problem 138: Special isosceles triangles'
+challengeType: 5
+forumTopicId: 301766
+dashedName: problem-138-special-isosceles-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler138()` should return 1118049290473932.
+
+```js
+assert.strictEqual(euler138(), 1118049290473932);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler138() {
+
+  return true;
+}
+
+euler138();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
new file mode 100644
index 0000000000..800c0ccbab
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3f71000cf542c50ff0a
+title: 'Problem 139: Pythagorean tiles'
+challengeType: 5
+forumTopicId: 301767
+dashedName: problem-139-pythagorean-tiles
+---
+
+# --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?
+
+# --hints--
+
+`euler139()` should return 10057761.
+
+```js
+assert.strictEqual(euler139(), 10057761);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler139() {
+
+  return true;
+}
+
+euler139();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
new file mode 100644
index 0000000000..807f362857
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.md
@@ -0,0 +1,111 @@
+---
+id: 5900f37a1000cf542c50fe8d
+title: 'Problem 14: Longest Collatz sequence'
+challengeType: 5
+forumTopicId: 301768
+dashedName: problem-14-longest-collatz-sequence
+---
+
+# --description--
+
+The following iterative sequence is defined for the set of positive integers:
+
+<div style='padding-left: 4em;'><var>n</var> → <var>n</var>/2 (<var>n</var> is even)</div>
+
+<div style='padding-left: 4em;'><var>n</var> → 3<var>n</var> + 1 (<var>n</var> is odd)</div>
+
+Using the rule above and starting with 13, we generate the following sequence:
+
+<div style='text-align: center;'>13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1</div>
+
+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 the given `limit`, produces the longest chain?
+
+**Note:** Once the chain starts the terms are allowed to go above one million.
+
+# --hints--
+
+`longestCollatzSequence(14)` should return a number.
+
+```js
+assert(typeof longestCollatzSequence(14) === 'number');
+```
+
+`longestCollatzSequence(14)` should return 9.
+
+```js
+assert.strictEqual(longestCollatzSequence(14), 9);
+```
+
+`longestCollatzSequence(5847)` should return 3711.
+
+```js
+assert.strictEqual(longestCollatzSequence(5847), 3711);
+```
+
+`longestCollatzSequence(46500)` should return 35655.
+
+```js
+assert.strictEqual(longestCollatzSequence(46500), 35655);
+```
+
+`longestCollatzSequence(54512)` should return 52527.
+
+```js
+assert.strictEqual(longestCollatzSequence(54512), 52527);
+```
+
+`longestCollatzSequence(100000)` should return 77031.
+
+```js
+assert.strictEqual(longestCollatzSequence(100000), 77031);
+```
+
+`longestCollatzSequence(1000000)` should return 837799.
+
+```js
+assert.strictEqual(longestCollatzSequence(1000000), 837799);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function longestCollatzSequence(limit) {
+
+  return true;
+}
+
+longestCollatzSequence(14);
+```
+
+# --solutions--
+
+```js
+function longestCollatzSequence(limit) {
+  let longest = 1;
+  let maxLength = 1;
+  for (let i = Math.floor(limit / 2); i < limit; i++) {
+    let len = colLen(i);
+    if (len > maxLength) {
+      longest = i;
+      maxLength = len;
+    }
+  }
+  return longest;
+}
+
+const knownSequence = { '1': 1 };
+
+function colLen(n) {
+  if (knownSequence[n]) {
+    return knownSequence[n];
+  } else {
+    const len = n % 2 === 0 ? colLen(n / 2) + 1 : colLen((3 * n + 1) / 2) + 2;
+    knownSequence[n] = len;
+    return len;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
new file mode 100644
index 0000000000..01664be7ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3fa1000cf542c50ff0c
+title: 'Problem 140: Modified Fibonacci golden nuggets'
+challengeType: 5
+forumTopicId: 301769
+dashedName: problem-140-modified-fibonacci-golden-nuggets
+---
+
+# --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.
+
+# --hints--
+
+`euler140()` should return 5673835352990.
+
+```js
+assert.strictEqual(euler140(), 5673835352990);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler140() {
+
+  return true;
+}
+
+euler140();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
new file mode 100644
index 0000000000..4bcd7e069a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3f91000cf542c50ff0b
+title: 'Problem 141: Investigating progressive numbers, n, which are also square'
+challengeType: 5
+forumTopicId: 301770
+dashedName: problem-141-investigating-progressive-numbers-n-which-are-also-square
+---
+
+# --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).
+
+# --hints--
+
+`euler141()` should return 878454337159.
+
+```js
+assert.strictEqual(euler141(), 878454337159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler141() {
+
+  return true;
+}
+
+euler141();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
new file mode 100644
index 0000000000..03d921eac9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
@@ -0,0 +1,38 @@
+---
+id: 5900f3fa1000cf542c50ff0d
+title: 'Problem 142: Perfect Square Collection'
+challengeType: 5
+forumTopicId: 301771
+dashedName: problem-142-perfect-square-collection
+---
+
+# --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.
+
+# --hints--
+
+`euler142()` should return 1006193.
+
+```js
+assert.strictEqual(euler142(), 1006193);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler142() {
+
+  return true;
+}
+
+euler142();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
new file mode 100644
index 0000000000..fd11d827b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3fc1000cf542c50ff0e
+title: 'Problem 143: Investigating the Torricelli point of a triangle'
+challengeType: 5
+forumTopicId: 301772
+dashedName: problem-143-investigating-the-torricelli-point-of-a-triangle
+---
+
+# --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.
+
+# --hints--
+
+`euler143()` should return 30758397.
+
+```js
+assert.strictEqual(euler143(), 30758397);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler143() {
+
+  return true;
+}
+
+euler143();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
new file mode 100644
index 0000000000..88d8b1e5a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3fc1000cf542c50ff0f
+title: 'Problem 144: Investigating multiple reflections of a laser beam'
+challengeType: 5
+forumTopicId: 301773
+dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
+---
+
+# --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?
+
+# --hints--
+
+`euler144()` should return 354.
+
+```js
+assert.strictEqual(euler144(), 354);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler144() {
+
+  return true;
+}
+
+euler144();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
new file mode 100644
index 0000000000..0ec3679a6f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.md
@@ -0,0 +1,42 @@
+---
+id: 5900f3fd1000cf542c50ff10
+title: 'Problem 145: How many reversible numbers are there below one-billion?'
+challengeType: 5
+forumTopicId: 301774
+dashedName: problem-145-how-many-reversible-numbers-are-there-below-one-billion
+---
+
+# --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)?
+
+# --hints--
+
+`euler145()` should return 608720.
+
+```js
+assert.strictEqual(euler145(), 608720);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler145() {
+
+  return true;
+}
+
+euler145();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
new file mode 100644
index 0000000000..ddfec6766b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md
@@ -0,0 +1,40 @@
+---
+id: 5900f3fe1000cf542c50ff11
+title: 'Problem 146: Investigating a Prime Pattern'
+challengeType: 5
+forumTopicId: 301775
+dashedName: problem-146-investigating-a-prime-pattern
+---
+
+# --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?
+
+# --hints--
+
+`euler146()` should return 676333270.
+
+```js
+assert.strictEqual(euler146(), 676333270);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler146() {
+
+  return true;
+}
+
+euler146();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
new file mode 100644
index 0000000000..3b422811f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.md
@@ -0,0 +1,44 @@
+---
+id: 5900f3ff1000cf542c50ff12
+title: 'Problem 147: Rectangles in cross-hatched grids'
+challengeType: 5
+forumTopicId: 301776
+dashedName: problem-147-rectangles-in-cross-hatched-grids
+---
+
+# --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?
+
+# --hints--
+
+`euler147()` should return 846910284.
+
+```js
+assert.strictEqual(euler147(), 846910284);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler147() {
+
+  return true;
+}
+
+euler147();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
new file mode 100644
index 0000000000..13babe893b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4021000cf542c50ff14
+title: 'Problem 148: Exploring Pascal''s triangle'
+challengeType: 5
+forumTopicId: 301777
+dashedName: problem-148-exploring-pascals-triangle
+---
+
+# --description--
+
+We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:
+
+<pre>
+            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
+</pre>
+
+However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7.
+
+# --instructions--
+
+Find the number of entries which are not divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.
+
+# --hints--
+
+`euler148()` should return 2129970655314432.
+
+```js
+assert.strictEqual(euler148(), 2129970655314432);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler148() {
+
+  return true;
+}
+
+euler148();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
new file mode 100644
index 0000000000..c76d5370c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4021000cf542c50ff13
+title: 'Problem 149: Searching for a maximum-sum subsequence'
+challengeType: 5
+forumTopicId: 301778
+dashedName: problem-149-searching-for-a-maximum-sum-subsequence
+---
+
+# --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).
+
+# --hints--
+
+`euler149()` should return 52852124.
+
+```js
+assert.strictEqual(euler149(), 52852124);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler149() {
+
+  return true;
+}
+
+euler149();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
new file mode 100644
index 0000000000..b3b0a499c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
@@ -0,0 +1,68 @@
+---
+id: 5900f37b1000cf542c50fe8e
+title: 'Problem 15: Lattice paths'
+challengeType: 5
+forumTopicId: 301780
+dashedName: problem-15-lattice-paths
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of 6 2 by 2 grids showing all the routes to the bottom right corner" src="https://cdn-media-1.freecodecamp.org/project-euler/1Atixoj.gif" style="background-color: white; padding: 10px;">
+
+How many such routes are there through a given `gridSize`?
+
+# --hints--
+
+`latticePaths(4)` should return a number.
+
+```js
+assert(typeof latticePaths(4) === 'number');
+```
+
+`latticePaths(4)` should return 70.
+
+```js
+assert.strictEqual(latticePaths(4), 70);
+```
+
+`latticePaths(9)` should return 48620.
+
+```js
+assert.strictEqual(latticePaths(9), 48620);
+```
+
+`latticePaths(20)` should return 137846528820.
+
+```js
+assert.strictEqual(latticePaths(20), 137846528820);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function latticePaths(gridSize) {
+
+  return true;
+}
+
+latticePaths(4);
+```
+
+# --solutions--
+
+```js
+function latticePaths(gridSize) {
+  let paths = 1;
+
+  for (let i = 0; i < gridSize; i++) {
+    paths *= (2 * gridSize) - i;
+    paths /= i + 1;
+  }
+  return paths;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
new file mode 100644
index 0000000000..b632361a8b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4031000cf542c50ff15
+title: >-
+  Problem 150: Searching a triangular array for a sub-triangle having
+  minimum-sum
+challengeType: 5
+forumTopicId: 301781
+dashedName: problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler150()` should return -271248680.
+
+```js
+assert.strictEqual(euler150(), -271248680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler150() {
+
+  return true;
+}
+
+euler150();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
new file mode 100644
index 0000000000..e75e5a0fdf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4031000cf542c50ff16
+title: 'Problem 151: Paper sheets of standard sizes: an expected-value problem'
+challengeType: 5
+forumTopicId: 301782
+dashedName: problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem
+---
+
+# --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 .
+
+# --hints--
+
+`euler151()` should return 0.464399.
+
+```js
+assert.strictEqual(euler151(), 0.464399);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler151() {
+
+  return true;
+}
+
+euler151();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
new file mode 100644
index 0000000000..1acd9f0652
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4041000cf542c50ff17
+title: 'Problem 152: Writing one half as a sum of inverse squares'
+challengeType: 5
+forumTopicId: 301783
+dashedName: problem-152-writing-one-half-as-a-sum-of-inverse-squares
+---
+
+# --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?
+
+# --hints--
+
+`euler152()` should return 301.
+
+```js
+assert.strictEqual(euler152(), 301);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler152() {
+
+  return true;
+}
+
+euler152();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
new file mode 100644
index 0000000000..b1eaa92c44
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.md
@@ -0,0 +1,70 @@
+---
+id: 5900f4051000cf542c50ff18
+title: 'Problem 153: Investigating Gaussian Integers'
+challengeType: 5
+forumTopicId: 301784
+dashedName: problem-153-investigating-gaussian-integers
+---
+
+# --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?
+
+# --hints--
+
+`euler153()` should return 17971254122360636.
+
+```js
+assert.strictEqual(euler153(), 17971254122360636);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler153() {
+
+  return true;
+}
+
+euler153();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
new file mode 100644
index 0000000000..8d8abe0dfc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4071000cf542c50ff19
+title: 'Problem 154: Exploring Pascal''s pyramid'
+challengeType: 5
+forumTopicId: 301785
+dashedName: problem-154-exploring-pascals-pyramid
+---
+
+# --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?
+
+# --hints--
+
+`euler154()` should return 479742450.
+
+```js
+assert.strictEqual(euler154(), 479742450);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler154() {
+
+  return true;
+}
+
+euler154();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
new file mode 100644
index 0000000000..404c223c6a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4081000cf542c50ff1a
+title: 'Problem 155: Counting Capacitor Circuits'
+challengeType: 5
+forumTopicId: 301786
+dashedName: problem-155-counting-capacitor-circuits
+---
+
+# --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:
+
+# --hints--
+
+`euler155()` should return 3857447.
+
+```js
+assert.strictEqual(euler155(), 3857447);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler155() {
+
+  return true;
+}
+
+euler155();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
new file mode 100644
index 0000000000..3ab75c957b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-156-counting-digits.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4091000cf542c50ff1b
+title: 'Problem 156: Counting Digits'
+challengeType: 5
+forumTopicId: 301787
+dashedName: problem-156-counting-digits
+---
+
+# --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.
+
+# --hints--
+
+`euler156()` should return 21295121502550.
+
+```js
+assert.strictEqual(euler156(), 21295121502550);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler156() {
+
+  return true;
+}
+
+euler156();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
new file mode 100644
index 0000000000..fa1e327051
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.md
@@ -0,0 +1,82 @@
+---
+id: 5900f4091000cf542c50ff1c
+title: 'Problem 157: Solving the diophantine equation'
+challengeType: 5
+forumTopicId: 301788
+dashedName: problem-157-solving-the-diophantine-equation
+---
+
+# --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?
+
+# --hints--
+
+`euler157()` should return 53490.
+
+```js
+assert.strictEqual(euler157(), 53490);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler157() {
+
+  return true;
+}
+
+euler157();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
new file mode 100644
index 0000000000..c447c7ce9f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.md
@@ -0,0 +1,55 @@
+---
+id: 5900f40a1000cf542c50ff1d
+title: >-
+  Problem 158: Exploring strings for which only one character comes
+  lexicographically after its neighbour to the left
+challengeType: 5
+forumTopicId: 301789
+dashedName: >-
+  problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left
+---
+
+# --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)?
+
+# --hints--
+
+`euler158()` should return 409511334375.
+
+```js
+assert.strictEqual(euler158(), 409511334375);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler158() {
+
+  return true;
+}
+
+euler158();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
new file mode 100644
index 0000000000..b5e3b4945b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.md
@@ -0,0 +1,44 @@
+---
+id: 5900f40c1000cf542c50ff1e
+title: 'Problem 159: Digital root sums of factorisations'
+challengeType: 5
+forumTopicId: 301790
+dashedName: problem-159-digital-root-sums-of-factorisations
+---
+
+# --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 &lt; n &lt; 1,000,000.
+
+# --hints--
+
+`euler159()` should return 14489159.
+
+```js
+assert.strictEqual(euler159(), 14489159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler159() {
+
+  return true;
+}
+
+euler159();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
new file mode 100644
index 0000000000..b71b480082
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
@@ -0,0 +1,85 @@
+---
+id: 5900f37d1000cf542c50fe8f
+title: 'Problem 16: Power digit sum'
+challengeType: 5
+forumTopicId: 301791
+dashedName: problem-16-power-digit-sum
+---
+
+# --description--
+
+2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+
+What is the sum of the digits of the number 2<sup><code>exponent</code></sup>?
+
+# --hints--
+
+`powerDigitSum(15)` should return a number.
+
+```js
+assert(typeof powerDigitSum(15) === 'number');
+```
+
+`powerDigitSum(15)` should return 26.
+
+```js
+assert.strictEqual(powerDigitSum(15), 26);
+```
+
+`powerDigitSum(128)` should return 166.
+
+```js
+assert.strictEqual(powerDigitSum(128), 166);
+```
+
+`powerDigitSum(1000)` should return 1366.
+
+```js
+assert.strictEqual(powerDigitSum(1000), 1366);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerDigitSum(exponent) {
+
+  return true;
+}
+
+powerDigitSum(15);
+```
+
+# --solutions--
+
+```js
+function powerDigitSum(exponent) {
+  const bigNum = [1];
+  let sum = 0;
+
+  for (let i = 1; i <= exponent; i++) {
+    let count = bigNum.length + 1;
+    let overflow = 0;
+    for (let j = 0; j < count; j++) {
+      let digit = bigNum[j] || 0;
+      digit = 2 * digit + overflow;
+
+      if (digit > 9) {
+        digit -= 10;
+        overflow = 1;
+      } else {
+        overflow = 0;
+      }
+
+      bigNum[j] = digit;
+    }
+  }
+
+  bigNum.forEach(function(num) {
+    return sum += num;
+  });
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
new file mode 100644
index 0000000000..c7319ba84c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.md
@@ -0,0 +1,48 @@
+---
+id: 5900f40d1000cf542c50ff1f
+title: 'Problem 160: Factorial trailing digits'
+challengeType: 5
+forumTopicId: 301794
+dashedName: problem-160-factorial-trailing-digits
+---
+
+# --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)
+
+# --hints--
+
+`euler160()` should return 16576.
+
+```js
+assert.strictEqual(euler160(), 16576);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler160() {
+
+  return true;
+}
+
+euler160();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-161-triominoes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
new file mode 100644
index 0000000000..ea369bae60
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-161-triominoes.md
@@ -0,0 +1,46 @@
+---
+id: 5900f40d1000cf542c50ff20
+title: 'Problem 161: Triominoes'
+challengeType: 5
+forumTopicId: 301795
+dashedName: problem-161-triominoes
+---
+
+# --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?
+
+# --hints--
+
+`euler161()` should return 20574308184277972.
+
+```js
+assert.strictEqual(euler161(), 20574308184277972);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler161() {
+
+  return true;
+}
+
+euler161();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
new file mode 100644
index 0000000000..53a6bcd772
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.md
@@ -0,0 +1,52 @@
+---
+id: 5900f40e1000cf542c50ff21
+title: 'Problem 162: Hexadecimal numbers'
+challengeType: 5
+forumTopicId: 301796
+dashedName: problem-162-hexadecimal-numbers
+---
+
+# --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)
+
+# --hints--
+
+`euler162()` should return 3D58725572C62302.
+
+```js
+assert.strictEqual(euler162(), '3D58725572C62302');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler162() {
+
+  return true;
+}
+
+euler162();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
new file mode 100644
index 0000000000..72ed1158b1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.md
@@ -0,0 +1,40 @@
+---
+id: 5900f40f1000cf542c50ff22
+title: 'Problem 163: Cross-hatched triangles'
+challengeType: 5
+forumTopicId: 301797
+dashedName: problem-163-cross-hatched-triangles
+---
+
+# --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).
+
+# --hints--
+
+`euler163()` should return 343047.
+
+```js
+assert.strictEqual(euler163(), 343047);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler163() {
+
+  return true;
+}
+
+euler163();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
new file mode 100644
index 0000000000..e511646823
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.md
@@ -0,0 +1,41 @@
+---
+id: 5900f4111000cf542c50ff23
+title: >-
+  Problem 164: Numbers for which no three consecutive digits have a sum greater
+  than a given value
+challengeType: 5
+forumTopicId: 301798
+dashedName: >-
+  problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value
+---
+
+# --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?
+
+# --hints--
+
+`euler164()` should return 378158756814587.
+
+```js
+assert.strictEqual(euler164(), 378158756814587);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler164() {
+
+  return true;
+}
+
+euler164();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-165-intersections.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-165-intersections.md
new file mode 100644
index 0000000000..a98373c338
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-165-intersections.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4111000cf542c50ff24
+title: 'Problem 165: Intersections'
+challengeType: 5
+forumTopicId: 301799
+dashedName: problem-165-intersections
+---
+
+# --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?
+
+# --hints--
+
+`euler165()` should return 2868868.
+
+```js
+assert.strictEqual(euler165(), 2868868);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler165() {
+
+  return true;
+}
+
+euler165();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
new file mode 100644
index 0000000000..9f1db5cea4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-166-criss-cross.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4131000cf542c50ff25
+title: 'Problem 166: Criss Cross'
+challengeType: 5
+forumTopicId: 301800
+dashedName: problem-166-criss-cross
+---
+
+# --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?
+
+# --hints--
+
+`euler166()` should return 7130034.
+
+```js
+assert.strictEqual(euler166(), 7130034);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler166() {
+
+  return true;
+}
+
+euler166();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
new file mode 100644
index 0000000000..6f30b4b272
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4141000cf542c50ff26
+title: 'Problem 167: Investigating Ulam sequences'
+challengeType: 5
+forumTopicId: 301801
+dashedName: problem-167-investigating-ulam-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler167()` should return 3916160068885.
+
+```js
+assert.strictEqual(euler167(), 3916160068885);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler167() {
+
+  return true;
+}
+
+euler167();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
new file mode 100644
index 0000000000..9ad5f78e64
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-168-number-rotations.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4151000cf542c50ff27
+title: 'Problem 168: Number Rotations'
+challengeType: 5
+forumTopicId: 301802
+dashedName: problem-168-number-rotations
+---
+
+# --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 &lt; n &lt; 10100, that have this property.
+
+# --hints--
+
+`euler168()` should return 59206.
+
+```js
+assert.strictEqual(euler168(), 59206);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler168() {
+
+  return true;
+}
+
+euler168();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
new file mode 100644
index 0000000000..0cfb0034f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4151000cf542c50ff28
+title: >-
+  Problem 169: Exploring the number of different ways a number can be expressed
+  as a sum of powers of 2
+challengeType: 5
+forumTopicId: 301803
+dashedName: >-
+  problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
+---
+
+# --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)?
+
+# --hints--
+
+`euler169()` should return 178653872807.
+
+```js
+assert.strictEqual(euler169(), 178653872807);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler169() {
+
+  return true;
+}
+
+euler169();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
new file mode 100644
index 0000000000..2b096d1d78
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.md
@@ -0,0 +1,130 @@
+---
+id: 5900f37d1000cf542c50fe90
+title: 'Problem 17: Number letter counts'
+challengeType: 5
+forumTopicId: 301804
+dashedName: problem-17-number-letter-counts
+---
+
+# --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 given `limit` 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.
+
+# --hints--
+
+`numberLetterCounts(5)` should return a number.
+
+```js
+assert(typeof numberLetterCounts(5) === 'number');
+```
+
+`numberLetterCounts(5)` should return 19.
+
+```js
+assert.strictEqual(numberLetterCounts(5), 19);
+```
+
+`numberLetterCounts(150)` should return 1903.
+
+```js
+assert.strictEqual(numberLetterCounts(150), 1903);
+```
+
+`numberLetterCounts(1000)` should return 21124.
+
+```js
+assert.strictEqual(numberLetterCounts(1000), 21124);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function numberLetterCounts(limit) {
+
+  return true;
+}
+
+numberLetterCounts(5);
+```
+
+# --solutions--
+
+```js
+function numberLetterCounts(limit) {
+  const dictionary = {
+    0: '',
+    1: 'one',
+    2: 'two',
+    3: 'three',
+    4: 'four',
+    5: 'five',
+    6: 'six',
+    7: 'seven',
+    8: 'eight',
+    9: 'nine',
+    10: 'ten',
+    11: 'eleven',
+    12: 'twelve',
+    13: 'thirteen',
+    14: 'fourteen',
+    15: 'fifteen',
+    16: 'sixteen',
+    17: 'seventeen',
+    18: 'eighteen',
+    19: 'nineteen',
+    20: 'twenty',
+    30: 'thirty',
+    40: 'forty',
+    50: 'fifty',
+    60: 'sixty',
+    70: 'seventy',
+    80: 'eighty',
+    90: 'ninety',
+    1000: 'onethousand'
+  };
+
+  let numString = '';
+
+  function convertToString(num) {
+    // check dictionary for number
+    if (dictionary[num]) {
+      return dictionary[num];
+    } else {
+      const hundreds = Math.floor(num / 100);
+      const tens =  Math.floor((num / 10) % 10) * 10;
+      const remainder = num % 10;
+
+      let tempStr = '';
+
+      if (hundreds === 0) {
+        tempStr += dictionary[tens] + dictionary[remainder];
+      } else {
+        tempStr += dictionary[hundreds] + 'hundred';
+
+        if (tens !== 0 || remainder !== 0) {
+          tempStr += 'and';
+        }
+
+        if (tens < 20) {
+          const lessThanTwenty = tens + remainder;
+          tempStr += dictionary[lessThanTwenty];
+        } else {
+          tempStr += dictionary[tens] + dictionary[remainder];
+        }
+      }
+      return tempStr;
+    }
+  }
+
+  for (let i = 1; i <= limit; i++) {
+    numString += convertToString(i);
+  }
+  return numString.length;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
new file mode 100644
index 0000000000..f12d0490f2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4161000cf542c50ff29
+title: >-
+  Problem 170: Find the largest 0 to 9 pandigital that can be formed by
+  concatenating products
+challengeType: 5
+forumTopicId: 301805
+dashedName: >-
+  problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products
+---
+
+# --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?
+
+# --hints--
+
+`euler170()` should return 9857164023.
+
+```js
+assert.strictEqual(euler170(), 9857164023);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler170() {
+
+  return true;
+}
+
+euler170();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
new file mode 100644
index 0000000000..d03ddf909b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4181000cf542c50ff2a
+title: >-
+  Problem 171: Finding numbers for which the sum of the squares of the digits is
+  a square
+challengeType: 5
+forumTopicId: 301806
+dashedName: >-
+  problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
+---
+
+# --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 &lt; n &lt; 1020, such that f(n) is a perfect square.
+
+# --hints--
+
+`euler171()` should return 142989277.
+
+```js
+assert.strictEqual(euler171(), 142989277);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler171() {
+
+  return true;
+}
+
+euler171();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
new file mode 100644
index 0000000000..a25ab3224f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4181000cf542c50ff2b
+title: 'Problem 172: Investigating numbers with few repeated digits'
+challengeType: 5
+forumTopicId: 301807
+dashedName: problem-172-investigating-numbers-with-few-repeated-digits
+---
+
+# --description--
+
+How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?
+
+# --hints--
+
+`euler172()` should return 227485267000992000.
+
+```js
+assert.strictEqual(euler172(), 227485267000992000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler172() {
+
+  return true;
+}
+
+euler172();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
new file mode 100644
index 0000000000..a07789fd1d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.md
@@ -0,0 +1,43 @@
+---
+id: 5900f41a1000cf542c50ff2c
+title: >-
+  Problem 173: Using up to one million tiles how many different "hollow" square
+  laminae can be formed?
+challengeType: 5
+forumTopicId: 301808
+dashedName: >-
+  problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed
+---
+
+# --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?
+
+# --hints--
+
+`euler173()` should return 1572729.
+
+```js
+assert.strictEqual(euler173(), 1572729);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler173() {
+
+  return true;
+}
+
+euler173();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
new file mode 100644
index 0000000000..e7183612d5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.md
@@ -0,0 +1,45 @@
+---
+id: 5900f41a1000cf542c50ff2d
+title: >-
+  Problem 174: Counting the number of "hollow" square laminae that can form one,
+  two, three, ... distinct arrangements
+challengeType: 5
+forumTopicId: 301809
+dashedName: >-
+  problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-----distinct-arrangements
+---
+
+# --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?
+
+# --hints--
+
+`euler174()` should return 209566.
+
+```js
+assert.strictEqual(euler174(), 209566);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler174() {
+
+  return true;
+}
+
+euler174();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
new file mode 100644
index 0000000000..8f32fcb4bd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.md
@@ -0,0 +1,45 @@
+---
+id: 5900f41c1000cf542c50ff2e
+title: >-
+  Problem 175: Fractions involving the number of different ways a number can be
+  expressed as a sum of powers of 2
+challengeType: 5
+forumTopicId: 301810
+dashedName: >-
+  problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2
+---
+
+# --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.
+
+# --hints--
+
+`euler175()` should return 1, 13717420, 8.
+
+```js
+assert.strictEqual(euler175(), 1, 13717420, 8);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler175() {
+
+  return true;
+}
+
+euler175();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
new file mode 100644
index 0000000000..c3b6c090fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.md
@@ -0,0 +1,40 @@
+---
+id: 5900f41c1000cf542c50ff2f
+title: 'Problem 176: Right-angled triangles that share a cathetus'
+challengeType: 5
+forumTopicId: 301811
+dashedName: problem-176-right-angled-triangles-that-share-a-cathetus
+---
+
+# --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.
+
+# --hints--
+
+`euler176()` should return 96818198400000.
+
+```js
+assert.strictEqual(euler176(), 96818198400000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler176() {
+
+  return true;
+}
+
+euler176();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
new file mode 100644
index 0000000000..2e39114654
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.md
@@ -0,0 +1,40 @@
+---
+id: 5900f41e1000cf542c50ff30
+title: 'Problem 177: Integer angled Quadrilaterals'
+challengeType: 5
+forumTopicId: 301812
+dashedName: problem-177-integer-angled-quadrilaterals
+---
+
+# --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.
+
+# --hints--
+
+`euler177()` should return 129325.
+
+```js
+assert.strictEqual(euler177(), 129325);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler177() {
+
+  return true;
+}
+
+euler177();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
new file mode 100644
index 0000000000..12bad9c5ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-178-step-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f41e1000cf542c50ff31
+title: 'Problem 178: Step Numbers'
+challengeType: 5
+forumTopicId: 301813
+dashedName: problem-178-step-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler178()` should return 126461847755.
+
+```js
+assert.strictEqual(euler178(), 126461847755);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler178() {
+
+  return true;
+}
+
+euler178();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
new file mode 100644
index 0000000000..1811def962
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.md
@@ -0,0 +1,38 @@
+---
+id: 5900f41f1000cf542c50ff32
+title: 'Problem 179: Consecutive positive divisors'
+challengeType: 5
+forumTopicId: 301814
+dashedName: problem-179-consecutive-positive-divisors
+---
+
+# --description--
+
+Find the number of integers 1 &lt; n &lt; 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.
+
+# --hints--
+
+`euler179()` should return 986262.
+
+```js
+assert.strictEqual(euler179(), 986262);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler179() {
+
+  return true;
+}
+
+euler179();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
new file mode 100644
index 0000000000..2ad9a7a7a6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.md
@@ -0,0 +1,109 @@
+---
+id: 5900f37e1000cf542c50fe91
+title: 'Problem 18: Maximum path sum I'
+challengeType: 5
+forumTopicId: 301815
+dashedName: problem-18-maximum-path-sum-i
+---
+
+# --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.
+
+<span style='display: block; text-align: center;'>
+  <strong style='color: red;'>3</strong><br>
+  <strong style='color: red;'>7</strong> 4<br>
+  2 <strong style='color: red;'>4</strong> 6<br>
+  8 5 <strong style='color: red;'>9</strong> 3
+</span>
+
+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)
+
+# --hints--
+
+`maximumPathSumI(testTriangle)` should return a number.
+
+```js
+assert(typeof maximumPathSumI(testTriangle) === 'number');
+```
+
+`maximumPathSumI(testTriangle)` should return 23.
+
+```js
+assert.strictEqual(maximumPathSumI(testTriangle), 23);
+```
+
+`maximumPathSumI(numTriangle)` should return 1074.
+
+```js
+assert.strictEqual(maximumPathSumI(numTriangle), 1074);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const numTriangle = [[75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [95, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [17, 47, 82, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [18, 35, 87, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [20, 4, 82, 47, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [19, 1, 23, 75, 3, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0], [88, 2, 77, 73, 7, 63, 67, 0, 0, 0, 0, 0, 0, 0, 0], [99, 65, 4, 28, 6, 16, 70, 92, 0, 0, 0, 0, 0, 0, 0], [41, 41, 26, 56, 83, 40, 80, 70, 33, 0, 0, 0, 0, 0, 0], [41, 48, 72, 33, 47, 32, 37, 16, 94, 29, 0, 0, 0, 0, 0], [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14, 0, 0, 0, 0], [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57, 0, 0, 0], [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48, 0, 0], [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31, 0], [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23]];
+```
+
+## --seed-contents--
+
+```js
+function maximumPathSumI(triangle) {
+
+  return true;
+}
+
+const testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+
+maximumPathSumI(testTriangle);
+```
+
+# --solutions--
+
+```js
+const testTriangle = [[3, 0, 0, 0],
+  [7, 4, 0, 0],
+  [2, 4, 6, 0],
+  [8, 5, 9, 3]];
+
+function maximumPathSumI(triangle) {
+  let maxSum = triangle.slice();
+
+  for (let i = triangle.length - 1; i > 0; i--) {
+    let currentRow = maxSum[i];
+    let previousRow = maxSum[i - 1];
+    const temp = [];
+    for (let j = 0; j < i; j++) {
+      temp.push(Math.max((currentRow[j] + previousRow[j]), (currentRow[j + 1] + previousRow[j])));
+    }
+    maxSum[i - 1] = temp;
+    maxSum.pop();
+  }
+  return maxSum[0][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
new file mode 100644
index 0000000000..3b46677319
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4201000cf542c50ff33
+title: 'Problem 180: Rational zeros of a function of three variables'
+challengeType: 5
+forumTopicId: 301816
+dashedName: problem-180-rational-zeros-of-a-function-of-three-variables
+---
+
+# --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 &lt; a &lt; 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.
+
+# --hints--
+
+`euler180()` should return 285196020571078980.
+
+```js
+assert.strictEqual(euler180(), 285196020571078980);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler180() {
+
+  return true;
+}
+
+euler180();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
new file mode 100644
index 0000000000..01c3730a1a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.md
@@ -0,0 +1,47 @@
+---
+id: 5900f4231000cf542c50ff34
+title: >-
+  Problem 181: Investigating in how many ways objects of two different colours
+  can be grouped
+challengeType: 5
+forumTopicId: 301817
+dashedName: >-
+  problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped
+---
+
+# --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?
+
+# --hints--
+
+`euler181()` should return 83735848679360670.
+
+```js
+assert.strictEqual(euler181(), 83735848679360670);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler181() {
+
+  return true;
+}
+
+euler181();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
new file mode 100644
index 0000000000..7ffc6ae376
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md
@@ -0,0 +1,113 @@
+---
+id: 5900f4231000cf542c50ff35
+title: 'Problem 182: RSA encryption'
+challengeType: 5
+forumTopicId: 301818
+dashedName: problem-182-rsa-encryption
+---
+
+# --description--
+
+The RSA encryption is based on the following procedure:
+
+Generate two distinct primes `p` and `q`.
+Compute `n=p*q` 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=m<sup>e</sup> 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=c<sup>d</sup> mod n.
+
+There exist values of `e` and `m` such that m<sup>e</sup> mod n = m.
+We call messages `m` for which m<sup>e</sup> 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 messages
+m `(0≤m≤n-1)` are unconcealed when calculating m<sup>e</sup> 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.
+
+For any given `p` and `q`, find the sum of all values of `e`, `1 < e < φ(p,q)` and `gcd(e,φ)=1`, so that the number of unconcealed messages for this value of `e` is at a minimum.
+
+# --hints--
+
+`RSAEncryption` should be a function.
+
+```js
+assert(typeof RSAEncryption === 'function')
+```
+
+`RSAEncryption` should return a number.
+
+```js
+assert.strictEqual(typeof RSAEncryption(19, 37), 'number');
+```
+
+`RSAEncryption(19, 37)` should return `17766`.
+
+```js
+assert.strictEqual(RSAEncryption(19, 37), 17766);
+```
+
+`RSAEncryption(283, 409)` should return `466196580`.
+
+```js
+assert.strictEqual(RSAEncryption(283, 409), 466196580);
+```
+
+`RSAEncryption(1009, 3643)` should return `399788195976`.
+
+```js
+assert.strictEqual(RSAEncryption(19, 37), 17766);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function RSAEncryption(p, q) {
+
+  return true;
+}
+
+RSAEncryption(19, 37);
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+    if (b)
+        return gcd(b, a % b);
+    else
+        return a;
+}
+
+function RSAEncryption(p, q) {
+    let phi = (p - 1) * (q - 1);
+
+    let best = Number.MAX_SAFE_INTEGER;
+    let sum = 0;
+
+    for (let e = 0; e < phi; ++e) {
+        if (!(gcd(e, phi) == 1))
+            continue;
+
+        let msg = (gcd(p - 1, e - 1) + 1) * (gcd(q - 1, e - 1) + 1);
+
+        if (best == msg) {
+            sum += e;
+        } else if (best > msg) {
+            best = msg;
+            sum = e;
+        }
+    }
+
+    return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
new file mode 100644
index 0000000000..0dcbca86fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4231000cf542c50ff36
+title: 'Problem 183: Maximum product of parts'
+challengeType: 5
+forumTopicId: 301819
+dashedName: problem-183-maximum-product-of-parts
+---
+
+# --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.
+
+# --hints--
+
+`euler183()` should return 48861552.
+
+```js
+assert.strictEqual(euler183(), 48861552);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler183() {
+
+  return true;
+}
+
+euler183();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
new file mode 100644
index 0000000000..dd5855935b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4241000cf542c50ff37
+title: 'Problem 184: Triangles containing the origin'
+challengeType: 5
+forumTopicId: 301820
+dashedName: problem-184-triangles-containing-the-origin
+---
+
+# --description--
+
+Consider the set Ir of points (x,y) with integer coordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 &lt; 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?
+
+# --hints--
+
+`euler184()` should return 1725323624056.
+
+```js
+assert.strictEqual(euler184(), 1725323624056);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler184() {
+
+  return true;
+}
+
+euler184();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-185-number-mind.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
new file mode 100644
index 0000000000..bd8a853937
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-185-number-mind.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4251000cf542c50ff38
+title: 'Problem 185: Number Mind'
+challengeType: 5
+forumTopicId: 301821
+dashedName: problem-185-number-mind
+---
+
+# --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.
+
+# --hints--
+
+`euler185()` should return 4640261571849533.
+
+```js
+assert.strictEqual(euler185(), 4640261571849533);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler185() {
+
+  return true;
+}
+
+euler185();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
new file mode 100644
index 0000000000..119501f833
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4281000cf542c50ff39
+title: 'Problem 186: Connectedness of a network'
+challengeType: 5
+forumTopicId: 301822
+dashedName: problem-186-connectedness-of-a-network
+---
+
+# --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?
+
+# --hints--
+
+`euler186()` should return 2325629.
+
+```js
+assert.strictEqual(euler186(), 2325629);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler186() {
+
+  return true;
+}
+
+euler186();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
new file mode 100644
index 0000000000..043684a9d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4291000cf542c50ff3a
+title: 'Problem 187: Semiprimes'
+challengeType: 5
+forumTopicId: 301823
+dashedName: problem-187-semiprimes
+---
+
+# --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 &lt; 108, have precisely two, not necessarily distinct, prime factors?
+
+# --hints--
+
+`euler187()` should return 17427258.
+
+```js
+assert.strictEqual(euler187(), 17427258);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler187() {
+
+  return true;
+}
+
+euler187();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
new file mode 100644
index 0000000000..8c24a2f8e9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4291000cf542c50ff3b
+title: 'Problem 188: The hyperexponentiation of a number'
+challengeType: 5
+forumTopicId: 301824
+dashedName: problem-188-the-hyperexponentiation-of-a-number
+---
+
+# --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.
+
+# --hints--
+
+`euler188()` should return 95962097.
+
+```js
+assert.strictEqual(euler188(), 95962097);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler188() {
+
+  return true;
+}
+
+euler188();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
new file mode 100644
index 0000000000..4153d58442
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4291000cf542c50ff3c
+title: 'Problem 189: Tri-colouring a triangular grid'
+challengeType: 5
+forumTopicId: 301825
+dashedName: problem-189-tri-colouring-a-triangular-grid
+---
+
+# --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?
+
+# --hints--
+
+`euler189()` should return 10834893628237824.
+
+```js
+assert.strictEqual(euler189(), 10834893628237824);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler189() {
+
+  return true;
+}
+
+euler189();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
new file mode 100644
index 0000000000..c12d6d1c6b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-19-counting-sundays.md
@@ -0,0 +1,76 @@
+---
+id: 5900f37f1000cf542c50fe92
+title: 'Problem 19: Counting Sundays'
+challengeType: 5
+forumTopicId: 301827
+dashedName: problem-19-counting-sundays
+---
+
+# --description--
+
+You are given the following information, but you may prefer to do some research for yourself.
+
+<ul>
+  <li>1 Jan 1900 was a Monday.</li>
+  <li>Thirty days has September,<br>April, June and November.<br>All the rest have thirty-one,<br>Saving February alone,<br>Which has twenty-eight, rain or shine.<br>And on leap years, twenty-nine.</li>
+  <li>A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.</li>
+</ul>
+
+How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
+
+# --hints--
+
+`countingSundays(1943, 1946)` should return a number.
+
+```js
+assert(typeof countingSundays(1943, 1946) === 'number');
+```
+
+`countingSundays(1943, 1946)` should return 6.
+
+```js
+assert.strictEqual(countingSundays(1943, 1946), 6);
+```
+
+`countingSundays(1995, 2000)` should return 10.
+
+```js
+assert.strictEqual(countingSundays(1995, 2000), 10);
+```
+
+`countingSundays(1901, 2000)` should return 171.
+
+```js
+assert.strictEqual(countingSundays(1901, 2000), 171);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingSundays(firstYear, lastYear) {
+
+  return true;
+}
+
+countingSundays(1943, 1946);
+```
+
+# --solutions--
+
+```js
+function countingSundays(firstYear, lastYear) {
+  let sundays = 0;
+
+  for (let year = firstYear; year <= lastYear; year++) {
+    for (let month = 0; month <= 11; month++) {
+      const thisDate = new Date(year, month, 1);
+      if (thisDate.getDay() === 0) {
+        sundays++;
+      }
+    }
+  }
+  return sundays;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
new file mode 100644
index 0000000000..143247df80
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-190-maximising-a-weighted-product.md
@@ -0,0 +1,42 @@
+---
+id: 5900f42b1000cf542c50ff3d
+title: 'Problem 190: Maximising a weighted product'
+challengeType: 5
+forumTopicId: 301828
+dashedName: problem-190-maximising-a-weighted-product
+---
+
+# --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.
+
+# --hints--
+
+`euler190()` should return 371048281.
+
+```js
+assert.strictEqual(euler190(), 371048281);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler190() {
+
+  return true;
+}
+
+euler190();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
new file mode 100644
index 0000000000..bd93cdca4c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-191-prize-strings.md
@@ -0,0 +1,46 @@
+---
+id: 5900f42b1000cf542c50ff3e
+title: 'Problem 191: Prize Strings'
+challengeType: 5
+forumTopicId: 301829
+dashedName: problem-191-prize-strings
+---
+
+# --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?
+
+# --hints--
+
+`euler191()` should return 1918080160.
+
+```js
+assert.strictEqual(euler191(), 1918080160);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler191() {
+
+  return true;
+}
+
+euler191();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
new file mode 100644
index 0000000000..6751cbffaf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-192-best-approximations.md
@@ -0,0 +1,46 @@
+---
+id: 5900f42c1000cf542c50ff3f
+title: 'Problem 192: Best Approximations'
+challengeType: 5
+forumTopicId: 301830
+dashedName: problem-192-best-approximations
+---
+
+# --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| &lt; |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 &lt; n ≤ 100000.
+
+# --hints--
+
+`euler192()` should return 57060635927998344.
+
+```js
+assert.strictEqual(euler192(), 57060635927998344);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler192() {
+
+  return true;
+}
+
+euler192();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
new file mode 100644
index 0000000000..1b9cc8d490
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-193-squarefree-numbers.md
@@ -0,0 +1,40 @@
+---
+id: 5900f42f1000cf542c50ff41
+title: 'Problem 193: Squarefree Numbers'
+challengeType: 5
+forumTopicId: 301831
+dashedName: problem-193-squarefree-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler193()` should return 684465067343069.
+
+```js
+assert.strictEqual(euler193(), 684465067343069);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler193() {
+
+  return true;
+}
+
+euler193();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
new file mode 100644
index 0000000000..947d65c787
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-194-coloured-configurations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f42f1000cf542c50ff40
+title: 'Problem 194: Coloured Configurations'
+challengeType: 5
+forumTopicId: 301832
+dashedName: problem-194-coloured-configurations
+---
+
+# --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).
+
+# --hints--
+
+`euler194()` should return 61190912.
+
+```js
+assert.strictEqual(euler194(), 61190912);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler194() {
+
+  return true;
+}
+
+euler194();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
new file mode 100644
index 0000000000..cd52202435
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4311000cf542c50ff43
+title: 'Problem 195: Inscribed circles of triangles with one angle of 60 degrees'
+challengeType: 5
+forumTopicId: 301833
+dashedName: problem-195-inscribed-circles-of-triangles-with-one-angle-of-60-degrees
+---
+
+# --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).
+
+# --hints--
+
+`euler195()` should return 75085391.
+
+```js
+assert.strictEqual(euler195(), 75085391);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler195() {
+
+  return true;
+}
+
+euler195();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
new file mode 100644
index 0000000000..4ead4631dd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-196-prime-triplets.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4301000cf542c50ff42
+title: 'Problem 196: Prime triplets'
+challengeType: 5
+forumTopicId: 301834
+dashedName: problem-196-prime-triplets
+---
+
+# --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).
+
+# --hints--
+
+`euler196()` should return 322303240771079940.
+
+```js
+assert.strictEqual(euler196(), 322303240771079940);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler196() {
+
+  return true;
+}
+
+euler196();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
new file mode 100644
index 0000000000..1e2f3fe30d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4311000cf542c50ff44
+title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
+challengeType: 5
+forumTopicId: 301835
+dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler197()` should return 1.710637717.
+
+```js
+assert.strictEqual(euler197(), 1.710637717);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler197() {
+
+  return true;
+}
+
+euler197();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
new file mode 100644
index 0000000000..a955aa7c37
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-198-ambiguous-numbers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4331000cf542c50ff45
+title: 'Problem 198: Ambiguous Numbers'
+challengeType: 5
+forumTopicId: 301836
+dashedName: problem-198-ambiguous-numbers
+---
+
+# --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 &lt; x &lt; 1/100, are there whose denominator q does not exceed 108?
+
+# --hints--
+
+`euler198()` should return 52374425.
+
+```js
+assert.strictEqual(euler198(), 52374425);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler198() {
+
+  return true;
+}
+
+euler198();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
new file mode 100644
index 0000000000..28479e80b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md
@@ -0,0 +1,75 @@
+---
+id: 5900f4341000cf542c50ff46
+title: 'Problem 199: Iterative Circle Packing'
+challengeType: 5
+forumTopicId: 301837
+dashedName: problem-199-iterative-circle-packing
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of non-overlapping concentric circles" src="https://cdn-media-1.freecodecamp.org/project-euler/199-circles-in-circles.gif" style="background-color: white; padding: 10px;">
+
+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 `n` iterations? Give your answer rounded to eight decimal places using the format x.xxxxxxxx .
+
+# --hints--
+
+`iterativeCirclePacking(10)` should return a number.
+
+```js
+assert(typeof iterativeCirclePacking(10) === 'number');
+```
+
+`iterativeCirclePacking(10)` should return 0.00396087.
+
+```js
+assert.strictEqual(iterativeCirclePacking(10), 0.00396087);
+```
+
+`iterativeCirclePacking(3)` should return 0.06790342.
+
+```js
+assert.strictEqual(iterativeCirclePacking(3), 0.06790342);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function iterativeCirclePacking(n) {
+
+  return true;
+}
+
+iterativeCirclePacking(10);
+```
+
+# --solutions--
+
+```js
+function iterativeCirclePacking(n) {
+  let k1 = 1;
+  let k0 = k1 * (3 - 2 * Math.sqrt(3));
+  let a0 = 1 / (k0 * k0);
+  let a1 = 3 / (k1 * k1);
+  a1 += 3 * getArea(k0, k1, k1, n);
+  a1 += getArea(k1, k1, k1, n);
+  let final = ((a0 - a1) / a0).toFixed(8);
+  
+  return parseFloat(final);
+  function getArea(k1, k2, k3, depth) {
+      if (depth == 0) return 0.0;
+      let k4 = k1 + k2 + k3 + 2 * Math.sqrt(k1 * k2 + k2 * k3 + k3 * k1);
+      let a = 1 / (k4 * k4);
+      a += getArea(k1, k2, k4, depth - 1);
+      a += getArea(k2, k3, k4, depth - 1);
+      a += getArea(k3, k1, k4, depth - 1);
+      return a;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
new file mode 100644
index 0000000000..ecf2a8aa73
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers.md
@@ -0,0 +1,103 @@
+---
+id: 5900f36e1000cf542c50fe81
+title: 'Problem 2: Even Fibonacci Numbers'
+challengeType: 5
+forumTopicId: 301838
+dashedName: problem-2-even-fibonacci-numbers
+---
+
+# --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:
+
+<div style='text-align: center;'>1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</div>
+
+By considering the terms in the Fibonacci sequence whose values do not exceed `n`, find the sum of the even-valued terms.
+
+# --hints--
+
+`fiboEvenSum(10)` should return a number.
+
+```js
+assert(typeof fiboEvenSum(10) === 'number');
+```
+
+Your function should return an `even` value.
+
+```js
+assert.equal(fiboEvenSum(10) % 2 === 0, true);
+```
+
+Your function should sum the even-valued Fibonacci numbers: `fiboEvenSum(8)` should return 10.
+
+```js
+assert.strictEqual(fiboEvenSum(8), 10);
+```
+
+`fiboEvenSum(10)` should return 10.
+
+```js
+assert.strictEqual(fiboEvenSum(10), 10);
+```
+
+`fiboEvenSum(34)` should return 44.
+
+```js
+assert.strictEqual(fiboEvenSum(34), 44);
+```
+
+`fiboEvenSum(60)` should return 44.
+
+```js
+assert.strictEqual(fiboEvenSum(60), 44);
+```
+
+`fiboEvenSum(1000)` should return 798.
+
+```js
+assert.strictEqual(fiboEvenSum(1000), 798);
+```
+
+`fiboEvenSum(100000)` should return 60696.
+
+```js
+assert.strictEqual(fiboEvenSum(100000), 60696);
+```
+
+`fiboEvenSum(4000000)` should return 4613732.
+
+```js
+assert.strictEqual(fiboEvenSum(4000000), 4613732);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fiboEvenSum(n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const fiboEvenSum = (number) => {
+  if (number <= 1) {
+    return 0;
+  } else {
+    let evenSum = 0,
+      prevFibNum = 1,
+      fibNum = 2; // According to problem description our Fibonacci series starts with 1, 2
+    for (let i = 2; fibNum <= number; i++) {
+      if (fibNum % 2 == 0) {
+        evenSum += fibNum;
+      }
+      [prevFibNum, fibNum] = [fibNum, prevFibNum + fibNum];
+    }
+    return evenSum;
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
new file mode 100644
index 0000000000..579ac97f6f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.md
@@ -0,0 +1,79 @@
+---
+id: 5900f3801000cf542c50fe93
+title: 'Problem 20: Factorial digit sum'
+challengeType: 5
+forumTopicId: 301839
+dashedName: problem-20-factorial-digit-sum
+---
+
+# --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`!
+
+# --hints--
+
+`sumFactorialDigits(10)` should return a number.
+
+```js
+assert(typeof sumFactorialDigits(10) === 'number');
+```
+
+`sumFactorialDigits(10)` should return 27.
+
+```js
+assert.strictEqual(sumFactorialDigits(10), 27);
+```
+
+`sumFactorialDigits(25)` should return 72.
+
+```js
+assert.strictEqual(sumFactorialDigits(25), 72);
+```
+
+`sumFactorialDigits(50)` should return 216.
+
+```js
+assert.strictEqual(sumFactorialDigits(50), 216);
+```
+
+`sumFactorialDigits(75)` should return 432.
+
+```js
+assert.strictEqual(sumFactorialDigits(75), 432);
+```
+
+`sumFactorialDigits(100)` should return 648.
+
+```js
+assert.strictEqual(sumFactorialDigits(100), 648);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumFactorialDigits(n) {
+
+  return n;
+}
+
+sumFactorialDigits(100);
+```
+
+# --solutions--
+
+```js
+let factorial = (n) => n <= 1 ? BigInt(n) : BigInt(n) * BigInt(factorial(--n));
+
+let sumDigits = n => n.toString().split('').map(x => parseInt(x)).reduce((a,b) => a + b);
+
+function sumFactorialDigits(n) {
+  return sumDigits(factorial(n));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
new file mode 100644
index 0000000000..bacbb306a1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4351000cf542c50ff47
+title: >-
+  Problem 200: Find the 200th prime-proof sqube containing the contiguous
+  sub-string "200"
+challengeType: 5
+forumTopicId: 301840
+dashedName: >-
+  problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
+---
+
+# --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".
+
+# --hints--
+
+`euler200()` should return 229161792008.
+
+```js
+assert.strictEqual(euler200(), 229161792008);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler200() {
+
+  return true;
+}
+
+euler200();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
new file mode 100644
index 0000000000..045fd9b2b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-201-subsets-with-a-unique-sum.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4361000cf542c50ff48
+title: 'Problem 201: Subsets with a unique sum'
+challengeType: 5
+forumTopicId: 301841
+dashedName: problem-201-subsets-with-a-unique-sum
+---
+
+# --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)).
+
+# --hints--
+
+`euler201()` should return 115039000.
+
+```js
+assert.strictEqual(euler201(), 115039000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler201() {
+
+  return true;
+}
+
+euler201();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
new file mode 100644
index 0000000000..c42f68e414
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-202-laserbeam.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4371000cf542c50ff49
+title: 'Problem 202: Laserbeam'
+challengeType: 5
+forumTopicId: 301843
+dashedName: problem-202-laserbeam
+---
+
+# --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?
+
+# --hints--
+
+`euler202()` should return 1209002624.
+
+```js
+assert.strictEqual(euler202(), 1209002624);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler202() {
+
+  return true;
+}
+
+euler202();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
new file mode 100644
index 0000000000..4ecf609e4b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-203-squarefree-binomial-coefficients.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4381000cf542c50ff4a
+title: 'Problem 203: Squarefree Binomial Coefficients'
+challengeType: 5
+forumTopicId: 301844
+dashedName: problem-203-squarefree-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler203()` should return 34029210557338.
+
+```js
+assert.strictEqual(euler203(), 34029210557338);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler203() {
+
+  return true;
+}
+
+euler203();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
new file mode 100644
index 0000000000..4d81e08eea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-204-generalised-hamming-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4381000cf542c50ff4b
+title: 'Problem 204: Generalised Hamming Numbers'
+challengeType: 5
+forumTopicId: 301845
+dashedName: problem-204-generalised-hamming-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler204()` should return 2944730.
+
+```js
+assert.strictEqual(euler204(), 2944730);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler204() {
+
+  return true;
+}
+
+euler204();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-205-dice-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
new file mode 100644
index 0000000000..41bf903b6d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4391000cf542c50ff4c
+title: 'Problem 205: Dice Game'
+challengeType: 5
+forumTopicId: 301846
+dashedName: problem-205-dice-game
+---
+
+# --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
+
+# --hints--
+
+`euler205()` should return 0.5731441.
+
+```js
+assert.strictEqual(euler205(), 0.5731441);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler205() {
+
+  return true;
+}
+
+euler205();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
new file mode 100644
index 0000000000..eaedced890
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-206-concealed-square.md
@@ -0,0 +1,38 @@
+---
+id: 5900f43a1000cf542c50ff4d
+title: 'Problem 206: Concealed Square'
+challengeType: 5
+forumTopicId: 301847
+dashedName: problem-206-concealed-square
+---
+
+# --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.
+
+# --hints--
+
+`euler206()` should return 1389019170.
+
+```js
+assert.strictEqual(euler206(), 1389019170);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler206() {
+
+  return true;
+}
+
+euler206();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
new file mode 100644
index 0000000000..19f1d12c8d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-207-integer-partition-equations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f43c1000cf542c50ff4e
+title: 'Problem 207: Integer partition equations'
+challengeType: 5
+forumTopicId: 301848
+dashedName: problem-207-integer-partition-equations
+---
+
+# --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) &lt; 1/12345
+
+# --hints--
+
+`euler207()` should return 44043947822.
+
+```js
+assert.strictEqual(euler207(), 44043947822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler207() {
+
+  return true;
+}
+
+euler207();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
new file mode 100644
index 0000000000..36d5a8fff5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-208-robot-walks.md
@@ -0,0 +1,42 @@
+---
+id: 5900f43f1000cf542c50ff51
+title: 'Problem 208: Robot Walks'
+challengeType: 5
+forumTopicId: 301849
+dashedName: problem-208-robot-walks
+---
+
+# --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.)
+
+# --hints--
+
+`euler208()` should return 331951449665644800.
+
+```js
+assert.strictEqual(euler208(), 331951449665644800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler208() {
+
+  return true;
+}
+
+euler208();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
new file mode 100644
index 0000000000..f743744736
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-209-circular-logic.md
@@ -0,0 +1,44 @@
+---
+id: 5900f43e1000cf542c50ff4f
+title: 'Problem 209: Circular Logic'
+challengeType: 5
+forumTopicId: 301850
+dashedName: problem-209-circular-logic
+---
+
+# --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)?
+
+# --hints--
+
+`euler209()` should return 15964587728784.
+
+```js
+assert.strictEqual(euler209(), 15964587728784);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler209() {
+
+  return true;
+}
+
+euler209();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
new file mode 100644
index 0000000000..58acfba70e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md
@@ -0,0 +1,84 @@
+---
+id: 5900f3811000cf542c50fe94
+title: 'Problem 21: Amicable numbers'
+challengeType: 5
+forumTopicId: 301851
+dashedName: problem-21-amicable-numbers
+---
+
+# --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 `n`.
+
+# --hints--
+
+`sumAmicableNum(1000)` should return a number.
+
+```js
+assert(typeof sumAmicableNum(1000) === 'number');
+```
+
+`sumAmicableNum(1000)` should return 504.
+
+```js
+assert.strictEqual(sumAmicableNum(1000), 504);
+```
+
+`sumAmicableNum(2000)` should return 2898.
+
+```js
+assert.strictEqual(sumAmicableNum(2000), 2898);
+```
+
+`sumAmicableNum(5000)` should return 8442.
+
+```js
+assert.strictEqual(sumAmicableNum(5000), 8442);
+```
+
+`sumAmicableNum(10000)` should return 31626.
+
+```js
+assert.strictEqual(sumAmicableNum(10000), 31626);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumAmicableNum(n) {
+
+  return n;
+}
+
+sumAmicableNum(10000);
+```
+
+# --solutions--
+
+```js
+const sumAmicableNum = (n) => {
+  const fsum = (n) => {
+    let sum = 1;
+    for (let i = 2; i <= Math.floor(Math.sqrt(n)); i++)
+      if (Math.floor(n % i) === 0)
+        sum += i + Math.floor(n / i);
+    return sum;
+  };
+  let d = [];
+  let amicableSum = 0;
+  for (let i=2; i<n; i++) d[i] = fsum(i);
+  for (let i=2; i<n; i++) {
+    let dsum = d[i];
+    if (d[dsum]===i && i!==dsum) amicableSum += i+dsum;
+  }
+  return amicableSum/2;
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
new file mode 100644
index 0000000000..1fc7d98033
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f43e1000cf542c50ff50
+title: 'Problem 210: Obtuse Angled Triangles'
+challengeType: 5
+forumTopicId: 301852
+dashedName: problem-210-obtuse-angled-triangles
+---
+
+# --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°&lt;α&lt;180°.
+
+So, for example, N(4)=24 and N(8)=100.
+
+What is N(1,000,000,000)?
+
+# --hints--
+
+`euler210()` should return 1598174770174689500.
+
+```js
+assert.strictEqual(euler210(), 1598174770174689500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler210() {
+
+  return true;
+}
+
+euler210();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
new file mode 100644
index 0000000000..bde41e4a79
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-211-divisor-square-sum.md
@@ -0,0 +1,42 @@
+---
+id: 5900f43f1000cf542c50ff52
+title: 'Problem 211: Divisor Square Sum'
+challengeType: 5
+forumTopicId: 301853
+dashedName: problem-211-divisor-square-sum
+---
+
+# --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 &lt; n &lt; 64,000,000 such that σ2(n) is a perfect square.
+
+# --hints--
+
+`euler211()` should return 1922364685.
+
+```js
+assert.strictEqual(euler211(), 1922364685);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler211() {
+
+  return true;
+}
+
+euler211();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
new file mode 100644
index 0000000000..901bbbc3d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-212-combined-volume-of-cuboids.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4411000cf542c50ff53
+title: 'Problem 212: Combined Volume of Cuboids'
+challengeType: 5
+forumTopicId: 301854
+dashedName: problem-212-combined-volume-of-cuboids
+---
+
+# --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 ?
+
+# --hints--
+
+`euler212()` should return 328968937309.
+
+```js
+assert.strictEqual(euler212(), 328968937309);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler212() {
+
+  return true;
+}
+
+euler212();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
new file mode 100644
index 0000000000..2fbc23393c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-213-flea-circus.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4411000cf542c50ff54
+title: 'Problem 213: Flea Circus'
+challengeType: 5
+forumTopicId: 301855
+dashedName: problem-213-flea-circus
+---
+
+# --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.
+
+# --hints--
+
+`euler213()` should return 330.721154.
+
+```js
+assert.strictEqual(euler213(), 330.721154);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler213() {
+
+  return true;
+}
+
+euler213();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
new file mode 100644
index 0000000000..754596cef6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-214-totient-chains.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4421000cf542c50ff55
+title: 'Problem 214: Totient Chains'
+challengeType: 5
+forumTopicId: 301856
+dashedName: problem-214-totient-chains
+---
+
+# --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?
+
+# --hints--
+
+`euler214()` should return 1677366278943.
+
+```js
+assert.strictEqual(euler214(), 1677366278943);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler214() {
+
+  return true;
+}
+
+euler214();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
new file mode 100644
index 0000000000..45f7f563e7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-215-crack-free-walls.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4431000cf542c50ff56
+title: 'Problem 215: Crack-free Walls'
+challengeType: 5
+forumTopicId: 301857
+dashedName: problem-215-crack-free-walls
+---
+
+# --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).
+
+# --hints--
+
+`euler215()` should return 806844323190414.
+
+```js
+assert.strictEqual(euler215(), 806844323190414);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler215() {
+
+  return true;
+}
+
+euler215();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
new file mode 100644
index 0000000000..e7591cd46f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4451000cf542c50ff57
+title: 'Problem 216: Investigating the primality of numbers of the form 2n2-1'
+challengeType: 5
+forumTopicId: 301858
+dashedName: problem-216-investigating-the-primality-of-numbers-of-the-form-2n2-1
+---
+
+# --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 ?
+
+# --hints--
+
+`euler216()` should return 5437849.
+
+```js
+assert.strictEqual(euler216(), 5437849);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler216() {
+
+  return true;
+}
+
+euler216();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
new file mode 100644
index 0000000000..625b4a6c6d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-217-balanced-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4461000cf542c50ff58
+title: 'Problem 217: Balanced Numbers'
+challengeType: 5
+forumTopicId: 301859
+dashedName: problem-217-balanced-numbers
+---
+
+# --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
+
+# --hints--
+
+`euler217()` should return 6273134.
+
+```js
+assert.strictEqual(euler217(), 6273134);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler217() {
+
+  return true;
+}
+
+euler217();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
new file mode 100644
index 0000000000..db91d74874
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4461000cf542c50ff59
+title: 'Problem 218: Perfect right-angled triangles'
+challengeType: 5
+forumTopicId: 301860
+dashedName: problem-218-perfect-right-angled-triangles
+---
+
+# --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?
+
+# --hints--
+
+`euler218()` should return 0.
+
+```js
+assert.strictEqual(euler218(), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler218() {
+
+  return true;
+}
+
+euler218();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
new file mode 100644
index 0000000000..38d16eba87
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-219-skew-cost-coding.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4481000cf542c50ff5a
+title: 'Problem 219: Skew-cost coding'
+challengeType: 5
+forumTopicId: 301861
+dashedName: problem-219-skew-cost-coding
+---
+
+# --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) ?
+
+# --hints--
+
+`euler219()` should return 64564225042.
+
+```js
+assert.strictEqual(euler219(), 64564225042);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler219() {
+
+  return true;
+}
+
+euler219();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-22-names-scores.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
new file mode 100644
index 0000000000..e93e40d6ef
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-22-names-scores.md
@@ -0,0 +1,90 @@
+---
+id: 5a51eabcad78bf416f316e2a
+title: 'Problem 22: Names scores'
+challengeType: 5
+forumTopicId: 301862
+dashedName: problem-22-names-scores
+---
+
+# --description--
+
+Using `names`, an array defined in the background 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 array?
+
+# --hints--
+
+`namesScores(test1)` should return a number.
+
+```js
+assert(typeof namesScores(test1) === 'number');
+```
+
+`namesScores(test1)` should return 791.
+
+```js
+assert.strictEqual(namesScores(test1), 791);
+```
+
+`namesScores(test2)` should return 1468.
+
+```js
+assert.strictEqual(namesScores(test2), 1468);
+```
+
+`namesScores(names)` should return 871198282.
+
+```js
+assert.strictEqual(namesScores(names), 871198282);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const names = ['MARY','PATRICIA','LINDA','BARBARA','ELIZABETH','JENNIFER','MARIA','SUSAN','MARGARET','DOROTHY','LISA','NANCY','KAREN','BETTY','HELEN','SANDRA','DONNA','CAROL','RUTH','SHARON','MICHELLE','LAURA','SARAH','KIMBERLY','DEBORAH','JESSICA','SHIRLEY','CYNTHIA','ANGELA','MELISSA','BRENDA','AMY','ANNA','REBECCA','VIRGINIA','KATHLEEN','PAMELA','MARTHA','DEBRA','AMANDA','STEPHANIE','CAROLYN','CHRISTINE','MARIE','JANET','CATHERINE','FRANCES','ANN','JOYCE','DIANE','ALICE','JULIE','HEATHER','TERESA','DORIS','GLORIA','EVELYN','JEAN','CHERYL','MILDRED','KATHERINE','JOAN','ASHLEY','JUDITH','ROSE','JANICE','KELLY','NICOLE','JUDY','CHRISTINA','KATHY','THERESA','BEVERLY','DENISE','TAMMY','IRENE','JANE','LORI','RACHEL','MARILYN','ANDREA','KATHRYN','LOUISE','SARA','ANNE','JACQUELINE','WANDA','BONNIE','JULIA','RUBY','LOIS','TINA','PHYLLIS','NORMA','PAULA','DIANA','ANNIE','LILLIAN','EMILY','ROBIN','PEGGY','CRYSTAL','GLADYS','RITA','DAWN','CONNIE','FLORENCE','TRACY','EDNA','TIFFANY','CARMEN','ROSA','CINDY','GRACE','WENDY','VICTORIA','EDITH','KIM','SHERRY','SYLVIA','JOSEPHINE','THELMA','SHANNON','SHEILA','ETHEL','ELLEN','ELAINE','MARJORIE','CARRIE','CHARLOTTE','MONICA','ESTHER','PAULINE','EMMA','JUANITA','ANITA','RHONDA','HAZEL','AMBER','EVA','DEBBIE','APRIL','LESLIE','CLARA','LUCILLE','JAMIE','JOANNE','ELEANOR','VALERIE','DANIELLE','MEGAN','ALICIA','SUZANNE','MICHELE','GAIL','BERTHA','DARLENE','VERONICA','JILL','ERIN','GERALDINE','LAUREN','CATHY','JOANN','LORRAINE','LYNN','SALLY','REGINA','ERICA','BEATRICE','DOLORES','BERNICE','AUDREY','YVONNE','ANNETTE','JUNE','SAMANTHA','MARION','DANA','STACY','ANA','RENEE','IDA','VIVIAN','ROBERTA','HOLLY','BRITTANY','MELANIE','LORETTA','YOLANDA','JEANETTE','LAURIE','KATIE','KRISTEN','VANESSA','ALMA','SUE','ELSIE','BETH','JEANNE','VICKI','CARLA','TARA','ROSEMARY','EILEEN','TERRI','GERTRUDE','LUCY','TONYA','ELLA','STACEY','WILMA','GINA','KRISTIN','JESSIE','NATALIE','AGNES','VERA','WILLIE','CHARLENE','BESSIE','DELORES','MELINDA','PEARL','ARLENE','MAUREEN','COLLEEN','ALLISON','TAMARA','JOY','GEORGIA','CONSTANCE','LILLIE','CLAUDIA','JACKIE','MARCIA','TANYA','NELLIE','MINNIE','MARLENE','HEIDI','GLENDA','LYDIA','VIOLA','COURTNEY','MARIAN','STELLA','CAROLINE','DORA','JO','VICKIE','MATTIE','TERRY','MAXINE','IRMA','MABEL','MARSHA','MYRTLE','LENA','CHRISTY','DEANNA','PATSY','HILDA','GWENDOLYN','JENNIE','NORA','MARGIE','NINA','CASSANDRA','LEAH','PENNY','KAY','PRISCILLA','NAOMI','CAROLE','BRANDY','OLGA','BILLIE','DIANNE','TRACEY','LEONA','JENNY','FELICIA','SONIA','MIRIAM','VELMA','BECKY','BOBBIE','VIOLET','KRISTINA','TONI','MISTY','MAE','SHELLY','DAISY','RAMONA','SHERRI','ERIKA','KATRINA','CLAIRE','LINDSEY','LINDSAY','GENEVA','GUADALUPE','BELINDA','MARGARITA','SHERYL','CORA','FAYE','ADA','NATASHA','SABRINA','ISABEL','MARGUERITE','HATTIE','HARRIET','MOLLY','CECILIA','KRISTI','BRANDI','BLANCHE','SANDY','ROSIE','JOANNA','IRIS','EUNICE','ANGIE','INEZ','LYNDA','MADELINE','AMELIA','ALBERTA','GENEVIEVE','MONIQUE','JODI','JANIE','MAGGIE','KAYLA','SONYA','JAN','LEE','KRISTINE','CANDACE','FANNIE','MARYANN','OPAL','ALISON','YVETTE','MELODY','LUZ','SUSIE','OLIVIA','FLORA','SHELLEY','KRISTY','MAMIE','LULA','LOLA','VERNA','BEULAH','ANTOINETTE','CANDICE','JUANA','JEANNETTE','PAM','KELLI','HANNAH','WHITNEY','BRIDGET','KARLA','CELIA','LATOYA','PATTY','SHELIA','GAYLE','DELLA','VICKY','LYNNE','SHERI','MARIANNE','KARA','JACQUELYN','ERMA','BLANCA','MYRA','LETICIA','PAT','KRISTA','ROXANNE','ANGELICA','JOHNNIE','ROBYN','FRANCIS','ADRIENNE','ROSALIE','ALEXANDRA','BROOKE','BETHANY','SADIE','BERNADETTE','TRACI','JODY','KENDRA','JASMINE','NICHOLE','RACHAEL','CHELSEA','MABLE','ERNESTINE','MURIEL','MARCELLA','ELENA','KRYSTAL','ANGELINA','NADINE','KARI','ESTELLE','DIANNA','PAULETTE','LORA','MONA','DOREEN','ROSEMARIE','ANGEL','DESIREE','ANTONIA','HOPE','GINGER','JANIS','BETSY','CHRISTIE','FREDA','MERCEDES','MEREDITH','LYNETTE','TERI','CRISTINA','EULA','LEIGH','MEGHAN','SOPHIA','ELOISE','ROCHELLE','GRETCHEN','CECELIA','RAQUEL','HENRIETTA','ALYSSA','JANA','KELLEY','GWEN','KERRY','JENNA','TRICIA','LAVERNE','OLIVE','ALEXIS','TASHA','SILVIA','ELVIRA','CASEY','DELIA','SOPHIE','KATE','PATTI','LORENA','KELLIE','SONJA','LILA','LANA','DARLA','MAY','MINDY','ESSIE','MANDY','LORENE','ELSA','JOSEFINA','JEANNIE','MIRANDA','DIXIE','LUCIA','MARTA','FAITH','LELA','JOHANNA','SHARI','CAMILLE','TAMI','SHAWNA','ELISA','EBONY','MELBA','ORA','NETTIE','TABITHA','OLLIE','JAIME','WINIFRED','KRISTIE','MARINA','ALISHA','AIMEE','RENA','MYRNA','MARLA','TAMMIE','LATASHA','BONITA','PATRICE','RONDA','SHERRIE','ADDIE','FRANCINE','DELORIS','STACIE','ADRIANA','CHERI','SHELBY','ABIGAIL','CELESTE','JEWEL','CARA','ADELE','REBEKAH','LUCINDA','DORTHY','CHRIS','EFFIE','TRINA','REBA','SHAWN','SALLIE','AURORA','LENORA','ETTA','LOTTIE','KERRI','TRISHA','NIKKI','ESTELLA','FRANCISCA','JOSIE','TRACIE','MARISSA','KARIN','BRITTNEY','JANELLE','LOURDES','LAUREL','HELENE','FERN','ELVA','CORINNE','KELSEY','INA','BETTIE','ELISABETH','AIDA','CAITLIN','INGRID','IVA','EUGENIA','CHRISTA','GOLDIE','CASSIE','MAUDE','JENIFER','THERESE','FRANKIE','DENA','LORNA','JANETTE','LATONYA','CANDY','MORGAN','CONSUELO','TAMIKA','ROSETTA','DEBORA','CHERIE','POLLY','DINA','JEWELL','FAY','JILLIAN','DOROTHEA','NELL','TRUDY','ESPERANZA','PATRICA','KIMBERLEY','SHANNA','HELENA','CAROLINA','CLEO','STEFANIE','ROSARIO','OLA','JANINE','MOLLIE','LUPE','ALISA','LOU','MARIBEL','SUSANNE','BETTE','SUSANA','ELISE','CECILE','ISABELLE','LESLEY','JOCELYN','PAIGE','JONI','RACHELLE','LEOLA','DAPHNE','ALTA','ESTER','PETRA','GRACIELA','IMOGENE','JOLENE','KEISHA','LACEY','GLENNA','GABRIELA','KERI','URSULA','LIZZIE','KIRSTEN','SHANA','ADELINE','MAYRA','JAYNE','JACLYN','GRACIE','SONDRA','CARMELA','MARISA','ROSALIND','CHARITY','TONIA','BEATRIZ','MARISOL','CLARICE','JEANINE','SHEENA','ANGELINE','FRIEDA','LILY','ROBBIE','SHAUNA','MILLIE','CLAUDETTE','CATHLEEN','ANGELIA','GABRIELLE','AUTUMN','KATHARINE','SUMMER','JODIE','STACI','LEA','CHRISTI','JIMMIE','JUSTINE','ELMA','LUELLA','MARGRET','DOMINIQUE','SOCORRO','RENE','MARTINA','MARGO','MAVIS','CALLIE','BOBBI','MARITZA','LUCILE','LEANNE','JEANNINE','DEANA','AILEEN','LORIE','LADONNA','WILLA','MANUELA','GALE','SELMA','DOLLY','SYBIL','ABBY','LARA','DALE','IVY','DEE','WINNIE','MARCY','LUISA','JERI','MAGDALENA','OFELIA','MEAGAN','AUDRA','MATILDA','LEILA','CORNELIA','BIANCA','SIMONE','BETTYE','RANDI','VIRGIE','LATISHA','BARBRA','GEORGINA','ELIZA','LEANN','BRIDGETTE','RHODA','HALEY','ADELA','NOLA','BERNADINE','FLOSSIE','ILA','GRETA','RUTHIE','NELDA','MINERVA','LILLY','TERRIE','LETHA','HILARY','ESTELA','VALARIE','BRIANNA','ROSALYN','EARLINE','CATALINA','AVA','MIA','CLARISSA','LIDIA','CORRINE','ALEXANDRIA','CONCEPCION','TIA','SHARRON','RAE','DONA','ERICKA','JAMI','ELNORA','CHANDRA','LENORE','NEVA','MARYLOU','MELISA','TABATHA','SERENA','AVIS','ALLIE','SOFIA','JEANIE','ODESSA','NANNIE','HARRIETT','LORAINE','PENELOPE','MILAGROS','EMILIA','BENITA','ALLYSON','ASHLEE','TANIA','TOMMIE','ESMERALDA','KARINA','EVE','PEARLIE','ZELMA','MALINDA','NOREEN','TAMEKA','SAUNDRA','HILLARY','AMIE','ALTHEA','ROSALINDA','JORDAN','LILIA','ALANA','GAY','CLARE','ALEJANDRA','ELINOR','MICHAEL','LORRIE','JERRI','DARCY','EARNESTINE','CARMELLA','TAYLOR','NOEMI','MARCIE','LIZA','ANNABELLE','LOUISA','EARLENE','MALLORY','CARLENE','NITA','SELENA','TANISHA','KATY','JULIANNE','JOHN','LAKISHA','EDWINA','MARICELA','MARGERY','KENYA','DOLLIE','ROXIE','ROSLYN','KATHRINE','NANETTE','CHARMAINE','LAVONNE','ILENE','KRIS','TAMMI','SUZETTE','CORINE','KAYE','JERRY','MERLE','CHRYSTAL','LINA','DEANNE','LILIAN','JULIANA','ALINE','LUANN','KASEY','MARYANNE','EVANGELINE','COLETTE','MELVA','LAWANDA','YESENIA','NADIA','MADGE','KATHIE','EDDIE','OPHELIA','VALERIA','NONA','MITZI','MARI','GEORGETTE','CLAUDINE','FRAN','ALISSA','ROSEANN','LAKEISHA','SUSANNA','REVA','DEIDRE','CHASITY','SHEREE','CARLY','JAMES','ELVIA','ALYCE','DEIRDRE','GENA','BRIANA','ARACELI','KATELYN','ROSANNE','WENDI','TESSA','BERTA','MARVA','IMELDA','MARIETTA','MARCI','LEONOR','ARLINE','SASHA','MADELYN','JANNA','JULIETTE','DEENA','AURELIA','JOSEFA','AUGUSTA','LILIANA','YOUNG','CHRISTIAN','LESSIE','AMALIA','SAVANNAH','ANASTASIA','VILMA','NATALIA','ROSELLA','LYNNETTE','CORINA','ALFREDA','LEANNA','CAREY','AMPARO','COLEEN','TAMRA','AISHA','WILDA','KARYN','CHERRY','QUEEN','MAURA','MAI','EVANGELINA','ROSANNA','HALLIE','ERNA','ENID','MARIANA','LACY','JULIET','JACKLYN','FREIDA','MADELEINE','MARA','HESTER','CATHRYN','LELIA','CASANDRA','BRIDGETT','ANGELITA','JANNIE','DIONNE','ANNMARIE','KATINA','BERYL','PHOEBE','MILLICENT','KATHERYN','DIANN','CARISSA','MARYELLEN','LIZ','LAURI','HELGA','GILDA','ADRIAN','RHEA','MARQUITA','HOLLIE','TISHA','TAMERA','ANGELIQUE','FRANCESCA','BRITNEY','KAITLIN','LOLITA','FLORINE','ROWENA','REYNA','TWILA','FANNY','JANELL','INES','CONCETTA','BERTIE','ALBA','BRIGITTE','ALYSON','VONDA','PANSY','ELBA','NOELLE','LETITIA','KITTY','DEANN','BRANDIE','LOUELLA','LETA','FELECIA','SHARLENE','LESA','BEVERLEY','ROBERT','ISABELLA','HERMINIA','TERRA','CELINA','TORI','OCTAVIA','JADE','DENICE','GERMAINE','SIERRA','MICHELL','CORTNEY','NELLY','DORETHA','SYDNEY','DEIDRA','MONIKA','LASHONDA','JUDI','CHELSEY','ANTIONETTE','MARGOT','BOBBY','ADELAIDE','NAN','LEEANN','ELISHA','DESSIE','LIBBY','KATHI','GAYLA','LATANYA','MINA','MELLISA','KIMBERLEE','JASMIN','RENAE','ZELDA','ELDA','MA','JUSTINA','GUSSIE','EMILIE','CAMILLA','ABBIE','ROCIO','KAITLYN','JESSE','EDYTHE','ASHLEIGH','SELINA','LAKESHA','GERI','ALLENE','PAMALA','MICHAELA','DAYNA','CARYN','ROSALIA','SUN','JACQULINE','REBECA','MARYBETH','KRYSTLE','IOLA','DOTTIE','BENNIE','BELLE','AUBREY','GRISELDA','ERNESTINA','ELIDA','ADRIANNE','DEMETRIA','DELMA','CHONG','JAQUELINE','DESTINY','ARLEEN','VIRGINA','RETHA','FATIMA','TILLIE','ELEANORE','CARI','TREVA','BIRDIE','WILHELMINA','ROSALEE','MAURINE','LATRICE','YONG','JENA','TARYN','ELIA','DEBBY','MAUDIE','JEANNA','DELILAH','CATRINA','SHONDA','HORTENCIA','THEODORA','TERESITA','ROBBIN','DANETTE','MARYJANE','FREDDIE','DELPHINE','BRIANNE','NILDA','DANNA','CINDI','BESS','IONA','HANNA','ARIEL','WINONA','VIDA','ROSITA','MARIANNA','WILLIAM','RACHEAL','GUILLERMINA','ELOISA','CELESTINE','CAREN','MALISSA','LONA','CHANTEL','SHELLIE','MARISELA','LEORA','AGATHA','SOLEDAD','MIGDALIA','IVETTE','CHRISTEN','ATHENA','JANEL','CHLOE','VEDA','PATTIE','TESSIE','TERA','MARILYNN','LUCRETIA','KARRIE','DINAH','DANIELA','ALECIA','ADELINA','VERNICE','SHIELA','PORTIA','MERRY','LASHAWN','DEVON','DARA','TAWANA','OMA','VERDA','CHRISTIN','ALENE','ZELLA','SANDI','RAFAELA','MAYA','KIRA','CANDIDA','ALVINA','SUZAN','SHAYLA','LYN','LETTIE','ALVA','SAMATHA','ORALIA','MATILDE','MADONNA','LARISSA','VESTA','RENITA','INDIA','DELOIS','SHANDA','PHILLIS','LORRI','ERLINDA','CRUZ','CATHRINE','BARB','ZOE','ISABELL','IONE','GISELA','CHARLIE','VALENCIA','ROXANNA','MAYME','KISHA','ELLIE','MELLISSA','DORRIS','DALIA','BELLA','ANNETTA','ZOILA','RETA','REINA','LAURETTA','KYLIE','CHRISTAL','PILAR','CHARLA','ELISSA','TIFFANI','TANA','PAULINA','LEOTA','BREANNA','JAYME','CARMEL','VERNELL','TOMASA','MANDI','DOMINGA','SANTA','MELODIE','LURA','ALEXA','TAMELA','RYAN','MIRNA','KERRIE','VENUS','NOEL','FELICITA','CRISTY','CARMELITA','BERNIECE','ANNEMARIE','TIARA','ROSEANNE','MISSY','CORI','ROXANA','PRICILLA','KRISTAL','JUNG','ELYSE','HAYDEE','ALETHA','BETTINA','MARGE','GILLIAN','FILOMENA','CHARLES','ZENAIDA','HARRIETTE','CARIDAD','VADA','UNA','ARETHA','PEARLINE','MARJORY','MARCELA','FLOR','EVETTE','ELOUISE','ALINA','TRINIDAD','DAVID','DAMARIS','CATHARINE','CARROLL','BELVA','NAKIA','MARLENA','LUANNE','LORINE','KARON','DORENE','DANITA','BRENNA','TATIANA','SAMMIE','LOUANN','LOREN','JULIANNA','ANDRIA','PHILOMENA','LUCILA','LEONORA','DOVIE','ROMONA','MIMI','JACQUELIN','GAYE','TONJA','MISTI','JOE','GENE','CHASTITY','STACIA','ROXANN','MICAELA','NIKITA','MEI','VELDA','MARLYS','JOHNNA','AURA','LAVERN','IVONNE','HAYLEY','NICKI','MAJORIE','HERLINDA','GEORGE','ALPHA','YADIRA','PERLA','GREGORIA','DANIEL','ANTONETTE','SHELLI','MOZELLE','MARIAH','JOELLE','CORDELIA','JOSETTE','CHIQUITA','TRISTA','LOUIS','LAQUITA','GEORGIANA','CANDI','SHANON','LONNIE','HILDEGARD','CECIL','VALENTINA','STEPHANY','MAGDA','KAROL','GERRY','GABRIELLA','TIANA','ROMA','RICHELLE','RAY','PRINCESS','OLETA','JACQUE','IDELLA','ALAINA','SUZANNA','JOVITA','BLAIR','TOSHA','RAVEN','NEREIDA','MARLYN','KYLA','JOSEPH','DELFINA','TENA','STEPHENIE','SABINA','NATHALIE','MARCELLE','GERTIE','DARLEEN','THEA','SHARONDA','SHANTEL','BELEN','VENESSA','ROSALINA','ONA','GENOVEVA','COREY','CLEMENTINE','ROSALBA','RENATE','RENATA','MI','IVORY','GEORGIANNA','FLOY','DORCAS','ARIANA','TYRA','THEDA','MARIAM','JULI','JESICA','DONNIE','VIKKI','VERLA','ROSELYN','MELVINA','JANNETTE','GINNY','DEBRAH','CORRIE','ASIA','VIOLETA','MYRTIS','LATRICIA','COLLETTE','CHARLEEN','ANISSA','VIVIANA','TWYLA','PRECIOUS','NEDRA','LATONIA','LAN','HELLEN','FABIOLA','ANNAMARIE','ADELL','SHARYN','CHANTAL','NIKI','MAUD','LIZETTE','LINDY','KIA','KESHA','JEANA','DANELLE','CHARLINE','CHANEL','CARROL','VALORIE','LIA','DORTHA','CRISTAL','SUNNY','LEONE','LEILANI','GERRI','DEBI','ANDRA','KESHIA','IMA','EULALIA','EASTER','DULCE','NATIVIDAD','LINNIE','KAMI','GEORGIE','CATINA','BROOK','ALDA','WINNIFRED','SHARLA','RUTHANN','MEAGHAN','MAGDALENE','LISSETTE','ADELAIDA','VENITA','TRENA','SHIRLENE','SHAMEKA','ELIZEBETH','DIAN','SHANTA','MICKEY','LATOSHA','CARLOTTA','WINDY','SOON','ROSINA','MARIANN','LEISA','JONNIE','DAWNA','CATHIE','BILLY','ASTRID','SIDNEY','LAUREEN','JANEEN','HOLLI','FAWN','VICKEY','TERESSA','SHANTE','RUBYE','MARCELINA','CHANDA','CARY','TERESE','SCARLETT','MARTY','MARNIE','LULU','LISETTE','JENIFFER','ELENOR','DORINDA','DONITA','CARMAN','BERNITA','ALTAGRACIA','ALETA','ADRIANNA','ZORAIDA','RONNIE','NICOLA','LYNDSEY','KENDALL','JANINA','CHRISSY','AMI','STARLA','PHYLIS','PHUONG','KYRA','CHARISSE','BLANCH','SANJUANITA','RONA','NANCI','MARILEE','MARANDA','CORY','BRIGETTE','SANJUANA','MARITA','KASSANDRA','JOYCELYN','IRA','FELIPA','CHELSIE','BONNY','MIREYA','LORENZA','KYONG','ILEANA','CANDELARIA','TONY','TOBY','SHERIE','OK','MARK','LUCIE','LEATRICE','LAKESHIA','GERDA','EDIE','BAMBI','MARYLIN','LAVON','HORTENSE','GARNET','EVIE','TRESSA','SHAYNA','LAVINA','KYUNG','JEANETTA','SHERRILL','SHARA','PHYLISS','MITTIE','ANABEL','ALESIA','THUY','TAWANDA','RICHARD','JOANIE','TIFFANIE','LASHANDA','KARISSA','ENRIQUETA','DARIA','DANIELLA','CORINNA','ALANNA','ABBEY','ROXANE','ROSEANNA','MAGNOLIA','LIDA','KYLE','JOELLEN','ERA','CORAL','CARLEEN','TRESA','PEGGIE','NOVELLA','NILA','MAYBELLE','JENELLE','CARINA','NOVA','MELINA','MARQUERITE','MARGARETTE','JOSEPHINA','EVONNE','DEVIN','CINTHIA','ALBINA','TOYA','TAWNYA','SHERITA','SANTOS','MYRIAM','LIZABETH','LISE','KEELY','JENNI','GISELLE','CHERYLE','ARDITH','ARDIS','ALESHA','ADRIANE','SHAINA','LINNEA','KAROLYN','HONG','FLORIDA','FELISHA','DORI','DARCI','ARTIE','ARMIDA','ZOLA','XIOMARA','VERGIE','SHAMIKA','NENA','NANNETTE','MAXIE','LOVIE','JEANE','JAIMIE','INGE','FARRAH','ELAINA','CAITLYN','STARR','FELICITAS','CHERLY','CARYL','YOLONDA','YASMIN','TEENA','PRUDENCE','PENNIE','NYDIA','MACKENZIE','ORPHA','MARVEL','LIZBETH','LAURETTE','JERRIE','HERMELINDA','CAROLEE','TIERRA','MIRIAN','META','MELONY','KORI','JENNETTE','JAMILA','ENA','ANH','YOSHIKO','SUSANNAH','SALINA','RHIANNON','JOLEEN','CRISTINE','ASHTON','ARACELY','TOMEKA','SHALONDA','MARTI','LACIE','KALA','JADA','ILSE','HAILEY','BRITTANI','ZONA','SYBLE','SHERRYL','RANDY','NIDIA','MARLO','KANDICE','KANDI','DEB','DEAN','AMERICA','ALYCIA','TOMMY','RONNA','NORENE','MERCY','JOSE','INGEBORG','GIOVANNA','GEMMA','CHRISTEL','AUDRY','ZORA','VITA','VAN','TRISH','STEPHAINE','SHIRLEE','SHANIKA','MELONIE','MAZIE','JAZMIN','INGA','HOA','HETTIE','GERALYN','FONDA','ESTRELLA','ADELLA','SU','SARITA','RINA','MILISSA','MARIBETH','GOLDA','EVON','ETHELYN','ENEDINA','CHERISE','CHANA','VELVA','TAWANNA','SADE','MIRTA','LI','KARIE','JACINTA','ELNA','DAVINA','CIERRA','ASHLIE','ALBERTHA','TANESHA','STEPHANI','NELLE','MINDI','LU','LORINDA','LARUE','FLORENE','DEMETRA','DEDRA','CIARA','CHANTELLE','ASHLY','SUZY','ROSALVA','NOELIA','LYDA','LEATHA','KRYSTYNA','KRISTAN','KARRI','DARLINE','DARCIE','CINDA','CHEYENNE','CHERRIE','AWILDA','ALMEDA','ROLANDA','LANETTE','JERILYN','GISELE','EVALYN','CYNDI','CLETA','CARIN','ZINA','ZENA','VELIA','TANIKA','PAUL','CHARISSA','THOMAS','TALIA','MARGARETE','LAVONDA','KAYLEE','KATHLENE','JONNA','IRENA','ILONA','IDALIA','CANDIS','CANDANCE','BRANDEE','ANITRA','ALIDA','SIGRID','NICOLETTE','MARYJO','LINETTE','HEDWIG','CHRISTIANA','CASSIDY','ALEXIA','TRESSIE','MODESTA','LUPITA','LITA','GLADIS','EVELIA','DAVIDA','CHERRI','CECILY','ASHELY','ANNABEL','AGUSTINA','WANITA','SHIRLY','ROSAURA','HULDA','EUN','BAILEY','YETTA','VERONA','THOMASINA','SIBYL','SHANNAN','MECHELLE','LUE','LEANDRA','LANI','KYLEE','KANDY','JOLYNN','FERNE','EBONI','CORENE','ALYSIA','ZULA','NADA','MOIRA','LYNDSAY','LORRETTA','JUAN','JAMMIE','HORTENSIA','GAYNELL','CAMERON','ADRIA','VINA','VICENTA','TANGELA','STEPHINE','NORINE','NELLA','LIANA','LESLEE','KIMBERELY','ILIANA','GLORY','FELICA','EMOGENE','ELFRIEDE','EDEN','EARTHA','CARMA','BEA','OCIE','MARRY','LENNIE','KIARA','JACALYN','CARLOTA','ARIELLE','YU','STAR','OTILIA','KIRSTIN','KACEY','JOHNETTA','JOEY','JOETTA','JERALDINE','JAUNITA','ELANA','DORTHEA','CAMI','AMADA','ADELIA','VERNITA','TAMAR','SIOBHAN','RENEA','RASHIDA','OUIDA','ODELL','NILSA','MERYL','KRISTYN','JULIETA','DANICA','BREANNE','AUREA','ANGLEA','SHERRON','ODETTE','MALIA','LORELEI','LIN','LEESA','KENNA','KATHLYN','FIONA','CHARLETTE','SUZIE','SHANTELL','SABRA','RACQUEL','MYONG','MIRA','MARTINE','LUCIENNE','LAVADA','JULIANN','JOHNIE','ELVERA','DELPHIA','CLAIR','CHRISTIANE','CHAROLETTE','CARRI','AUGUSTINE','ASHA','ANGELLA','PAOLA','NINFA','LEDA','LAI','EDA','SUNSHINE','STEFANI','SHANELL','PALMA','MACHELLE','LISSA','KECIA','KATHRYNE','KARLENE','JULISSA','JETTIE','JENNIFFER','HUI','CORRINA','CHRISTOPHER','CAROLANN','ALENA','TESS','ROSARIA','MYRTICE','MARYLEE','LIANE','KENYATTA','JUDIE','JANEY','IN','ELMIRA','ELDORA','DENNA','CRISTI','CATHI','ZAIDA','VONNIE','VIVA','VERNIE','ROSALINE','MARIELA','LUCIANA','LESLI','KARAN','FELICE','DENEEN','ADINA','WYNONA','TARSHA','SHERON','SHASTA','SHANITA','SHANI','SHANDRA','RANDA','PINKIE','PARIS','NELIDA','MARILOU','LYLA','LAURENE','LACI','JOI','JANENE','DOROTHA','DANIELE','DANI','CAROLYNN','CARLYN','BERENICE','AYESHA','ANNELIESE','ALETHEA','THERSA','TAMIKO','RUFINA','OLIVA','MOZELL','MARYLYN','MADISON','KRISTIAN','KATHYRN','KASANDRA','KANDACE','JANAE','GABRIEL','DOMENICA','DEBBRA','DANNIELLE','CHUN','BUFFY','BARBIE','ARCELIA','AJA','ZENOBIA','SHAREN','SHAREE','PATRICK','PAGE','MY','LAVINIA','KUM','KACIE','JACKELINE','HUONG','FELISA','EMELIA','ELEANORA','CYTHIA','CRISTIN','CLYDE','CLARIBEL','CARON','ANASTACIA','ZULMA','ZANDRA','YOKO','TENISHA','SUSANN','SHERILYN','SHAY','SHAWANDA','SABINE','ROMANA','MATHILDA','LINSEY','KEIKO','JOANA','ISELA','GRETTA','GEORGETTA','EUGENIE','DUSTY','DESIRAE','DELORA','CORAZON','ANTONINA','ANIKA','WILLENE','TRACEE','TAMATHA','REGAN','NICHELLE','MICKIE','MAEGAN','LUANA','LANITA','KELSIE','EDELMIRA','BREE','AFTON','TEODORA','TAMIE','SHENA','MEG','LINH','KELI','KACI','DANYELLE','BRITT','ARLETTE','ALBERTINE','ADELLE','TIFFINY','STORMY','SIMONA','NUMBERS','NICOLASA','NICHOL','NIA','NAKISHA','MEE','MAIRA','LOREEN','KIZZY','JOHNNY','JAY','FALLON','CHRISTENE','BOBBYE','ANTHONY','YING','VINCENZA','TANJA','RUBIE','RONI','QUEENIE','MARGARETT','KIMBERLI','IRMGARD','IDELL','HILMA','EVELINA','ESTA','EMILEE','DENNISE','DANIA','CARL','CARIE','ANTONIO','WAI','SANG','RISA','RIKKI','PARTICIA','MUI','MASAKO','MARIO','LUVENIA','LOREE','LONI','LIEN','KEVIN','GIGI','FLORENCIA','DORIAN','DENITA','DALLAS','CHI','BILLYE','ALEXANDER','TOMIKA','SHARITA','RANA','NIKOLE','NEOMA','MARGARITE','MADALYN','LUCINA','LAILA','KALI','JENETTE','GABRIELE','EVELYNE','ELENORA','CLEMENTINA','ALEJANDRINA','ZULEMA','VIOLETTE','VANNESSA','THRESA','RETTA','PIA','PATIENCE','NOELLA','NICKIE','JONELL','DELTA','CHUNG','CHAYA','CAMELIA','BETHEL','ANYA','ANDREW','THANH','SUZANN','SPRING','SHU','MILA','LILLA','LAVERNA','KEESHA','KATTIE','GIA','GEORGENE','EVELINE','ESTELL','ELIZBETH','VIVIENNE','VALLIE','TRUDIE','STEPHANE','MICHEL','MAGALY','MADIE','KENYETTA','KARREN','JANETTA','HERMINE','HARMONY','DRUCILLA','DEBBI','CELESTINA','CANDIE','BRITNI','BECKIE','AMINA','ZITA','YUN','YOLANDE','VIVIEN','VERNETTA','TRUDI','SOMMER','PEARLE','PATRINA','OSSIE','NICOLLE','LOYCE','LETTY','LARISA','KATHARINA','JOSELYN','JONELLE','JENELL','IESHA','HEIDE','FLORINDA','FLORENTINA','FLO','ELODIA','DORINE','BRUNILDA','BRIGID','ASHLI','ARDELLA','TWANA','THU','TARAH','SUNG','SHEA','SHAVON','SHANE','SERINA','RAYNA','RAMONITA','NGA','MARGURITE','LUCRECIA','KOURTNEY','KATI','JESUS','JESENIA','DIAMOND','CRISTA','AYANA','ALICA','ALIA','VINNIE','SUELLEN','ROMELIA','RACHELL','PIPER','OLYMPIA','MICHIKO','KATHALEEN','JOLIE','JESSI','JANESSA','HANA','HA','ELEASE','CARLETTA','BRITANY','SHONA','SALOME','ROSAMOND','REGENA','RAINA','NGOC','NELIA','LOUVENIA','LESIA','LATRINA','LATICIA','LARHONDA','JINA','JACKI','HOLLIS','HOLLEY','EMMY','DEEANN','CORETTA','ARNETTA','VELVET','THALIA','SHANICE','NETA','MIKKI','MICKI','LONNA','LEANA','LASHUNDA','KILEY','JOYE','JACQULYN','IGNACIA','HYUN','HIROKO','HENRY','HENRIETTE','ELAYNE','DELINDA','DARNELL','DAHLIA','COREEN','CONSUELA','CONCHITA','CELINE','BABETTE','AYANNA','ANETTE','ALBERTINA','SKYE','SHAWNEE','SHANEKA','QUIANA','PAMELIA','MIN','MERRI','MERLENE','MARGIT','KIESHA','KIERA','KAYLENE','JODEE','JENISE','ERLENE','EMMIE','ELSE','DARYL','DALILA','DAISEY','CODY','CASIE','BELIA','BABARA','VERSIE','VANESA','SHELBA','SHAWNDA','SAM','NORMAN','NIKIA','NAOMA','MARNA','MARGERET','MADALINE','LAWANA','KINDRA','JUTTA','JAZMINE','JANETT','HANNELORE','GLENDORA','GERTRUD','GARNETT','FREEDA','FREDERICA','FLORANCE','FLAVIA','DENNIS','CARLINE','BEVERLEE','ANJANETTE','VALDA','TRINITY','TAMALA','STEVIE','SHONNA','SHA','SARINA','ONEIDA','MICAH','MERILYN','MARLEEN','LURLINE','LENNA','KATHERIN','JIN','JENI','HAE','GRACIA','GLADY','FARAH','ERIC','ENOLA','EMA','DOMINQUE','DEVONA','DELANA','CECILA','CAPRICE','ALYSHA','ALI','ALETHIA','VENA','THERESIA','TAWNY','SONG','SHAKIRA','SAMARA','SACHIKO','RACHELE','PAMELLA','NICKY','MARNI','MARIEL','MAREN','MALISA','LIGIA','LERA','LATORIA','LARAE','KIMBER','KATHERN','KAREY','JENNEFER','JANETH','HALINA','FREDIA','DELISA','DEBROAH','CIERA','CHIN','ANGELIKA','ANDREE','ALTHA','YEN','VIVAN','TERRESA','TANNA','SUK','SUDIE','SOO','SIGNE','SALENA','RONNI','REBBECCA','MYRTIE','MCKENZIE','MALIKA','MAIDA','LOAN','LEONARDA','KAYLEIGH','FRANCE','ETHYL','ELLYN','DAYLE','CAMMIE','BRITTNI','BIRGIT','AVELINA','ASUNCION','ARIANNA','AKIKO','VENICE','TYESHA','TONIE','TIESHA','TAKISHA','STEFFANIE','SINDY','SANTANA','MEGHANN','MANDA','MACIE','LADY','KELLYE','KELLEE','JOSLYN','JASON','INGER','INDIRA','GLINDA','GLENNIS','FERNANDA','FAUSTINA','ENEIDA','ELICIA','DOT','DIGNA','DELL','ARLETTA','ANDRE','WILLIA','TAMMARA','TABETHA','SHERRELL','SARI','REFUGIO','REBBECA','PAULETTA','NIEVES','NATOSHA','NAKITA','MAMMIE','KENISHA','KAZUKO','KASSIE','GARY','EARLEAN','DAPHINE','CORLISS','CLOTILDE','CAROLYNE','BERNETTA','AUGUSTINA','AUDREA','ANNIS','ANNABELL','YAN','TENNILLE','TAMICA','SELENE','SEAN','ROSANA','REGENIA','QIANA','MARKITA','MACY','LEEANNE','LAURINE','KYM','JESSENIA','JANITA','GEORGINE','GENIE','EMIKO','ELVIE','DEANDRA','DAGMAR','CORIE','COLLEN','CHERISH','ROMAINE','PORSHA','PEARLENE','MICHELINE','MERNA','MARGORIE','MARGARETTA','LORE','KENNETH','JENINE','HERMINA','FREDERICKA','ELKE','DRUSILLA','DORATHY','DIONE','DESIRE','CELENA','BRIGIDA','ANGELES','ALLEGRA','THEO','TAMEKIA','SYNTHIA','STEPHEN','SOOK','SLYVIA','ROSANN','REATHA','RAYE','MARQUETTA','MARGART','LING','LAYLA','KYMBERLY','KIANA','KAYLEEN','KATLYN','KARMEN','JOELLA','IRINA','EMELDA','ELENI','DETRA','CLEMMIE','CHERYLL','CHANTELL','CATHEY','ARNITA','ARLA','ANGLE','ANGELIC','ALYSE','ZOFIA','THOMASINE','TENNIE','SON','SHERLY','SHERLEY','SHARYL','REMEDIOS','PETRINA','NICKOLE','MYUNG','MYRLE','MOZELLA','LOUANNE','LISHA','LATIA','LANE','KRYSTA','JULIENNE','JOEL','JEANENE','JACQUALINE','ISAURA','GWENDA','EARLEEN','DONALD','CLEOPATRA','CARLIE','AUDIE','ANTONIETTA','ALISE','ALEX','VERDELL','VAL','TYLER','TOMOKO','THAO','TALISHA','STEVEN','SO','SHEMIKA','SHAUN','SCARLET','SAVANNA','SANTINA','ROSIA','RAEANN','ODILIA','NANA','MINNA','MAGAN','LYNELLE','LE','KARMA','JOEANN','IVANA','INELL','ILANA','HYE','HONEY','HEE','GUDRUN','FRANK','DREAMA','CRISSY','CHANTE','CARMELINA','ARVILLA','ARTHUR','ANNAMAE','ALVERA','ALEIDA','AARON','YEE','YANIRA','VANDA','TIANNA','TAM','STEFANIA','SHIRA','PERRY','NICOL','NANCIE','MONSERRATE','MINH','MELYNDA','MELANY','MATTHEW','LOVELLA','LAURE','KIRBY','KACY','JACQUELYNN','HYON','GERTHA','FRANCISCO','ELIANA','CHRISTENA','CHRISTEEN','CHARISE','CATERINA','CARLEY','CANDYCE','ARLENA','AMMIE','YANG','WILLETTE','VANITA','TUYET','TINY','SYREETA','SILVA','SCOTT','RONALD','PENNEY','NYLA','MICHAL','MAURICE','MARYAM','MARYA','MAGEN','LUDIE','LOMA','LIVIA','LANELL','KIMBERLIE','JULEE','DONETTA','DIEDRA','DENISHA','DEANE','DAWNE','CLARINE','CHERRYL','BRONWYN','BRANDON','ALLA','VALERY','TONDA','SUEANN','SORAYA','SHOSHANA','SHELA','SHARLEEN','SHANELLE','NERISSA','MICHEAL','MERIDITH','MELLIE','MAYE','MAPLE','MAGARET','LUIS','LILI','LEONILA','LEONIE','LEEANNA','LAVONIA','LAVERA','KRISTEL','KATHEY','KATHE','JUSTIN','JULIAN','JIMMY','JANN','ILDA','HILDRED','HILDEGARDE','GENIA','FUMIKO','EVELIN','ERMELINDA','ELLY','DUNG','DOLORIS','DIONNA','DANAE','BERNEICE','ANNICE','ALIX','VERENA','VERDIE','TRISTAN','SHAWNNA','SHAWANA','SHAUNNA','ROZELLA','RANDEE','RANAE','MILAGRO','LYNELL','LUISE','LOUIE','LOIDA','LISBETH','KARLEEN','JUNITA','JONA','ISIS','HYACINTH','HEDY','GWENN','ETHELENE','ERLINE','EDWARD','DONYA','DOMONIQUE','DELICIA','DANNETTE','CICELY','BRANDA','BLYTHE','BETHANN','ASHLYN','ANNALEE','ALLINE','YUKO','VELLA','TRANG','TOWANDA','TESHA','SHERLYN','NARCISA','MIGUELINA','MERI','MAYBELL','MARLANA','MARGUERITA','MADLYN','LUNA','LORY','LORIANN','LIBERTY','LEONORE','LEIGHANN','LAURICE','LATESHA','LARONDA','KATRICE','KASIE','KARL','KALEY','JADWIGA','GLENNIE','GEARLDINE','FRANCINA','EPIFANIA','DYAN','DORIE','DIEDRE','DENESE','DEMETRICE','DELENA','DARBY','CRISTIE','CLEORA','CATARINA','CARISA','BERNIE','BARBERA','ALMETA','TRULA','TEREASA','SOLANGE','SHEILAH','SHAVONNE','SANORA','ROCHELL','MATHILDE','MARGARETA','MAIA','LYNSEY','LAWANNA','LAUNA','KENA','KEENA','KATIA','JAMEY','GLYNDA','GAYLENE','ELVINA','ELANOR','DANUTA','DANIKA','CRISTEN','CORDIE','COLETTA','CLARITA','CARMON','BRYNN','AZUCENA','AUNDREA','ANGELE','YI','WALTER','VERLIE','VERLENE','TAMESHA','SILVANA','SEBRINA','SAMIRA','REDA','RAYLENE','PENNI','PANDORA','NORAH','NOMA','MIREILLE','MELISSIA','MARYALICE','LARAINE','KIMBERY','KARYL','KARINE','KAM','JOLANDA','JOHANA','JESUSA','JALEESA','JAE','JACQUELYNE','IRISH','ILUMINADA','HILARIA','HANH','GENNIE','FRANCIE','FLORETTA','EXIE','EDDA','DREMA','DELPHA','BEV','BARBAR','ASSUNTA','ARDELL','ANNALISA','ALISIA','YUKIKO','YOLANDO','WONDA','WEI','WALTRAUD','VETA','TEQUILA','TEMEKA','TAMEIKA','SHIRLEEN','SHENITA','PIEDAD','OZELLA','MIRTHA','MARILU','KIMIKO','JULIANE','JENICE','JEN','JANAY','JACQUILINE','HILDE','FE','FAE','EVAN','EUGENE','ELOIS','ECHO','DEVORAH','CHAU','BRINDA','BETSEY','ARMINDA','ARACELIS','APRYL','ANNETT','ALISHIA','VEOLA','USHA','TOSHIKO','THEOLA','TASHIA','TALITHA','SHERY','RUDY','RENETTA','REIKO','RASHEEDA','OMEGA','OBDULIA','MIKA','MELAINE','MEGGAN','MARTIN','MARLEN','MARGET','MARCELINE','MANA','MAGDALEN','LIBRADA','LEZLIE','LEXIE','LATASHIA','LASANDRA','KELLE','ISIDRA','ISA','INOCENCIA','GWYN','FRANCOISE','ERMINIA','ERINN','DIMPLE','DEVORA','CRISELDA','ARMANDA','ARIE','ARIANE','ANGELO','ANGELENA','ALLEN','ALIZA','ADRIENE','ADALINE','XOCHITL','TWANNA','TRAN','TOMIKO','TAMISHA','TAISHA','SUSY','SIU','RUTHA','ROXY','RHONA','RAYMOND','OTHA','NORIKO','NATASHIA','MERRIE','MELVIN','MARINDA','MARIKO','MARGERT','LORIS','LIZZETTE','LEISHA','KAILA','KA','JOANNIE','JERRICA','JENE','JANNET','JANEE','JACINDA','HERTA','ELENORE','DORETTA','DELAINE','DANIELL','CLAUDIE','CHINA','BRITTA','APOLONIA','AMBERLY','ALEASE','YURI','YUK','WEN','WANETA','UTE','TOMI','SHARRI','SANDIE','ROSELLE','REYNALDA','RAGUEL','PHYLICIA','PATRIA','OLIMPIA','ODELIA','MITZIE','MITCHELL','MISS','MINDA','MIGNON','MICA','MENDY','MARIVEL','MAILE','LYNETTA','LAVETTE','LAURYN','LATRISHA','LAKIESHA','KIERSTEN','KARY','JOSPHINE','JOLYN','JETTA','JANISE','JACQUIE','IVELISSE','GLYNIS','GIANNA','GAYNELLE','EMERALD','DEMETRIUS','DANYELL','DANILLE','DACIA','CORALEE','CHER','CEOLA','BRETT','BELL','ARIANNE','ALESHIA','YUNG','WILLIEMAE','TROY','TRINH','THORA','TAI','SVETLANA','SHERIKA','SHEMEKA','SHAUNDA','ROSELINE','RICKI','MELDA','MALLIE','LAVONNA','LATINA','LARRY','LAQUANDA','LALA','LACHELLE','KLARA','KANDIS','JOHNA','JEANMARIE','JAYE','HANG','GRAYCE','GERTUDE','EMERITA','EBONIE','CLORINDA','CHING','CHERY','CAROLA','BREANN','BLOSSOM','BERNARDINE','BECKI','ARLETHA','ARGELIA','ARA','ALITA','YULANDA','YON','YESSENIA','TOBI','TASIA','SYLVIE','SHIRL','SHIRELY','SHERIDAN','SHELLA','SHANTELLE','SACHA','ROYCE','REBECKA','REAGAN','PROVIDENCIA','PAULENE','MISHA','MIKI','MARLINE','MARICA','LORITA','LATOYIA','LASONYA','KERSTIN','KENDA','KEITHA','KATHRIN','JAYMIE','JACK','GRICELDA','GINETTE','ERYN','ELINA','ELFRIEDA','DANYEL','CHEREE','CHANELLE','BARRIE','AVERY','AURORE','ANNAMARIA','ALLEEN','AILENE','AIDE','YASMINE','VASHTI','VALENTINE','TREASA','TORY','TIFFANEY','SHERYLL','SHARIE','SHANAE','SAU','RAISA','PA','NEDA','MITSUKO','MIRELLA','MILDA','MARYANNA','MARAGRET','MABELLE','LUETTA','LORINA','LETISHA','LATARSHA','LANELLE','LAJUANA','KRISSY','KARLY','KARENA','JON','JESSIKA','JERICA','JEANELLE','JANUARY','JALISA','JACELYN','IZOLA','IVEY','GREGORY','EUNA','ETHA','DREW','DOMITILA','DOMINICA','DAINA','CREOLA','CARLI','CAMIE','BUNNY','BRITTNY','ASHANTI','ANISHA','ALEEN','ADAH','YASUKO','WINTER','VIKI','VALRIE','TONA','TINISHA','THI','TERISA','TATUM','TANEKA','SIMONNE','SHALANDA','SERITA','RESSIE','REFUGIA','PAZ','OLENE','NA','MERRILL','MARGHERITA','MANDIE','MAN','MAIRE','LYNDIA','LUCI','LORRIANE','LORETA','LEONIA','LAVONA','LASHAWNDA','LAKIA','KYOKO','KRYSTINA','KRYSTEN','KENIA','KELSI','JUDE','JEANICE','ISOBEL','GEORGIANN','GENNY','FELICIDAD','EILENE','DEON','DELOISE','DEEDEE','DANNIE','CONCEPTION','CLORA','CHERILYN','CHANG','CALANDRA','BERRY','ARMANDINA','ANISA','ULA','TIMOTHY','TIERA','THERESSA','STEPHANIA','SIMA','SHYLA','SHONTA','SHERA','SHAQUITA','SHALA','SAMMY','ROSSANA','NOHEMI','NERY','MORIAH','MELITA','MELIDA','MELANI','MARYLYNN','MARISHA','MARIETTE','MALORIE','MADELENE','LUDIVINA','LORIA','LORETTE','LORALEE','LIANNE','LEON','LAVENIA','LAURINDA','LASHON','KIT','KIMI','KEILA','KATELYNN','KAI','JONE','JOANE','JI','JAYNA','JANELLA','JA','HUE','HERTHA','FRANCENE','ELINORE','DESPINA','DELSIE','DEEDRA','CLEMENCIA','CARRY','CAROLIN','CARLOS','BULAH','BRITTANIE','BOK','BLONDELL','BIBI','BEAULAH','BEATA','ANNITA','AGRIPINA','VIRGEN','VALENE','UN','TWANDA','TOMMYE','TOI','TARRA','TARI','TAMMERA','SHAKIA','SADYE','RUTHANNE','ROCHEL','RIVKA','PURA','NENITA','NATISHA','MING','MERRILEE','MELODEE','MARVIS','LUCILLA','LEENA','LAVETA','LARITA','LANIE','KEREN','ILEEN','GEORGEANN','GENNA','GENESIS','FRIDA','EWA','EUFEMIA','EMELY','ELA','EDYTH','DEONNA','DEADRA','DARLENA','CHANELL','CHAN','CATHERN','CASSONDRA','CASSAUNDRA','BERNARDA','BERNA','ARLINDA','ANAMARIA','ALBERT','WESLEY','VERTIE','VALERI','TORRI','TATYANA','STASIA','SHERISE','SHERILL','SEASON','SCOTTIE','SANDA','RUTHE','ROSY','ROBERTO','ROBBI','RANEE','QUYEN','PEARLY','PALMIRA','ONITA','NISHA','NIESHA','NIDA','NEVADA','NAM','MERLYN','MAYOLA','MARYLOUISE','MARYLAND','MARX','MARTH','MARGENE','MADELAINE','LONDA','LEONTINE','LEOMA','LEIA','LAWRENCE','LAURALEE','LANORA','LAKITA','KIYOKO','KETURAH','KATELIN','KAREEN','JONIE','JOHNETTE','JENEE','JEANETT','IZETTA','HIEDI','HEIKE','HASSIE','HAROLD','GIUSEPPINA','GEORGANN','FIDELA','FERNANDE','ELWANDA','ELLAMAE','ELIZ','DUSTI','DOTTY','CYNDY','CORALIE','CELESTA','ARGENTINA','ALVERTA','XENIA','WAVA','VANETTA','TORRIE','TASHINA','TANDY','TAMBRA','TAMA','STEPANIE','SHILA','SHAUNTA','SHARAN','SHANIQUA','SHAE','SETSUKO','SERAFINA','SANDEE','ROSAMARIA','PRISCILA','OLINDA','NADENE','MUOI','MICHELINA','MERCEDEZ','MARYROSE','MARIN','MARCENE','MAO','MAGALI','MAFALDA','LOGAN','LINN','LANNIE','KAYCE','KAROLINE','KAMILAH','KAMALA','JUSTA','JOLINE','JENNINE','JACQUETTA','IRAIDA','GERALD','GEORGEANNA','FRANCHESCA','FAIRY','EMELINE','ELANE','EHTEL','EARLIE','DULCIE','DALENE','CRIS','CLASSIE','CHERE','CHARIS','CAROYLN','CARMINA','CARITA','BRIAN','BETHANIE','AYAKO','ARICA','AN','ALYSA','ALESSANDRA','AKILAH','ADRIEN','ZETTA','YOULANDA','YELENA','YAHAIRA','XUAN','WENDOLYN','VICTOR','TIJUANA','TERRELL','TERINA','TERESIA','SUZI','SUNDAY','SHERELL','SHAVONDA','SHAUNTE','SHARDA','SHAKITA','SENA','RYANN','RUBI','RIVA','REGINIA','REA','RACHAL','PARTHENIA','PAMULA','MONNIE','MONET','MICHAELE','MELIA','MARINE','MALKA','MAISHA','LISANDRA','LEO','LEKISHA','LEAN','LAURENCE','LAKENDRA','KRYSTIN','KORTNEY','KIZZIE','KITTIE','KERA','KENDAL','KEMBERLY','KANISHA','JULENE','JULE','JOSHUA','JOHANNE','JEFFREY','JAMEE','HAN','HALLEY','GIDGET','GALINA','FREDRICKA','FLETA','FATIMAH','EUSEBIA','ELZA','ELEONORE','DORTHEY','DORIA','DONELLA','DINORAH','DELORSE','CLARETHA','CHRISTINIA','CHARLYN','BONG','BELKIS','AZZIE','ANDERA','AIKO','ADENA','YER','YAJAIRA','WAN','VANIA','ULRIKE','TOSHIA','TIFANY','STEFANY','SHIZUE','SHENIKA','SHAWANNA','SHAROLYN','SHARILYN','SHAQUANA','SHANTAY','SEE','ROZANNE','ROSELEE','RICKIE','REMONA','REANNA','RAELENE','QUINN','PHUNG','PETRONILA','NATACHA','NANCEY','MYRL','MIYOKO','MIESHA','MERIDETH','MARVELLA','MARQUITTA','MARHTA','MARCHELLE','LIZETH','LIBBIE','LAHOMA','LADAWN','KINA','KATHELEEN','KATHARYN','KARISA','KALEIGH','JUNIE','JULIEANN','JOHNSIE','JANEAN','JAIMEE','JACKQUELINE','HISAKO','HERMA','HELAINE','GWYNETH','GLENN','GITA','EUSTOLIA','EMELINA','ELIN','EDRIS','DONNETTE','DONNETTA','DIERDRE','DENAE','DARCEL','CLAUDE','CLARISA','CINDERELLA','CHIA','CHARLESETTA','CHARITA','CELSA','CASSY','CASSI','CARLEE','BRUNA','BRITTANEY','BRANDE','BILLI','BAO','ANTONETTA','ANGLA','ANGELYN','ANALISA','ALANE','WENONA','WENDIE','VERONIQUE','VANNESA','TOBIE','TEMPIE','SUMIKO','SULEMA','SPARKLE','SOMER','SHEBA','SHAYNE','SHARICE','SHANEL','SHALON','SAGE','ROY','ROSIO','ROSELIA','RENAY','REMA','REENA','PORSCHE','PING','PEG','OZIE','ORETHA','ORALEE','ODA','NU','NGAN','NAKESHA','MILLY','MARYBELLE','MARLIN','MARIS','MARGRETT','MARAGARET','MANIE','LURLENE','LILLIA','LIESELOTTE','LAVELLE','LASHAUNDA','LAKEESHA','KEITH','KAYCEE','KALYN','JOYA','JOETTE','JENAE','JANIECE','ILLA','GRISEL','GLAYDS','GENEVIE','GALA','FREDDA','FRED','ELMER','ELEONOR','DEBERA','DEANDREA','DAN','CORRINNE','CORDIA','CONTESSA','COLENE','CLEOTILDE','CHARLOTT','CHANTAY','CECILLE','BEATRIS','AZALEE','ARLEAN','ARDATH','ANJELICA','ANJA','ALFREDIA','ALEISHA','ADAM','ZADA','YUONNE','XIAO','WILLODEAN','WHITLEY','VENNIE','VANNA','TYISHA','TOVA','TORIE','TONISHA','TILDA','TIEN','TEMPLE','SIRENA','SHERRIL','SHANTI','SHAN','SENAIDA','SAMELLA','ROBBYN','RENDA','REITA','PHEBE','PAULITA','NOBUKO','NGUYET','NEOMI','MOON','MIKAELA','MELANIA','MAXIMINA','MARG','MAISIE','LYNNA','LILLI','LAYNE','LASHAUN','LAKENYA','LAEL','KIRSTIE','KATHLINE','KASHA','KARLYN','KARIMA','JOVAN','JOSEFINE','JENNELL','JACQUI','JACKELYN','HYO','HIEN','GRAZYNA','FLORRIE','FLORIA','ELEONORA','DWANA','DORLA','DONG','DELMY','DEJA','DEDE','DANN','CRYSTA','CLELIA','CLARIS','CLARENCE','CHIEKO','CHERLYN','CHERELLE','CHARMAIN','CHARA','CAMMY','BEE','ARNETTE','ARDELLE','ANNIKA','AMIEE','AMEE','ALLENA','YVONE','YUKI','YOSHIE','YEVETTE','YAEL','WILLETTA','VONCILE','VENETTA','TULA','TONETTE','TIMIKA','TEMIKA','TELMA','TEISHA','TAREN','TA','STACEE','SHIN','SHAWNTA','SATURNINA','RICARDA','POK','PASTY','ONIE','NUBIA','MORA','MIKE','MARIELLE','MARIELLA','MARIANELA','MARDELL','MANY','LUANNA','LOISE','LISABETH','LINDSY','LILLIANA','LILLIAM','LELAH','LEIGHA','LEANORA','LANG','KRISTEEN','KHALILAH','KEELEY','KANDRA','JUNKO','JOAQUINA','JERLENE','JANI','JAMIKA','JAME','HSIU','HERMILA','GOLDEN','GENEVIVE','EVIA','EUGENA','EMMALINE','ELFREDA','ELENE','DONETTE','DELCIE','DEEANNA','DARCEY','CUC','CLARINDA','CIRA','CHAE','CELINDA','CATHERYN','CATHERIN','CASIMIRA','CARMELIA','CAMELLIA','BREANA','BOBETTE','BERNARDINA','BEBE','BASILIA','ARLYNE','AMAL','ALAYNA','ZONIA','ZENIA','YURIKO','YAEKO','WYNELL','WILLOW','WILLENA','VERNIA','TU','TRAVIS','TORA','TERRILYN','TERICA','TENESHA','TAWNA','TAJUANA','TAINA','STEPHNIE','SONA','SOL','SINA','SHONDRA','SHIZUKO','SHERLENE','SHERICE','SHARIKA','ROSSIE','ROSENA','RORY','RIMA','RIA','RHEBA','RENNA','PETER','NATALYA','NANCEE','MELODI','MEDA','MAXIMA','MATHA','MARKETTA','MARICRUZ','MARCELENE','MALVINA','LUBA','LOUETTA','LEIDA','LECIA','LAURAN','LASHAWNA','LAINE','KHADIJAH','KATERINE','KASI','KALLIE','JULIETTA','JESUSITA','JESTINE','JESSIA','JEREMY','JEFFIE','JANYCE','ISADORA','GEORGIANNE','FIDELIA','EVITA','EURA','EULAH','ESTEFANA','ELSY','ELIZABET','ELADIA','DODIE','DION','DIA','DENISSE','DELORAS','DELILA','DAYSI','DAKOTA','CURTIS','CRYSTLE','CONCHA','COLBY','CLARETTA','CHU','CHRISTIA','CHARLSIE','CHARLENA','CARYLON','BETTYANN','ASLEY','ASHLEA','AMIRA','AI','AGUEDA','AGNUS','YUETTE','VINITA','VICTORINA','TYNISHA','TREENA','TOCCARA','TISH','THOMASENA','TEGAN','SOILA','SHILOH','SHENNA','SHARMAINE','SHANTAE','SHANDI','SEPTEMBER','SARAN','SARAI','SANA','SAMUEL','SALLEY','ROSETTE','ROLANDE','REGINE','OTELIA','OSCAR','OLEVIA','NICHOLLE','NECOLE','NAIDA','MYRTA','MYESHA','MITSUE','MINTA','MERTIE','MARGY','MAHALIA','MADALENE','LOVE','LOURA','LOREAN','LEWIS','LESHA','LEONIDA','LENITA','LAVONE','LASHELL','LASHANDRA','LAMONICA','KIMBRA','KATHERINA','KARRY','KANESHA','JULIO','JONG','JENEVA','JAQUELYN','HWA','GILMA','GHISLAINE','GERTRUDIS','FRANSISCA','FERMINA','ETTIE','ETSUKO','ELLIS','ELLAN','ELIDIA','EDRA','DORETHEA','DOREATHA','DENYSE','DENNY','DEETTA','DAINE','CYRSTAL','CORRIN','CAYLA','CARLITA','CAMILA','BURMA','BULA','BUENA','BLAKE','BARABARA','AVRIL','AUSTIN','ALAINE','ZANA','WILHEMINA','WANETTA','VIRGIL','VI','VERONIKA','VERNON','VERLINE','VASILIKI','TONITA','TISA','TEOFILA','TAYNA','TAUNYA','TANDRA','TAKAKO','SUNNI','SUANNE','SIXTA','SHARELL','SEEMA','RUSSELL','ROSENDA','ROBENA','RAYMONDE','PEI','PAMILA','OZELL','NEIDA','NEELY','MISTIE','MICHA','MERISSA','MAURITA','MARYLN','MARYETTA','MARSHALL','MARCELL','MALENA','MAKEDA','MADDIE','LOVETTA','LOURIE','LORRINE','LORILEE','LESTER','LAURENA','LASHAY','LARRAINE','LAREE','LACRESHA','KRISTLE','KRISHNA','KEVA','KEIRA','KAROLE','JOIE','JINNY','JEANNETTA','JAMA','HEIDY','GILBERTE','GEMA','FAVIOLA','EVELYNN','ENDA','ELLI','ELLENA','DIVINA','DAGNY','COLLENE','CODI','CINDIE','CHASSIDY','CHASIDY','CATRICE','CATHERINA','CASSEY','CAROLL','CARLENA','CANDRA','CALISTA','BRYANNA','BRITTENY','BEULA','BARI','AUDRIE','AUDRIA','ARDELIA','ANNELLE','ANGILA','ALONA','ALLYN','DOUGLAS','ROGER','JONATHAN','RALPH','NICHOLAS','BENJAMIN','BRUCE','HARRY','WAYNE','STEVE','HOWARD','ERNEST','PHILLIP','TODD','CRAIG','ALAN','PHILIP','EARL','DANNY','BRYAN','STANLEY','LEONARD','NATHAN','MANUEL','RODNEY','MARVIN','VINCENT','JEFFERY','JEFF','CHAD','JACOB','ALFRED','BRADLEY','HERBERT','FREDERICK','EDWIN','DON','RICKY','RANDALL','BARRY','BERNARD','LEROY','MARCUS','THEODORE','CLIFFORD','MIGUEL','JIM','TOM','CALVIN','BILL','LLOYD','DEREK','WARREN','DARRELL','JEROME','FLOYD','ALVIN','TIM','GORDON','GREG','JORGE','DUSTIN','PEDRO','DERRICK','ZACHARY','HERMAN','GLEN','HECTOR','RICARDO','RICK','BRENT','RAMON','GILBERT','MARC','REGINALD','RUBEN','NATHANIEL','RAFAEL','EDGAR','MILTON','RAUL','BEN','CHESTER','DUANE','FRANKLIN','BRAD','RON','ROLAND','ARNOLD','HARVEY','JARED','ERIK','DARRYL','NEIL','JAVIER','FERNANDO','CLINTON','TED','MATHEW','TYRONE','DARREN','LANCE','KURT','ALLAN','NELSON','GUY','CLAYTON','HUGH','MAX','DWAYNE','DWIGHT','ARMANDO','FELIX','EVERETT','IAN','WALLACE','KEN','BOB','ALFREDO','ALBERTO','DAVE','IVAN','BYRON','ISAAC','MORRIS','CLIFTON','WILLARD','ROSS','ANDY','SALVADOR','KIRK','SERGIO','SETH','KENT','TERRANCE','EDUARDO','TERRENCE','ENRIQUE','WADE','STUART','FREDRICK','ARTURO','ALEJANDRO','NICK','LUTHER','WENDELL','JEREMIAH','JULIUS','OTIS','TREVOR','OLIVER','LUKE','HOMER','GERARD','DOUG','KENNY','HUBERT','LYLE','MATT','ALFONSO','ORLANDO','REX','CARLTON','ERNESTO','NEAL','PABLO','LORENZO','OMAR','WILBUR','GRANT','HORACE','RODERICK','ABRAHAM','WILLIS','RICKEY','ANDRES','CESAR','JOHNATHAN','MALCOLM','RUDOLPH','DAMON','KELVIN','PRESTON','ALTON','ARCHIE','MARCO','WM','PETE','RANDOLPH','GARRY','GEOFFREY','JONATHON','FELIPE','GERARDO','ED','DOMINIC','DELBERT','COLIN','GUILLERMO','EARNEST','LUCAS','BENNY','SPENCER','RODOLFO','MYRON','EDMUND','GARRETT','SALVATORE','CEDRIC','LOWELL','GREGG','SHERMAN','WILSON','SYLVESTER','ROOSEVELT','ISRAEL','JERMAINE','FORREST','WILBERT','LELAND','SIMON','CLARK','IRVING','BRYANT','OWEN','RUFUS','WOODROW','KRISTOPHER','MACK','LEVI','MARCOS','GUSTAVO','JAKE','LIONEL','GILBERTO','CLINT','NICOLAS','ISMAEL','ORVILLE','ERVIN','DEWEY','AL','WILFRED','JOSH','HUGO','IGNACIO','CALEB','TOMAS','SHELDON','ERICK','STEWART','DOYLE','DARREL','ROGELIO','TERENCE','SANTIAGO','ALONZO','ELIAS','BERT','ELBERT','RAMIRO','CONRAD','NOAH','GRADY','PHIL','CORNELIUS','LAMAR','ROLANDO','CLAY','PERCY','DEXTER','BRADFORD','DARIN','AMOS','MOSES','IRVIN','SAUL','ROMAN','RANDAL','TIMMY','DARRIN','WINSTON','BRENDAN','ABEL','DOMINICK','BOYD','EMILIO','ELIJAH','DOMINGO','EMMETT','MARLON','EMANUEL','JERALD','EDMOND','EMIL','DEWAYNE','WILL','OTTO','TEDDY','REYNALDO','BRET','JESS','TRENT','HUMBERTO','EMMANUEL','STEPHAN','VICENTE','LAMONT','GARLAND','MILES','EFRAIN','HEATH','RODGER','HARLEY','ETHAN','ELDON','ROCKY','PIERRE','JUNIOR','FREDDY','ELI','BRYCE','ANTOINE','STERLING','CHASE','GROVER','ELTON','CLEVELAND','DYLAN','CHUCK','DAMIAN','REUBEN','STAN','AUGUST','LEONARDO','JASPER','RUSSEL','ERWIN','BENITO','HANS','MONTE','BLAINE','ERNIE','CURT','QUENTIN','AGUSTIN','MURRAY','JAMAL','ADOLFO','HARRISON','TYSON','BURTON','BRADY','ELLIOTT','WILFREDO','BART','JARROD','VANCE','DENIS','DAMIEN','JOAQUIN','HARLAN','DESMOND','ELLIOT','DARWIN','GREGORIO','BUDDY','XAVIER','KERMIT','ROSCOE','ESTEBAN','ANTON','SOLOMON','SCOTTY','NORBERT','ELVIN','WILLIAMS','NOLAN','ROD','QUINTON','HAL','BRAIN','ROB','ELWOOD','KENDRICK','DARIUS','MOISES','FIDEL','THADDEUS','CLIFF','MARCEL','JACKSON','RAPHAEL','BRYON','ARMAND','ALVARO','JEFFRY','DANE','JOESPH','THURMAN','NED','RUSTY','MONTY','FABIAN','REGGIE','MASON','GRAHAM','ISAIAH','VAUGHN','GUS','LOYD','DIEGO','ADOLPH','NORRIS','MILLARD','ROCCO','GONZALO','DERICK','RODRIGO','WILEY','RIGOBERTO','ALPHONSO','TY','NOE','VERN','REED','JEFFERSON','ELVIS','BERNARDO','MAURICIO','HIRAM','DONOVAN','BASIL','RILEY','NICKOLAS','MAYNARD','SCOT','VINCE','QUINCY','EDDY','SEBASTIAN','FEDERICO','ULYSSES','HERIBERTO','DONNELL','COLE','DAVIS','GAVIN','EMERY','WARD','ROMEO','JAYSON','DANTE','CLEMENT','COY','MAXWELL','JARVIS','BRUNO','ISSAC','DUDLEY','BROCK','SANFORD','CARMELO','BARNEY','NESTOR','STEFAN','DONNY','ART','LINWOOD','BEAU','WELDON','GALEN','ISIDRO','TRUMAN','DELMAR','JOHNATHON','SILAS','FREDERIC','DICK','IRWIN','MERLIN','CHARLEY','MARCELINO','HARRIS','CARLO','TRENTON','KURTIS','HUNTER','AURELIO','WINFRED','VITO','COLLIN','DENVER','CARTER','LEONEL','EMORY','PASQUALE','MOHAMMAD','MARIANO','DANIAL','LANDON','DIRK','BRANDEN','ADAN','BUFORD','GERMAN','WILMER','EMERSON','ZACHERY','FLETCHER','JACQUES','ERROL','DALTON','MONROE','JOSUE','EDWARDO','BOOKER','WILFORD','SONNY','SHELTON','CARSON','THERON','RAYMUNDO','DAREN','HOUSTON','ROBBY','LINCOLN','GENARO','BENNETT','OCTAVIO','CORNELL','HUNG','ARRON','ANTONY','HERSCHEL','GIOVANNI','GARTH','CYRUS','CYRIL','RONNY','LON','FREEMAN','DUNCAN','KENNITH','CARMINE','ERICH','CHADWICK','WILBURN','RUSS','REID','MYLES','ANDERSON','MORTON','JONAS','FOREST','MITCHEL','MERVIN','ZANE','RICH','JAMEL','LAZARO','ALPHONSE','RANDELL','MAJOR','JARRETT','BROOKS','ABDUL','LUCIANO','SEYMOUR','EUGENIO','MOHAMMED','VALENTIN','CHANCE','ARNULFO','LUCIEN','FERDINAND','THAD','EZRA','ALDO','RUBIN','ROYAL','MITCH','EARLE','ABE','WYATT','MARQUIS','LANNY','KAREEM','JAMAR','BORIS','ISIAH','EMILE','ELMO','ARON','LEOPOLDO','EVERETTE','JOSEF','ELOY','RODRICK','REINALDO','LUCIO','JERROD','WESTON','HERSHEL','BARTON','PARKER','LEMUEL','BURT','JULES','GIL','ELISEO','AHMAD','NIGEL','EFREN','ANTWAN','ALDEN','MARGARITO','COLEMAN','DINO','OSVALDO','LES','DEANDRE','NORMAND','KIETH','TREY','NORBERTO','NAPOLEON','JEROLD','FRITZ','ROSENDO','MILFORD','CHRISTOPER','ALFONZO','LYMAN','JOSIAH','BRANT','WILTON','RICO','JAMAAL','DEWITT','BRENTON','OLIN','FOSTER','FAUSTINO','CLAUDIO','JUDSON','GINO','EDGARDO','ALEC','TANNER','JARRED','DONN','TAD','PRINCE','PORFIRIO','ODIS','LENARD','CHAUNCEY','TOD','MEL','MARCELO','KORY','AUGUSTUS','KEVEN','HILARIO','BUD','SAL','ORVAL','MAURO','ZACHARIAH','OLEN','ANIBAL','MILO','JED','DILLON','AMADO','NEWTON','LENNY','RICHIE','HORACIO','BRICE','MOHAMED','DELMER','DARIO','REYES','MAC','JONAH','JERROLD','ROBT','HANK','RUPERT','ROLLAND','KENTON','DAMION','ANTONE','WALDO','FREDRIC','BRADLY','KIP','BURL','WALKER','TYREE','JEFFEREY','AHMED','WILLY','STANFORD','OREN','NOBLE','MOSHE','MIKEL','ENOCH','BRENDON','QUINTIN','JAMISON','FLORENCIO','DARRICK','TOBIAS','HASSAN','GIUSEPPE','DEMARCUS','CLETUS','TYRELL','LYNDON','KEENAN','WERNER','GERALDO','COLUMBUS','CHET','BERTRAM','MARKUS','HUEY','HILTON','DWAIN','DONTE','TYRON','OMER','ISAIAS','HIPOLITO','FERMIN','ADALBERTO','BO','BARRETT','TEODORO','MCKINLEY','MAXIMO','GARFIELD','RALEIGH','LAWERENCE','ABRAM','RASHAD','KING','EMMITT','DARON','SAMUAL','MIQUEL','EUSEBIO','DOMENIC','DARRON','BUSTER','WILBER','RENATO','JC','HOYT','HAYWOOD','EZEKIEL','CHAS','FLORENTINO','ELROY','CLEMENTE','ARDEN','NEVILLE','EDISON','DESHAWN','NATHANIAL','JORDON','DANILO','CLAUD','SHERWOOD','RAYMON','RAYFORD','CRISTOBAL','AMBROSE','TITUS','HYMAN','FELTON','EZEQUIEL','ERASMO','STANTON','LONNY','LEN','IKE','MILAN','LINO','JAROD','HERB','ANDREAS','WALTON','RHETT','PALMER','DOUGLASS','CORDELL','OSWALDO','ELLSWORTH','VIRGILIO','TONEY','NATHANAEL','DEL','BENEDICT','MOSE','JOHNSON','ISREAL','GARRET','FAUSTO','ASA','ARLEN','ZACK','WARNER','MODESTO','FRANCESCO','MANUAL','GAYLORD','GASTON','FILIBERTO','DEANGELO','MICHALE','GRANVILLE','WES','MALIK','ZACKARY','TUAN','ELDRIDGE','CRISTOPHER','CORTEZ','ANTIONE','MALCOM','LONG','KOREY','JOSPEH','COLTON','WAYLON','VON','HOSEA','SHAD','SANTO','RUDOLF','ROLF','REY','RENALDO','MARCELLUS','LUCIUS','KRISTOFER','BOYCE','BENTON','HAYDEN','HARLAND','ARNOLDO','RUEBEN','LEANDRO','KRAIG','JERRELL','JEROMY','HOBERT','CEDRICK','ARLIE','WINFORD','WALLY','LUIGI','KENETH','JACINTO','GRAIG','FRANKLYN','EDMUNDO','SID','PORTER','LEIF','JERAMY','BUCK','WILLIAN','VINCENZO','SHON','LYNWOOD','JERE','HAI','ELDEN','DORSEY','DARELL','BRODERICK','ALONSO'];
+```
+
+## --seed-contents--
+
+```js
+function namesScores(arr) {
+
+  return arr;
+}
+
+// Only change code above this line
+const test1 = ['THIS', 'IS', 'ONLY', 'A', 'TEST'];
+const test2 = ['I', 'REPEAT', 'THIS', 'IS', 'ONLY', 'A', 'TEST'];
+
+namesScores(test1);
+```
+
+# --solutions--
+
+```js
+function nameScoreCalc(word) {
+  let sum = 0;
+  let alphabets = ["", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];
+
+  for (let i = 0 ; i < word.length; i++)
+    sum += alphabets.indexOf(word[i].toLowerCase());
+  return sum;
+}
+
+function namesScores(arr) {
+  arr = [...arr].sort();
+  arr.unshift('');
+  let total = 0;
+
+  for (let i = 1 ; i < arr.length; i++)
+    total += nameScoreCalc(arr[i]) * i;
+  return total;
+}
+
+const test1 = ['THIS', 'IS', 'ONLY', 'A', 'TEST'];
+const test2 = ['I', 'REPEAT', 'THIS', 'IS', 'ONLY', 'A', 'TEST'];
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
new file mode 100644
index 0000000000..1fccaef107
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-220-heighway-dragon.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4481000cf542c50ff5b
+title: 'Problem 220: Heighway Dragon'
+challengeType: 5
+forumTopicId: 301863
+dashedName: problem-220-heighway-dragon
+---
+
+# --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.
+
+# --hints--
+
+`euler220()` should return 139776, 963904.
+
+```js
+assert.strictEqual(euler220(), 139776, 963904);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler220() {
+
+  return true;
+}
+
+euler220();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
new file mode 100644
index 0000000000..010d2bd57c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-221-alexandrian-integers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4491000cf542c50ff5c
+title: 'Problem 221: Alexandrian Integers'
+challengeType: 5
+forumTopicId: 301864
+dashedName: problem-221-alexandrian-integers
+---
+
+# --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 1/A = 1/p + 1/q + 1/r
+
+<!-- TODO Use MathJax -->
+
+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.
+
+# --hints--
+
+`euler221()` should return 1884161251122450.
+
+```js
+assert.strictEqual(euler221(), 1884161251122450);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler221() {
+
+  return true;
+}
+
+euler221();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
new file mode 100644
index 0000000000..423ce7ff8e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-222-sphere-packing.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44b1000cf542c50ff5d
+title: 'Problem 222: Sphere Packing'
+challengeType: 5
+forumTopicId: 301865
+dashedName: problem-222-sphere-packing
+---
+
+# --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.
+
+# --hints--
+
+`euler222()` should return 1590933.
+
+```js
+assert.strictEqual(euler222(), 1590933);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler222() {
+
+  return true;
+}
+
+euler222();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
new file mode 100644
index 0000000000..28f8d8f214
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-223-almost-right-angled-triangles-i.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44b1000cf542c50ff5e
+title: 'Problem 223: Almost right-angled triangles I'
+challengeType: 5
+forumTopicId: 301866
+dashedName: problem-223-almost-right-angled-triangles-i
+---
+
+# --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?
+
+# --hints--
+
+`euler223()` should return 61614848.
+
+```js
+assert.strictEqual(euler223(), 61614848);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler223() {
+
+  return true;
+}
+
+euler223();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
new file mode 100644
index 0000000000..d9f557fd4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-224-almost-right-angled-triangles-ii.md
@@ -0,0 +1,40 @@
+---
+id: 5900f44e1000cf542c50ff5f
+title: 'Problem 224: Almost right-angled triangles II'
+challengeType: 5
+forumTopicId: 301867
+dashedName: problem-224-almost-right-angled-triangles-ii
+---
+
+# --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?
+
+# --hints--
+
+`euler224()` should return 4137330.
+
+```js
+assert.strictEqual(euler224(), 4137330);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler224() {
+
+  return true;
+}
+
+euler224();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
new file mode 100644
index 0000000000..ff5fb05c1a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-225-tribonacci-non-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f44e1000cf542c50ff60
+title: 'Problem 225: Tribonacci non-divisors'
+challengeType: 5
+forumTopicId: 301868
+dashedName: problem-225-tribonacci-non-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler225()` should return 2009.
+
+```js
+assert.strictEqual(euler225(), 2009);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler225() {
+
+  return true;
+}
+
+euler225();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
new file mode 100644
index 0000000000..3aadacc50b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-226-a-scoop-of-blancmange.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4511000cf542c50ff62
+title: 'Problem 226: A Scoop of Blancmange'
+challengeType: 5
+forumTopicId: 301869
+dashedName: problem-226-a-scoop-of-blancmange
+---
+
+# --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
+
+# --hints--
+
+`euler226()` should return 0.11316017.
+
+```js
+assert.strictEqual(euler226(), 0.11316017);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler226() {
+
+  return true;
+}
+
+euler226();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-227-the-chase.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
new file mode 100644
index 0000000000..aff8e9b934
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-227-the-chase.md
@@ -0,0 +1,42 @@
+---
+id: 5900f44f1000cf542c50ff61
+title: 'Problem 227: The Chase'
+challengeType: 5
+forumTopicId: 301870
+dashedName: problem-227-the-chase
+---
+
+# --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.
+
+# --hints--
+
+`euler227()` should return 3780.618622.
+
+```js
+assert.strictEqual(euler227(), 3780.618622);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler227() {
+
+  return true;
+}
+
+euler227();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
new file mode 100644
index 0000000000..3ee325d2be
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-228-minkowski-sums.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4511000cf542c50ff63
+title: 'Problem 228: Minkowski Sums'
+challengeType: 5
+forumTopicId: 301871
+dashedName: problem-228-minkowski-sums
+---
+
+# --description--
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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?
+
+# --hints--
+
+`euler228()` should return 86226.
+
+```js
+assert.strictEqual(euler228(), 86226);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler228() {
+
+  return true;
+}
+
+euler228();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
new file mode 100644
index 0000000000..0431ab815b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-229-four-representations-using-squares.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4521000cf542c50ff64
+title: 'Problem 229: Four Representations using Squares'
+challengeType: 5
+forumTopicId: 301872
+dashedName: problem-229-four-representations-using-squares
+---
+
+# --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?
+
+# --hints--
+
+`euler229()` should return 11325263.
+
+```js
+assert.strictEqual(euler229(), 11325263);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler229() {
+
+  return true;
+}
+
+euler229();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
new file mode 100644
index 0000000000..ce8b2262e4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-23-non-abundant-sums.md
@@ -0,0 +1,101 @@
+---
+id: 5900f3831000cf542c50fe96
+title: 'Problem 23: Non-abundant sums'
+challengeType: 5
+forumTopicId: 301873
+dashedName: problem-23-non-abundant-sums
+---
+
+# --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 positive integers &lt;= `n` which cannot be written as the sum of two abundant numbers.
+
+# --hints--
+
+`sumOfNonAbundantNumbers(10000)` should return a number.
+
+```js
+assert(typeof sumOfNonAbundantNumbers(10000) === 'number');
+```
+
+`sumOfNonAbundantNumbers(10000)` should return 3731004.
+
+```js
+assert(sumOfNonAbundantNumbers(10000) === 3731004);
+```
+
+`sumOfNonAbundantNumbers(15000)` should return 4039939.
+
+```js
+assert(sumOfNonAbundantNumbers(15000) === 4039939);
+```
+
+`sumOfNonAbundantNumbers(20000)` should return 4159710.
+
+```js
+assert(sumOfNonAbundantNumbers(20000) === 4159710);
+```
+
+`sumOfNonAbundantNumbers(28123)` should return 4179871.
+
+```js
+assert(sumOfNonAbundantNumbers(28123) === 4179871);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumOfNonAbundantNumbers(n) {
+
+  return n;
+}
+
+sumOfNonAbundantNumbers(28123);
+```
+
+# --solutions--
+
+```js
+function abundantCheck(number) {
+  let sum = 1;
+
+  for (let i = 2; i <= Math.sqrt(number); i += 1) {
+    if(number % i === 0) {
+      sum += i + +(i !== Math.sqrt(number) && number / i);
+    }
+  }
+  return sum > number;
+}
+
+function sumOfNonAbundantNumbers(n) {
+  let sum = 0;
+  const memo = {};
+  let abundantList = [];
+
+  // Function checkSum checks if num can be represented as a sum of numbers in the stack (array)
+  const checkSum = (num, stack, memo) => {
+    for (let i = 0; i < stack.length; i += 1) {
+      if ((num - stack[i]) in memo) return true;
+    }
+    return false;
+  };
+
+  for (let i = 1; i <= n; i += 1) {
+    if (abundantCheck(i)) {
+      abundantList.push(i);
+      memo[i] = 1;
+    }
+    if (checkSum(i, abundantList, memo)) continue;
+    sum += i;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
new file mode 100644
index 0000000000..16ea313199
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-230-fibonacci-words.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4531000cf542c50ff65
+title: 'Problem 230: Fibonacci Words'
+challengeType: 5
+forumTopicId: 301874
+dashedName: problem-230-fibonacci-words
+---
+
+# --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) .
+
+# --hints--
+
+`euler230()` should return 850481152593119200.
+
+```js
+assert.strictEqual(euler230(), 850481152593119200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler230() {
+
+  return true;
+}
+
+euler230();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
new file mode 100644
index 0000000000..c313225c72
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4531000cf542c50ff66
+title: 'Problem 231: The prime factorisation of binomial coefficients'
+challengeType: 5
+forumTopicId: 301875
+dashedName: problem-231-the-prime-factorisation-of-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler231()` should return 7526965179680.
+
+```js
+assert.strictEqual(euler231(), 7526965179680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler231() {
+
+  return true;
+}
+
+euler231();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-232-the-race.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-232-the-race.md
new file mode 100644
index 0000000000..c109669bd8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-232-the-race.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4551000cf542c50ff67
+title: 'Problem 232: The Race'
+challengeType: 5
+forumTopicId: 301876
+dashedName: problem-232-the-race
+---
+
+# --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 .
+
+# --hints--
+
+`euler232()` should return 0.83648556.
+
+```js
+assert.strictEqual(euler232(), 0.83648556);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler232() {
+
+  return true;
+}
+
+euler232();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
new file mode 100644
index 0000000000..5903d7e8c9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-233-lattice-points-on-a-circle.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4551000cf542c50ff68
+title: 'Problem 233: Lattice points on a circle'
+challengeType: 5
+forumTopicId: 301877
+dashedName: problem-233-lattice-points-on-a-circle
+---
+
+# --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 ?
+
+# --hints--
+
+`euler233()` should return 271204031455541300.
+
+```js
+assert.strictEqual(euler233(), 271204031455541300);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler233() {
+
+  return true;
+}
+
+euler233();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
new file mode 100644
index 0000000000..edf39ca239
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-234-semidivisible-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4571000cf542c50ff69
+title: 'Problem 234: Semidivisible numbers'
+challengeType: 5
+forumTopicId: 301878
+dashedName: problem-234-semidivisible-numbers
+---
+
+# --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 ?
+
+# --hints--
+
+`euler234()` should return 1259187438574927000.
+
+```js
+assert.strictEqual(euler234(), 1259187438574927000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler234() {
+
+  return true;
+}
+
+euler234();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
new file mode 100644
index 0000000000..549fc0275d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4571000cf542c50ff6a
+title: 'Problem 235: An Arithmetic Geometric sequence'
+challengeType: 5
+forumTopicId: 301879
+dashedName: problem-235-an-arithmetic-geometric-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler235()` should return 1.002322108633.
+
+```js
+assert.strictEqual(euler235(), 1.002322108633);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler235() {
+
+  return true;
+}
+
+euler235();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
new file mode 100644
index 0000000000..01c7effbc3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-236-luxury-hampers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4591000cf542c50ff6b
+title: 'Problem 236: Luxury Hampers'
+challengeType: 5
+forumTopicId: 301881
+dashedName: problem-236-luxury-hampers
+---
+
+# --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.
+
+# --hints--
+
+`euler236()` should return 123 / 59.
+
+```js
+assert.strictEqual(euler236(), 123 / 59);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler236() {
+
+  return true;
+}
+
+euler236();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
new file mode 100644
index 0000000000..eec1076ec1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4591000cf542c50ff6c
+title: 'Problem 237: Tours on a 4 x n playing board'
+challengeType: 5
+forumTopicId: 301882
+dashedName: problem-237-tours-on-a-4-x-n-playing-board
+---
+
+# --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?
+
+# --hints--
+
+`euler237()` should return 15836928.
+
+```js
+assert.strictEqual(euler237(), 15836928);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler237() {
+
+  return true;
+}
+
+euler237();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
new file mode 100644
index 0000000000..4bb7527686
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-238-infinite-string-tour.md
@@ -0,0 +1,58 @@
+---
+id: 5900f45b1000cf542c50ff6d
+title: 'Problem 238: Infinite string tour'
+challengeType: 5
+forumTopicId: 301883
+dashedName: problem-238-infinite-string-tour
+---
+
+# --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 &lt; k ≤ 103, ∑ p(k) = 4742.
+
+Find ∑ p(k), for 0 &lt; k ≤ 2·1015.
+
+# --hints--
+
+`euler238()` should return 9922545104535660.
+
+```js
+assert.strictEqual(euler238(), 9922545104535660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler238() {
+
+  return true;
+}
+
+euler238();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
new file mode 100644
index 0000000000..b68783fecf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-239-twenty-two-foolish-primes.md
@@ -0,0 +1,42 @@
+---
+id: 5900f45c1000cf542c50ff6e
+title: 'Problem 239: Twenty-two Foolish Primes'
+challengeType: 5
+forumTopicId: 301884
+dashedName: problem-239-twenty-two-foolish-primes
+---
+
+# --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.
+
+# --hints--
+
+`euler239()` should return 0.001887854841.
+
+```js
+assert.strictEqual(euler239(), 0.001887854841);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler239() {
+
+  return true;
+}
+
+euler239();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
new file mode 100644
index 0000000000..49998335d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3841000cf542c50fe97
+title: 'Problem 24: Lexicographic permutations'
+challengeType: 5
+forumTopicId: 301885
+dashedName: problem-24-lexicographic-permutations
+---
+
+# --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:
+
+<div style='text-align: center;'>012   021   102   120   201   210</div>
+
+What is the `n`th lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
+
+# --hints--
+
+`lexicographicPermutations(699999)` should return a number.
+
+```js
+assert(typeof lexicographicPermutations(699999) === 'number');
+```
+
+`lexicographicPermutations(699999)` should return 1938246570.
+
+```js
+assert(lexicographicPermutations(699999) == 1938246570);
+```
+
+`lexicographicPermutations(899999)` should return 2536987410.
+
+```js
+assert(lexicographicPermutations(899999) == 2536987410);
+```
+
+`lexicographicPermutations(900000)` should return 2537014689.
+
+```js
+assert(lexicographicPermutations(900000) == 2537014689);
+```
+
+`lexicographicPermutations(999999)` should return 2783915460.
+
+```js
+assert(lexicographicPermutations(999999) == 2783915460);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lexicographicPermutations(n) {
+
+  return n;
+}
+
+lexicographicPermutations(999999);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-240-top-dice.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
new file mode 100644
index 0000000000..392edfa3dd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
@@ -0,0 +1,48 @@
+---
+id: 5900f45d1000cf542c50ff6f
+title: 'Problem 240: Top Dice'
+challengeType: 5
+forumTopicId: 301887
+dashedName: problem-240-top-dice
+---
+
+# --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?
+
+# --hints--
+
+`euler240()` should return 7448717393364182000.
+
+```js
+assert.strictEqual(euler240(), 7448717393364182000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler240() {
+
+  return true;
+}
+
+euler240();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
new file mode 100644
index 0000000000..b80b7872cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-241-perfection-quotients.md
@@ -0,0 +1,42 @@
+---
+id: 5900f45d1000cf542c50ff70
+title: 'Problem 241: Perfection Quotients'
+challengeType: 5
+forumTopicId: 301888
+dashedName: problem-241-perfection-quotients
+---
+
+# --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.
+
+# --hints--
+
+`euler241()` should return 482316491800641150.
+
+```js
+assert.strictEqual(euler241(), 482316491800641150);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler241() {
+
+  return true;
+}
+
+euler241();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
new file mode 100644
index 0000000000..c8eb8d360c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-242-odd-triplets.md
@@ -0,0 +1,44 @@
+---
+id: 5900f45f1000cf542c50ff71
+title: 'Problem 242: Odd Triplets'
+challengeType: 5
+forumTopicId: 301889
+dashedName: problem-242-odd-triplets
+---
+
+# --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 ?
+
+# --hints--
+
+`euler242()` should return 997104142249036700.
+
+```js
+assert.strictEqual(euler242(), 997104142249036700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler242() {
+
+  return true;
+}
+
+euler242();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-243-resilience.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-243-resilience.md
new file mode 100644
index 0000000000..54c911233a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-243-resilience.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4601000cf542c50ff73
+title: 'Problem 243: Resilience'
+challengeType: 5
+forumTopicId: 301890
+dashedName: problem-243-resilience
+---
+
+# --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) &lt; 4/10 .
+
+Find the smallest denominator d, having a resilience R(d) &lt; 15499/94744 .
+
+# --hints--
+
+`euler243()` should return 892371480.
+
+```js
+assert.strictEqual(euler243(), 892371480);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler243() {
+
+  return true;
+}
+
+euler243();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-244-sliders.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-244-sliders.md
new file mode 100644
index 0000000000..dfc2ef5931
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-244-sliders.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4601000cf542c50ff72
+title: 'Problem 244: Sliders'
+challengeType: 5
+forumTopicId: 301891
+dashedName: problem-244-sliders
+---
+
+# --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?
+
+# --hints--
+
+`euler244()` should return 96356848.
+
+```js
+assert.strictEqual(euler244(), 96356848);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler244() {
+
+  return true;
+}
+
+euler244();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-245-coresilience.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
new file mode 100644
index 0000000000..47fc69a5fa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-245-coresilience.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4621000cf542c50ff74
+title: 'Problem 245: Coresilience'
+challengeType: 5
+forumTopicId: 301892
+dashedName: problem-245-coresilience
+---
+
+# --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 &lt; n ≤ 2×1011, for which C(n) is a unit fraction.
+
+# --hints--
+
+`euler245()` should return 288084712410001.
+
+```js
+assert.strictEqual(euler245(), 288084712410001);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler245() {
+
+  return true;
+}
+
+euler245();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
new file mode 100644
index 0000000000..2d50a2e979
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-246-tangents-to-an-ellipse.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4621000cf542c50ff75
+title: 'Problem 246: Tangents to an ellipse'
+challengeType: 5
+forumTopicId: 301893
+dashedName: problem-246-tangents-to-an-ellipse
+---
+
+# --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)
+
+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?
+
+# --hints--
+
+`euler246()` should return 810834388.
+
+```js
+assert.strictEqual(euler246(), 810834388);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler246() {
+
+  return true;
+}
+
+euler246();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
new file mode 100644
index 0000000000..d9a5572eea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-247-squares-under-a-hyperbola.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4641000cf542c50ff76
+title: 'Problem 247: Squares under a hyperbola'
+challengeType: 5
+forumTopicId: 301894
+dashedName: problem-247-squares-under-a-hyperbola
+---
+
+# --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)?
+
+# --hints--
+
+`euler247()` should return 782252.
+
+```js
+assert.strictEqual(euler247(), 782252);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler247() {
+
+  return true;
+}
+
+euler247();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
new file mode 100644
index 0000000000..1641fd73a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4651000cf542c50ff77
+title: 'Problem 248: Numbers for which Euler’s totient function equals 13!'
+challengeType: 5
+forumTopicId: 301895
+dashedName: problem-248-numbers-for-which-eulers-totient-function-equals-13
+---
+
+# --description--
+
+The first number n for which φ(n)=13! is 6227180929.
+
+Find the 150,000th such number.
+
+# --hints--
+
+`euler248()` should return 23507044290.
+
+```js
+assert.strictEqual(euler248(), 23507044290);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler248() {
+
+  return true;
+}
+
+euler248();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
new file mode 100644
index 0000000000..71c8d1da19
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4671000cf542c50ff79
+title: 'Problem 249: Prime Subset Sums'
+challengeType: 5
+forumTopicId: 301896
+dashedName: problem-249-prime-subset-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler249()` should return 9275262564250418.
+
+```js
+assert.strictEqual(euler249(), 9275262564250418);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler249() {
+
+  return true;
+}
+
+euler249();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
new file mode 100644
index 0000000000..ca7d277f44
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-25-1000-digit-fibonacci-number.md
@@ -0,0 +1,85 @@
+---
+id: 5900f3851000cf542c50fe98
+title: 'Problem 25: 1000-digit Fibonacci number'
+challengeType: 5
+forumTopicId: 301897
+dashedName: problem-25-1000-digit-fibonacci-number
+---
+
+# --description--
+
+The Fibonacci sequence is defined by the recurrence relation:
+
+<div style='padding-left: 4em;'>F<sub>n</sub> = F<sub>n−1</sub> + F<sub>n−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.</div>
+
+Hence the first 12 terms will be:
+
+<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div>F<sub>1</sub> = 1</div><div>F<sub>2</sub> = 1</div><div>F<sub>3</sub> = 2</div><div>F<sub>4</sub> = 3</div><div>F<sub>5</sub> = 5</div><div>F<sub>6</sub> = 8</div><div>F<sub>7</sub> = 13</div><div>F<sub>8</sub> = 21</div><div>F<sub>9</sub> = 34</div><div>F<sub>10</sub> = 55</div><div>F<sub>11</sub> = 89</div><div>F<sub>12</sub> = 144</div></div>
+
+The 12th term, F<sub>12</sub>, is the first term to contain three digits.
+
+What is the index of the first term in the Fibonacci sequence to contain `n` digits?
+
+# --hints--
+
+`digitFibonacci(5)` should return a number.
+
+```js
+assert(typeof digitFibonacci(5) === 'number');
+```
+
+`digitFibonacci(5)` should return 21.
+
+```js
+assert.strictEqual(digitFibonacci(5), 21);
+```
+
+`digitFibonacci(10)` should return 45.
+
+```js
+assert.strictEqual(digitFibonacci(10), 45);
+```
+
+`digitFibonacci(15)` should return 69.
+
+```js
+assert.strictEqual(digitFibonacci(15), 69);
+```
+
+`digitFibonacci(20)` should return 93.
+
+```js
+assert.strictEqual(digitFibonacci(20), 93);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFibonacci(n) {
+
+  return n;
+}
+
+digitFibonacci(20);
+```
+
+# --solutions--
+
+```js
+const digitFibonacci = (n) => {
+  const digits = (num) => {
+    return num.toString().length;
+  };
+  let f1 = 1;
+  let f2 = 1;
+  let index = 3;
+  while (true) {
+    let fn = f1 + f2;
+    if (digits(fn) === n) return index;
+    [f1, f2] = [f2, fn];
+    index++;
+  }
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-250-250250.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-250-250250.md
new file mode 100644
index 0000000000..9c48826055
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-250-250250.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4661000cf542c50ff78
+title: 'Problem 250: 250250'
+challengeType: 5
+forumTopicId: 301898
+dashedName: problem-250-250250
+---
+
+# --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.
+
+# --hints--
+
+`euler250()` should return 1425480602091519.
+
+```js
+assert.strictEqual(euler250(), 1425480602091519);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler250() {
+
+  return true;
+}
+
+euler250();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
new file mode 100644
index 0000000000..9023efb818
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4671000cf542c50ff7a
+title: 'Problem 251: Cardano Triplets'
+challengeType: 5
+forumTopicId: 301899
+dashedName: problem-251-cardano-triplets
+---
+
+# --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.
+
+# --hints--
+
+`euler251()` should return 18946051.
+
+```js
+assert.strictEqual(euler251(), 18946051);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler251() {
+
+  return true;
+}
+
+euler251();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
new file mode 100644
index 0000000000..68251abd75
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-252-convex-holes.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4691000cf542c50ff7b
+title: 'Problem 252: Convex Holes'
+challengeType: 5
+forumTopicId: 301900
+dashedName: problem-252-convex-holes
+---
+
+# --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.
+
+# --hints--
+
+`euler252()` should return 104924.
+
+```js
+assert.strictEqual(euler252(), 104924);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler252() {
+
+  return true;
+}
+
+euler252();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
new file mode 100644
index 0000000000..78efca2bdc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-253-tidying-up.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4691000cf542c50ff7c
+title: 'Problem 253: Tidying up'
+challengeType: 5
+forumTopicId: 301901
+dashedName: problem-253-tidying-up
+---
+
+# --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.
+
+# --hints--
+
+`euler253()` should return 11.492847.
+
+```js
+assert.strictEqual(euler253(), 11.492847);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler253() {
+
+  return true;
+}
+
+euler253();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
new file mode 100644
index 0000000000..028f20783e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-254-sums-of-digit-factorials.md
@@ -0,0 +1,48 @@
+---
+id: 5900f46b1000cf542c50ff7d
+title: 'Problem 254: Sums of Digit Factorials'
+challengeType: 5
+forumTopicId: 301902
+dashedName: problem-254-sums-of-digit-factorials
+---
+
+# --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?
+
+# --hints--
+
+`euler254()` should return 8184523820510.
+
+```js
+assert.strictEqual(euler254(), 8184523820510);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler254() {
+
+  return true;
+}
+
+euler254();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
new file mode 100644
index 0000000000..8c6acc7113
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md
@@ -0,0 +1,50 @@
+---
+id: 5900f46d1000cf542c50ff7f
+title: 'Problem 255: Rounded Square Roots'
+challengeType: 5
+forumTopicId: 301903
+dashedName: problem-255-rounded-square-roots
+---
+
+# --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 &lt; 1014)? Give your answer rounded to 10 decimal places.
+
+Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively.
+
+# --hints--
+
+`euler255()` should return 4.447401118.
+
+```js
+assert.strictEqual(euler255(), 4.447401118);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler255() {
+
+  return true;
+}
+
+euler255();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
new file mode 100644
index 0000000000..7a55e36abe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-256-tatami-free-rooms.md
@@ -0,0 +1,54 @@
+---
+id: 5900f46c1000cf542c50ff7e
+title: 'Problem 256: Tatami-Free Rooms'
+challengeType: 5
+forumTopicId: 301904
+dashedName: problem-256-tatami-free-rooms
+---
+
+# --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.
+
+# --hints--
+
+`euler256()` should return 85765680.
+
+```js
+assert.strictEqual(euler256(), 85765680);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler256() {
+
+  return true;
+}
+
+euler256();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
new file mode 100644
index 0000000000..629b1f0340
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-257-angular-bisectors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f46e1000cf542c50ff80
+title: 'Problem 257: Angular Bisectors'
+challengeType: 5
+forumTopicId: 301905
+dashedName: problem-257-angular-bisectors
+---
+
+# --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?
+
+# --hints--
+
+`euler257()` should return 139012411.
+
+```js
+assert.strictEqual(euler257(), 139012411);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler257() {
+
+  return true;
+}
+
+euler257();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
new file mode 100644
index 0000000000..963b52807e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-258-a-lagged-fibonacci-sequence.md
@@ -0,0 +1,40 @@
+---
+id: 5900f46e1000cf542c50ff81
+title: 'Problem 258: A lagged Fibonacci sequence'
+challengeType: 5
+forumTopicId: 301906
+dashedName: problem-258-a-lagged-fibonacci-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler258()` should return 12747994.
+
+```js
+assert.strictEqual(euler258(), 12747994);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler258() {
+
+  return true;
+}
+
+euler258();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
new file mode 100644
index 0000000000..c9eab8e6ef
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-259-reachable-numbers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4701000cf542c50ff82
+title: 'Problem 259: Reachable Numbers'
+challengeType: 5
+forumTopicId: 301907
+dashedName: problem-259-reachable-numbers
+---
+
+# --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?
+
+# --hints--
+
+`euler259()` should return 20101196798.
+
+```js
+assert.strictEqual(euler259(), 20101196798);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler259() {
+
+  return true;
+}
+
+euler259();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
new file mode 100644
index 0000000000..d6ee972f90
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-26-reciprocal-cycles.md
@@ -0,0 +1,68 @@
+---
+id: 5900f3861000cf542c50fe99
+title: 'Problem 26: Reciprocal cycles'
+challengeType: 5
+forumTopicId: 301908
+dashedName: problem-26-reciprocal-cycles
+---
+
+# --description--
+
+A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
+
+<div style='padding-left: 4em; display: inline-grid; grid-template-rows: auto; row-gap: 7px;'><div><sup>1</sup>/<sub>2</sub> = 0.5</div><div><sup>1</sup>/<sub>3</sub> = 0.(3)</div><div><sup>1</sup>/<sub>4</sub> = 0.25</div><div><sup>1</sup>/<sub>5</sub> = 0.2</div><div><sup>1</sup>/<sub>6</sub> = 0.1(6)</div><div><sup>1</sup>/<sub>7</sub> = 0.(142857)</div><div><sup>1</sup>/<sub>8</sub> = 0.125</div><div><sup>1</sup>/<sub>9</sub> = 0.(1)</div><div><sup>1</sup>/<sub>10</sub> = 0.1</div></div>
+
+Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.
+
+Find the value of `d` &lt; `n` for which <sup>1</sup>/<sub>d</sub> contains the longest recurring cycle in its decimal fraction part.
+
+# --hints--
+
+`reciprocalCycles(700)` should return a number.
+
+```js
+assert(typeof reciprocalCycles(700) === 'number');
+```
+
+`reciprocalCycles(700)` should return 659.
+
+```js
+assert(reciprocalCycles(700) == 659);
+```
+
+`reciprocalCycles(800)` should return 743.
+
+```js
+assert(reciprocalCycles(800) == 743);
+```
+
+`reciprocalCycles(900)` should return 887.
+
+```js
+assert(reciprocalCycles(900) == 887);
+```
+
+`reciprocalCycles(1000)` should return 983.
+
+```js
+assert(reciprocalCycles(1000) == 983);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function reciprocalCycles(n) {
+
+  return n;
+}
+
+reciprocalCycles(1000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
new file mode 100644
index 0000000000..55f0dccfd5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4701000cf542c50ff83
+title: 'Problem 260: Stone Game'
+challengeType: 5
+forumTopicId: 301909
+dashedName: problem-260-stone-game
+---
+
+# --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.
+
+# --hints--
+
+`euler260()` should return 167542057.
+
+```js
+assert.strictEqual(euler260(), 167542057);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler260() {
+
+  return true;
+}
+
+euler260();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
new file mode 100644
index 0000000000..b265e7910b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-261-pivotal-square-sums.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4711000cf542c50ff84
+title: 'Problem 261: Pivotal Square Sums'
+challengeType: 5
+forumTopicId: 301910
+dashedName: problem-261-pivotal-square-sums
+---
+
+# --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.
+
+# --hints--
+
+`euler261()` should return 238890850232021.
+
+```js
+assert.strictEqual(euler261(), 238890850232021);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler261() {
+
+  return true;
+}
+
+euler261();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
new file mode 100644
index 0000000000..01cc16de4e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-262-mountain-range.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4731000cf542c50ff85
+title: 'Problem 262: Mountain Range'
+challengeType: 5
+forumTopicId: 301911
+dashedName: problem-262-mountain-range
+---
+
+# --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) )
+
+# --hints--
+
+`euler262()` should return 2531.205.
+
+```js
+assert.strictEqual(euler262(), 2531.205);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler262() {
+
+  return true;
+}
+
+euler262();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
new file mode 100644
index 0000000000..24fca67d82
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-263-an-engineers-dream-come-true.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4741000cf542c50ff86
+title: 'Problem 263: An engineers'' dream come true'
+challengeType: 5
+forumTopicId: 301912
+dashedName: problem-263-an-engineers-dream-come-true
+---
+
+# --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.
+
+# --hints--
+
+`euler263()` should return 2039506520.
+
+```js
+assert.strictEqual(euler263(), 2039506520);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler263() {
+
+  return true;
+}
+
+euler263();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
new file mode 100644
index 0000000000..34be7dede4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-264-triangle-centres.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4751000cf542c50ff87
+title: 'Problem 264: Triangle Centres'
+challengeType: 5
+forumTopicId: 301913
+dashedName: problem-264-triangle-centres
+---
+
+# --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.
+
+# --hints--
+
+`euler264()` should return 2816417.1055.
+
+```js
+assert.strictEqual(euler264(), 2816417.1055);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler264() {
+
+  return true;
+}
+
+euler264();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
new file mode 100644
index 0000000000..0ed757aa65
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-265-binary-circles.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4761000cf542c50ff88
+title: 'Problem 265: Binary Circles'
+challengeType: 5
+forumTopicId: 301914
+dashedName: problem-265-binary-circles
+---
+
+# --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).
+
+# --hints--
+
+`euler265()` should return 209110240768.
+
+```js
+assert.strictEqual(euler265(), 209110240768);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler265() {
+
+  return true;
+}
+
+euler265();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
new file mode 100644
index 0000000000..18569d5b8e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-266-pseudo-square-root.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4771000cf542c50ff89
+title: 'Problem 266: Pseudo Square Root'
+challengeType: 5
+forumTopicId: 301915
+dashedName: problem-266-pseudo-square-root
+---
+
+# --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.
+
+# --hints--
+
+`euler266()` should return 1096883702440585.
+
+```js
+assert.strictEqual(euler266(), 1096883702440585);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler266() {
+
+  return true;
+}
+
+euler266();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-267-billionaire.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
new file mode 100644
index 0000000000..0c308ff3ec
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-267-billionaire.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4771000cf542c50ff8a
+title: 'Problem 267: Billionaire'
+challengeType: 5
+forumTopicId: 301916
+dashedName: problem-267-billionaire
+---
+
+# --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.
+
+# --hints--
+
+`euler267()` should return 0.999992836187.
+
+```js
+assert.strictEqual(euler267(), 0.999992836187);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler267() {
+
+  return true;
+}
+
+euler267();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
new file mode 100644
index 0000000000..c703c2b10f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md
@@ -0,0 +1,43 @@
+---
+id: 5900f4791000cf542c50ff8b
+title: >-
+  Problem 268: Counting numbers with at least four distinct prime factors less
+  than 100
+challengeType: 5
+forumTopicId: 301917
+dashedName: >-
+  problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100
+---
+
+# --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.
+
+# --hints--
+
+`euler268()` should return 785478606870985.
+
+```js
+assert.strictEqual(euler268(), 785478606870985);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler268() {
+
+  return true;
+}
+
+euler268();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
new file mode 100644
index 0000000000..b4b2692610
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-269-polynomials-with-at-least-one-integer-root.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4791000cf542c50ff8c
+title: 'Problem 269: Polynomials with at least one integer root'
+challengeType: 5
+forumTopicId: 301918
+dashedName: problem-269-polynomials-with-at-least-one-integer-root
+---
+
+# --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)?
+
+# --hints--
+
+`euler269()` should return 1311109198529286.
+
+```js
+assert.strictEqual(euler269(), 1311109198529286);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler269() {
+
+  return true;
+}
+
+euler269();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
new file mode 100644
index 0000000000..a694ee2a59
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-27-quadratic-primes.md
@@ -0,0 +1,78 @@
+---
+id: 5900f3871000cf542c50fe9a
+title: 'Problem 27: Quadratic primes'
+challengeType: 5
+forumTopicId: 301919
+dashedName: problem-27-quadratic-primes
+---
+
+# --description--
+
+Euler discovered the remarkable quadratic formula:
+
+<div style='margin-left: 4em;'>$n^2 + n + 41$</div>
+
+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:
+
+<div style='margin-left: 4em;'>
+  $n^2 + an + b$, where $|a| < range$ and $|b| \le range$<br>
+  where $|n|$ is the modulus/absolute value of $n$<br>
+  e.g. $|11| = 11$ and $|-4| = 4$<br>
+</div>
+
+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$.
+
+# --hints--
+
+`quadraticPrimes(200)` should return a number.
+
+```js
+assert(typeof quadraticPrimes(200) === 'number');
+```
+
+`quadraticPrimes(200)` should return -4925.
+
+```js
+assert(quadraticPrimes(200) == -4925);
+```
+
+`quadraticPrimes(500)` should return -18901.
+
+```js
+assert(quadraticPrimes(500) == -18901);
+```
+
+`quadraticPrimes(800)` should return -43835.
+
+```js
+assert(quadraticPrimes(800) == -43835);
+```
+
+`quadraticPrimes(1000)` should return -59231.
+
+```js
+assert(quadraticPrimes(1000) == -59231);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function quadraticPrimes(range) {
+
+  return range;
+}
+
+quadraticPrimes(1000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
new file mode 100644
index 0000000000..5d490e3b17
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-270-cutting-squares.md
@@ -0,0 +1,48 @@
+---
+id: 5900f47c1000cf542c50ff8e
+title: 'Problem 270: Cutting Squares'
+challengeType: 5
+forumTopicId: 301920
+dashedName: problem-270-cutting-squares
+---
+
+# --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 ?
+
+# --hints--
+
+`euler270()` should return 82282080.
+
+```js
+assert.strictEqual(euler270(), 82282080);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler270() {
+
+  return true;
+}
+
+euler270();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
new file mode 100644
index 0000000000..e9f9bb785c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-271-modular-cubes-part-1.md
@@ -0,0 +1,42 @@
+---
+id: 5900f47b1000cf542c50ff8d
+title: 'Problem 271: Modular Cubes, part 1'
+challengeType: 5
+forumTopicId: 301921
+dashedName: problem-271-modular-cubes-part-1
+---
+
+# --description--
+
+For a positive number n, define S(n) as the sum of the integers x, for which 1
+
+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).
+
+# --hints--
+
+`euler271()` should return 4617456485273130000.
+
+```js
+assert.strictEqual(euler271(), 4617456485273130000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler271() {
+
+  return true;
+}
+
+euler271();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
new file mode 100644
index 0000000000..3cfb07b5b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-272-modular-cubes-part-2.md
@@ -0,0 +1,42 @@
+---
+id: 5900f47d1000cf542c50ff8f
+title: 'Problem 272: Modular Cubes, part 2'
+challengeType: 5
+forumTopicId: 301922
+dashedName: problem-272-modular-cubes-part-2
+---
+
+# --description--
+
+For a positive number n, define C(n) as the number of the integers x, for which 1
+
+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.
+
+# --hints--
+
+`euler272()` should return 8495585919506151000.
+
+```js
+assert.strictEqual(euler272(), 8495585919506151000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler272() {
+
+  return true;
+}
+
+euler272();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
new file mode 100644
index 0000000000..508c463ddd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-273-sum-of-squares.md
@@ -0,0 +1,40 @@
+---
+id: 5900f47e1000cf542c50ff90
+title: 'Problem 273: Sum of Squares'
+challengeType: 5
+forumTopicId: 301923
+dashedName: problem-273-sum-of-squares
+---
+
+# --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 &lt; 150.
+
+# --hints--
+
+`euler273()` should return 2032447591196869000.
+
+```js
+assert.strictEqual(euler273(), 2032447591196869000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler273() {
+
+  return true;
+}
+
+euler273();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
new file mode 100644
index 0000000000..7841b6ed8f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-274-divisibility-multipliers.md
@@ -0,0 +1,50 @@
+---
+id: 5900f47f1000cf542c50ff91
+title: 'Problem 274: Divisibility Multipliers'
+challengeType: 5
+forumTopicId: 301924
+dashedName: problem-274-divisibility-multipliers
+---
+
+# --description--
+
+For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m &lt; 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?
+
+# --hints--
+
+`euler274()` should return 1601912348822.
+
+```js
+assert.strictEqual(euler274(), 1601912348822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler274() {
+
+  return true;
+}
+
+euler274();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
new file mode 100644
index 0000000000..a65dc0151c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-275-balanced-sculptures.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4801000cf542c50ff92
+title: 'Problem 275: Balanced Sculptures'
+challengeType: 5
+forumTopicId: 301925
+dashedName: problem-275-balanced-sculptures
+---
+
+# --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?
+
+# --hints--
+
+`euler275()` should return 15030564.
+
+```js
+assert.strictEqual(euler275(), 15030564);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler275() {
+
+  return true;
+}
+
+euler275();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
new file mode 100644
index 0000000000..0e8392e57b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-276-primitive-triangles.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4801000cf542c50ff93
+title: 'Problem 276: Primitive Triangles'
+challengeType: 5
+forumTopicId: 301926
+dashedName: problem-276-primitive-triangles
+---
+
+# --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?
+
+# --hints--
+
+`euler276()` should return 5777137137739633000.
+
+```js
+assert.strictEqual(euler276(), 5777137137739633000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler276() {
+
+  return true;
+}
+
+euler276();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
new file mode 100644
index 0000000000..1f081396c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-277-a-modified-collatz-sequence.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4811000cf542c50ff94
+title: 'Problem 277: A Modified Collatz sequence'
+challengeType: 5
+forumTopicId: 301927
+dashedName: problem-277-a-modified-collatz-sequence
+---
+
+# --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"?
+
+# --hints--
+
+`euler277()` should return 1125977393124310.
+
+```js
+assert.strictEqual(euler277(), 1125977393124310);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler277() {
+
+  return true;
+}
+
+euler277();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
new file mode 100644
index 0000000000..6e26a6a316
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-278-linear-combinations-of-semiprimes.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4831000cf542c50ff95
+title: 'Problem 278: Linear Combinations of Semiprimes'
+challengeType: 5
+forumTopicId: 301928
+dashedName: problem-278-linear-combinations-of-semiprimes
+---
+
+# --description--
+
+Given the values of integers 1 &lt; a1 &lt; a2 &lt;... &lt; an, consider the linear combination q1a1 + 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 &lt; q &lt; r &lt; 5000.
+
+# --hints--
+
+`euler278()` should return 1228215747273908500.
+
+```js
+assert.strictEqual(euler278(), 1228215747273908500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler278() {
+
+  return true;
+}
+
+euler278();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
new file mode 100644
index 0000000000..9fc673b5ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-279-triangles-with-integral-sides-and-an-integral-angle.md
@@ -0,0 +1,38 @@
+---
+id: 5900f4841000cf542c50ff96
+title: 'Problem 279: Triangles with integral sides and an integral angle'
+challengeType: 5
+forumTopicId: 301929
+dashedName: problem-279-triangles-with-integral-sides-and-an-integral-angle
+---
+
+# --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?
+
+# --hints--
+
+`euler279()` should return 416577688.
+
+```js
+assert.strictEqual(euler279(), 416577688);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler279() {
+
+  return true;
+}
+
+euler279();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
new file mode 100644
index 0000000000..a476199d1d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-28-number-spiral-diagonals.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3881000cf542c50fe9b
+title: 'Problem 28: Number spiral diagonals'
+challengeType: 5
+forumTopicId: 301930
+dashedName: problem-28-number-spiral-diagonals
+---
+
+# --description--
+
+Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:
+
+<div style='padding-left: 4em;'>
+  <div style='color: red; display: inline;'>21</div> 22 23 24 <div style='color: red; display: inline;'>25</div><br>
+  20  <div style='color: red; display: inline;'>7</div>  8  <div style='color: red; display: inline;'>9</div> 10<br>
+  19  6  <div style='color: red; display: inline;'>1</div>  2 11<br>
+  18  <div style='color: red; display: inline;'>5</div>  4  <div style='color: red; display: inline;'>3</div> 12<br>
+  <div style='color: red; display: inline;'>17</div> 16 15 14 <div style='color: red; display: inline;'>13</div><br>
+</div>
+
+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 an `n` by `n` spiral formed in the same way?
+
+# --hints--
+
+`spiralDiagonals(101)` should return a number.
+
+```js
+assert(typeof spiralDiagonals(101) === 'number');
+```
+
+`spiralDiagonals(101)` should return 692101.
+
+```js
+assert(spiralDiagonals(101) == 692101);
+```
+
+`spiralDiagonals(303)` should return 18591725.
+
+```js
+assert(spiralDiagonals(303) == 18591725);
+```
+
+`spiralDiagonals(505)` should return 85986601.
+
+```js
+assert(spiralDiagonals(505) == 85986601);
+```
+
+`spiralDiagonals(1001)` should return 669171001.
+
+```js
+assert(spiralDiagonals(1001) == 669171001);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralDiagonals(n) {
+
+  return n;
+}
+
+spiralDiagonals(1001);
+```
+
+# --solutions--
+
+```js
+const spiralDiagonals = (n) => {
+  const Sn2 = (n) => {
+    return n*(n+1)*(2*n+1)/6;
+  };
+  const Sn = (n) => {
+    return n*(n+1)/2;
+  };
+  let sum = (Sn2(n-1) + Sn(n-1) + n-1) + (Math.floor(n/2) + Sn2(n));
+  return sum;
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
new file mode 100644
index 0000000000..642a7d802f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-280-ant-and-seeds.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4841000cf542c50ff97
+title: 'Problem 280: Ant and seeds'
+challengeType: 5
+forumTopicId: 301931
+dashedName: problem-280-ant-and-seeds
+---
+
+# --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.
+
+# --hints--
+
+`euler280()` should return 430.088247.
+
+```js
+assert.strictEqual(euler280(), 430.088247);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler280() {
+
+  return true;
+}
+
+euler280();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
new file mode 100644
index 0000000000..9ac6cf33a6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-281-pizza-toppings.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4861000cf542c50ff98
+title: 'Problem 281: Pizza Toppings'
+challengeType: 5
+forumTopicId: 301932
+dashedName: problem-281-pizza-toppings
+---
+
+# --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.
+
+# --hints--
+
+`euler281()` should return 1485776387445623.
+
+```js
+assert.strictEqual(euler281(), 1485776387445623);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler281() {
+
+  return true;
+}
+
+euler281();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
new file mode 100644
index 0000000000..5abd58ec44
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-282-the-ackermann-function.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4861000cf542c50ff99
+title: 'Problem 282: The Ackermann function'
+challengeType: 5
+forumTopicId: 301933
+dashedName: problem-282-the-ackermann-function
+---
+
+# --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.
+
+# --hints--
+
+`euler282()` should return 1098988351.
+
+```js
+assert.strictEqual(euler282(), 1098988351);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler282() {
+
+  return true;
+}
+
+euler282();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
new file mode 100644
index 0000000000..7073e7c431
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral.md
@@ -0,0 +1,49 @@
+---
+id: 5900f4881000cf542c50ff9a
+title: >-
+  Problem 283: Integer sided triangles for which the area * perimeter ratio is
+  integral
+challengeType: 5
+forumTopicId: 301934
+dashedName: >-
+  problem-283-integer-sided-triangles-for-which-the-area--perimeter-ratio-is-integral
+---
+
+# --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.
+
+# --hints--
+
+`euler283()` should return 28038042525570324.
+
+```js
+assert.strictEqual(euler283(), 28038042525570324);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler283() {
+
+  return true;
+}
+
+euler283();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
new file mode 100644
index 0000000000..818483669e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-284-steady-squares.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4891000cf542c50ff9b
+title: 'Problem 284: Steady Squares'
+challengeType: 5
+forumTopicId: 301935
+dashedName: problem-284-steady-squares
+---
+
+# --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.
+
+# --hints--
+
+`euler284()` should return 5a411d7b.
+
+```js
+assert.strictEqual(euler284(), '5a411d7b');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler284() {
+
+  return true;
+}
+
+euler284();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
new file mode 100644
index 0000000000..12ddabd722
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-285-pythagorean-odds.md
@@ -0,0 +1,46 @@
+---
+id: 5900f48a1000cf542c50ff9c
+title: 'Problem 285: Pythagorean odds'
+challengeType: 5
+forumTopicId: 301936
+dashedName: problem-285-pythagorean-odds
+---
+
+# --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?
+
+# --hints--
+
+`euler285()` should return 157055.80999.
+
+```js
+assert.strictEqual(euler285(), 157055.80999);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler285() {
+
+  return true;
+}
+
+euler285();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
new file mode 100644
index 0000000000..abb357c47a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-286-scoring-probabilities.md
@@ -0,0 +1,42 @@
+---
+id: 5900f48a1000cf542c50ff9d
+title: 'Problem 286: Scoring probabilities'
+challengeType: 5
+forumTopicId: 301937
+dashedName: problem-286-scoring-probabilities
+---
+
+# --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.
+
+# --hints--
+
+`euler286()` should return 52.6494571953.
+
+```js
+assert.strictEqual(euler286(), 52.6494571953);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler286() {
+
+  return true;
+}
+
+euler286();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
new file mode 100644
index 0000000000..8d11a248e2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-287-quadtree-encoding-a-simple-compression-algorithm.md
@@ -0,0 +1,54 @@
+---
+id: 5900f48b1000cf542c50ff9e
+title: 'Problem 287: Quadtree encoding (a simple compression algorithm)'
+challengeType: 5
+forumTopicId: 301938
+dashedName: problem-287-quadtree-encoding-a-simple-compression-algorithm
+---
+
+# --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 ?
+
+# --hints--
+
+`euler287()` should return 313135496.
+
+```js
+assert.strictEqual(euler287(), 313135496);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler287() {
+
+  return true;
+}
+
+euler287();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
new file mode 100644
index 0000000000..28a2e301ce
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-288-an-enormous-factorial.md
@@ -0,0 +1,48 @@
+---
+id: 5900f48d1000cf542c50ff9f
+title: 'Problem 288: An enormous factorial'
+challengeType: 5
+forumTopicId: 301939
+dashedName: problem-288-an-enormous-factorial
+---
+
+# --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
+
+# --hints--
+
+`euler288()` should return 605857431263982000.
+
+```js
+assert.strictEqual(euler288(), 605857431263982000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler288() {
+
+  return true;
+}
+
+euler288();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
new file mode 100644
index 0000000000..fcac68664d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-289-eulerian-cycles.md
@@ -0,0 +1,48 @@
+---
+id: 5900f48d1000cf542c50ffa0
+title: 'Problem 289: Eulerian Cycles'
+challengeType: 5
+forumTopicId: 301940
+dashedName: problem-289-eulerian-cycles
+---
+
+# --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 &lt; m, 0 ≤ y &lt; 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.
+
+# --hints--
+
+`euler289()` should return 6567944538.
+
+```js
+assert.strictEqual(euler289(), 6567944538);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler289() {
+
+  return true;
+}
+
+euler289();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
new file mode 100644
index 0000000000..28c05dfc85
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
@@ -0,0 +1,86 @@
+---
+id: 5900f3891000cf542c50fe9c
+title: 'Problem 29: Distinct powers'
+challengeType: 5
+forumTopicId: 301941
+dashedName: problem-29-distinct-powers
+---
+
+# --description--
+
+Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+
+<div style='padding-left: 4em;'>
+  2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
+  3<sup>2</sup>=9, 3<sup>3</sup>=27, 3<sup>4</sup>=81, 3<sup>5</sup>=243 <br>
+  4<sup>2</sup>=16, 4<sup>3</sup>=64, 4<sup>4</sup>=256, 4<sup>5</sup>=1024 <br>
+  5<sup>2</sup>=25, 5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125 <br>
+</div>
+
+If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+
+<div style='padding-left: 4em;'>
+  4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
+</div>
+
+How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
+
+# --hints--
+
+`distinctPowers(15)` should return a number.
+
+```js
+assert(typeof distinctPowers(15) === 'number');
+```
+
+`distinctPowers(15)` should return 177.
+
+```js
+assert.strictEqual(distinctPowers(15), 177);
+```
+
+`distinctPowers(20)` should return 324.
+
+```js
+assert.strictEqual(distinctPowers(20), 324);
+```
+
+`distinctPowers(25)` should return 519.
+
+```js
+assert.strictEqual(distinctPowers(25), 519);
+```
+
+`distinctPowers(30)` should return 755.
+
+```js
+assert.strictEqual(distinctPowers(30), 755);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function distinctPowers(n) {
+
+  return n;
+}
+
+distinctPowers(30);
+```
+
+# --solutions--
+
+```js
+const distinctPowers = (n) => {
+  let list = [];
+  for (let a=2; a<=n; a++) {
+    for (let b=2; b<=n; b++) {
+      let term = Math.pow(a, b);
+      if (list.indexOf(term)===-1) list.push(term);
+    }
+  }
+  return list.length;
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
new file mode 100644
index 0000000000..e46dfedd83
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
@@ -0,0 +1,38 @@
+---
+id: 5900f48f1000cf542c50ffa1
+title: 'Problem 290: Digital Signature'
+challengeType: 5
+forumTopicId: 301942
+dashedName: problem-290-digital-signature
+---
+
+# --description--
+
+How many integers 0 ≤ n &lt; 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?
+
+# --hints--
+
+`euler290()` should return 20444710234716470.
+
+```js
+assert.strictEqual(euler290(), 20444710234716470);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler290() {
+
+  return true;
+}
+
+euler290();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
new file mode 100644
index 0000000000..0c7d704d9f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-291-panaitopol-primes.md
@@ -0,0 +1,40 @@
+---
+id: 5900f48f1000cf542c50ffa2
+title: 'Problem 291: Panaitopol Primes'
+challengeType: 5
+forumTopicId: 301943
+dashedName: problem-291-panaitopol-primes
+---
+
+# --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.
+
+# --hints--
+
+`euler291()` should return 4037526.
+
+```js
+assert.strictEqual(euler291(), 4037526);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler291() {
+
+  return true;
+}
+
+euler291();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
new file mode 100644
index 0000000000..446e875531
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-292-pythagorean-polygons.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4911000cf542c50ffa3
+title: 'Problem 292: Pythagorean Polygons'
+challengeType: 5
+forumTopicId: 301944
+dashedName: problem-292-pythagorean-polygons
+---
+
+# --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).
+
+# --hints--
+
+`euler292()` should return 3600060866.
+
+```js
+assert.strictEqual(euler292(), 3600060866);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler292() {
+
+  return true;
+}
+
+euler292();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
new file mode 100644
index 0000000000..18307e7b04
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-293-pseudo-fortunate-numbers.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4931000cf542c50ffa4
+title: 'Problem 293: Pseudo-Fortunate Numbers'
+challengeType: 5
+forumTopicId: 301945
+dashedName: problem-293-pseudo-fortunate-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler293()` should return 2209.
+
+```js
+assert.strictEqual(euler293(), 2209);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler293() {
+
+  return true;
+}
+
+euler293();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
new file mode 100644
index 0000000000..b7bc62a5f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-294-sum-of-digits---experience-23.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4931000cf542c50ffa5
+title: 'Problem 294: Sum of digits - experience #23'
+challengeType: 5
+forumTopicId: 301946
+dashedName: problem-294-sum-of-digits---experience-23
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler294()` should return 789184709.
+
+```js
+assert.strictEqual(euler294(), 789184709);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler294() {
+
+  return true;
+}
+
+euler294();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
new file mode 100644
index 0000000000..70d1de6d60
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-295-lenticular-holes.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4931000cf542c50ffa6
+title: 'Problem 295: Lenticular holes'
+challengeType: 5
+forumTopicId: 301947
+dashedName: problem-295-lenticular-holes
+---
+
+# --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 &lt; r1 ≤ r2 ≤ N. We can verify that L(10) = 30 and L(100) = 3442.
+
+Find L(100 000).
+
+# --hints--
+
+`euler295()` should return 4884650818.
+
+```js
+assert.strictEqual(euler295(), 4884650818);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler295() {
+
+  return true;
+}
+
+euler295();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
new file mode 100644
index 0000000000..0d269dca3c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-296-angular-bisector-and-tangent.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4941000cf542c50ffa7
+title: 'Problem 296: Angular Bisector and Tangent'
+challengeType: 5
+forumTopicId: 301948
+dashedName: problem-296-angular-bisector-and-tangent
+---
+
+# --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?
+
+# --hints--
+
+`euler296()` should return 1137208419.
+
+```js
+assert.strictEqual(euler296(), 1137208419);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler296() {
+
+  return true;
+}
+
+euler296();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
new file mode 100644
index 0000000000..55d96b520c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-297-zeckendorf-representation.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4951000cf542c50ffa8
+title: 'Problem 297: Zeckendorf Representation'
+challengeType: 5
+forumTopicId: 301949
+dashedName: problem-297-zeckendorf-representation
+---
+
+# --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&lt;n&lt;106, ∑ z(n) = 7894453.
+
+Find ∑ z(n) for 0&lt;n&lt;1017.
+
+# --hints--
+
+`euler297()` should return 2252639041804718000.
+
+```js
+assert.strictEqual(euler297(), 2252639041804718000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler297() {
+
+  return true;
+}
+
+euler297();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
new file mode 100644
index 0000000000..a9c0c8ad7e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-298-selective-amnesia.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4971000cf542c50ffa9
+title: 'Problem 298: Selective Amnesia'
+challengeType: 5
+forumTopicId: 301950
+dashedName: problem-298-selective-amnesia
+---
+
+# --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 .
+
+# --hints--
+
+`euler298()` should return 1.76882294.
+
+```js
+assert.strictEqual(euler298(), 1.76882294);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler298() {
+
+  return true;
+}
+
+euler298();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
new file mode 100644
index 0000000000..586b589068
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-299-three-similar-triangles.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4971000cf542c50ffaa
+title: 'Problem 299: Three similar triangles'
+challengeType: 5
+forumTopicId: 301951
+dashedName: problem-299-three-similar-triangles
+---
+
+# --description--
+
+Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
+
+with 0 &lt; a &lt; b and 0 &lt; c &lt; 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 &lt; 100, there are 92 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists. If b+d &lt; 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
+
+# --hints--
+
+`euler299()` should return 549936643.
+
+```js
+assert.strictEqual(euler299(), 549936643);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler299() {
+
+  return true;
+}
+
+euler299();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
new file mode 100644
index 0000000000..0fbe58b9f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-3-largest-prime-factor.md
@@ -0,0 +1,95 @@
+---
+id: 5900f36f1000cf542c50fe82
+title: 'Problem 3: Largest prime factor'
+challengeType: 5
+forumTopicId: 301952
+dashedName: problem-3-largest-prime-factor
+---
+
+# --description--
+
+The prime factors of 13195 are 5, 7, 13 and 29.
+
+What is the largest prime factor of the given `number`?
+
+# --hints--
+
+`largestPrimeFactor(2)` should return a number.
+
+```js
+assert(typeof largestPrimeFactor(2) === 'number');
+```
+
+`largestPrimeFactor(2)` should return 2.
+
+```js
+assert.strictEqual(largestPrimeFactor(2), 2);
+```
+
+`largestPrimeFactor(3)` should return 3.
+
+```js
+assert.strictEqual(largestPrimeFactor(3), 3);
+```
+
+`largestPrimeFactor(5)` should return 5.
+
+```js
+assert.strictEqual(largestPrimeFactor(5), 5);
+```
+
+`largestPrimeFactor(7)` should return 7.
+
+```js
+assert.strictEqual(largestPrimeFactor(7), 7);
+```
+
+`largestPrimeFactor(8)` should return 2.
+
+```js
+assert.strictEqual(largestPrimeFactor(8), 2);
+```
+
+`largestPrimeFactor(13195)` should return 29.
+
+```js
+assert.strictEqual(largestPrimeFactor(13195), 29);
+```
+
+`largestPrimeFactor(600851475143)` should return 6857.
+
+```js
+assert.strictEqual(largestPrimeFactor(600851475143), 6857);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestPrimeFactor(number) {
+
+  return true;
+}
+
+largestPrimeFactor(13195);
+```
+
+# --solutions--
+
+```js
+const largestPrimeFactor = (number) => {
+  let largestFactor = number;
+
+  for (let i = 2; i <= Math.sqrt(largestFactor); i++) {
+    if (!(largestFactor % i)) {
+      let factor = largestFactor / i;
+      let candidate = largestPrimeFactor(factor);
+
+      return i > candidate ? i : candidate;
+    }
+  }
+
+  return largestFactor;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
new file mode 100644
index 0000000000..1eb7fd409b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-30-digit-n-powers.md
@@ -0,0 +1,74 @@
+---
+id: 5900f38a1000cf542c50fe9d
+title: 'Problem 30: Digit n powers'
+challengeType: 5
+forumTopicId: 301953
+dashedName: problem-30-digit-n-powers
+---
+
+# --description--
+
+Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
+
+<div style='margin-left: 4em;'>
+  1634 = 1<sup>4</sup> + 6<sup>4</sup> + 3<sup>4</sup> + 4<sup>4</sup><br>
+  8208 = 8<sup>4</sup> + 2<sup>4</sup> + 0<sup>4</sup> + 8<sup>4</sup><br>
+  9474 = 9<sup>4</sup> + 4<sup>4</sup> + 7<sup>4</sup> + 4<sup>4</sup><br>
+</div>
+
+As 1 = 1<sup>4</sup> 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 `n` powers of their digits.
+
+# --hints--
+
+`digitnPowers(2)` should return a number.
+
+```js
+assert(typeof digitnPowers(2) === 'number');
+```
+
+`digitnPowers(2)` should return 0.
+
+```js
+assert(digitnPowers(2) == 0);
+```
+
+`digitnPowers(3)` should return 1301.
+
+```js
+assert(digitnPowers(3) == 1301);
+```
+
+`digitnPowers(4)` should return 19316.
+
+```js
+assert(digitnPowers(4) == 19316);
+```
+
+`digitnPowers(5)` should return 443839.
+
+```js
+assert(digitnPowers(5) == 443839);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitnPowers(n) {
+
+  return n;
+}
+
+digitnPowers(5);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
new file mode 100644
index 0000000000..52c5f272c6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-300-protein-folding.md
@@ -0,0 +1,50 @@
+---
+id: 5900f49a1000cf542c50ffac
+title: 'Problem 300: Protein folding'
+challengeType: 5
+forumTopicId: 301954
+dashedName: problem-300-protein-folding
+---
+
+# --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.
+
+# --hints--
+
+`euler300()` should return 8.0540771484375.
+
+```js
+assert.strictEqual(euler300(), 8.0540771484375);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler300() {
+
+  return true;
+}
+
+euler300();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-301-nim.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-301-nim.md
new file mode 100644
index 0000000000..8197d8abf5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-301-nim.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4991000cf542c50ffab
+title: 'Problem 301: Nim'
+challengeType: 5
+forumTopicId: 301955
+dashedName: problem-301-nim
+---
+
+# --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 ?
+
+# --hints--
+
+`euler301()` should return 2178309.
+
+```js
+assert.strictEqual(euler301(), 2178309);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler301() {
+
+  return true;
+}
+
+euler301();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
new file mode 100644
index 0000000000..78c112d626
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-302-strong-achilles-numbers.md
@@ -0,0 +1,50 @@
+---
+id: 5900f49b1000cf542c50ffad
+title: 'Problem 302: Strong Achilles Numbers'
+challengeType: 5
+forumTopicId: 301956
+dashedName: problem-302-strong-achilles-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler302()` should return 1170060.
+
+```js
+assert.strictEqual(euler302(), 1170060);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler302() {
+
+  return true;
+}
+
+euler302();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
new file mode 100644
index 0000000000..1f9b36fad0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-303-multiples-with-small-digits.md
@@ -0,0 +1,44 @@
+---
+id: 5900f49b1000cf542c50ffae
+title: 'Problem 303: Multiples with small digits'
+challengeType: 5
+forumTopicId: 301957
+dashedName: problem-303-multiples-with-small-digits
+---
+
+# --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 .
+
+# --hints--
+
+`euler303()` should return 1111981904675169.
+
+```js
+assert.strictEqual(euler303(), 1111981904675169);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler303() {
+
+  return true;
+}
+
+euler303();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-304-primonacci.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
new file mode 100644
index 0000000000..aab56db553
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49d1000cf542c50ffaf
+title: 'Problem 304: Primonacci'
+challengeType: 5
+forumTopicId: 301958
+dashedName: problem-304-primonacci
+---
+
+# --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.
+
+# --hints--
+
+`euler304()` should return 283988410192.
+
+```js
+assert.strictEqual(euler304(), 283988410192);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler304() {
+
+  return true;
+}
+
+euler304();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
new file mode 100644
index 0000000000..c42f144038
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-305-reflexive-position.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49d1000cf542c50ffb0
+title: 'Problem 305: Reflexive Position'
+challengeType: 5
+forumTopicId: 301959
+dashedName: problem-305-reflexive-position
+---
+
+# --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.
+
+# --hints--
+
+`euler305()` should return 18174995535140.
+
+```js
+assert.strictEqual(euler305(), 18174995535140);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler305() {
+
+  return true;
+}
+
+euler305();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
new file mode 100644
index 0000000000..d750803f3b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-306-paper-strip-game.md
@@ -0,0 +1,46 @@
+---
+id: 5900f49f1000cf542c50ffb1
+title: 'Problem 306: Paper-strip Game'
+challengeType: 5
+forumTopicId: 301960
+dashedName: problem-306-paper-strip-game
+---
+
+# --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?
+
+# --hints--
+
+`euler306()` should return 852938.
+
+```js
+assert.strictEqual(euler306(), 852938);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler306() {
+
+  return true;
+}
+
+euler306();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
new file mode 100644
index 0000000000..eac5e7e113
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-307-chip-defects.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4a01000cf542c50ffb2
+title: 'Problem 307: Chip Defects'
+challengeType: 5
+forumTopicId: 301961
+dashedName: problem-307-chip-defects
+---
+
+# --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
+
+# --hints--
+
+`euler307()` should return 0.7311720251.
+
+```js
+assert.strictEqual(euler307(), 0.7311720251);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler307() {
+
+  return true;
+}
+
+euler307();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
new file mode 100644
index 0000000000..a0cfc2d8a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-308-an-amazing-prime-generating-automaton.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a11000cf542c50ffb3
+title: 'Problem 308: An amazing Prime-generating Automaton'
+challengeType: 5
+forumTopicId: 301962
+dashedName: problem-308-an-amazing-prime-generating-automaton
+---
+
+# --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 ?
+
+# --hints--
+
+`euler308()` should return 1539669807660924.
+
+```js
+assert.strictEqual(euler308(), 1539669807660924);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler308() {
+
+  return true;
+}
+
+euler308();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
new file mode 100644
index 0000000000..03d5603c1f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-309-integer-ladders.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4a11000cf542c50ffb4
+title: 'Problem 309: Integer Ladders'
+challengeType: 5
+forumTopicId: 301963
+dashedName: problem-309-integer-ladders
+---
+
+# --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 &lt; x &lt; y &lt; 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 &lt; x &lt; y &lt; 1 000 000, how many triplets (x,y,h) produce integer solutions for w?
+
+# --hints--
+
+`euler309()` should return 210139.
+
+```js
+assert.strictEqual(euler309(), 210139);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler309() {
+
+  return true;
+}
+
+euler309();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
new file mode 100644
index 0000000000..0826a685f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
@@ -0,0 +1,77 @@
+---
+id: 5900f38b1000cf542c50fe9e
+title: 'Problem 31: Coin sums'
+challengeType: 5
+forumTopicId: 301965
+dashedName: problem-31-coin-sums
+---
+
+# --description--
+
+In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
+
+<div style='margin-left: 4em;'>1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).</div>
+
+It is possible to make £2 in the following way:
+
+<div style='margin-left: 4em;'>1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p</div>
+
+How many different ways can `n` pence be made using any number of coins?
+
+# --hints--
+
+`coinSums(50)` should return a number.
+
+```js
+assert(typeof coinSums(50) === 'number');
+```
+
+`coinSums(50)` should return 451.
+
+```js
+assert(coinSums(50) == 451);
+```
+
+`coinSums(100)` should return 4563.
+
+```js
+assert(coinSums(100) == 4563);
+```
+
+`coinSums(150)` should return 21873.
+
+```js
+assert(coinSums(150) == 21873);
+```
+
+`coinSums(200)` should return 73682.
+
+```js
+assert(coinSums(200) == 73682);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function coinSums(n) {
+
+  return n;
+}
+
+coinSums(200);
+```
+
+# --solutions--
+
+```js
+const coinSums = (n) => {
+  const getWays = (n, m=8, c=[1, 2, 5, 10, 20, 50, 100, 200]) => {
+    if (n === 0) return 1;
+    if (m === 0 || n < 0) return 0;
+    return getWays(n - c[m - 1], m, c) + getWays(n, m - 1, c);
+  };
+  return getWays(n);
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-310-nim-square.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
new file mode 100644
index 0000000000..c93f2fd531
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a21000cf542c50ffb5
+title: 'Problem 310: Nim Square'
+challengeType: 5
+forumTopicId: 301966
+dashedName: problem-310-nim-square
+---
+
+# --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.
+
+# --hints--
+
+`euler310()` should return 2586528661783.
+
+```js
+assert.strictEqual(euler310(), 2586528661783);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler310() {
+
+  return true;
+}
+
+euler310();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
new file mode 100644
index 0000000000..b5aee9d2b5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-311-biclinic-integral-quadrilaterals.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4a31000cf542c50ffb6
+title: 'Problem 311: Biclinic Integral Quadrilaterals'
+challengeType: 5
+forumTopicId: 301967
+dashedName: problem-311-biclinic-integral-quadrilaterals
+---
+
+# --description--
+
+ABCD is a convex, integer sided quadrilateral with 1 ≤ AB &lt; BC &lt; CD &lt; 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).
+
+# --hints--
+
+`euler311()` should return 2466018557.
+
+```js
+assert.strictEqual(euler311(), 2466018557);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler311() {
+
+  return true;
+}
+
+euler311();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
new file mode 100644
index 0000000000..b9083a73f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-312-cyclic-paths-on-sierpiski-graphs.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a51000cf542c50ffb7
+title: 'Problem 312: Cyclic paths on Sierpiński graphs'
+challengeType: 5
+forumTopicId: 301968
+dashedName: problem-312-cyclic-paths-on-sierpiski-graphs
+---
+
+# --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.
+
+# --hints--
+
+`euler312()` should return 324681947.
+
+```js
+assert.strictEqual(euler312(), 324681947);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler312() {
+
+  return true;
+}
+
+euler312();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
new file mode 100644
index 0000000000..dd6ec7cfb3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-313-sliding-game.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4a61000cf542c50ffb8
+title: 'Problem 313: Sliding game'
+challengeType: 5
+forumTopicId: 301969
+dashedName: problem-313-sliding-game
+---
+
+# --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 &lt; 100 is prime.
+
+How many grids does S(m,n) = p2, where p &lt; 106 is prime?
+
+# --hints--
+
+`euler313()` should return 2057774861813004.
+
+```js
+assert.strictEqual(euler313(), 2057774861813004);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler313() {
+
+  return true;
+}
+
+euler313();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
new file mode 100644
index 0000000000..78cd0f1cf6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-314-the-mouse-on-the-moon.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4a71000cf542c50ffb9
+title: 'Problem 314: The Mouse on the Moon'
+challengeType: 5
+forumTopicId: 301970
+dashedName: problem-314-the-mouse-on-the-moon
+---
+
+# --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.
+
+# --hints--
+
+`euler314()` should return 132.52756426.
+
+```js
+assert.strictEqual(euler314(), 132.52756426);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler314() {
+
+  return true;
+}
+
+euler314();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
new file mode 100644
index 0000000000..38a2a69cca
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-315-digital-root-clocks.md
@@ -0,0 +1,58 @@
+---
+id: 5900f4a71000cf542c50ffba
+title: 'Problem 315: Digital root clocks'
+challengeType: 5
+forumTopicId: 301971
+dashedName: problem-315-digital-root-clocks
+---
+
+# --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.
+
+# --hints--
+
+`euler315()` should return 13625242.
+
+```js
+assert.strictEqual(euler315(), 13625242);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler315() {
+
+  return true;
+}
+
+euler315();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
new file mode 100644
index 0000000000..4a2821b24e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-316-numbers-in-decimal-expansions.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4a81000cf542c50ffbb
+title: 'Problem 316: Numbers in decimal expansions'
+challengeType: 5
+forumTopicId: 301972
+dashedName: problem-316-numbers-in-decimal-expansions
+---
+
+# --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.
+
+# --hints--
+
+`euler316()` should return 542934735751917760.
+
+```js
+assert.strictEqual(euler316(), 542934735751917760);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler316() {
+
+  return true;
+}
+
+euler316();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-317-firecracker.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
new file mode 100644
index 0000000000..bb528a225a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-317-firecracker.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4aa1000cf542c50ffbc
+title: 'Problem 317: Firecracker'
+challengeType: 5
+forumTopicId: 301973
+dashedName: problem-317-firecracker
+---
+
+# --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.
+
+# --hints--
+
+`euler317()` should return 1856532.8455.
+
+```js
+assert.strictEqual(euler317(), 1856532.8455);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler317() {
+
+  return true;
+}
+
+euler317();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
new file mode 100644
index 0000000000..1e8e9b8821
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-318-2011-nines.md
@@ -0,0 +1,68 @@
+---
+id: 5900f4ab1000cf542c50ffbd
+title: 'Problem 318: 2011 nines'
+challengeType: 5
+forumTopicId: 301974
+dashedName: problem-318-2011-nines
+---
+
+# --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&lt;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.
+
+# --hints--
+
+`euler318()` should return 709313889.
+
+```js
+assert.strictEqual(euler318(), 709313889);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler318() {
+
+  return true;
+}
+
+euler318();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
new file mode 100644
index 0000000000..687eeb26cd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-319-bounded-sequences.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4ab1000cf542c50ffbe
+title: 'Problem 319: Bounded Sequences'
+challengeType: 5
+forumTopicId: 301975
+dashedName: problem-319-bounded-sequences
+---
+
+# --description--
+
+Let x1, x2,..., xn be a sequence of length n such that:
+
+x1 = 2
+
+for all 1 &lt; i ≤ n : xi-1 &lt; xi
+
+for all i and j with 1 ≤ i, j ≤ n : (xi) j &lt; (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.
+
+# --hints--
+
+`euler319()` should return 268457129.
+
+```js
+assert.strictEqual(euler319(), 268457129);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler319() {
+
+  return true;
+}
+
+euler319();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
new file mode 100644
index 0000000000..fe1724d44f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-32-pandigital-products.md
@@ -0,0 +1,118 @@
+---
+id: 5900f38c1000cf542c50fe9f
+title: 'Problem 32: Pandigital products'
+challengeType: 5
+forumTopicId: 301976
+dashedName: problem-32-pandigital-products
+---
+
+# --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 `n` pandigital.
+
+**Hint:** Some products can be obtained in more than one way so be sure to only include it once in your sum.
+
+# --hints--
+
+`pandigitalProducts(4)` should return a number.
+
+```js
+assert(typeof pandigitalProducts(4) === 'number');
+```
+
+`pandigitalProducts(4)` should return `12`.
+
+```js
+assert.strictEqual(pandigitalProducts(4), 12);
+```
+
+`pandigitalProducts(6)` should return `162`.
+
+```js
+assert.strictEqual(pandigitalProducts(6), 162);
+```
+
+`pandigitalProducts(7)` should return `0`.
+
+```js
+assert.strictEqual(pandigitalProducts(7), 0);
+```
+
+`pandigitalProducts(8)` should return `13458`.
+
+```js
+assert.strictEqual(pandigitalProducts(8), 13458);
+```
+
+`pandigitalProducts(9)` should return `45228`.
+
+```js
+assert.strictEqual(pandigitalProducts(9), 45228);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalProducts(n) {
+
+  return true;
+}
+
+pandigitalProducts(4);
+```
+
+# --solutions--
+
+```js
+function pandigitalProducts(n) {
+  function is1toNPandigital(n, digitStr) {
+    // check if length is n
+    if (digitStr.length !== n) {
+      return false;
+    }
+    // check if pandigital
+    for (let i = digitStr.length; i > 0; i--) {
+      if (digitStr.indexOf(i.toString()) === -1) {
+        return false;
+      }
+    }
+    return true;
+  }
+  function concatenateNums(...numbers) {
+    let digitStr = '';
+    for (let i = 0; i < numbers.length; i++) {
+      digitStr += numbers[i].toString();
+    }
+    return digitStr;
+  }
+
+  const pandigitalNums = [];
+  const limit = 10 ** Math.floor(n / 2) - 1;
+  let sum = 0;
+  for (let mult1 = 2; mult1 < limit; mult1++) {
+    for (let mult2 = 2; mult2 < limit; mult2++) {
+      const product = mult1 * mult2;
+      const concatenated = concatenateNums(mult1, mult2, product);
+      if (concatenated.length > n) {
+        break;
+      } else if (concatenated.length < n) {
+        continue;
+      }
+      if (
+        is1toNPandigital(n, concatenated) &&
+        !pandigitalNums.includes(product)
+      ) {
+        pandigitalNums.push(product);
+        sum += product;
+      }
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
new file mode 100644
index 0000000000..5171172f98
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ae1000cf542c50ffbf
+title: 'Problem 320: Factorials divisible by a huge integer'
+challengeType: 5
+forumTopicId: 301977
+dashedName: problem-320-factorials-divisible-by-a-huge-integer
+---
+
+# --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.
+
+# --hints--
+
+`euler320()` should return 278157919195482660.
+
+```js
+assert.strictEqual(euler320(), 278157919195482660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler320() {
+
+  return true;
+}
+
+euler320();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
new file mode 100644
index 0000000000..34e52a4dea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-321-swapping-counters.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ae1000cf542c50ffc0
+title: 'Problem 321: Swapping Counters'
+challengeType: 5
+forumTopicId: 301978
+dashedName: problem-321-swapping-counters
+---
+
+# --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.
+
+# --hints--
+
+`euler321()` should return 2470433131948040.
+
+```js
+assert.strictEqual(euler321(), 2470433131948040);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler321() {
+
+  return true;
+}
+
+euler321();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
new file mode 100644
index 0000000000..241c3a74f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4af1000cf542c50ffc1
+title: 'Problem 322: Binomial coefficients divisible by 10'
+challengeType: 5
+forumTopicId: 301979
+dashedName: problem-322-binomial-coefficients-divisible-by-10
+---
+
+# --description--
+
+Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i &lt; m(i, m and n are positive integers).
+
+You are given that T(109, 107-10) = 989697000.
+
+Find T(1018, 1012-10).
+
+# --hints--
+
+`euler322()` should return 999998760323314000.
+
+```js
+assert.strictEqual(euler322(), 999998760323314000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler322() {
+
+  return true;
+}
+
+euler322();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
new file mode 100644
index 0000000000..b336759562
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-operations-on-random-integers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b01000cf542c50ffc2
+title: 'Problem 323: Bitwise-OR operations on random integers'
+challengeType: 5
+forumTopicId: 301980
+dashedName: problem-323-bitwise-or-operations-on-random-integers
+---
+
+# --description--
+
+Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers
+
+(i.e. 0 ≤ yi &lt; 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.
+
+# --hints--
+
+`euler323()` should return 6.3551758451.
+
+```js
+assert.strictEqual(euler323(), 6.3551758451);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler323() {
+
+  return true;
+}
+
+euler323();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
new file mode 100644
index 0000000000..66ce491477
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-324-building-a-tower.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4b11000cf542c50ffc3
+title: 'Problem 324: Building a tower'
+challengeType: 5
+forumTopicId: 301981
+dashedName: problem-324-building-a-tower
+---
+
+# --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.
+
+# --hints--
+
+`euler324()` should return 96972774.
+
+```js
+assert.strictEqual(euler324(), 96972774);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler324() {
+
+  return true;
+}
+
+euler324();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
new file mode 100644
index 0000000000..6d0389b9fa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-325-stone-game-ii.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b11000cf542c50ffc4
+title: 'Problem 325: Stone Game II'
+challengeType: 5
+forumTopicId: 301982
+dashedName: problem-325-stone-game-ii
+---
+
+# --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 &lt; xi &lt; yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.
+
+Find S(1016) mod 710.
+
+# --hints--
+
+`euler325()` should return 54672965.
+
+```js
+assert.strictEqual(euler325(), 54672965);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler325() {
+
+  return true;
+}
+
+euler325();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
new file mode 100644
index 0000000000..1e6b648d9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-326-modulo-summations.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b21000cf542c50ffc5
+title: 'Problem 326: Modulo Summations'
+challengeType: 5
+forumTopicId: 301983
+dashedName: problem-326-modulo-summations
+---
+
+# --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).
+
+# --hints--
+
+`euler326()` should return 1966666166408794400.
+
+```js
+assert.strictEqual(euler326(), 1966666166408794400);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler326() {
+
+  return true;
+}
+
+euler326();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
new file mode 100644
index 0000000000..354596b1d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-327-rooms-of-doom.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4b31000cf542c50ffc6
+title: 'Problem 327: Rooms of Doom'
+challengeType: 5
+forumTopicId: 301984
+dashedName: problem-327-rooms-of-doom
+---
+
+# --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.
+
+# --hints--
+
+`euler327()` should return 34315549139516.
+
+```js
+assert.strictEqual(euler327(), 34315549139516);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler327() {
+
+  return true;
+}
+
+euler327();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
new file mode 100644
index 0000000000..4a00f455cc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-328-lowest-cost-search.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4b41000cf542c50ffc7
+title: 'Problem 328: Lowest-cost Search'
+challengeType: 5
+forumTopicId: 301985
+dashedName: problem-328-lowest-cost-search
+---
+
+# --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).
+
+# --hints--
+
+`euler328()` should return 260511850222.
+
+```js
+assert.strictEqual(euler328(), 260511850222);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler328() {
+
+  return true;
+}
+
+euler328();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
new file mode 100644
index 0000000000..6b1e185daf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-329-prime-frog.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4b51000cf542c50ffc8
+title: 'Problem 329: Prime Frog'
+challengeType: 5
+forumTopicId: 301986
+dashedName: problem-329-prime-frog
+---
+
+# --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.
+
+# --hints--
+
+`euler329()` should return 199740353 / 29386561536000.
+
+```js
+assert.strictEqual(euler329(), 199740353 / 29386561536000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler329() {
+
+  return true;
+}
+
+euler329();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
new file mode 100644
index 0000000000..ec7756e945
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-33-digit-cancelling-fractions.md
@@ -0,0 +1,102 @@
+---
+id: 5900f38d1000cf542c50fea0
+title: 'Problem 33: Digit cancelling fractions'
+challengeType: 5
+forumTopicId: 301987
+dashedName: problem-33-digit-cancelling-fractions
+---
+
+# --description--
+
+The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct, is obtained by cancelling the 9s.
+
+We shall consider fractions like, <sup>30</sup>/<sub>50</sub> = <sup>3</sup>/<sub>5</sub>, 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.
+
+# --hints--
+
+`digitCancellingFractions()` should return a number.
+
+```js
+assert(typeof digitCancellingFractions() === 'number');
+```
+
+`digitCancellingFractions()` should return 100.
+
+```js
+assert.strictEqual(digitCancellingFractions(), 100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitCancellingFractions() {
+
+  return true;
+}
+
+digitCancellingFractions();
+```
+
+# --solutions--
+
+```js
+function digitCancellingFractions() {
+  function isCurious(numerator, denominator) {
+    const fraction = numerator / denominator;
+    const numString = numerator.toString();
+    const denString = denominator.toString();
+
+    if (numString[1] === '0' && denString[1] === '0') {
+      // trivial
+      return false;
+    }
+    for (let i = 0; i < 2; i++) {
+      for (let j = 0; j < 2; j++) {
+        if (numString[i] === denString[j]) {
+          const newNum = parseInt(numString[1 - i], 10);
+          const newDen = parseInt(denString[1 - j], 10);
+          if (newNum / newDen === fraction) {
+            return true;
+          }
+        }
+      }
+    }
+    return false;
+  }
+  function findLargestDivisor(a, b) {
+    let gcd = a > b ? b : a;
+    while (gcd > 1) {
+      if (a % gcd === 0 && b % gcd === 0) {
+        return gcd;
+      }
+      gcd--;
+    }
+    return gcd;
+  }
+
+  function simplifyFraction(numerator, denominator) {
+    const divisor = findLargestDivisor(numerator, denominator);
+    return [numerator / divisor, denominator / divisor];
+  }
+
+  let multipleNumerator = 1;
+  let multipleDenominator = 1;
+
+  for (let denominator = 11; denominator < 100; denominator++) {
+    for (let numerator = 10; numerator < denominator; numerator++) {
+      if (isCurious(numerator, denominator)) {
+        multipleNumerator *= numerator;
+        multipleDenominator *= denominator;
+      }
+    }
+  }
+
+  return simplifyFraction(multipleNumerator, multipleDenominator)[1];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-330-eulers-number.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
new file mode 100644
index 0000000000..c8a3feab39
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-330-eulers-number.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4b71000cf542c50ffc9
+title: 'Problem 330: Euler''s Number'
+challengeType: 5
+forumTopicId: 301988
+dashedName: problem-330-eulers-number
+---
+
+# --description--
+
+An infinite sequence of real numbers a(n) is defined for all integers n as follows:
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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.
+
+# --hints--
+
+`euler330()` should return 15955822.
+
+```js
+assert.strictEqual(euler330(), 15955822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler330() {
+
+  return true;
+}
+
+euler330();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
new file mode 100644
index 0000000000..4d3d330a74
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-331-cross-flips.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b71000cf542c50ffca
+title: 'Problem 331: Cross flips'
+challengeType: 5
+forumTopicId: 301989
+dashedName: problem-331-cross-flips
+---
+
+# --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 .
+
+# --hints--
+
+`euler331()` should return 467178235146843500.
+
+```js
+assert.strictEqual(euler331(), 467178235146843500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler331() {
+
+  return true;
+}
+
+euler331();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
new file mode 100644
index 0000000000..ea3a4d0c43
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-332-spherical-triangles.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4b91000cf542c50ffcb
+title: 'Problem 332: Spherical triangles'
+challengeType: 5
+forumTopicId: 301990
+dashedName: problem-332-spherical-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler332()` should return 2717.751525.
+
+```js
+assert.strictEqual(euler332(), 2717.751525);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler332() {
+
+  return true;
+}
+
+euler332();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
new file mode 100644
index 0000000000..5af490eb7e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-333-special-partitions.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4b91000cf542c50ffcc
+title: 'Problem 333: Special partitions'
+challengeType: 5
+forumTopicId: 301991
+dashedName: problem-333-special-partitions
+---
+
+# --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 &lt;100 such that P(q)=1 equals 233.
+
+Find the sum of the primes q &lt;1000000 such that P(q)=1.
+
+# --hints--
+
+`euler333()` should return 3053105.
+
+```js
+assert.strictEqual(euler333(), 3053105);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler333() {
+
+  return true;
+}
+
+euler333();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
new file mode 100644
index 0000000000..fe354cec8a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-334-spilling-the-beans.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4ba1000cf542c50ffcd
+title: 'Problem 334: Spilling the beans'
+challengeType: 5
+forumTopicId: 301992
+dashedName: problem-334-spilling-the-beans
+---
+
+# --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:
+
+<!-- TODO Use MathJax and re-write from projecteuler.net -->
+
+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.
+
+# --hints--
+
+`euler334()` should return 150320021261690850.
+
+```js
+assert.strictEqual(euler334(), 150320021261690850);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler334() {
+
+  return true;
+}
+
+euler334();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
new file mode 100644
index 0000000000..0605e0d053
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-335-gathering-the-beans.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4bd1000cf542c50ffce
+title: 'Problem 335: Gathering the beans'
+challengeType: 5
+forumTopicId: 301993
+dashedName: problem-335-gathering-the-beans
+---
+
+# --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.
+
+# --hints--
+
+`euler335()` should return 5032316.
+
+```js
+assert.strictEqual(euler335(), 5032316);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler335() {
+
+  return true;
+}
+
+euler335();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
new file mode 100644
index 0000000000..3dbf18111c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-336-maximix-arrangements.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4bd1000cf542c50ffcf
+title: 'Problem 336: Maximix Arrangements'
+challengeType: 5
+forumTopicId: 301994
+dashedName: problem-336-maximix-arrangements
+---
+
+# --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.
+
+# --hints--
+
+`euler336()` should return CAGBIHEFJDK.
+
+```js
+assert.strictEqual(euler336(), CAGBIHEFJDK);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler336() {
+
+  return true;
+}
+
+euler336();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
new file mode 100644
index 0000000000..677c918f05
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-337-totient-stairstep-sequences.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4be1000cf542c50ffd0
+title: 'Problem 337: Totient Stairstep Sequences'
+challengeType: 5
+forumTopicId: 301995
+dashedName: problem-337-totient-stairstep-sequences
+---
+
+# --description--
+
+Let {a1, a2,..., an} be an integer sequence of length n such that:
+
+a1 = 6
+
+for all 1 ≤ i &lt; n : φ(ai) &lt; φ(ai+1) &lt; ai &lt; 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.
+
+# --hints--
+
+`euler337()` should return 85068035.
+
+```js
+assert.strictEqual(euler337(), 85068035);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler337() {
+
+  return true;
+}
+
+euler337();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
new file mode 100644
index 0000000000..514dc560b0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-338-cutting-rectangular-grid-paper.md
@@ -0,0 +1,50 @@
+---
+id: 5900f4be1000cf542c50ffd1
+title: 'Problem 338: Cutting Rectangular Grid Paper'
+challengeType: 5
+forumTopicId: 301996
+dashedName: problem-338-cutting-rectangular-grid-paper
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler338()` should return 15614292.
+
+```js
+assert.strictEqual(euler338(), 15614292);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler338() {
+
+  return true;
+}
+
+euler338();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
new file mode 100644
index 0000000000..6844c7e65c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-339-peredur-fab-efrawg.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c01000cf542c50ffd2
+title: 'Problem 339: Peredur fab Efrawg'
+challengeType: 5
+forumTopicId: 301997
+dashedName: problem-339-peredur-fab-efrawg
+---
+
+# --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.
+
+# --hints--
+
+`euler339()` should return 19823.542204.
+
+```js
+assert.strictEqual(euler339(), 19823.542204);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler339() {
+
+  return true;
+}
+
+euler339();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
new file mode 100644
index 0000000000..080d068344
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md
@@ -0,0 +1,50 @@
+---
+id: 5900f38e1000cf542c50fea1
+title: 'Problem 34: Digit factorials'
+challengeType: 5
+forumTopicId: 301998
+dashedName: problem-34-digit-factorials
+---
+
+# --description--
+
+145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
+
+Find the numbers and the sum of the 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.
+
+# --hints--
+
+`digitFactorial()` should return an object.
+
+```js
+assert.typeOf(digitFactorial(), 'object');
+```
+
+`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }.
+
+```js
+assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFactorial() {
+
+  var sum = 0;
+  var numbers = [];
+  return { sum, numbers };
+}
+
+digitFactorial();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
new file mode 100644
index 0000000000..86b29f061e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-340-crazy-function.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4c21000cf542c50ffd4
+title: 'Problem 340: Crazy Function'
+challengeType: 5
+forumTopicId: 301999
+dashedName: problem-340-crazy-function
+---
+
+# --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).
+
+# --hints--
+
+`euler340()` should return 291504964.
+
+```js
+assert.strictEqual(euler340(), 291504964);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler340() {
+
+  return true;
+}
+
+euler340();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
new file mode 100644
index 0000000000..740ef0d751
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4c11000cf542c50ffd3
+title: 'Problem 341: Golomb''s self-describing sequence'
+challengeType: 5
+forumTopicId: 302000
+dashedName: problem-341-golombs-self-describing-sequence
+---
+
+# --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 &lt; 103.
+
+Find ΣG(n3) for 1 ≤ n &lt; 106.
+
+# --hints--
+
+`euler341()` should return 56098610614277016.
+
+```js
+assert.strictEqual(euler341(), 56098610614277016);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler341() {
+
+  return true;
+}
+
+euler341();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
new file mode 100644
index 0000000000..2253ce390f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-342-the-totient-of-a-square-is-a-cube.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4c31000cf542c50ffd5
+title: 'Problem 342: The totient of a square is a cube'
+challengeType: 5
+forumTopicId: 302001
+dashedName: problem-342-the-totient-of-a-square-is-a-cube
+---
+
+# --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 &lt; 1010 such that φ(n2) is a cube.
+
+1 φ denotes Euler's totient function.
+
+# --hints--
+
+`euler342()` should return 5943040885644.
+
+```js
+assert.strictEqual(euler342(), 5943040885644);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler342() {
+
+  return true;
+}
+
+euler342();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
new file mode 100644
index 0000000000..3102009e8c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-343-fractional-sequences.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4c41000cf542c50ffd6
+title: 'Problem 343: Fractional Sequences'
+challengeType: 5
+forumTopicId: 302002
+dashedName: problem-343-fractional-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler343()` should return 269533451410884200.
+
+```js
+assert.strictEqual(euler343(), 269533451410884200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler343() {
+
+  return true;
+}
+
+euler343();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
new file mode 100644
index 0000000000..f4fb768b65
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-344-silver-dollar-game.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4c51000cf542c50ffd7
+title: 'Problem 344: Silver dollar game'
+challengeType: 5
+forumTopicId: 302003
+dashedName: problem-344-silver-dollar-game
+---
+
+# --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).
+
+# --hints--
+
+`euler344()` should return 65579304332.
+
+```js
+assert.strictEqual(euler344(), 65579304332);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler344() {
+
+  return true;
+}
+
+euler344();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
new file mode 100644
index 0000000000..9cb8157d07
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-345-matrix-sum.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4c81000cf542c50ffda
+title: 'Problem 345: Matrix Sum'
+challengeType: 5
+forumTopicId: 302004
+dashedName: problem-345-matrix-sum
+---
+
+# --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
+
+# --hints--
+
+`euler345()` should return 13938.
+
+```js
+assert.strictEqual(euler345(), 13938);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler345() {
+
+  return true;
+}
+
+euler345();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
new file mode 100644
index 0000000000..49a1f6b2c2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-346-strong-repunits.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c71000cf542c50ffd8
+title: 'Problem 346: Strong Repunits'
+challengeType: 5
+forumTopicId: 302005
+dashedName: problem-346-strong-repunits
+---
+
+# --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.
+
+# --hints--
+
+`euler346()` should return 336108797689259260.
+
+```js
+assert.strictEqual(euler346(), 336108797689259260);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler346() {
+
+  return true;
+}
+
+euler346();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
new file mode 100644
index 0000000000..70845508fa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-347-largest-integer-divisible-by-two-primes.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4c81000cf542c50ffd9
+title: 'Problem 347: Largest integer divisible by two primes'
+challengeType: 5
+forumTopicId: 302006
+dashedName: problem-347-largest-integer-divisible-by-two-primes
+---
+
+# --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).
+
+# --hints--
+
+`euler347()` should return 11109800204052.
+
+```js
+assert.strictEqual(euler347(), 11109800204052);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler347() {
+
+  return true;
+}
+
+euler347();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
new file mode 100644
index 0000000000..2fe6e2bc13
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-348-sum-of-a-square-and-a-cube.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4c81000cf542c50ffdb
+title: 'Problem 348: Sum of a square and a cube'
+challengeType: 5
+forumTopicId: 302007
+dashedName: problem-348-sum-of-a-square-and-a-cube
+---
+
+# --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.
+
+# --hints--
+
+`euler348()` should return 1004195061.
+
+```js
+assert.strictEqual(euler348(), 1004195061);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler348() {
+
+  return true;
+}
+
+euler348();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
new file mode 100644
index 0000000000..e73c284fff
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-349-langtons-ant.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ca1000cf542c50ffdc
+title: 'Problem 349: Langton''s ant'
+challengeType: 5
+forumTopicId: 302008
+dashedName: problem-349-langtons-ant
+---
+
+# --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?
+
+# --hints--
+
+`euler349()` should return 115384615384614940.
+
+```js
+assert.strictEqual(euler349(), 115384615384614940);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler349() {
+
+  return true;
+}
+
+euler349();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
new file mode 100644
index 0000000000..9abfdee8ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-35-circular-primes.md
@@ -0,0 +1,132 @@
+---
+id: 5900f38f1000cf542c50fea2
+title: 'Problem 35: Circular primes'
+challengeType: 5
+forumTopicId: 302009
+dashedName: problem-35-circular-primes
+---
+
+# --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 `n`, whereas 100 ≤ `n` ≤ 1000000?
+
+**Note:**  
+
+Circular primes individual rotation can exceed `n`.
+
+# --hints--
+
+`circularPrimes(100)` should return a number.
+
+```js
+assert(typeof circularPrimes(100) === 'number');
+```
+
+`circularPrimes(100)` should return 13.
+
+```js
+assert(circularPrimes(100) == 13);
+```
+
+`circularPrimes(100000)` should return 43.
+
+```js
+assert(circularPrimes(100000) == 43);
+```
+
+`circularPrimes(250000)` should return 45.
+
+```js
+assert(circularPrimes(250000) == 45);
+```
+
+`circularPrimes(500000)` should return 49.
+
+```js
+assert(circularPrimes(500000) == 49);
+```
+
+`circularPrimes(750000)` should return 49.
+
+```js
+assert(circularPrimes(750000) == 49);
+```
+
+`circularPrimes(1000000)` should return 55.
+
+```js
+assert(circularPrimes(1000000) == 55);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function circularPrimes(n) {
+
+  return n;
+}
+
+circularPrimes(1000000);
+```
+
+# --solutions--
+
+```js
+function rotate(n) {
+  if (n.length == 1) return n;
+  return n.slice(1) + n[0];
+}
+
+function circularPrimes(n) {
+  // Nearest n < 10^k
+  const bound = 10 ** Math.ceil(Math.log10(n));
+  const primes = [0, 0, 2];
+  let count = 0;
+
+  // Making primes array
+  for (let i = 4; i <= bound; i += 2) {
+    primes.push(i - 1);
+    primes.push(0);
+  }
+
+  // Getting upperbound
+  const upperBound = Math.ceil(Math.sqrt(bound));
+
+  // Setting other non-prime numbers to 0
+  for (let i = 3; i < upperBound; i += 2) {
+    if (primes[i]) {
+      for (let j = i * i; j < bound; j += i) {
+        primes[j] = 0;
+      }
+    }
+  }
+
+  // Iterating through the array
+  for (let i = 2; i < n; i++) {
+    if (primes[i]) {
+      let curr = String(primes[i]);
+      let tmp = 1; // tmp variable to hold the no of rotations
+      for (let x = rotate(curr); x != curr; x = rotate(x)) {
+        if (x > n && primes[x]) {
+          continue;
+        }
+        else if (!primes[x]) {
+          // If the rotated value is 0 then it isn't a circular prime, break the loop
+          tmp = 0;
+          break;
+        }
+        tmp++;
+        primes[x] = 0;
+      }
+      count += tmp;
+    }
+  }
+  return count;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
new file mode 100644
index 0000000000..ebc52998b5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-350-constraining-the-least-greatest-and-the-greatest-least.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4cb1000cf542c50ffdd
+title: 'Problem 350: Constraining the least greatest and the greatest least'
+challengeType: 5
+forumTopicId: 302010
+dashedName: problem-350-constraining-the-least-greatest-and-the-greatest-least
+---
+
+# --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.
+
+# --hints--
+
+`euler350()` should return 84664213.
+
+```js
+assert.strictEqual(euler350(), 84664213);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler350() {
+
+  return true;
+}
+
+euler350();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
new file mode 100644
index 0000000000..33f0089171
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-351-hexagonal-orchards.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4cb1000cf542c50ffde
+title: 'Problem 351: Hexagonal orchards'
+challengeType: 5
+forumTopicId: 302011
+dashedName: problem-351-hexagonal-orchards
+---
+
+# --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).
+
+# --hints--
+
+`euler351()` should return 11762187201804552.
+
+```js
+assert.strictEqual(euler351(), 11762187201804552);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler351() {
+
+  return true;
+}
+
+euler351();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
new file mode 100644
index 0000000000..76af2f075c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-352-blood-tests.md
@@ -0,0 +1,56 @@
+---
+id: 5900f4cd1000cf542c50ffdf
+title: 'Problem 352: Blood tests'
+challengeType: 5
+forumTopicId: 302012
+dashedName: problem-352-blood-tests
+---
+
+# --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.
+
+# --hints--
+
+`euler352()` should return 378563.260589.
+
+```js
+assert.strictEqual(euler352(), 378563.260589);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler352() {
+
+  return true;
+}
+
+euler352();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
new file mode 100644
index 0000000000..74faf24c26
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-353-risky-moon.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4cd1000cf542c50ffe0
+title: 'Problem 353: Risky moon'
+challengeType: 5
+forumTopicId: 302013
+dashedName: problem-353-risky-moon
+---
+
+# --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.
+
+# --hints--
+
+`euler353()` should return 1.2759860331.
+
+```js
+assert.strictEqual(euler353(), 1.2759860331);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler353() {
+
+  return true;
+}
+
+euler353();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
new file mode 100644
index 0000000000..346a1af451
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-354-distances-in-a-bees-honeycomb.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4cf1000cf542c50ffe1
+title: 'Problem 354: Distances in a bee''s honeycomb'
+challengeType: 5
+forumTopicId: 302014
+dashedName: problem-354-distances-in-a-bees-honeycomb
+---
+
+# --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.
+
+# --hints--
+
+`euler354()` should return 58065134.
+
+```js
+assert.strictEqual(euler354(), 58065134);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler354() {
+
+  return true;
+}
+
+euler354();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
new file mode 100644
index 0000000000..a166a1057a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-355-maximal-coprime-subset.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4d01000cf542c50ffe2
+title: 'Problem 355: Maximal coprime subset'
+challengeType: 5
+forumTopicId: 302015
+dashedName: problem-355-maximal-coprime-subset
+---
+
+# --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).
+
+# --hints--
+
+`euler355()` should return 1726545007.
+
+```js
+assert.strictEqual(euler355(), 1726545007);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler355() {
+
+  return true;
+}
+
+euler355();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
new file mode 100644
index 0000000000..9027dcecf9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4d01000cf542c50ffe3
+title: 'Problem 356: Largest roots of cubic polynomials'
+challengeType: 5
+forumTopicId: 302016
+dashedName: problem-356-largest-roots-of-cubic-polynomials
+---
+
+# --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.
+
+# --hints--
+
+`euler356()` should return 28010159.
+
+```js
+assert.strictEqual(euler356(), 28010159);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler356() {
+
+  return true;
+}
+
+euler356();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
new file mode 100644
index 0000000000..1bb3f094a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-357-prime-generating-integers.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4d11000cf542c50ffe4
+title: 'Problem 357: Prime generating integers'
+challengeType: 5
+forumTopicId: 302017
+dashedName: problem-357-prime-generating-integers
+---
+
+# --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.
+
+# --hints--
+
+`euler357()` should return 1739023853137.
+
+```js
+assert.strictEqual(euler357(), 1739023853137);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler357() {
+
+  return true;
+}
+
+euler357();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
new file mode 100644
index 0000000000..fb08a667a8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-358-cyclic-numbers.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d21000cf542c50ffe5
+title: 'Problem 358: Cyclic numbers'
+challengeType: 5
+forumTopicId: 302018
+dashedName: problem-358-cyclic-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler358()` should return 3284144505.
+
+```js
+assert.strictEqual(euler358(), 3284144505);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler358() {
+
+  return true;
+}
+
+euler358();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
new file mode 100644
index 0000000000..971ae0f401
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-359-hilberts-new-hotel.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d31000cf542c50ffe6
+title: 'Problem 359: Hilbert''s New Hotel'
+challengeType: 5
+forumTopicId: 302019
+dashedName: problem-359-hilberts-new-hotel
+---
+
+# --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.
+
+# --hints--
+
+`euler359()` should return 40632119.
+
+```js
+assert.strictEqual(euler359(), 40632119);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler359() {
+
+  return true;
+}
+
+euler359();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
new file mode 100644
index 0000000000..359211b530
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-36-double-base-palindromes.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3901000cf542c50fea3
+title: 'Problem 36: Double-base palindromes'
+challengeType: 5
+forumTopicId: 302020
+dashedName: problem-36-double-base-palindromes
+---
+
+# --description--
+
+The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
+
+Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, which are palindromic in base 10 and base 2.
+
+(Please note that the palindromic number, in either base, may not include leading zeros.)
+
+# --hints--
+
+`doubleBasePalindromes(1000)` should return a number.
+
+```js
+assert(typeof doubleBasePalindromes(1000) === 'number');
+```
+
+`doubleBasePalindromes(1000)` should return 1772.
+
+```js
+assert(doubleBasePalindromes(1000) == 1772);
+```
+
+`doubleBasePalindromes(50000)` should return 105795.
+
+```js
+assert(doubleBasePalindromes(50000) == 105795);
+```
+
+`doubleBasePalindromes(500000)` should return 286602.
+
+```js
+assert(doubleBasePalindromes(500000) == 286602);
+```
+
+`doubleBasePalindromes(1000000)` should return 872187.
+
+```js
+assert(doubleBasePalindromes(1000000) == 872187);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function doubleBasePalindromes(n) {
+
+  return n;
+}
+
+doubleBasePalindromes(1000000);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
new file mode 100644
index 0000000000..f028a5d58b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-360-scary-sphere.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4d41000cf542c50ffe7
+title: 'Problem 360: Scary Sphere'
+challengeType: 5
+forumTopicId: 302021
+dashedName: problem-360-scary-sphere
+---
+
+# --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).
+
+# --hints--
+
+`euler360()` should return 878825614395267100.
+
+```js
+assert.strictEqual(euler360(), 878825614395267100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler360() {
+
+  return true;
+}
+
+euler360();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
new file mode 100644
index 0000000000..bc13159789
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-361-subsequence-of-thue-morse-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4d51000cf542c50ffe8
+title: 'Problem 361: Subsequence of Thue-Morse sequence'
+challengeType: 5
+forumTopicId: 302022
+dashedName: problem-361-subsequence-of-thue-morse-sequence
+---
+
+# --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 .
+
+# --hints--
+
+`euler361()` should return 178476944.
+
+```js
+assert.strictEqual(euler361(), 178476944);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler361() {
+
+  return true;
+}
+
+euler361();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
new file mode 100644
index 0000000000..4d6bc3f4a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-362-squarefree-factors.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4d61000cf542c50ffe9
+title: 'Problem 362: Squarefree factors'
+challengeType: 5
+forumTopicId: 302023
+dashedName: problem-362-squarefree-factors
+---
+
+# --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).
+
+# --hints--
+
+`euler362()` should return 457895958010.
+
+```js
+assert.strictEqual(euler362(), 457895958010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler362() {
+
+  return true;
+}
+
+euler362();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
new file mode 100644
index 0000000000..2fde41d1eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-363-bzier-curves.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d91000cf542c50ffeb
+title: 'Problem 363: Bézier Curves'
+challengeType: 5
+forumTopicId: 302024
+dashedName: problem-363-bzier-curves
+---
+
+# --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.
+
+# --hints--
+
+`euler363()` should return 0.0000372091.
+
+```js
+assert.strictEqual(euler363(), 0.0000372091);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler363() {
+
+  return true;
+}
+
+euler363();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
new file mode 100644
index 0000000000..84637798b8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-364-comfortable-distance.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4d91000cf542c50ffea
+title: 'Problem 364: Comfortable distance'
+challengeType: 5
+forumTopicId: 302025
+dashedName: problem-364-comfortable-distance
+---
+
+# --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.
+
+# --hints--
+
+`euler364()` should return 44855254.
+
+```js
+assert.strictEqual(euler364(), 44855254);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler364() {
+
+  return true;
+}
+
+euler364();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
new file mode 100644
index 0000000000..1647ff46ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-365-a-huge-binomial-coefficient.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4da1000cf542c50ffec
+title: 'Problem 365: A huge binomial coefficient'
+challengeType: 5
+forumTopicId: 302026
+dashedName: problem-365-a-huge-binomial-coefficient
+---
+
+# --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&lt;p&lt;q&lt;r&lt;5000 and p,q,r prime.
+
+# --hints--
+
+`euler365()` should return 162619462356610300.
+
+```js
+assert.strictEqual(euler365(), 162619462356610300);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler365() {
+
+  return true;
+}
+
+euler365();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
new file mode 100644
index 0000000000..b7f832ebf4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-366-stone-game-iii.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4da1000cf542c50ffed
+title: 'Problem 366: Stone Game III'
+challengeType: 5
+forumTopicId: 302027
+dashedName: problem-366-stone-game-iii
+---
+
+# --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.
+
+# --hints--
+
+`euler366()` should return 88351299.
+
+```js
+assert.strictEqual(euler366(), 88351299);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler366() {
+
+  return true;
+}
+
+euler366();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
new file mode 100644
index 0000000000..979702592a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-367-bozo-sort.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4db1000cf542c50ffee
+title: 'Problem 367: Bozo sort'
+challengeType: 5
+forumTopicId: 302028
+dashedName: problem-367-bozo-sort
+---
+
+# --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.
+
+# --hints--
+
+`euler367()` should return 48271207.
+
+```js
+assert.strictEqual(euler367(), 48271207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler367() {
+
+  return true;
+}
+
+euler367();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
new file mode 100644
index 0000000000..dc9cf2f919
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-368-a-kempner-like-series.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4dd1000cf542c50ffef
+title: 'Problem 368: A Kempner-like series'
+challengeType: 5
+forumTopicId: 302029
+dashedName: problem-368-a-kempner-like-series
+---
+
+# --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.
+
+# --hints--
+
+`euler368()` should return 253.6135092068.
+
+```js
+assert.strictEqual(euler368(), 253.6135092068);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler368() {
+
+  return true;
+}
+
+euler368();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-369-badugi.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-369-badugi.md
new file mode 100644
index 0000000000..abdcb4c810
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-369-badugi.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4de1000cf542c50fff0
+title: 'Problem 369: Badugi'
+challengeType: 5
+forumTopicId: 302030
+dashedName: problem-369-badugi
+---
+
+# --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.
+
+# --hints--
+
+`euler369()` should return 862400558448.
+
+```js
+assert.strictEqual(euler369(), 862400558448);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler369() {
+
+  return true;
+}
+
+euler369();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
new file mode 100644
index 0000000000..7cac6e4ddb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-37-truncatable-primes.md
@@ -0,0 +1,66 @@
+---
+id: 5900f3911000cf542c50fea4
+title: 'Problem 37: Truncatable primes'
+challengeType: 5
+forumTopicId: 302031
+dashedName: problem-37-truncatable-primes
+---
+
+# --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 `n` (8 ≤ `n` ≤ 11) 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.
+
+# --hints--
+
+`truncatablePrimes(8)` should return a number.
+
+```js
+assert(typeof truncatablePrimes(8) === 'number');
+```
+
+`truncatablePrimes(8)` should return 1986.
+
+```js
+assert(truncatablePrimes(8) == 1986);
+```
+
+`truncatablePrimes(9)` should return 5123.
+
+```js
+assert(truncatablePrimes(9) == 5123);
+```
+
+`truncatablePrimes(10)` should return 8920.
+
+```js
+assert(truncatablePrimes(10) == 8920);
+```
+
+`truncatablePrimes(11)` should return 748317.
+
+```js
+assert(truncatablePrimes(11) == 748317);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function truncatablePrimes(n) {
+
+  return n;
+}
+
+truncatablePrimes(11);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
new file mode 100644
index 0000000000..469f9151e0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-370-geometric-triangles.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4de1000cf542c50fff1
+title: 'Problem 370: Geometric triangles'
+challengeType: 5
+forumTopicId: 302032
+dashedName: problem-370-geometric-triangles
+---
+
+# --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 ?
+
+# --hints--
+
+`euler370()` should return 41791929448408.
+
+```js
+assert.strictEqual(euler370(), 41791929448408);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler370() {
+
+  return true;
+}
+
+euler370();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
new file mode 100644
index 0000000000..005b5aaf07
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-371-licence-plates.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4e01000cf542c50fff2
+title: 'Problem 371: Licence plates'
+challengeType: 5
+forumTopicId: 302033
+dashedName: problem-371-licence-plates
+---
+
+# --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.
+
+# --hints--
+
+`euler371()` should return 40.66368097.
+
+```js
+assert.strictEqual(euler371(), 40.66368097);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler371() {
+
+  return true;
+}
+
+euler371();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
new file mode 100644
index 0000000000..1a04cacb71
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-372-pencils-of-rays.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4e11000cf542c50fff3
+title: 'Problem 372: Pencils of rays'
+challengeType: 5
+forumTopicId: 302034
+dashedName: problem-372-pencils-of-rays
+---
+
+# --description--
+
+Let R(M, N) be the number of lattice points (x, y) which satisfy M
+
+Note: represents the floor function.
+
+# --hints--
+
+`euler372()` should return 301450082318807040.
+
+```js
+assert.strictEqual(euler372(), 301450082318807040);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler372() {
+
+  return true;
+}
+
+euler372();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
new file mode 100644
index 0000000000..534c32ea25
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4e11000cf542c50fff4
+title: 'Problem 373: Circumscribed Circles'
+challengeType: 5
+forumTopicId: 302035
+dashedName: problem-373-circumscribed-circles
+---
+
+# --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).
+
+# --hints--
+
+`euler373()` should return 727227472448913.
+
+```js
+assert.strictEqual(euler373(), 727227472448913);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler373() {
+
+  return true;
+}
+
+euler373();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
new file mode 100644
index 0000000000..10fe621891
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-374-maximum-integer-partition-product.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4e51000cf542c50fff6
+title: 'Problem 374: Maximum Integer Partition Product'
+challengeType: 5
+forumTopicId: 302036
+dashedName: problem-374-maximum-integer-partition-product
+---
+
+# --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.
+
+# --hints--
+
+`euler374()` should return 334420941.
+
+```js
+assert.strictEqual(euler374(), 334420941);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler374() {
+
+  return true;
+}
+
+euler374();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
new file mode 100644
index 0000000000..684613a235
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-375-minimum-of-subsequences.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4e41000cf542c50fff5
+title: 'Problem 375: Minimum of subsequences'
+challengeType: 5
+forumTopicId: 302037
+dashedName: problem-375-minimum-of-subsequences
+---
+
+# --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).
+
+# --hints--
+
+`euler375()` should return 7435327983715286000.
+
+```js
+assert.strictEqual(euler375(), 7435327983715286000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler375() {
+
+  return true;
+}
+
+euler375();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
new file mode 100644
index 0000000000..b76c4d26e8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-376-nontransitive-sets-of-dice.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4e51000cf542c50fff7
+title: 'Problem 376: Nontransitive sets of dice'
+challengeType: 5
+forumTopicId: 302038
+dashedName: problem-376-nontransitive-sets-of-dice
+---
+
+# --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 ?
+
+# --hints--
+
+`euler376()` should return 973059630185670.
+
+```js
+assert.strictEqual(euler376(), 973059630185670);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler376() {
+
+  return true;
+}
+
+euler376();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
new file mode 100644
index 0000000000..660508c234
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-377-sum-of-digits-experience-13.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4e51000cf542c50fff8
+title: 'Problem 377: Sum of digits, experience 13'
+challengeType: 5
+forumTopicId: 302039
+dashedName: problem-377-sum-of-digits-experience-13
+---
+
+# --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.
+
+# --hints--
+
+`euler377()` should return 732385277.
+
+```js
+assert.strictEqual(euler377(), 732385277);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler377() {
+
+  return true;
+}
+
+euler377();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
new file mode 100644
index 0000000000..22589747fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-378-triangle-triples.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4e61000cf542c50fff9
+title: 'Problem 378: Triangle Triples'
+challengeType: 5
+forumTopicId: 302040
+dashedName: problem-378-triangle-triples
+---
+
+# --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 &lt; j &lt; 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.
+
+# --hints--
+
+`euler378()` should return 147534623725724700.
+
+```js
+assert.strictEqual(euler378(), 147534623725724700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler378() {
+
+  return true;
+}
+
+euler378();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
new file mode 100644
index 0000000000..3933d82ea2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-379-least-common-multiple-count.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4e81000cf542c50fffa
+title: 'Problem 379: Least common multiple count'
+challengeType: 5
+forumTopicId: 302041
+dashedName: problem-379-least-common-multiple-count
+---
+
+# --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).
+
+# --hints--
+
+`euler379()` should return 132314136838185.
+
+```js
+assert.strictEqual(euler379(), 132314136838185);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler379() {
+
+  return true;
+}
+
+euler379();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
new file mode 100644
index 0000000000..e385d29d0f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-38-pandigital-multiples.md
@@ -0,0 +1,100 @@
+---
+id: 5900f3931000cf542c50fea5
+title: 'Problem 38: Pandigital multiples'
+challengeType: 5
+forumTopicId: 302042
+dashedName: problem-38-pandigital-multiples
+---
+
+# --description--
+
+Take the number 192 and multiply it by each of 1, 2, and 3:
+
+$$\begin{align}
+  192 × 1 = 192\\\\
+  192 × 2 = 384\\\\
+  192 × 3 = 576\\\\
+\end{align}$$
+
+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 `k` pandigital `k`-digit number that can be formed as the concatenated product of an integer with (1, 2, ..., `n`) where `n` > 1?
+
+# --hints--
+
+`pandigitalMultiples(8)` should return a number.
+
+```js
+assert(typeof pandigitalMultiples(8) === 'number');
+```
+
+`pandigitalMultiples(8)` should return `78156234`.
+
+```js
+assert.strictEqual(pandigitalMultiples(8), 78156234);
+```
+
+`pandigitalMultiples(9)` should return `932718654`.
+
+```js
+assert.strictEqual(pandigitalMultiples(9), 932718654);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalMultiples(k) {
+
+  return true;
+}
+
+pandigitalMultiples(8);
+```
+
+# --solutions--
+
+```js
+function pandigitalMultiples(k) {
+  function getKDigitConcatenatedProduct(num, k) {
+    // returns false if concatenated product is not k digits
+    let concatenatedProduct = num.toString();
+    for (let i = 2; concatenatedProduct.length < k; i++) {
+      concatenatedProduct += num * i;
+    }
+    return concatenatedProduct.length === k ? concatenatedProduct : false;
+  }
+
+  function is1toKPandigital(num, k) {
+    const numStr = num.toString();
+
+    // check if length is not k
+    if (numStr.length !== k) {
+      return false;
+    }
+
+    // check if pandigital
+    for (let i = k; i > 0; i--) {
+      if (numStr.indexOf(i.toString()) === -1) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  let largestNum = 0;
+  for (let i = 10 ** Math.floor(k / 2) + 1; i >= 1; i--) {
+    const concatenatedProduct = getKDigitConcatenatedProduct(i, k);
+    if (is1toKPandigital(concatenatedProduct, k)) {
+      const number = parseInt(concatenatedProduct, 10);
+      if (number > largestNum) {
+        largestNum = number;
+      }
+    }
+  }
+  return largestNum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
new file mode 100644
index 0000000000..8596f52fa7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-380-amazing-mazes.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4e81000cf542c50fffb
+title: 'Problem 380: Amazing Mazes!'
+challengeType: 5
+forumTopicId: 302044
+dashedName: problem-380-amazing-mazes
+---
+
+# --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.
+
+# --hints--
+
+`euler380()` should return Infinity.
+
+```js
+assert.strictEqual(euler380(), Infinity);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler380() {
+
+  return true;
+}
+
+euler380();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
new file mode 100644
index 0000000000..f64768a5c7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-381-prime-k-factorial.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ea1000cf542c50fffc
+title: 'Problem 381: (prime-k) factorial'
+challengeType: 5
+forumTopicId: 302045
+dashedName: problem-381-prime-k-factorial
+---
+
+# --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 &lt; 100.
+
+Find ∑S(p) for 5 ≤ p &lt; 108.
+
+# --hints--
+
+`euler381()` should return 139602943319822.
+
+```js
+assert.strictEqual(euler381(), 139602943319822);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler381() {
+
+  return true;
+}
+
+euler381();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
new file mode 100644
index 0000000000..ae95128f6b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-382-generating-polygons.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4eb1000cf542c50fffd
+title: 'Problem 382: Generating polygons'
+challengeType: 5
+forumTopicId: 302046
+dashedName: problem-382-generating-polygons
+---
+
+# --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).
+
+# --hints--
+
+`euler382()` should return 697003956.
+
+```js
+assert.strictEqual(euler382(), 697003956);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler382() {
+
+  return true;
+}
+
+euler382();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
new file mode 100644
index 0000000000..f199cb4f94
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4ed1000cf542c50ffff
+title: 'Problem 383: Divisibility comparison between factorials'
+challengeType: 5
+forumTopicId: 302047
+dashedName: problem-383-divisibility-comparison-between-factorials
+---
+
+# --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)!) &lt; 2·f5(i!) and 1 ≤ i ≤ n. It can be verified that T5(103) = 68 and T5(109) = 2408210.
+
+Find T5(1018).
+
+# --hints--
+
+`euler383()` should return 22173624649806.
+
+```js
+assert.strictEqual(euler383(), 22173624649806);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler383() {
+
+  return true;
+}
+
+euler383();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
new file mode 100644
index 0000000000..c57f0ee2f9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-384-rudin-shapiro-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4ed1000cf542c50fffe
+title: 'Problem 384: Rudin-Shapiro sequence'
+challengeType: 5
+forumTopicId: 302048
+dashedName: problem-384-rudin-shapiro-sequence
+---
+
+# --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.
+
+# --hints--
+
+`euler384()` should return 3354706415856333000.
+
+```js
+assert.strictEqual(euler384(), 3354706415856333000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler384() {
+
+  return true;
+}
+
+euler384();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
new file mode 100644
index 0000000000..3cb1e30763
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-385-ellipses-inside-triangles.md
@@ -0,0 +1,53 @@
+---
+id: 5900f4ee1000cf542c510000
+title: 'Problem 385: Ellipses inside triangles'
+challengeType: 5
+forumTopicId: 302049
+dashedName: problem-385-ellipses-inside-triangles
+---
+
+# --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.
+
+# --hints--
+
+`euler385()` should return 3776957309612154000.
+
+```js
+assert.strictEqual(euler385(), 3776957309612154000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler385() {
+
+  return true;
+}
+
+euler385();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
new file mode 100644
index 0000000000..36a6ce965c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-386-maximum-length-of-an-antichain.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4ef1000cf542c510001
+title: 'Problem 386: Maximum length of an antichain'
+challengeType: 5
+forumTopicId: 302050
+dashedName: problem-386-maximum-length-of-an-antichain
+---
+
+# --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
+
+# --hints--
+
+`euler386()` should return 528755790.
+
+```js
+assert.strictEqual(euler386(), 528755790);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler386() {
+
+  return true;
+}
+
+euler386();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
new file mode 100644
index 0000000000..aa3caddfe3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-387-harshad-numbers.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4f11000cf542c510003
+title: 'Problem 387: Harshad Numbers'
+challengeType: 5
+forumTopicId: 302051
+dashedName: problem-387-harshad-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler387()` should return 696067597313468.
+
+```js
+assert.strictEqual(euler387(), 696067597313468);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler387() {
+
+  return true;
+}
+
+euler387();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
new file mode 100644
index 0000000000..ba13e9be3c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-388-distinct-lines.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4f11000cf542c510002
+title: 'Problem 388: Distinct Lines'
+challengeType: 5
+forumTopicId: 302052
+dashedName: problem-388-distinct-lines
+---
+
+# --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.
+
+# --hints--
+
+`euler388()` should return 831907372805130000.
+
+```js
+assert.strictEqual(euler388(), 831907372805130000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler388() {
+
+  return true;
+}
+
+euler388();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
new file mode 100644
index 0000000000..0fb6bb2688
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-389-platonic-dice.md
@@ -0,0 +1,40 @@
+---
+id: 5900f4f21000cf542c510004
+title: 'Problem 389: Platonic Dice'
+challengeType: 5
+forumTopicId: 302053
+dashedName: problem-389-platonic-dice
+---
+
+# --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.
+
+# --hints--
+
+`euler389()` should return 2406376.3623.
+
+```js
+assert.strictEqual(euler389(), 2406376.3623);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler389() {
+
+  return true;
+}
+
+euler389();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
new file mode 100644
index 0000000000..d19bb816b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-39-integer-right-triangles.md
@@ -0,0 +1,91 @@
+---
+id: 5900f3931000cf542c50fea6
+title: 'Problem 39: Integer right triangles'
+challengeType: 5
+forumTopicId: 302054
+dashedName: problem-39-integer-right-triangles
+---
+
+# --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` ≤ `n`, is the number of solutions maximized?
+
+# --hints--
+
+`intRightTriangles(500)` should return a number.
+
+```js
+assert(typeof intRightTriangles(500) === 'number');
+```
+
+`intRightTriangles(500)` should return 420.
+
+```js
+assert(intRightTriangles(500) == 420);
+```
+
+`intRightTriangles(800)` should return 720.
+
+```js
+assert(intRightTriangles(800) == 720);
+```
+
+`intRightTriangles(900)` should return 840.
+
+```js
+assert(intRightTriangles(900) == 840);
+```
+
+`intRightTriangles(1000)` should return 840.
+
+```js
+assert(intRightTriangles(1000) == 840);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function intRightTriangles(n) {
+
+  return n;
+}
+
+intRightTriangles(500);
+```
+
+# --solutions--
+
+```js
+// Original idea for this solution came from
+// https://www.xarg.org/puzzle/project-euler/problem-39/
+
+function intRightTriangles(n) {
+  // store the number of triangles with a given perimeter
+  let triangles = {};
+  // a is the shortest side
+  for (let a = 3; a < n / 3; a++)
+  // o is the opposite side and is at least as long as a
+    for (let o = a; o < n / 2; o++) {
+      let h = Math.sqrt(a * a + o * o); // hypotenuse
+      let p = a + o + h;  // perimeter
+      if ((h % 1) === 0 && p <= n) {
+        triangles[p] = (triangles[p] || 0) + 1;
+      }
+    }
+
+  let max = 0, maxp = null;
+  for (let p in triangles) {
+    if (max < triangles[p]) {
+      max = triangles[p];
+      maxp = parseInt(p);
+    }
+  }
+  return maxp;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
new file mode 100644
index 0000000000..e582b23f2d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-390-triangles-with-non-rational-sides-and-integral-area.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4f21000cf542c510005
+title: 'Problem 390: Triangles with non rational sides and integral area'
+challengeType: 5
+forumTopicId: 302055
+dashedName: problem-390-triangles-with-non-rational-sides-and-integral-area
+---
+
+# --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).
+
+# --hints--
+
+`euler390()` should return 2919133642971.
+
+```js
+assert.strictEqual(euler390(), 2919133642971);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler390() {
+
+  return true;
+}
+
+euler390();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
new file mode 100644
index 0000000000..4eda36c0a4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-391-hopping-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4f31000cf542c510006
+title: 'Problem 391: Hopping Game'
+challengeType: 5
+forumTopicId: 302056
+dashedName: problem-391-hopping-game
+---
+
+# --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.
+
+# --hints--
+
+`euler391()` should return 61029882288.
+
+```js
+assert.strictEqual(euler391(), 61029882288);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler391() {
+
+  return true;
+}
+
+euler391();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
new file mode 100644
index 0000000000..cd4d53f17d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-392-enmeshed-unit-circle.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4f41000cf542c510007
+title: 'Problem 392: Enmeshed unit circle'
+challengeType: 5
+forumTopicId: 302057
+dashedName: problem-392-enmeshed-unit-circle
+---
+
+# --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.
+
+# --hints--
+
+`euler392()` should return 3.1486734435.
+
+```js
+assert.strictEqual(euler392(), 3.1486734435);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler392() {
+
+  return true;
+}
+
+euler392();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
new file mode 100644
index 0000000000..21f98ec10c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-393-migrating-ants.md
@@ -0,0 +1,44 @@
+---
+id: 5900f4f61000cf542c510008
+title: 'Problem 393: Migrating ants'
+challengeType: 5
+forumTopicId: 302058
+dashedName: problem-393-migrating-ants
+---
+
+# --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).
+
+# --hints--
+
+`euler393()` should return 112398351350823100.
+
+```js
+assert.strictEqual(euler393(), 112398351350823100);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler393() {
+
+  return true;
+}
+
+euler393();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
new file mode 100644
index 0000000000..26c7bce3a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-394-eating-pie.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4f71000cf542c510009
+title: 'Problem 394: Eating pie'
+challengeType: 5
+forumTopicId: 302059
+dashedName: problem-394-eating-pie
+---
+
+# --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.
+
+# --hints--
+
+`euler394()` should return 3.2370342194.
+
+```js
+assert.strictEqual(euler394(), 3.2370342194);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler394() {
+
+  return true;
+}
+
+euler394();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
new file mode 100644
index 0000000000..80903ac0ef
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-395-pythagorean-tree.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4f71000cf542c51000a
+title: 'Problem 395: Pythagorean tree'
+challengeType: 5
+forumTopicId: 302060
+dashedName: problem-395-pythagorean-tree
+---
+
+# --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.
+
+# --hints--
+
+`euler395()` should return 28.2453753155.
+
+```js
+assert.strictEqual(euler395(), 28.2453753155);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler395() {
+
+  return true;
+}
+
+euler395();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
new file mode 100644
index 0000000000..bb98b389ba
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-396-weak-goodstein-sequence.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4f81000cf542c51000b
+title: 'Problem 396: Weak Goodstein sequence'
+challengeType: 5
+forumTopicId: 302061
+dashedName: problem-396-weak-goodstein-sequence
+---
+
+# --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 &lt; 8.
+
+Find the last 9 digits of ΣG(n) for 1 ≤ n &lt; 16.
+
+# --hints--
+
+`euler396()` should return 173214653.
+
+```js
+assert.strictEqual(euler396(), 173214653);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler396() {
+
+  return true;
+}
+
+euler396();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
new file mode 100644
index 0000000000..d8d95c2dd3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-397-triangle-on-parabola.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4f91000cf542c51000c
+title: 'Problem 397: Triangle on parabola'
+challengeType: 5
+forumTopicId: 302062
+dashedName: problem-397-triangle-on-parabola
+---
+
+# --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 &lt; b &lt; c ≤ X.
+
+For example, F(1, 10) = 41 and F(10, 100) = 12492. Find F(106, 109).
+
+# --hints--
+
+`euler397()` should return 141630459461893730.
+
+```js
+assert.strictEqual(euler397(), 141630459461893730);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler397() {
+
+  return true;
+}
+
+euler397();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
new file mode 100644
index 0000000000..4b145fdfbc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-398-cutting-rope.md
@@ -0,0 +1,42 @@
+---
+id: 5900f4fa1000cf542c51000d
+title: 'Problem 398: Cutting rope'
+challengeType: 5
+forumTopicId: 302063
+dashedName: problem-398-cutting-rope
+---
+
+# --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.
+
+# --hints--
+
+`euler398()` should return 2010.59096.
+
+```js
+assert.strictEqual(euler398(), 2010.59096);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler398() {
+
+  return true;
+}
+
+euler398();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
new file mode 100644
index 0000000000..b61d13a336
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-399-squarefree-fibonacci-numbers.md
@@ -0,0 +1,54 @@
+---
+id: 5900f4fc1000cf542c51000e
+title: 'Problem 399: Squarefree Fibonacci Numbers'
+challengeType: 5
+forumTopicId: 302064
+dashedName: problem-399-squarefree-fibonacci-numbers
+---
+
+# --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.
+
+# --hints--
+
+`euler399()` should return 1508395636674243, 6.5e27330467.
+
+```js
+assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler399() {
+
+  return true;
+}
+
+euler399();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
new file mode 100644
index 0000000000..34dbf96399
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-4-largest-palindrome-product.md
@@ -0,0 +1,64 @@
+---
+id: 5900f3701000cf542c50fe83
+title: 'Problem 4: Largest palindrome product'
+challengeType: 5
+forumTopicId: 302065
+dashedName: problem-4-largest-palindrome-product
+---
+
+# --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 `n`-digit numbers.
+
+# --hints--
+
+`largestPalindromeProduct(2)` should return a number.
+
+```js
+assert(typeof largestPalindromeProduct(2) === 'number');
+```
+
+`largestPalindromeProduct(2)` should return 9009.
+
+```js
+assert.strictEqual(largestPalindromeProduct(2), 9009);
+```
+
+`largestPalindromeProduct(3)` should return 906609.
+
+```js
+assert.strictEqual(largestPalindromeProduct(3), 906609);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestPalindromeProduct(n) {
+
+  return true;
+}
+
+largestPalindromeProduct(3);
+```
+
+# --solutions--
+
+```js
+const largestPalindromeProduct = (digit)=>{
+  let start = 1;
+  let end = Number(`1e${digit}`) - 1;
+ let palindrome = [];
+  for(let i=start;i<=end;i++){
+    for(let j=start;j<=end;j++){
+      let product = i*j;
+      let palindromeRegex = /\b(\d)(\d?)(\d?).?\3\2\1\b/gi;
+      palindromeRegex.test(product) && palindrome.push(product);
+    }
+ }
+ return Math.max(...palindrome);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
new file mode 100644
index 0000000000..f7f6c8f51f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-40-champernownes-constant.md
@@ -0,0 +1,77 @@
+---
+id: 5900f3941000cf542c50fea7
+title: 'Problem 40: Champernowne''s constant'
+challengeType: 5
+forumTopicId: 302066
+dashedName: problem-40-champernownes-constant
+---
+
+# --description--
+
+An irrational decimal fraction is created by concatenating the positive integers:
+
+0.12345678910**1**112131415161718192021...
+
+It can be seen that the 12<sup>th</sup> digit of the fractional part is 1.
+
+If *d<sub>n</sub>* represents the *n*<sup>th</sup> digit of the fractional part, find the value of the following expression.
+
+d<sub>1</sub> × d<sub>10</sub> × d<sub>100</sub> × d<sub>1000</sub> × d<sub>10000</sub> × d<sub>100000</sub> × d<sub>1000000</sub>
+
+# --hints--
+
+`champernownesConstant(100)` should return a number.
+
+```js
+assert(typeof champernownesConstant(100) === 'number');
+```
+
+`champernownesConstant(100)` should return 5.
+
+```js
+assert.strictEqual(champernownesConstant(100), 5);
+```
+
+`champernownesConstant(1000)` should return 15.
+
+```js
+assert.strictEqual(champernownesConstant(1000), 15);
+```
+
+`champernownesConstant(1000000)` should return 210.
+
+```js
+assert.strictEqual(champernownesConstant(1000000), 210);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function champernownesConstant(n) {
+
+  return true;
+}
+
+champernownesConstant(100);
+```
+
+# --solutions--
+
+```js
+function champernownesConstant(n) {
+  let fractionalPart = '';
+  for (let i = 0; fractionalPart.length <= n; i++) {
+    fractionalPart += i.toString();
+  }
+
+  let product = 1;
+  for (let i = 0; i < n.toString().length; i++) {
+    const index = 10 ** i;
+    product *= parseInt(fractionalPart[index], 10);
+  }
+
+  return product;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
new file mode 100644
index 0000000000..07e767a5ba
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-400-fibonacci-tree-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f4fe1000cf542c510010
+title: 'Problem 400: Fibonacci tree game'
+challengeType: 5
+forumTopicId: 302067
+dashedName: problem-400-fibonacci-tree-game
+---
+
+# --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.
+
+# --hints--
+
+`euler400()` should return 438505383468410600.
+
+```js
+assert.strictEqual(euler400(), 438505383468410600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler400() {
+
+  return true;
+}
+
+euler400();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
new file mode 100644
index 0000000000..d1c5ca48cc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-401-sum-of-squares-of-divisors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f4fd1000cf542c51000f
+title: 'Problem 401: Sum of squares of divisors'
+challengeType: 5
+forumTopicId: 302069
+dashedName: problem-401-sum-of-squares-of-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler401()` should return 281632621.
+
+```js
+assert.strictEqual(euler401(), 281632621);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler401() {
+
+  return true;
+}
+
+euler401();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
new file mode 100644
index 0000000000..b4c4a63fe8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-402-integer-valued-polynomials.md
@@ -0,0 +1,48 @@
+---
+id: 5900f4ff1000cf542c510011
+title: 'Problem 402: Integer-valued polynomials'
+challengeType: 5
+forumTopicId: 302070
+dashedName: problem-402-integer-valued-polynomials
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler402()` should return 356019862.
+
+```js
+assert.strictEqual(euler402(), 356019862);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler402() {
+
+  return true;
+}
+
+euler402();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
new file mode 100644
index 0000000000..d854a56f4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-403-lattice-points-enclosed-by-parabola-and-line.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5001000cf542c510013
+title: 'Problem 403: Lattice points enclosed by parabola and line'
+challengeType: 5
+forumTopicId: 302071
+dashedName: problem-403-lattice-points-enclosed-by-parabola-and-line
+---
+
+# --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.
+
+# --hints--
+
+`euler403()` should return 18224771.
+
+```js
+assert.strictEqual(euler403(), 18224771);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler403() {
+
+  return true;
+}
+
+euler403();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
new file mode 100644
index 0000000000..6b7341cea4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-404-crisscross-ellipses.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5001000cf542c510012
+title: 'Problem 404: Crisscross Ellipses'
+challengeType: 5
+forumTopicId: 302072
+dashedName: problem-404-crisscross-ellipses
+---
+
+# --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° &lt; θ &lt; 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).
+
+# --hints--
+
+`euler404()` should return 1199215615081353.
+
+```js
+assert.strictEqual(euler404(), 1199215615081353);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler404() {
+
+  return true;
+}
+
+euler404();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
new file mode 100644
index 0000000000..87f1f0c28f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-405-a-rectangular-tiling.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5021000cf542c510014
+title: 'Problem 405: A rectangular tiling'
+challengeType: 5
+forumTopicId: 302073
+dashedName: problem-405-a-rectangular-tiling
+---
+
+# --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.
+
+# --hints--
+
+`euler405()` should return 237696125.
+
+```js
+assert.strictEqual(euler405(), 237696125);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler405() {
+
+  return true;
+}
+
+euler405();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
new file mode 100644
index 0000000000..fd6535eb66
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-406-guessing-game.md
@@ -0,0 +1,56 @@
+---
+id: 5900f5021000cf542c510015
+title: 'Problem 406: Guessing Game'
+challengeType: 5
+forumTopicId: 302074
+dashedName: problem-406-guessing-game
+---
+
+# --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.
+
+# --hints--
+
+`euler406()` should return 36813.12757207.
+
+```js
+assert.strictEqual(euler406(), 36813.12757207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler406() {
+
+  return true;
+}
+
+euler406();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-407-idempotents.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
new file mode 100644
index 0000000000..eb473f7ba0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-407-idempotents.md
@@ -0,0 +1,42 @@
+---
+id: 5900f5041000cf542c510016
+title: 'Problem 407: Idempotents'
+challengeType: 5
+forumTopicId: 302075
+dashedName: problem-407-idempotents
+---
+
+# --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 &lt; n such that a2 ≡ a (mod n). So M(6) = 4.
+
+Find ∑M(n) for 1 ≤ n ≤ 107.
+
+# --hints--
+
+`euler407()` should return 39782849136421.
+
+```js
+assert.strictEqual(euler407(), 39782849136421);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler407() {
+
+  return true;
+}
+
+euler407();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
new file mode 100644
index 0000000000..0c3decbbe7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-408-admissible-paths-through-a-grid.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5091000cf542c51001b
+title: 'Problem 408: Admissible paths through a grid'
+challengeType: 5
+forumTopicId: 302076
+dashedName: problem-408-admissible-paths-through-a-grid
+---
+
+# --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.
+
+# --hints--
+
+`euler408()` should return 299742733.
+
+```js
+assert.strictEqual(euler408(), 299742733);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler408() {
+
+  return true;
+}
+
+euler408();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
new file mode 100644
index 0000000000..d6dbeffce9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-409-nim-extreme.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5061000cf542c510017
+title: 'Problem 409: Nim Extreme'
+challengeType: 5
+forumTopicId: 302077
+dashedName: problem-409-nim-extreme
+---
+
+# --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.
+
+# --hints--
+
+`euler409()` should return 253223948.
+
+```js
+assert.strictEqual(euler409(), 253223948);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler409() {
+
+  return true;
+}
+
+euler409();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
new file mode 100644
index 0000000000..41465478fc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-41-pandigital-prime.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3951000cf542c50fea8
+title: 'Problem 41: Pandigital prime'
+challengeType: 5
+forumTopicId: 302078
+dashedName: problem-41-pandigital-prime
+---
+
+# --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`-length digit pandigital prime that exists?
+
+# --hints--
+
+`pandigitalPrime(4)` should return a number.
+
+```js
+assert(typeof pandigitalPrime(4) === 'number');
+```
+
+`pandigitalPrime(4)` should return 4231.
+
+```js
+assert(pandigitalPrime(4) == 4231);
+```
+
+`pandigitalPrime(7)` should return 7652413.
+
+```js
+assert(pandigitalPrime(7) == 7652413);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pandigitalPrime(n) {
+
+  return n;
+}
+
+pandigitalPrime(7);
+```
+
+# --solutions--
+
+```js
+function pandigitalPrime(n) {
+  function isPrime(num) {
+    for (let i = 2, s = Math.sqrt(num); i <= s; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return num !== 1;
+  }
+
+  function getPermutations(n) {
+    if (n === 1) {
+      permutations.push(digitsArr.join(''));
+    } else {
+      for (let i = 0; i < n - 1; i++) {
+        getPermutations(n - 1);
+        // swap(n % 2 === 0 ? i : 0, n - 1);
+        if (n % 2 === 0) {
+          swap(i, n - 1);
+        } else {
+          swap(0, n - 1);
+        }
+      }
+      getPermutations(n - 1);
+    }
+  }
+  function swap(x, y) {
+    let temp = digitsArr[x];
+    digitsArr[x] = digitsArr[y];
+    digitsArr[y] = temp;
+  }
+  let max = 0;
+  let permutations = [];
+  let digitsArr;
+  let pandigitalNum = '';
+
+  for (let max = n; max > 0; max--) {
+    pandigitalNum += max;
+  }
+
+  for (let i = 0; i < pandigitalNum.length; i++) {
+    if (max > 0) {
+      break;
+    } else {
+      permutations = [];
+      const currMax = pandigitalNum.slice(i);
+      digitsArr = currMax.split('');
+      getPermutations(digitsArr.length);
+
+      // sort permutations in descending order
+      permutations.sort(function(a, b) {
+        return b - a;
+      });
+
+      for (let perm of permutations) {
+        const thisPerm = parseInt(perm);
+        if (isPrime(thisPerm)) {
+          max = thisPerm;
+          break;
+        }
+      }
+    }
+  }
+
+  return max;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
new file mode 100644
index 0000000000..cd55b71cbc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-410-circle-and-tangent-line.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5071000cf542c510018
+title: 'Problem 410: Circle and tangent line'
+challengeType: 5
+forumTopicId: 302079
+dashedName: problem-410-circle-and-tangent-line
+---
+
+# --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 &lt; r ≤ R and 0 &lt; 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).
+
+# --hints--
+
+`euler410()` should return 799999783589946600.
+
+```js
+assert.strictEqual(euler410(), 799999783589946600);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler410() {
+
+  return true;
+}
+
+euler410();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
new file mode 100644
index 0000000000..db9dd2cb86
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-411-uphill-paths.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5081000cf542c510019
+title: 'Problem 411: Uphill paths'
+challengeType: 5
+forumTopicId: 302080
+dashedName: problem-411-uphill-paths
+---
+
+# --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.
+
+# --hints--
+
+`euler411()` should return 9936352.
+
+```js
+assert.strictEqual(euler411(), 9936352);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler411() {
+
+  return true;
+}
+
+euler411();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
new file mode 100644
index 0000000000..f0dfab1bf6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-412-gnomon-numbering.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5081000cf542c51001a
+title: 'Problem 412: Gnomon numbering'
+challengeType: 5
+forumTopicId: 302081
+dashedName: problem-412-gnomon-numbering
+---
+
+# --description--
+
+For integers m, n (0 ≤ n &lt; 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.
+
+# --hints--
+
+`euler412()` should return 38788800.
+
+```js
+assert.strictEqual(euler412(), 38788800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler412() {
+
+  return true;
+}
+
+euler412();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
new file mode 100644
index 0000000000..a3a7ac23c5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-413-one-child-numbers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f50a1000cf542c51001c
+title: 'Problem 413: One-child Numbers'
+challengeType: 5
+forumTopicId: 302082
+dashedName: problem-413-one-child-numbers
+---
+
+# --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).
+
+# --hints--
+
+`euler413()` should return 3079418648040719.
+
+```js
+assert.strictEqual(euler413(), 3079418648040719);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler413() {
+
+  return true;
+}
+
+euler413();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
new file mode 100644
index 0000000000..9cf45b79ab
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-414-kaprekar-constant.md
@@ -0,0 +1,60 @@
+---
+id: 5900f50b1000cf542c51001d
+title: 'Problem 414: Kaprekar constant'
+challengeType: 5
+forumTopicId: 302083
+dashedName: problem-414-kaprekar-constant
+---
+
+# --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 &lt; 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 &lt; i &lt; 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.
+
+# --hints--
+
+`euler414()` should return 552506775824935500.
+
+```js
+assert.strictEqual(euler414(), 552506775824935500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler414() {
+
+  return true;
+}
+
+euler414();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
new file mode 100644
index 0000000000..951684acc0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-415-titanic-sets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f50c1000cf542c51001e
+title: 'Problem 415: Titanic sets'
+challengeType: 5
+forumTopicId: 302084
+dashedName: problem-415-titanic-sets
+---
+
+# --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.
+
+# --hints--
+
+`euler415()` should return 55859742.
+
+```js
+assert.strictEqual(euler415(), 55859742);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler415() {
+
+  return true;
+}
+
+euler415();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
new file mode 100644
index 0000000000..96e9fe1bb0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-416-a-frogs-trip.md
@@ -0,0 +1,42 @@
+---
+id: 5900f50e1000cf542c510020
+title: 'Problem 416: A frog''s trip'
+challengeType: 5
+forumTopicId: 302085
+dashedName: problem-416-a-frogs-trip
+---
+
+# --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).
+
+# --hints--
+
+`euler416()` should return 898082747.
+
+```js
+assert.strictEqual(euler416(), 898082747);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler416() {
+
+  return true;
+}
+
+euler416();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
new file mode 100644
index 0000000000..e73dd646e8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-417-reciprocal-cycles-ii.md
@@ -0,0 +1,48 @@
+---
+id: 5900f50d1000cf542c51001f
+title: 'Problem 417: Reciprocal cycles II'
+challengeType: 5
+forumTopicId: 302086
+dashedName: problem-417-reciprocal-cycles-ii
+---
+
+# --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
+
+# --hints--
+
+`euler417()` should return 446572970925740.
+
+```js
+assert.strictEqual(euler417(), 446572970925740);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler417() {
+
+  return true;
+}
+
+euler417();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
new file mode 100644
index 0000000000..ac11b1083f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-418-factorisation-triples.md
@@ -0,0 +1,46 @@
+---
+id: 5900f50f1000cf542c510021
+title: 'Problem 418: Factorisation triples'
+challengeType: 5
+forumTopicId: 302087
+dashedName: problem-418-factorisation-triples
+---
+
+# --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!).
+
+# --hints--
+
+`euler418()` should return 1177163565297340400.
+
+```js
+assert.strictEqual(euler418(), 1177163565297340400);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler418() {
+
+  return true;
+}
+
+euler418();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
new file mode 100644
index 0000000000..2d9f365090
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-419-look-and-say-sequence.md
@@ -0,0 +1,58 @@
+---
+id: 5900f5101000cf542c510022
+title: 'Problem 419: Look and say sequence'
+challengeType: 5
+forumTopicId: 302088
+dashedName: problem-419-look-and-say-sequence
+---
+
+# --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
+
+# --hints--
+
+`euler419()` should return 998567458, 1046245404, 43363922.
+
+```js
+assert.strictEqual(euler419(), 998567458, 1046245404, 43363922);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler419() {
+
+  return true;
+}
+
+euler419();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
new file mode 100644
index 0000000000..bc3de08623
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-42-coded-triangle-numbers.md
@@ -0,0 +1,71 @@
+---
+id: 5900f3961000cf542c50fea9
+title: 'Problem 42: Coded triangle numbers'
+challengeType: 5
+forumTopicId: 302089
+dashedName: problem-42-coded-triangle-numbers
+---
+
+# --description--
+
+The `n`<sup>th</sup> term of the sequence of triangle numbers is given by, `tn` = ½`n`(`n`+1); so the first ten triangle numbers are:
+
+<div style='margin-left: 4em;'>1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...</div>
+
+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 = `t`<sub>10</sub>. If the word value is a triangle number then we shall call the word a triangle word.
+
+Using words array of `n`-length, how many are triangle words?
+
+# --hints--
+
+`codedTriangleNumbers(1400)` should return a number.
+
+```js
+assert(typeof codedTriangleNumbers(1400) === 'number');
+```
+
+`codedTriangleNumbers(1400)` should return 129.
+
+```js
+assert(codedTriangleNumbers(1400) == 129);
+```
+
+`codedTriangleNumbers(1500)` should return 137.
+
+```js
+assert(codedTriangleNumbers(1500) == 137);
+```
+
+`codedTriangleNumbers(1600)` should return 141.
+
+```js
+assert(codedTriangleNumbers(1600) == 141);
+```
+
+`codedTriangleNumbers(1786)` should return 162.
+
+```js
+assert(codedTriangleNumbers(1786) == 162);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function codedTriangleNumbers(n) {
+
+  return 1;
+}
+// Only change code above this line
+
+const words = ['A','ABILITY','ABLE','ABOUT','ABOVE','ABSENCE','ABSOLUTELY','ACADEMIC','ACCEPT','ACCESS','ACCIDENT','ACCOMPANY','ACCORDING','ACCOUNT','ACHIEVE','ACHIEVEMENT','ACID','ACQUIRE','ACROSS','ACT','ACTION','ACTIVE','ACTIVITY','ACTUAL','ACTUALLY','ADD','ADDITION','ADDITIONAL','ADDRESS','ADMINISTRATION','ADMIT','ADOPT','ADULT','ADVANCE','ADVANTAGE','ADVICE','ADVISE','AFFAIR','AFFECT','AFFORD','AFRAID','AFTER','AFTERNOON','AFTERWARDS','AGAIN','AGAINST','AGE','AGENCY','AGENT','AGO','AGREE','AGREEMENT','AHEAD','AID','AIM','AIR','AIRCRAFT','ALL','ALLOW','ALMOST','ALONE','ALONG','ALREADY','ALRIGHT','ALSO','ALTERNATIVE','ALTHOUGH','ALWAYS','AMONG','AMONGST','AMOUNT','AN','ANALYSIS','ANCIENT','AND','ANIMAL','ANNOUNCE','ANNUAL','ANOTHER','ANSWER','ANY','ANYBODY','ANYONE','ANYTHING','ANYWAY','APART','APPARENT','APPARENTLY','APPEAL','APPEAR','APPEARANCE','APPLICATION','APPLY','APPOINT','APPOINTMENT','APPROACH','APPROPRIATE','APPROVE','AREA','ARGUE','ARGUMENT','ARISE','ARM','ARMY','AROUND','ARRANGE','ARRANGEMENT','ARRIVE','ART','ARTICLE','ARTIST','AS','ASK','ASPECT','ASSEMBLY','ASSESS','ASSESSMENT','ASSET','ASSOCIATE','ASSOCIATION','ASSUME','ASSUMPTION','AT','ATMOSPHERE','ATTACH','ATTACK','ATTEMPT','ATTEND','ATTENTION','ATTITUDE','ATTRACT','ATTRACTIVE','AUDIENCE','AUTHOR','AUTHORITY','AVAILABLE','AVERAGE','AVOID','AWARD','AWARE','AWAY','AYE','BABY','BACK','BACKGROUND','BAD','BAG','BALANCE','BALL','BAND','BANK','BAR','BASE','BASIC','BASIS','BATTLE','BE','BEAR','BEAT','BEAUTIFUL','BECAUSE','BECOME','BED','BEDROOM','BEFORE','BEGIN','BEGINNING','BEHAVIOUR','BEHIND','BELIEF','BELIEVE','BELONG','BELOW','BENEATH','BENEFIT','BESIDE','BEST','BETTER','BETWEEN','BEYOND','BIG','BILL','BIND','BIRD','BIRTH','BIT','BLACK','BLOCK','BLOOD','BLOODY','BLOW','BLUE','BOARD','BOAT','BODY','BONE','BOOK','BORDER','BOTH','BOTTLE','BOTTOM','BOX','BOY','BRAIN','BRANCH','BREAK','BREATH','BRIDGE','BRIEF','BRIGHT','BRING','BROAD','BROTHER','BUDGET','BUILD','BUILDING','BURN','BUS','BUSINESS','BUSY','BUT','BUY','BY','CABINET','CALL','CAMPAIGN','CAN','CANDIDATE','CAPABLE','CAPACITY','CAPITAL','CAR','CARD','CARE','CAREER','CAREFUL','CAREFULLY','CARRY','CASE','CASH','CAT','CATCH','CATEGORY','CAUSE','CELL','CENTRAL','CENTRE','CENTURY','CERTAIN','CERTAINLY','CHAIN','CHAIR','CHAIRMAN','CHALLENGE','CHANCE','CHANGE','CHANNEL','CHAPTER','CHARACTER','CHARACTERISTIC','CHARGE','CHEAP','CHECK','CHEMICAL','CHIEF','CHILD','CHOICE','CHOOSE','CHURCH','CIRCLE','CIRCUMSTANCE','CITIZEN','CITY','CIVIL','CLAIM','CLASS','CLEAN','CLEAR','CLEARLY','CLIENT','CLIMB','CLOSE','CLOSELY','CLOTHES','CLUB','COAL','CODE','COFFEE','COLD','COLLEAGUE','COLLECT','COLLECTION','COLLEGE','COLOUR','COMBINATION','COMBINE','COME','COMMENT','COMMERCIAL','COMMISSION','COMMIT','COMMITMENT','COMMITTEE','COMMON','COMMUNICATION','COMMUNITY','COMPANY','COMPARE','COMPARISON','COMPETITION','COMPLETE','COMPLETELY','COMPLEX','COMPONENT','COMPUTER','CONCENTRATE','CONCENTRATION','CONCEPT','CONCERN','CONCERNED','CONCLUDE','CONCLUSION','CONDITION','CONDUCT','CONFERENCE','CONFIDENCE','CONFIRM','CONFLICT','CONGRESS','CONNECT','CONNECTION','CONSEQUENCE','CONSERVATIVE','CONSIDER','CONSIDERABLE','CONSIDERATION','CONSIST','CONSTANT','CONSTRUCTION','CONSUMER','CONTACT','CONTAIN','CONTENT','CONTEXT','CONTINUE','CONTRACT','CONTRAST','CONTRIBUTE','CONTRIBUTION','CONTROL','CONVENTION','CONVERSATION','COPY','CORNER','CORPORATE','CORRECT','COS','COST','COULD','COUNCIL','COUNT','COUNTRY','COUNTY','COUPLE','COURSE','COURT','COVER','CREATE','CREATION','CREDIT','CRIME','CRIMINAL','CRISIS','CRITERION','CRITICAL','CRITICISM','CROSS','CROWD','CRY','CULTURAL','CULTURE','CUP','CURRENT','CURRENTLY','CURRICULUM','CUSTOMER','CUT','DAMAGE','DANGER','DANGEROUS','DARK','DATA','DATE','DAUGHTER','DAY','DEAD','DEAL','DEATH','DEBATE','DEBT','DECADE','DECIDE','DECISION','DECLARE','DEEP','DEFENCE','DEFENDANT','DEFINE','DEFINITION','DEGREE','DELIVER','DEMAND','DEMOCRATIC','DEMONSTRATE','DENY','DEPARTMENT','DEPEND','DEPUTY','DERIVE','DESCRIBE','DESCRIPTION','DESIGN','DESIRE','DESK','DESPITE','DESTROY','DETAIL','DETAILED','DETERMINE','DEVELOP','DEVELOPMENT','DEVICE','DIE','DIFFERENCE','DIFFERENT','DIFFICULT','DIFFICULTY','DINNER','DIRECT','DIRECTION','DIRECTLY','DIRECTOR','DISAPPEAR','DISCIPLINE','DISCOVER','DISCUSS','DISCUSSION','DISEASE','DISPLAY','DISTANCE','DISTINCTION','DISTRIBUTION','DISTRICT','DIVIDE','DIVISION','DO','DOCTOR','DOCUMENT','DOG','DOMESTIC','DOOR','DOUBLE','DOUBT','DOWN','DRAW','DRAWING','DREAM','DRESS','DRINK','DRIVE','DRIVER','DROP','DRUG','DRY','DUE','DURING','DUTY','EACH','EAR','EARLY','EARN','EARTH','EASILY','EAST','EASY','EAT','ECONOMIC','ECONOMY','EDGE','EDITOR','EDUCATION','EDUCATIONAL','EFFECT','EFFECTIVE','EFFECTIVELY','EFFORT','EGG','EITHER','ELDERLY','ELECTION','ELEMENT','ELSE','ELSEWHERE','EMERGE','EMPHASIS','EMPLOY','EMPLOYEE','EMPLOYER','EMPLOYMENT','EMPTY','ENABLE','ENCOURAGE','END','ENEMY','ENERGY','ENGINE','ENGINEERING','ENJOY','ENOUGH','ENSURE','ENTER','ENTERPRISE','ENTIRE','ENTIRELY','ENTITLE','ENTRY','ENVIRONMENT','ENVIRONMENTAL','EQUAL','EQUALLY','EQUIPMENT','ERROR','ESCAPE','ESPECIALLY','ESSENTIAL','ESTABLISH','ESTABLISHMENT','ESTATE','ESTIMATE','EVEN','EVENING','EVENT','EVENTUALLY','EVER','EVERY','EVERYBODY','EVERYONE','EVERYTHING','EVIDENCE','EXACTLY','EXAMINATION','EXAMINE','EXAMPLE','EXCELLENT','EXCEPT','EXCHANGE','EXECUTIVE','EXERCISE','EXHIBITION','EXIST','EXISTENCE','EXISTING','EXPECT','EXPECTATION','EXPENDITURE','EXPENSE','EXPENSIVE','EXPERIENCE','EXPERIMENT','EXPERT','EXPLAIN','EXPLANATION','EXPLORE','EXPRESS','EXPRESSION','EXTEND','EXTENT','EXTERNAL','EXTRA','EXTREMELY','EYE','FACE','FACILITY','FACT','FACTOR','FACTORY','FAIL','FAILURE','FAIR','FAIRLY','FAITH','FALL','FAMILIAR','FAMILY','FAMOUS','FAR','FARM','FARMER','FASHION','FAST','FATHER','FAVOUR','FEAR','FEATURE','FEE','FEEL','FEELING','FEMALE','FEW','FIELD','FIGHT','FIGURE','FILE','FILL','FILM','FINAL','FINALLY','FINANCE','FINANCIAL','FIND','FINDING','FINE','FINGER','FINISH','FIRE','FIRM','FIRST','FISH','FIT','FIX','FLAT','FLIGHT','FLOOR','FLOW','FLOWER','FLY','FOCUS','FOLLOW','FOLLOWING','FOOD','FOOT','FOOTBALL','FOR','FORCE','FOREIGN','FOREST','FORGET','FORM','FORMAL','FORMER','FORWARD','FOUNDATION','FREE','FREEDOM','FREQUENTLY','FRESH','FRIEND','FROM','FRONT','FRUIT','FUEL','FULL','FULLY','FUNCTION','FUND','FUNNY','FURTHER','FUTURE','GAIN','GAME','GARDEN','GAS','GATE','GATHER','GENERAL','GENERALLY','GENERATE','GENERATION','GENTLEMAN','GET','GIRL','GIVE','GLASS','GO','GOAL','GOD','GOLD','GOOD','GOVERNMENT','GRANT','GREAT','GREEN','GREY','GROUND','GROUP','GROW','GROWING','GROWTH','GUEST','GUIDE','GUN','HAIR','HALF','HALL','HAND','HANDLE','HANG','HAPPEN','HAPPY','HARD','HARDLY','HATE','HAVE','HE','HEAD','HEALTH','HEAR','HEART','HEAT','HEAVY','HELL','HELP','HENCE','HER','HERE','HERSELF','HIDE','HIGH','HIGHLY','HILL','HIM','HIMSELF','HIS','HISTORICAL','HISTORY','HIT','HOLD','HOLE','HOLIDAY','HOME','HOPE','HORSE','HOSPITAL','HOT','HOTEL','HOUR','HOUSE','HOUSEHOLD','HOUSING','HOW','HOWEVER','HUGE','HUMAN','HURT','HUSBAND','I','IDEA','IDENTIFY','IF','IGNORE','ILLUSTRATE','IMAGE','IMAGINE','IMMEDIATE','IMMEDIATELY','IMPACT','IMPLICATION','IMPLY','IMPORTANCE','IMPORTANT','IMPOSE','IMPOSSIBLE','IMPRESSION','IMPROVE','IMPROVEMENT','IN','INCIDENT','INCLUDE','INCLUDING','INCOME','INCREASE','INCREASED','INCREASINGLY','INDEED','INDEPENDENT','INDEX','INDICATE','INDIVIDUAL','INDUSTRIAL','INDUSTRY','INFLUENCE','INFORM','INFORMATION','INITIAL','INITIATIVE','INJURY','INSIDE','INSIST','INSTANCE','INSTEAD','INSTITUTE','INSTITUTION','INSTRUCTION','INSTRUMENT','INSURANCE','INTEND','INTENTION','INTEREST','INTERESTED','INTERESTING','INTERNAL','INTERNATIONAL','INTERPRETATION','INTERVIEW','INTO','INTRODUCE','INTRODUCTION','INVESTIGATE','INVESTIGATION','INVESTMENT','INVITE','INVOLVE','IRON','IS','ISLAND','ISSUE','IT','ITEM','ITS','ITSELF','JOB','JOIN','JOINT','JOURNEY','JUDGE','JUMP','JUST','JUSTICE','KEEP','KEY','KID','KILL','KIND','KING','KITCHEN','KNEE','KNOW','KNOWLEDGE','LABOUR','LACK','LADY','LAND','LANGUAGE','LARGE','LARGELY','LAST','LATE','LATER','LATTER','LAUGH','LAUNCH','LAW','LAWYER','LAY','LEAD','LEADER','LEADERSHIP','LEADING','LEAF','LEAGUE','LEAN','LEARN','LEAST','LEAVE','LEFT','LEG','LEGAL','LEGISLATION','LENGTH','LESS','LET','LETTER','LEVEL','LIABILITY','LIBERAL','LIBRARY','LIE','LIFE','LIFT','LIGHT','LIKE','LIKELY','LIMIT','LIMITED','LINE','LINK','LIP','LIST','LISTEN','LITERATURE','LITTLE','LIVE','LIVING','LOAN','LOCAL','LOCATION','LONG','LOOK','LORD','LOSE','LOSS','LOT','LOVE','LOVELY','LOW','LUNCH','MACHINE','MAGAZINE','MAIN','MAINLY','MAINTAIN','MAJOR','MAJORITY','MAKE','MALE','MAN','MANAGE','MANAGEMENT','MANAGER','MANNER','MANY','MAP','MARK','MARKET','MARRIAGE','MARRIED','MARRY','MASS','MASTER','MATCH','MATERIAL','MATTER','MAY','MAYBE','ME','MEAL','MEAN','MEANING','MEANS','MEANWHILE','MEASURE','MECHANISM','MEDIA','MEDICAL','MEET','MEETING','MEMBER','MEMBERSHIP','MEMORY','MENTAL','MENTION','MERELY','MESSAGE','METAL','METHOD','MIDDLE','MIGHT','MILE','MILITARY','MILK','MIND','MINE','MINISTER','MINISTRY','MINUTE','MISS','MISTAKE','MODEL','MODERN','MODULE','MOMENT','MONEY','MONTH','MORE','MORNING','MOST','MOTHER','MOTION','MOTOR','MOUNTAIN','MOUTH','MOVE','MOVEMENT','MUCH','MURDER','MUSEUM','MUSIC','MUST','MY','MYSELF','NAME','NARROW','NATION','NATIONAL','NATURAL','NATURE','NEAR','NEARLY','NECESSARILY','NECESSARY','NECK','NEED','NEGOTIATION','NEIGHBOUR','NEITHER','NETWORK','NEVER','NEVERTHELESS','NEW','NEWS','NEWSPAPER','NEXT','NICE','NIGHT','NO','NOBODY','NOD','NOISE','NONE','NOR','NORMAL','NORMALLY','NORTH','NORTHERN','NOSE','NOT','NOTE','NOTHING','NOTICE','NOTION','NOW','NUCLEAR','NUMBER','NURSE','OBJECT','OBJECTIVE','OBSERVATION','OBSERVE','OBTAIN','OBVIOUS','OBVIOUSLY','OCCASION','OCCUR','ODD','OF','OFF','OFFENCE','OFFER','OFFICE','OFFICER','OFFICIAL','OFTEN','OIL','OKAY','OLD','ON','ONCE','ONE','ONLY','ONTO','OPEN','OPERATE','OPERATION','OPINION','OPPORTUNITY','OPPOSITION','OPTION','OR','ORDER','ORDINARY','ORGANISATION','ORGANISE','ORGANIZATION','ORIGIN','ORIGINAL','OTHER','OTHERWISE','OUGHT','OUR','OURSELVES','OUT','OUTCOME','OUTPUT','OUTSIDE','OVER','OVERALL','OWN','OWNER','PACKAGE','PAGE','PAIN','PAINT','PAINTING','PAIR','PANEL','PAPER','PARENT','PARK','PARLIAMENT','PART','PARTICULAR','PARTICULARLY','PARTLY','PARTNER','PARTY','PASS','PASSAGE','PAST','PATH','PATIENT','PATTERN','PAY','PAYMENT','PEACE','PENSION','PEOPLE','PER','PERCENT','PERFECT','PERFORM','PERFORMANCE','PERHAPS','PERIOD','PERMANENT','PERSON','PERSONAL','PERSUADE','PHASE','PHONE','PHOTOGRAPH','PHYSICAL','PICK','PICTURE','PIECE','PLACE','PLAN','PLANNING','PLANT','PLASTIC','PLATE','PLAY','PLAYER','PLEASE','PLEASURE','PLENTY','PLUS','POCKET','POINT','POLICE','POLICY','POLITICAL','POLITICS','POOL','POOR','POPULAR','POPULATION','POSITION','POSITIVE','POSSIBILITY','POSSIBLE','POSSIBLY','POST','POTENTIAL','POUND','POWER','POWERFUL','PRACTICAL','PRACTICE','PREFER','PREPARE','PRESENCE','PRESENT','PRESIDENT','PRESS','PRESSURE','PRETTY','PREVENT','PREVIOUS','PREVIOUSLY','PRICE','PRIMARY','PRIME','PRINCIPLE','PRIORITY','PRISON','PRISONER','PRIVATE','PROBABLY','PROBLEM','PROCEDURE','PROCESS','PRODUCE','PRODUCT','PRODUCTION','PROFESSIONAL','PROFIT','PROGRAM','PROGRAMME','PROGRESS','PROJECT','PROMISE','PROMOTE','PROPER','PROPERLY','PROPERTY','PROPORTION','PROPOSE','PROPOSAL','PROSPECT','PROTECT','PROTECTION','PROVE','PROVIDE','PROVIDED','PROVISION','PUB','PUBLIC','PUBLICATION','PUBLISH','PULL','PUPIL','PURPOSE','PUSH','PUT','QUALITY','QUARTER','QUESTION','QUICK','QUICKLY','QUIET','QUITE','RACE','RADIO','RAILWAY','RAIN','RAISE','RANGE','RAPIDLY','RARE','RATE','RATHER','REACH','REACTION','READ','READER','READING','READY','REAL','REALISE','REALITY','REALIZE','REALLY','REASON','REASONABLE','RECALL','RECEIVE','RECENT','RECENTLY','RECOGNISE','RECOGNITION','RECOGNIZE','RECOMMEND','RECORD','RECOVER','RED','REDUCE','REDUCTION','REFER','REFERENCE','REFLECT','REFORM','REFUSE','REGARD','REGION','REGIONAL','REGULAR','REGULATION','REJECT','RELATE','RELATION','RELATIONSHIP','RELATIVE','RELATIVELY','RELEASE','RELEVANT','RELIEF','RELIGION','RELIGIOUS','RELY','REMAIN','REMEMBER','REMIND','REMOVE','REPEAT','REPLACE','REPLY','REPORT','REPRESENT','REPRESENTATION','REPRESENTATIVE','REQUEST','REQUIRE','REQUIREMENT','RESEARCH','RESOURCE','RESPECT','RESPOND','RESPONSE','RESPONSIBILITY','RESPONSIBLE','REST','RESTAURANT','RESULT','RETAIN','RETURN','REVEAL','REVENUE','REVIEW','REVOLUTION','RICH','RIDE','RIGHT','RING','RISE','RISK','RIVER','ROAD','ROCK','ROLE','ROLL','ROOF','ROOM','ROUND','ROUTE','ROW','ROYAL','RULE','RUN','RURAL','SAFE','SAFETY','SALE','SAME','SAMPLE','SATISFY','SAVE','SAY','SCALE','SCENE','SCHEME','SCHOOL','SCIENCE','SCIENTIFIC','SCIENTIST','SCORE','SCREEN','SEA','SEARCH','SEASON','SEAT','SECOND','SECONDARY','SECRETARY','SECTION','SECTOR','SECURE','SECURITY','SEE','SEEK','SEEM','SELECT','SELECTION','SELL','SEND','SENIOR','SENSE','SENTENCE','SEPARATE','SEQUENCE','SERIES','SERIOUS','SERIOUSLY','SERVANT','SERVE','SERVICE','SESSION','SET','SETTLE','SETTLEMENT','SEVERAL','SEVERE','SEX','SEXUAL','SHAKE','SHALL','SHAPE','SHARE','SHE','SHEET','SHIP','SHOE','SHOOT','SHOP','SHORT','SHOT','SHOULD','SHOULDER','SHOUT','SHOW','SHUT','SIDE','SIGHT','SIGN','SIGNAL','SIGNIFICANCE','SIGNIFICANT','SILENCE','SIMILAR','SIMPLE','SIMPLY','SINCE','SING','SINGLE','SIR','SISTER','SIT','SITE','SITUATION','SIZE','SKILL','SKIN','SKY','SLEEP','SLIGHTLY','SLIP','SLOW','SLOWLY','SMALL','SMILE','SO','SOCIAL','SOCIETY','SOFT','SOFTWARE','SOIL','SOLDIER','SOLICITOR','SOLUTION','SOME','SOMEBODY','SOMEONE','SOMETHING','SOMETIMES','SOMEWHAT','SOMEWHERE','SON','SONG','SOON','SORRY','SORT','SOUND','SOURCE','SOUTH','SOUTHERN','SPACE','SPEAK','SPEAKER','SPECIAL','SPECIES','SPECIFIC','SPEECH','SPEED','SPEND','SPIRIT','SPORT','SPOT','SPREAD','SPRING','STAFF','STAGE','STAND','STANDARD','STAR','START','STATE','STATEMENT','STATION','STATUS','STAY','STEAL','STEP','STICK','STILL','STOCK','STONE','STOP','STORE','STORY','STRAIGHT','STRANGE','STRATEGY','STREET','STRENGTH','STRIKE','STRONG','STRONGLY','STRUCTURE','STUDENT','STUDIO','STUDY','STUFF','STYLE','SUBJECT','SUBSTANTIAL','SUCCEED','SUCCESS','SUCCESSFUL','SUCH','SUDDENLY','SUFFER','SUFFICIENT','SUGGEST','SUGGESTION','SUITABLE','SUM','SUMMER','SUN','SUPPLY','SUPPORT','SUPPOSE','SURE','SURELY','SURFACE','SURPRISE','SURROUND','SURVEY','SURVIVE','SWITCH','SYSTEM','TABLE','TAKE','TALK','TALL','TAPE','TARGET','TASK','TAX','TEA','TEACH','TEACHER','TEACHING','TEAM','TEAR','TECHNICAL','TECHNIQUE','TECHNOLOGY','TELEPHONE','TELEVISION','TELL','TEMPERATURE','TEND','TERM','TERMS','TERRIBLE','TEST','TEXT','THAN','THANK','THANKS','THAT','THE','THEATRE','THEIR','THEM','THEME','THEMSELVES','THEN','THEORY','THERE','THEREFORE','THESE','THEY','THIN','THING','THINK','THIS','THOSE','THOUGH','THOUGHT','THREAT','THREATEN','THROUGH','THROUGHOUT','THROW','THUS','TICKET','TIME','TINY','TITLE','TO','TODAY','TOGETHER','TOMORROW','TONE','TONIGHT','TOO','TOOL','TOOTH','TOP','TOTAL','TOTALLY','TOUCH','TOUR','TOWARDS','TOWN','TRACK','TRADE','TRADITION','TRADITIONAL','TRAFFIC','TRAIN','TRAINING','TRANSFER','TRANSPORT','TRAVEL','TREAT','TREATMENT','TREATY','TREE','TREND','TRIAL','TRIP','TROOP','TROUBLE','TRUE','TRUST','TRUTH','TRY','TURN','TWICE','TYPE','TYPICAL','UNABLE','UNDER','UNDERSTAND','UNDERSTANDING','UNDERTAKE','UNEMPLOYMENT','UNFORTUNATELY','UNION','UNIT','UNITED','UNIVERSITY','UNLESS','UNLIKELY','UNTIL','UP','UPON','UPPER','URBAN','US','USE','USED','USEFUL','USER','USUAL','USUALLY','VALUE','VARIATION','VARIETY','VARIOUS','VARY','VAST','VEHICLE','VERSION','VERY','VIA','VICTIM','VICTORY','VIDEO','VIEW','VILLAGE','VIOLENCE','VISION','VISIT','VISITOR','VITAL','VOICE','VOLUME','VOTE','WAGE','WAIT','WALK','WALL','WANT','WAR','WARM','WARN','WASH','WATCH','WATER','WAVE','WAY','WE','WEAK','WEAPON','WEAR','WEATHER','WEEK','WEEKEND','WEIGHT','WELCOME','WELFARE','WELL','WEST','WESTERN','WHAT','WHATEVER','WHEN','WHERE','WHEREAS','WHETHER','WHICH','WHILE','WHILST','WHITE','WHO','WHOLE','WHOM','WHOSE','WHY','WIDE','WIDELY','WIFE','WILD','WILL','WIN','WIND','WINDOW','WINE','WING','WINNER','WINTER','WISH','WITH','WITHDRAW','WITHIN','WITHOUT','WOMAN','WONDER','WONDERFUL','WOOD','WORD','WORK','WORKER','WORKING','WORKS','WORLD','WORRY','WORTH','WOULD','WRITE','WRITER','WRITING','WRONG','YARD','YEAH','YEAR','YES','YESTERDAY','YET','YOU','YOUNG','YOUR','YOURSELF','YOUTH'];
+
+codedTriangleNumbers(1786);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
new file mode 100644
index 0000000000..e65a335aad
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5111000cf542c510023
+title: 'Problem 420: 2x2 positive integer matrix'
+challengeType: 5
+forumTopicId: 302090
+dashedName: problem-420-2x2-positive-integer-matrix
+---
+
+# --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).
+
+# --hints--
+
+`euler420()` should return 145159332.
+
+```js
+assert.strictEqual(euler420(), 145159332);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler420() {
+
+  return true;
+}
+
+euler420();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
new file mode 100644
index 0000000000..61e0b86a92
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-421-prime-factors-of-n151.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5131000cf542c510024
+title: 'Problem 421: Prime factors of n15+1'
+challengeType: 5
+forumTopicId: 302091
+dashedName: problem-421-prime-factors-of-n151
+---
+
+# --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.
+
+# --hints--
+
+`euler421()` should return 2304215802083466200.
+
+```js
+assert.strictEqual(euler421(), 2304215802083466200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler421() {
+
+  return true;
+}
+
+euler421();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
new file mode 100644
index 0000000000..cf7455ac9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-422-sequence-of-points-on-a-hyperbola.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5131000cf542c510025
+title: 'Problem 422: Sequence of points on a hyperbola'
+challengeType: 5
+forumTopicId: 302092
+dashedName: problem-422-sequence-of-points-on-a-hyperbola
+---
+
+# --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.
+
+# --hints--
+
+`euler422()` should return 92060460.
+
+```js
+assert.strictEqual(euler422(), 92060460);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler422() {
+
+  return true;
+}
+
+euler422();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
new file mode 100644
index 0000000000..a19a5ce19d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-423-consecutive-die-throws.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5141000cf542c510027
+title: 'Problem 423: Consecutive die throws'
+challengeType: 5
+forumTopicId: 302093
+dashedName: problem-423-consecutive-die-throws
+---
+
+# --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.
+
+# --hints--
+
+`euler423()` should return 653972374.
+
+```js
+assert.strictEqual(euler423(), 653972374);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler423() {
+
+  return true;
+}
+
+euler423();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-424-kakuro.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
new file mode 100644
index 0000000000..827b969ce6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-424-kakuro.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5141000cf542c510026
+title: 'Problem 424: Kakuro'
+challengeType: 5
+forumTopicId: 302094
+dashedName: problem-424-kakuro
+---
+
+# --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.
+
+# --hints--
+
+`euler424()` should return 1059760019628.
+
+```js
+assert.strictEqual(euler424(), 1059760019628);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler424() {
+
+  return true;
+}
+
+euler424();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
new file mode 100644
index 0000000000..d46740b0d5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-425-prime-connection.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5151000cf542c510028
+title: 'Problem 425: Prime connection'
+challengeType: 5
+forumTopicId: 302095
+dashedName: problem-425-prime-connection
+---
+
+# --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).
+
+# --hints--
+
+`euler425()` should return 46479497324.
+
+```js
+assert.strictEqual(euler425(), 46479497324);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler425() {
+
+  return true;
+}
+
+euler425();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
new file mode 100644
index 0000000000..5e2c48c34e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-426-box-ball-system.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5171000cf542c510029
+title: 'Problem 426: Box-ball system'
+challengeType: 5
+forumTopicId: 302096
+dashedName: problem-426-box-ball-system
+---
+
+# --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.
+
+# --hints--
+
+`euler426()` should return 31591886008.
+
+```js
+assert.strictEqual(euler426(), 31591886008);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler426() {
+
+  return true;
+}
+
+euler426();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
new file mode 100644
index 0000000000..8f399eeaf0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-427-n-sequences.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5181000cf542c51002a
+title: 'Problem 427: n-sequences'
+challengeType: 5
+forumTopicId: 302097
+dashedName: problem-427-n-sequences
+---
+
+# --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.
+
+# --hints--
+
+`euler427()` should return 97138867.
+
+```js
+assert.strictEqual(euler427(), 97138867);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler427() {
+
+  return true;
+}
+
+euler427();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
new file mode 100644
index 0000000000..e3b2460e6d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-428-necklace-of-circles.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5191000cf542c51002b
+title: 'Problem 428: Necklace of Circles'
+challengeType: 5
+forumTopicId: 302098
+dashedName: problem-428-necklace-of-circles
+---
+
+# --description--
+
+Let `a`, `b` and `c` be positive numbers.
+
+Let W, X, Y, Z be four collinear points where |WX| = `a`, |XY| = `b`, |YZ| = `c` and |WZ| = `a` + `b` + `c`.
+
+Let C<sub>in</sub> be the circle having the diameter XY.
+
+Let C<sub>out</sub> be the circle having the diameter WZ.
+
+The triplet (`a`, `b`, `c`) is called a *necklace triplet* if you can place `k` ≥ 3 distinct circles C<sub>1</sub>, C<sub>2</sub>, ..., C<sub><var>k</var></sub> such that:
+
+<ul><li>C<sub><var>i</var></sub> has no common interior points with any C<sub><var>j</var></sub> for 1 ≤ <var>i</var>, <var>j</var> ≤ <var>k</var> and <var>i</var> ≠ <var>j</var>,</li><li>C<sub><var>i</var></sub> is tangent to both C<sub>in</sub> and C<sub>out</sub> for 1 ≤ <var>i</var> ≤ <var>k</var>,</li><li>C<sub><var>i</var></sub> is tangent to C<sub><var>i</var>+1</sub> for 1 ≤ <var>i</var> &lt; <var>k</var>, and</li><li>C<sub><var>k</var></sub> is tangent to C<sub>1</sub>.</li></ul>
+For example, (5, 5, 5) and (4, 3, 21) are necklace triplets, while it can be shown that (2, 2, 5) is not.
+<img src="https://projecteuler.net/project/images/p428_necklace.png" alt="a visual representation of a necklace triplet">
+
+Let T(`n`) be the number of necklace triplets (`a`, `b`, `c`) such that `a`, `b` and `c` are positive integers, and `b` ≤ `n`. For example, T(1) = 9, T(20) = 732 and T(3000) = 438106.
+
+Find T(1 000 000 000).
+
+# --hints--
+
+`necklace(1000000000)` should return 747215561862.
+
+```js
+assert.strictEqual(necklace(1000000000), 747215561862);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function necklace(n) {
+
+  return true;
+}
+
+necklace(1000000000)
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
new file mode 100644
index 0000000000..8b9c108829
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-429-sum-of-squares-of-unitary-divisors.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5191000cf542c51002c
+title: 'Problem 429: Sum of squares of unitary divisors'
+challengeType: 5
+forumTopicId: 302099
+dashedName: problem-429-sum-of-squares-of-unitary-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler429()` should return 98792821.
+
+```js
+assert.strictEqual(euler429(), 98792821);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler429() {
+
+  return true;
+}
+
+euler429();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
new file mode 100644
index 0000000000..7c3a5a8342
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-43-sub-string-divisibility.md
@@ -0,0 +1,126 @@
+---
+id: 5900f3971000cf542c50feaa
+title: 'Problem 43: Sub-string divisibility'
+challengeType: 5
+forumTopicId: 302100
+dashedName: problem-43-sub-string-divisibility
+---
+
+# --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 $d_1$ be the $1^{st}$ digit, $d_2$ be the $2^{nd}$ digit, and so on. In this way, we note the following:
+
+- ${d_2}{d_3}{d_4} = 406$ is divisible by 2
+- ${d_3}{d_4}{d_5} = 063$ is divisible by 3
+- ${d_4}{d_5}{d_6} = 635$ is divisible by 5
+- ${d_5}{d_6}{d_7} = 357$ is divisible by 7
+- ${d_6}{d_7}{d_8} = 572$ is divisible by 11
+- ${d_7}{d_8}{d_9} = 728$ is divisible by 13
+- ${d_8}{d_9}{d_{10}} = 289$ is divisible by 17
+
+Find the sum of all 0 to `n` pandigital numbers with sub-strings fulfilling `n - 2` of these divisibility properties.
+
+**Note:** Pandigital numbers starting with `0` are to be considered in the result.
+
+# --hints--
+
+`substringDivisibility(5)` should return a number.
+
+```js
+assert(typeof substringDivisibility(5) === 'number');
+```
+
+`substringDivisibility(5)` should return `12444480`.
+
+```js
+assert.strictEqual(substringDivisibility(5), 12444480)
+```
+
+`substringDivisibility(7)` should return `1099210170`.
+
+```js
+assert.strictEqual(substringDivisibility(7), 1099210170)
+```
+
+`substringDivisibility(8)` should return `1113342912`.
+
+```js
+assert.strictEqual(substringDivisibility(8), 1113342912)
+```
+
+`substringDivisibility(9)` should return `16695334890`.
+
+```js
+assert.strictEqual(substringDivisibility(9), 16695334890)
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function substringDivisibility(n) {
+
+  return true;
+}
+
+substringDivisibility(5);
+```
+
+# --solutions--
+
+```js
+function substringDivisibility(n) {
+  function isSubDivisable(digits) {
+    const factors = [2, 3, 5, 7, 11, 13, 17];
+
+    for (let i = 1; i < digits.length - 2; i++) {
+      const subNumber = digits[i] * 100 + digits[i + 1] * 10 + digits[i + 2];
+      if (subNumber % factors[i - 1] !== 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function heapsPermutations(k, digits, conditionCheck, results) {
+    if (k === 1) {
+      if (conditionCheck(digits)) {
+        const number = parseInt(digits.join(''), 10);
+        results.push(number);
+      }
+      return;
+    }
+
+    heapsPermutations(k - 1, digits, conditionCheck, results);
+
+    for (let i = 0; i < k - 1; i++) {
+      if (k % 2 === 0) {
+        [digits[i], digits[k - 1]] = [digits[k - 1], digits[i]];
+      } else {
+        [digits[0], digits[k - 1]] = [digits[k - 1], digits[0]];
+      }
+      heapsPermutations(k - 1, digits, conditionCheck, results);
+    }
+    return;
+  }
+
+  const allowedDigits = [...new Array(n + 1).keys()];
+  const divisablePandigitals = [];
+  heapsPermutations(
+    allowedDigits.length,
+    allowedDigits,
+    isSubDivisable,
+    divisablePandigitals
+  );
+
+  let sum = 0;
+  for (let i = 0; i < divisablePandigitals.length; i++) {
+    sum += divisablePandigitals[i];
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-430-range-flips.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
new file mode 100644
index 0000000000..ba66983c7b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-430-range-flips.md
@@ -0,0 +1,48 @@
+---
+id: 5900f51a1000cf542c51002d
+title: 'Problem 430: Range flips'
+challengeType: 5
+forumTopicId: 302101
+dashedName: problem-430-range-flips
+---
+
+# --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.
+
+# --hints--
+
+`euler430()` should return 5000624921.38.
+
+```js
+assert.strictEqual(euler430(), 5000624921.38);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler430() {
+
+  return true;
+}
+
+euler430();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
new file mode 100644
index 0000000000..51a104b47a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-431-square-space-silo.md
@@ -0,0 +1,46 @@
+---
+id: 5900f51b1000cf542c51002e
+title: 'Problem 431: Square Space Silo'
+challengeType: 5
+forumTopicId: 302102
+dashedName: problem-431-square-space-silo
+---
+
+# --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.
+
+# --hints--
+
+`euler431()` should return 23.386029052.
+
+```js
+assert.strictEqual(euler431(), 23.386029052);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler431() {
+
+  return true;
+}
+
+euler431();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
new file mode 100644
index 0000000000..4f0f5928ef
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-432-totient-sum.md
@@ -0,0 +1,42 @@
+---
+id: 5900f51e1000cf542c510030
+title: 'Problem 432: Totient sum'
+challengeType: 5
+forumTopicId: 302103
+dashedName: problem-432-totient-sum
+---
+
+# --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.
+
+# --hints--
+
+`euler432()` should return 754862080.
+
+```js
+assert.strictEqual(euler432(), 754862080);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler432() {
+
+  return true;
+}
+
+euler432();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
new file mode 100644
index 0000000000..5423c8691c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-433-steps-in-euclids-algorithm.md
@@ -0,0 +1,46 @@
+---
+id: 5900f51d1000cf542c51002f
+title: 'Problem 433: Steps in Euclid''s algorithm'
+challengeType: 5
+forumTopicId: 302104
+dashedName: problem-433-steps-in-euclids-algorithm
+---
+
+# --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).
+
+# --hints--
+
+`euler433()` should return 326624372659664.
+
+```js
+assert.strictEqual(euler433(), 326624372659664);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler433() {
+
+  return true;
+}
+
+euler433();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
new file mode 100644
index 0000000000..48a01b7a3b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-434-rigid-graphs.md
@@ -0,0 +1,52 @@
+---
+id: 5900f51f1000cf542c510031
+title: 'Problem 434: Rigid graphs'
+challengeType: 5
+forumTopicId: 302105
+dashedName: problem-434-rigid-graphs
+---
+
+# --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
+
+# --hints--
+
+`euler434()` should return 863253606.
+
+```js
+assert.strictEqual(euler434(), 863253606);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler434() {
+
+  return true;
+}
+
+euler434();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
new file mode 100644
index 0000000000..ee078a7382
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-435-polynomials-of-fibonacci-numbers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5201000cf542c510032
+title: 'Problem 435: Polynomials of Fibonacci numbers'
+challengeType: 5
+forumTopicId: 302106
+dashedName: problem-435-polynomials-of-fibonacci-numbers
+---
+
+# --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!).
+
+# --hints--
+
+`euler435()` should return 252541322550.
+
+```js
+assert.strictEqual(euler435(), 252541322550);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler435() {
+
+  return true;
+}
+
+euler435();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
new file mode 100644
index 0000000000..43b111b868
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-436-unfair-wager.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5221000cf542c510033
+title: 'Problem 436: Unfair wager'
+challengeType: 5
+forumTopicId: 302107
+dashedName: problem-436-unfair-wager
+---
+
+# --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
+
+# --hints--
+
+`euler436()` should return 0.5276662759.
+
+```js
+assert.strictEqual(euler436(), 0.5276662759);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler436() {
+
+  return true;
+}
+
+euler436();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
new file mode 100644
index 0000000000..0072d0f9a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-437-fibonacci-primitive-roots.md
@@ -0,0 +1,64 @@
+---
+id: 5900f5241000cf542c510036
+title: 'Problem 437: Fibonacci primitive roots'
+challengeType: 5
+forumTopicId: 302108
+dashedName: problem-437-fibonacci-primitive-roots
+---
+
+# --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.
+
+# --hints--
+
+`euler437()` should return 74204709657207.
+
+```js
+assert.strictEqual(euler437(), 74204709657207);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler437() {
+
+  return true;
+}
+
+euler437();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
new file mode 100644
index 0000000000..112326a2fa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5231000cf542c510034
+title: 'Problem 438: Integer part of polynomial equation''s solutions'
+challengeType: 5
+forumTopicId: 302109
+dashedName: problem-438-integer-part-of-polynomial-equations-solutions
+---
+
+# --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.
+
+# --hints--
+
+`euler438()` should return 2046409616809.
+
+```js
+assert.strictEqual(euler438(), 2046409616809);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler438() {
+
+  return true;
+}
+
+euler438();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
new file mode 100644
index 0000000000..4fb1871a85
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-439-sum-of-sum-of-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5231000cf542c510035
+title: 'Problem 439: Sum of sum of divisors'
+challengeType: 5
+forumTopicId: 302110
+dashedName: problem-439-sum-of-sum-of-divisors
+---
+
+# --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.
+
+# --hints--
+
+`euler439()` should return 968697378.
+
+```js
+assert.strictEqual(euler439(), 968697378);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler439() {
+
+  return true;
+}
+
+euler439();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
new file mode 100644
index 0000000000..3b89176ca1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-44-pentagon-numbers.md
@@ -0,0 +1,77 @@
+---
+id: 5900f3981000cf542c50feab
+title: 'Problem 44: Pentagon numbers'
+challengeType: 5
+forumTopicId: 302111
+dashedName: problem-44-pentagon-numbers
+---
+
+# --description--
+
+Pentagonal numbers are generated by the formula, P<sub>n</sub>=`n`(3`n`−1)/2. The first ten pentagonal numbers are:
+
+1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
+
+It can be seen that P<sub>4</sub> + P<sub>7</sub> = 22 + 70 = 92 = P<sub>8</sub>. However, their difference, 70 − 22 = 48, is not pentagonal.
+
+Find the pair of pentagonal numbers, P<sub>j</sub> and P<sub>k</sub>, for which their sum and difference are pentagonal and D = |P<sub>k</sub> − P<sub>j</sub>| is minimized; what is the value of D?
+
+# --hints--
+
+`pentagonNumbers()` should return a number.
+
+```js
+assert(typeof pentagonNumbers() === 'number');
+```
+
+`pentagonNumbers()` should return 5482660.
+
+```js
+assert.strictEqual(pentagonNumbers(), 5482660);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pentagonNumbers() {
+
+  return true;
+}
+
+pentagonNumbers();
+```
+
+# --solutions--
+
+```js
+function pentagonNumbers() {
+  function isPentagonal(num) {
+  // Formula found by solving pentagonal number
+  // equation for n.
+  const n = (Math.sqrt((24 * num) + 1) + 1) / 6;
+  return n % 1 === 0;
+  }
+
+  function pentagonal(num) {
+    return (num * ((3 * num) - 1)) / 2;
+  }
+  let result;
+  let i = 1;
+  while (!result) {
+  i++;
+  const num1 = (i * ((3 * i) - 1)) / 2; // Pentagonal num formula
+  const minDiff = num1 - (((i - 1) * ((3 * (i - 1)) - 1)) / 2);
+  let j = i - 1;
+  while (j > 0 && !result) {
+  const num2 = (j * ((3 * j) - 1)) / 2;
+  if (isPentagonal(num1 - num2) && isPentagonal(num1 + num2)) {
+        result = num1 - num2;
+      }
+      j--;
+    }
+  }
+  return result;
+  }
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
new file mode 100644
index 0000000000..a68f99a00a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5241000cf542c510037
+title: 'Problem 440: GCD and Tiling'
+challengeType: 5
+forumTopicId: 302112
+dashedName: problem-440-gcd-and-tiling
+---
+
+# --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.
+
+# --hints--
+
+`euler440()` should return 970746056.
+
+```js
+assert.strictEqual(euler440(), 970746056);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler440() {
+
+  return true;
+}
+
+euler440();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
new file mode 100644
index 0000000000..6cc5fd7e2e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-441-the-inverse-summation-of-coprime-couples.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5261000cf542c510038
+title: 'Problem 441: The inverse summation of coprime couples'
+challengeType: 5
+forumTopicId: 302113
+dashedName: problem-441-the-inverse-summation-of-coprime-couples
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler441()` should return 5000088.8395.
+
+```js
+assert.strictEqual(euler441(), 5000088.8395);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler441() {
+
+  return true;
+}
+
+euler441();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
new file mode 100644
index 0000000000..e5b1e35319
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-442-eleven-free-integers.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5271000cf542c510039
+title: 'Problem 442: Eleven-free integers'
+challengeType: 5
+forumTopicId: 302114
+dashedName: problem-442-eleven-free-integers
+---
+
+# --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).
+
+# --hints--
+
+`euler442()` should return 1295552661530920200.
+
+```js
+assert.strictEqual(euler442(), 1295552661530920200);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler442() {
+
+  return true;
+}
+
+euler442();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
new file mode 100644
index 0000000000..9afda46059
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-443-gcd-sequence.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5271000cf542c51003a
+title: 'Problem 443: GCD sequence'
+challengeType: 5
+forumTopicId: 302115
+dashedName: problem-443-gcd-sequence
+---
+
+# --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:
+
+n 4567891011121314151617181920... g(n) 1314161718272829303132333451545560...
+
+<!-- TODO Use MathJax -->
+
+You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.
+
+Find g(1015).
+
+# --hints--
+
+`euler443()` should return 2744233049300770.
+
+```js
+assert.strictEqual(euler443(), 2744233049300770);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler443() {
+
+  return true;
+}
+
+euler443();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
new file mode 100644
index 0000000000..04d71de485
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-444-the-roundtable-lottery.md
@@ -0,0 +1,53 @@
+---
+id: 5900f52a1000cf542c51003b
+title: 'Problem 444: The Roundtable Lottery'
+challengeType: 5
+forumTopicId: 302116
+dashedName: problem-444-the-roundtable-lottery
+---
+
+# --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).
+
+# --hints--
+
+`euler444()` should return 1.200856722e+263.
+
+```js
+assert.strictEqual(euler444(), 1.200856722e263);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler444() {
+
+  return true;
+}
+
+euler444();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
new file mode 100644
index 0000000000..39c80f706d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-445-retractions-a.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52a1000cf542c51003c
+title: 'Problem 445: Retractions A'
+challengeType: 5
+forumTopicId: 302117
+dashedName: problem-445-retractions-a
+---
+
+# --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
+
+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.
+
+# --hints--
+
+`euler445()` should return 659104042.
+
+```js
+assert.strictEqual(euler445(), 659104042);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler445() {
+
+  return true;
+}
+
+euler445();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
new file mode 100644
index 0000000000..a46677999e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-446-retractions-b.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52c1000cf542c51003d
+title: 'Problem 446: Retractions B'
+challengeType: 5
+forumTopicId: 302118
+dashedName: problem-446-retractions-b
+---
+
+# --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
+
+F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
+
+Find F(107) (mod 1 000 000 007)
+
+# --hints--
+
+`euler446()` should return 907803852.
+
+```js
+assert.strictEqual(euler446(), 907803852);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler446() {
+
+  return true;
+}
+
+euler446();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
new file mode 100644
index 0000000000..c8cb09065c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
@@ -0,0 +1,44 @@
+---
+id: 5900f52c1000cf542c51003e
+title: 'Problem 447: Retractions C'
+challengeType: 5
+forumTopicId: 302119
+dashedName: problem-447-retractions-c
+---
+
+# --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
+
+F(N)=∑R(n) for 2≤n≤N. F(107)≡638042271 (mod 1 000 000 007).
+
+Find F(1014) (mod 1 000 000 007).
+
+# --hints--
+
+`euler447()` should return 530553372.
+
+```js
+assert.strictEqual(euler447(), 530553372);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler447() {
+
+  return true;
+}
+
+euler447();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
new file mode 100644
index 0000000000..6bf716c1d3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-448-average-least-common-multiple.md
@@ -0,0 +1,46 @@
+---
+id: 5900f52c1000cf542c51003f
+title: 'Problem 448: Average least common multiple'
+challengeType: 5
+forumTopicId: 302120
+dashedName: problem-448-average-least-common-multiple
+---
+
+# --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.
+
+# --hints--
+
+`euler448()` should return 106467648.
+
+```js
+assert.strictEqual(euler448(), 106467648);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler448() {
+
+  return true;
+}
+
+euler448();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
new file mode 100644
index 0000000000..18c1923095
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-449-chocolate-covered-candy.md
@@ -0,0 +1,48 @@
+---
+id: 5900f52d1000cf542c510040
+title: 'Problem 449: Chocolate covered candy'
+challengeType: 5
+forumTopicId: 302121
+dashedName: problem-449-chocolate-covered-candy
+---
+
+# --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
+
+<!-- TODO Use MathJax -->
+
+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.
+
+# --hints--
+
+`euler449()` should return 103.37870096.
+
+```js
+assert.strictEqual(euler449(), 103.37870096);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler449() {
+
+  return true;
+}
+
+euler449();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
new file mode 100644
index 0000000000..5c3b224b4a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-45-triangular-pentagonal-and-hexagonal.md
@@ -0,0 +1,82 @@
+---
+id: 5900f3991000cf542c50feac
+title: 'Problem 45: Triangular, pentagonal, and hexagonal'
+challengeType: 5
+forumTopicId: 302122
+dashedName: problem-45-triangular-pentagonal-and-hexagonal
+---
+
+# --description--
+
+Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
+
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Triangle</div><div>T<sub>n</sub>=<var>n</var>(<var>n</var>+1)/2</div><div>1, 3, 6, 10, 15, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Pentagonal</div><div>P<sub>n</sub>=<var>n</var>(3<var>n</var>−1)/2</div><div>1, 5, 12, 22, 35, ...</div></div>
+<div style='display: inline-grid; text-align: center; grid-template-columns: 135px 135px 260px; grid-template-rows: auto;'><div>Hexagonal</div><div>H<sub>n</sub>=<var>n</var>(2<var>n</var>−1)</div><div>1, 6, 15, 28, 45, ...</div></div>
+
+It can be verified that T<sub>285</sub> = P<sub>165</sub> = H<sub>143</sub> = 40755.
+
+Find the next triangle number that is also pentagonal and hexagonal.
+
+# --hints--
+
+`triPentaHexa(40756)` should return a number.
+
+```js
+assert(typeof triPentaHexa(40756) === 'number');
+```
+
+`triPentaHexa(40756)` should return 1533776805.
+
+```js
+assert.strictEqual(triPentaHexa(40756), 1533776805);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function triPentaHexa(n) {
+
+  return true;
+}
+
+triPentaHexa(40756);
+```
+
+# --solutions--
+
+```js
+function triPentaHexa(n) {
+  function triangular(num) {
+  return (num * (num + 1)) / 2;
+}
+
+function isPentagonal(num) {
+  // Formula found by completing the square and
+  // solving for n.
+  const n = (Math.sqrt((24 * num) + 1) + 1) / 6;
+  return n % 1 === 0;
+}
+
+  function isHexagonal(num) {
+  // Formula found by completing the square and
+  // solving for n.
+  const n = Math.sqrt(0.5 * (num + (1 / 8))) + 0.25;
+ return n % 1 === 0;
+}
+
+let iTri = n;
+let tri;
+let found = false;
+while (!found) {
+  iTri++;
+  tri = triangular(iTri);
+  if (isPentagonal(tri) && isHexagonal(tri)) {
+    found = true;
+    }
+  }
+  return tri;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
new file mode 100644
index 0000000000..17cf3af082
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-450-hypocycloid-and-lattice-points.md
@@ -0,0 +1,60 @@
+---
+id: 5900f52e1000cf542c510041
+title: 'Problem 450: Hypocycloid and Lattice points'
+challengeType: 5
+forumTopicId: 302123
+dashedName: problem-450-hypocycloid-and-lattice-points
+---
+
+# --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 &lt; 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).
+
+# --hints--
+
+`euler450()` should return 583333163984220900.
+
+```js
+assert.strictEqual(euler450(), 583333163984220900);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler450() {
+
+  return true;
+}
+
+euler450();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
new file mode 100644
index 0000000000..1b12ec1c22
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-451-modular-inverses.md
@@ -0,0 +1,60 @@
+---
+id: 5900f5311000cf542c510042
+title: 'Problem 451: Modular inverses'
+challengeType: 5
+forumTopicId: 302124
+dashedName: problem-451-modular-inverses
+---
+
+# --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
+
+# --hints--
+
+`euler451()` should return 153651073760956.
+
+```js
+assert.strictEqual(euler451(), 153651073760956);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler451() {
+
+  return true;
+}
+
+euler451();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-452-long-products.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-452-long-products.md
new file mode 100644
index 0000000000..b52ca22d50
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-452-long-products.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5311000cf542c510043
+title: 'Problem 452: Long Products'
+challengeType: 5
+forumTopicId: 302125
+dashedName: problem-452-long-products
+---
+
+# --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.
+
+# --hints--
+
+`euler452()` should return 345558983.
+
+```js
+assert.strictEqual(euler452(), 345558983);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler452() {
+
+  return true;
+}
+
+euler452();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
new file mode 100644
index 0000000000..69b668a626
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-453-lattice-quadrilaterals.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5311000cf542c510044
+title: 'Problem 453: Lattice Quadrilaterals'
+challengeType: 5
+forumTopicId: 302126
+dashedName: problem-453-lattice-quadrilaterals
+---
+
+# --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.
+
+# --hints--
+
+`euler453()` should return 104354107.
+
+```js
+assert.strictEqual(euler453(), 104354107);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler453() {
+
+  return true;
+}
+
+euler453();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
new file mode 100644
index 0000000000..414cfab965
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-454-diophantine-reciprocals-iii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5331000cf542c510045
+title: 'Problem 454: Diophantine reciprocals III'
+challengeType: 5
+forumTopicId: 302127
+dashedName: problem-454-diophantine-reciprocals-iii
+---
+
+# --description--
+
+In the following equation x, y, and n are positive integers. 1/x + 1/y= 1/n
+
+<!-- TODO Use MathJax -->
+
+For a limit L we define F(L) as the number of solutions which satisfy x &lt; y ≤ L.
+
+We can verify that F(15) = 4 and F(1000) = 1069. Find F(1012).
+
+# --hints--
+
+`euler454()` should return 5435004633092.
+
+```js
+assert.strictEqual(euler454(), 5435004633092);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler454() {
+
+  return true;
+}
+
+euler454();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
new file mode 100644
index 0000000000..71202a5f3f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-455-powers-with-trailing-digits.md
@@ -0,0 +1,42 @@
+---
+id: 5900f5331000cf542c510046
+title: 'Problem 455: Powers With Trailing Digits'
+challengeType: 5
+forumTopicId: 302129
+dashedName: problem-455-powers-with-trailing-digits
+---
+
+# --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.
+
+# --hints--
+
+`euler455()` should return 450186511399999.
+
+```js
+assert.strictEqual(euler455(), 450186511399999);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler455() {
+
+  return true;
+}
+
+euler455();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
new file mode 100644
index 0000000000..fba2743a69
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-456-triangles-containing-the-origin-ii.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5351000cf542c510047
+title: 'Problem 456: Triangles containing the origin II'
+challengeType: 5
+forumTopicId: 302130
+dashedName: problem-456-triangles-containing-the-origin-ii
+---
+
+# --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).
+
+# --hints--
+
+`euler456()` should return 333333208685971500.
+
+```js
+assert.strictEqual(euler456(), 333333208685971500);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler456() {
+
+  return true;
+}
+
+euler456();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
new file mode 100644
index 0000000000..77c3da532c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5361000cf542c510048
+title: 'Problem 457: A polynomial modulo the square of a prime'
+challengeType: 5
+forumTopicId: 302131
+dashedName: problem-457-a-polynomial-modulo-the-square-of-a-prime
+---
+
+# --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).
+
+# --hints--
+
+`euler457()` should return 2647787126797397000.
+
+```js
+assert.strictEqual(euler457(), 2647787126797397000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler457() {
+
+  return true;
+}
+
+euler457();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
new file mode 100644
index 0000000000..de844d0fe5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-458-permutations-of-project.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5361000cf542c510049
+title: 'Problem 458: Permutations of Project'
+challengeType: 5
+forumTopicId: 302132
+dashedName: problem-458-permutations-of-project
+---
+
+# --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.
+
+# --hints--
+
+`euler458()` should return 423341841.
+
+```js
+assert.strictEqual(euler458(), 423341841);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler458() {
+
+  return true;
+}
+
+euler458();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
new file mode 100644
index 0000000000..72134eec52
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-459-flipping-game.md
@@ -0,0 +1,52 @@
+---
+id: 5900f5371000cf542c51004a
+title: 'Problem 459: Flipping game'
+challengeType: 5
+forumTopicId: 302133
+dashedName: problem-459-flipping-game
+---
+
+# --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).
+
+# --hints--
+
+`euler459()` should return 3996390106631.
+
+```js
+assert.strictEqual(euler459(), 3996390106631);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler459() {
+
+  return true;
+}
+
+euler459();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
new file mode 100644
index 0000000000..9cd82e5bdf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-46-goldbachs-other-conjecture.md
@@ -0,0 +1,99 @@
+---
+id: 5900f39a1000cf542c50fead
+title: 'Problem 46: Goldbach''s other conjecture'
+challengeType: 5
+forumTopicId: 302134
+dashedName: problem-46-goldbachs-other-conjecture
+---
+
+# --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.
+
+<div style='margin-left: 2em;'>
+  9 = 7 + 2×1<sup>2</sup><br>
+  15 = 7 + 2×2<sup>2</sup><br>
+  21 = 3 + 2×3<sup>2</sup><br>
+  25 = 7 + 2×3<sup>2</sup><br>
+  27 = 19 + 2×2<sup>2</sup><br>
+  33 = 31 + 2×1<sup>2</sup>
+</div>
+
+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?
+
+# --hints--
+
+`goldbachsOtherConjecture()` should return a number.
+
+```js
+assert(typeof goldbachsOtherConjecture() === 'number');
+```
+
+`goldbachsOtherConjecture()` should return 5777.
+
+```js
+assert.strictEqual(goldbachsOtherConjecture(), 5777);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function goldbachsOtherConjecture() {
+
+  return true;
+}
+
+goldbachsOtherConjecture();
+```
+
+# --solutions--
+
+```js
+function goldbachsOtherConjecture() {  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function isSquare(num) {
+    return Math.sqrt(num) % 1 === 0;
+  }
+
+  // construct a list of prime numbers
+  const primes = [];
+  for (let i = 2; primes.length < 1000; i++) {
+    if (isPrime(i)) primes.push(i);
+  }
+
+  let num = 3;
+  let answer;
+  while (!answer) {
+    num += 2;
+    if (!isPrime(num)) {
+      let found = false;
+      for (let primeI = 0; primeI < primes.length && !found; primeI++) {
+        const square = (num - primes[primeI]) / 2;
+        if (isSquare(square)) {
+          found = true;
+          break;
+        }
+      }
+      if (!found) answer = num;
+    }
+  }
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
new file mode 100644
index 0000000000..467a9693c3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-460-an-ant-on-the-move.md
@@ -0,0 +1,48 @@
+---
+id: 5900f5381000cf542c51004b
+title: 'Problem 460: An ant on the move'
+challengeType: 5
+forumTopicId: 302135
+dashedName: problem-460-an-ant-on-the-move
+---
+
+# --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.
+
+# --hints--
+
+`euler460()` should return 18.420738199.
+
+```js
+assert.strictEqual(euler460(), 18.420738199);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler460() {
+
+  return true;
+}
+
+euler460();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
new file mode 100644
index 0000000000..10a83e63f8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-461-almost-pi.md
@@ -0,0 +1,153 @@
+---
+id: 5900f53a1000cf542c51004c
+title: 'Problem 461: Almost Pi'
+challengeType: 5
+forumTopicId: 302136
+dashedName: problem-461-almost-pi
+---
+
+# --description--
+
+Let `f(k, n)` = $e^\frac{k}{n} - 1$, for all non-negative integers `k`.
+
+Remarkably, `f(6, 200) + f(75, 200) + f(89, 200) + f(226, 200)` = 3.1415926… ≈ π.
+
+In fact, it is the best approximation of π of the form `f(a, 200) + f(b, 200) + f(c, 200) + f(d, 200)`.
+
+Let `almostPi(n)` = a<sup>2</sup> + b<sup>2</sup> + c<sup>2</sup> + d<sup>2</sup> for a, b, c, d that minimize the error: $\lvert f(a,n) + f(b,n) + f(c,n) + f(d,n) - \Pi\rvert$
+
+You are given `almostPi(200)` = 6<sup>2</sup> + 75<sup>2</sup> + 89<sup>2</sup> + 226<sup>2</sup> = 64658.
+
+# --hints--
+
+`almostPi` should be a function.
+
+```js
+assert(typeof almostPi === 'function')
+```
+
+`almostPi` should return a number.
+
+```js
+assert.strictEqual(typeof almostPi(10), 'number');
+```
+
+`almostPi(29)` should return `1208`.
+
+```js
+assert.strictEqual(almostPi(29), 1208);
+```
+
+`almostPi(50)` should return `4152`.
+
+```js
+assert.strictEqual(almostPi(50), 4152);
+```
+
+`almostPi(200)` should return `64658`.
+
+```js
+assert.strictEqual(almostPi(200), 64658);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function almostPi(n) {
+  
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function almostPi(n) {
+
+  // Find all possible values where f(k, n) <= PI
+  const f = [];
+  let max = 0;
+  while (1) {
+    let current = Math.exp(max / n) - 1;
+
+    if (current > Math.PI) break;
+
+    f.push(current);
+    ++max;
+  }
+
+  // Get all pairs where f[i] + f[j] <= PI
+  const pairs = [];
+  for (let i = 0; i < max; ++i) {
+    for (let j = 0; j < max; ++j) {
+      if (f[i] + f[j] > Math.PI) break;
+      pairs.push(f[i] + f[j]);
+    }
+  }
+
+  // Sort all values
+  pairs.sort((a, b) => a - b);
+
+  // Optimal Value for (a + b)
+  let left = 0;
+  // Optimal Value for (c + d)
+  let right = 0;
+  // minimum error with Math.abs(a + b - Math.PI)
+  let minError = Math.PI;
+
+  // Binary Search for the best match
+  for (let i = 0; i < pairs.length; ++i) {
+    let current = pairs[i];
+    let need = Math.PI - current;
+
+    if (need < current) break;
+
+    let match;
+    for (let i = 1; i < pairs.length; ++i) {
+      if (pairs[i] > need) {
+        match = i;
+        break;
+      }
+    }
+
+    let error = Math.abs(need - pairs[match]);
+    if (error < minError)
+    {
+      minError = error;
+      left = i;
+      right = match;
+    }
+
+    --match;
+    error = Math.abs(need - pairs[match]);
+    if (error < minError) {
+      minError = error;
+      left = i;
+      right = match;
+    }
+  }
+
+  let a, b, c, d;
+
+  OuterLoop1:
+  for (a = 0; a < max; ++a) {
+    for (b = a; b < max; ++b) {
+      if (pairs[left] == f[a] + f[b]) {
+        break OuterLoop1;
+      }
+    }
+  }
+
+  OuterLoop2:
+  for (c = 0; c < max; ++c) {
+    for (d = c; d < max; ++d) {
+      if (pairs[right] == f[c] + f[d]) {
+        break OuterLoop2;
+      }
+    }
+  }
+  return a*a + b*b + c*c + d*d;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
new file mode 100644
index 0000000000..6eb9550e45
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-462-permutation-of-3-smooth-numbers.md
@@ -0,0 +1,52 @@
+---
+id: 5900f53b1000cf542c51004d
+title: 'Problem 462: Permutation of 3-smooth numbers'
+challengeType: 5
+forumTopicId: 302137
+dashedName: problem-462-permutation-of-3-smooth-numbers
+---
+
+# --description--
+
+<!-- TODO use MathJax -->
+
+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.
+
+# --hints--
+
+`euler462()` should return Infinity.
+
+```js
+assert.strictEqual(euler462(), Infinity);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler462() {
+
+  return true;
+}
+
+euler462();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
new file mode 100644
index 0000000000..014935108f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-463-a-weird-recurrence-relation.md
@@ -0,0 +1,50 @@
+---
+id: 5900f53c1000cf542c51004e
+title: 'Problem 463: A weird recurrence relation'
+challengeType: 5
+forumTopicId: 302138
+dashedName: problem-463-a-weird-recurrence-relation
+---
+
+# --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.
+
+# --hints--
+
+`euler463()` should return 808981553.
+
+```js
+assert.strictEqual(euler463(), 808981553);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler463() {
+
+  return true;
+}
+
+euler463();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
new file mode 100644
index 0000000000..5b209dd1d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-464-mbius-function-and-intervals.md
@@ -0,0 +1,50 @@
+---
+id: 5900f53d1000cf542c51004f
+title: 'Problem 464: Möbius function and intervals'
+challengeType: 5
+forumTopicId: 302139
+dashedName: problem-464-mbius-function-and-intervals
+---
+
+# --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).
+
+# --hints--
+
+`euler464()` should return 198775297232878.
+
+```js
+assert.strictEqual(euler464(), 198775297232878);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler464() {
+
+  return true;
+}
+
+euler464();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
new file mode 100644
index 0000000000..2baaf0d775
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-465-polar-polygons.md
@@ -0,0 +1,52 @@
+---
+id: 5900f53d1000cf542c510050
+title: 'Problem 465: Polar polygons'
+challengeType: 5
+forumTopicId: 302140
+dashedName: problem-465-polar-polygons
+---
+
+# --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.
+
+# --hints--
+
+`euler465()` should return 585965659.
+
+```js
+assert.strictEqual(euler465(), 585965659);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler465() {
+
+  return true;
+}
+
+euler465();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
new file mode 100644
index 0000000000..3050ea410b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-466-distinct-terms-in-a-multiplication-table.md
@@ -0,0 +1,48 @@
+---
+id: 5900f53e1000cf542c510051
+title: 'Problem 466: Distinct terms in a multiplication table'
+challengeType: 5
+forumTopicId: 302141
+dashedName: problem-466-distinct-terms-in-a-multiplication-table
+---
+
+# --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).
+
+# --hints--
+
+`euler466()` should return 258381958195474750.
+
+```js
+assert.strictEqual(euler466(), 258381958195474750);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler466() {
+
+  return true;
+}
+
+euler466();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-467-superinteger.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
new file mode 100644
index 0000000000..8cfd9dc16a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-467-superinteger.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5411000cf542c510052
+title: 'Problem 467: Superinteger'
+challengeType: 5
+forumTopicId: 302142
+dashedName: problem-467-superinteger
+---
+
+# --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.
+
+# --hints--
+
+`euler467()` should return 775181359.
+
+```js
+assert.strictEqual(euler467(), 775181359);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler467() {
+
+  return true;
+}
+
+euler467();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
new file mode 100644
index 0000000000..239d2cf56d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-468-smooth-divisors-of-binomial-coefficients.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5411000cf542c510054
+title: 'Problem 468: Smooth divisors of binomial coefficients'
+challengeType: 5
+forumTopicId: 302143
+dashedName: problem-468-smooth-divisors-of-binomial-coefficients
+---
+
+# --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.
+
+# --hints--
+
+`euler468()` should return 852950321.
+
+```js
+assert.strictEqual(euler468(), 852950321);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler468() {
+
+  return true;
+}
+
+euler468();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
new file mode 100644
index 0000000000..4e8be025a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-469-empty-chairs.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5411000cf542c510053
+title: 'Problem 469: Empty chairs'
+challengeType: 5
+forumTopicId: 302144
+dashedName: problem-469-empty-chairs
+---
+
+# --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.
+
+# --hints--
+
+`euler469()` should return 0.56766764161831.
+
+```js
+assert.strictEqual(euler469(), 0.56766764161831);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler469() {
+
+  return true;
+}
+
+euler469();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
new file mode 100644
index 0000000000..998b035f79
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-47-distinct-primes-factors.md
@@ -0,0 +1,113 @@
+---
+id: 5900f39c1000cf542c50feae
+title: 'Problem 47: Distinct primes factors'
+challengeType: 5
+forumTopicId: 302145
+dashedName: problem-47-distinct-primes-factors
+---
+
+# --description--
+
+The first two consecutive numbers to have two distinct prime factors are:
+
+<div style='padding-left: 4em;'>
+  14 = 2 × 7<br>
+  15 = 3 × 5
+</div>
+
+The first three consecutive numbers to have three distinct prime factors are:
+
+<div style='padding-left: 4em;'>
+  644 = 2<sup>2</sup> × 7 × 23<br>
+  645 = 3 × 5 × 43<br>
+  646 = 2 × 17 × 19
+</div>
+
+Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?
+
+# --hints--
+
+`distinctPrimeFactors(2, 2)` should return a number.
+
+```js
+assert(typeof distinctPrimeFactors(2, 2) === 'number');
+```
+
+`distinctPrimeFactors(2, 2)` should return 14.
+
+```js
+assert.strictEqual(distinctPrimeFactors(2, 2), 14);
+```
+
+`distinctPrimeFactors(3, 3)` should return 644.
+
+```js
+assert.strictEqual(distinctPrimeFactors(3, 3), 644);
+```
+
+`distinctPrimeFactors(4, 4)` should return 134043.
+
+```js
+assert.strictEqual(distinctPrimeFactors(4, 4), 134043);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
+
+  return true;
+}
+
+distinctPrimeFactors(4, 4);
+```
+
+# --solutions--
+
+```js
+function distinctPrimeFactors(targetNumPrimes, targetConsecutive) {
+  function numberOfPrimeFactors(n) {
+    let factors = 0;
+
+    //  Considering 2 as a special case
+    let firstFactor = true;
+    while (n % 2 == 0) {
+      n = n / 2;
+      if (firstFactor) {
+        factors++;
+        firstFactor = false;
+      }
+    }
+    // Adding other factors
+    for (let i = 3; i < Math.sqrt(n); i += 2) {
+      firstFactor = true;
+      while (n % i == 0) {
+        n = n / i;
+        if (firstFactor) {
+          factors++;
+          firstFactor = false;
+        }
+      }
+    }
+
+    if (n > 1) { factors++; }
+
+    return factors;
+  }
+
+  let number = 0;
+  let consecutive = 0;
+
+  while (consecutive < targetConsecutive) {
+    number++;
+    if (numberOfPrimeFactors(number) >= targetNumPrimes) {
+      consecutive++;
+    } else {
+      consecutive = 0;
+    }
+  }
+  return number - targetConsecutive + 1;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
new file mode 100644
index 0000000000..10ee6d95d8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-470-super-ramvok.md
@@ -0,0 +1,50 @@
+---
+id: 5900f5431000cf542c510055
+title: 'Problem 470: Super Ramvok'
+challengeType: 5
+forumTopicId: 302146
+dashedName: problem-470-super-ramvok
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler470()` should return 147668794.
+
+```js
+assert.strictEqual(euler470(), 147668794);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler470() {
+
+  return true;
+}
+
+euler470();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
new file mode 100644
index 0000000000..95385ddec9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-471-triangle-inscribed-in-ellipse.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5431000cf542c510056
+title: 'Problem 471: Triangle inscribed in ellipse'
+challengeType: 5
+forumTopicId: 302148
+dashedName: problem-471-triangle-inscribed-in-ellipse
+---
+
+# --description--
+
+The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 &lt; 2b &lt; 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.
+
+# --hints--
+
+`euler471()` should return 1.895093981e+31.
+
+```js
+assert.strictEqual(euler471(), 1.895093981e31);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler471() {
+
+  return true;
+}
+
+euler471();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
new file mode 100644
index 0000000000..f4e9015549
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-472-comfortable-distance-ii.md
@@ -0,0 +1,56 @@
+---
+id: 5900f5451000cf542c510057
+title: 'Problem 472: Comfortable Distance II'
+challengeType: 5
+forumTopicId: 302149
+dashedName: problem-472-comfortable-distance-ii
+---
+
+# --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.
+
+# --hints--
+
+`euler472()` should return 73811586.
+
+```js
+assert.strictEqual(euler472(), 73811586);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler472() {
+
+  return true;
+}
+
+euler472();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
new file mode 100644
index 0000000000..505c8a757b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-473-phigital-number-base.md
@@ -0,0 +1,54 @@
+---
+id: 5900f5461000cf542c510058
+title: 'Problem 473: Phigital number base'
+challengeType: 5
+forumTopicId: 302150
+dashedName: problem-473-phigital-number-base
+---
+
+# --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.
+
+# --hints--
+
+`euler473()` should return 35856681704365.
+
+```js
+assert.strictEqual(euler473(), 35856681704365);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler473() {
+
+  return true;
+}
+
+euler473();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
new file mode 100644
index 0000000000..5c77726bd2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-474-last-digits-of-divisors.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5471000cf542c510059
+title: 'Problem 474: Last digits of divisors'
+challengeType: 5
+forumTopicId: 302151
+dashedName: problem-474-last-digits-of-divisors
+---
+
+# --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).
+
+# --hints--
+
+`euler474()` should return 9690646731515010.
+
+```js
+assert.strictEqual(euler474(), 9690646731515010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler474() {
+
+  return true;
+}
+
+euler474();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-475-music-festival.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
new file mode 100644
index 0000000000..dd8cf3538b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-475-music-festival.md
@@ -0,0 +1,46 @@
+---
+id: 5900f5481000cf542c51005a
+title: 'Problem 475: Music festival'
+challengeType: 5
+forumTopicId: 302152
+dashedName: problem-475-music-festival
+---
+
+# --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.
+
+# --hints--
+
+`euler475()` should return 75780067.
+
+```js
+assert.strictEqual(euler475(), 75780067);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler475() {
+
+  return true;
+}
+
+euler475();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
new file mode 100644
index 0000000000..a5a8bf868b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-476-circle-packing-ii.md
@@ -0,0 +1,44 @@
+---
+id: 5900f5481000cf542c51005b
+title: 'Problem 476: Circle Packing II'
+challengeType: 5
+forumTopicId: 302153
+dashedName: problem-476-circle-packing-ii
+---
+
+# --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 &lt; 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.
+
+# --hints--
+
+`euler476()` should return 110242.87794.
+
+```js
+assert.strictEqual(euler476(), 110242.87794);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler476() {
+
+  return true;
+}
+
+euler476();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
new file mode 100644
index 0000000000..f4c95faba7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-477-number-sequence-game.md
@@ -0,0 +1,66 @@
+---
+id: 5900f54a1000cf542c51005c
+title: 'Problem 477: Number Sequence Game'
+challengeType: 5
+forumTopicId: 302154
+dashedName: problem-477-number-sequence-game
+---
+
+# --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).
+
+# --hints--
+
+`euler477()` should return 25044905874565164.
+
+```js
+assert.strictEqual(euler477(), 25044905874565164);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler477() {
+
+  return true;
+}
+
+euler477();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-478-mixtures.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
new file mode 100644
index 0000000000..37e7681ecf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-478-mixtures.md
@@ -0,0 +1,50 @@
+---
+id: 5900f54c1000cf542c51005e
+title: 'Problem 478: Mixtures'
+challengeType: 5
+forumTopicId: 302155
+dashedName: problem-478-mixtures
+---
+
+# --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.
+
+# --hints--
+
+`euler478()` should return 59510340.
+
+```js
+assert.strictEqual(euler478(), 59510340);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler478() {
+
+  return true;
+}
+
+euler478();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
new file mode 100644
index 0000000000..202e7e04be
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-479-roots-on-the-rise.md
@@ -0,0 +1,46 @@
+---
+id: 5900f54b1000cf542c51005d
+title: 'Problem 479: Roots on the Rise'
+challengeType: 5
+forumTopicId: 302156
+dashedName: problem-479-roots-on-the-rise
+---
+
+# --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.
+
+# --hints--
+
+`euler479()` should return 191541795.
+
+```js
+assert.strictEqual(euler479(), 191541795);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler479() {
+
+  return true;
+}
+
+euler479();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-48-self-powers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
new file mode 100644
index 0000000000..58e654f893
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-48-self-powers.md
@@ -0,0 +1,80 @@
+---
+id: 5900f39c1000cf542c50feaf
+title: 'Problem 48: Self powers'
+challengeType: 5
+forumTopicId: 302157
+dashedName: problem-48-self-powers
+---
+
+# --description--
+
+The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
+
+Find the last ten digits of the series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.
+
+# --hints--
+
+`selfPowers(10, 3)` should return a number.
+
+```js
+assert(typeof selfPowers(10, 3) === 'number');
+```
+
+`selfPowers(10, 3)` should return 317.
+
+```js
+assert.strictEqual(selfPowers(10, 3), 317);
+```
+
+`selfPowers(150, 6)` should return 29045.
+
+```js
+assert.strictEqual(selfPowers(150, 6), 29045);
+```
+
+`selfPowers(673, 7)` should return 2473989.
+
+```js
+assert.strictEqual(selfPowers(673, 7), 2473989);
+```
+
+`selfPowers(1000, 10)` should return 9110846700.
+
+```js
+assert.strictEqual(selfPowers(1000, 10), 9110846700);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function selfPowers(power, lastDigits) {
+
+  return true;
+}
+
+selfPowers(1000, 10);
+```
+
+# --solutions--
+
+```js
+function selfPowers(power, lastDigits) {
+  let sum = 0;
+  const modulo = Math.pow(10, lastDigits);
+
+  for (let i = 1; i <= power; i++) {
+    let temp = i;
+    for (let j = 1; j < i; j++) {
+      temp *= i;
+      temp %= modulo;
+    }
+
+    sum += temp;
+    sum %= modulo;
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
new file mode 100644
index 0000000000..9e2ac8d96d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-480-the-last-question.md
@@ -0,0 +1,114 @@
+---
+id: 5900f54c1000cf542c51005f
+title: 'Problem 480: The Last Question'
+challengeType: 5
+forumTopicId: 302158
+dashedName: problem-480-the-last-question
+---
+
+# --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).
+
+# --hints--
+
+`euler480()` should return turnthestarson.
+
+```js
+assert.strictEqual(euler480(), turnthestarson);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function euler480() {
+
+  return true;
+}
+
+euler480();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
new file mode 100644
index 0000000000..0dc7ae0ddc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-49-prime-permutations.md
@@ -0,0 +1,93 @@
+---
+id: 5900f39d1000cf542c50feb0
+title: 'Problem 49: Prime permutations'
+challengeType: 5
+forumTopicId: 302159
+dashedName: problem-49-prime-permutations
+---
+
+# --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?
+
+# --hints--
+
+`primePermutations()` should return a number.
+
+```js
+assert(typeof primePermutations() === 'number');
+```
+
+`primePermutations()` should return 296962999629.
+
+```js
+assert.strictEqual(primePermutations(), 296962999629);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePermutations() {
+
+  return true;
+}
+
+primePermutations();
+```
+
+# --solutions--
+
+```js
+function primePermutations() {
+  function arePermutations(num1, num2) {
+    const numStr1 = num1.toString();
+    let numStr2 = num2.toString();
+    if (numStr1.length !== numStr2.length) {
+      return false;
+    }
+
+    for (let i = 0; i < numStr1.length; i++) {
+      const index = numStr2.indexOf(numStr1[i]);
+      if (index === -1) {
+        return false;
+      }
+      numStr2 = numStr2.slice(0, index) + numStr2.slice(index + 1);
+    }
+    return true;
+  }
+
+  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  for (let num1 = 1000; num1 <= 9999; num1++) {
+    const num2 = num1 + 3330;
+    const num3 = num2 + 3330;
+    if (isPrime(num1) && isPrime(num2) && isPrime(num3)) {
+      if (arePermutations(num1, num2) && arePermutations(num1, num3)
+        && num1 !== 1487) {
+        // concatenate and return numbers
+        return (num1 * 100000000) + (num2 * 10000) + num3;
+      }
+    }
+  }
+  return 0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
new file mode 100644
index 0000000000..bdece251d7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3711000cf542c50fe84
+title: 'Problem 5: Smallest multiple'
+challengeType: 5
+forumTopicId: 302160
+dashedName: problem-5-smallest-multiple
+---
+
+# --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 `n`?
+
+# --hints--
+
+`smallestMult(5)` should return a number.
+
+```js
+assert(typeof smallestMult(5) === 'number');
+```
+
+`smallestMult(5)` should return 60.
+
+```js
+assert.strictEqual(smallestMult(5), 60);
+```
+
+`smallestMult(7)` should return 420.
+
+```js
+assert.strictEqual(smallestMult(7), 420);
+```
+
+`smallestMult(10)` should return 2520.
+
+```js
+assert.strictEqual(smallestMult(10), 2520);
+```
+
+`smallestMult(13)` should return 360360.
+
+```js
+assert.strictEqual(smallestMult(13), 360360);
+```
+
+`smallestMult(20)` should return 232792560.
+
+```js
+assert.strictEqual(smallestMult(20), 232792560);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function smallestMult(n) {
+
+  return true;
+}
+
+smallestMult(20);
+```
+
+# --solutions--
+
+```js
+function smallestMult(n){
+  function gcd(a, b) {
+    return b === 0 ? a : gcd(b, a%b); // Euclidean algorithm
+  }
+
+  function lcm(a, b) {
+    return a * b / gcd(a, b);
+  }
+  var result = 1;
+  for(var i = 2; i <= n; i++) {
+    result = lcm(result, i);
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
new file mode 100644
index 0000000000..92924bf85e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-50-consecutive-prime-sum.md
@@ -0,0 +1,95 @@
+---
+id: 5900f39e1000cf542c50feb1
+title: 'Problem 50: Consecutive prime sum'
+challengeType: 5
+forumTopicId: 302161
+dashedName: problem-50-consecutive-prime-sum
+---
+
+# --description--
+
+The prime 41, can be written as the sum of six consecutive primes:
+
+<div style='text-align: center;'>41 = 2 + 3 + 5 + 7 + 11 + 13</div>
+
+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?
+
+# --hints--
+
+`consecutivePrimeSum(1000)` should return a number.
+
+```js
+assert(typeof consecutivePrimeSum(1000) === 'number');
+```
+
+`consecutivePrimeSum(1000)` should return 953.
+
+```js
+assert.strictEqual(consecutivePrimeSum(1000), 953);
+```
+
+`consecutivePrimeSum(1000000)` should return 997651.
+
+```js
+assert.strictEqual(consecutivePrimeSum(1000000), 997651);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function consecutivePrimeSum(limit) {
+
+  return true;
+}
+
+consecutivePrimeSum(1000000);
+```
+
+# --solutions--
+
+```js
+function consecutivePrimeSum(limit) {
+  function isPrime(num) {
+    if (num < 2) {
+      return false;
+    } else if (num === 2) {
+      return true;
+    }
+    const sqrtOfNum = Math.floor(num ** 0.5);
+    for (let i = 2; i <= sqrtOfNum + 1; i++) {
+      if (num % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+  function getPrimes(limit) {
+    const primes = [];
+    for (let i = 0; i <= limit; i++) {
+      if (isPrime(i)) primes.push(i);
+    }
+    return primes;
+  }
+
+  const primes = getPrimes(limit);
+  let primeSum = [...primes];
+  primeSum.reduce((acc, n, i) => {
+    primeSum[i] += acc;
+    return acc += n;
+  }, 0);
+
+  for (let j = primeSum.length - 1; j >= 0; j--) {
+    for (let i = 0; i < j; i++) {
+      const sum = primeSum[j] - primeSum[i];
+      if (sum > limit) break;
+      if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
new file mode 100644
index 0000000000..7190e580ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-51-prime-digit-replacements.md
@@ -0,0 +1,48 @@
+---
+id: 5900f39f1000cf542c50feb2
+title: 'Problem 51: Prime digit replacements'
+challengeType: 5
+forumTopicId: 302162
+dashedName: problem-51-prime-digit-replacements
+---
+
+# --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.
+
+# --hints--
+
+`primeDigitReplacements()` should return a number.
+
+```js
+assert(typeof primeDigitReplacements() === 'number');
+```
+
+`primeDigitReplacements()` should return 121313.
+
+```js
+assert.strictEqual(primeDigitReplacements(), 121313);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeDigitReplacements() {
+
+  return true;
+}
+
+primeDigitReplacements();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
new file mode 100644
index 0000000000..d5431d8135
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-52-permuted-multiples.md
@@ -0,0 +1,81 @@
+---
+id: 5900f3a01000cf542c50feb3
+title: 'Problem 52: Permuted multiples'
+challengeType: 5
+forumTopicId: 302163
+dashedName: problem-52-permuted-multiples
+---
+
+# --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, such that multiplied by integers $\\{2, 3, \ldots, n\\}$, contain the same digits.
+
+# --hints--
+
+`permutedMultiples(2)` should return a number.
+
+```js
+assert(typeof permutedMultiples(2) === 'number');
+```
+
+`permutedMultiples(2)` should return `125874`.
+
+```js
+assert.strictEqual(permutedMultiples(2), 125874);
+```
+
+`permutedMultiples(6)` should return `142857`.
+
+```js
+assert.strictEqual(permutedMultiples(6), 142857);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permutedMultiples(n) {
+
+  return true;
+}
+
+permutedMultiples(2);
+```
+
+# --solutions--
+
+```js
+function permutedMultiples(n) {
+    const isPermutation = (a, b) =>
+        a.length !== b.length
+            ? false
+            : a.split('').sort().join() === b.split('').sort().join();
+
+
+    let start = 1;
+    let found = false;
+    let result = 0;
+
+    while (!found) {
+        start *= 10;
+        for (let i = start; i < start * 10 / n; i++) {
+            found = true;
+            for (let j = 2; j <= n; j++) {
+                if (!isPermutation(i + '', j * i + '')) {
+                    found = false;
+                    break;
+                }
+            }
+            if (found) {
+                result = i;
+                break;
+            }
+        }
+    }
+
+    return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
new file mode 100644
index 0000000000..dbd39ef975
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-53-combinatoric-selections.md
@@ -0,0 +1,89 @@
+---
+id: 5900f3a11000cf542c50feb4
+title: 'Problem 53: Combinatoric selections'
+challengeType: 5
+forumTopicId: 302164
+dashedName: problem-53-combinatoric-selections
+---
+
+# --description--
+
+There are exactly ten ways of selecting three from five, 12345:
+
+<div style='text-align: center;'>123, 124, 125, 134, 135, 145, 234, 235, 245, and 345</div>
+
+In combinatorics, we use the notation, $\\displaystyle \\binom 5 3 = 10$
+
+In general, $\\displaystyle \\binom n r = \\dfrac{n!}{r!(n-r)!}$, where $r \\le n$, $n! = n \\times (n-1) \\times ... \\times 3 \\times 2 \\times 1$, and $0! = 1$.
+
+It is not until $n = 23$, that a value exceeds one-million: $\\displaystyle \\binom {23} {10} = 1144066$.
+
+How many, not necessarily distinct, values of $\\displaystyle \\binom n r$ for $1 \\le n \\le 100$, are greater than one-million?
+
+# --hints--
+
+`combinatoricSelections(1000)` should return a number.
+
+```js
+assert(typeof combinatoricSelections(1000) === 'number');
+```
+
+`combinatoricSelections(1000)` should return 4626.
+
+```js
+assert.strictEqual(combinatoricSelections(1000), 4626);
+```
+
+`combinatoricSelections(10000)` should return 4431.
+
+```js
+assert.strictEqual(combinatoricSelections(10000), 4431);
+```
+
+`combinatoricSelections(100000)` should return 4255.
+
+```js
+assert.strictEqual(combinatoricSelections(100000), 4255);
+```
+
+`combinatoricSelections(1000000)` should return 4075.
+
+```js
+assert.strictEqual(combinatoricSelections(1000000), 4075);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function combinatoricSelections(limit) {
+
+  return 1;
+}
+
+combinatoricSelections(1000000);
+```
+
+# --solutions--
+
+```js
+function combinatoricSelections(limit) {
+    const factorial = n =>
+        Array.apply(null, { length: n })
+            .map((_, i) => i + 1)
+            .reduce((p, c) => p * c, 1);
+
+    let result = 0;
+    const nMax = 100;
+
+    for (let n = 1; n <= nMax; n++) {
+        for (let r = 0; r <= n; r++) {
+            if (factorial(n) / (factorial(r) * factorial(n - r)) >= limit)
+                result++;
+        }
+    }
+
+    return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
new file mode 100644
index 0000000000..16e04a9885
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-54-poker-hands.md
@@ -0,0 +1,1096 @@
+---
+id: 5900f3a21000cf542c50feb5
+title: 'Problem 54: Poker hands'
+challengeType: 5
+forumTopicId: 302165
+dashedName: problem-54-poker-hands
+---
+
+# --description--
+
+In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:
+
+<ul>
+  <li>High Card: Highest value card.</li>
+  <li>One Pair: Two cards of the same value.</li>
+  <li>Two Pairs: Two different pairs.</li>
+  <li>Three of a Kind: Three cards of the same value.</li>
+  <li>Straight: All cards are consecutive values.</li>
+  <li>Flush: All cards of the same suit.</li>
+  <li>Full House: Three of a kind and a pair.</li>
+  <li>Four of a Kind: Four cards of the same value.</li>
+  <li>Straight Flush: All cards are consecutive values of same suit.</li>
+  <li>Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.</li>
+</ul>
+
+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   |
+| ------------------ | --------------------------------------------------------- | ---------------------------------------------------------- | -------- |
+| <strong>1</strong> | 5H 5C 6S 7S KD <br> Pair of Fives                         | 2C 3S 8S 8D TD <br> Pair of Eights                         | Player 2 |
+| <strong>2</strong> | 5D 8C 9S JS AC <br> Highest card Ace                      | 2C 5C 7D 8S QH <br> Highest card Queen                     | Player 1 |
+| <strong>3</strong> | 2D 9C AS AH AC <br> Three Aces                            | 3D 6D 7D TD QD <br> Flush with Diamonds                    | Player 2 |
+| <strong>4</strong> | 4D 6S 9H QH QC <br> Pair of Queens <br> Highest card Nine | 3D 6D 7H QD QS <br> Pair of Queens <br> Highest card Seven | Player 1 |
+| <strong>5</strong> | 2H 2D 4C 4D 4S <br> Full House <br> with Three Fours      | 3C 3D 3S 9S 9D <br> Full House <br> with Three Threes      | Player 1 |
+
+The global array (`handsArr`) passed to the function, 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?
+
+# --hints--
+
+`pokerHands(testArr)` should return a number.
+
+```js
+assert(typeof pokerHands(testArr) === 'number');
+```
+
+`pokerHands(testArr)` should return 2.
+
+```js
+assert.strictEqual(pokerHands(testArr), 2);
+```
+
+`pokerHands(handsArr)` should return 376.
+
+```js
+assert.strictEqual(pokerHands(handsArr), 376);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const handsArr = [
+  '8C TS KC 9H 4S 7D 2S 5D 3S AC',
+  '5C AD 5D AC 9C 7C 5H 8D TD KS',
+  '3H 7H 6S KC JS QH TD JC 2D 8S',
+  'TH 8H 5C QS TC 9H 4D JC KS JS',
+  '7C 5H KC QH JD AS KH 4C AD 4S',
+  '5H KS 9C 7D 9H 8D 3S 5D 5C AH',
+  '6H 4H 5C 3H 2H 3S QH 5S 6S AS',
+  'TD 8C 4H 7C TC KC 4C 3H 7S KS',
+  '7C 9C 6D KD 3H 4C QS QC AC KH',
+  'JC 6S 5H 2H 2D KD 9D 7C AS JS',
+  'AD QH TH 9D 8H TS 6D 3S AS AC',
+  '2H 4S 5C 5S TC KC JD 6C TS 3C',
+  'QD AS 6H JS 2C 3D 9H KC 4H 8S',
+  'KD 8S 9S 7C 2S 3S 6D 6S 4H KC',
+  '3C 8C 2D 7D 4D 9S 4S QH 4H JD',
+  '8C KC 7S TC 2D TS 8H QD AC 5C',
+  '3D KH QD 6C 6S AD AS 8H 2H QS',
+  '6S 8D 4C 8S 6C QH TC 6D 7D 9D',
+  '2S 8D 8C 4C TS 9S 9D 9C AC 3D',
+  '3C QS 2S 4H JH 3D 2D TD 8S 9H',
+  '5H QS 8S 6D 3C 8C JD AS 7H 7D',
+  '6H TD 9D AS JH 6C QC 9S KD JC',
+  'AH 8S QS 4D TH AC TS 3C 3D 5C',
+  '5S 4D JS 3D 8H 6C TS 3S AD 8C',
+  '6D 7C 5D 5H 3S 5C JC 2H 5S 3D',
+  '5H 6H 2S KS 3D 5D JD 7H JS 8H',
+  'KH 4H AS JS QS QC TC 6D 7C KS',
+  '3D QS TS 2H JS 4D AS 9S JC KD',
+  'QD 5H 4D 5D KH 7H 3D JS KD 4H',
+  '2C 9H 6H 5C 9D 6C JC 2D TH 9S',
+  '7D 6D AS QD JH 4D JS 7C QS 5C',
+  '3H KH QD AD 8C 8H 3S TH 9D 5S',
+  'AH 9S 4D 9D 8S 4H JS 3C TC 8D',
+  '2C KS 5H QD 3S TS 9H AH AD 8S',
+  '5C 7H 5D KD 9H 4D 3D 2D KS AD',
+  'KS KC 9S 6D 2C QH 9D 9H TS TC',
+  '9C 6H 5D QH 4D AD 6D QC JS KH',
+  '9S 3H 9D JD 5C 4D 9H AS TC QH',
+  '2C 6D JC 9C 3C AD 9S KH 9D 7D',
+  'KC 9C 7C JC JS KD 3H AS 3C 7D',
+  'QD KH QS 2C 3S 8S 8H 9H 9C JC',
+  'QH 8D 3C KC 4C 4H 6D AD 9H 9D',
+  '3S KS QS 7H KH 7D 5H 5D JD AD',
+  '2H 2C 6H TH TC 7D 8D 4H 8C AS',
+  '4S 2H AC QC 3S 6D TH 4D 4C KH',
+  '4D TC KS AS 7C 3C 6D 2D 9H 6C',
+  '8C TD 5D QS 2C 7H 4C 9C 3H 9H',
+  '5H JH TS 7S TD 6H AD QD 8H 8S',
+  '5S AD 9C 8C 7C 8D 5H 9D 8S 2S',
+  '4H KH KS 9S 2S KC 5S AD 4S 7D',
+  'QS 9C QD 6H JS 5D AC 8D 2S AS',
+  'KH AC JC 3S 9D 9S 3C 9C 5S JS',
+  'AD 3C 3D KS 3S 5C 9C 8C TS 4S',
+  'JH 8D 5D 6H KD QS QD 3D 6C KC',
+  '8S JD 6C 3S 8C TC QC 3C QH JS',
+  'KC JC 8H 2S 9H 9C JH 8S 8C 9S',
+  '8S 2H QH 4D QC 9D KC AS TH 3C',
+  '8S 6H TH 7C 2H 6S 3C 3H AS 7S',
+  'QH 5S JS 4H 5H TS 8H AH AC JC',
+  '9D 8H 2S 4S TC JC 3C 7H 3H 5C',
+  '3D AD 3C 3S 4C QC AS 5D TH 8C',
+  '6S 9D 4C JS KH AH TS JD 8H AD',
+  '4C 6S 9D 7S AC 4D 3D 3S TC JD',
+  'AD 7H 6H 4H JH KC TD TS 7D 6S',
+  '8H JH TC 3S 8D 8C 9S 2C 5C 4D',
+  '2C 9D KC QH TH QS JC 9C 4H TS',
+  'QS 3C QD 8H KH 4H 8D TD 8S AC',
+  '7C 3C TH 5S 8H 8C 9C JD TC KD',
+  'QC TC JD TS 8C 3H 6H KD 7C TD',
+  'JH QS KS 9C 6D 6S AS 9H KH 6H',
+  '2H 4D AH 2D JH 6H TD 5D 4H JD',
+  'KD 8C 9S JH QD JS 2C QS 5C 7C',
+  '4S TC 7H 8D 2S 6H 7S 9C 7C KC',
+  '8C 5D 7H 4S TD QC 8S JS 4H KS',
+  'AD 8S JH 6D TD KD 7C 6C 2D 7D',
+  'JC 6H 6S JS 4H QH 9H AH 4C 3C',
+  '6H 5H AS 7C 7S 3D KH KC 5D 5C',
+  'JC 3D TD AS 4D 6D 6S QH JD KS',
+  '8C 7S 8S QH 2S JD 5C 7H AH QD',
+  '8S 3C 6H 6C 2C 8D TD 7D 4C 4D',
+  '5D QH KH 7C 2S 7H JS 6D QC QD',
+  'AD 6C 6S 7D TH 6H 2H 8H KH 4H',
+  'KS JS KD 5D 2D KH 7D 9C 8C 3D',
+  '9C 6D QD 3C KS 3S 7S AH JD 2D',
+  'AH QH AS JC 8S 8H 4C KC TH 7D',
+  'JC 5H TD 7C 5D KD 4C AD 8H JS',
+  'KC 2H AC AH 7D JH KH 5D 7S 6D',
+  '9S 5S 9C 6H 8S TD JD 9H 6C AC',
+  '7D 8S 6D TS KD 7H AC 5S 7C 5D',
+  'AH QC JC 4C TC 8C 2H TS 2C 7D',
+  'KD KC 6S 3D 7D 2S 8S 3H 5S 5C',
+  '8S 5D 8H 4C 6H KC 3H 7C 5S KD',
+  'JH 8C 3D 3C 6C KC TD 7H 7C 4C',
+  'JC KC 6H TS QS TD KS 8H 8C 9S',
+  '6C 5S 9C QH 7D AH KS KC 9S 2C',
+  '4D 4S 8H TD 9C 3S 7D 9D AS TH',
+  '6S 7D 3C 6H 5D KD 2C 5C 9D 9C',
+  '2H KC 3D AD 3H QD QS 8D JC 4S',
+  '8C 3H 9C 7C AD 5D JC 9D JS AS',
+  '5D 9H 5C 7H 6S 6C QC JC QD 9S',
+  'JC QS JH 2C 6S 9C QC 3D 4S TC',
+  '4H 5S 8D 3D 4D 2S KC 2H JS 2C',
+  'TD 3S TH KD 4D 7H JH JS KS AC',
+  '7S 8C 9S 2D 8S 7D 5C AD 9D AS',
+  '8C 7H 2S 6C TH 3H 4C 3S 8H AC',
+  'KD 5H JC 8H JD 2D 4H TD JH 5C',
+  '3D AS QH KS 7H JD 8S 5S 6D 5H',
+  '9S 6S TC QS JC 5C 5D 9C TH 8C',
+  '5H 3S JH 9H 2S 2C 6S 7S AS KS',
+  '8C QD JC QS TC QC 4H AC KH 6C',
+  'TC 5H 7D JH 4H 2H 8D JC KS 4D',
+  '5S 9C KH KD 9H 5C TS 3D 7D 2D',
+  '5H AS TC 4D 8C 2C TS 9D 3H 8D',
+  '6H 8D 2D 9H JD 6C 4S 5H 5S 6D',
+  'AD 9C JC 7D 6H 9S 6D JS 9H 3C',
+  'AD JH TC QS 4C 5D 9S 7C 9C AH',
+  'KD 6H 2H TH 8S QD KS 9D 9H AS',
+  '4H 8H 8D 5H 6C AH 5S AS AD 8S',
+  'QS 5D 4S 2H TD KS 5H AC 3H JC',
+  '9C 7D QD KD AC 6D 5H QH 6H 5S',
+  'KC AH QH 2H 7D QS 3H KS 7S JD',
+  '6C 8S 3H 6D KS QD 5D 5C 8H TC',
+  '9H 4D 4S 6S 9D KH QC 4H 6C JD',
+  'TD 2D QH 4S 6H JH KD 3C QD 8C',
+  '4S 6H 7C QD 9D AS AH 6S AD 3C',
+  '2C KC TH 6H 8D AH 5C 6D 8S 5D',
+  'TD TS 7C AD JC QD 9H 3C KC 7H',
+  '5D 4D 5S 8H 4H 7D 3H JD KD 2D',
+  'JH TD 6H QS 4S KD 5C 8S 7D 8H',
+  'AC 3D AS 8C TD 7H KH 5D 6C JD',
+  '9D KS 7C 6D QH TC JD KD AS KC',
+  'JH 8S 5S 7S 7D AS 2D 3D AD 2H',
+  '2H 5D AS 3C QD KC 6H 9H 9S 2C',
+  '9D 5D TH 4C JH 3H 8D TC 8H 9H',
+  '6H KD 2C TD 2H 6C 9D 2D JS 8C',
+  'KD 7S 3C 7C AS QH TS AD 8C 2S',
+  'QS 8H 6C JS 4C 9S QC AD TD TS',
+  '2H 7C TS TC 8C 3C 9H 2D 6D JC',
+  'TC 2H 8D JH KS 6D 3H TD TH 8H',
+  '9D TD 9H QC 5D 6C 8H 8C KC TS',
+  '2H 8C 3D AH 4D TH TC 7D 8H KC',
+  'TS 5C 2D 8C 6S KH AH 5H 6H KC',
+  '5S 5D AH TC 4C JD 8D 6H 8C 6C',
+  'KC QD 3D 8H 2D JC 9H 4H AD 2S',
+  'TD 6S 7D JS KD 4H QS 2S 3S 8C',
+  '4C 9H JH TS 3S 4H QC 5S 9S 9C',
+  '2C KD 9H JS 9S 3H JC TS 5D AC',
+  'AS 2H 5D AD 5H JC 7S TD JS 4C',
+  '2D 4S 8H 3D 7D 2C AD KD 9C TS',
+  '7H QD JH 5H JS AC 3D TH 4C 8H',
+  '6D KH KC QD 5C AD 7C 2D 4H AC',
+  '3D 9D TC 8S QD 2C JC 4H JD AH',
+  '6C TD 5S TC 8S AH 2C 5D AS AC',
+  'TH 7S 3D AS 6C 4C 7H 7D 4H AH',
+  '5C 2H KS 6H 7S 4H 5H 3D 3C 7H',
+  '3C 9S AC 7S QH 2H 3D 6S 3S 3H',
+  '2D 3H AS 2C 6H TC JS 6S 9C 6C',
+  'QH KD QD 6D AC 6H KH 2C TS 8C',
+  '8H 7D 3S 9H 5D 3H 4S QC 9S 5H',
+  '2D 9D 7H 6H 3C 8S 5H 4D 3S 4S',
+  'KD 9S 4S TC 7S QC 3S 8S 2H 7H',
+  'TC 3D 8C 3H 6C 2H 6H KS KD 4D',
+  'KC 3D 9S 3H JS 4S 8H 2D 6C 8S',
+  '6H QS 6C TC QD 9H 7D 7C 5H 4D',
+  'TD 9D 8D 6S 6C TC 5D TS JS 8H',
+  '4H KC JD 9H TC 2C 6S 5H 8H AS',
+  'JS 9C 5C 6S 9D JD 8H KC 4C 6D',
+  '4D 8D 8S 6C 7C 6H 7H 8H 5C KC',
+  'TC 3D JC 6D KS 9S 6H 7S 9C 2C',
+  '6C 3S KD 5H TS 7D 9H 9S 6H KH',
+  '3D QD 4C 6H TS AC 3S 5C 2H KD',
+  '4C AS JS 9S 7C TS 7H 9H JC KS',
+  '4H 8C JD 3H 6H AD 9S 4S 5S KS',
+  '4C 2C 7D 3D AS 9C 2S QS KC 6C',
+  '8S 5H 3D 2S AC 9D 6S 3S 4D TD',
+  'QD TH 7S TS 3D AC 7H 6C 5D QC',
+  'TC QD AD 9C QS 5C 8D KD 3D 3C',
+  '9D 8H AS 3S 7C 8S JD 2D 8D KC',
+  '4C TH AC QH JS 8D 7D 7S 9C KH',
+  '9D 8D 4C JH 2C 2S QD KD TS 4H',
+  '4D 6D 5D 2D JH 3S 8S 3H TC KH',
+  'AD 4D 2C QS 8C KD JH JD AH 5C',
+  '5C 6C 5H 2H JH 4H KS 7C TC 3H',
+  '3C 4C QC 5D JH 9C QD KH 8D TC',
+  '3H 9C JS 7H QH AS 7C 9H 5H JC',
+  '2D 5S QD 4S 3C KC 6S 6C 5C 4C',
+  '5D KH 2D TS 8S 9C AS 9S 7C 4C',
+  '7C AH 8C 8D 5S KD QH QS JH 2C',
+  '8C 9D AH 2H AC QC 5S 8H 7H 2C',
+  'QD 9H 5S QS QC 9C 5H JC TH 4H',
+  '6C 6S 3H 5H 3S 6H KS 8D AC 7S',
+  'AC QH 7H 8C 4S KC 6C 3D 3S TC',
+  '9D 3D JS TH AC 5H 3H 8S 3S TC',
+  'QD KH JS KS 9S QC 8D AH 3C AC',
+  '5H 6C KH 3S 9S JH 2D QD AS 8C',
+  '6C 4D 7S 7H 5S JC 6S 9H 4H JH',
+  'AH 5S 6H 9S AD 3S TH 2H 9D 8C',
+  '4C 8D 9H 7C QC AD 4S 9C KC 5S',
+  '9D 6H 4D TC 4C JH 2S 5D 3S AS',
+  '2H 6C 7C KH 5C AD QS TH JD 8S',
+  '3S 4S 7S AH AS KC JS 2S AD TH',
+  'JS KC 2S 7D 8C 5C 9C TS 5H 9D',
+  '7S 9S 4D TD JH JS KH 6H 5D 2C',
+  'JD JS JC TH 2D 3D QD 8C AC 5H',
+  '7S KH 5S 9D 5D TD 4S 6H 3C 2D',
+  '4S 5D AC 8D 4D 7C AD AS AH 9C',
+  '6S TH TS KS 2C QC AH AS 3C 4S',
+  '2H 8C 3S JC 5C 7C 3H 3C KH JH',
+  '7S 3H JC 5S 6H 4C 2S 4D KC 7H',
+  '4D 7C 4H 9S 8S 6S AD TC 6C JC',
+  'KH QS 3S TC 4C 8H 8S AC 3C TS',
+  'QD QS TH 3C TS 7H 7D AH TD JC',
+  'TD JD QC 4D 9S 7S TS AD 7D AC',
+  'AH 7H 4S 6D 7C 2H 9D KS JC TD',
+  '7C AH JD 4H 6D QS TS 2H 2C 5C',
+  'TC KC 8C 9S 4C JS 3C JC 6S AH',
+  'AS 7D QC 3D 5S JC JD 9D TD KH',
+  'TH 3C 2S 6H AH AC 5H 5C 7S 8H',
+  'QC 2D AC QD 2S 3S JD QS 6S 8H',
+  'KC 4H 3C 9D JS 6H 3S 8S AS 8C',
+  '7H KC 7D JD 2H JC QH 5S 3H QS',
+  '9H TD 3S 8H 7S AC 5C 6C AH 7C',
+  '8D 9H AH JD TD QS 7D 3S 9C 8S',
+  'AH QH 3C JD KC 4S 5S 5D TD KS',
+  '9H 7H 6S JH TH 4C 7C AD 5C 2D',
+  '7C KD 5S TC 9D 6S 6C 5D 2S TH',
+  'KC 9H 8D 5H 7H 4H QC 3D 7C AS',
+  '6S 8S QC TD 4S 5C TH QS QD 2S',
+  '8S 5H TH QC 9H 6S KC 7D 7C 5C',
+  '7H KD AH 4D KH 5C 4S 2D KC QH',
+  '6S 2C TD JC AS 4D 6C 8C 4H 5S',
+  'JC TC JD 5S 6S 8D AS 9D AD 3S',
+  '6D 6H 5D 5S TC 3D 7D QS 9D QD',
+  '4S 6C 8S 3S 7S AD KS 2D 7D 7C',
+  'KC QH JC AC QD 5D 8D QS 7H 7D',
+  'JS AH 8S 5H 3D TD 3H 4S 6C JH',
+  '4S QS 7D AS 9H JS KS 6D TC 5C',
+  '2D 5C 6H TC 4D QH 3D 9H 8S 6C',
+  '6D 7H TC TH 5S JD 5C 9C KS KD',
+  '8D TD QH 6S 4S 6C 8S KC 5C TC',
+  '5S 3D KS AC 4S 7D QD 4C TH 2S',
+  'TS 8H 9S 6S 7S QH 3C AH 7H 8C',
+  '4C 8C TS JS QC 3D 7D 5D 7S JH',
+  '8S 7S 9D QC AC 7C 6D 2H JH KC',
+  'JS KD 3C 6S 4S 7C AH QC KS 5H',
+  'KS 6S 4H JD QS TC 8H KC 6H AS',
+  'KH 7C TC 6S TD JC 5C 7D AH 3S',
+  '3H 4C 4H TC TH 6S 7H 6D 9C QH',
+  '7D 5H 4S 8C JS 4D 3D 8S QH KC',
+  '3H 6S AD 7H 3S QC 8S 4S 7S JS',
+  '3S JD KH TH 6H QS 9C 6C 2D QD',
+  '4S QH 4D 5H KC 7D 6D 8D TH 5S',
+  'TD AD 6S 7H KD KH 9H 5S KC JC',
+  '3H QC AS TS 4S QD KS 9C 7S KC',
+  'TS 6S QC 6C TH TC 9D 5C 5D KD',
+  'JS 3S 4H KD 4C QD 6D 9S JC 9D',
+  '8S JS 6D 4H JH 6H 6S 6C KS KH',
+  'AC 7D 5D TC 9S KH 6S QD 6H AS',
+  'AS 7H 6D QH 8D TH 2S KH 5C 5H',
+  '4C 7C 3D QC TC 4S KH 8C 2D JS',
+  '6H 5D 7S 5H 9C 9H JH 8S TH 7H',
+  'AS JS 2S QD KH 8H 4S AC 8D 8S',
+  '3H 4C TD KD 8C JC 5C QS 2D JD',
+  'TS 7D 5D 6C 2C QS 2H 3C AH KS',
+  '4S 7C 9C 7D JH 6C 5C 8H 9D QD',
+  '2S TD 7S 6D 9C 9S QS KH QH 5C',
+  'JC 6S 9C QH JH 8D 7S JS KH 2H',
+  '8D 5H TH KC 4D 4S 3S 6S 3D QS',
+  '2D JD 4C TD 7C 6D TH 7S JC AH',
+  'QS 7S 4C TH 9D TS AD 4D 3H 6H',
+  '2D 3H 7D JD 3D AS 2S 9C QC 8S',
+  '4H 9H 9C 2C 7S JH KD 5C 5D 6H',
+  'TC 9H 8H JC 3C 9S 8D KS AD KC',
+  'TS 5H JD QS QH QC 8D 5D KH AH',
+  '5D AS 8S 6S 4C AH QC QD TH 7H',
+  '3H 4H 7D 6S 4S 9H AS 8H JS 9D',
+  'JD 8C 2C 9D 7D 5H 5S 9S JC KD',
+  'KD 9C 4S QD AH 7C AD 9D AC TD',
+  '6S 4H 4S 9C 8D KS TC 9D JH 7C',
+  '5S JC 5H 4S QH AC 2C JS 2S 9S',
+  '8C 5H AS QD AD 5C 7D 8S QC TD',
+  'JC 4C 8D 5C KH QS 4D 6H 2H 2C',
+  'TH 4S 2D KC 3H QD AC 7H AD 9D',
+  'KH QD AS 8H TH KC 8D 7S QH 8C',
+  'JC 6C 7D 8C KH AD QS 2H 6S 2D',
+  'JC KH 2D 7D JS QC 5H 4C 5D AD',
+  'TS 3S AD 4S TD 2D TH 6S 9H JH',
+  '9H 2D QS 2C 4S 3D KH AS AC 9D',
+  'KH 6S 8H 4S KD 7D 9D TS QD QC',
+  'JH 5H AH KS AS AD JC QC 5S KH',
+  '5D 7D 6D KS KD 3D 7C 4D JD 3S',
+  'AC JS 8D 5H 9C 3H 4H 4D TS 2C',
+  '6H KS KH 9D 7C 2S 6S 8S 2H 3D',
+  '6H AC JS 7S 3S TD 8H 3H 4H TH',
+  '9H TC QC KC 5C KS 6H 4H AC 8S',
+  'TC 7D QH 4S JC TS 6D 6C AC KH',
+  'QH 7D 7C JH QS QD TH 3H 5D KS',
+  '3D 5S 8D JS 4C 2C KS 7H 9C 4H',
+  '5H 8S 4H TD 2C 3S QD QC 3H KC',
+  'QC JS KD 9C AD 5S 9D 7D 7H TS',
+  '8C JC KH 7C 7S 6C TS 2C QD TH',
+  '5S 9D TH 3C 7S QH 8S 9C 2H 5H',
+  '5D 9H 6H 2S JS KH 3H 7C 2H 5S',
+  'JD 5D 5S 2C TC 2S 6S 6C 3C 8S',
+  '4D KH 8H 4H 2D KS 3H 5C 2S 9H',
+  '3S 2D TD 7H 8S 6H JD KC 9C 8D',
+  '6S QD JH 7C 9H 5H 8S 8H TH TD',
+  'QS 7S TD 7D TS JC KD 7C 3C 2C',
+  '3C JD 8S 4H 2D 2S TD AS 4D AC',
+  'AH KS 6C 4C 4S 7D 8C 9H 6H AS',
+  '5S 3C 9S 2C QS KD 4D 4S AC 5D',
+  '2D TS 2C JS KH QH 5D 8C AS KC',
+  'KD 3H 6C TH 8S 7S KH 6H 9S AC',
+  '6H 7S 6C QS AH 2S 2H 4H 5D 5H',
+  '5H JC QD 2C 2S JD AS QC 6S 7D',
+  '6C TC AS KD 8H 9D 2C 7D JH 9S',
+  '2H 4C 6C AH 8S TD 3H TH 7C TS',
+  'KD 4S TS 6C QH 8D 9D 9C AH 7D',
+  '6D JS 5C QD QC 9C 5D 8C 2H KD',
+  '3C QH JH AD 6S AH KC 8S 6D 6H',
+  '3D 7C 4C 7S 5S 3S 6S 5H JC 3C',
+  'QH 7C 5H 3C 3S 8C TS 4C KD 9C',
+  'QD 3S 7S 5H 7H QH JC 7C 8C KD',
+  '3C KD KH 2S 4C TS AC 6S 2C 7C',
+  '2C KH 3C 4C 6H 4D 5H 5S 7S QD',
+  '4D 7C 8S QD TS 9D KS 6H KD 3C',
+  'QS 4D TS 7S 4C 3H QD 8D 9S TC',
+  'TS QH AC 6S 3C 9H 9D QS 8S 6H',
+  '3S 7S 5D 4S JS 2D 6C QH 6S TH',
+  '4C 4H AS JS 5D 3D TS 9C AC 8S',
+  '6S 9C 7C 3S 5C QS AD AS 6H 3C',
+  '9S 8C 7H 3H 6S 7C AS 9H JD KH',
+  '3D 3H 7S 4D 6C 7C AC 2H 9C TH',
+  '4H 5S 3H AC TC TH 9C 9H 9S 8D',
+  '8D 9H 5H 4D 6C 2H QD 6S 5D 3S',
+  '4C 5C JD QS 4D 3H TH AC QH 8C',
+  'QC 5S 3C 7H AD 4C KS 4H JD 6D',
+  'QS AH 3H KS 9H 2S JS JH 5H 2H',
+  '2H 5S TH 6S TS 3S KS 3C 5H JS',
+  '2D 9S 7H 3D KC JH 6D 7D JS TD',
+  'AC JS 8H 2C 8C JH JC 2D TH 7S',
+  '5D 9S 8H 2H 3D TC AH JC KD 9C',
+  '9D QD JC 2H 6D KH TS 9S QH TH',
+  '2C 8D 4S JD 5H 3H TH TC 9C KC',
+  'AS 3D 9H 7D 4D TH KH 2H 7S 3H',
+  '4H 7S KS 2S JS TS 8S 2H QD 8D',
+  '5S 6H JH KS 8H 2S QC AC 6S 3S',
+  'JC AS AD QS 8H 6C KH 4C 4D QD',
+  '2S 3D TS TD 9S KS 6S QS 5C 8D',
+  '3C 6D 4S QC KC JH QD TH KH AD',
+  '9H AH 4D KS 2S 8D JH JC 7C QS',
+  '2D 6C TH 3C 8H QD QH 2S 3S KS',
+  '6H 5D 9S 4C TS TD JS QD 9D JD',
+  '5H 8H KH 8S KS 7C TD AD 4S KD',
+  '2C 7C JC 5S AS 6C 7D 8S 5H 9C',
+  '6S QD 9S TS KH QS 5S QH 3C KC',
+  '7D 3H 3C KD 5C AS JH 7H 6H JD',
+  '9D 5C 9H KC 8H KS 4S AD 4D 2S',
+  '3S JD QD 8D 2S 7C 5S 6S 5H TS',
+  '6D 9S KC TD 3S 6H QD JD 5C 8D',
+  '5H 9D TS KD 8D 6H TD QC 4C 7D',
+  '6D 4S JD 9D AH 9S AS TD 9H QD',
+  '2D 5S 2H 9C 6H 9S TD QC 7D TC',
+  '3S 2H KS TS 2C 9C 8S JS 9D 7D',
+  '3C KC 6D 5D 6C 6H 8S AS 7S QS',
+  'JH 9S 2H 8D 4C 8H 9H AD TH KH',
+  'QC AS 2S JS 5C 6H KD 3H 7H 2C',
+  'QD 8H 2S 8D 3S 6D AH 2C TC 5C',
+  'JD JS TS 8S 3H 5D TD KC JC 6H',
+  '6S QS TC 3H 5D AH JC 7C 7D 4H',
+  '7C 5D 8H 9C 2H 9H JH KH 5S 2C',
+  '9C 7H 6S TH 3S QC QD 4C AC JD',
+  '2H 5D 9S 7D KC 3S QS 2D AS KH',
+  '2S 4S 2H 7D 5C TD TH QH 9S 4D',
+  '6D 3S TS 6H 4H KS 9D 8H 5S 2D',
+  '9H KS 4H 3S 5C 5D KH 6H 6S JS',
+  'KC AS 8C 4C JC KH QC TH QD AH',
+  '6S KH 9S 2C 5H TC 3C 7H JC 4D',
+  'JD 4S 6S 5S 8D 7H 7S 4D 4C 2H',
+  '7H 9H 5D KH 9C 7C TS TC 7S 5H',
+  '4C 8D QC TS 4S 9H 3D AD JS 7C',
+  '8C QS 5C 5D 3H JS AH KC 4S 9D',
+  'TS JD 8S QS TH JH KH 2D QD JS',
+  'JD QC 5D 6S 9H 3S 2C 8H 9S TS',
+  '2S 4C AD 7H JC 5C 2D 6D 4H 3D',
+  '7S JS 2C 4H 8C AD QD 9C 3S TD',
+  'JD TS 4C 6H 9H 7D QD 6D 3C AS',
+  'AS 7C 4C 6S 5D 5S 5C JS QC 4S',
+  'KD 6S 9S 7C 3C 5S 7D JH QD JS',
+  '4S 7S JH 2C 8S 5D 7H 3D QH AD',
+  'TD 6H 2H 8D 4H 2D 7C AD KH 5D',
+  'TS 3S 5H 2C QD AH 2S 5C KH TD',
+  'KC 4D 8C 5D AS 6C 2H 2S 9H 7C',
+  'KD JS QC TS QS KH JH 2C 5D AD',
+  '3S 5H KC 6C 9H 3H 2H AD 7D 7S',
+  '7S JS JH KD 8S 7D 2S 9H 7C 2H',
+  '9H 2D 8D QC 6S AD AS 8H 5H 6C',
+  '2S 7H 6C 6D 7D 8C 5D 9D JC 3C',
+  '7C 9C 7H JD 2H KD 3S KH AD 4S',
+  'QH AS 9H 4D JD KS KD TS KH 5H',
+  '4C 8H 5S 3S 3D 7D TD AD 7S KC',
+  'JS 8S 5S JC 8H TH 9C 4D 5D KC',
+  '7C 5S 9C QD 2C QH JS 5H 8D KH',
+  'TD 2S KS 3D AD KC 7S TC 3C 5D',
+  '4C 2S AD QS 6C 9S QD TH QH 5C',
+  '8C AD QS 2D 2S KC JD KS 6C JC',
+  '8D 4D JS 2H 5D QD 7S 7D QH TS',
+  '6S 7H 3S 8C 8S 9D QS 8H 6C 9S',
+  '4S TC 2S 5C QD 4D QS 6D TH 6S',
+  '3S 5C 9D 6H 8D 4C 7D TC 7C TD',
+  'AH 6S AS 7H 5S KD 3H 5H AC 4C',
+  '8D 8S AH KS QS 2C AD 6H 7D 5D',
+  '6H 9H 9S 2H QS 8S 9C 5D 2D KD',
+  'TS QC 5S JH 7D 7S TH 9S 9H AC',
+  '7H 3H 6S KC 4D 6D 5C 4S QD TS',
+  'TD 2S 7C QD 3H JH 9D 4H 7S 7H',
+  'KS 3D 4H 5H TC 2S AS 2D 6D 7D',
+  '8H 3C 7H TD 3H AD KC TH 9C KH',
+  'TC 4C 2C 9S 9D 9C 5C 2H JD 3C',
+  '3H AC TS 5D AD 8D 6H QC 6S 8C',
+  '2S TS 3S JD 7H 8S QH 4C 5S 8D',
+  'AC 4S 6C 3C KH 3D 7C 2D 8S 2H',
+  '4H 6C 8S TH 2H 4S 8H 9S 3H 7S',
+  '7C 4C 9C 2C 5C AS 5D KD 4D QH',
+  '9H 4H TS AS 7D 8D 5D 9S 8C 2H',
+  'QC KD AC AD 2H 7S AS 3S 2D 9S',
+  '2H QC 8H TC 6D QD QS 5D KH 3C',
+  'TH JD QS 4C 2S 5S AD 7H 3S AS',
+  '7H JS 3D 6C 3S 6D AS 9S AC QS',
+  '9C TS AS 8C TC 8S 6H 9D 8D 6C',
+  '4D JD 9C KC 7C 6D KS 3S 8C AS',
+  '3H 6S TC 8D TS 3S KC 9S 7C AS',
+  '8C QC 4H 4S 8S 6C 3S TC AH AC',
+  '4D 7D 5C AS 2H 6S TS QC AD TC',
+  'QD QC 8S 4S TH 3D AH TS JH 4H',
+  '5C 2D 9S 2C 3H 3C 9D QD QH 7D',
+  'KC 9H 6C KD 7S 3C 4D AS TC 2D',
+  '3D JS 4D 9D KS 7D TH QC 3H 3C',
+  '8D 5S 2H 9D 3H 8C 4C 4H 3C TH',
+  'JC TH 4S 6S JD 2D 4D 6C 3D 4C',
+  'TS 3S 2D 4H AC 2C 6S 2H JH 6H',
+  'TD 8S AD TC AH AC JH 9S 6S 7S',
+  '6C KC 4S JD 8D 9H 5S 7H QH AH',
+  'KD 8D TS JH 5C 5H 3H AD AS JS',
+  '2D 4H 3D 6C 8C 7S AD 5D 5C 8S',
+  'TD 5D 7S 9C 4S 5H 6C 8C 4C 8S',
+  'JS QH 9C AS 5C QS JC 3D QC 7C',
+  'JC 9C KH JH QS QC 2C TS 3D AD',
+  '5D JH AC 5C 9S TS 4C JD 8C KS',
+  'KC AS 2D KH 9H 2C 5S 4D 3D 6H',
+  'TH AH 2D 8S JC 3D 8C QH 7S 3S',
+  '8H QD 4H JC AS KH KS 3C 9S 6D',
+  '9S QH 7D 9C 4S AC 7H KH 4D KD',
+  'AH AD TH 6D 9C 9S KD KS QH 4H',
+  'QD 6H 9C 7C QS 6D 6S 9D 5S JH',
+  'AH 8D 5H QD 2H JC KS 4H KH 5S',
+  '5C 2S JS 8D 9C 8C 3D AS KC AH',
+  'JD 9S 2H QS 8H 5S 8C TH 5C 4C',
+  'QC QS 8C 2S 2C 3S 9C 4C KS KH',
+  '2D 5D 8S AH AD TD 2C JS KS 8C',
+  'TC 5S 5H 8H QC 9H 6H JD 4H 9S',
+  '3C JH 4H 9H AH 4S 2H 4C 8D AC',
+  '8S TH 4D 7D 6D QD QS 7S TC 7C',
+  'KH 6D 2D JD 5H JS QD JH 4H 4S',
+  '9C 7S JH 4S 3S TS QC 8C TC 4H',
+  'QH 9D 4D JH QS 3S 2C 7C 6C 2D',
+  '4H 9S JD 5C 5H AH 9D TS 2D 4C',
+  'KS JH TS 5D 2D AH JS 7H AS 8D',
+  'JS AH 8C AD KS 5S 8H 2C 6C TH',
+  '2H 5D AD AC KS 3D 8H TS 6H QC',
+  '6D 4H TS 9C 5H JS JH 6S JD 4C',
+  'JH QH 4H 2C 6D 3C 5D 4C QS KC',
+  '6H 4H 6C 7H 6S 2S 8S KH QC 8C',
+  '3H 3D 5D KS 4H TD AD 3S 4D TS',
+  '5S 7C 8S 7D 2C KS 7S 6C 8C JS',
+  '5D 2H 3S 7C 5C QD 5H 6D 9C 9H',
+  'JS 2S KD 9S 8D TD TS AC 8C 9D',
+  '5H QD 2S AC 8C 9H KS 7C 4S 3C',
+  'KH AS 3H 8S 9C JS QS 4S AD 4D',
+  'AS 2S TD AD 4D 9H JC 4C 5H QS',
+  '5D 7C 4H TC 2D 6C JS 4S KC 3S',
+  '4C 2C 5D AC 9H 3D JD 8S QS QH',
+  '2C 8S 6H 3C QH 6D TC KD AC AH',
+  'QC 6C 3S QS 4S AC 8D 5C AD KH',
+  '5S 4C AC KH AS QC 2C 5C 8D 9C',
+  '8H JD 3C KH 8D 5C 9C QD QH 9D',
+  '7H TS 2C 8C 4S TD JC 9C 5H QH',
+  'JS 4S 2C 7C TH 6C AS KS 7S JD',
+  'JH 7C 9H 7H TC 5H 3D 6D 5D 4D',
+  '2C QD JH 2H 9D 5S 3D TD AD KS',
+  'JD QH 3S 4D TH 7D 6S QS KS 4H',
+  'TC KS 5S 8D 8H AD 2S 2D 4C JH',
+  '5S JH TC 3S 2D QS 9D 4C KD 9S',
+  'AC KH 3H AS 9D KC 9H QD 6C 6S',
+  '9H 7S 3D 5C 7D KC TD 8H 4H 6S',
+  '3C 7H 8H TC QD 4D 7S 6S QH 6C',
+  '6D AD 4C QD 6C 5D 7D 9D KS TS',
+  'JH 2H JD 9S 7S TS KH 8D 5D 8H',
+  '2D 9S 4C 7D 9D 5H QD 6D AC 6S',
+  '7S 6D JC QD JH 4C 6S QS 2H 7D',
+  '8C TD JH KD 2H 5C QS 2C JS 7S',
+  'TC 5H 4H JH QD 3S 5S 5D 8S KH',
+  'KS KH 7C 2C 5D JH 6S 9C 6D JC',
+  '5H AH JD 9C JS KC 2H 6H 4D 5S',
+  'AS 3C TH QC 6H 9C 8S 8C TD 7C',
+  'KC 2C QD 9C KH 4D 7S 3C TS 9H',
+  '9C QC 2S TS 8C TD 9S QD 3S 3C',
+  '4D 9D TH JH AH 6S 2S JD QH JS',
+  'QD 9H 6C KD 7D 7H 5D 6S 8H AH',
+  '8H 3C 4S 2H 5H QS QH 7S 4H AC',
+  'QS 3C 7S 9S 4H 3S AH KS 9D 7C',
+  'AD 5S 6S 2H 2D 5H TC 4S 3C 8C',
+  'QH TS 6S 4D JS KS JH AS 8S 6D',
+  '2C 8S 2S TD 5H AS TC TS 6C KC',
+  'KC TS 8H 2H 3H 7C 4C 5S TH TD',
+  'KD AD KH 7H 7S 5D 5H 5S 2D 9C',
+  'AD 9S 3D 7S 8C QC 7C 9C KD KS',
+  '3C QC 9S 8C 4D 5C AS QD 6C 2C',
+  '2H KC 8S JD 7S AC 8D 5C 2S 4D',
+  '9D QH 3D 2S TC 3S KS 3C 9H TD',
+  'KD 6S AC 2C 7H 5H 3S 6C 6H 8C',
+  'QH TC 8S 6S KH TH 4H 5D TS 4D',
+  '8C JS 4H 6H 2C 2H 7D AC QD 3D',
+  'QS KC 6S 2D 5S 4H TD 3H JH 4C',
+  '7S 5H 7H 8H KH 6H QS TH KD 7D',
+  '5H AD KD 7C KH 5S TD 6D 3C 6C',
+  '8C 9C 5H JD 7C KC KH 7H 2H 3S',
+  '7S 4H AD 4D 8S QS TH 3D 7H 5S',
+  '8D TC KS KD 9S 6D AD JD 5C 2S',
+  '7H 8H 6C QD 2H 6H 9D TC 9S 7C',
+  '8D 6D 4C 7C 6C 3C TH KH JS JH',
+  '5S 3S 8S JS 9H AS AD 8H 7S KD',
+  'JH 7C 2C KC 5H AS AD 9C 9S JS',
+  'AD AC 2C 6S QD 7C 3H TH KS KD',
+  '9D JD 4H 8H 4C KH 7S TS 8C KC',
+  '3S 5S 2H 7S 6H 7D KS 5C 6D AD',
+  '5S 8C 9H QS 7H 7S 2H 6C 7D TD',
+  'QS 5S TD AC 9D KC 3D TC 2D 4D',
+  'TD 2H 7D JD QD 4C 7H 5D KC 3D',
+  '4C 3H 8S KD QH 5S QC 9H TC 5H',
+  '9C QD TH 5H TS 5C 9H AH QH 2C',
+  '4D 6S 3C AC 6C 3D 2C 2H TD TH',
+  'AC 9C 5D QC 4D AD 8D 6D 8C KC',
+  'AD 3C 4H AC 8D 8H 7S 9S TD JC',
+  '4H 9H QH JS 2D TH TD TC KD KS',
+  '5S 6S 9S 8D TH AS KH 5H 5C 8S',
+  'JD 2S 9S 6S 5S 8S 5D 7S 7H 9D',
+  '5D 8C 4C 9D AD TS 2C 7D KD TC',
+  '8S QS 4D KC 5C 8D 4S KH JD KD',
+  'AS 5C AD QH 7D 2H 9S 7H 7C TC',
+  '2S 8S JD KH 7S 6C 6D AD 5D QC',
+  '9H 6H 3S 8C 8H AH TC 4H JS TD',
+  '2C TS 4D 7H 2D QC 9C 5D TH 7C',
+  '6C 8H QC 5D TS JH 5C 5H 9H 4S',
+  '2D QC 7H AS JS 8S 2H 4C 4H 8D',
+  'JS 6S AC KD 3D 3C 4S 7H TH KC',
+  'QH KH 6S QS 5S 4H 3C QD 3S 3H',
+  '7H AS KH 8C 4H 9C 5S 3D 6S TS',
+  '9C 7C 3H 5S QD 2C 3D AD AC 5H',
+  'JH TD 2D 4C TS 3H KH AD 3S 7S',
+  'AS 4C 5H 4D 6S KD JC 3C 6H 2D',
+  '3H 6S 8C 2D TH 4S AH QH AD 5H',
+  '7C 2S 9H 7H KC 5C 6D 5S 3H JC',
+  '3C TC 9C 4H QD TD JH 6D 9H 5S',
+  '7C 6S 5C 5D 6C 4S 7H 9H 6H AH',
+  'AD 2H 7D KC 2C 4C 2S 9S 7H 3S',
+  'TH 4C 8S 6S 3S AD KS AS JH TD',
+  '5C TD 4S 4D AD 6S 5D TC 9C 7D',
+  '8H 3S 4D 4S 5S 6H 5C AC 3H 3D',
+  '9H 3C AC 4S QS 8S 9D QH 5H 4D',
+  'JC 6C 5H TS AC 9C JD 8C 7C QD',
+  '8S 8H 9C JD 2D QC QH 6H 3C 8D',
+  'KS JS 2H 6H 5H QH QS 3H 7C 6D',
+  'TC 3H 4S 7H QC 2H 3S 8C JS KH',
+  'AH 8H 5S 4C 9H JD 3H 7S JC AC',
+  '3C 2D 4C 5S 6C 4S QS 3S JD 3D',
+  '5H 2D TC AH KS 6D 7H AD 8C 6H',
+  '6C 7S 3C JD 7C 8H KS KH AH 6D',
+  'AH 7D 3H 8H 8S 7H QS 5H 9D 2D',
+  'JD AC 4H 7S 8S 9S KS AS 9D QH',
+  '7S 2C 8S 5S JH QS JC AH KD 4C',
+  'AH 2S 9H 4H 8D TS TD 6H QH JD',
+  '4H JC 3H QS 6D 7S 9C 8S 9D 8D',
+  '5H TD 4S 9S 4C 8C 8D 7H 3H 3D',
+  'QS KH 3S 2C 2S 3C 7S TD 4S QD',
+  '7C TD 4D 5S KH AC AS 7H 4C 6C',
+  '2S 5H 6D JD 9H QS 8S 2C 2H TD',
+  '2S TS 6H 9H 7S 4H JC 4C 5D 5S',
+  '2C 5H 7D 4H 3S QH JC JS 6D 8H',
+  '4C QH 7C QD 3S AD TH 8S 5S TS',
+  '9H TC 2S TD JC 7D 3S 3D TH QH',
+  '7D 4C 8S 5C JH 8H 6S 3S KC 3H',
+  'JC 3H KH TC QH TH 6H 2C AC 5H',
+  'QS 2H 9D 2C AS 6S 6C 2S 8C 8S',
+  '9H 7D QC TH 4H KD QS AC 7S 3C',
+  '4D JH 6S 5S 8H KS 9S QC 3S AS',
+  'JD 2D 6S 7S TC 9H KC 3H 7D KD',
+  '2H KH 7C 4D 4S 3H JS QD 7D KC',
+  '4C JC AS 9D 3C JS 6C 8H QD 4D',
+  'AH JS 3S 6C 4C 3D JH 6D 9C 9H',
+  '9H 2D 8C 7H 5S KS 6H 9C 2S TC',
+  '6C 8C AD 7H 6H 3D KH AS 5D TH',
+  'KS 8C 3S TS 8S 4D 5S 9S 6C 4H',
+  '9H 4S 4H 5C 7D KC 2D 2H 9D JH',
+  '5C JS TC 9D 9H 5H 7S KH JC 6S',
+  '7C 9H 8H 4D JC KH JD 2H TD TC',
+  '8H 6C 2H 2C KH 6H 9D QS QH 5H',
+  'AC 7D 2S 3D QD JC 2D 8D JD JH',
+  '2H JC 2D 7H 2C 3C 8D KD TD 4H',
+  '3S 4H 6D 8D TS 3H TD 3D 6H TH',
+  'JH JC 3S AC QH 9H 7H 8S QC 2C',
+  '7H TD QS 4S 8S 9C 2S 5D 4D 2H',
+  '3D TS 3H 2S QC 8H 6H KC JC KS',
+  '5D JD 7D TC 8C 6C 9S 3D 8D AC',
+  '8H 6H JH 6C 5D 8D 8S 4H AD 2C',
+  '9D 4H 2D 2C 3S TS AS TC 3C 5D',
+  '4D TH 5H KS QS 6C 4S 2H 3D AD',
+  '5C KC 6H 2C 5S 3C 4D 2D 9H 9S',
+  'JD 4C 3H TH QH 9H 5S AH 8S AC',
+  '7D 9S 6S 2H TD 9C 4H 8H QS 4C',
+  '3C 6H 5D 4H 8C 9C KC 6S QD QS',
+  '3S 9H KD TC 2D JS 8C 6S 4H 4S',
+  '2S 4C 8S QS 6H KH 3H TH 8C 5D',
+  '2C KH 5S 3S 7S 7H 6C 9D QD 8D',
+  '8H KS AC 2D KH TS 6C JS KC 7H',
+  '9C KS 5C TD QC AH 6C 5H 9S 7C',
+  '5D 4D 3H 4H 6S 7C 7S AH QD TD',
+  '2H 7D QC 6S TC TS AH 7S 9D 3H',
+  'TH 5H QD 9S KS 7S 7C 6H 8C TD',
+  'TH 2D 4D QC 5C 7D JD AH 9C 4H',
+  '4H 3H AH 8D 6H QC QH 9H 2H 2C',
+  '2D AD 4C TS 6H 7S TH 4H QS TD',
+  '3C KD 2H 3H QS JD TC QC 5D 8H',
+  'KS JC QD TH 9S KD 8D 8C 2D 9C',
+  '3C QD KD 6D 4D 8D AH AD QC 8S',
+  '8H 3S 9D 2S 3H KS 6H 4C 7C KC',
+  'TH 9S 5C 3D 7D 6H AC 7S 4D 2C',
+  '5C 3D JD 4D 2D 6D 5H 9H 4C KH',
+  'AS 7H TD 6C 2H 3D QD KS 4C 4S',
+  'JC 3C AC 7C JD JS 8H 9S QC 5D',
+  'JD 6S 5S 2H AS 8C 7D 5H JH 3D',
+  '8D TC 5S 9S 8S 3H JC 5H 7S AS',
+  '5C TD 3D 7D 4H 8D 7H 4D 5D JS',
+  'QS 9C KS TD 2S 8S 5C 2H 4H AS',
+  'TH 7S 4H 7D 3H JD KD 5D 2S KC',
+  'JD 7H 4S 8H 4C JS 6H QH 5S 4H',
+  '2C QS 8C 5S 3H QC 2S 6C QD AD',
+  '8C 3D JD TC 4H 2H AD 5S AC 2S',
+  '5D 2C JS 2D AD 9D 3D 4C 4S JH',
+  '8D 5H 5D 6H 7S 4D KS 9D TD JD',
+  '3D 6D 9C 2S AS 7D 5S 5C 8H JD',
+  '7C 8S 3S 6S 5H JD TC AD 7H 7S',
+  '2S 9D TS 4D AC 8D 6C QD JD 3H',
+  '9S KH 2C 3C AC 3D 5H 6H 8D 5D',
+  'KS 3D 2D 6S AS 4C 2S 7C 7H KH',
+  'AC 2H 3S JC 5C QH 4D 2D 5H 7S',
+  'TS AS JD 8C 6H JC 8S 5S 2C 5D',
+  '7S QH 7H 6C QC 8H 2D 7C JD 2S',
+  '2C QD 2S 2H JC 9C 5D 2D JD JH',
+  '7C 5C 9C 8S 7D 6D 8D 6C 9S JH',
+  '2C AD 6S 5H 3S KS 7S 9D KH 4C',
+  '7H 6C 2C 5C TH 9D 8D 3S QC AH',
+  '5S KC 6H TC 5H 8S TH 6D 3C AH',
+  '9C KD 4H AD TD 9S 4S 7D 6H 5D',
+  '7H 5C 5H 6D AS 4C KD KH 4H 9D',
+  '3C 2S 5C 6C JD QS 2H 9D 7D 3H',
+  'AC 2S 6S 7S JS QD 5C QS 6H AD',
+  '5H TH QC 7H TC 3S 7C 6D KC 3D',
+  '4H 3D QC 9S 8H 2C 3S JC KS 5C',
+  '4S 6S 2C 6H 8S 3S 3D 9H 3H JS',
+  '4S 8C 4D 2D 8H 9H 7D 9D AH TS',
+  '9S 2C 9H 4C 8D AS 7D 3D 6D 5S',
+  '6S 4C 7H 8C 3H 5H JC AH 9D 9C',
+  '2S 7C 5S JD 8C 3S 3D 4D 7D 6S',
+  '3C KC 4S 5D 7D 3D JD 7H 3H 4H',
+  '9C 9H 4H 4D TH 6D QD 8S 9S 7S',
+  '2H AC 8S 4S AD 8C 2C AH 7D TC',
+  'TS 9H 3C AD KS TC 3D 8C 8H JD',
+  'QC 8D 2C 3C 7D 7C JD 9H 9C 6C',
+  'AH 6S JS JH 5D AS QC 2C JD TD',
+  '9H KD 2H 5D 2D 3S 7D TC AH TS',
+  'TD 8H AS 5D AH QC AC 6S TC 5H',
+  'KS 4S 7H 4D 8D 9C TC 2H 6H 3H',
+  '3H KD 4S QD QH 3D 8H 8C TD 7S',
+  '8S JD TC AH JS QS 2D KH KS 4D',
+  '3C AD JC KD JS KH 4S TH 9H 2C',
+  'QC 5S JS 9S KS AS 7C QD 2S JD',
+  'KC 5S QS 3S 2D AC 5D 9H 8H KS',
+  '6H 9C TC AD 2C 6D 5S JD 6C 7C',
+  'QS KH TD QD 2C 3H 8S 2S QC AH',
+  '9D 9H JH TC QH 3C 2S JS 5C 7H',
+  '6C 3S 3D 2S 4S QD 2D TH 5D 2C',
+  '2D 6H 6D 2S JC QH AS 7H 4H KH',
+  '5H 6S KS AD TC TS 7C AC 4S 4H',
+  'AD 3C 4H QS 8C 9D KS 2H 2D 4D',
+  '4S 9D 6C 6D 9C AC 8D 3H 7H KD',
+  'JC AH 6C TS JD 6D AD 3S 5D QD',
+  'JC JH JD 3S 7S 8S JS QC 3H 4S',
+  'JD TH 5C 2C AD JS 7H 9S 2H 7S',
+  '8D 3S JH 4D QC AS JD 2C KC 6H',
+  '2C AC 5H KD 5S 7H QD JH AH 2D',
+  'JC QH 8D 8S TC 5H 5C AH 8C 6C',
+  '3H JS 8S QD JH 3C 4H 6D 5C 3S',
+  '6D 4S 4C AH 5H 5S 3H JD 7C 8D',
+  '8H AH 2H 3H JS 3C 7D QC 4H KD',
+  '6S 2H KD 5H 8H 2D 3C 8S 7S QD',
+  '2S 7S KC QC AH TC QS 6D 4C 8D',
+  '5S 9H 2C 3S QD 7S 6C 2H 7C 9D',
+  '3C 6C 5C 5S JD JC KS 3S 5D TS',
+  '7C KS 6S 5S 2S 2D TC 2H 5H QS',
+  'AS 7H 6S TS 5H 9S 9D 3C KD 2H',
+  '4S JS QS 3S 4H 7C 2S AC 6S 9D',
+  '8C JH 2H 5H 7C 5D QH QS KH QC',
+  '3S TD 3H 7C KC 8D 5H 8S KH 8C',
+  '4H KH JD TS 3C 7H AS QC JS 5S',
+  'AH 9D 2C 8D 4D 2D 6H 6C KC 6S',
+  '2S 6H 9D 3S 7H 4D KH 8H KD 3D',
+  '9C TC AC JH KH 4D JD 5H TD 3S',
+  '7S 4H 9D AS 4C 7D QS 9S 2S KH',
+  '3S 8D 8S KS 8C JC 5C KH 2H 5D',
+  '8S QH 2C 4D KC JS QC 9D AC 6H',
+  '8S 8C 7C JS JD 6S 4C 9C AC 4S',
+  'QH 5D 2C 7D JC 8S 2D JS JH 4C',
+  'JS 4C 7S TS JH KC KH 5H QD 4S',
+  'QD 8C 8D 2D 6S TD 9D AC QH 5S',
+  'QH QC JS 3D 3C 5C 4H KH 8S 7H',
+  '7C 2C 5S JC 8S 3H QC 5D 2H KC',
+  '5S 8D KD 6H 4H QD QH 6D AH 3D',
+  '7S KS 6C 2S 4D AC QS 5H TS JD',
+  '7C 2D TC 5D QS AC JS QC 6C KC',
+  '2C KS 4D 3H TS 8S AD 4H 7S 9S',
+  'QD 9H QH 5H 4H 4D KH 3S JC AD',
+  '4D AC KC 8D 6D 4C 2D KH 2C JD',
+  '2C 9H 2D AH 3H 6D 9C 7D TC KS',
+  '8C 3H KD 7C 5C 2S 4S 5H AS AH',
+  'TH JD 4H KD 3H TC 5C 3S AC KH',
+  '6D 7H AH 7S QC 6H 2D TD JD AS',
+  'JH 5D 7H TC 9S 7D JC AS 5S KH',
+  '2H 8C AD TH 6H QD KD 9H 6S 6C',
+  'QH KC 9D 4D 3S JS JH 4H 2C 9H',
+  'TC 7H KH 4H JC 7D 9S 3H QS 7S',
+  'AD 7D JH 6C 7H 4H 3S 3H 4D QH',
+  'JD 2H 5C AS 6C QC 4D 3C TC JH',
+  'AC JD 3H 6H 4C JC AD 7D 7H 9H',
+  '4H TC TS 2C 8C 6S KS 2H JD 9S',
+  '4C 3H QS QC 9S 9H 6D KC 9D 9C',
+  '5C AD 8C 2C QH TH QD JC 8D 8H',
+  'QC 2C 2S QD 9C 4D 3S 8D JH QS',
+  '9D 3S 2C 7S 7C JC TD 3C TC 9H',
+  '3C TS 8H 5C 4C 2C 6S 8D 7C 4H',
+  'KS 7H 2H TC 4H 2C 3S AS AH QS',
+  '8C 2D 2H 2C 4S 4C 6S 7D 5S 3S',
+  'TH QC 5D TD 3C QS KD KC KS AS',
+  '4D AH KD 9H KS 5C 4C 6H JC 7S',
+  'KC 4H 5C QS TC 2H JC 9S AH QH',
+  '4S 9H 3H 5H 3C QD 2H QC JH 8H',
+  '5D AS 7H 2C 3D JH 6H 4C 6S 7D',
+  '9C JD 9H AH JS 8S QH 3H KS 8H',
+  '3S AC QC TS 4D AD 3D AH 8S 9H',
+  '7H 3H QS 9C 9S 5H JH JS AH AC',
+  '8D 3C JD 2H AC 9C 7H 5S 4D 8H',
+  '7C JH 9H 6C JS 9S 7H 8C 9D 4H',
+  '2D AS 9S 6H 4D JS JH 9H AD QD',
+  '6H 7S JH KH AH 7H TD 5S 6S 2C',
+  '8H JH 6S 5H 5S 9D TC 4C QC 9S',
+  '7D 2C KD 3H 5H AS QD 7H JS 4D',
+  'TS QH 6C 8H TH 5H 3C 3H 9C 9D',
+  'AD KH JS 5D 3H AS AC 9S 5C KC',
+  '2C KH 8C JC QS 6D AH 2D KC TC',
+  '9D 3H 2S 7C 4D 6D KH KS 8D 7D',
+  '9H 2S TC JH AC QC 3H 5S 3S 8H',
+  '3S AS KD 8H 4C 3H 7C JH QH TS',
+  '7S 6D 7H 9D JH 4C 3D 3S 6C AS',
+  '4S 2H 2C 4C 8S 5H KC 8C QC QD',
+  '3H 3S 6C QS QC 2D 6S 5D 2C 9D',
+  '2H 8D JH 2S 3H 2D 6C 5C 7S AD',
+  '9H JS 5D QH 8S TS 2H 7S 6S AD',
+  '6D QC 9S 7H 5H 5C 7D KC JD 4H',
+  'QC 5S 9H 9C 4D 6S KS 2S 4C 7C',
+  '9H 7C 4H 8D 3S 6H 5C 8H JS 7S',
+  '2D 6H JS TD 4H 4D JC TH 5H KC',
+  'AC 7C 8D TH 3H 9S 2D 4C KC 4D',
+  'KD QS 9C 7S 3D KS AD TS 4C 4H',
+  'QH 9C 8H 2S 7D KS 7H 5D KD 4C',
+  '9C 2S 2H JC 6S 6C TC QC JH 5C',
+  '7S AC 8H KC 8S 6H QS JC 3D 6S',
+  'JS 2D JH 8C 4S 6H 8H 6D 5D AD',
+  '6H 7D 2S 4H 9H 7C AS AC 8H 5S',
+  '3C JS 4S 6D 5H 2S QH 6S 9C 2C',
+  '3D 5S 6S 9S 4C QS 8D QD 8S TC',
+  '9C 3D AH 9H 5S 2C 7D AD JC 3S',
+  '7H TC AS 3C 6S 6D 7S KH KC 9H',
+  '3S TC 8H 6S 5H JH 8C 7D AC 2S',
+  'QD 9D 9C 3S JC 8C KS 8H 5D 4D',
+  'JS AH JD 6D 9D 8C 9H 9S 8H 3H',
+  '2D 6S 4C 4D 8S AD 4S TC AH 9H',
+  'TS AC QC TH KC 6D 4H 7S 8C 2H',
+  '3C QD JS 9D 5S JC AH 2H TS 9H',
+  '3H 4D QH 5D 9C 5H 7D 4S JC 3S',
+  '8S TH 3H 7C 2H JD JS TS AC 8D',
+  '9C 2H TD KC JD 2S 8C 5S AD 2C',
+  '3D KD 7C 5H 4D QH QD TC 6H 7D',
+  '7H 2C KC 5S KD 6H AH QC 7S QH',
+  '6H 5C AC 5H 2C 9C 2D 7C TD 2S',
+  '4D 9D AH 3D 7C JD 4H 8C 4C KS',
+  'TH 3C JS QH 8H 4C AS 3D QS QC',
+  '4D 7S 5H JH 6D 7D 6H JS KH 3C',
+  'QD 8S 7D 2H 2C 7C JC 2S 5H 8C',
+  'QH 8S 9D TC 2H AD 7C 8D QD 6S',
+  '3S 7C AD 9H 2H 9S JD TS 4C 2D',
+  '3S AS 4H QC 2C 8H 8S 7S TD TC',
+  'JH TH TD 3S 4D 4H 5S 5D QS 2C',
+  '8C QD QH TC 6D 4S 9S 9D 4H QC',
+  '8C JS 9D 6H JD 3H AD 6S TD QC',
+  'KC 8S 3D 7C TD 7D 8D 9H 4S 3S',
+  '6C 4S 3D 9D KD TC KC KS AC 5S',
+  '7C 6S QH 3D JS KD 6H 6D 2D 8C',
+  'JD 2S 5S 4H 8S AC 2D 6S TS 5C',
+  '5H 8C 5S 3C 4S 3D 7C 8D AS 3H',
+  'AS TS 7C 3H AD 7D JC QS 6C 6H',
+  '3S 9S 4C AC QH 5H 5D 9H TS 4H',
+  '6C 5C 7H 7S TD AD JD 5S 2H 2S',
+  '7D 6C KC 3S JD 8D 8S TS QS KH',
+  '8S QS 8D 6C TH AC AH 2C 8H 9S',
+  '7H TD KH QH 8S 3D 4D AH JD AS',
+  'TS 3D 2H JC 2S JH KH 6C QC JS',
+  'KC TH 2D 6H 7S 2S TC 8C 9D QS',
+  '3C 9D 6S KH 8H 6D 5D TH 2C 2H',
+  '6H TC 7D AD 4D 8S TS 9H TD 7S',
+  'JS 6D JD JC 2H AC 6C 3D KH 8D',
+  'KH JD 9S 5D 4H 4C 3H 7S QS 5C',
+  '4H JD 5D 3S 3C 4D KH QH QS 7S',
+  'JD TS 8S QD AH 4C 6H 3S 5S 2C',
+  'QS 3D JD AS 8D TH 7C 6S QC KS',
+  '7S 2H 8C QC 7H AC 6D 2D TH KH',
+  '5S 6C 7H KH 7D AH 8C 5C 7S 3D',
+  '3C KD AD 7D 6C 4D KS 2D 8C 4S',
+  '7C 8D 5S 2D 2S AH AD 2C 9D TD',
+  '3C AD 4S KS JH 7C 5C 8C 9C TH',
+  'AS TD 4D 7C JD 8C QH 3C 5H 9S',
+  '3H 9C 8S 9S 6S QD KS AH 5H JH',
+  'QC 9C 5S 4H 2H TD 7D AS 8C 9D',
+  '8C 2C 9D KD TC 7S 3D KH QC 3C',
+  '4D AS 4C QS 5S 9D 6S JD QH KS',
+  '6D AH 6C 4C 5H TS 9H 7D 3D 5S',
+  'QS JD 7C 8D 9C AC 3S 6S 6C KH',
+  '8H JH 5D 9S 6D AS 6S 3S QC 7H',
+  'QD AD 5C JH 2H AH 4H AS KC 2C',
+  'JH 9C 2C 6H 2D JS 5D 9H KC 6D',
+  '7D 9D KD TH 3H AS 6S QC 6H AD',
+  'JD 4H 7D KC 3H JS 3C TH 3D QS',
+  '4C 3H 8C QD 5H 6H AS 8H AD JD',
+  'TH 8S KD 5D QC 7D JS 5S 5H TS',
+  '7D KC 9D QS 3H 3C 6D TS 7S AH',
+  '7C 4H 7H AH QC AC 4D 5D 6D TH',
+  '3C 4H 2S KD 8H 5H JH TC 6C JD',
+  '4S 8C 3D 4H JS TD 7S JH QS KD',
+  '7C QC KD 4D 7H 6S AD TD TC KH',
+  '5H 9H KC 3H 4D 3D AD 6S QD 6H',
+  'TH 7C 6H TS QH 5S 2C KC TD 6S',
+  '7C 4D 5S JD JH 7D AC KD KH 4H',
+  '7D 6C 8D 8H 5C JH 8S QD TH JD',
+  '8D 7D 6C 7C 9D KD AS 5C QH JH',
+  '9S 2C 8C 3C 4C KS JH 2D 8D 4H',
+  '7S 6C JH KH 8H 3H 9D 2D AH 6D',
+  '4D TC 9C 8D 7H TD KS TH KD 3C',
+  'JD 9H 8D QD AS KD 9D 2C 2S 9C',
+  '8D 3H 5C 7H KS 5H QH 2D 8C 9H',
+  '2D TH 6D QD 6C KC 3H 3S AD 4C',
+  '4H 3H JS 9D 3C TC 5H QH QC JC',
+  '3D 5C 6H 3S 3C JC 5S 7S 2S QH',
+  'AC 5C 8C 4D 5D 4H 2S QD 3C 3H',
+  '2C TD AH 9C KD JS 6S QD 4C QC',
+  'QS 8C 3S 4H TC JS 3H 7C JC AD',
+  '5H 4D 9C KS JC TD 9S TS 8S 9H',
+  'QD TS 7D AS AC 2C TD 6H 8H AH',
+  '6S AD 8C 4S 9H 8D 9D KH 8S 3C',
+  'QS 4D 2D 7S KH JS JC AD 4C 3C',
+  'QS 9S 7H KC TD TH 5H JS AC JH',
+  '6D AC 2S QS 7C AS KS 6S KH 5S',
+  '6D 8H KH 3C QS 2H 5C 9C 9D 6C',
+  'JS 2C 4C 6H 7D JC AC QD TD 3H',
+  '4H QC 8H JD 4C KD KS 5C KC 7S',
+  '6D 2D 3H 2S QD 5S 7H AS TH 6S',
+  'AS 6D 8D 2C 8S TD 8H QD JC AH',
+  '9C 9H 2D TD QH 2H 5C TC 3D 8H',
+  'KC 8S 3D KH 2S TS TC 6S 4D JH',
+  '9H 9D QS AC KC 6H 5D 4D 8D AH',
+  '9S 5C QS 4H 7C 7D 2H 8S AD JS',
+  '3D AC 9S AS 2C 2D 2H 3H JC KH',
+  '7H QH KH JD TC KS 5S 8H 4C 8D',
+  '2H 7H 3S 2S 5H QS 3C AS 9H KD',
+  'AD 3D JD 6H 5S 9C 6D AC 9S 3S',
+  '3D 5D 9C 2D AC 4S 2S AD 6C 6S',
+  'QC 4C 2D 3H 6S KC QH QD 2H JH',
+  'QC 3C 8S 4D 9S 2H 5C 8H QS QD',
+  '6D KD 6S 7H 3S KH 2H 5C JC 6C',
+  '3S 9S TC 6S 8H 2D AD 7S 8S TS',
+  '3C 6H 9C 3H 5C JC 8H QH TD QD',
+  '3C JS QD 5D TD 2C KH 9H TH AS',
+  '9S TC JD 3D 5C 5H AD QH 9H KC',
+  'TC 7H 4H 8H 3H TD 6S AC 7C 2S',
+  'QS 9D 5D 3C JC KS 4D 6C JH 2S',
+  '9S 6S 3C 7H TS 4C KD 6D 3D 9C',
+  '2D 9H AH AC 7H 2S JH 3S 7C QC',
+  'QD 9H 3C 2H AC AS 8S KD 8C KH',
+  '2D 7S TD TH 6D JD 8D 4D 2H 5S',
+  '8S QH KD JD QS JH 4D KC 5H 3S',
+  '3C KH QC 6D 8H 3S AH 7D TD 2D',
+  '5S 9H QH 4S 6S 6C 6D TS TH 7S',
+  '6C 4C 6D QS JS 9C TS 3H 8D 8S',
+  'JS 5C 7S AS 2C AH 2H AD 5S TC',
+  'KD 6C 9C 9D TS 2S JC 4H 2C QD',
+  'QS 9H TC 3H KC KS 4H 3C AD TH',
+  'KH 9C 2H KD 9D TC 7S KC JH 2D',
+  '7C 3S KC AS 8C 5D 9C 9S QH 3H',
+  '2D 8C TD 4C 2H QC 5D TC 2C 7D',
+  'KS 4D 6C QH TD KH 5D 7C AD 8D',
+  '2S 9S 8S 4C 8C 3D 6H QD 7C 7H',
+  '6C 8S QH 5H TS 5C 3C 4S 2S 2H',
+  '8S 6S 2H JC 3S 3H 9D 8C 2S 7H',
+  'QC 2C 8H 9C AC JD 4C 4H 6S 3S',
+  '3H 3S 7D 4C 9S 5H 8H JC 3D TC',
+  'QH 2S 2D 9S KD QD 9H AD 6D 9C',
+  '8D 2D KS 9S JC 4C JD KC 4S TH',
+  'KH TS 6D 4D 5C KD 5H AS 9H AD',
+  'QD JS 7C 6D 5D 5C TH 5H QH QS',
+  '9D QH KH 5H JH 4C 4D TC TH 6C',
+  'KH AS TS 9D KD 9C 7S 4D 8H 5S',
+  'KH AS 2S 7D 9D 4C TS TH AH 7C',
+  'KS 4D AC 8S 9S 8D TH QH 9D 5C',
+  '5D 5C 8C QS TC 4C 3D 3S 2C 8D',
+  '9D KS 2D 3C KC 4S 8C KH 6C JC',
+  '8H AH 6H 7D 7S QD 3C 4C 6C KC',
+  '3H 2C QH 8H AS 7D 4C 8C 4H KC',
+  'QD 5S 4H 2C TD AH JH QH 4C 8S',
+  '3H QS 5S JS 8H 2S 9H 9C 3S 2C',
+  '6H TS 7S JC QD AC TD KC 5S 3H',
+  'QH AS QS 7D JC KC 2C 4C 5C 5S',
+  'QH 3D AS JS 4H 8D 7H JC 2S 9C',
+  '5D 4D 2S 4S 9D 9C 2D QS 8H 7H',
+  '6D 7H 3H JS TS AC 2D JH 7C 8S',
+  'JH 5H KC 3C TC 5S 9H 4C 8H 9D',
+  '8S KC 5H 9H AD KS 9D KH 8D AH',
+  'JC 2H 9H KS 6S 3H QC 5H AH 9C',
+  '5C KH 5S AD 6C JC 9H QC 9C TD',
+  '5S 5D JC QH 2D KS 8H QS 2H TS',
+  'JH 5H 5S AH 7H 3C 8S AS TD KH',
+  '6H 3D JD 2C 4C KC 7S AH 6C JH',
+  '4C KS 9D AD 7S KC 7D 8H 3S 9C',
+  '7H 5C 5H 3C 8H QC 3D KH 6D JC',
+  '2D 4H 5D 7D QC AD AH 9H QH 8H',
+  'KD 8C JS 9D 3S 3C 2H 5D 6D 2S',
+  '8S 6S TS 3C 6H 8D 5S 3H TD 6C',
+  'KS 3D JH 9C 7C 9S QS 5S 4H 6H',
+  '7S 6S TH 4S KC KD 3S JC JH KS',
+  '7C 3C 2S 6D QH 2C 7S 5H 8H AH',
+  'KC 8D QD 6D KH 5C 7H 9D 3D 9C',
+  '6H 2D 8S JS 9S 2S 6D KC 7C TC',
+  'KD 9C JH 7H KC 8S 2S 7S 3D 6H',
+  '4H 9H 2D 4C 8H 7H 5S 8S 2H 8D',
+  'AD 7C 3C 7S 5S 4D 9H 3D JC KH',
+  '5D AS 7D 6D 9C JC 4C QH QS KH',
+  'KD JD 7D 3D QS QC 8S 6D JS QD',
+  '6S 8C 5S QH TH 9H AS AC 2C JD',
+  'QC KS QH 7S 3C 4C 5C KC 5D AH',
+  '6C 4H 9D AH 2C 3H KD 3D TS 5C',
+  'TD 8S QS AS JS 3H KD AC 4H KS',
+  '7D 5D TS 9H 4H 4C 9C 2H 8C QC',
+  '2C 7D 9H 4D KS 4C QH AD KD JS',
+  'QD AD AH KH 9D JS 9H JC KD JD',
+  '8S 3C 4S TS 7S 4D 5C 2S 6H 7C',
+  'JS 7S 5C KD 6D QH 8S TD 2H 6S',
+  'QH 6C TC 6H TD 4C 9D 2H QC 8H',
+  '3D TS 4D 2H 6H 6S 2C 7H 8S 6C',
+  '9H 9D JD JH 3S AH 2C 6S 3H 8S',
+  '2C QS 8C 5S 3H 2S 7D 3C AD 4S',
+  '5C QC QH AS TS 4S 6S 4C 5H JS',
+  'JH 5C TD 4C 6H JS KD KH QS 4H',
+  'TC KH JC 4D 9H 9D 8D KC 3C 8H',
+  '2H TC 8S AD 9S 4H TS 7H 2C 5C',
+  '4H 2S 6C 5S KS AH 9C 7C 8H KD',
+  'TS QH TD QS 3C JH AH 2C 8D 7D',
+  '5D KC 3H 5S AC 4S 7H QS 4C 2H',
+  '3D 7D QC KH JH 6D 6C TD TH KD',
+  '5S 8D TH 6C 9D 7D KH 8C 9S 6D',
+  'JD QS 7S QC 2S QH JC 4S KS 8D',
+  '7S 5S 9S JD KD 9C JC AD 2D 7C',
+  '4S 5H AH JH 9C 5D TD 7C 2D 6S',
+  'KC 6C 7H 6S 9C QD 5S 4H KS TD',
+  '6S 8D KS 2D TH TD 9H JD TS 3S',
+  'KH JS 4H 5D 9D TC TD QC JD TS',
+  'QS QD AC AD 4C 6S 2D AS 3H KC',
+  '4C 7C 3C TD QS 9C KC AS 8D AD',
+  'KC 7H QC 6D 8H 6S 5S AH 7S 8C',
+  '3S AD 9H JC 6D JD AS KH 6S JH',
+  'AD 3D TS KS 7H JH 2D JS QD AC',
+  '9C JD 7C 6D TC 6H 6C JC 3D 3S',
+  'QC KC 3S JC KD 2C 8D AH QS TS',
+  'AS KD 3D JD 8H 7C 8C 5C QD 6C'
+];
+```
+
+## --seed-contents--
+
+```js
+function pokerHands(arr) {
+
+  return true;
+}
+
+const testArr = [
+  '8C TS KC 9H 4S 7D 2S 5D 3S AC',
+  '5C AD 5D AC 9C 7C 5H 8D TD KS',
+  '3H 7H 6S KC JS QH TD JC 2D 8S',
+  'TH 8H 5C QS TC 9H 4D JC KS JS',
+  '7C 5H KC QH JD AS KH 4C AD 4S'
+];
+
+pokerHands(testArr);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
new file mode 100644
index 0000000000..8b074ba259
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-55-lychrel-numbers.md
@@ -0,0 +1,113 @@
+---
+id: 5900f3a31000cf542c50feb6
+title: 'Problem 55: Lychrel numbers'
+challengeType: 5
+forumTopicId: 302166
+dashedName: problem-55-lychrel-numbers
+---
+
+# --description--
+
+If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.
+
+Not all numbers produce palindromes so quickly. For example,
+
+<div style="margin-left: 4em;">
+  349 + 943 = 1292,<br>
+  1292 + 2921 = 4213<br>
+  4213 + 3124 = 7337<br>
+</div>
+
+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 `num`?
+
+**Note:** Wording was modified slightly on 24 April 2007 to emphasize the theoretical nature of Lychrel numbers.
+
+# --hints--
+
+`countLychrelNumbers(1000)` should return a number.
+
+```js
+assert(typeof countLychrelNumbers(1000) === 'number');
+```
+
+`countLychrelNumbers(1000)` should return 13.
+
+```js
+assert.strictEqual(countLychrelNumbers(1000), 13);
+```
+
+`countLychrelNumbers(3243)` should return 39.
+
+```js
+assert.strictEqual(countLychrelNumbers(3243), 39);
+```
+
+`countLychrelNumbers(5000)` should return 76.
+
+```js
+assert.strictEqual(countLychrelNumbers(5000), 76);
+```
+
+`countLychrelNumbers(7654)` should return 140.
+
+```js
+assert.strictEqual(countLychrelNumbers(7654), 140);
+```
+
+`countLychrelNumbers(10000)` should return 249.
+
+```js
+assert.strictEqual(countLychrelNumbers(10000), 249);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countLychrelNumbers(num) {
+
+  return true;
+}
+
+countLychrelNumbers(10000);
+```
+
+# --solutions--
+
+```js
+const countLychrelNumbers = (size) => {
+  const numReverse = (num) => {
+    return Number(num.toString().split('').reverse().join(''));
+  };
+  const isPalin = (num) => {
+    if (numReverse(num) === num) {
+      return true;
+    }
+    return false;
+  };
+  let total = 0;
+  for (let i = 1; i < size; i++) {
+    let loopCount = 1;
+    let sum = i;
+    while (loopCount < 50) {
+      sum = sum + numReverse(sum);
+      if (isPalin(sum)) {
+        break;
+      } else {
+        loopCount++;
+      }
+    }
+    if (loopCount === 50) {
+      total++;
+    }
+  }
+  return total;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
new file mode 100644
index 0000000000..407314741a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-56-powerful-digit-sum.md
@@ -0,0 +1,101 @@
+---
+id: 5900f3a41000cf542c50feb7
+title: 'Problem 56: Powerful digit sum'
+challengeType: 5
+forumTopicId: 302167
+dashedName: problem-56-powerful-digit-sum
+---
+
+# --description--
+
+A googol ($10^{100}$) is a massive number: one followed by one-hundred zeros; $100^{100}$ 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, $a^b$, where `a`, `b` &lt; `n`, what is the maximum digital sum?
+
+# --hints--
+
+`powerfulDigitSum(3)` should return a number.
+
+```js
+assert(typeof powerfulDigitSum(3) === 'number');
+```
+
+`powerfulDigitSum(3)` should return `4`.
+
+```js
+assert.strictEqual(powerfulDigitSum(3), 4);
+```
+
+`powerfulDigitSum(10)` should return `45`.
+
+```js
+assert.strictEqual(powerfulDigitSum(10), 45);
+```
+
+`powerfulDigitSum(50)` should return `406`.
+
+```js
+assert.strictEqual(powerfulDigitSum(50), 406);
+```
+
+`powerfulDigitSum(75)` should return `684`.
+
+```js
+assert.strictEqual(powerfulDigitSum(75), 684);
+```
+
+`powerfulDigitSum(100)` should return `972`.
+
+```js
+assert.strictEqual(powerfulDigitSum(100), 972);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerfulDigitSum(n) {
+
+  return true;
+}
+
+powerfulDigitSum(3);
+```
+
+# --solutions--
+
+```js
+function powerfulDigitSum(n) {
+  function sumDigitsOfPower(numA, numB) {
+    let digitsSum = 0;
+    let number = power(numA, numB);
+    while (number > 0n) {
+      const digit = number % 10n;
+      digitsSum += parseInt(digit, 10);
+      number = number / 10n;
+    }
+    return digitsSum;
+  }
+
+  function power(numA, numB) {
+    let sum = 1n;
+    for (let b = 0; b < numB; b++) {
+      sum = sum * BigInt(numA);
+    }
+    return sum;
+  }
+
+  const limit = n - 1;
+  let maxDigitsSum = 0;
+  for (let a = limit; a > 0; a--) {
+    for (let b = limit; b > 0; b--) {
+      const curDigitSum = sumDigitsOfPower(a, b);
+      if (curDigitSum > maxDigitsSum) {
+        maxDigitsSum = curDigitSum;
+      }
+    }
+  }
+  return maxDigitsSum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
new file mode 100644
index 0000000000..17103bc6fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-57-square-root-convergents.md
@@ -0,0 +1,98 @@
+---
+id: 5900f3a51000cf542c50feb8
+title: 'Problem 57: Square root convergents'
+challengeType: 5
+forumTopicId: 302168
+dashedName: problem-57-square-root-convergents
+---
+
+# --description--
+
+It is possible to show that the square root of two can be expressed as an infinite continued fraction.
+
+<div style='text-align: center;'>$\sqrt 2 =1+ \frac 1 {2+ \frac 1 {2 +\frac 1 {2+ \dots}}}$</div>
+
+By expanding this for the first four iterations, we get:
+
+$1 + \\frac 1 2 = \\frac 32 = 1.5$
+
+$1 + \\frac 1 {2 + \\frac 1 2} = \\frac 7 5 = 1.4$
+
+$1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 2}} = \\frac {17}{12} = 1.41666 \\dots$
+
+$1 + \\frac 1 {2 + \\frac 1 {2+\\frac 1 {2+\\frac 1 2}}} = \\frac {41}{29} = 1.41379 \\dots$
+
+The next three expansions are $\\frac {99}{70}$, $\\frac {239}{169}$, and $\\frac {577}{408}$, but the eighth expansion, $\\frac {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 `n` expansions, how many fractions contain a numerator with more digits than denominator?
+
+# --hints--
+
+`squareRootConvergents(10)` should return a number.
+
+```js
+assert(typeof squareRootConvergents(10) === 'number');
+```
+
+`squareRootConvergents(10)` should return 1.
+
+```js
+assert.strictEqual(squareRootConvergents(10), 1);
+```
+
+`squareRootConvergents(100)` should return 15.
+
+```js
+assert.strictEqual(squareRootConvergents(100), 15);
+```
+
+`squareRootConvergents(1000)` should return 153.
+
+```js
+assert.strictEqual(squareRootConvergents(1000), 153);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function squareRootConvergents(n) {
+
+  return true;
+}
+
+squareRootConvergents(1000);
+```
+
+# --solutions--
+
+```js
+function squareRootConvergents(n) {
+  function countDigits(number) {
+    let counter = 0;
+    while (number > 0) {
+      counter++;
+      number = number / 10n;
+    }
+    return counter;
+  }
+
+  // Use BigInt as integer won't handle all cases
+  let numerator = 3n;
+  let denominator = 2n;
+  let moreDigitsInNumerator = 0;
+
+  for (let i = 2; i <= n; i++) {
+    [numerator, denominator] = [
+      numerator + 2n * denominator,
+      denominator + numerator
+    ];
+
+    if (countDigits(numerator) > countDigits(denominator)) {
+      moreDigitsInNumerator++;
+    }
+  }
+  return moreDigitsInNumerator;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
new file mode 100644
index 0000000000..29a3012e44
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-58-spiral-primes.md
@@ -0,0 +1,105 @@
+---
+id: 5900f3a61000cf542c50feb9
+title: 'Problem 58: Spiral primes'
+challengeType: 5
+forumTopicId: 302169
+dashedName: problem-58-spiral-primes
+---
+
+# --description--
+
+Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.
+
+<div style='text-align: center;'>
+  <strong><span style='color: red;'>37</span></strong> 36 35 34 33 32 <strong><span style='color: red;'>31</span></strong><br>
+  38 <strong><span style='color: red;'>17</span></strong> 16 15 14 <strong><span style='color: red;'>13</span></strong> 30<br>
+  39 18  <strong><span style='color: red;'>5</span></strong>  4  <strong><span style='color: red;'>3</span></strong> 12 29<br>
+  40 19  6  1  2 11 28<br>
+  41 20  <strong><span style='color: red;'>7</span></strong>  8  9 10 27<br>
+  42 21 22 23 24 25 26<br>
+  <strong><span style='color: red;'>43</span></strong> 44 45 46 47 48 49<br>
+</div>
+
+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 percent of primes along both diagonals first falls below `percent`?
+
+# --hints--
+
+`spiralPrimes(50)` should return a number.
+
+```js
+assert(typeof spiralPrimes(50) === 'number');
+```
+
+`spiralPrimes(50)` should return `11`.
+
+```js
+assert.strictEqual(spiralPrimes(50), 11);
+```
+
+`spiralPrimes(15)` should return `981`.
+
+```js
+assert.strictEqual(spiralPrimes(15), 981);
+```
+
+`spiralPrimes(10)` should return `26241`.
+
+```js
+assert.strictEqual(spiralPrimes(10), 26241);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralPrimes(percent) {
+
+  return true;
+}
+
+spiralPrimes(50);
+```
+
+# --solutions--
+
+```js
+function spiralPrimes(percent) {
+  function isPrime(n) {
+    if (n <= 3) {
+      return n > 1;
+    } else if (n % 2 === 0 || n % 3 === 0) {
+      return false;
+    }
+
+    for (let i = 5; i * i <= n; i += 6) {
+      if (n % i === 0 || n % (i + 2) === 0) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  let totalCount = 1;
+  let primesCount = 0;
+  let curNumber = 1;
+  let curSideLength = 1;
+  let ratio = 1;
+  const wantedRatio = percent / 100;
+
+  while (ratio >= wantedRatio) {
+    curSideLength += 2;
+    for (let i = 0; i < 4; i++) {
+      curNumber += curSideLength - 1;
+      totalCount++;
+      if (i !== 3 && isPrime(curNumber)) {
+        primesCount++;
+      }
+    }
+    ratio = primesCount / totalCount;
+  }
+  return curSideLength;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
new file mode 100644
index 0000000000..683db15249
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-59-xor-decryption.md
@@ -0,0 +1,58 @@
+---
+id: 5900f3a81000cf542c50feba
+title: 'Problem 59: XOR decryption'
+challengeType: 5
+forumTopicId: 302170
+dashedName: problem-59-xor-decryption
+---
+
+# --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`, an array 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.
+
+# --hints--
+
+`XORDecryption(cipher)` should return a number.
+
+```js
+assert(typeof XORDecryption(cipher) === 'number');
+```
+
+`XORDecryption(cipher)` should return 129448.
+
+```js
+assert.strictEqual(XORDecryption(cipher), 129448);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function XORDecryption(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const cipher = [
+  36,22,80,0,0,4,23,25,19,17,88,4,4,19,21,11,88,22,23,23,29,69,12,24,0,88,25,11,12,2,10,28,5,6,12,25,10,22,80,10,30,80,10,22,21,69,23,22,69,61,5,9,29,2,66,11,80,8,23,3,17,88,19,0,20,21,7,10,17,17,29,20,69,8,17,21,29,2,22,84,80,71,60,21,69,11,5,8,21,25,22,88,3,0,10,25,0,10,5,8,88,2,0,27,25,21,10,31,6,25,2,16,21,82,69,35,63,11,88,4,13,29,80,22,13,29,22,88,31,3,88,3,0,10,25,0,11,80,10,30,80,23,29,19,12,8,2,10,27,17,9,11,45,95,88,57,69,16,17,19,29,80,23,29,19,0,22,4,9,1,80,3,23,5,11,28,92,69,9,5,12,12,21,69,13,30,0,0,0,0,27,4,0,28,28,28,84,80,4,22,80,0,20,21,2,25,30,17,88,21,29,8,2,0,11,3,12,23,30,69,30,31,23,88,4,13,29,80,0,22,4,12,10,21,69,11,5,8,88,31,3,88,4,13,17,3,69,11,21,23,17,21,22,88,65,69,83,80,84,87,68,69,83,80,84,87,73,69,83,80,84,87,65,83,88,91,69,29,4,6,86,92,69,15,24,12,27,24,69,28,21,21,29,30,1,11,80,10,22,80,17,16,21,69,9,5,4,28,2,4,12,5,23,29,80,10,30,80,17,16,21,69,27,25,23,27,28,0,84,80,22,23,80,17,16,17,17,88,25,3,88,4,13,29,80,17,10,5,0,88,3,16,21,80,10,30,80,17,16,25,22,88,3,0,10,25,0,11,80,12,11,80,10,26,4,4,17,30,0,28,92,69,30,2,10,21,80,12,12,80,4,12,80,10,22,19,0,88,4,13,29,80,20,13,17,1,10,17,17,13,2,0,88,31,3,88,4,13,29,80,6,17,2,6,20,21,69,30,31,9,20,31,18,11,94,69,54,17,8,29,28,28,84,80,44,88,24,4,14,21,69,30,31,16,22,20,69,12,24,4,12,80,17,16,21,69,11,5,8,88,31,3,88,4,13,17,3,69,11,21,23,17,21,22,88,25,22,88,17,69,11,25,29,12,24,69,8,17,23,12,80,10,30,80,17,16,21,69,11,1,16,25,2,0,88,31,3,88,4,13,29,80,21,29,2,12,21,21,17,29,2,69,23,22,69,12,24,0,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,67,80,10,10,80,7,1,80,21,13,4,17,17,30,2,88,4,13,29,80,22,13,29,69,23,22,69,12,24,12,11,80,22,29,2,12,29,3,69,29,1,16,25,28,69,12,31,69,11,92,69,17,4,69,16,17,22,88,4,13,29,80,23,25,4,12,23,80,22,9,2,17,80,70,76,88,29,16,20,4,12,8,28,12,29,20,69,26,9,69,11,80,17,23,80,84,88,31,3,88,4,13,29,80,21,29,2,12,21,21,17,29,2,69,12,31,69,12,24,0,88,20,12,25,29,0,12,21,23,86,80,44,88,7,12,20,28,69,11,31,10,22,80,22,16,31,18,88,4,13,25,4,69,12,24,0,88,3,16,21,80,10,30,80,17,16,25,22,88,3,0,10,25,0,11,80,17,23,80,7,29,80,4,8,0,23,23,8,12,21,17,17,29,28,28,88,65,75,78,68,81,65,67,81,72,70,83,64,68,87,74,70,81,75,70,81,67,80,4,22,20,69,30,2,10,21,80,8,13,28,17,17,0,9,1,25,11,31,80,17,16,25,22,88,30,16,21,18,0,10,80,7,1,80,22,17,8,73,88,17,11,28,80,17,16,21,11,88,4,4,19,25,11,31,80,17,16,21,69,11,1,16,25,2,0,88,2,10,23,4,73,88,4,13,29,80,11,13,29,7,29,2,69,75,94,84,76,65,80,65,66,83,77,67,80,64,73,82,65,67,87,75,72,69,17,3,69,17,30,1,29,21,1,88,0,23,23,20,16,27,21,1,84,80,18,16,25,6,16,80,0,0,0,23,29,3,22,29,3,69,12,24,0,88,0,0,10,25,8,29,4,0,10,80,10,30,80,4,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,86,80,35,23,28,9,23,7,12,22,23,69,25,23,4,17,30,69,12,24,0,88,3,4,21,21,69,11,4,0,8,3,69,26,9,69,15,24,12,27,24,69,49,80,13,25,20,69,25,2,23,17,6,0,28,80,4,12,80,17,16,25,22,88,3,16,21,92,69,49,80,13,25,6,0,88,20,12,11,19,10,14,21,23,29,20,69,12,24,4,12,80,17,16,21,69,11,5,8,88,31,3,88,4,13,29,80,22,29,2,12,29,3,69,73,80,78,88,65,74,73,70,69,83,80,84,87,72,84,88,91,69,73,95,87,77,70,69,83,80,84,87,70,87,77,80,78,88,21,17,27,94,69,25,28,22,23,80,1,29,0,0,22,20,22,88,31,11,88,4,13,29,80,20,13,17,1,10,17,17,13,2,0,88,31,3,88,4,13,29,80,6,17,2,6,20,21,75,88,62,4,21,21,9,1,92,69,12,24,0,88,3,16,21,80,10,30,80,17,16,25,22,88,29,16,20,4,12,8,28,12,29,20,69,26,9,69,65,64,69,31,25,19,29,3,69,12,24,0,88,18,12,9,5,4,28,2,4,12,21,69,80,22,10,13,2,17,16,80,21,23,7,0,10,89,69,23,22,69,12,24,0,88,19,12,10,19,16,21,22,0,10,21,11,27,21,69,23,22,69,12,24,0,88,0,0,10,25,8,29,4,0,10,80,10,30,80,4,88,19,12,10,19,9,29,80,18,16,31,22,29,80,1,17,17,8,29,4,0,10,80,12,11,80,84,86,80,36,22,20,69,26,9,69,11,25,8,17,28,4,10,80,23,29,17,22,23,30,12,22,23,69,49,80,13,25,6,0,88,28,12,19,21,18,17,3,0,88,18,0,29,30,69,25,18,9,29,80,17,23,80,1,29,4,0,10,29,12,22,21,69,12,24,0,88,3,16,21,3,69,23,22,69,12,24,0,88,3,16,26,3,0,9,5,0,22,4,69,11,21,23,17,21,22,88,25,11,88,7,13,17,19,13,88,4,13,29,80,0,0,0,10,22,21,11,12,3,69,25,2,0,88,21,19,29,30,69,22,5,8,26,21,23,11,94
+];
+
+XORDecryption(cipher);
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
new file mode 100644
index 0000000000..ec60601f10
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-6-sum-square-difference.md
@@ -0,0 +1,78 @@
+---
+id: 5900f3721000cf542c50fe85
+title: 'Problem 6: Sum square difference'
+challengeType: 5
+forumTopicId: 302171
+dashedName: problem-6-sum-square-difference
+---
+
+# --description--
+
+The sum of the squares of the first ten natural numbers is,
+
+<div style='text-align: center;'>1<sup>2</sup> + 2<sup>2</sup> + ... + 10<sup>2</sup> = 385</div>
+
+The square of the sum of the first ten natural numbers is,
+
+<div style='text-align: center;'>(1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025</div>
+
+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 `n` natural numbers and the square of the sum.
+
+# --hints--
+
+`sumSquareDifference(10)` should return a number.
+
+```js
+assert(typeof sumSquareDifference(10) === 'number');
+```
+
+`sumSquareDifference(10)` should return 2640.
+
+```js
+assert.strictEqual(sumSquareDifference(10), 2640);
+```
+
+`sumSquareDifference(20)` should return 41230.
+
+```js
+assert.strictEqual(sumSquareDifference(20), 41230);
+```
+
+`sumSquareDifference(100)` should return 25164150.
+
+```js
+assert.strictEqual(sumSquareDifference(100), 25164150);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumSquareDifference(n) {
+
+  return true;
+}
+
+sumSquareDifference(100);
+```
+
+# --solutions--
+
+```js
+const sumSquareDifference = (number)=>{
+  let squareOfSum = Math.pow(sumOfArithmeticSeries(1,1,number),2);
+  let sumOfSquare = sumOfSquareOfNumbers(number);
+ return squareOfSum - sumOfSquare;
+}
+
+function sumOfArithmeticSeries(a,d,n){
+  return (n/2)*(2*a+(n-1)*d);
+}
+
+function sumOfSquareOfNumbers(n){
+ return (n*(n+1)*(2*n+1))/6;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
new file mode 100644
index 0000000000..5acc6c2176
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-60-prime-pair-sets.md
@@ -0,0 +1,46 @@
+---
+id: 5900f3a81000cf542c50febb
+title: 'Problem 60: Prime pair sets'
+challengeType: 5
+forumTopicId: 302172
+dashedName: problem-60-prime-pair-sets
+---
+
+# --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.
+
+# --hints--
+
+`primePairSets()` should return a number.
+
+```js
+assert(typeof primePairSets() === 'number');
+```
+
+`primePairSets()` should return 26033.
+
+```js
+assert.strictEqual(primePairSets(), 26033);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePairSets() {
+
+  return true;
+}
+
+primePairSets();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
new file mode 100644
index 0000000000..3f1e157026
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-61-cyclical-figurate-numbers.md
@@ -0,0 +1,252 @@
+---
+id: 5900f3a91000cf542c50febc
+title: 'Problem 61: Cyclical figurate numbers'
+challengeType: 5
+forumTopicId: 302173
+dashedName: problem-61-cyclical-figurate-numbers
+---
+
+# --description--
+
+Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:
+
+| Type of Number | Formula                      | Sequence              |
+| -------------- | ---------------------------- | --------------------- |
+| Triangle       | $P_3(n) = \frac{n(n+1)}{2}$  | 1, 3, 6, 10, 15, ...  |
+| Square         | $P_4(n) = n^2$               | 1, 4, 9, 16, 25, ...  |
+| Pentagonal     | $P_5(n) = \frac{n(3n−1)}2$   | 1, 5, 12, 22, 35, ... |
+| Hexagonal      | $P_6(n) = n(2n−1)$           | 1, 6, 15, 28, 45, ... |
+| Heptagonal     | $P_7(n) = \frac{n(5n−3)}{2}$ | 1, 7, 18, 34, 55, ... |
+| Octagonal      | $P_8(n) = n(3n−2)$           | 1, 8, 21, 40, 65, ... |
+
+The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.
+
+1. 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).
+2. Each polygonal type: triangle ($P_3(127) = 8128$), square ($P_4(91) = 8281$), and pentagonal ($P_5(44) = 2882$), is represented by a different number in the set.
+3. This is the only set of 4-digit numbers with this property.
+
+Find the sum of all numbers in ordered sets of `n` cyclic 4-digit numbers for which each of the $P_3$ to $P_{n + 2}$ polygonal types, is represented by a different number in the set.
+
+# --hints--
+
+`cyclicalFigurateNums(3)` should return a number.
+
+```js
+assert(typeof cyclicalFigurateNums(3) === 'number');
+```
+
+`cyclicalFigurateNums(3)` should return `19291`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(3), 19291);
+```
+
+`cyclicalFigurateNums(4)` should return `28684`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(4), 28684);
+```
+
+`cyclicalFigurateNums(5)` should return `76255`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(5), 76255);
+```
+
+`cyclicalFigurateNums(6)` should return `28684`.
+
+```js
+assert.strictEqual(cyclicalFigurateNums(6), 28684);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cyclicalFigurateNums(n) {
+
+  return true;
+}
+
+cyclicalFigurateNums(3);
+```
+
+# --solutions--
+
+```js
+function cyclicalFigurateNums(n) {
+  function getChains(chain, n, numberTypes, numsExcludingLastNeededType) {
+    if (chain.length === n) {
+      return [chain];
+    }
+
+    const nextNumbers = getNextNumbersInChain(
+      chain[chain.length - 1],
+      numsExcludingLastNeededType
+    );
+
+    const chains = [];
+    for (let j = 0; j < nextNumbers.length; j++) {
+      const nextNumber = nextNumbers[j];
+      if (chain.indexOf(nextNumber) === -1) {
+        const nextChain = [...chain, nextNumber];
+        chains.push(
+          ...getChains(nextChain, n, numberTypes, numsExcludingLastNeededType)
+        );
+      }
+    }
+    return chains;
+  }
+
+  function getNextNumbersInChain(num, numsExcludingLastNeededType) {
+    const results = [];
+    const beginning = num % 100;
+    numsExcludingLastNeededType.forEach(number => {
+      if (Math.floor(number / 100) === beginning) {
+        results.push(number);
+      }
+    });
+    return results;
+  }
+
+  function fillNumberTypes(n, numberTypes, numsExcludingLastNeededType) {
+    const [, lastTypeCheck, lastTypeArr] = numberTypes[n - 1];
+
+    for (let i = 1000; i <= 9999; i++) {
+      for (let j = 0; j < n - 1; j++) {
+        const [, typeCheck, typeArr] = numberTypes[j];
+        if (typeCheck(i)) {
+          typeArr.push(i);
+          numsExcludingLastNeededType.add(i);
+        }
+      }
+
+      if (lastTypeCheck(i)) {
+        lastTypeArr.push(i);
+      }
+    }
+  }
+
+  function isCyclicalChain(chain, n, numberTypes) {
+    const numberTypesInChain = getNumberTypesInChain(chain, numberTypes);
+
+    if (!isChainAllowed(numberTypesInChain, n)) {
+      return false;
+    }
+
+    const isChainCyclic =
+      Math.floor(chain[0] / 100) === chain[chain.length - 1] % 100;
+    return isChainCyclic;
+  }
+
+  function getNumberTypesInChain(chain, numberTypes) {
+    const numbersInChain = {};
+    for (let i = 0; i < numberTypes.length; i++) {
+      const numberTypeName = numberTypes[i][0];
+      numbersInChain[numberTypeName] = [];
+    }
+
+    for (let i = 0; i < chain.length; i++) {
+      for (let j = 0; j < n; j++) {
+        const [typeName, , typeNumbers] = numberTypes[j];
+        const typeNumbersInChain = numbersInChain[typeName];
+        if (typeNumbers.indexOf(chain[i]) !== -1) {
+          typeNumbersInChain.push(chain[i]);
+        }
+      }
+    }
+    return numbersInChain;
+  }
+
+  function isChainAllowed(numberTypesInChain, n) {
+    for (let i = 0; i < n; i++) {
+      const typeName = numberTypes[i][0];
+      const isNumberWithTypeInChain = numberTypesInChain[typeName].length > 0;
+      if (!isNumberWithTypeInChain) {
+        return false;
+      }
+
+      for (let j = i + 1; j < n; j++) {
+        const otherTypeName = numberTypes[j][0];
+        if (
+          isNumberRepeatedAsOnlyNumberInTwoTypes(
+            numberTypesInChain[typeName],
+            numberTypesInChain[otherTypeName]
+          )
+        ) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+
+  function isNumberRepeatedAsOnlyNumberInTwoTypes(
+    typeNumbers,
+    otherTypeNumbers
+  ) {
+    return (
+      typeNumbers.length === 1 &&
+      otherTypeNumbers.length === 1 &&
+      typeNumbers[0] === otherTypeNumbers[0]
+    );
+  }
+
+  function isTriangle(num) {
+    return ((8 * num + 1) ** 0.5 - 1) % 2 === 0;
+  }
+
+  function isSquare(num) {
+    return num ** 0.5 === parseInt(num ** 0.5, 10);
+  }
+
+  function isPentagonal(num) {
+    return ((24 * num + 1) ** 0.5 + 1) % 6 === 0;
+  }
+
+  function isHexagonal(num) {
+    return ((8 * num + 1) ** 0.5 + 1) % 4 === 0;
+  }
+
+  function isHeptagonal(num) {
+    return ((40 * num + 9) ** 0.5 + 3) % 10 === 0;
+  }
+
+  function isOctagonal(num) {
+    return ((3 * num + 1) ** 0.5 + 1) % 3 === 0;
+  }
+
+  const numberTypes = [
+    ['triangle', isTriangle, []],
+    ['square', isSquare, []],
+    ['pentagonal', isPentagonal, []],
+    ['hexagonal', isHexagonal, []],
+    ['heptagonal', isHeptagonal, []],
+    ['octagonal', isOctagonal, []]
+  ];
+  const numsExcludingLastNeededType = new Set();
+  fillNumberTypes(n, numberTypes, numsExcludingLastNeededType);
+
+  const nNumberChains = [];
+  const [, , lastType] = numberTypes[n - 1];
+  for (let i = 0; i < lastType.length; i++) {
+    const startOfChain = lastType[i];
+    nNumberChains.push(
+      ...getChains([startOfChain], n, numberTypes, numsExcludingLastNeededType)
+    );
+  }
+
+  const cyclicalChains = nNumberChains.filter(chain =>
+    isCyclicalChain(chain, n, numberTypes)
+  );
+
+  let sum = 0;
+  for (let i = 0; i < cyclicalChains.length; i++) {
+    for (let j = 0; j < cyclicalChains[0].length; j++) {
+      sum += cyclicalChains[i][j];
+    }
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
new file mode 100644
index 0000000000..82294e0708
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-62-cubic-permutations.md
@@ -0,0 +1,97 @@
+---
+id: 5900f3aa1000cf542c50febd
+title: 'Problem 62: Cubic permutations'
+challengeType: 5
+forumTopicId: 302174
+dashedName: problem-62-cubic-permutations
+---
+
+# --description--
+
+The cube, 41063625 ($345^3$), can be permuted to produce two other cubes: 56623104 ($384^3$) and 66430125 ($405^3$). 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 `n` permutations of its digits are cube.
+
+# --hints--
+
+`cubicPermutations(2)` should return a number.
+
+```js
+assert(typeof cubicPermutations(2) === 'number');
+```
+
+`cubicPermutations(2)` should return `125`.
+
+```js
+assert.strictEqual(cubicPermutations(2), 125);
+```
+
+`cubicPermutations(3)` should return `41063625`.
+
+```js
+assert.strictEqual(cubicPermutations(3), 41063625);
+```
+
+`cubicPermutations(4)` should return `1006012008`.
+
+```js
+assert.strictEqual(cubicPermutations(4), 1006012008);
+```
+
+`cubicPermutations(5)` should return `127035954683`.
+
+```js
+assert.strictEqual(cubicPermutations(5), 127035954683);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cubicPermutations(n) {
+
+  return true;
+}
+
+cubicPermutations(2);
+```
+
+# --solutions--
+
+```js
+function cubicPermutations(n) {
+  function getDigits(num) {
+    const digits = [];
+    while (num > 0) {
+      digits.push(num % 10);
+      num = Math.floor(num / 10);
+    }
+    return digits;
+  }
+
+  function getCube(num) {
+    return num ** 3;
+  }
+
+  const digitsToCubeCounts = {};
+  let curNum = 1;
+  let digits;
+
+  while (!digitsToCubeCounts[digits] || digitsToCubeCounts[digits].count < n) {
+    const cube = getCube(curNum);
+    digits = getDigits(cube).sort().join();
+    if (!digitsToCubeCounts[digits]) {
+      digitsToCubeCounts[digits] = {
+        count: 1,
+        smallestCube: cube
+      };
+    } else {
+      digitsToCubeCounts[digits].count += 1;
+    }
+
+    curNum++;
+  }
+  return digitsToCubeCounts[digits].smallestCube;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
new file mode 100644
index 0000000000..02c9603685
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.md
@@ -0,0 +1,122 @@
+---
+id: 5900f3ab1000cf542c50febe
+title: 'Problem 63: Powerful digit counts'
+challengeType: 5
+forumTopicId: 302175
+dashedName: problem-63-powerful-digit-counts
+---
+
+# --description--
+
+The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.
+
+Complete the function so that it returns how many positive integers are of length `n` and an `n`th power.
+
+# --hints--
+
+`powerfulDigitCounts(1)` should return a number.
+
+```js
+assert(typeof powerfulDigitCounts(1) === 'number');
+```
+
+`powerfulDigitCounts(1)` should return `9`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(1), 9);
+```
+
+`powerfulDigitCounts(2)` should return `6`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(2), 6);
+```
+
+`powerfulDigitCounts(3)` should return `5`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(3), 5);
+```
+
+`powerfulDigitCounts(4)` should return `4`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(4), 4);
+```
+
+`powerfulDigitCounts(5)` should return `3`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(5), 3);
+```
+
+`powerfulDigitCounts(6)` should return `3`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(6), 3);
+```
+
+`powerfulDigitCounts(7)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(7), 2);
+```
+
+`powerfulDigitCounts(8)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(8), 2);
+```
+
+`powerfulDigitCounts(10)` should return `2`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(10), 2);
+```
+
+`powerfulDigitCounts(21)` should return `1`.
+
+```js
+assert.strictEqual(powerfulDigitCounts(21), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function powerfulDigitCounts(n) {
+
+  return true;
+}
+
+powerfulDigitCounts(1);
+```
+
+# --solutions--
+
+```js
+function powerfulDigitCounts(n) {
+  function countDigits(num) {
+    let counter = 0;
+    while (num > 0) {
+      num = Math.floor(num / 10);
+      counter++;
+    }
+    return counter;
+  }
+
+  let numbersCount = 0;
+
+  let curNum = 1;
+  while (curNum < 10) {
+    let power = n;
+    if (power === countDigits(curNum ** power)) {
+      numbersCount++;
+    }
+    curNum++;
+  }
+
+  return numbersCount;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
new file mode 100644
index 0000000000..6cc017e1fb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-64-odd-period-square-roots.md
@@ -0,0 +1,148 @@
+---
+id: 5900f3ac1000cf542c50febf
+title: 'Problem 64: Odd period square roots'
+challengeType: 5
+forumTopicId: 302176
+dashedName: problem-64-odd-period-square-roots
+---
+
+# --description--
+
+All square roots are periodic when written as continued fractions and can be written in the form:
+
+$\\displaystyle \\quad \\quad \\sqrt{N}=a_0+\\frac 1 {a_1+\\frac 1 {a_2+ \\frac 1 {a3+ \\dots}}}$
+
+For example, let us consider $\\sqrt{23}:$:
+
+$\\quad \\quad \\sqrt{23}=4+\\sqrt{23}-4=4+\\frac 1 {\\frac 1 {\\sqrt{23}-4}}=4+\\frac 1 {1+\\frac{\\sqrt{23}-3}7}$
+
+If we continue we would get the following expansion:
+
+$\\displaystyle \\quad \\quad \\sqrt{23}=4+\\frac 1 {1+\\frac 1 {3+ \\frac 1 {1+\\frac 1 {8+ \\dots}}}}$
+
+The process can be summarized as follows:
+
+$\\quad \\quad a_0=4, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$
+
+$\\quad \\quad a_1=1, \\frac 7 {\\sqrt{23}-3}=\\frac {7(\\sqrt{23}+3)} {14}=3+\\frac {\\sqrt{23}-3} 2$
+
+$\\quad \\quad a_2=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\frac {\\sqrt{23}-4} 7$
+
+$\\quad \\quad a_3=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} 7=8+\\sqrt{23}-4$
+
+$\\quad \\quad a_4=8, \\frac 1 {\\sqrt{23}-4}=\\frac {\\sqrt{23}+4} 7=1+\\frac {\\sqrt{23}-3} 7$
+
+$\\quad \\quad a_5=1, \\frac 7 {\\sqrt{23}-3}=\\frac {7 (\\sqrt{23}+3)} {14}=3+\\frac {\\sqrt{23}-3} 2$
+
+$\\quad \\quad a_6=3, \\frac 2 {\\sqrt{23}-3}=\\frac {2(\\sqrt{23}+3)} {14}=1+\\frac {\\sqrt{23}-4} 7$
+
+$\\quad \\quad a_7=1, \\frac 7 {\\sqrt{23}-4}=\\frac {7(\\sqrt{23}+4)} {7}=8+\\sqrt{23}-4$
+
+It can be seen that the sequence is repeating. For conciseness, we use the notation $\\sqrt{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:
+
+$\\quad \\quad \\sqrt{2}=\[1;(2)]$, period = 1
+
+$\\quad \\quad \\sqrt{3}=\[1;(1,2)]$, period = 2
+
+$\\quad \\quad \\sqrt{5}=\[2;(4)]$, period = 1
+
+$\\quad \\quad \\sqrt{6}=\[2;(2,4)]$, period = 2
+
+$\\quad \\quad \\sqrt{7}=\[2;(1,1,1,4)]$, period = 4
+
+$\\quad \\quad \\sqrt{8}=\[2;(1,4)]$, period = 2
+
+$\\quad \\quad \\sqrt{10}=\[3;(6)]$, period = 1
+
+$\\quad \\quad \\sqrt{11}=\[3;(3,6)]$, period = 2
+
+$\\quad \\quad \\sqrt{12}=\[3;(2,6)]$, period = 2
+
+$\\quad \\quad \\sqrt{13}=\[3;(1,1,1,1,6)]$, period = 5
+
+Exactly four continued fractions, for $N \\le 13$, have an odd period.
+
+How many continued fractions for $N \\le n$ have an odd period?
+
+# --hints--
+
+`oddPeriodSqrts(13)` should return a number.
+
+```js
+assert(typeof oddPeriodSqrts(13) === 'number');
+```
+
+`oddPeriodSqrts(500)` should return `83`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(500), 83);
+```
+
+`oddPeriodSqrts(1000)` should return `152`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(1000), 152);
+```
+
+`oddPeriodSqrts(5000)` should return `690`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(5000), 690);
+```
+
+`oddPeriodSqrts(10000)` should return `1322`.
+
+```js
+assert.strictEqual(oddPeriodSqrts(10000), 1322);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function oddPeriodSqrts(n) {
+
+  return true;
+}
+
+oddPeriodSqrts(13);
+```
+
+# --solutions--
+
+```js
+function oddPeriodSqrts(n) {
+  // Based on https://www.mathblog.dk/project-euler-continued-fractions-odd-period/
+  function getPeriod(num) {
+    let period = 0;
+    let m = 0;
+    let d = 1;
+    let a = Math.floor(Math.sqrt(num));
+    const a0 = a;
+    while (2 * a0 !== a) {
+      m = d * a - m;
+      d = Math.floor((num - m ** 2) / d);
+      a = Math.floor((Math.sqrt(num) + m) / d);
+      period++;
+    }
+    return period;
+  }
+
+  function isPerfectSquare(num) {
+    return Number.isInteger(Math.sqrt(num));
+  }
+
+  let counter = 0;
+  for (let i = 2; i <= n; i++) {
+    if (!isPerfectSquare(i)) {
+      if (getPeriod(i) % 2 !== 0) {
+        counter++;
+      }
+    }
+  }
+  return counter;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
new file mode 100644
index 0000000000..7a1383a7f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-65-convergents-of-e.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3ad1000cf542c50fec0
+title: 'Problem 65: Convergents of e'
+challengeType: 5
+forumTopicId: 302177
+dashedName: problem-65-convergents-of-e
+---
+
+# --description--
+
+The square root of 2 can be written as an infinite continued fraction.
+
+$\\sqrt{2} = 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + ...}}}}$
+
+The infinite continued fraction can be written, $\\sqrt{2} = \[1; (2)]$ indicates that 2 repeats *ad infinitum*. In a similar way, $\\sqrt{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 $\\sqrt{2}$.
+
+$1 + \\dfrac{1}{2} = \\dfrac{3}{2}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2}} = \\dfrac{7}{5}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}} = \\dfrac{17}{12}\\\\ 1 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2 + \\dfrac{1}{2}}}} = \\dfrac{41}{29}$
+
+Hence the sequence of the first ten convergents for $\\sqrt{2}$ are:
+
+$1, \\dfrac{3}{2}, \\dfrac{7}{5}, \\dfrac{17}{12}, \\dfrac{41}{29}, \\dfrac{99}{70}, \\dfrac{239}{169}, \\dfrac{577}{408}, \\dfrac{1393}{985}, \\dfrac{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, \\dfrac{8}{3}, \\dfrac{11}{4}, \\dfrac{19}{7}, \\dfrac{87}{32}, \\dfrac{106}{39}, \\dfrac{193}{71}, \\dfrac{1264}{465}, \\dfrac{1457}{536}, ...$
+
+The sum of digits in the numerator of the 10<sup>th</sup> convergent is $1 + 4 + 5 + 7 = 17$.
+
+Find the sum of digits in the numerator of the `n`<sup>th</sup> convergent of the continued fraction for `e`.
+
+# --hints--
+
+`convergentsOfE(10)` should return a number.
+
+```js
+assert(typeof convergentsOfE(10) === 'number');
+```
+
+`convergentsOfE(10)` should return `17`.
+
+```js
+assert.strictEqual(convergentsOfE(10), 17);
+```
+
+`convergentsOfE(30)` should return `53`.
+
+```js
+assert.strictEqual(convergentsOfE(30), 53);
+```
+
+`convergentsOfE(50)` should return `91`.
+
+```js
+assert.strictEqual(convergentsOfE(50), 91);
+```
+
+`convergentsOfE(70)` should return `169`.
+
+```js
+assert.strictEqual(convergentsOfE(70), 169);
+```
+
+`convergentsOfE(100)` should return `272`.
+
+```js
+assert.strictEqual(convergentsOfE(100), 272);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convergentsOfE(n) {
+
+  return true;
+}
+
+convergentsOfE(10);
+```
+
+# --solutions--
+
+```js
+function convergentsOfE(n) {
+  function sumDigits(num) {
+    let sum = 0n;
+    while (num > 0) {
+      sum += num % 10n;
+      num = num / 10n;
+    }
+    return parseInt(sum);
+  }
+
+  // BigInt is needed for high convergents
+  let convergents = [
+    [2n, 1n],
+    [3n, 1n]
+  ];
+  const multipliers = [1n, 1n, 2n];
+  for (let i = 2; i < n; i++) {
+    const [secondLastConvergent, lastConvergent] = convergents;
+    const [secondLastNumerator, secondLastDenominator] = secondLastConvergent;
+    const [lastNumerator, lastDenominator] = lastConvergent;
+    const curMultiplier = multipliers[i % 3];
+
+    const numerator = secondLastNumerator + curMultiplier * lastNumerator;
+    const denominator = secondLastDenominator + curMultiplier * lastDenominator;
+
+    convergents = [lastConvergent, [numerator, denominator]]
+    if (i % 3 === 2) {
+      multipliers[2] += 2n;
+    }
+  }
+  return sumDigits(convergents[1][0]);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
new file mode 100644
index 0000000000..0eab98070b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-66-diophantine-equation.md
@@ -0,0 +1,129 @@
+---
+id: 5900f3ae1000cf542c50fec1
+title: 'Problem 66: Diophantine equation'
+challengeType: 5
+forumTopicId: 302178
+dashedName: problem-66-diophantine-equation
+---
+
+# --description--
+
+Consider quadratic Diophantine equations of the form:
+
+<div style='text-align: center;'>x<sup>2</sup> – Dy<sup>2</sup> = 1</div>
+
+For example, when D=13, the minimal solution in x is 649<sup>2</sup> – 13×180<sup>2</sup> = 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:
+
+<div style='margin-left: 2em;'>
+  3<sup>2</sup> – 2×2<sup>2</sup> = 1<br>
+  2<sup>2</sup> – 3×1<sup>2</sup> = 1<br>
+  <strong><span style='color: red;'>9</span></strong><sup>2</sup> – 5×4<sup>2</sup> = 1<br>
+  5<sup>2</sup> – 6×2<sup>2</sup> = 1<br>
+  8<sup>2</sup> – 7×3<sup>2</sup> = 1<br>
+</div>
+
+Hence, by considering minimal solutions in `x` for D ≤ 7, the largest `x` is obtained when D=5.
+
+Find the value of D ≤ `n` in minimal solutions of `x` for which the largest value of `x` is obtained.
+
+# --hints--
+
+`diophantineEquation(7)` should return a number.
+
+```js
+assert(typeof diophantineEquation(7) === 'number');
+```
+
+`diophantineEquation(7)` should return `5`.
+
+```
+assert.strictEqual(diophantineEquation(7), 5);
+```
+
+`diophantineEquation(100)` should return `61`.
+
+```
+assert.strictEqual(diophantineEquation(100), 61);
+```
+
+`diophantineEquation(409)` should return `409`.
+
+```
+assert.strictEqual(diophantineEquation(409), 409);
+```
+
+`diophantineEquation(500)` should return `421`.
+
+```
+assert.strictEqual(diophantineEquation(500), 421);
+```
+
+`diophantineEquation(1000)` should return `661`.
+
+```js
+assert.strictEqual(diophantineEquation(1000), 661);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function diophantineEquation(n) {
+
+  return true;
+}
+
+diophantineEquation(7);
+```
+
+# --solutions--
+
+```js
+function diophantineEquation(n) {
+  // Based on https://www.mathblog.dk/project-euler-66-diophantine-equation/
+  function isSolution(D, numerator, denominator) {
+    return numerator * numerator - BigInt(D) * denominator * denominator === 1n;
+  }
+
+  let result = 0;
+  let biggestX = 0;
+
+  for (let D = 2; D <= n; D++) {
+    let boundary = Math.floor(Math.sqrt(D));
+    if (boundary ** 2 === D) {
+      continue;
+    }
+
+    let m = 0n;
+    let d = 1n;
+    let a = BigInt(boundary);
+
+    let [numerator, prevNumerator] = [a, 1n];
+
+    let [denominator, prevDenominator] = [1n, 0n];
+
+    while (!isSolution(D, numerator, denominator)) {
+      m = d * a - m;
+      d = (BigInt(D) - m * m) / d;
+      a = (BigInt(boundary) + m) / d;
+
+      [numerator, prevNumerator] = [a * numerator + prevNumerator, numerator];
+      [denominator, prevDenominator] = [
+        a * denominator + prevDenominator,
+        denominator
+      ];
+    }
+
+    if (numerator > biggestX) {
+      biggestX = numerator;
+      result = D;
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
new file mode 100644
index 0000000000..9e1e818c9c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-67-maximum-path-sum-ii.md
@@ -0,0 +1,96 @@
+---
+id: 5900f3b01000cf542c50fec2
+title: 'Problem 67: Maximum path sum II'
+challengeType: 5
+forumTopicId: 302179
+dashedName: problem-67-maximum-path-sum-ii
+---
+
+# --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.
+
+<div style='text-align: center;'>
+  <strong style='color: red;'>3</strong><br>
+  <strong style='color: red;'>7</strong> 4<br>
+  2 <strong style='color: red;'>4</strong> 6<br>
+  8 5 <strong style='color: red;'>9</strong> 3
+</div>
+
+That is, 3 + 7 + 4 + 9 = 23.
+
+Find the maximum total from top to bottom in `numTriangle`, a 2D array defined in the background 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 2<sup>99</sup> altogether! If you could check one trillion (10<sup>12</sup>) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)
+
+# --hints--
+
+`maximumPathSumII(testTriangle)` should return a number.
+
+```js
+assert(typeof maximumPathSumII(_testTriangle) === 'number');
+```
+
+`maximumPathSumII(testTriangle)` should return 23.
+
+```js
+assert.strictEqual(maximumPathSumII(_testTriangle), 23);
+```
+
+`maximumPathSumII(numTriangle)` should return 7273.
+
+```js
+assert.strictEqual(maximumPathSumII(_numTriangle), 7273);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+const _testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+const _numTriangle = [[59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[73,41,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,40,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[26,53,6,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[10,51,87,86,81,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[61,95,66,57,25,68,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,81,80,38,92,67,73,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[30,28,51,76,81,18,75,44,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[84,14,95,87,62,81,17,78,58,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[21,46,71,58,2,79,62,39,31,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[56,34,35,53,78,31,81,18,90,93,15,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[78,53,4,21,84,93,32,13,97,11,37,51,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[45,3,81,79,5,18,78,86,13,30,63,99,95,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[39,87,96,28,3,38,42,17,82,87,58,7,22,57,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[6,17,51,17,7,93,9,7,75,97,95,78,87,8,53,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[67,66,59,60,88,99,94,65,55,77,55,34,27,53,78,28,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[76,40,41,4,87,16,9,42,75,69,23,97,30,60,10,79,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[12,10,44,26,21,36,32,84,98,60,13,12,36,16,63,31,91,35,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[70,39,6,5,55,27,38,48,28,22,34,35,62,62,15,14,94,89,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,56,68,84,96,21,34,34,34,81,62,40,65,54,62,5,98,3,2,60,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[38,89,46,37,99,54,34,53,36,14,70,26,2,90,45,13,31,61,83,73,47,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[36,10,63,96,60,49,41,5,37,42,14,58,84,93,96,17,9,43,5,43,6,59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,57,87,57,61,28,37,51,84,73,79,15,39,95,88,87,43,39,11,86,77,74,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,42,5,79,30,49,99,73,46,37,50,2,45,9,54,52,27,95,27,65,19,45,26,45,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[71,39,17,78,76,29,52,90,18,99,78,19,35,62,71,19,23,65,93,85,49,33,75,9,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[33,24,47,61,60,55,32,88,57,55,91,54,46,57,7,77,98,52,80,99,24,25,46,78,79,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,9,13,55,10,67,26,78,76,82,63,49,51,31,24,68,5,57,7,54,69,21,67,43,17,63,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[24,59,6,8,98,74,66,26,61,60,13,3,9,9,24,30,71,8,88,70,72,70,29,90,11,82,41,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[66,82,67,4,36,60,92,77,91,85,62,49,59,61,30,90,29,94,26,41,89,4,53,22,83,41,9,74,90,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[48,28,26,37,28,52,77,26,51,32,18,98,79,36,62,13,17,8,19,54,89,29,73,68,42,14,8,16,70,37,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,60,69,70,72,71,9,59,13,60,38,13,57,36,9,30,43,89,30,39,15,2,44,73,5,73,26,63,56,86,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[55,55,85,50,62,99,84,77,28,85,3,21,27,22,19,26,82,69,54,4,13,7,85,14,1,15,70,59,89,95,10,19,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[4,9,31,92,91,38,92,86,98,75,21,5,64,42,62,84,36,20,73,42,21,23,22,51,51,79,25,45,85,53,3,43,22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[75,63,2,49,14,12,89,14,60,78,92,16,44,82,38,30,72,11,46,52,90,27,8,65,78,3,85,41,57,79,39,52,33,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[78,27,56,56,39,13,19,43,86,72,58,95,39,7,4,34,21,98,39,15,39,84,89,69,84,46,37,57,59,35,59,50,26,15,93,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[42,89,36,27,78,91,24,11,17,41,5,94,7,69,51,96,3,96,47,90,90,45,91,20,50,56,10,32,36,49,4,53,85,92,25,65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,9,61,30,61,97,66,21,96,92,98,90,6,34,96,60,32,69,68,33,75,84,18,31,71,50,84,63,3,3,19,11,28,42,75,45,45,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[61,31,61,68,96,34,49,39,5,71,76,59,62,67,6,47,96,99,34,21,32,47,52,7,71,60,42,72,94,56,82,83,84,40,94,87,82,46,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[1,20,60,14,17,38,26,78,66,81,45,95,18,51,98,81,48,16,53,88,37,52,69,95,72,93,22,34,98,20,54,27,73,61,56,63,60,34,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[93,42,94,83,47,61,27,51,79,79,45,1,44,73,31,70,83,42,88,25,53,51,30,15,65,94,80,44,61,84,12,77,2,62,2,65,94,42,14,94,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[32,73,9,67,68,29,74,98,10,19,85,48,38,31,85,67,53,93,93,77,47,67,39,72,94,53,18,43,77,40,78,32,29,59,24,6,2,83,50,60,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[32,1,44,30,16,51,15,81,98,15,10,62,86,79,50,62,45,60,70,38,31,85,65,61,64,6,69,84,14,22,56,43,9,48,66,69,83,91,60,40,36,61,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,48,22,99,15,95,64,43,1,16,94,2,99,19,17,69,11,58,97,56,89,31,77,45,67,96,12,73,8,20,36,47,81,44,50,64,68,85,40,81,85,52,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[91,35,92,45,32,84,62,15,19,64,21,66,6,1,52,80,62,59,12,25,88,28,91,50,40,16,22,99,92,79,87,51,21,77,74,77,7,42,38,42,74,83,2,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[46,19,77,66,24,18,5,32,2,84,31,99,92,58,96,72,91,36,62,99,55,29,53,42,12,37,26,58,89,50,66,19,82,75,12,48,24,87,91,85,2,7,3,76,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[99,98,84,93,7,17,33,61,92,20,66,60,24,66,40,30,67,5,37,29,24,96,3,27,70,62,13,4,45,47,59,88,43,20,66,15,46,92,30,4,71,66,78,70,53,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[67,60,38,6,88,4,17,72,10,99,71,7,42,25,54,5,26,64,91,50,45,71,6,30,67,48,69,82,8,56,80,67,18,46,66,63,1,20,8,80,47,7,91,16,3,79,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[18,54,78,49,80,48,77,40,68,23,60,88,58,80,33,57,11,69,55,53,64,2,94,49,60,92,16,35,81,21,82,96,25,24,96,18,2,5,49,3,50,77,6,32,84,27,18,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[68,1,50,4,3,21,42,94,53,24,89,5,92,26,52,36,68,11,85,1,4,42,2,45,15,6,50,4,53,73,25,74,81,88,98,21,67,84,79,97,99,20,95,4,40,46,2,58,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[94,10,2,78,88,52,21,3,88,60,6,53,49,71,20,91,12,65,7,49,21,22,11,41,58,99,36,16,9,48,17,24,52,36,23,15,72,16,84,56,2,99,43,76,81,71,29,39,49,17,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[64,39,59,84,86,16,17,66,3,9,43,6,64,18,63,29,68,6,23,7,87,14,26,35,17,12,98,41,53,64,78,18,98,27,28,84,80,67,75,62,10,11,76,90,54,10,5,54,41,39,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[43,83,18,37,32,31,52,29,95,47,8,76,35,11,4,53,35,43,34,10,52,57,12,36,20,39,40,55,78,44,7,31,38,26,8,15,56,88,86,1,52,62,10,24,32,5,60,65,53,28,57,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,50,3,52,7,73,49,92,66,80,1,46,8,67,25,36,73,93,7,42,25,53,13,96,76,83,87,90,54,89,78,22,78,91,73,51,69,9,79,94,83,53,9,40,69,62,10,79,49,47,3,81,30,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[71,54,73,33,51,76,59,54,79,37,56,45,84,17,62,21,98,69,41,95,65,24,39,37,62,3,24,48,54,64,46,82,71,78,33,67,9,16,96,68,52,74,79,68,32,21,13,78,96,60,9,69,20,36,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[73,26,21,44,46,38,17,83,65,98,7,23,52,46,61,97,33,13,60,31,70,15,36,77,31,58,56,93,75,68,21,36,69,53,90,75,25,82,39,50,65,94,29,30,11,33,11,13,96,2,56,47,7,49,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[76,46,73,30,10,20,60,70,14,56,34,26,37,39,48,24,55,76,84,91,39,86,95,61,50,14,53,93,64,67,37,31,10,84,42,70,48,20,10,72,60,61,84,79,69,65,99,73,89,25,85,48,92,56,97,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[3,14,80,27,22,30,44,27,67,75,79,32,51,54,81,29,65,14,19,4,13,82,4,91,43,40,12,52,29,99,7,76,60,25,1,7,61,71,37,92,40,47,99,66,57,1,43,44,22,40,53,53,9,69,26,81,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[49,80,56,90,93,87,47,13,75,28,87,23,72,79,32,18,27,20,28,10,37,59,21,18,70,4,79,96,3,31,45,71,81,6,14,18,17,5,31,50,92,79,23,47,9,39,47,91,43,54,69,47,42,95,62,46,32,85,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,18,62,85,87,28,64,5,77,51,47,26,30,65,5,70,65,75,59,80,42,52,25,20,44,10,92,17,71,95,52,14,77,13,24,55,11,65,26,91,1,30,63,15,49,48,41,17,67,47,3,68,20,90,98,32,4,40,68,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,51,58,60,6,55,23,68,5,19,76,94,82,36,96,43,38,90,87,28,33,83,5,17,70,83,96,93,6,4,78,47,80,6,23,84,75,23,87,72,99,14,50,98,92,38,90,64,61,58,76,94,36,66,87,80,51,35,61,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[57,95,64,6,53,36,82,51,40,33,47,14,7,98,78,65,39,58,53,6,50,53,4,69,40,68,36,69,75,78,75,60,3,32,39,24,74,47,26,90,13,40,44,71,90,76,51,24,36,50,25,45,70,80,61,80,61,43,90,64,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[18,29,86,56,68,42,79,10,42,44,30,12,96,18,23,18,52,59,2,99,67,46,60,86,43,38,55,17,44,93,42,21,55,14,47,34,55,16,49,24,23,29,96,51,55,10,46,53,27,92,27,46,63,57,30,65,43,27,21,20,24,83,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[81,72,93,19,69,52,48,1,13,83,92,69,20,48,69,59,20,62,5,42,28,89,90,99,32,72,84,17,8,87,36,3,60,31,36,36,81,26,97,36,48,54,56,56,27,16,91,8,23,11,87,99,33,47,2,14,44,73,70,99,43,35,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[90,56,61,86,56,12,70,59,63,32,1,15,81,47,71,76,95,32,65,80,54,70,34,51,40,45,33,4,64,55,78,68,88,47,31,47,68,87,3,84,23,44,89,72,35,8,31,76,63,26,90,85,96,67,65,91,19,14,17,86,4,71,32,95,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,13,4,22,64,37,37,28,56,62,86,33,7,37,10,44,52,82,52,6,19,52,57,75,90,26,91,24,6,21,14,67,76,30,46,14,35,89,89,41,3,64,56,97,87,63,22,34,3,79,17,45,11,53,25,56,96,61,23,18,63,31,37,37,47,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[77,23,26,70,72,76,77,4,28,64,71,69,14,85,96,54,95,48,6,62,99,83,86,77,97,75,71,66,30,19,57,90,33,1,60,61,14,12,90,99,32,77,56,41,18,14,87,49,10,14,90,64,18,50,21,74,14,16,88,5,45,73,82,47,74,44,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[22,97,41,13,34,31,54,61,56,94,3,24,59,27,98,77,4,9,37,40,12,26,87,9,71,70,7,18,64,57,80,21,12,71,83,94,60,39,73,79,73,19,97,32,64,29,41,7,48,84,85,67,12,74,95,20,24,52,41,67,56,61,29,93,35,72,69,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[72,23,63,66,1,11,7,30,52,56,95,16,65,26,83,90,50,74,60,18,16,48,43,77,37,11,99,98,30,94,91,26,62,73,45,12,87,73,47,27,1,88,66,99,21,41,95,80,2,53,23,32,61,48,32,43,43,83,14,66,95,91,19,81,80,67,25,88,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[8,62,32,18,92,14,83,71,37,96,11,83,39,99,5,16,23,27,10,67,2,25,44,11,55,31,46,64,41,56,44,74,26,81,51,31,45,85,87,9,81,95,22,28,76,69,46,48,64,87,67,76,27,89,31,11,74,16,62,3,60,94,42,47,9,34,94,93,72,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[56,18,90,18,42,17,42,32,14,86,6,53,33,95,99,35,29,15,44,20,49,59,25,54,34,59,84,21,23,54,35,90,78,16,93,13,37,88,54,19,86,67,68,55,66,84,65,42,98,37,87,56,33,28,58,38,28,38,66,27,52,21,81,15,8,22,97,32,85,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[91,53,40,28,13,34,91,25,1,63,50,37,22,49,71,58,32,28,30,18,68,94,23,83,63,62,94,76,80,41,90,22,82,52,29,12,18,56,10,8,35,14,37,57,23,65,67,40,72,39,93,39,70,89,40,34,7,46,94,22,20,5,53,64,56,30,5,56,61,88,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[23,95,11,12,37,69,68,24,66,10,87,70,43,50,75,7,62,41,83,58,95,93,89,79,45,39,2,22,5,22,95,43,62,11,68,29,17,40,26,44,25,71,87,16,70,85,19,25,59,94,90,41,41,80,61,70,55,60,84,33,95,76,42,63,15,9,3,40,38,12,3,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,84,56,80,61,55,85,97,16,94,82,94,98,57,84,30,84,48,93,90,71,5,95,90,73,17,30,98,40,64,65,89,7,79,9,19,56,36,42,30,23,69,73,72,7,5,27,61,24,31,43,48,71,84,21,28,26,65,65,59,65,74,77,20,10,81,61,84,95,8,52,23,70,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[47,81,28,9,98,51,67,64,35,51,59,36,92,82,77,65,80,24,72,53,22,7,27,10,21,28,30,22,48,82,80,48,56,20,14,43,18,25,50,95,90,31,77,8,9,48,44,80,90,22,93,45,82,17,13,96,25,26,8,73,34,99,6,49,24,6,83,51,40,14,15,10,25,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,25,10,81,30,64,24,74,75,80,36,75,82,60,22,69,72,91,45,67,3,62,79,54,89,74,44,83,64,96,66,73,44,30,74,50,37,5,9,97,70,1,60,46,37,91,39,75,75,18,58,52,72,78,51,81,86,52,8,97,1,46,43,66,98,62,81,18,70,93,73,8,32,46,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[96,80,82,7,59,71,92,53,19,20,88,66,3,26,26,10,24,27,50,82,94,73,63,8,51,33,22,45,19,13,58,33,90,15,22,50,36,13,55,6,35,47,82,52,33,61,36,27,28,46,98,14,73,20,73,32,16,26,80,53,47,66,76,38,94,45,2,1,22,52,47,96,64,58,52,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[88,46,23,39,74,63,81,64,20,90,33,33,76,55,58,26,10,46,42,26,74,74,12,83,32,43,9,2,73,55,86,54,85,34,28,23,29,79,91,62,47,41,82,87,99,22,48,90,20,5,96,75,95,4,43,28,81,39,81,1,28,42,78,25,39,77,90,57,58,98,17,36,73,22,63,74,51,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[29,39,74,94,95,78,64,24,38,86,63,87,93,6,70,92,22,16,80,64,29,52,20,27,23,50,14,13,87,15,72,96,81,22,8,49,72,30,70,24,79,31,16,64,59,21,89,34,96,91,48,76,43,53,88,1,57,80,23,81,90,79,58,1,80,87,17,99,86,90,72,63,32,69,14,28,88,69,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[37,17,71,95,56,93,71,35,43,45,4,98,92,94,84,96,11,30,31,27,31,60,92,3,48,5,98,91,86,94,35,90,90,8,48,19,33,28,68,37,59,26,65,96,50,68,22,7,9,49,34,31,77,49,43,6,75,17,81,87,61,79,52,26,27,72,29,50,7,98,86,1,17,10,46,64,24,18,56,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[51,30,25,94,88,85,79,91,40,33,63,84,49,67,98,92,15,26,75,19,82,5,18,78,65,93,61,48,91,43,59,41,70,51,22,15,92,81,67,91,46,98,11,11,65,31,66,10,98,65,83,21,5,56,5,98,73,67,46,74,69,34,8,30,5,52,7,98,32,95,30,94,65,50,24,63,28,81,99,57,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[19,23,61,36,9,89,71,98,65,17,30,29,89,26,79,74,94,11,44,48,97,54,81,55,39,66,69,45,28,47,13,86,15,76,74,70,84,32,36,33,79,20,78,14,41,47,89,28,81,5,99,66,81,86,38,26,6,25,13,60,54,55,23,53,27,5,89,25,23,11,13,54,59,54,56,34,16,24,53,44,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[13,40,57,72,21,15,60,8,4,19,11,98,34,45,9,97,86,71,3,15,56,19,15,44,97,31,90,4,87,87,76,8,12,30,24,62,84,28,12,85,82,53,99,52,13,94,6,65,97,86,9,50,94,68,69,74,30,67,87,94,63,7,78,27,80,36,69,41,6,92,32,78,37,82,30,5,18,87,99,72,19,99,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[44,20,55,77,69,91,27,31,28,81,80,27,2,7,97,23,95,98,12,25,75,29,47,71,7,47,78,39,41,59,27,76,13,15,66,61,68,35,69,86,16,53,67,63,99,85,41,56,8,28,33,40,94,76,90,85,31,70,24,65,84,65,99,82,19,25,54,37,21,46,33,2,52,99,51,33,26,4,87,2,8,18,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,42,61,45,91,6,64,79,80,82,32,16,83,63,42,49,19,78,65,97,40,42,14,61,49,34,4,18,25,98,59,30,82,72,26,88,54,36,21,75,3,88,99,53,46,51,55,78,22,94,34,40,68,87,84,25,30,76,25,8,92,84,42,61,40,38,9,99,40,23,29,39,46,55,10,90,35,84,56,70,63,23,91,39,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[52,92,3,71,89,7,9,37,68,66,58,20,44,92,51,56,13,71,79,99,26,37,2,6,16,67,36,52,58,16,79,73,56,60,59,27,44,77,94,82,20,50,98,33,9,87,94,37,40,83,64,83,58,85,17,76,53,2,83,52,22,27,39,20,48,92,45,21,9,42,24,23,12,37,52,28,50,78,79,20,86,62,73,20,59,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[54,96,80,15,91,90,99,70,10,9,58,90,93,50,81,99,54,38,36,10,30,11,35,84,16,45,82,18,11,97,36,43,96,79,97,65,40,48,23,19,17,31,64,52,65,65,37,32,65,76,99,79,34,65,79,27,55,33,3,1,33,27,61,28,66,8,4,70,49,46,48,83,1,45,19,96,13,81,14,21,31,79,93,85,50,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[92,92,48,84,59,98,31,53,23,27,15,22,79,95,24,76,5,79,16,93,97,89,38,89,42,83,2,88,94,95,82,21,1,97,48,39,31,78,9,65,50,56,97,61,1,7,65,27,21,23,14,15,80,97,44,78,49,35,33,45,81,74,34,5,31,57,9,38,94,7,69,54,69,32,65,68,46,68,78,90,24,28,49,51,45,86,35,0,0,0,0,0,0,0,0,0,0,0,0,0],[41,63,89,76,87,31,86,9,46,14,87,82,22,29,47,16,13,10,70,72,82,95,48,64,58,43,13,75,42,69,21,12,67,13,64,85,58,23,98,9,37,76,5,22,31,12,66,50,29,99,86,72,45,25,10,28,19,6,90,43,29,31,67,79,46,25,74,14,97,35,76,37,65,46,23,82,6,22,30,76,93,66,94,17,96,13,20,72,0,0,0,0,0,0,0,0,0,0,0,0],[63,40,78,8,52,9,90,41,70,28,36,14,46,44,85,96,24,52,58,15,87,37,5,98,99,39,13,61,76,38,44,99,83,74,90,22,53,80,56,98,30,51,63,39,44,30,91,91,4,22,27,73,17,35,53,18,35,45,54,56,27,78,48,13,69,36,44,38,71,25,30,56,15,22,73,43,32,69,59,25,93,83,45,11,34,94,44,39,92,0,0,0,0,0,0,0,0,0,0,0],[12,36,56,88,13,96,16,12,55,54,11,47,19,78,17,17,68,81,77,51,42,55,99,85,66,27,81,79,93,42,65,61,69,74,14,1,18,56,12,1,58,37,91,22,42,66,83,25,19,4,96,41,25,45,18,69,96,88,36,93,10,12,98,32,44,83,83,4,72,91,4,27,73,7,34,37,71,60,59,31,1,54,54,44,96,93,83,36,4,45,0,0,0,0,0,0,0,0,0,0],[30,18,22,20,42,96,65,79,17,41,55,69,94,81,29,80,91,31,85,25,47,26,43,49,2,99,34,67,99,76,16,14,15,93,8,32,99,44,61,77,67,50,43,55,87,55,53,72,17,46,62,25,50,99,73,5,93,48,17,31,70,80,59,9,44,59,45,13,74,66,58,94,87,73,16,14,85,38,74,99,64,23,79,28,71,42,20,37,82,31,23,0,0,0,0,0,0,0,0,0],[51,96,39,65,46,71,56,13,29,68,53,86,45,33,51,49,12,91,21,21,76,85,2,17,98,15,46,12,60,21,88,30,92,83,44,59,42,50,27,88,46,86,94,73,45,54,23,24,14,10,94,21,20,34,23,51,4,83,99,75,90,63,60,16,22,33,83,70,11,32,10,50,29,30,83,46,11,5,31,17,86,42,49,1,44,63,28,60,7,78,95,40,0,0,0,0,0,0,0,0],[44,61,89,59,4,49,51,27,69,71,46,76,44,4,9,34,56,39,15,6,94,91,75,90,65,27,56,23,74,6,23,33,36,69,14,39,5,34,35,57,33,22,76,46,56,10,61,65,98,9,16,69,4,62,65,18,99,76,49,18,72,66,73,83,82,40,76,31,89,91,27,88,17,35,41,35,32,51,32,67,52,68,74,85,80,57,7,11,62,66,47,22,67,0,0,0,0,0,0,0],[65,37,19,97,26,17,16,24,24,17,50,37,64,82,24,36,32,11,68,34,69,31,32,89,79,93,96,68,49,90,14,23,4,4,67,99,81,74,70,74,36,96,68,9,64,39,88,35,54,89,96,58,66,27,88,97,32,14,6,35,78,20,71,6,85,66,57,2,58,91,72,5,29,56,73,48,86,52,9,93,22,57,79,42,12,1,31,68,17,59,63,76,7,77,0,0,0,0,0,0],[73,81,14,13,17,20,11,9,1,83,8,85,91,70,84,63,62,77,37,7,47,1,59,95,39,69,39,21,99,9,87,2,97,16,92,36,74,71,90,66,33,73,73,75,52,91,11,12,26,53,5,26,26,48,61,50,90,65,1,87,42,47,74,35,22,73,24,26,56,70,52,5,48,41,31,18,83,27,21,39,80,85,26,8,44,2,71,7,63,22,5,52,19,8,20,0,0,0,0,0],[17,25,21,11,72,93,33,49,64,23,53,82,3,13,91,65,85,2,40,5,42,31,77,42,5,36,6,54,4,58,7,76,87,83,25,57,66,12,74,33,85,37,74,32,20,69,3,97,91,68,82,44,19,14,89,28,85,85,80,53,34,87,58,98,88,78,48,65,98,40,11,57,10,67,70,81,60,79,74,72,97,59,79,47,30,20,54,80,89,91,14,5,33,36,79,39,0,0,0,0],[60,85,59,39,60,7,57,76,77,92,6,35,15,72,23,41,45,52,95,18,64,79,86,53,56,31,69,11,91,31,84,50,44,82,22,81,41,40,30,42,30,91,48,94,74,76,64,58,74,25,96,57,14,19,3,99,28,83,15,75,99,1,89,85,79,50,3,95,32,67,44,8,7,41,62,64,29,20,14,76,26,55,48,71,69,66,19,72,44,25,14,1,48,74,12,98,7,0,0,0],[64,66,84,24,18,16,27,48,20,14,47,69,30,86,48,40,23,16,61,21,51,50,26,47,35,33,91,28,78,64,43,68,4,79,51,8,19,60,52,95,6,68,46,86,35,97,27,58,4,65,30,58,99,12,12,75,91,39,50,31,42,64,70,4,46,7,98,73,98,93,37,89,77,91,64,71,64,65,66,21,78,62,81,74,42,20,83,70,73,95,78,45,92,27,34,53,71,15,0,0],[30,11,85,31,34,71,13,48,5,14,44,3,19,67,23,73,19,57,6,90,94,72,57,69,81,62,59,68,88,57,55,69,49,13,7,87,97,80,89,5,71,5,5,26,38,40,16,62,45,99,18,38,98,24,21,26,62,74,69,4,85,57,77,35,58,67,91,79,79,57,86,28,66,34,72,51,76,78,36,95,63,90,8,78,47,63,45,31,22,70,52,48,79,94,15,77,61,67,68,0],[23,33,44,81,80,92,93,75,94,88,23,61,39,76,22,3,28,94,32,6,49,65,41,34,18,23,8,47,62,60,3,63,33,13,80,52,31,54,73,43,70,26,16,69,57,87,83,31,3,93,70,81,47,95,77,44,29,68,39,51,56,59,63,7,25,70,7,77,43,53,64,3,94,42,95,39,18,1,66,21,16,97,20,50,90,16,70,10,95,69,29,6,25,61,41,26,15,59,63,35]];
+```
+
+## --seed-contents--
+
+```js
+function maximumPathSumII(triangle) {
+
+  return true;
+}
+
+const testTriangle = [[3, 0, 0, 0],
+                      [7, 4, 0, 0],
+                      [2, 4, 6, 0],
+                      [8, 5, 9, 3]];
+
+maximumPathSumII(testTriangle);
+```
+
+# --solutions--
+
+```js
+function maximumPathSumII(triangle) {
+  const newTriangle = [];
+  for (let i = 0; i < triangle.length; i++) {
+    newTriangle.push(triangle[i].slice());
+  }
+
+  for (let i = newTriangle.length - 2; i >= 0; i--) {
+    for (let j = i; j >= 0; j--) {
+      let higherOption = 0;
+      if (newTriangle[i + 1][j + 1] > newTriangle[i + 1][j]) {
+        higherOption = newTriangle[i + 1][j + 1];
+      } else {
+        higherOption = newTriangle[i + 1][j];
+      }
+      newTriangle[i][j] += higherOption;
+    }
+  }
+  return newTriangle[0][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
new file mode 100644
index 0000000000..1492709e24
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-68-magic-5-gon-ring.md
@@ -0,0 +1,71 @@
+---
+id: 5900f3b01000cf542c50fec3
+title: 'Problem 68: Magic 5-gon ring'
+challengeType: 5
+forumTopicId: 302180
+dashedName: problem-68-magic-5-gon-ring
+---
+
+# --description--
+
+Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.
+
+<img class="img-responsive center-block" alt="a completed example of a 3-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png" style="background-color: white; padding: 10px;">
+
+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.
+
+<div style='text-align: center;'>
+
+| <div style='width: 100px;'>Total</div> | <div style='width: 250px;'>Solution Set</div> |
+| -------------------------------------- | --------------------------------------------- |
+| 9                                      | 4,2,3; 5,3,1; 6,1,2                           |
+| 9                                      | 4,3,2; 6,2,1; 5,1,3                           |
+| 10                                     | 2,3,5; 4,5,1; 6,1,3                           |
+| 10                                     | 2,5,3; 6,3,1; 4,1,5                           |
+| 11                                     | 1,4,6; 3,6,2; 5,2,4                           |
+| 11                                     | 1,6,4; 5,4,2; 3,2,6                           |
+| 12                                     | 1,5,6; 2,6,4; 3,4,5                           |
+| 12                                     | 1,6,5; 3,5,4; 2,4,6                           |
+
+</div>
+
+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?
+
+<img class="img-responsive center-block" alt="a blank diagram of a 5-gon ring" src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png" style="background-color: white; padding: 10px;">
+
+# --hints--
+
+`magic5GonRing()` should return a number.
+
+```js
+assert(typeof magic5GonRing() === 'number');
+```
+
+`magic5GonRing()` should return 6531031914842725.
+
+```js
+assert.strictEqual(magic5GonRing(), 6531031914842725);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function magic5GonRing() {
+
+  return true;
+}
+
+magic5GonRing();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
new file mode 100644
index 0000000000..2e538e324d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-69-totient-maximum.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3b11000cf542c50fec4
+title: 'Problem 69: Totient maximum'
+challengeType: 5
+forumTopicId: 302181
+dashedName: problem-69-totient-maximum
+---
+
+# --description--
+
+Euler's Totient function, ${\phi}(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, ${\phi}(9) = 6$.
+
+<div style='margin-left: 4em;'>
+
+| $n$ | $\text{Relatively Prime}$ | $\displaystyle{\phi}(n)$ | $\displaystyle\frac{n}{{\phi}(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                                |
+
+</div>
+
+It can be seen that `n` = 6 produces a maximum $\displaystyle\frac{n}{{\phi}(n)}$ for `n` ≤ 10.
+
+Find the value of `n` ≤ `limit` for which $\displaystyle\frac{n}{{\phi(n)}}$ is a maximum.
+
+# --hints--
+
+`totientMaximum(10)` should return a number.
+
+```js
+assert(typeof totientMaximum(10) === 'number');
+```
+
+`totientMaximum(10)` should return `6`.
+
+```js
+assert.strictEqual(totientMaximum(10), 6);
+```
+
+`totientMaximum(10000)` should return `2310`.
+
+```js
+assert.strictEqual(totientMaximum(10000), 2310);
+```
+
+`totientMaximum(500000)` should return `30030`.
+
+```js
+assert.strictEqual(totientMaximum(500000), 30030);
+```
+
+`totientMaximum(1000000)` should return `510510`.
+
+```js
+assert.strictEqual(totientMaximum(1000000), 510510);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function totientMaximum(limit) {
+
+  return true;
+}
+
+totientMaximum(10);
+```
+
+# --solutions--
+
+```js
+function totientMaximum(limit) {
+  function getSievePrimes(max) {
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+    const primes = [];
+    for (let i = 2; i < max; i = i + 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j = j + i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  const MAX_PRIME = 50;
+  const primes = getSievePrimes(MAX_PRIME);
+  let result = 1;
+
+  for (let i = 0; result * primes[i] < limit; i++) {
+    result *= primes[i];
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
new file mode 100644
index 0000000000..18b18b2bf1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-7-10001st-prime.md
@@ -0,0 +1,86 @@
+---
+id: 5900f3731000cf542c50fe86
+title: 'Problem 7: 10001st prime'
+challengeType: 5
+forumTopicId: 302182
+dashedName: problem-7-10001st-prime
+---
+
+# --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 `n`th prime number?
+
+# --hints--
+
+`nthPrime(6)` should return a number.
+
+```js
+assert(typeof nthPrime(6) === 'number');
+```
+
+`nthPrime(6)` should return 13.
+
+```js
+assert.strictEqual(nthPrime(6), 13);
+```
+
+`nthPrime(10)` should return 29.
+
+```js
+assert.strictEqual(nthPrime(10), 29);
+```
+
+`nthPrime(100)` should return 541.
+
+```js
+assert.strictEqual(nthPrime(100), 541);
+```
+
+`nthPrime(1000)` should return 7919.
+
+```js
+assert.strictEqual(nthPrime(1000), 7919);
+```
+
+`nthPrime(10001)` should return 104743.
+
+```js
+assert.strictEqual(nthPrime(10001), 104743);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nthPrime(n) {
+
+  return true;
+}
+
+nthPrime(10001);
+```
+
+# --solutions--
+
+```js
+const nthPrime = n => {
+  let pN = 2;
+  let step = 0;
+  while (step < n) {
+    let isPrime = true;
+    let rootN = Math.sqrt(pN);
+    for (let i = 2; i <= rootN; i++) {
+      if (!(pN % i)) {
+        isPrime = false;
+        break;
+      }
+    }
+    isPrime ? step++ : '';
+    pN++;
+  }
+  return pN - 1;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
new file mode 100644
index 0000000000..09c3e10628
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-70-totient-permutation.md
@@ -0,0 +1,118 @@
+---
+id: 5900f3b21000cf542c50fec5
+title: 'Problem 70: Totient permutation'
+challengeType: 5
+forumTopicId: 302183
+dashedName: problem-70-totient-permutation
+---
+
+# --description--
+
+Euler's Totient function, ${\phi}(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, ${\phi}(9) = 6$. The number 1 is considered to be relatively prime to every positive number, so ${\phi}(1) = 1$.
+
+Interestingly, ${\phi}(87109) = 79180$, and it can be seen that 87109 is a permutation of 79180.
+
+Find the value of `n`, 1 &lt; `n` &lt; `limit`, for which ${\phi}(n)$ is a permutation of `n` and the ratio $\displaystyle\frac{n}{{\phi}(n)}$ produces a minimum.
+
+# --hints--
+
+`totientPermutation(10000)` should return a number.
+
+```js
+assert(typeof totientPermutation(10000) === 'number');
+```
+
+`totientPermutation(10000)` should return `4435`.
+
+```js
+assert.strictEqual(totientPermutation(10000), 4435);
+```
+
+`totientPermutation(100000)` should return `75841`.
+
+```js
+assert.strictEqual(totientPermutation(100000), 75841);
+```
+
+`totientPermutation(500000)` should return `474883`.
+
+```js
+assert.strictEqual(totientPermutation(500000), 474883);
+```
+
+`totientPermutation(10000000)` should return `8319823`.
+
+```js
+assert.strictEqual(totientPermutation(10000000), 8319823);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function totientPermutation(limit) {
+
+  return true;
+}
+
+totientPermutation(10000);
+```
+
+# --solutions--
+
+```js
+function totientPermutation(limit) {
+  function getSievePrimes(max) {
+    const primes = [];
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+
+    for (let i = 2; i < max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j += i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  function sortDigits(number) {
+    return number.toString().split('').sort().join('');
+  }
+
+  function isPermutation(numberA, numberB) {
+    return sortDigits(numberA) === sortDigits(numberB);
+  }
+
+  const MAX_PRIME = 4000;
+  const primes = getSievePrimes(MAX_PRIME);
+
+  let nValue = 1;
+  let minRatio = Infinity;
+
+  for (let i = 1; i < primes.length; i++) {
+    for (let j = i + 1; j < primes.length; j++) {
+      const num = primes[i] * primes[j];
+      if (num > limit) {
+        break;
+      }
+
+      const phi = (primes[i] - 1) * (primes[j] - 1);
+      const ratio = num / phi;
+
+      if (minRatio > ratio && isPermutation(num, phi)) {
+        nValue = num;
+        minRatio = ratio;
+      }
+    }
+  }
+  return nValue;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
new file mode 100644
index 0000000000..55a2e9b72f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-71-ordered-fractions.md
@@ -0,0 +1,95 @@
+---
+id: 5900f3b31000cf542c50fec6
+title: 'Problem 71: Ordered fractions'
+challengeType: 5
+forumTopicId: 302184
+dashedName: problem-71-ordered-fractions
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${{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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{\textbf2}{\textbf5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$
+
+It can be seen that $\frac{2}{5}$ is the fraction immediately to the left of $\frac{3}{7}$.
+
+By listing the set of reduced proper fractions for `d` ≤ `limit` in ascending order of size, find the numerator of the fraction immediately to the left of $\frac{3}{7}$.
+
+# --hints--
+
+`orderedFractions(8)` should return a number.
+
+```js
+assert(typeof orderedFractions(8) === 'number');
+```
+
+`orderedFractions(8)` should return `2`.
+
+```js
+assert.strictEqual(orderedFractions(8), 2);
+```
+
+`orderedFractions(10)` should return `2`.
+
+```js
+assert.strictEqual(orderedFractions(10), 2);
+```
+
+`orderedFractions(9994)` should return `4283`.
+
+```js
+assert.strictEqual(orderedFractions(9994), 4283);
+```
+
+`orderedFractions(500000)` should return `214283`.
+
+```js
+assert.strictEqual(orderedFractions(500000), 214283);
+```
+
+`orderedFractions(1000000)` should return `428570`.
+
+```js
+assert.strictEqual(orderedFractions(1000000), 428570);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function orderedFractions(limit) {
+
+  return true;
+}
+
+orderedFractions(8);
+```
+
+# --solutions--
+
+```js
+function orderedFractions(limit) {
+  const fractions = [];
+  const fractionValues = {};
+  const highBoundary = 3 / 7;
+  let lowBoundary = 2 / 7;
+
+  for (let denominator = limit; denominator > 2; denominator--) {
+    let numerator = Math.floor((3 * denominator - 1) / 7);
+    let value = numerator / denominator;
+    if (value > highBoundary || value < lowBoundary) {
+      continue;
+    }
+    fractionValues[value] = [numerator, denominator];
+    fractions.push(value);
+    lowBoundary = value;
+  }
+
+  fractions.sort();
+  return fractionValues[fractions[fractions.length - 1]][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
new file mode 100644
index 0000000000..3929bde7af
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-72-counting-fractions.md
@@ -0,0 +1,90 @@
+---
+id: 5900f3b41000cf542c50fec7
+title: 'Problem 72: Counting fractions'
+challengeType: 5
+forumTopicId: 302185
+dashedName: problem-72-counting-fractions
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \frac{3}{8}, \frac{2}{5}, \frac{3}{7}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{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` ≤ `limit`?
+
+# --hints--
+
+`countingFractions(8)` should return a number.
+
+```js
+assert(typeof countingFractions(8) === 'number');
+```
+
+`countingFractions(8)` should return `21`.
+
+```js
+assert.strictEqual(countingFractions(8), 21);
+```
+
+`countingFractions(20000)` should return `121590395`.
+
+```js
+assert.strictEqual(countingFractions(20000), 121590395);
+```
+
+`countingFractions(500000)` should return `75991039675`.
+
+```js
+assert.strictEqual(countingFractions(500000), 75991039675);
+```
+
+`countingFractions(1000000)` should return `303963552391`.
+
+```js
+assert.strictEqual(countingFractions(1000000), 303963552391);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingFractions(limit) {
+
+  return true;
+}
+
+countingFractions(8);
+```
+
+# --solutions--
+
+```js
+function countingFractions(limit) {
+  const phi = {};
+  let count = 0;
+
+  for (let i = 2; i <= limit; i++) {
+    if (!phi[i]) {
+      phi[i] = i;
+    }
+    if (phi[i] === i) {
+      for (let j = i; j <= limit; j += i) {
+        if (!phi[j]) {
+          phi[j] = j;
+        }
+        phi[j] = (phi[j] / i) * (i - 1);
+      }
+    }
+    count += phi[i];
+  }
+
+  return count;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
new file mode 100644
index 0000000000..10c1ae6ea8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3b61000cf542c50fec8
+title: 'Problem 73: Counting fractions in a range'
+challengeType: 5
+forumTopicId: 302186
+dashedName: problem-73-counting-fractions-in-a-range
+---
+
+# --description--
+
+Consider the fraction, $\frac{n}{d}$, where `n` and `d` are positive integers. If `n` &lt; `d` and highest common factor, ${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:
+
+$$\frac{1}{8}, \frac{1}{7}, \frac{1}{6}, \frac{1}{5}, \frac{1}{4}, \frac{2}{7}, \frac{1}{3}, \mathbf{\frac{3}{8}, \frac{2}{5}, \frac{3}{7}}, \frac{1}{2}, \frac{4}{7}, \frac{3}{5}, \frac{5}{8}, \frac{2}{3}, \frac{5}{7}, \frac{3}{4}, \frac{4}{5}, \frac{5}{6}, \frac{6}{7}, \frac{7}{8}$$
+
+It can be seen that there are `3` fractions between $\frac{1}{3}$ and $\frac{1}{2}$.
+
+How many fractions lie between $\frac{1}{3}$ and $\frac{1}{2}$ in the sorted set of reduced proper fractions for `d` ≤ `limit`?
+
+# --hints--
+
+`countingFractionsInARange(8)` should return a number.
+
+```js
+assert(typeof countingFractionsInARange(8) === 'number');
+```
+
+`countingFractionsInARange(8)` should return `3`.
+
+```js
+assert.strictEqual(countingFractionsInARange(8), 3);
+```
+
+`countingFractionsInARange(1000)` should return `50695`.
+
+```js
+assert.strictEqual(countingFractionsInARange(1000), 50695);
+```
+
+`countingFractionsInARange(6000)` should return `1823861`.
+
+```js
+assert.strictEqual(countingFractionsInARange(6000), 1823861);
+```
+
+`countingFractionsInARange(12000)` should return `7295372`.
+
+```js
+assert.strictEqual(countingFractionsInARange(12000), 7295372);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingFractionsInARange(limit) {
+
+  return true;
+}
+
+countingFractionsInARange(8);
+```
+
+# --solutions--
+
+```js
+function countingFractionsInARange(limit) {
+  let result = 0;
+  const stack = [[3, 2]];
+  while (stack.length > 0) {
+    const [startDenominator, endDenominator] = stack.pop();
+    const curDenominator = startDenominator + endDenominator;
+    if (curDenominator <= limit) {
+      result++;
+      stack.push([startDenominator, curDenominator]);
+      stack.push([curDenominator, endDenominator]);
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
new file mode 100644
index 0000000000..f8645892aa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-74-digit-factorial-chains.md
@@ -0,0 +1,131 @@
+---
+id: 5900f3b61000cf542c50fec9
+title: 'Problem 74: Digit factorial chains'
+challengeType: 5
+forumTopicId: 302187
+dashedName: problem-74-digit-factorial-chains
+---
+
+# --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:
+
+$$\begin{align}
+&169 → 363601 → 1454 → 169\\\\
+&871 → 45361 → 871\\\\
+&872 → 45362 → 872\\\\
+\end{align}$$
+
+It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
+
+$$\begin{align}
+&69 → 363600 → 1454 → 169 → 363601\\ (→ 1454)\\\\
+&78 → 45360 → 871 → 45361\\ (→ 871)\\\\
+&540 → 145\\ (→ 145)\\\\
+\end{align}$$
+
+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 `n`, contain exactly sixty non-repeating terms?
+
+# --hints--
+
+`digitFactorialChains(2000)` should return a number.
+
+```js
+assert(typeof digitFactorialChains(2000) === 'number');
+```
+
+`digitFactorialChains(2000)` should return `6`.
+
+```js
+assert.strictEqual(digitFactorialChains(2000), 6);
+```
+
+`digitFactorialChains(100000)` should return `42`.
+
+```js
+assert.strictEqual(digitFactorialChains(100000), 42);
+```
+
+`digitFactorialChains(500000)` should return `282`.
+
+```js
+assert.strictEqual(digitFactorialChains(500000), 282);
+```
+
+`digitFactorialChains(1000000)` should return `402`.
+
+```js
+assert.strictEqual(digitFactorialChains(1000000), 402);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function digitFactorialChains(n) {
+
+  return true;
+}
+
+digitFactorialChains(2000);
+```
+
+# --solutions--
+
+```js
+function digitFactorialChains(n) {
+  function sumDigitsFactorials(number) {
+    let sum = 0;
+    while (number > 0) {
+      sum += factorials[number % 10];
+      number = Math.floor(number / 10);
+    }
+    return sum;
+  }
+
+  const factorials = [1];
+  for (let i = 1; i < 10; i++) {
+    factorials.push(factorials[factorials.length - 1] * i);
+  }
+
+  const sequences = {
+    169: 3,
+    871: 2,
+    872: 2,
+    1454: 3,
+    45362: 2,
+    45461: 2,
+    3693601: 3
+  };
+  let result = 0;
+
+  for (let i = 2; i < n; i++) {
+    let curNum = i;
+    let chainLength = 0;
+    const curSequence = [];
+    while (curSequence.indexOf(curNum) === -1) {
+      curSequence.push(curNum);
+      curNum = sumDigitsFactorials(curNum);
+      chainLength++;
+      if (sequences.hasOwnProperty(curNum) > 0) {
+        chainLength += sequences[curNum];
+        break;
+      }
+    }
+    if (chainLength === 60) {
+      result++;
+    }
+    for (let j = 1; j < curSequence.length; j++) {
+      sequences[curSequence[j]] = chainLength - j;
+    }
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
new file mode 100644
index 0000000000..a20c0a95ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-75-singular-integer-right-triangles.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3b71000cf542c50feca
+title: 'Problem 75: Singular integer right triangles'
+challengeType: 5
+forumTopicId: 302188
+dashedName: problem-75-singular-integer-right-triangles
+---
+
+# --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.
+
+<div style='margin-left: 4em;'>
+  <strong>12 cm:</strong> (3,4,5)<br>
+  <strong>24 cm:</strong> (6,8,10)<br>
+  <strong>30 cm:</strong> (5,12,13)<br>
+  <strong>36 cm:</strong> (9,12,15)<br>
+  <strong>40 cm:</strong> (8,15,17)<br>
+  <strong>48 cm:</strong> (12,16,20)<br><br>
+</div>
+
+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.
+
+<div style='margin-left: 4em;'>
+  <strong>120 cm:</strong> (30,40,50), (20,48,52), (24,45,51)<br><br>
+</div>
+
+Given that L is the length of the wire, for how many values of L ≤ `n` can exactly one, integer sided right angle, triangle be formed?
+
+# --hints--
+
+`singularIntRightTriangles(48)` should return a number.
+
+```js
+assert(typeof singularIntRightTriangles(48) === 'number');
+```
+
+`singularIntRightTriangles(48)` should return `6`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(48), 6);
+```
+
+`singularIntRightTriangles(700000)` should return `75783`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(700000), 75783);
+```
+
+`singularIntRightTriangles(1000000)` should return `107876`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(1000000), 107876);
+```
+
+`singularIntRightTriangles(1500000)` should return `161667`.
+
+```js
+assert.strictEqual(singularIntRightTriangles(1500000), 161667);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function singularIntRightTriangles(n) {
+
+  return true;
+}
+
+singularIntRightTriangles(48);
+```
+
+# --solutions--
+
+```js
+function singularIntRightTriangles(limit) {
+  function euclidFormula(m, n) {
+    return [m ** 2 - n ** 2, 2 * m * n, m ** 2 + n ** 2];
+  }
+
+  function gcd(numberA, numberB) {
+    if (numberB === 0) {
+      return numberA;
+    }
+    return gcd(numberB, numberA % numberB);
+  }
+
+  function notBothOdd(numberA, numberB) {
+    return (numberA + numberB) % 2 === 1;
+  }
+
+  function areCoprime(numberA, numberB) {
+    return gcd(numberA, numberB) === 1;
+  }
+
+  const trianglesWithPerimeter = new Array(limit + 1).fill(0);
+  const mLimit = Math.sqrt(limit / 2);
+
+  for (let m = 2; m < mLimit; m++) {
+    for (let n = 1; n < m; n++) {
+      if (notBothOdd(m, n) && areCoprime(m, n)) {
+        const [sideA, sideB, sideC] = euclidFormula(m, n);
+        const perimeter = sideA + sideB + sideC;
+        let curPerimeter = perimeter;
+        while (curPerimeter <= limit) {
+          trianglesWithPerimeter[curPerimeter]++;
+          curPerimeter += perimeter;
+        }
+      }
+    }
+  }
+  return trianglesWithPerimeter.filter(trianglesCount => trianglesCount === 1)
+    .length;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
new file mode 100644
index 0000000000..bbc9618245
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-76-counting-summations.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3b81000cf542c50fecb
+title: 'Problem 76: Counting summations'
+challengeType: 5
+forumTopicId: 302189
+dashedName: problem-76-counting-summations
+---
+
+# --description--
+
+It is possible to write five as a sum in exactly six different ways:
+
+<div style='margin-left: 4em;'>
+  4 + 1<br>
+  3 + 2<br>
+  3 + 1 + 1<br>
+  2 + 2 + 1<br>
+  2 + 1 + 1 + 1<br>
+  1 + 1 + 1 + 1 + 1<br><br>
+</div>
+
+How many different ways can `n` be written as a sum of at least two positive integers?
+
+# --hints--
+
+`countingSummations(5)` should return a number.
+
+```js
+assert(typeof countingSummations(5) === 'number');
+```
+
+`countingSummations(5)` should return `6`.
+
+```js
+assert.strictEqual(countingSummations(5), 6);
+```
+
+`countingSummations(20)` should return `626`.
+
+```js
+assert.strictEqual(countingSummations(20), 626);
+```
+
+`countingSummations(50)` should return `204225`.
+
+```js
+assert.strictEqual(countingSummations(50), 204225);
+```
+
+`countingSummations(100)` should return `190569291`.
+
+```js
+assert.strictEqual(countingSummations(100), 190569291);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingSummations(n) {
+
+  return true;
+}
+
+countingSummations(5);
+```
+
+# --solutions--
+
+```js
+function countingSummations(n) {
+  const combinations = new Array(n + 1).fill(0);
+  combinations[0] = 1;
+
+  for (let i = 1; i < n; i++) {
+    for (let j = i; j < n + 1; j++) {
+      combinations[j] += combinations[j - i];
+    }
+  }
+  return combinations[n];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
new file mode 100644
index 0000000000..bd26cc3c69
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-77-prime-summations.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3b91000cf542c50fecc
+title: 'Problem 77: Prime summations'
+challengeType: 5
+forumTopicId: 302190
+dashedName: problem-77-prime-summations
+---
+
+# --description--
+
+It is possible to write ten as the sum of primes in exactly five different ways:
+
+<div style='margin-left: 4em;'>
+  7 + 3<br>
+  5 + 5<br>
+  5 + 3 + 2<br>
+  3 + 3 + 2 + 2<br>
+  2 + 2 + 2 + 2 + 2<br><br>
+</div>
+
+What is the first value which can be written as the sum of primes in over `n` ways?
+
+# --hints--
+
+`primeSummations(5)` should return a number.
+
+```js
+assert(typeof primeSummations(5) === 'number');
+```
+
+`primeSummations(5)` should return `11`.
+
+```js
+assert.strictEqual(primeSummations(5), 11);
+```
+
+`primeSummations(100)` should return `31`.
+
+```js
+assert.strictEqual(primeSummations(100), 31);
+```
+
+`primeSummations(1000)` should return `53`.
+
+```js
+assert.strictEqual(primeSummations(1000), 53);
+```
+
+`primeSummations(5000)` should return `71`.
+
+```js
+assert.strictEqual(primeSummations(5000), 71);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeSummations(n) {
+
+  return true;
+}
+
+primeSummations(5);
+```
+
+# --solutions--
+
+```js
+function primeSummations(n) {
+  function getSievePrimes(max) {
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+    const primes = [];
+
+    for (let i = 2; i < max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j < max; j += i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  const MAX_NUMBER = 100;
+  const primes = getSievePrimes(MAX_NUMBER);
+
+  for (let curNumber = 2; curNumber < MAX_NUMBER; curNumber++) {
+    const combinations = new Array(curNumber + 1).fill(0);
+    combinations[0] = 1;
+    for (let i = 0; i < primes.length; i++) {
+      for (let j = primes[i]; j <= curNumber; j++) {
+        combinations[j] += combinations[j - primes[i]];
+      }
+    }
+    if (combinations[curNumber] > n) {
+      return curNumber;
+    }
+  }
+
+  return false;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
new file mode 100644
index 0000000000..61f145116f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-78-coin-partitions.md
@@ -0,0 +1,103 @@
+---
+id: 5900f3ba1000cf542c50fecd
+title: 'Problem 78: Coin partitions'
+challengeType: 5
+forumTopicId: 302191
+dashedName: problem-78-coin-partitions
+---
+
+# --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$.
+
+<div style='text-align: center;'>
+
+| Coin piles        |
+| ----------------- |
+| OOOOO             |
+| OOOO   O          |
+| OOO   OO          |
+| OOO   O   O       |
+| OO   OO   O       |
+| OO   O   O   O    |
+| O   O   O   O   O |
+
+</div><br>
+
+Find the least value of `n` for which ${p}(n)$ is divisible by `divisor`.
+
+# --hints--
+
+`coinPartitions(7)` should return a number.
+
+```js
+assert(typeof coinPartitions(7) === 'number');
+```
+
+`coinPartitions(7)` should return `5`.
+
+```js
+assert.strictEqual(coinPartitions(7), 5);
+```
+
+`coinPartitions(10000)` should return `599`.
+
+```js
+assert.strictEqual(coinPartitions(10000), 599);
+```
+
+`coinPartitions(100000)` should return `11224`.
+
+```js
+assert.strictEqual(coinPartitions(100000), 11224);
+```
+
+`coinPartitions(1000000)` should return `55374`.
+
+```js
+assert.strictEqual(coinPartitions(1000000), 55374);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function coinPartitions(divisor) {
+
+  return true;
+}
+
+coinPartitions(7);
+```
+
+# --solutions--
+
+```js
+function coinPartitions(divisor) {
+  const partitions = [1];
+
+  let n = 0;
+  while (partitions[n] !== 0) {
+    n++;
+    partitions.push(0);
+
+    let i = 0;
+    let pentagonal = 1;
+    while (pentagonal <= n) {
+      const sign = i % 4 > 1 ? -1 : 1;
+      partitions[n] += sign * partitions[n - pentagonal];
+      partitions[n] = partitions[n] % divisor;
+
+      i++;
+
+      let k = Math.floor(i / 2) + 1;
+      if (i % 2 !== 0) {
+        k *= -1;
+      }
+      pentagonal = Math.floor((k * (3 * k - 1)) / 2);
+    }
+  }
+  return n;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
new file mode 100644
index 0000000000..e9858fa539
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-79-passcode-derivation.md
@@ -0,0 +1,115 @@
+---
+id: 5900f3bb1000cf542c50fece
+title: 'Problem 79: Passcode derivation'
+challengeType: 5
+forumTopicId: 302192
+dashedName: problem-79-passcode-derivation
+---
+
+# --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 arrays, `keylog1`, `keylog2`, and `keylog3`, contains fifty successful login attempts.
+
+Given that the three characters are always asked for in order, analyze the array so as to determine the shortest possible secret passcode of unknown length.
+
+# --hints--
+
+`passcodeDerivation(keylog1)` should return a number.
+
+```js
+assert(typeof passcodeDerivation(_keylog1) === 'number');
+```
+
+`passcodeDerivation(keylog1)` should return `531278`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog1), 531278);
+```
+
+`passcodeDerivation(keylog2)` should return `1230567`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog2), 1230567);
+```
+
+`passcodeDerivation(keylog3)` should return `73162890`.
+
+```js
+assert.strictEqual(passcodeDerivation(_keylog3), 73162890);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _keylog1 = [
+  127,327,178,528,537,538,532,328,127,178,537,127,317,328,512,278,328,327,178,327,578,317,527,178,128,328,517,312,531,128,128,317,527,312,328,532,512,518,317,127,537,528,537,527,327,278,532,128, 318,517
+];
+const _keylog2 = [
+  305,367,256,123,357,120,125,307,236,256,356,267,357,256,356,136,257,107,126,567,567,105,120,237,367,120,367,135,207,167,367,367,307,125,120,130,367,230,106,356,126,106,130,123,307,127,306,167,136,126
+];
+const _keylog3 = [
+  319,680,180,690,129,620,762,689,762,318,368,710,720,710,629,168,160,689,716,731,736,729,316,729,729,710,769,290,719,680,318,389,162,289,162,718,729,319,790,680,890,362,319,760,316,729,380,319,728,716,
+];
+```
+
+## --seed-contents--
+
+```js
+function passcodeDerivation(arr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const keylog1 = [
+  319,680,180,690,129,620,762,689,762,318,368,710,720,710,629,168,160,689,716,731,736,729,316,729,729,710,769,290,719,680,318,389,162,289,162,718,729,319,790,680,890,362,319,760,316,729,380,319,728,716,
+];
+
+passcodeDerivation(keylog1);
+```
+
+# --solutions--
+
+```js
+function passcodeDerivation(arr) {
+  const numbersInPasscode = [];
+  const relativePositions = new Array(10)
+    .fill()
+    .map(() => new Array(10).fill(0));
+
+  for (let i = 0; i < arr.length; i++) {
+    const curAttempt = arr[i]
+      .toString()
+      .split('')
+      .map(key => parseInt(key, 10));
+    for (let j = 0; j < curAttempt.length; j++) {
+      if (numbersInPasscode.indexOf(curAttempt[j]) === -1) {
+        numbersInPasscode.push(curAttempt[j]);
+      }
+      for (let k = j + 1; k < curAttempt.length; k++) {
+        relativePositions[curAttempt[j]][curAttempt[k]] += 1;
+      }
+    }
+  }
+
+  const ranks = {};
+  for (let i = 0; i < numbersInPasscode.length; i++) {
+    const curNumber = numbersInPasscode[i];
+    ranks[curNumber] = relativePositions[curNumber].filter(
+      count => count > 0
+    ).length;
+  }
+
+  const passcode = numbersInPasscode
+    .sort((i, j) => ranks[i] - ranks[j])
+    .reverse()
+    .join('');
+
+  return parseInt(passcode, 10);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
new file mode 100644
index 0000000000..0fd4703af7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-8-largest-product-in-a-series.md
@@ -0,0 +1,92 @@
+---
+id: 5900f3741000cf542c50fe87
+title: 'Problem 8: Largest product in a series'
+challengeType: 5
+forumTopicId: 302193
+dashedName: problem-8-largest-product-in-a-series
+---
+
+# --description--
+
+The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
+
+<div style='text-align: center;'>73167176531330624919225119674426574742355349194934</div>
+<div style='text-align: center;'>96983520312774506326239578318016984801869478851843</div>
+<div style='text-align: center;'>85861560789112949495459501737958331952853208805511</div>
+<div style='text-align: center;'>12540698747158523863050715693290963295227443043557</div>
+<div style='text-align: center;'>66896648950445244523161731856403098711121722383113</div>
+<div style='text-align: center;'>62229893423380308135336276614282806444486645238749</div>
+<div style='text-align: center;'>30358907296290491560440772390713810515859307960866</div>
+<div style='text-align: center;'>70172427121883998797908792274921901699720888093776</div>
+<div style='text-align: center;'>65727333001053367881220235421809751254540594752243</div>
+<div style='text-align: center;'>52584907711670556013604839586446706324415722155397</div>
+<div style='text-align: center;'>53697817977846174064955149290862569321978468622482</div>
+<div style='text-align: center;'>83972241375657056057490261407972968652414535100474</div>
+<div style='text-align: center;'>82166370484403199890008895243450658541227588666881</div>
+<div style='text-align: center;'>16427171479924442928230863465674813919123162824586</div>
+<div style='text-align: center;'>17866458359124566529476545682848912883142607690042</div>
+<div style='text-align: center;'>24219022671055626321111109370544217506941658960408</div>
+<div style='text-align: center;'>07198403850962455444362981230987879927244284909188</div>
+<div style='text-align: center;'>84580156166097919133875499200524063689912560717606</div>
+<div style='text-align: center;'>05886116467109405077541002256983155200055935729725</div>
+<div style='text-align: center;'>71636269561882670428252483600823257530420752963450</div>
+
+Find the `n` adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
+
+# --hints--
+
+`largestProductinaSeries(4)` should return a number.
+
+```js
+assert(typeof largestProductinaSeries(4) === 'number');
+```
+
+`largestProductinaSeries(4)` should return 5832.
+
+```js
+assert.strictEqual(largestProductinaSeries(4), 5832);
+```
+
+`largestProductinaSeries(13)` should return 23514624000.
+
+```js
+assert.strictEqual(largestProductinaSeries(13), 23514624000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largestProductinaSeries(n) {
+
+  let thousandDigits = [7,3,1,6,7,1,7,6,5,3,1,3,3,0,6,2,4,9,1,9,2,2,5,1,1,9,6,7,4,4,2,6,5,7,4,7,4,2,3,5,5,3,4,9,1,9,4,9,3,4,9,6,9,8,3,5,2,0,3,1,2,7,7,4,5,0,6,3,2,6,2,3,9,5,7,8,3,1,8,0,1,6,9,8,4,8,0,1,8,6,9,4,7,8,8,5,1,8,4,3,8,5,8,6,1,5,6,0,7,8,9,1,1,2,9,4,9,4,9,5,4,5,9,5,0,1,7,3,7,9,5,8,3,3,1,9,5,2,8,5,3,2,0,8,8,0,5,5,1,1,1,2,5,4,0,6,9,8,7,4,7,1,5,8,5,2,3,8,6,3,0,5,0,7,1,5,6,9,3,2,9,0,9,6,3,2,9,5,2,2,7,4,4,3,0,4,3,5,5,7,6,6,8,9,6,6,4,8,9,5,0,4,4,5,2,4,4,5,2,3,1,6,1,7,3,1,8,5,6,4,0,3,0,9,8,7,1,1,1,2,1,7,2,2,3,8,3,1,1,3,6,2,2,2,9,8,9,3,4,2,3,3,8,0,3,0,8,1,3,5,3,3,6,2,7,6,6,1,4,2,8,2,8,0,6,4,4,4,4,8,6,6,4,5,2,3,8,7,4,9,3,0,3,5,8,9,0,7,2,9,6,2,9,0,4,9,1,5,6,0,4,4,0,7,7,2,3,9,0,7,1,3,8,1,0,5,1,5,8,5,9,3,0,7,9,6,0,8,6,6,7,0,1,7,2,4,2,7,1,2,1,8,8,3,9,9,8,7,9,7,9,0,8,7,9,2,2,7,4,9,2,1,9,0,1,6,9,9,7,2,0,8,8,8,0,9,3,7,7,6,6,5,7,2,7,3,3,3,0,0,1,0,5,3,3,6,7,8,8,1,2,2,0,2,3,5,4,2,1,8,0,9,7,5,1,2,5,4,5,4,0,5,9,4,7,5,2,2,4,3,5,2,5,8,4,9,0,7,7,1,1,6,7,0,5,5,6,0,1,3,6,0,4,8,3,9,5,8,6,4,4,6,7,0,6,3,2,4,4,1,5,7,2,2,1,5,5,3,9,7,5,3,6,9,7,8,1,7,9,7,7,8,4,6,1,7,4,0,6,4,9,5,5,1,4,9,2,9,0,8,6,2,5,6,9,3,2,1,9,7,8,4,6,8,6,2,2,4,8,2,8,3,9,7,2,2,4,1,3,7,5,6,5,7,0,5,6,0,5,7,4,9,0,2,6,1,4,0,7,9,7,2,9,6,8,6,5,2,4,1,4,5,3,5,1,0,0,4,7,4,8,2,1,6,6,3,7,0,4,8,4,4,0,3,1,9,9,8,9,0,0,0,8,8,9,5,2,4,3,4,5,0,6,5,8,5,4,1,2,2,7,5,8,8,6,6,6,8,8,1,1,6,4,2,7,1,7,1,4,7,9,9,2,4,4,4,2,9,2,8,2,3,0,8,6,3,4,6,5,6,7,4,8,1,3,9,1,9,1,2,3,1,6,2,8,2,4,5,8,6,1,7,8,6,6,4,5,8,3,5,9,1,2,4,5,6,6,5,2,9,4,7,6,5,4,5,6,8,2,8,4,8,9,1,2,8,8,3,1,4,2,6,0,7,6,9,0,0,4,2,2,4,2,1,9,0,2,2,6,7,1,0,5,5,6,2,6,3,2,1,1,1,1,1,0,9,3,7,0,5,4,4,2,1,7,5,0,6,9,4,1,6,5,8,9,6,0,4,0,8,0,7,1,9,8,4,0,3,8,5,0,9,6,2,4,5,5,4,4,4,3,6,2,9,8,1,2,3,0,9,8,7,8,7,9,9,2,7,2,4,4,2,8,4,9,0,9,1,8,8,8,4,5,8,0,1,5,6,1,6,6,0,9,7,9,1,9,1,3,3,8,7,5,4,9,9,2,0,0,5,2,4,0,6,3,6,8,9,9,1,2,5,6,0,7,1,7,6,0,6,0,5,8,8,6,1,1,6,4,6,7,1,0,9,4,0,5,0,7,7,5,4,1,0,0,2,2,5,6,9,8,3,1,5,5,2,0,0,0,5,5,9,3,5,7,2,9,7,2,5,7,1,6,3,6,2,6,9,5,6,1,8,8,2,6,7,0,4,2,8,2,5,2,4,8,3,6,0,0,8,2,3,2,5,7,5,3,0,4,2,0,7,5,2,9,6,3,4,5,0];
+  return true;
+}
+
+largestProductinaSeries(13);
+```
+
+# --solutions--
+
+```js
+const largestProductinaSeries = (number)=>{
+  let thousandDigits = [7,3,1,6,7,1,7,6,5,3,1,3,3,0,6,2,4,9,1,9,2,2,5,1,1,9,6,7,4,4,2,6,5,7,4,7,4,2,3,5,5,3,4,9,1,9,4,9,3,4,9,6,9,8,3,5,2,0,3,1,2,7,7,4,5,0,6,3,2,6,2,3,9,5,7,8,3,1,8,0,1,6,9,8,4,8,0,1,8,6,9,4,7,8,8,5,1,8,4,3,8,5,8,6,1,5,6,0,7,8,9,1,1,2,9,4,9,4,9,5,4,5,9,5,0,1,7,3,7,9,5,8,3,3,1,9,5,2,8,5,3,2,0,8,8,0,5,5,1,1,1,2,5,4,0,6,9,8,7,4,7,1,5,8,5,2,3,8,6,3,0,5,0,7,1,5,6,9,3,2,9,0,9,6,3,2,9,5,2,2,7,4,4,3,0,4,3,5,5,7,6,6,8,9,6,6,4,8,9,5,0,4,4,5,2,4,4,5,2,3,1,6,1,7,3,1,8,5,6,4,0,3,0,9,8,7,1,1,1,2,1,7,2,2,3,8,3,1,1,3,6,2,2,2,9,8,9,3,4,2,3,3,8,0,3,0,8,1,3,5,3,3,6,2,7,6,6,1,4,2,8,2,8,0,6,4,4,4,4,8,6,6,4,5,2,3,8,7,4,9,3,0,3,5,8,9,0,7,2,9,6,2,9,0,4,9,1,5,6,0,4,4,0,7,7,2,3,9,0,7,1,3,8,1,0,5,1,5,8,5,9,3,0,7,9,6,0,8,6,6,7,0,1,7,2,4,2,7,1,2,1,8,8,3,9,9,8,7,9,7,9,0,8,7,9,2,2,7,4,9,2,1,9,0,1,6,9,9,7,2,0,8,8,8,0,9,3,7,7,6,6,5,7,2,7,3,3,3,0,0,1,0,5,3,3,6,7,8,8,1,2,2,0,2,3,5,4,2,1,8,0,9,7,5,1,2,5,4,5,4,0,5,9,4,7,5,2,2,4,3,5,2,5,8,4,9,0,7,7,1,1,6,7,0,5,5,6,0,1,3,6,0,4,8,3,9,5,8,6,4,4,6,7,0,6,3,2,4,4,1,5,7,2,2,1,5,5,3,9,7,5,3,6,9,7,8,1,7,9,7,7,8,4,6,1,7,4,0,6,4,9,5,5,1,4,9,2,9,0,8,6,2,5,6,9,3,2,1,9,7,8,4,6,8,6,2,2,4,8,2,8,3,9,7,2,2,4,1,3,7,5,6,5,7,0,5,6,0,5,7,4,9,0,2,6,1,4,0,7,9,7,2,9,6,8,6,5,2,4,1,4,5,3,5,1,0,0,4,7,4,8,2,1,6,6,3,7,0,4,8,4,4,0,3,1,9,9,8,9,0,0,0,8,8,9,5,2,4,3,4,5,0,6,5,8,5,4,1,2,2,7,5,8,8,6,6,6,8,8,1,1,6,4,2,7,1,7,1,4,7,9,9,2,4,4,4,2,9,2,8,2,3,0,8,6,3,4,6,5,6,7,4,8,1,3,9,1,9,1,2,3,1,6,2,8,2,4,5,8,6,1,7,8,6,6,4,5,8,3,5,9,1,2,4,5,6,6,5,2,9,4,7,6,5,4,5,6,8,2,8,4,8,9,1,2,8,8,3,1,4,2,6,0,7,6,9,0,0,4,2,2,4,2,1,9,0,2,2,6,7,1,0,5,5,6,2,6,3,2,1,1,1,1,1,0,9,3,7,0,5,4,4,2,1,7,5,0,6,9,4,1,6,5,8,9,6,0,4,0,8,0,7,1,9,8,4,0,3,8,5,0,9,6,2,4,5,5,4,4,4,3,6,2,9,8,1,2,3,0,9,8,7,8,7,9,9,2,7,2,4,4,2,8,4,9,0,9,1,8,8,8,4,5,8,0,1,5,6,1,6,6,0,9,7,9,1,9,1,3,3,8,7,5,4,9,9,2,0,0,5,2,4,0,6,3,6,8,9,9,1,2,5,6,0,7,1,7,6,0,6,0,5,8,8,6,1,1,6,4,6,7,1,0,9,4,0,5,0,7,7,5,4,1,0,0,2,2,5,6,9,8,3,1,5,5,2,0,0,0,5,5,9,3,5,7,2,9,7,2,5,7,1,6,3,6,2,6,9,5,6,1,8,8,2,6,7,0,4,2,8,2,5,2,4,8,3,6,0,0,8,2,3,2,5,7,5,3,0,4,2,0,7,5,2,9,6,3,4,5,0];
+ let numberOfDigits = thousandDigits.length;
+ let currentIndex = 0;
+ let productOfAdjDigits = [];
+
+  while(currentIndex<=(numberOfDigits-number)){
+   let currentAdj = thousandDigits.slice(currentIndex,currentIndex+number);
+    let isAdjDigits = false;
+
+    productOfAdjDigits.push(currentAdj.reduce((prev,cur)=>{
+     return prev*cur;
+    }));
+
+    currentIndex++;
+ }
+
+ return Math.max(...productOfAdjDigits);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
new file mode 100644
index 0000000000..a552334705
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-80-square-root-digital-expansion.md
@@ -0,0 +1,109 @@
+---
+id: 5900f3bc1000cf542c50fecf
+title: 'Problem 80: Square root digital expansion'
+challengeType: 5
+forumTopicId: 302194
+dashedName: problem-80-square-root-digital-expansion
+---
+
+# --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 `n` natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.
+
+# --hints--
+
+`sqrtDigitalExpansion(2)` should return a number.
+
+```js
+assert(typeof sqrtDigitalExpansion(2) === 'number');
+```
+
+`sqrtDigitalExpansion(2)` should return `475`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(2), 475);
+```
+
+`sqrtDigitalExpansion(50)` should return `19543`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(50), 19543);
+```
+
+`sqrtDigitalExpansion(100)` should return `40886`.
+
+```js
+assert.strictEqual(sqrtDigitalExpansion(100), 40886);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sqrtDigitalExpansion(n) {
+
+  return true;
+}
+
+sqrtDigitalExpansion(2);
+```
+
+# --solutions--
+
+```js
+function sqrtDigitalExpansion(n) {
+  function sumDigits(number) {
+    let sum = 0;
+    while (number > 0n) {
+      let digit = number % 10n;
+      sum += parseInt(digit, 10);
+      number = number / 10n;
+    }
+    return sum;
+  }
+
+  function power(numberA, numberB) {
+    let result = 1n;
+    for (let b = 0; b < numberB; b++) {
+      result = result * BigInt(numberA);
+    }
+    return result;
+  }
+
+  // Based on http://www.afjarvis.staff.shef.ac.uk/maths/jarvisspec02.pdf
+  function expandSquareRoot(number, numDigits) {
+    let a = 5n * BigInt(number);
+    let b = 5n;
+    const boundaryWithNeededDigits = power(10, numDigits + 1);
+
+    while (b < boundaryWithNeededDigits) {
+      if (a >= b) {
+        a = a - b;
+        b = b + 10n;
+      } else {
+        a = a * 100n;
+        b = (b / 10n) * 100n + 5n;
+      }
+    }
+    return b / 100n;
+  }
+
+  let result = 0;
+  let nextPerfectRoot = 1;
+  const requiredDigits = 100;
+  for (let i = 1; i <= n; i++) {
+    if (nextPerfectRoot ** 2 === i) {
+      nextPerfectRoot++;
+      continue;
+    }
+    result += sumDigits(expandSquareRoot(i, requiredDigits));
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
new file mode 100644
index 0000000000..1a34ca9936
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-81-path-sum-two-ways.md
@@ -0,0 +1,189 @@
+---
+id: 5900f3bd1000cf542c50fed0
+title: 'Problem 81: Path sum: two ways'
+challengeType: 5
+forumTopicId: 302195
+dashedName: problem-81-path-sum-two-ways
+---
+
+# --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 from the top left to the bottom right by only moving right and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in the tests will be 80 by 80.
+
+# --hints--
+
+`pathSumTwoWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumTwoWays(_testMatrix1) === 'number');
+```
+
+`pathSumTwoWays(testMatrix1)` should return `2427`.
+
+```js
+assert.strictEqual(pathSumTwoWays(_testMatrix1), 2427);
+```
+
+`pathSumTwoWays(testMatrix2)` should return `427337`.
+
+```js
+assert.strictEqual(pathSumTwoWays(_testMatrix2), 427337);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumTwoWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumTwoWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumTwoWays(matrix) {
+  function makeMinimalMove(row, column) {
+    if (resultMatrix[row][column + 1] < resultMatrix[row + 1][column]) {
+      return resultMatrix[row][column + 1];
+    }
+    return resultMatrix[row + 1][column];
+  }
+
+  const size = matrix.length;
+  const resultMatrix = [];
+  for (let i = 0; i < size; i++) {
+    resultMatrix.push([...matrix[i]])
+  }
+
+  for (let i = size - 2; i >= 0; i--) {
+    resultMatrix[size - 1][i] += resultMatrix[size - 1][i + 1];
+    resultMatrix[i][size - 1] += resultMatrix[i + 1][size - 1];
+  }
+
+  for (let row = size - 2; row >= 0; row--) {
+    for (let column = size - 2; column >= 0; column--) {
+      resultMatrix[row][column] += makeMinimalMove(row, column);
+    }
+  }
+  return resultMatrix[0][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
new file mode 100644
index 0000000000..27e015ed2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-82-path-sum-three-ways.md
@@ -0,0 +1,199 @@
+---
+id: 5900f3be1000cf542c50fed1
+title: 'Problem 82: Path sum: three ways'
+challengeType: 5
+forumTopicId: 302196
+dashedName: problem-82-path-sum-three-ways
+---
+
+# --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 from the left column to the right column in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
+
+# --hints--
+
+`pathSumThreeWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumThreeWays(_testMatrix1) === 'number');
+```
+
+`pathSumThreeWays(testMatrix1)` should return `994`.
+
+```js
+assert.strictEqual(pathSumThreeWays(_testMatrix1), 994);
+```
+
+`pathSumThreeWays(testMatrix2)` should return `260324`.
+
+```js
+assert.strictEqual(pathSumThreeWays(_testMatrix2), 260324);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumThreeWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumThreeWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumThreeWays(matrix) {
+  function makeMinimumMoveFromUpOrRight(row, column) {
+    const curValue = matrix[row][column];
+    if (values[row - 1] > values[row]) {
+      return values[row] + curValue;
+    }
+    return values[row - 1] + curValue;
+  }
+  function isGoingFromDownBetter(row, column) {
+    return values[row] > values[row + 1] + matrix[row][column];
+  }
+
+  const size = matrix.length;
+  const values = [];
+  for (let row = 0; row < size; row++) {
+    values.push(matrix[row][size - 1]);
+  }
+
+  for (let column = size - 2; column >= 0; column--) {
+    values[0] += matrix[0][column];
+
+    for (let row = 1; row < size; row++) {
+      values[row] = makeMinimumMoveFromUpOrRight(row, column);
+    }
+
+    for (let row = size - 2; row >= 0; row--) {
+      if (isGoingFromDownBetter(row, column)) {
+        values[row] = values[row + 1] + matrix[row][column];
+      }
+    }
+  }
+
+  return Math.min(...values);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
new file mode 100644
index 0000000000..bd3b6f085a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-83-path-sum-four-ways.md
@@ -0,0 +1,219 @@
+---
+id: 5900f3bf1000cf542c50fed2
+title: 'Problem 83: Path sum: four ways'
+challengeType: 5
+forumTopicId: 302197
+dashedName: problem-83-path-sum-four-ways
+---
+
+# --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 from the top left to the bottom right by moving left, right, up, and down in `matrix`, a 2D array representing a matrix. The maximum matrix size used in tests will be 80 by 80.
+
+# --hints--
+
+`pathSumFourWays(testMatrix1)` should return a number.
+
+```js
+assert(typeof pathSumFourWays(_testMatrix1) === 'number');
+```
+
+`pathSumFourWays(testMatrix1)` should return `2297`.
+
+```js
+assert.strictEqual(pathSumFourWays(_testMatrix1), 2297);
+```
+
+`pathSumFourWays(testMatrix2)` should return `425185`.
+
+```js
+assert.strictEqual(pathSumFourWays(_testMatrix2), 425185);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+const _testMatrix2 = [
+  [4445,2697,5115,718,2209,2212,654,4348,3079,6821,7668,3276,8874,4190,3785,2752,9473,7817,9137,496,7338,3434,7152,4355,4552,7917,7827,2460,2350,691,3514,5880,3145,7633,7199,3783,5066,7487,3285,1084,8985,760,872,8609,8051,1134,9536,5750,9716,9371,7619,5617,275,9721,2997,2698,1887,8825,6372,3014,2113,7122,7050,6775,5948,2758,1219,3539,348,7989,2735,9862,1263,8089,6401,9462,3168,2758,3748,5870],
+  [1096,20,1318,7586,5167,2642,1443,5741,7621,7030,5526,4244,2348,4641,9827,2448,6918,5883,3737,300,7116,6531,567,5997,3971,6623,820,6148,3287,1874,7981,8424,7672,7575,6797,6717,1078,5008,4051,8795,5820,346,1851,6463,2117,6058,3407,8211,117,4822,1317,4377,4434,5925,8341,4800,1175,4173,690,8978,7470,1295,3799,8724,3509,9849,618,3320,7068,9633,2384,7175,544,6583,1908,9983,481,4187,9353,9377],
+  [9607,7385,521,6084,1364,8983,7623,1585,6935,8551,2574,8267,4781,3834,2764,2084,2669,4656,9343,7709,2203,9328,8004,6192,5856,3555,2260,5118,6504,1839,9227,1259,9451,1388,7909,5733,6968,8519,9973,1663,5315,7571,3035,4325,4283,2304,6438,3815,9213,9806,9536,196,5542,6907,2475,1159,5820,9075,9470,2179,9248,1828,4592,9167,3713,4640,47,3637,309,7344,6955,346,378,9044,8635,7466,5036,9515,6385,9230],
+  [7206,3114,7760,1094,6150,5182,7358,7387,4497,955,101,1478,7777,6966,7010,8417,6453,4955,3496,107,449,8271,131,2948,6185,784,5937,8001,6104,8282,4165,3642,710,2390,575,715,3089,6964,4217,192,5949,7006,715,3328,1152,66,8044,4319,1735,146,4818,5456,6451,4113,1063,4781,6799,602,1504,6245,6550,1417,1343,2363,3785,5448,4545,9371,5420,5068,4613,4882,4241,5043,7873,8042,8434,3939,9256,2187],
+  [3620,8024,577,9997,7377,7682,1314,1158,6282,6310,1896,2509,5436,1732,9480,706,496,101,6232,7375,2207,2306,110,6772,3433,2878,8140,5933,8688,1399,2210,7332,6172,6403,7333,4044,2291,1790,2446,7390,8698,5723,3678,7104,1825,2040,140,3982,4905,4160,2200,5041,2512,1488,2268,1175,7588,8321,8078,7312,977,5257,8465,5068,3453,3096,1651,7906,253,9250,6021,8791,8109,6651,3412,345,4778,5152,4883,7505],
+  [1074,5438,9008,2679,5397,5429,2652,3403,770,9188,4248,2493,4361,8327,9587,707,9525,5913,93,1899,328,2876,3604,673,8576,6908,7659,2544,3359,3883,5273,6587,3065,1749,3223,604,9925,6941,2823,8767,7039,3290,3214,1787,7904,3421,7137,9560,8451,2669,9219,6332,1576,5477,6755,8348,4164,4307,2984,4012,6629,1044,2874,6541,4942,903,1404,9125,5160,8836,4345,2581,460,8438,1538,5507,668,3352,2678,6942],
+  [4295,1176,5596,1521,3061,9868,7037,7129,8933,6659,5947,5063,3653,9447,9245,2679,767,714,116,8558,163,3927,8779,158,5093,2447,5782,3967,1716,931,7772,8164,1117,9244,5783,7776,3846,8862,6014,2330,6947,1777,3112,6008,3491,1906,5952,314,4602,8994,5919,9214,3995,5026,7688,6809,5003,3128,2509,7477,110,8971,3982,8539,2980,4689,6343,5411,2992,5270,5247,9260,2269,7474,1042,7162,5206,1232,4556,4757],
+  [510,3556,5377,1406,5721,4946,2635,7847,4251,8293,8281,6351,4912,287,2870,3380,3948,5322,3840,4738,9563,1906,6298,3234,8959,1562,6297,8835,7861,239,6618,1322,2553,2213,5053,5446,4402,6500,5182,8585,6900,5756,9661,903,5186,7687,5998,7997,8081,8955,4835,6069,2621,1581,732,9564,1082,1853,5442,1342,520,1737,3703,5321,4793,2776,1508,1647,9101,2499,6891,4336,7012,3329,3212,1442,9993,3988,4930,7706],
+  [9444,3401,5891,9716,1228,7107,109,3563,2700,6161,5039,4992,2242,8541,7372,2067,1294,3058,1306,320,8881,5756,9326,411,8650,8824,5495,8282,8397,2000,1228,7817,2099,6473,3571,5994,4447,1299,5991,543,7874,2297,1651,101,2093,3463,9189,6872,6118,872,1008,1779,2805,9084,4048,2123,5877,55,3075,1737,9459,4535,6453,3644,108,5982,4437,5213,1340,6967,9943,5815,669,8074,1838,6979,9132,9315,715,5048],
+  [3327,4030,7177,6336,9933,5296,2621,4785,2755,4832,2512,2118,2244,4407,2170,499,7532,9742,5051,7687,970,6924,3527,4694,5145,1306,2165,5940,2425,8910,3513,1909,6983,346,6377,4304,9330,7203,6605,3709,3346,970,369,9737,5811,4427,9939,3693,8436,5566,1977,3728,2399,3985,8303,2492,5366,9802,9193,7296,1033,5060,9144,2766,1151,7629,5169,5995,58,7619,7565,4208,1713,6279,3209,4908,9224,7409,1325,8540],
+  [6882,1265,1775,3648,4690,959,5837,4520,5394,1378,9485,1360,4018,578,9174,2932,9890,3696,116,1723,1178,9355,7063,1594,1918,8574,7594,7942,1547,6166,7888,354,6932,4651,1010,7759,6905,661,7689,6092,9292,3845,9605,8443,443,8275,5163,7720,7265,6356,7779,1798,1754,5225,6661,1180,8024,5666,88,9153,1840,3508,1193,4445,2648,3538,6243,6375,8107,5902,5423,2520,1122,5015,6113,8859,9370,966,8673,2442],
+  [7338,3423,4723,6533,848,8041,7921,8277,4094,5368,7252,8852,9166,2250,2801,6125,8093,5738,4038,9808,7359,9494,601,9116,4946,2702,5573,2921,9862,1462,1269,2410,4171,2709,7508,6241,7522,615,2407,8200,4189,5492,5649,7353,2590,5203,4274,710,7329,9063,956,8371,3722,4253,4785,1194,4828,4717,4548,940,983,2575,4511,2938,1827,2027,2700,1236,841,5760,1680,6260,2373,3851,1841,4968,1172,5179,7175,3509],
+  [4420,1327,3560,2376,6260,2988,9537,4064,4829,8872,9598,3228,1792,7118,9962,9336,4368,9189,6857,1829,9863,6287,7303,7769,2707,8257,2391,2009,3975,4993,3068,9835,3427,341,8412,2134,4034,8511,6421,3041,9012,2983,7289,100,1355,7904,9186,6920,5856,2008,6545,8331,3655,5011,839,8041,9255,6524,3862,8788,62,7455,3513,5003,8413,3918,2076,7960,6108,3638,6999,3436,1441,4858,4181,1866,8731,7745,3744,1000],
+  [356,8296,8325,1058,1277,4743,3850,2388,6079,6462,2815,5620,8495,5378,75,4324,3441,9870,1113,165,1544,1179,2834,562,6176,2313,6836,8839,2986,9454,5199,6888,1927,5866,8760,320,1792,8296,7898,6121,7241,5886,5814,2815,8336,1576,4314,3109,2572,6011,2086,9061,9403,3947,5487,9731,7281,3159,1819,1334,3181,5844,5114,9898,4634,2531,4412,6430,4262,8482,4546,4555,6804,2607,9421,686,8649,8860,7794,6672],
+  [9870,152,1558,4963,8750,4754,6521,6256,8818,5208,5691,9659,8377,9725,5050,5343,2539,6101,1844,9700,7750,8114,5357,3001,8830,4438,199,9545,8496,43,2078,327,9397,106,6090,8181,8646,6414,7499,5450,4850,6273,5014,4131,7639,3913,6571,8534,9703,4391,7618,445,1320,5,1894,6771,7383,9191,4708,9706,6939,7937,8726,9382,5216,3685,2247,9029,8154,1738,9984,2626,9438,4167,6351,5060,29,1218,1239,4785],
+  [192,5213,8297,8974,4032,6966,5717,1179,6523,4679,9513,1481,3041,5355,9303,9154,1389,8702,6589,7818,6336,3539,5538,3094,6646,6702,6266,2759,4608,4452,617,9406,8064,6379,444,5602,4950,1810,8391,1536,316,8714,1178,5182,5863,5110,5372,4954,1978,2971,5680,4863,2255,4630,5723,2168,538,1692,1319,7540,440,6430,6266,7712,7385,5702,620,641,3136,7350,1478,3155,2820,9109,6261,1122,4470,14,8493,2095],
+  [1046,4301,6082,474,4974,7822,2102,5161,5172,6946,8074,9716,6586,9962,9749,5015,2217,995,5388,4402,7652,6399,6539,1349,8101,3677,1328,9612,7922,2879,231,5887,2655,508,4357,4964,3554,5930,6236,7384,4614,280,3093,9600,2110,7863,2631,6626,6620,68,1311,7198,7561,1768,5139,1431,221,230,2940,968,5283,6517,2146,1646,869,9402,7068,8645,7058,1765,9690,4152,2926,9504,2939,7504,6074,2944,6470,7859],
+  [4659,736,4951,9344,1927,6271,8837,8711,3241,6579,7660,5499,5616,3743,5801,4682,9748,8796,779,1833,4549,8138,4026,775,4170,2432,4174,3741,7540,8017,2833,4027,396,811,2871,1150,9809,2719,9199,8504,1224,540,2051,3519,7982,7367,2761,308,3358,6505,2050,4836,5090,7864,805,2566,2409,6876,3361,8622,5572,5895,3280,441,7893,8105,1634,2929,274,3926,7786,6123,8233,9921,2674,5340,1445,203,4585,3837],
+  [5759,338,7444,7968,7742,3755,1591,4839,1705,650,7061,2461,9230,9391,9373,2413,1213,431,7801,4994,2380,2703,6161,6878,8331,2538,6093,1275,5065,5062,2839,582,1014,8109,3525,1544,1569,8622,7944,2905,6120,1564,1839,5570,7579,1318,2677,5257,4418,5601,7935,7656,5192,1864,5886,6083,5580,6202,8869,1636,7907,4759,9082,5854,3185,7631,6854,5872,5632,5280,1431,2077,9717,7431,4256,8261,9680,4487,4752,4286],
+  [1571,1428,8599,1230,7772,4221,8523,9049,4042,8726,7567,6736,9033,2104,4879,4967,6334,6716,3994,1269,8995,6539,3610,7667,6560,6065,874,848,4597,1711,7161,4811,6734,5723,6356,6026,9183,2586,5636,1092,7779,7923,8747,6887,7505,9909,1792,3233,4526,3176,1508,8043,720,5212,6046,4988,709,5277,8256,3642,1391,5803,1468,2145,3970,6301,7767,2359,8487,9771,8785,7520,856,1605,8972,2402,2386,991,1383,5963],
+  [1822,4824,5957,6511,9868,4113,301,9353,6228,2881,2966,6956,9124,9574,9233,1601,7340,973,9396,540,4747,8590,9535,3650,7333,7583,4806,3593,2738,8157,5215,8472,2284,9473,3906,6982,5505,6053,7936,6074,7179,6688,1564,1103,6860,5839,2022,8490,910,7551,7805,881,7024,1855,9448,4790,1274,3672,2810,774,7623,4223,4850,6071,9975,4935,1915,9771,6690,3846,517,463,7624,4511,614,6394,3661,7409,1395,8127],
+  [8738,3850,9555,3695,4383,2378,87,6256,6740,7682,9546,4255,6105,2000,1851,4073,8957,9022,6547,5189,2487,303,9602,7833,1628,4163,6678,3144,8589,7096,8913,5823,4890,7679,1212,9294,5884,2972,3012,3359,7794,7428,1579,4350,7246,4301,7779,7790,3294,9547,4367,3549,1958,8237,6758,3497,3250,3456,6318,1663,708,7714,6143,6890,3428,6853,9334,7992,591,6449,9786,1412,8500,722,5468,1371,108,3939,4199,2535],
+  [7047,4323,1934,5163,4166,461,3544,2767,6554,203,6098,2265,9078,2075,4644,6641,8412,9183,487,101,7566,5622,1975,5726,2920,5374,7779,5631,3753,3725,2672,3621,4280,1162,5812,345,8173,9785,1525,955,5603,2215,2580,5261,2765,2990,5979,389,3907,2484,1232,5933,5871,3304,1138,1616,5114,9199,5072,7442,7245,6472,4760,6359,9053,7876,2564,9404,3043,9026,2261,3374,4460,7306,2326,966,828,3274,1712,3446],
+  [3975,4565,8131,5800,4570,2306,8838,4392,9147,11,3911,7118,9645,4994,2028,6062,5431,2279,8752,2658,7836,994,7316,5336,7185,3289,1898,9689,2331,5737,3403,1124,2679,3241,7748,16,2724,5441,6640,9368,9081,5618,858,4969,17,2103,6035,8043,7475,2181,939,415,1617,8500,8253,2155,7843,7974,7859,1746,6336,3193,2617,8736,4079,6324,6645,8891,9396,5522,6103,1857,8979,3835,2475,1310,7422,610,8345,7615],
+  [9248,5397,5686,2988,3446,4359,6634,9141,497,9176,6773,7448,1907,8454,916,1596,2241,1626,1384,2741,3649,5362,8791,7170,2903,2475,5325,6451,924,3328,522,90,4813,9737,9557,691,2388,1383,4021,1609,9206,4707,5200,7107,8104,4333,9860,5013,1224,6959,8527,1877,4545,7772,6268,621,4915,9349,5970,706,9583,3071,4127,780,8231,3017,9114,3836,7503,2383,1977,4870,8035,2379,9704,1037,3992,3642,1016,4303],
+  [5093,138,4639,6609,1146,5565,95,7521,9077,2272,974,4388,2465,2650,722,4998,3567,3047,921,2736,7855,173,2065,4238,1048,5,6847,9548,8632,9194,5942,4777,7910,8971,6279,7253,2516,1555,1833,3184,9453,9053,6897,7808,8629,4877,1871,8055,4881,7639,1537,7701,2508,7564,5845,5023,2304,5396,3193,2955,1088,3801,6203,1748,3737,1276,13,4120,7715,8552,3047,2921,106,7508,304,1280,7140,2567,9135,5266],
+  [6237,4607,7527,9047,522,7371,4883,2540,5867,6366,5301,1570,421,276,3361,527,6637,4861,2401,7522,5808,9371,5298,2045,5096,5447,7755,5115,7060,8529,4078,1943,1697,1764,5453,7085,960,2405,739,2100,5800,728,9737,5704,5693,1431,8979,6428,673,7540,6,7773,5857,6823,150,5869,8486,684,5816,9626,7451,5579,8260,3397,5322,6920,1879,2127,2884,5478,4977,9016,6165,6292,3062,5671,5968,78,4619,4763],
+  [9905,7127,9390,5185,6923,3721,9164,9705,4341,1031,1046,5127,7376,6528,3248,4941,1178,7889,3364,4486,5358,9402,9158,8600,1025,874,1839,1783,309,9030,1843,845,8398,1433,7118,70,8071,2877,3904,8866,6722,4299,10,1929,5897,4188,600,1889,3325,2485,6473,4474,7444,6992,4846,6166,4441,2283,2629,4352,7775,1101,2214,9985,215,8270,9750,2740,8361,7103,5930,8664,9690,8302,9267,344,2077,1372,1880,9550],
+  [5825,8517,7769,2405,8204,1060,3603,7025,478,8334,1997,3692,7433,9101,7294,7498,9415,5452,3850,3508,6857,9213,6807,4412,7310,854,5384,686,4978,892,8651,3241,2743,3801,3813,8588,6701,4416,6990,6490,3197,6838,6503,114,8343,5844,8646,8694,65,791,5979,2687,2621,2019,8097,1423,3644,9764,4921,3266,3662,5561,2476,8271,8138,6147,1168,3340,1998,9874,6572,9873,6659,5609,2711,3931,9567,4143,7833,8887],
+  [6223,2099,2700,589,4716,8333,1362,5007,2753,2848,4441,8397,7192,8191,4916,9955,6076,3370,6396,6971,3156,248,3911,2488,4930,2458,7183,5455,170,6809,6417,3390,1956,7188,577,7526,2203,968,8164,479,8699,7915,507,6393,4632,1597,7534,3604,618,3280,6061,9793,9238,8347,568,9645,2070,5198,6482,5000,9212,6655,5961,7513,1323,3872,6170,3812,4146,2736,67,3151,5548,2781,9679,7564,5043,8587,1893,4531],
+  [5826,3690,6724,2121,9308,6986,8106,6659,2142,1642,7170,2877,5757,6494,8026,6571,8387,9961,6043,9758,9607,6450,8631,8334,7359,5256,8523,2225,7487,1977,9555,8048,5763,2414,4948,4265,2427,8978,8088,8841,9208,9601,5810,9398,8866,9138,4176,5875,7212,3272,6759,5678,7649,4922,5422,1343,8197,3154,3600,687,1028,4579,2084,9467,4492,7262,7296,6538,7657,7134,2077,1505,7332,6890,8964,4879,7603,7400,5973,739],
+  [1861,1613,4879,1884,7334,966,2000,7489,2123,4287,1472,3263,4726,9203,1040,4103,6075,6049,330,9253,4062,4268,1635,9960,577,1320,3195,9628,1030,4092,4979,6474,6393,2799,6967,8687,7724,7392,9927,2085,3200,6466,8702,265,7646,8665,7986,7266,4574,6587,612,2724,704,3191,8323,9523,3002,704,5064,3960,8209,2027,2758,8393,4875,4641,9584,6401,7883,7014,768,443,5490,7506,1852,2005,8850,5776,4487,4269],
+  [4052,6687,4705,7260,6645,6715,3706,5504,8672,2853,1136,8187,8203,4016,871,1809,1366,4952,9294,5339,6872,2645,6083,7874,3056,5218,7485,8796,7401,3348,2103,426,8572,4163,9171,3176,948,7654,9344,3217,1650,5580,7971,2622,76,2874,880,2034,9929,1546,2659,5811,3754,7096,7436,9694,9960,7415,2164,953,2360,4194,2397,1047,2196,6827,575,784,2675,8821,6802,7972,5996,6699,2134,7577,2887,1412,4349,4380],
+  [4629,2234,6240,8132,7592,3181,6389,1214,266,1910,2451,8784,2790,1127,6932,1447,8986,2492,5476,397,889,3027,7641,5083,5776,4022,185,3364,5701,2442,2840,4160,9525,4828,6602,2614,7447,3711,4505,7745,8034,6514,4907,2605,7753,6958,7270,6936,3006,8968,439,2326,4652,3085,3425,9863,5049,5361,8688,297,7580,8777,7916,6687,8683,7141,306,9569,2384,1500,3346,4601,7329,9040,6097,2727,6314,4501,4974,2829],
+  [8316,4072,2025,6884,3027,1808,5714,7624,7880,8528,4205,8686,7587,3230,1139,7273,6163,6986,3914,9309,1464,9359,4474,7095,2212,7302,2583,9462,7532,6567,1606,4436,8981,5612,6796,4385,5076,2007,6072,3678,8331,1338,3299,8845,4783,8613,4071,1232,6028,2176,3990,2148,3748,103,9453,538,6745,9110,926,3125,473,5970,8728,7072,9062,1404,1317,5139,9862,6496,6062,3338,464,1600,2532,1088,8232,7739,8274,3873],
+  [2341,523,7096,8397,8301,6541,9844,244,4993,2280,7689,4025,4196,5522,7904,6048,2623,9258,2149,9461,6448,8087,7245,1917,8340,7127,8466,5725,6996,3421,5313,512,9164,9837,9794,8369,4185,1488,7210,1524,1016,4620,9435,2478,7765,8035,697,6677,3724,6988,5853,7662,3895,9593,1185,4727,6025,5734,7665,3070,138,8469,6748,6459,561,7935,8646,2378,462,7755,3115,9690,8877,3946,2728,8793,244,6323,8666,4271],
+  [6430,2406,8994,56,1267,3826,9443,7079,7579,5232,6691,3435,6718,5698,4144,7028,592,2627,217,734,6194,8156,9118,58,2640,8069,4127,3285,694,3197,3377,4143,4802,3324,8134,6953,7625,3598,3584,4289,7065,3434,2106,7132,5802,7920,9060,7531,3321,1725,1067,3751,444,5503,6785,7937,6365,4803,198,6266,8177,1470,6390,1606,2904,7555,9834,8667,2033,1723,5167,1666,8546,8152,473,4475,6451,7947,3062,3281],
+  [2810,3042,7759,1741,2275,2609,7676,8640,4117,1958,7500,8048,1757,3954,9270,1971,4796,2912,660,5511,3553,1012,5757,4525,6084,7198,8352,5775,7726,8591,7710,9589,3122,4392,6856,5016,749,2285,3356,7482,9956,7348,2599,8944,495,3462,3578,551,4543,7207,7169,7796,1247,4278,6916,8176,3742,8385,2310,1345,8692,2667,4568,1770,8319,3585,4920,3890,4928,7343,5385,9772,7947,8786,2056,9266,3454,2807,877,2660],
+  [6206,8252,5928,5837,4177,4333,207,7934,5581,9526,8906,1498,8411,2984,5198,5134,2464,8435,8514,8674,3876,599,5327,826,2152,4084,2433,9327,9697,4800,2728,3608,3849,3861,3498,9943,1407,3991,7191,9110,5666,8434,4704,6545,5944,2357,1163,4995,9619,6754,4200,9682,6654,4862,4744,5953,6632,1054,293,9439,8286,2255,696,8709,1533,1844,6441,430,1999,6063,9431,7018,8057,2920,6266,6799,356,3597,4024,6665],
+  [3847,6356,8541,7225,2325,2946,5199,469,5450,7508,2197,9915,8284,7983,6341,3276,3321,16,1321,7608,5015,3362,8491,6968,6818,797,156,2575,706,9516,5344,5457,9210,5051,8099,1617,9951,7663,8253,9683,2670,1261,4710,1068,8753,4799,1228,2621,3275,6188,4699,1791,9518,8701,5932,4275,6011,9877,2933,4182,6059,2930,6687,6682,9771,654,9437,3169,8596,1827,5471,8909,2352,123,4394,3208,8756,5513,6917,2056],
+  [5458,8173,3138,3290,4570,4892,3317,4251,9699,7973,1163,1935,5477,6648,9614,5655,9592,975,9118,2194,7322,8248,8413,3462,8560,1907,7810,6650,7355,2939,4973,6894,3933,3784,3200,2419,9234,4747,2208,2207,1945,2899,1407,6145,8023,3484,5688,7686,2737,3828,3704,9004,5190,9740,8643,8650,5358,4426,1522,1707,3613,9887,6956,2447,2762,833,1449,9489,2573,1080,4167,3456,6809,2466,227,7125,2759,6250,6472,8089],
+  [3266,7025,9756,3914,1265,9116,7723,9788,6805,5493,2092,8688,6592,9173,4431,4028,6007,7131,4446,4815,3648,6701,759,3312,8355,4485,4187,5188,8746,7759,3528,2177,5243,8379,3838,7233,4607,9187,7216,2190,6967,2920,6082,7910,5354,3609,8958,6949,7731,494,8753,8707,1523,4426,3543,7085,647,6771,9847,646,5049,824,8417,5260,2730,5702,2513,9275,4279,2767,8684,1165,9903,4518,55,9682,8963,6005,2102,6523],
+  [1998,8731,936,1479,5259,7064,4085,91,7745,7136,3773,3810,730,8255,2705,2653,9790,6807,2342,355,9344,2668,3690,2028,9679,8102,574,4318,6481,9175,5423,8062,2867,9657,7553,3442,3920,7430,3945,7639,3714,3392,2525,4995,4850,2867,7951,9667,486,9506,9888,781,8866,1702,3795,90,356,1483,4200,2131,6969,5931,486,6880,4404,1084,5169,4910,6567,8335,4686,5043,2614,3352,2667,4513,6472,7471,5720,1616],
+  [8878,1613,1716,868,1906,2681,564,665,5995,2474,7496,3432,9491,9087,8850,8287,669,823,347,6194,2264,2592,7871,7616,8508,4827,760,2676,4660,4881,7572,3811,9032,939,4384,929,7525,8419,5556,9063,662,8887,7026,8534,3111,1454,2082,7598,5726,6687,9647,7608,73,3014,5063,670,5461,5631,3367,9796,8475,7908,5073,1565,5008,5295,4457,1274,4788,1728,338,600,8415,8535,9351,7750,6887,5845,1741,125],
+  [3637,6489,9634,9464,9055,2413,7824,9517,7532,3577,7050,6186,6980,9365,9782,191,870,2497,8498,2218,2757,5420,6468,586,3320,9230,1034,1393,9886,5072,9391,1178,8464,8042,6869,2075,8275,3601,7715,9470,8786,6475,8373,2159,9237,2066,3264,5000,679,355,3069,4073,494,2308,5512,4334,9438,8786,8637,9774,1169,1949,6594,6072,4270,9158,7916,5752,6794,9391,6301,5842,3285,2141,3898,8027,4310,8821,7079,1307],
+  [8497,6681,4732,7151,7060,5204,9030,7157,833,5014,8723,3207,9796,9286,4913,119,5118,7650,9335,809,3675,2597,5144,3945,5090,8384,187,4102,1260,2445,2792,4422,8389,9290,50,1765,1521,6921,8586,4368,1565,5727,7855,2003,4834,9897,5911,8630,5070,1330,7692,7557,7980,6028,5805,9090,8265,3019,3802,698,9149,5748,1965,9658,4417,5994,5584,8226,2937,272,5743,1278,5698,8736,2595,6475,5342,6596,1149,6920],
+  [8188,8009,9546,6310,8772,2500,9846,6592,6872,3857,1307,8125,7042,1544,6159,2330,643,4604,7899,6848,371,8067,2062,3200,7295,1857,9505,6936,384,2193,2190,301,8535,5503,1462,7380,5114,4824,8833,1763,4974,8711,9262,6698,3999,2645,6937,7747,1128,2933,3556,7943,2885,3122,9105,5447,418,2899,5148,3699,9021,9501,597,4084,175,1621,1,1079,6067,5812,4326,9914,6633,5394,4233,6728,9084,1864,5863,1225],
+  [9935,8793,9117,1825,9542,8246,8437,3331,9128,9675,6086,7075,319,1334,7932,3583,7167,4178,1726,7720,695,8277,7887,6359,5912,1719,2780,8529,1359,2013,4498,8072,1129,9998,1147,8804,9405,6255,1619,2165,7491,1,8882,7378,3337,503,5758,4109,3577,985,3200,7615,8058,5032,1080,6410,6873,5496,1466,2412,9885,5904,4406,3605,8770,4361,6205,9193,1537,9959,214,7260,9566,1685,100,4920,7138,9819,5637,976],
+  [3466,9854,985,1078,7222,8888,5466,5379,3578,4540,6853,8690,3728,6351,7147,3134,6921,9692,857,3307,4998,2172,5783,3931,9417,2541,6299,13,787,2099,9131,9494,896,8600,1643,8419,7248,2660,2609,8579,91,6663,5506,7675,1947,6165,4286,1972,9645,3805,1663,1456,8853,5705,9889,7489,1107,383,4044,2969,3343,152,7805,4980,9929,5033,1737,9953,7197,9158,4071,1324,473,9676,3984,9680,3606,8160,7384,5432],
+  [1005,4512,5186,3953,2164,3372,4097,3247,8697,3022,9896,4101,3871,6791,3219,2742,4630,6967,7829,5991,6134,1197,1414,8923,8787,1394,8852,5019,7768,5147,8004,8825,5062,9625,7988,1110,3992,7984,9966,6516,6251,8270,421,3723,1432,4830,6935,8095,9059,2214,6483,6846,3120,1587,6201,6691,9096,9627,6671,4002,3495,9939,7708,7465,5879,6959,6634,3241,3401,2355,9061,2611,7830,3941,2177,2146,5089,7079,519,6351],
+  [7280,8586,4261,2831,7217,3141,9994,9940,5462,2189,4005,6942,9848,5350,8060,6665,7519,4324,7684,657,9453,9296,2944,6843,7499,7847,1728,9681,3906,6353,5529,2822,3355,3897,7724,4257,7489,8672,4356,3983,1948,6892,7415,4153,5893,4190,621,1736,4045,9532,7701,3671,1211,1622,3176,4524,9317,7800,5638,6644,6943,5463,3531,2821,1347,5958,3436,1438,2999,994,850,4131,2616,1549,3465,5946,690,9273,6954,7991],
+  [9517,399,3249,2596,7736,2142,1322,968,7350,1614,468,3346,3265,7222,6086,1661,5317,2582,7959,4685,2807,2917,1037,5698,1529,3972,8716,2634,3301,3412,8621,743,8001,4734,888,7744,8092,3671,8941,1487,5658,7099,2781,99,1932,4443,4756,4652,9328,1581,7855,4312,5976,7255,6480,3996,2748,1973,9731,4530,2790,9417,7186,5303,3557,351,7182,9428,1342,9020,7599,1392,8304,2070,9138,7215,2008,9937,1106,7110],
+  [7444,769,9688,632,1571,6820,8743,4338,337,3366,3073,1946,8219,104,4210,6986,249,5061,8693,7960,6546,1004,8857,5997,9352,4338,6105,5008,2556,6518,6694,4345,3727,7956,20,3954,8652,4424,9387,2035,8358,5962,5304,5194,8650,8282,1256,1103,2138,6679,1985,3653,2770,2433,4278,615,2863,1715,242,3790,2636,6998,3088,1671,2239,957,5411,4595,6282,2881,9974,2401,875,7574,2987,4587,3147,6766,9885,2965],
+  [3287,3016,3619,6818,9073,6120,5423,557,2900,2015,8111,3873,1314,4189,1846,4399,7041,7583,2427,2864,3525,5002,2069,748,1948,6015,2684,438,770,8367,1663,7887,7759,1885,157,7770,4520,4878,3857,1137,3525,3050,6276,5569,7649,904,4533,7843,2199,5648,7628,9075,9441,3600,7231,2388,5640,9096,958,3058,584,5899,8150,1181,9616,1098,8162,6819,8171,1519,1140,7665,8801,2632,1299,9192,707,9955,2710,7314],
+  [1772,2963,7578,3541,3095,1488,7026,2634,6015,4633,4370,2762,1650,2174,909,8158,2922,8467,4198,4280,9092,8856,8835,5457,2790,8574,9742,5054,9547,4156,7940,8126,9824,7340,8840,6574,3547,1477,3014,6798,7134,435,9484,9859,3031,4,1502,4133,1738,1807,4825,463,6343,9701,8506,9822,9555,8688,8168,3467,3234,6318,1787,5591,419,6593,7974,8486,9861,6381,6758,194,3061,4315,2863,4665,3789,2201,1492,4416],
+  [126,8927,6608,5682,8986,6867,1715,6076,3159,788,3140,4744,830,9253,5812,5021,7616,8534,1546,9590,1101,9012,9821,8132,7857,4086,1069,7491,2988,1579,2442,4321,2149,7642,6108,250,6086,3167,24,9528,7663,2685,1220,9196,1397,5776,1577,1730,5481,977,6115,199,6326,2183,3767,5928,5586,7561,663,8649,9688,949,5913,9160,1870,5764,9887,4477,6703,1413,4995,5494,7131,2192,8969,7138,3997,8697,646,1028],
+  [8074,1731,8245,624,4601,8706,155,8891,309,2552,8208,8452,2954,3124,3469,4246,3352,1105,4509,8677,9901,4416,8191,9283,5625,7120,2952,8881,7693,830,4580,8228,9459,8611,4499,1179,4988,1394,550,2336,6089,6872,269,7213,1848,917,6672,4890,656,1478,6536,3165,4743,4990,1176,6211,7207,5284,9730,4738,1549,4986,4942,8645,3698,9429,1439,2175,6549,3058,6513,1574,6988,8333,3406,5245,5431,7140,7085,6407],
+  [7845,4694,2530,8249,290,5948,5509,1588,5940,4495,5866,5021,4626,3979,3296,7589,4854,1998,5627,3926,8346,6512,9608,1918,7070,4747,4182,2858,2766,4606,6269,4107,8982,8568,9053,4244,5604,102,2756,727,5887,2566,7922,44,5986,621,1202,374,6988,4130,3627,6744,9443,4568,1398,8679,397,3928,9159,367,2917,6127,5788,3304,8129,911,2669,1463,9749,264,4478,8940,1109,7309,2462,117,4692,7724,225,2312],
+  [4164,3637,2000,941,8903,39,3443,7172,1031,3687,4901,8082,4945,4515,7204,9310,9349,9535,9940,218,1788,9245,2237,1541,5670,6538,6047,5553,9807,8101,1925,8714,445,8332,7309,6830,5786,5736,7306,2710,3034,1838,7969,6318,7912,2584,2080,7437,6705,2254,7428,820,782,9861,7596,3842,3631,8063,5240,6666,394,4565,7865,4895,9890,6028,6117,4724,9156,4473,4552,602,470,6191,4927,5387,884,3146,1978,3000],
+  [4258,6880,1696,3582,5793,4923,2119,1155,9056,9698,6603,3768,5514,9927,9609,6166,6566,4536,4985,4934,8076,9062,6741,6163,7399,4562,2337,5600,2919,9012,8459,1308,6072,1225,9306,8818,5886,7243,7365,8792,6007,9256,6699,7171,4230,7002,8720,7839,4533,1671,478,7774,1607,2317,5437,4705,7886,4760,6760,7271,3081,2997,3088,7675,6208,3101,6821,6840,122,9633,4900,2067,8546,4549,2091,7188,5605,8599,6758,5229],
+  [7854,5243,9155,3556,8812,7047,2202,1541,5993,4600,4760,713,434,7911,7426,7414,8729,322,803,7960,7563,4908,6285,6291,736,3389,9339,4132,8701,7534,5287,3646,592,3065,7582,2592,8755,6068,8597,1982,5782,1894,2900,6236,4039,6569,3037,5837,7698,700,7815,2491,7272,5878,3083,6778,6639,3589,5010,8313,2581,6617,5869,8402,6808,2951,2321,5195,497,2190,6187,1342,1316,4453,7740,4154,2959,1781,1482,8256],
+  [7178,2046,4419,744,8312,5356,6855,8839,319,2962,5662,47,6307,8662,68,4813,567,2712,9931,1678,3101,8227,6533,4933,6656,92,5846,4780,6256,6361,4323,9985,1231,2175,7178,3034,9744,6155,9165,7787,5836,9318,7860,9644,8941,6480,9443,8188,5928,161,6979,2352,5628,6991,1198,8067,5867,6620,3778,8426,2994,3122,3124,6335,3918,8897,2655,9670,634,1088,1576,8935,7255,474,8166,7417,9547,2886,5560,3842],
+  [6957,3111,26,7530,7143,1295,1744,6057,3009,1854,8098,5405,2234,4874,9447,2620,9303,27,7410,969,40,2966,5648,7596,8637,4238,3143,3679,7187,690,9980,7085,7714,9373,5632,7526,6707,3951,9734,4216,2146,3602,5371,6029,3039,4433,4855,4151,1449,3376,8009,7240,7027,4602,2947,9081,4045,8424,9352,8742,923,2705,4266,3232,2264,6761,363,2651,3383,7770,6730,7856,7340,9679,2158,610,4471,4608,910,6241],
+  [4417,6756,1013,8797,658,8809,5032,8703,7541,846,3357,2920,9817,1745,9980,7593,4667,3087,779,3218,6233,5568,4296,2289,2654,7898,5021,9461,5593,8214,9173,4203,2271,7980,2983,5952,9992,8399,3468,1776,3188,9314,1720,6523,2933,621,8685,5483,8986,6163,3444,9539,4320,155,3992,2828,2150,6071,524,2895,5468,8063,1210,3348,9071,4862,483,9017,4097,6186,9815,3610,5048,1644,1003,9865,9332,2145,1944,2213],
+  [9284,3803,4920,1927,6706,4344,7383,4786,9890,2010,5228,1224,3158,6967,8580,8990,8883,5213,76,8306,2031,4980,5639,9519,7184,5645,7769,3259,8077,9130,1317,3096,9624,3818,1770,695,2454,947,6029,3474,9938,3527,5696,4760,7724,7738,2848,6442,5767,6845,8323,4131,2859,7595,2500,4815,3660,9130,8580,7016,8231,4391,8369,3444,4069,4021,556,6154,627,2778,1496,4206,6356,8434,8491,3816,8231,3190,5575,1015],
+  [3787,7572,1788,6803,5641,6844,1961,4811,8535,9914,9999,1450,8857,738,4662,8569,6679,2225,7839,8618,286,2648,5342,2294,3205,4546,176,8705,3741,6134,8324,8021,7004,5205,7032,6637,9442,5539,5584,4819,5874,5807,8589,6871,9016,983,1758,3786,1519,6241,185,8398,495,3370,9133,3051,4549,9674,7311,9738,3316,9383,2658,2776,9481,7558,619,3943,3324,6491,4933,153,9738,4623,912,3595,7771,7939,1219,4405],
+  [2650,3883,4154,5809,315,7756,4430,1788,4451,1631,6461,7230,6017,5751,138,588,5282,2442,9110,9035,6349,2515,1570,6122,4192,4174,3530,1933,4186,4420,4609,5739,4135,2963,6308,1161,8809,8619,2796,3819,6971,8228,4188,1492,909,8048,2328,6772,8467,7671,9068,2226,7579,6422,7056,8042,3296,2272,3006,2196,7320,3238,3490,3102,37,1293,3212,4767,5041,8773,5794,4456,6174,7279,7054,2835,7053,9088,790,6640],
+  [3101,1057,7057,3826,6077,1025,2955,1224,1114,6729,5902,4698,6239,7203,9423,1804,4417,6686,1426,6941,8071,1029,4985,9010,6122,6597,1622,1574,3513,1684,7086,5505,3244,411,9638,4150,907,9135,829,981,1707,5359,8781,9751,5,9131,3973,7159,1340,6955,7514,7993,6964,8198,1933,2797,877,3993,4453,8020,9349,8646,2779,8679,2961,3547,3374,3510,1129,3568,2241,2625,9138,5974,8206,7669,7678,1833,8700,4480],
+  [4865,9912,8038,8238,782,3095,8199,1127,4501,7280,2112,2487,3626,2790,9432,1475,6312,8277,4827,2218,5806,7132,8752,1468,7471,6386,739,8762,8323,8120,5169,9078,9058,3370,9560,7987,8585,8531,5347,9312,1058,4271,1159,5286,5404,6925,8606,9204,7361,2415,560,586,4002,2644,1927,2824,768,4409,2942,3345,1002,808,4941,6267,7979,5140,8643,7553,9438,7320,4938,2666,4609,2778,8158,6730,3748,3867,1866,7181],
+  [171,3771,7134,8927,4778,2913,3326,2004,3089,7853,1378,1729,4777,2706,9578,1360,5693,3036,1851,7248,2403,2273,8536,6501,9216,613,9671,7131,7719,6425,773,717,8803,160,1114,7554,7197,753,4513,4322,8499,4533,2609,4226,8710,6627,644,9666,6260,4870,5744,7385,6542,6203,7703,6130,8944,5589,2262,6803,6381,7414,6888,5123,7320,9392,9061,6780,322,8975,7050,5089,1061,2260,3199,1150,1865,5386,9699,6501],
+  [3744,8454,6885,8277,919,1923,4001,6864,7854,5519,2491,6057,8794,9645,1776,5714,9786,9281,7538,6916,3215,395,2501,9618,4835,8846,9708,2813,3303,1794,8309,7176,2206,1602,1838,236,4593,2245,8993,4017,10,8215,6921,5206,4023,5932,6997,7801,262,7640,3107,8275,4938,7822,2425,3223,3886,2105,8700,9526,2088,8662,8034,7004,5710,2124,7164,3574,6630,9980,4242,2901,9471,1491,2117,4562,1130,9086,4117,6698],
+  [2810,2280,2331,1170,4554,4071,8387,1215,2274,9848,6738,1604,7281,8805,439,1298,8318,7834,9426,8603,6092,7944,1309,8828,303,3157,4638,4439,9175,1921,4695,7716,1494,1015,1772,5913,1127,1952,1950,8905,4064,9890,385,9357,7945,5035,7082,5369,4093,6546,5187,5637,2041,8946,1758,7111,6566,1027,1049,5148,7224,7248,296,6169,375,1656,7993,2816,3717,4279,4675,1609,3317,42,6201,3100,3144,163,9530,4531],
+  [7096,6070,1009,4988,3538,5801,7149,3063,2324,2912,7911,7002,4338,7880,2481,7368,3516,2016,7556,2193,1388,3865,8125,4637,4096,8114,750,3144,1938,7002,9343,4095,1392,4220,3455,6969,9647,1321,9048,1996,1640,6626,1788,314,9578,6630,2813,6626,4981,9908,7024,4355,3201,3521,3864,3303,464,1923,595,9801,3391,8366,8084,9374,1041,8807,9085,1892,9431,8317,9016,9221,8574,9981,9240,5395,2009,6310,2854,9255],
+  [8830,3145,2960,9615,8220,6061,3452,2918,6481,9278,2297,3385,6565,7066,7316,5682,107,7646,4466,68,1952,9603,8615,54,7191,791,6833,2560,693,9733,4168,570,9127,9537,1925,8287,5508,4297,8452,8795,6213,7994,2420,4208,524,5915,8602,8330,2651,8547,6156,1812,6271,7991,9407,9804,1553,6866,1128,2119,4691,9711,8315,5879,9935,6900,482,682,4126,1041,428,6247,3720,5882,7526,2582,4327,7725,3503,2631],
+  [2738,9323,721,7434,1453,6294,2957,3786,5722,6019,8685,4386,3066,9057,6860,499,5315,3045,5194,7111,3137,9104,941,586,3066,755,4177,8819,7040,5309,3583,3897,4428,7788,4721,7249,6559,7324,825,7311,3760,6064,6070,9672,4882,584,1365,9739,9331,5783,2624,7889,1604,1303,1555,7125,8312,425,8936,3233,7724,1480,403,7440,1784,1754,4721,1569,652,3893,4574,5692,9730,4813,9844,8291,9199,7101,3391,8914],
+  [6044,2928,9332,3328,8588,447,3830,1176,3523,2705,8365,6136,5442,9049,5526,8575,8869,9031,7280,706,2794,8814,5767,4241,7696,78,6570,556,5083,1426,4502,3336,9518,2292,1885,3740,3153,9348,9331,8051,2759,5407,9028,7840,9255,831,515,2612,9747,7435,8964,4971,2048,4900,5967,8271,1719,9670,2810,6777,1594,6367,6259,8316,3815,1689,6840,9437,4361,822,9619,3065,83,6344,7486,8657,8228,9635,6932,4864],
+  [8478,4777,6334,4678,7476,4963,6735,3096,5860,1405,5127,7269,7793,4738,227,9168,2996,8928,765,733,1276,7677,6258,1528,9558,3329,302,8901,1422,8277,6340,645,9125,8869,5952,141,8141,1816,9635,4025,4184,3093,83,2344,2747,9352,7966,1206,1126,1826,218,7939,2957,2729,810,8752,5247,4174,4038,8884,7899,9567,301,5265,5752,7524,4381,1669,3106,8270,6228,6373,754,2547,4240,2313,5514,3022,1040,9738],
+  [2265,8192,1763,1369,8469,8789,4836,52,1212,6690,5257,8918,6723,6319,378,4039,2421,8555,8184,9577,1432,7139,8078,5452,9628,7579,4161,7490,5159,8559,1011,81,478,5840,1964,1334,6875,8670,9900,739,1514,8692,522,9316,6955,1345,8132,2277,3193,9773,3923,4177,2183,1236,6747,6575,4874,6003,6409,8187,745,8776,9440,7543,9825,2582,7381,8147,7236,5185,7564,6125,218,7991,6394,391,7659,7456,5128,5294],
+  [2132,8992,8160,5782,4420,3371,3798,5054,552,5631,7546,4716,1332,6486,7892,7441,4370,6231,4579,2121,8615,1145,9391,1524,1385,2400,9437,2454,7896,7467,2928,8400,3299,4025,7458,4703,7206,6358,792,6200,725,4275,4136,7390,5984,4502,7929,5085,8176,4600,119,3568,76,9363,6943,2248,9077,9731,6213,5817,6729,4190,3092,6910,759,2682,8380,1254,9604,3011,9291,5329,9453,9746,2739,6522,3765,5634,1113,5789],
+  [5304,5499,564,2801,679,2653,1783,3608,7359,7797,3284,796,3222,437,7185,6135,8571,2778,7488,5746,678,6140,861,7750,803,9859,9918,2425,3734,2698,9005,4864,9818,6743,2475,132,9486,3825,5472,919,292,4411,7213,7699,6435,9019,6769,1388,802,2124,1345,8493,9487,8558,7061,8777,8833,2427,2238,5409,4957,8503,3171,7622,5779,6145,2417,5873,5563,5693,9574,9491,1937,7384,4563,6842,5432,2751,3406,7981]
+];
+```
+
+## --seed-contents--
+
+```js
+function pathSumFourWays(matrix) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testMatrix1 = [
+  [131, 673, 234, 103, 18],
+  [201, 96, 342, 965, 150],
+  [630, 803, 746, 422, 111],
+  [537, 699, 497, 121, 956],
+  [805, 732, 524, 37, 331]
+];
+
+pathSumFourWays(testMatrix1);
+```
+
+# --solutions--
+
+```js
+function pathSumFourWays(matrix) {
+  const MOVES = [
+    [-1, 0],
+    [1, 0],
+    [0, -1],
+    [0, 1]
+  ];
+
+  function getAllowedMoves(row, col) {
+    const moves = [];
+    for (let i = 0; i < MOVES.length; i++) {
+      const [rowChange, colChange] = MOVES[i];
+      const nextRow = row + rowChange;
+      const nextCol = col + colChange;
+      if (isMoveAllowed(nextRow, nextCol)) {
+        moves.push([nextRow, nextCol]);
+      }
+    }
+    return moves;
+  }
+
+  function isMoveAllowed(nextRow, nextCol) {
+    if (nextRow < 0 || nextRow >= size || nextCol < 0 || nextCol >= size) {
+      return false;
+    }
+    return true;
+  }
+
+  const size = matrix.length;
+  const resultMatrix = new Array(size)
+    .fill()
+    .map(() => new Array(size).fill(Infinity));
+
+  const [startRow, startCol] = new Array(2).fill(size - 1);
+  const queue = [[startRow, startCol]];
+  resultMatrix[startRow][startCol] = matrix[startRow][startCol];
+
+  while (queue.length > 0) {
+    const [curRow, curCol] = queue.shift();
+
+    const allowedMoves = getAllowedMoves(curRow, curCol);
+
+    for (let i = 0; i < allowedMoves.length; i++) {
+      const [nextRow, nextCol] = allowedMoves[i];
+      const bestPath = resultMatrix[nextRow][nextCol];
+      const newPath = resultMatrix[curRow][curCol] + matrix[nextRow][nextCol];
+      if (newPath < bestPath) {
+        resultMatrix[nextRow][nextCol] = newPath;
+        queue.push(allowedMoves[i]);
+      }
+    }
+  }
+  return resultMatrix[0][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
new file mode 100644
index 0000000000..6870d2e420
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-84-monopoly-odds.md
@@ -0,0 +1,268 @@
+---
+id: 5900f3c11000cf542c50fed3
+title: 'Problem 84: Monopoly odds'
+challengeType: 5
+forumTopicId: 302198
+dashedName: problem-84-monopoly-odds
+---
+
+# --description--
+
+In the game, *Monopoly*, the standard board is set up in the following way:
+
+<div style="text-align: center;">
+  <table cellspacing="1" cellpadding="5" border="0" style="background-color: black; color: black;" align="center">
+    <tbody>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">GO</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">A1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">A2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">T1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">B3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">JAIL</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">H2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">T2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">U1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">H1</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">C3</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R4</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D1</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC3</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CC2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G2</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D2</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G1</td>
+        <td colspan="9">&nbsp;</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">D3</td>
+      </tr>
+      <tr>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">G2J</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">U2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">F1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">R3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E3</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">CH2</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">E1</td>
+        <td style="background-color: #ffffff; color: black; padding: 5px; border: 1px solid black;">FP</td>
+      </tr>
+    </tbody>
+  </table>
+</div><br>
+
+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.
+
+<ul>
+  <li>Community Chest (2/16 cards):</li>
+  <ol>
+    <li>Advance to GO</li>
+    <li>Go to JAIL</li>
+  </ol>
+
+  <li>Chance (10/16 cards):</li>
+  <ol>
+    <li>Advance to GO</li>
+    <li>Go to JAIL</li>
+    <li>Go to C1</li>
+    <li>Go to E3</li>
+    <li>Go to H2</li>
+    <li>Go to R1</li>
+    <li>Go to next R (railway company)</li>
+    <li>Go to next R</li>
+    <li>Go to next U (utility company)</li>
+    <li>Go back 3 squares.</li>
+  </ol>
+</ul>
+
+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 `n`-sided dice are used, find the six-digit modal string.
+
+# --hints--
+
+`monopolyOdds(8)` should return a string.
+
+```js
+assert(typeof monopolyOdds(8) === 'string');
+```
+
+`monopolyOdds(8)` should return string `102400`.
+
+```js
+assert.strictEqual(monopolyOdds(8), '102400');
+```
+
+`monopolyOdds(10)` should return string `100024`.
+
+```js
+assert.strictEqual(monopolyOdds(10), '100024');
+```
+
+`monopolyOdds(20)` should return string `100005`.
+
+```js
+assert.strictEqual(monopolyOdds(20), '100005');
+```
+
+`monopolyOdds(4)` should return string `101524`.
+
+```js
+assert.strictEqual(monopolyOdds(4), '101524');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function monopolyOdds(n) {
+
+  return true;
+}
+
+monopolyOdds(8);
+```
+
+# --solutions--
+
+```js
+function monopolyOdds(n) {
+  function chanceCard(position, chanceCardPosition) {
+    chanceCardPosition = (chanceCardPosition + 1) % 16;
+    if (chanceCardPosition < 6) {
+      position = chanceCardsMoves[chanceCardPosition];
+    } else if (chanceCardPosition === 6 || chanceCardPosition === 7) {
+      position = nextMovesFromR[position];
+    } else if (chanceCardPosition === 8) {
+      position = nextMovesFromU[position];
+    } else if (chanceCardPosition === 9) {
+      position -= 3;
+    }
+    return [position, chanceCardPosition];
+  }
+
+  function chestCard(position, chestPosition) {
+    chestPosition = (chestPosition + 1) % 16;
+    if (chestPosition < 2) {
+      position = chestCardsMoves[chestPosition];
+    }
+    return [position, chestPosition];
+  }
+
+  function isChest(position) {
+    return position === 2 || position === 17 || position === 33;
+  }
+
+  function isChance(position) {
+    return position === 7 || position === 22 || position === 36;
+  }
+
+  function isJail(position) {
+    return position === 30;
+  }
+
+  function roll(dice) {
+    return Math.floor(Math.random() * dice) + 1;
+  }
+
+  function getTopThree(board) {
+    return sortByVisits(board)
+      .slice(0, 3)
+      .map(elem => elem[0].toString().padStart(2, '0'))
+      .join('');
+  }
+
+  function sortByVisits(board) {
+    return board
+      .map((element, index) => [index, element])
+      .sort((a, b) => a[1] - b[1])
+      .reverse();
+  }
+
+  const rounds = 2000000;
+  const chestCardsMoves = [0, 10];
+  const chanceCardsMoves = [0, 10, 11, 24, 39, 5];
+  const nextMovesFromR = { 7: 15, 22: 25, 36: 5 };
+  const nextMovesFromU = { 7: 12, 36: 12, 22: 28 };
+
+  const board = new Array(40).fill(0);
+  let doubleCount = 0;
+  let curPosition = 0;
+  let curChestCard = 0;
+  let curChanceCard = 0;
+
+  for (let i = 0; i < rounds; i++) {
+    const dice1 = roll(n);
+    const dice2 = roll(n);
+
+    if (dice1 === dice2) {
+      doubleCount++;
+    } else {
+      doubleCount = 0;
+    }
+
+    if (doubleCount > 2) {
+      curPosition = 10;
+      doubleCount = 0;
+    } else {
+      curPosition = (curPosition + dice1 + dice2) % 40;
+
+      if (isChance(curPosition)) {
+        [curPosition, curChanceCard] = chanceCard(curPosition, curChanceCard);
+      } else if (isChest(curPosition)) {
+        [curPosition, curChestCard] = chestCard(curPosition, curChestCard);
+      } else if (isJail(curPosition)) {
+        curPosition = 10;
+      }
+    }
+    board[curPosition]++;
+  }
+  return getTopThree(board);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
new file mode 100644
index 0000000000..5db9e13fec
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-85-counting-rectangles.md
@@ -0,0 +1,109 @@
+---
+id: 5900f3c11000cf542c50fed4
+title: 'Problem 85: Counting rectangles'
+challengeType: 5
+forumTopicId: 302199
+dashedName: problem-85-counting-rectangles
+---
+
+# --description--
+
+By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
+
+<img class="img-responsive center-block" alt="a diagram of the different rectangles found within a 3 by 2 rectangular grid" src="https://cdn-media-1.freecodecamp.org/project-euler/counting-rectangles.png" style="background-color: white; padding: 10px;">
+
+Although there may not exists a rectangular grid that contains exactly `n` rectangles, find the area of the grid with the nearest solution.
+
+# --hints--
+
+`countingRectangles(18)` should return a number.
+
+```js
+assert(typeof countingRectangles(18) === 'number');
+```
+
+`countingRectangles(18)` should return `6`.
+
+```js
+assert.strictEqual(countingRectangles(18), 6);
+```
+
+`countingRectangles(250)` should return `22`.
+
+```js
+assert.strictEqual(countingRectangles(250), 22);
+```
+
+`countingRectangles(50000)` should return `364`.
+
+```js
+assert.strictEqual(countingRectangles(50000), 364);
+```
+
+`countingRectangles(1000000)` should return `1632`.
+
+```js
+assert.strictEqual(countingRectangles(1000000), 1632);
+```
+
+`countingRectangles(2000000)` should return `2772`.
+
+```js
+assert.strictEqual(countingRectangles(2000000), 2772);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countingRectangles(n) {
+
+  return true;
+}
+
+countingRectangles(18);
+```
+
+# --solutions--
+
+```js
+function countingRectangles(n) {
+  function numberOfRectangles(h, w) {
+    return (h * (h + 1) * w * (w + 1)) / 4;
+  }
+
+  function rectangleArea(h, w) {
+    return h * w;
+  }
+
+  let rectanglesCount = 1;
+  let maxSide = 1;
+  while (rectanglesCount < n) {
+    maxSide++;
+    rectanglesCount = numberOfRectangles(maxSide, 1);
+  }
+
+  let bestDiff = Math.abs(rectanglesCount - n);
+  let bestSize = [maxSide, 1];
+
+  let curHeight = maxSide - 1;
+  let curWidth = 1;
+
+  for (curWidth; curWidth < curHeight; curWidth++) {
+    for (curHeight; curHeight > curWidth; curHeight--) {
+      rectanglesCount = numberOfRectangles(curHeight, curWidth);
+      const curDiff = Math.abs(rectanglesCount - n);
+      if (curDiff < bestDiff) {
+        bestDiff = curDiff;
+        bestSize = [curHeight, curWidth];
+      }
+
+      if (rectanglesCount < n) {
+        break;
+      }
+    }
+  }
+  return rectangleArea(...bestSize);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
new file mode 100644
index 0000000000..caa496a114
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-86-cuboid-route.md
@@ -0,0 +1,94 @@
+---
+id: 5900f3c31000cf542c50fed5
+title: 'Problem 86: Cuboid route'
+challengeType: 5
+forumTopicId: 302200
+dashedName: problem-86-cuboid-route
+---
+
+# --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.
+
+<img class="img-responsive center-block" alt="a diagram of a spider and fly's path from one corner of a cuboid room to the opposite corner" src="https://cdn-media-1.freecodecamp.org/project-euler/cuboid-route.png" style="background-color: white; padding: 10px;">
+
+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 `n`.
+
+# --hints--
+
+`cuboidRoute(2000)` should return a number.
+
+```js
+assert(typeof cuboidRoute(2000) === 'number');
+```
+
+`cuboidRoute(2000)` should return `100`.
+
+```js
+assert.strictEqual(cuboidRoute(2000), 100);
+```
+
+`cuboidRoute(25000)` should return `320`.
+
+```js
+assert.strictEqual(cuboidRoute(25000), 320);
+```
+
+`cuboidRoute(500000)` should return `1309`.
+
+```js
+assert.strictEqual(cuboidRoute(500000), 1309);
+```
+
+`cuboidRoute(1000000)` should return `1818`.
+
+```js
+assert.strictEqual(cuboidRoute(1000000), 1818);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cuboidRoute(n) {
+
+  return true;
+}
+
+cuboidRoute(2000);
+```
+
+# --solutions--
+
+```js
+function cuboidRoute(n) {
+  // Based on https://www.mathblog.dk/project-euler-86-shortest-path-cuboid/
+  function getLength(a, b) {
+    return Math.sqrt(a ** 2 + b ** 2);
+  }
+
+  let M = 2;
+  let counter = 0;
+
+  while (counter < n) {
+    M++;
+    for (let baseHeightWidth = 3; baseHeightWidth <= 2 * M; baseHeightWidth++) {
+      const pathLength = getLength(M, baseHeightWidth);
+      if (Number.isInteger(pathLength)) {
+        if (baseHeightWidth <= M) {
+          counter += Math.floor(baseHeightWidth / 2);
+        } else {
+          counter += 1 + M - Math.floor((baseHeightWidth + 1) / 2);
+        }
+      }
+    }
+  }
+
+  return M;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
new file mode 100644
index 0000000000..57da5afe79
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-87-prime-power-triples.md
@@ -0,0 +1,131 @@
+---
+id: 5900f3c51000cf542c50fed8
+title: 'Problem 87: Prime power triples'
+challengeType: 5
+forumTopicId: 302201
+dashedName: problem-87-prime-power-triples
+---
+
+# --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:
+
+<div style='margin-left: 4em;'>
+  28 = 2<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  33 = 3<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  49 = 5<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>
+  47 = 2<sup>2</sup> + 3<sup>3</sup> + 2<sup>4</sup>
+</div><br>
+
+How many numbers below `n` can be expressed as the sum of a prime square, prime cube, and prime fourth power?
+
+# --hints--
+
+`primePowerTriples(50)` should return a number.
+
+```js
+assert(typeof primePowerTriples(50) === 'number');
+```
+
+`primePowerTriples(50)` should return `4`.
+
+```js
+assert.strictEqual(primePowerTriples(50), 4);
+```
+
+`primePowerTriples(10035)` should return `684`.
+
+```js
+assert.strictEqual(primePowerTriples(10035), 684);
+```
+
+`primePowerTriples(500000)` should return `18899`.
+
+```js
+assert.strictEqual(primePowerTriples(500000), 18899);
+```
+
+`primePowerTriples(5000000)` should return `138932`.
+
+```js
+assert.strictEqual(primePowerTriples(5000000), 138932);
+```
+
+`primePowerTriples(50000000)` should return `1097343`.
+
+```js
+assert.strictEqual(primePowerTriples(50000000), 1097343);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primePowerTriples(n) {
+
+  return true;
+}
+
+primePowerTriples(50);
+```
+
+# --solutions--
+
+```js
+function primePowerTriples(n) {
+  function getSievePrimes(max) {
+    const primes = [];
+    const primesMap = new Array(max).fill(true);
+    primesMap[0] = false;
+    primesMap[1] = false;
+
+    for (let i = 2; i <= max; i += 2) {
+      if (primesMap[i]) {
+        primes.push(i);
+        for (let j = i * i; j <= max; j = j + i) {
+          primesMap[j] = false;
+        }
+      }
+      if (i === 2) {
+        i = 1;
+      }
+    }
+    return primes;
+  }
+
+  function getPowersSummed(numbers, powers, limit, curSum) {
+    if (curSum >= limit) {
+      return [];
+    } else if (powers.length === 0) {
+      return [curSum];
+    }
+
+    const powersSummed = [];
+
+    const curPower = powers[0];
+    const powersLeft = powers.slice(1);
+    for (let i = 0; i < numbers.length; i++) {
+      const curNumber = numbers[i];
+      const nextSum = curSum + curNumber ** curPower;
+      if (nextSum >= limit) {
+        return powersSummed;
+      }
+      const result = getPowersSummed(
+        numbers,
+        powersLeft,
+        limit,
+        curSum + curNumber ** curPower
+      );
+      powersSummed.push(...result);
+    }
+    return powersSummed;
+  }
+
+  const maximumBaseNumber = Math.floor(Math.sqrt(n - 2 ** 3 - 2 ** 4)) + 1;
+  const primes = getSievePrimes(maximumBaseNumber);
+  const uniqueSums = new Set(getPowersSummed(primes, [2, 3, 4], n, 0));
+
+  return uniqueSums.size;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
new file mode 100644
index 0000000000..3134d9cacf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-88-product-sum-numbers.md
@@ -0,0 +1,110 @@
+---
+id: 5900f3c51000cf542c50fed6
+title: 'Problem 88: Product-sum numbers'
+challengeType: 5
+forumTopicId: 302203
+dashedName: problem-88-product-sum-numbers
+---
+
+# --description--
+
+A natural number, `N`, that can be written as the sum and product of a given set of at least two natural numbers, $\\{a_1, a_2, \ldots , a_k\\}$ is called a product-sum number: $N = a_1 + a_2 + \cdots + a_k = a_1 × a_2 × \cdots × a_k$.
+
+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.
+
+<div style='margin-left: 4em;'>
+  <var>k</var>=2: 4 = 2 × 2 = 2 + 2<br>
+  <var>k</var>=3: 6 = 1 × 2 × 3 = 1 + 2 + 3<br>
+  <var>k</var>=4: 8 = 1 × 1 × 2 × 4 = 1 + 1 + 2 + 4<br>
+  <var>k</var>=5: 8 = 1 × 1 × 2 × 2 × 2  = 1 + 1 + 2 + 2 + 2<br>
+  <var>k</var>=6: 12 = 1 × 1 × 1 × 1 × 2 × 6 = 1 + 1 + 1 + 1 + 2 + 6
+</div><br>
+
+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` ≤ `limit`?
+
+# --hints--
+
+`productSumNumbers(6)` should return a number.
+
+```js
+assert(typeof productSumNumbers(6) === 'number');
+```
+
+`productSumNumbers(6)` should return `30`.
+
+```js
+assert.strictEqual(productSumNumbers(6), 30);
+```
+
+`productSumNumbers(12)` should return `61`.
+
+```js
+assert.strictEqual(productSumNumbers(12), 61);
+```
+
+`productSumNumbers(300)` should return `12686`.
+
+```js
+assert.strictEqual(productSumNumbers(300), 12686);
+```
+
+`productSumNumbers(6000)` should return `2125990`.
+
+```js
+assert.strictEqual(productSumNumbers(6000), 2125990);
+```
+
+`productSumNumbers(12000)` should return `7587457`.
+
+```js
+assert.strictEqual(productSumNumbers(12000), 7587457);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function productSumNumbers(limit) {
+
+  return true;
+}
+
+productSumNumbers(6);
+```
+
+# --solutions--
+
+```js
+function productSumNumbers(limit) {
+  function getProductSums(curProduct, curSum, factorsCount, start) {
+    const k = curProduct - curSum + factorsCount;
+    if (k <= limit) {
+      if (curProduct < minimalProductSums[k]) {
+        minimalProductSums[k] = curProduct;
+      }
+      for (let i = start; i < Math.floor((limit / curProduct) * 2) + 1; i++) {
+        getProductSums(curProduct * i, curSum + i, factorsCount + 1, i);
+      }
+    }
+  }
+
+  const minimalProductSums = new Array(limit + 1).fill(2 * limit);
+  getProductSums(1, 1, 1, 2);
+
+  const uniqueProductSums = [...new Set(minimalProductSums.slice(2))];
+
+  let sum = 0;
+  for (let i = 0; i < uniqueProductSums.length; i++) {
+    sum += uniqueProductSums[i];
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
new file mode 100644
index 0000000000..3c0e7ac2aa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-89-roman-numerals.md
@@ -0,0 +1,117 @@
+---
+id: 5900f3c51000cf542c50fed7
+title: 'Problem 89: Roman numerals'
+challengeType: 5
+forumTopicId: 302204
+dashedName: problem-89-roman-numerals
+---
+
+# --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.
+
+- Numerals must be arranged in descending order of size.
+- M, C, and X cannot be equaled or exceeded by smaller denominations.
+- D, L, and V can each only appear once.
+
+In addition to the three rules given above, if subtractive combinations are used then the following four rules must be followed.
+
+- Only one I, X, and C can be used as the leading numeral in part of a subtractive pair.
+- I can only be placed before V and X.
+- X can only be placed before L and C.
+- C can only be placed before D and M.
+
+For example, it would appear that there are at least six ways of writing the number sixteen:
+
+<div style="margin-left: 4em; font-family: 'courier new', monospace;">
+  IIIIIIIIIIIIIIII<br>
+  VIIIIIIIIIII<br>
+  VVIIIIII<br>
+  XIIIIII<br>
+  VVVI<br>
+  XVI<br><br>
+</div>
+
+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 array, `roman`, will contain numbers written with valid, but not necessarily minimal, Roman numerals.
+
+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 array contain no more than four consecutive identical units.
+
+# --hints--
+
+`romanNumerals(testNumerals1)` should return a number.
+
+```js
+assert(typeof romanNumerals(_testNumerals1) === 'number');
+```
+
+`romanNumerals(testNumerals1)` should return `19`.
+
+```js
+assert.strictEqual(romanNumerals(_testNumerals1), 19);
+```
+
+`romanNumerals(testNumerals2)` should return `743`.
+
+```js
+assert.strictEqual(romanNumerals(_testNumerals2), 743);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testNumerals1 = [
+  'XIIIIII', 'XVI', 'MMMCCLXVIIII', 'XXXXVI', 'MMMMXX', 'CCLI', 'CCCCXX', 'MMMMDCXXXXI', 'DCCCCIIII', 'MXVIIII'
+];
+const _testNumerals2 = [
+  'MMMMDCLXXII','MMDCCCLXXXIII','MMMDLXVIIII','MMMMDXCV','DCCCLXXII','MMCCCVI','MMMCDLXXXVII','MMMMCCXXI','MMMCCXX','MMMMDCCCLXXIII','MMMCCXXXVII','MMCCCLXXXXIX','MDCCCXXIIII','MMCXCVI','CCXCVIII','MMMCCCXXXII','MDCCXXX','MMMDCCCL','MMMMCCLXXXVI','MMDCCCXCVI','MMMDCII','MMMCCXII','MMMMDCCCCI','MMDCCCXCII','MDCXX','CMLXXXVII','MMMXXI','MMMMCCCXIV','MLXXII','MCCLXXVIIII','MMMMCCXXXXI','MMDCCCLXXII','MMMMXXXI','MMMDCCLXXX','MMDCCCLXXIX','MMMMLXXXV','MCXXI','MDCCCXXXVII','MMCCCLXVII','MCDXXXV','CCXXXIII','CMXX','MMMCLXIV','MCCCLXXXVI','DCCCXCVIII','MMMDCCCCXXXIV','CDXVIIII','MMCCXXXV','MDCCCXXXII','MMMMD','MMDCCLXIX','MMMMCCCLXXXXVI','MMDCCXLII','MMMDCCCVIIII','DCCLXXXIIII','MDCCCCXXXII','MMCXXVII','DCCCXXX','CCLXIX','MMMXI','MMMMCMLXXXXVIII','MMMMDLXXXVII','MMMMDCCCLX','MMCCLIV','CMIX','MMDCCCLXXXIIII','CLXXXII','MMCCCCXXXXV','MMMMDLXXXVIIII','MMMDCCCXXI','MMDCCCCLXXVI','MCCCCLXX','MMCDLVIIII','MMMDCCCLIX','MMMMCCCCXIX','MMMDCCCLXXV','XXXI','CDLXXXIII','MMMCXV','MMDCCLXIII','MMDXXX','MMMMCCCLVII','MMMDCI','MMMMCDLXXXIIII','MMMMCCCXVI','CCCLXXXVIII','MMMMCML','MMMMXXIV','MMMCCCCXXX','DCCX','MMMCCLX','MMDXXXIII','CCCLXIII','MMDCCXIII','MMMCCCXLIV','CLXXXXI','CXVI','MMMMCXXXIII','CLXX','DCCCXVIII','MLXVII','DLXXXX','MMDXXI','MMMMDLXXXXVIII','MXXII','LXI','DCCCCXLIII','MMMMDV','MMMMXXXIV','MDCCCLVIII','MMMCCLXXII','MMMMDCCXXXVI','MMMMLXXXIX','MDCCCLXXXI','MMMMDCCCXV','MMMMCCCCXI','MMMMCCCLIII','MDCCCLXXI','MMCCCCXI','MLXV','MMCDLXII','MMMMDXXXXII','MMMMDCCCXL','MMMMCMLVI','CCLXXXIV','MMMDCCLXXXVI','MMCLII','MMMCCCCXV','MMLXXXIII','MMMV','MMMV','DCCLXII','MMDCCCCXVI','MMDCXLVIII','CCLIIII','CCCXXV','MMDCCLXXXVIIII','MMMMDCLXXVIII','MMMMDCCCXCI','MMMMCCCXX','MMCCXLV','MMMDCCCLXIX','MMCCLXIIII','MMMDCCCXLIX','MMMMCCCLXIX','CMLXXXXI','MCMLXXXIX','MMCDLXI','MMDCLXXVIII','MMMMDCCLXI','MCDXXV','DL','CCCLXXII','MXVIIII','MCCCCLXVIII','CIII','MMMDCCLXXIIII','MMMDVIII','MMMMCCCLXXXXVII','MMDXXVII','MMDCCLXXXXV','MMMMCXLVI','MMMDCCLXXXII','MMMDXXXVI','MCXXII','CLI','DCLXXXIX','MMMCLI','MDCLXIII','MMMMDCCXCVII','MMCCCLXXXV','MMMDCXXVIII','MMMCDLX','MMMCMLII','MMMIV','MMMMDCCCLVIII','MMMDLXXXVIII','MCXXIV','MMMMLXXVI','CLXXIX','MMMCCCCXXVIIII','DCCLXXXV','MMMDCCCVI','LI','CLXXXVI','MMMMCCCLXXVI','MCCCLXVI','CCXXXIX','MMDXXXXI','MMDCCCXLI','DCCCLXXXVIII','MMMMDCCCIV','MDCCCCXV','MMCMVI','MMMMCMLXXXXV','MMDCCLVI','MMMMCCXLVIII','DCCCCIIII','MMCCCCIII','MMMDCCLXXXVIIII','MDCCCLXXXXV','DVII','MMMV','DCXXV','MMDCCCXCV','DCVIII','MMCDLXVI','MCXXVIII','MDCCXCVIII','MMDCLX','MMMDCCLXIV','MMCDLXXVII','MMDLXXXIIII','MMMMCCCXXII','MMMDCCCXLIIII','DCCCCLXVII','MMMCLXXXXIII','MCCXV','MMMMDCXI','MMMMDCLXXXXV','MMMCCCLII','MMCMIX','MMDCCXXV','MMDLXXXVI','MMMMDCXXVIIII','DCCCCXXXVIIII','MMCCXXXIIII','MMDCCLXXVIII','MDCCLXVIIII','MMCCLXXXV','MMMMDCCCLXXXVIII','MMCMXCI','MDXLII','MMMMDCCXIV','MMMMLI','DXXXXIII','MMDCCXI','MMMMCCLXXXIII','MMMDCCCLXXIII','MDCLVII','MMCD','MCCCXXVII','MMMMDCCIIII','MMMDCCXLVI','MMMCLXXXVII','MMMCCVIIII','MCCCCLXXIX','DL','DCCCLXXVI','MMDXCI','MMMMDCCCCXXXVI','MMCII','MMMDCCCXXXXV','MMMCDXLV','MMDCXXXXIV','MMD','MDCCCLXXXX','MMDCXLIII','MMCCXXXII','MMDCXXXXVIIII','DCCCLXXI','MDXCVIIII','MMMMCCLXXVIII','MDCLVIIII','MMMCCCLXXXIX','MDCLXXXV','MDLVIII','MMMMCCVII','MMMMDCXIV','MMMCCCLXIIII','MMIIII','MMMMCCCLXXIII','CCIII','MMMCCLV','MMMDXIII','MMMCCCXC','MMMDCCCXXI','MMMMCCCCXXXII','CCCLVI','MMMCCCLXXXVI','MXVIIII','MMMCCCCXIIII','CLXVII','MMMCCLXX','CCCCLXIV','MMXXXXII','MMMMCCLXXXX','MXL','CCXVI','CCCCLVIIII','MMCCCII','MCCCLVIII','MMMMCCCX','MCDLXXXXIV','MDCCCXIII','MMDCCCXL','MMMMCCCXXIII','DXXXIV','CVI','MMMMDCLXXX','DCCCVII','MMCMLXIIII','MMMDCCCXXXIII','DCCC','MDIII','MMCCCLXVI','MMMCCCCLXXI','MMDCCCCXVIII','CCXXXVII','CCCXXV','MDCCCXII','MMMCMV','MMMMCMXV','MMMMDCXCI','DXXI','MMCCXLVIIII','MMMMCMLII','MDLXXX','MMDCLXVI','CXXI','MMMDCCCLIIII','MMMCXXI','MCCIII','MMDCXXXXI','CCXCII','MMMMDXXXV','MMMCCCLXV','MMMMDLXV','MMMCCCCXXXII','MMMCCCVIII','DCCCCLXXXXII','MMCLXIV','MMMMCXI','MLXXXXVII','MMMCDXXXVIII','MDXXII','MLV','MMMMDLXVI','MMMCXII','XXXIII','MMMMDCCCXXVI','MMMLXVIIII','MMMLX','MMMCDLXVII','MDCCCLVII','MMCXXXVII','MDCCCCXXX','MMDCCCLXIII','MMMMDCXLIX','MMMMCMXLVIII','DCCCLXXVIIII','MDCCCLIII','MMMCMLXI','MMMMCCLXI','MMDCCCLIII','MMMDCCCVI','MMDXXXXIX','MMCLXXXXV','MMDXXX','MMMXIII','DCLXXIX','DCCLXII','MMMMDCCLXVIII','MDCCXXXXIII','CCXXXII','MMMMDCXXV','MMMCCCXXVIII','MDCVIII','MMMCLXXXXIIII','CLXXXI','MDCCCCXXXIII','MMMMDCXXX','MMMDCXXIV','MMMCCXXXVII','MCCCXXXXIIII','CXVIII','MMDCCCCIV','MMMMCDLXXV','MMMDLXIV','MDXCIII','MCCLXXXI','MMMDCCCXXIV','MCXLIII','MMMDCCCI','MCCLXXX','CCXV','MMDCCLXXI','MMDLXXXIII','MMMMDCXVII','MMMCMLXV','MCLXVIII','MMMMCCLXXVI','MMMDCCLXVIIII','MMMMDCCCIX','DLXXXXIX','DCCCXXII','MMMMIII','MMMMCCCLXXVI','DCCCXCIII','DXXXI','MXXXIIII','CCXII','MMMDCCLXXXIIII','MMMCXX','MMMCMXXVII','DCCCXXXX','MMCDXXXVIIII','MMMMDCCXVIII','LV','MMMDCCCCVI','MCCCII','MMCMLXVIIII','MDCCXI','MMMMDLXVII','MMCCCCLXI','MMDCCV','MMMCCCXXXIIII','MMMMDI','MMMDCCCXCV','MMDCCLXXXXI','MMMDXXVI','MMMDCCCLVI','MMDCXXX','MCCCVII','MMMMCCCLXII','MMMMXXV','MMCMXXV','MMLVI','MMDXXX','MMMMCVII','MDC','MCCIII','MMMMDCC','MMCCLXXV','MMDCCCXXXXVI','MMMMCCCLXV','CDXIIII','MLXIIII','CCV','MMMCMXXXI','CCCCLXVI','MDXXXII','MMMMCCCLVIII','MMV','MMMCLII','MCMLI','MMDCCXX','MMMMCCCCXXXVI','MCCLXXXI','MMMCMVI','DCCXXX','MMMMCCCLXV','DCCCXI','MMMMDCCCXIV','CCCXXI','MMDLXXV','CCCCLXXXX','MCCCLXXXXII','MMDCIX','DCCXLIIII','DXIV','MMMMCLII','CDLXI','MMMCXXVII','MMMMDCCCCLXIII','MMMDCLIIII','MCCCCXXXXII','MMCCCLX','CCCCLIII','MDCCLXXVI','MCMXXIII','MMMMDLXXVIII','MMDCCCCLX','MMMCCCLXXXX','MMMCDXXVI','MMMDLVIII','CCCLXI','MMMMDCXXII','MMDCCCXXI','MMDCCXIII','MMMMCLXXXVI','MDCCCCXXVI','MDV','MMDCCCCLXXVI','MMMMCCXXXVII','MMMDCCLXXVIIII','MMMCCCCLXVII','DCCXLI','MMCLXXXVIII','MCCXXXVI','MMDCXLVIII','MMMMCXXXII','MMMMDCCLXVI','MMMMCMLI','MMMMCLXV','MMMMDCCCXCIV','MCCLXXVII','LXXVIIII','DCCLII','MMMCCCXCVI','MMMCLV','MMDCCCXXXXVIII','DCCCXV','MXC','MMDCCLXXXXVII','MMMMCML','MMDCCCLXXVIII','DXXI','MCCCXLI','DCLXXXXI','MMCCCLXXXXVIII','MDCCCCLXXVIII','MMMMDXXV','MMMDCXXXVI','MMMCMXCVII','MMXVIIII','MMMDCCLXXIV','MMMCXXV','DXXXVIII','MMMMCLXVI','MDXII','MMCCCLXX','CCLXXI','DXIV','MMMCLIII','DLII','MMMCCCXLIX','MMCCCCXXVI','MMDCXLIII','MXXXXII','CCCLXXXV','MDCLXXVI','MDCXII','MMMCCCLXXXIII','MMDCCCCLXXXII','MMMMCCCLXXXV','MMDCXXI','DCCCXXX','MMMDCCCCLII','MMMDCCXXII','MMMMCDXCVIII','MMMCCLXVIIII','MMXXV','MMMMCDXIX','MMMMCCCX','MMMCCCCLXVI','MMMMDCLXXVIIII','MMMMDCXXXXIV','MMMCMXII','MMMMXXXIII','MMMMDLXXXII','DCCCLIV','MDXVIIII','MMMCLXXXXV','CCCCXX','MMDIX','MMCMLXXXVIII','DCCXLIII','DCCLX','D','MCCCVII','MMMMCCCLXXXIII','MDCCCLXXIIII','MMMDCCCCLXXXVII','MMMMCCCVII','MMMDCCLXXXXVI','CDXXXIV','MCCLXVIII','MMMMDLX','MMMMDXII','MMMMCCCCLIIII','MCMLXXXXIII','MMMMDCCCIII','MMDCLXXXIII','MDCCCXXXXIV','XXXXVII','MMMDCCCXXXII','MMMDCCCXLII','MCXXXV','MDCXXVIIII','MMMCXXXXIIII','MMMMCDXVII','MMMDXXIII','MMMMCCCCLXI','DCLXXXXVIIII','LXXXXI','CXXXIII','MCDX','MCCLVII','MDCXXXXII','MMMCXXIV','MMMMLXXXX','MMDCCCCXLV','MLXXX','MMDCCCCLX','MCDLIII','MMMCCCLXVII','MMMMCCCLXXIV','MMMDCVIII','DCCCCXXIII','MMXCI','MMDCCIV','MMMMDCCCXXXIV','CCCLXXI','MCCLXXXII','MCMIII','CCXXXI','DCCXXXVIII','MMMMDCCXLVIIII','MMMMCMXXXV','DCCCLXXV','DCCXCI','MMMMDVII','MMMMDCCCLXVIIII','CCCXCV','MMMMDCCXX','MCCCCII','MMMCCCXC','MMMCCCII','MMDCCLXXVII','MMDCLIIII','CCXLIII','MMMDCXVIII','MMMCCCIX','MCXV','MMCCXXV','MLXXIIII','MDCCXXVI','MMMCCCXX','MMDLXX','MMCCCCVI','MMDCCXX','MMMMDCCCCXCV','MDCCCXXXII','MMMMDCCCCXXXX','XCIV','MMCCCCLX','MMXVII','MLXXI','MMMDXXVIII','MDCCCCII','MMMCMLVII','MMCLXXXXVIII','MDCCCCLV','MCCCCLXXIIII','MCCCLII','MCDXLVI','MMMMDXVIII','DCCLXXXIX','MMMDCCLXIV','MDCCCCXLIII','CLXXXXV','MMMMCCXXXVI','MMMDCCCXXI','MMMMCDLXXVII','MCDLIII','MMCCXLVI','DCCCLV','MCDLXX','DCLXXVIII','MMDCXXXIX','MMMMDCLX','MMDCCLI','MMCXXXV','MMMCCXII','MMMMCMLXII','MMMMCCV','MCCCCLXIX','MMMMCCIII','CLXVII','MCCCLXXXXIIII','MMMMDCVIII','MMDCCCLXI','MMLXXIX','CMLXIX','MMDCCCXLVIIII','DCLXII','MMMCCCXLVII','MDCCCXXXV','MMMMDCCXCVI','DCXXX','XXVI','MMLXIX','MMCXI','DCXXXVII','MMMMCCCXXXXVIII','MMMMDCLXI','MMMMDCLXXIIII','MMMMVIII','MMMMDCCCLXII','MDCXCI','MMCCCXXIIII','CCCCXXXXV','MMDCCCXXI','MCVI','MMDCCLXVIII','MMMMCXL','MLXVIII','CMXXVII','CCCLV','MDCCLXXXIX','MMMCCCCLXV','MMDCCLXII','MDLXVI','MMMCCCXVIII','MMMMCCLXXXI','MMCXXVII','MMDCCCLXVIII','MMMCXCII','MMMMDCLVIII','MMMMDCCCXXXXII','MMDCCCCLXXXXVI','MDCCXL','MDCCLVII','MMMMDCCCLXXXVI','DCCXXXIII','MMMMDCCCCLXXXV','MMCCXXXXVIII','MMMCCLXXVIII','MMMDCLXXVIII','DCCCI','MMMMLXXXXVIIII','MMMCCCCLXXII','MMCLXXXVII','CCLXVI','MCDXLIII','MMCXXVIII','MDXIV','CCCXCVIII','CLXXVIII','MMCXXXXVIIII','MMMDCLXXXIV','CMLVIII','MCDLIX','MMMMDCCCXXXII','MMMMDCXXXIIII','MDCXXI','MMMDCXLV','MCLXXVIII','MCDXXII','IV','MCDLXXXXIII','MMMMDCCLXV','CCLI','MMMMDCCCXXXVIII','DCLXII','MCCCLXVII','MMMMDCCCXXXVI','MMDCCXLI','MLXI','MMMCDLXVIII','MCCCCXCIII','XXXIII','MMMDCLXIII','MMMMDCL','DCCCXXXXIIII','MMDLVII','DXXXVII','MCCCCXXIIII','MCVII','MMMMDCCXL','MMMMCXXXXIIII','MCCCCXXIV','MMCLXVIII','MMXCIII','MDCCLXXX','MCCCLIIII','MMDCLXXI','MXI','MCMLIV','MMMCCIIII','DCCLXXXVIIII','MDCLIV','MMMDCXIX','CMLXXXI','DCCLXXXVII','XXV','MMMXXXVI','MDVIIII','CLXIII','MMMCDLVIIII','MMCCCCVII','MMMLXX','MXXXXII','MMMMCCCLXVIII','MMDCCCXXVIII','MMMMDCXXXXI','MMMMDCCCXXXXV','MMMXV','MMMMCCXVIIII','MMDCCXIIII','MMMXXVII','MDCCLVIIII','MMCXXIIII','MCCCLXXIV','DCLVIII','MMMLVII','MMMCXLV','MMXCVII','MMMCCCLXXXVII','MMMMCCXXII','DXII','MMMDLV','MCCCLXXVIII','MMMCLIIII','MMMMCLXXXX','MMMCLXXXIIII','MDCXXIII','MMMMCCXVI','MMMMDLXXXIII','MMMDXXXXIII','MMMMCCCCLV','MMMDLXXXI','MMMCCLXXVI','MMMMXX','MMMMDLVI','MCCCCLXXX','MMMXXII','MMXXII','MMDCCCCXXXI','MMMDXXV','MMMDCLXXXVIIII','MMMDLXXXXVII','MDLXIIII','CMXC','MMMXXXVIII','MDLXXXVIII','MCCCLXXVI','MMCDLIX','MMDCCCXVIII','MDCCCXXXXVI','MMMMCMIV','MMMMDCIIII','MMCCXXXV','XXXXVI','MMMMCCXVII','MMCCXXIV','MCMLVIIII','MLXXXIX','MMMMLXXXIX','CLXXXXIX','MMMDCCCCLVIII','MMMMCCLXXIII','MCCCC','DCCCLIX','MMMCCCLXXXII','MMMCCLXVIIII','MCLXXXV','CDLXXXVII','DCVI','MMX','MMCCXIII','MMMMDCXX','MMMMXXVIII','DCCCLXII','MMMMCCCXLIII','MMMMCLXV','DXCI','MMMMCLXXX','MMMDCCXXXXI','MMMMXXXXVI','DCLX','MMMCCCXI','MCCLXXX','MMCDLXXII','DCCLXXI','MMMCCCXXXVI','MCCCCLXXXVIIII','CDLVIII','DCCLVI','MMMMDCXXXVIII','MMCCCLXXXIII','MMMMDCCLXXV','MMMXXXVI','CCCLXXXXIX','CV','CCCCXIII','CCCCXVI','MDCCCLXXXIIII','MMDCCLXXXII','MMMMCCCCLXXXI','MXXV','MMCCCLXXVIIII','MMMCCXII','MMMMCCXXXIII','MMCCCLXXXVI','MMMDCCCLVIIII','MCCXXXVII','MDCLXXV','XXXV','MMDLI','MMMCCXXX','MMMMCXXXXV','CCCCLIX','MMMMDCCCLXXIII','MMCCCXVII','DCCCXVI','MMMCCCXXXXV','MDCCCCXCV','CLXXXI','MMMMDCCLXX','MMMDCCCIII','MMCLXXVII','MMMDCCXXIX','MMDCCCXCIIII','MMMCDXXIIII','MMMMXXVIII','MMMMDCCCCLXVIII','MDCCCXX','MMMMCDXXI','MMMMDLXXXIX','CCXVI','MDVIII','MMCCLXXI','MMMDCCCLXXI','MMMCCCLXXVI','MMCCLXI','MMMMDCCCXXXIV','DLXXXVI','MMMMDXXXII','MMMXXIIII','MMMMCDIV','MMMMCCCXLVIII','MMMMCXXXVIII','MMMCCCLXVI','MDCCXVIII','MMCXX','CCCLIX','MMMMDCCLXXII','MDCCCLXXV','MMMMDCCCXXIV','DCCCXXXXVIII','MMMDCCCCXXXVIIII','MMMMCCXXXV','MDCLXXXIII','MMCCLXXXIV','MCLXXXXIIII','DXXXXIII','MCCCXXXXVIII','MMCLXXIX','MMMMCCLXIV','MXXII','MMMCXIX','MDCXXXVII','MMDCCVI','MCLXXXXVIII','MMMCXVI','MCCCLX','MMMCDX','CCLXVIIII','MMMCCLX','MCXXVIII','LXXXII','MCCCCLXXXI','MMMI','MMMCCCLXIV','MMMCCCXXVIIII','CXXXVIII','MMCCCXX','MMMCCXXVIIII','MCCLXVI','MMMCCCCXXXXVI','MMDCCXCIX','MCMLXXI','MMCCLXVIII','CDLXXXXIII','MMMMDCCXXII','MMMMDCCLXXXVII','MMMDCCLIV','MMCCLXIII','MDXXXVII','DCCXXXIIII','MCII','MMMDCCCLXXI','MMMLXXIII','MDCCCLIII','MMXXXVIII','MDCCXVIIII','MDCCCCXXXVII','MMCCCXVI','MCMXXII','MMMCCCLVIII','MMMMDCCCXX','MCXXIII','MMMDLXI','MMMMDXXII','MDCCCX','MMDXCVIIII','MMMDCCCCVIII','MMMMDCCCCXXXXVI','MMDCCCXXXV','MMCXCIV','MCMLXXXXIII','MMMCCCLXXVI','MMMMDCLXXXV','CMLXIX','DCXCII','MMXXVIII','MMMMCCCXXX','XXXXVIIII'
+];
+```
+
+## --seed-contents--
+
+```js
+function romanNumerals(roman) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testNumerals1 = [
+  'XIIIIII', 'XVI', 'MMMCCLXVIIII', 'XXXXVI', 'MMMMXX', 'CCLI', 'CCCCXX', 'MMMMDCXXXXI', 'DCCCCIIII', 'MXVIIII'
+];
+
+romanNumerals(testNumerals1);
+```
+
+# --solutions--
+
+```js
+function romanNumerals(roman) {
+  const numerals = [...roman];
+  const replaces = [
+    ['VIIII', 'IX'],
+    ['IIII', 'IV'],
+    ['LXXXX', 'XC'],
+    ['XXXX', 'XL'],
+    ['DCCCC', 'CM'],
+    ['CCCC', 'CD']
+  ];
+  let savedChars = 0;
+  for (let i = 0; i < numerals.length; i++) {
+    const charsBefore = numerals[i].length;
+    for (let j = 0; j < replaces.length; j++) {
+      numerals[i] = numerals[i].replace(...replaces[j]);
+    }
+    const charsAfter = numerals[i].length;
+    savedChars += charsBefore - charsAfter;
+  }
+  return savedChars;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
new file mode 100644
index 0000000000..3ce9715e40
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.md
@@ -0,0 +1,74 @@
+---
+id: 5900f3761000cf542c50fe88
+title: 'Problem 9: Special Pythagorean triplet'
+challengeType: 5
+forumTopicId: 302205
+dashedName: problem-9-special-pythagorean-triplet
+---
+
+# --description--
+
+A Pythagorean triplet is a set of three natural numbers, `a` &lt; `b` &lt; `c`, for which,
+
+<div style='text-align: center;'><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup></div>
+
+For example, 3<sup>2</sup> + 4<sup>2</sup> = 9 + 16 = 25 = 5<sup>2</sup>.
+
+There exists exactly one Pythagorean triplet for which `a` + `b` + `c` = 1000. Find the product `abc` such that `a` + `b` + `c` = `n`.
+
+# --hints--
+
+`specialPythagoreanTriplet(24)` should return a number.
+
+```js
+assert(typeof specialPythagoreanTriplet(24) === 'number');
+```
+
+`specialPythagoreanTriplet(24)` should return 480.
+
+```js
+assert.strictEqual(specialPythagoreanTriplet(24), 480);
+```
+
+`specialPythagoreanTriplet(120)` should return 49920, 55080 or 60000
+
+```js
+assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));
+```
+
+`specialPythagoreanTriplet(1000)` should return 31875000.
+
+```js
+assert.strictEqual(specialPythagoreanTriplet(1000), 31875000);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function specialPythagoreanTriplet(n) {
+ let sumOfabc = n;
+
+ return true;
+}
+
+specialPythagoreanTriplet(1000);
+```
+
+# --solutions--
+
+```js
+const specialPythagoreanTriplet = (n)=>{
+ let sumOfabc = n;
+ let a,b,c;
+ for(a = 1; a<=sumOfabc/3; a++){
+ for(b = a+1; b<=sumOfabc/2; b++){
+ c = Math.sqrt(a*a+b*b);
+ if((a+b+c) == sumOfabc){
+ return a*b*c;
+ }
+ }
+ }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
new file mode 100644
index 0000000000..c07bf97f28
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-90-cube-digit-pairs.md
@@ -0,0 +1,65 @@
+---
+id: 5900f3c61000cf542c50fed9
+title: 'Problem 90: Cube digit pairs'
+challengeType: 5
+forumTopicId: 302207
+dashedName: problem-90-cube-digit-pairs
+---
+
+# --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:
+
+<img class="img-responsive center-block" alt="two cubes, one with the number 6 and the other with number 4" src="https://cdn-media-1.freecodecamp.org/project-euler/cube-digit-pairs.png" style="background-color: white; padding: 10px;">
+
+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.
+
+<div style="margin-left: 4em;">
+  {1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}<br>
+  {1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}
+</div>
+
+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?
+
+# --hints--
+
+`cubeDigitPairs()` should return a number.
+
+```js
+assert(typeof cubeDigitPairs() === 'number');
+```
+
+`cubeDigitPairs()` should return 1217.
+
+```js
+assert.strictEqual(cubeDigitPairs(), 1217);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cubeDigitPairs() {
+
+  return true;
+}
+
+cubeDigitPairs();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
new file mode 100644
index 0000000000..b38a0eb1bc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md
@@ -0,0 +1,119 @@
+---
+id: 5900f3c71000cf542c50feda
+title: 'Problem 91: Right triangles with integer coordinates'
+challengeType: 5
+forumTopicId: 302208
+dashedName: problem-91-right-triangles-with-integer-coordinates
+---
+
+# --description--
+
+The points ${P}(x_1, y_1)$ and ${Q}(x_2, y_2)$ are plotted at integer co-ordinates and are joined to the origin, ${O}(0, 0)$, to form ${\Delta}OPQ$.
+
+<img class="img-responsive center-block" alt="a graph plotting points P (x_1, y_1) and Q(x_2, y_2) at integer coordinates that are joined to the origin O (0, 0)" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-1.png" style="background-color: white; padding: 10px;">
+
+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 ≤ x_1, y_1, x_2, y_2 ≤ 2$.
+
+<img class="img-responsive center-block" alt="a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2" src="https://cdn-media-1.freecodecamp.org/project-euler/right-triangles-integer-coordinates-2.png" style="background-color: white; padding: 10px;">
+
+Given that $0 ≤ x_1, y_1, x_2, y_2 ≤ limit$, how many right triangles can be formed?
+
+# --hints--
+
+`rightTrianglesIntCoords(2)` should return a number.
+
+```js
+assert(typeof rightTrianglesIntCoords(2) === 'number');
+```
+
+`rightTrianglesIntCoords(2)` should return `14`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(2), 14);
+```
+
+`rightTrianglesIntCoords(10)` should return `448`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(10), 448);
+```
+
+`rightTrianglesIntCoords(25)` should return `3207`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(25), 3207);
+```
+
+`rightTrianglesIntCoords(50)` should return `14234`.
+
+```js
+assert.strictEqual(rightTrianglesIntCoords(50), 14234);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function rightTrianglesIntCoords(limit) {
+
+  return true;
+}
+
+rightTrianglesIntCoords(2);
+```
+
+# --solutions--
+
+```js
+function rightTrianglesIntCoords(limit) {
+  function isRightTriangle(points) {
+    for (let i = 0; i < points.length; i++) {
+      const pointA = points[i];
+      const pointB = points[(i + 1) % 3];
+      const pointC = points[(i + 2) % 3];
+      const vectorAB = [pointB[0] - pointA[0], pointB[1] - pointA[1]];
+      const vectorAC = [pointC[0] - pointA[0], pointC[1] - pointA[1]];
+
+      if (isRightAngleBetween(vectorAB, vectorAC)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  function isRightAngleBetween(vector1, vector2) {
+    return vector1[0] * vector2[0] + vector1[1] * vector2[1] === 0;
+  }
+
+  function getSetKey(points) {
+    return (
+      '0.0,' +
+      points
+        .sort((a, b) => a[0] - b[0])
+        .map(point => point.join('.'))
+        .join(',')
+    );
+  }
+
+  const pointO = [0, 0];
+  const rightTriangles = new Set();
+  for (let x1 = 1; x1 <= limit; x1++) {
+    for (let y1 = 0; y1 <= limit; y1++) {
+      const pointP = [x1, y1];
+      for (let x2 = 0; x2 <= limit; x2++) {
+        for (let y2 = 1; y2 <= limit; y2++) {
+          const pointQ = [x2, y2];
+          if (pointP[0] === pointQ[0] && pointP[1] === pointQ[1]) {
+            continue;
+          }
+          if (isRightTriangle([pointO, pointP, pointQ])) {
+            rightTriangles.add(getSetKey([pointP, pointQ]));
+          }
+        }
+      }
+    }
+  }
+  return rightTriangles.size;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
new file mode 100644
index 0000000000..065f0b748d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-92-square-digit-chains.md
@@ -0,0 +1,155 @@
+---
+id: 5900f3c81000cf542c50fedb
+title: 'Problem 92: Square digit chains'
+challengeType: 5
+forumTopicId: 302209
+dashedName: problem-92-square-digit-chains
+---
+
+# --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,
+
+$$\begin{align}
+  & 44 → 32 → 13 → 10 → \boldsymbol{1} → \boldsymbol{1}\\\\
+  & 85 → \boldsymbol{89} → 145 → 42 → 20 → 4 → 16 → 37 → 58 → \boldsymbol{89}\\\\
+\end{align}$$
+
+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 `limit` will arrive at 89?
+
+# --hints--
+
+`squareDigitChains(100)` should return a number.
+
+```js
+assert(typeof squareDigitChains(100) === 'number');
+```
+
+`squareDigitChains(100)` should return `80`.
+
+```js
+assert.strictEqual(squareDigitChains(100), 80);
+```
+
+`squareDigitChains(1000)` should return `857`.
+
+```js
+assert.strictEqual(squareDigitChains(1000), 857);
+```
+
+`squareDigitChains(100000)` should return `85623`.
+
+```js
+assert.strictEqual(squareDigitChains(100000), 85623);
+```
+
+`squareDigitChains(10000000)` should return `8581146`.
+
+```js
+assert.strictEqual(squareDigitChains(10000000), 8581146);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function squareDigitChains(limit) {
+
+  return true;
+}
+
+squareDigitChains(100);
+```
+
+# --solutions--
+
+```js
+function squareDigitChains(limit) {
+  // Based on https://www.xarg.org/puzzle/project-euler/problem-92/
+  function getCombinations(neededDigits, curDigits) {
+    if (neededDigits === curDigits.length) {
+      return [curDigits];
+    }
+    const combinations = [];
+    const lastDigit = curDigits.length !== 0 ? curDigits[0] : 9;
+    for (let i = 0; i <= lastDigit; i++) {
+      const results = getCombinations(neededDigits, [i].concat(curDigits));
+      combinations.push(...results);
+    }
+    return combinations;
+  }
+
+  function getPossibleSums(limit) {
+    const digitsCount = getDigits(limit).length - 1;
+    const possibleSquaredSums = [false];
+    for (let i = 1; i <= 81 * digitsCount; i++) {
+      let curVal = i;
+      while (curVal !== 1 && curVal !== 89) {
+        curVal = addSquaredDigits(curVal);
+      }
+      possibleSquaredSums[i] = curVal === 89;
+    }
+    return possibleSquaredSums;
+  }
+
+  function addSquaredDigits(num) {
+    const digits = getDigits(num);
+    let result = 0;
+    for (let i = 0; i < digits.length; i++) {
+      result += digits[i] ** 2;
+    }
+    return result;
+  }
+
+  function getDigits(number) {
+    const digits = [];
+    while (number > 0) {
+      digits.push(number % 10);
+      number = Math.floor(number / 10);
+    }
+    return digits;
+  }
+
+  function getFactorials(number) {
+    const factorials = [1];
+    for (let i = 1; i < number; i++) {
+      factorials[i] = factorials[i - 1] * i;
+    }
+    return factorials;
+  }
+
+  const neededDigits = getDigits(limit).length - 1;
+  const combinations = getCombinations(neededDigits, []);
+  const possibleSquaredDigitsSums = getPossibleSums(limit);
+  const factorials = getFactorials(neededDigits + 1);
+
+  let endingWith89 = 0;
+
+  for (let i = 0; i < combinations.length; i++) {
+    let counts = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+    let digits = combinations[i];
+    let curSum = 0;
+    for (let j = 0; j < digits.length; j++) {
+      const curDigit = digits[j];
+      curSum += curDigit ** 2;
+      counts[curDigit]++;
+    }
+
+    if (possibleSquaredDigitsSums[curSum]) {
+      let denominator = 1;
+      for (let j = 0; j < counts.length; j++) {
+        denominator = denominator * factorials[counts[j]];
+      }
+      endingWith89 += Math.floor(
+        factorials[factorials.length - 1] / denominator
+      );
+    }
+  }
+  return endingWith89;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
new file mode 100644
index 0000000000..81b5dce63a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-93-arithmetic-expressions.md
@@ -0,0 +1,59 @@
+---
+id: 5900f3ca1000cf542c50fedc
+title: 'Problem 93: Arithmetic expressions'
+challengeType: 5
+forumTopicId: 302210
+dashedName: problem-93-arithmetic-expressions
+---
+
+# --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,
+
+<div style='margin-left: 4em;'>
+  8 = (4 * (1 + 3)) / 2<br>
+  14 = 4 * (3 + 1 / 2)<br>
+  19 = 4 * (2 + 3) − 1<br>
+  36 = 3 * 4 * (2 + 1)
+</div>
+
+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` &lt; `b` &lt; `c` &lt; `d`, for which the longest set of consecutive positive integers, 1 to `n`, can be obtained, giving your answer as a string: `abcd`.
+
+# --hints--
+
+`arithmeticExpressions()` should return a number.
+
+```js
+assert(typeof arithmeticExpressions() === 'number');
+```
+
+`arithmeticExpressions()` should return 1258.
+
+```js
+assert.strictEqual(arithmeticExpressions(), 1258);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function arithmeticExpressions() {
+
+  return true;
+}
+
+arithmeticExpressions();
+```
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
new file mode 100644
index 0000000000..ef0c095e03
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-94-almost-equilateral-triangles.md
@@ -0,0 +1,84 @@
+---
+id: 5900f3ca1000cf542c50fedd
+title: 'Problem 94: Almost equilateral triangles'
+challengeType: 5
+forumTopicId: 302211
+dashedName: problem-94-almost-equilateral-triangles
+---
+
+# --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 <dfn>almost equilateral triangle</dfn> 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 `limit`.
+
+# --hints--
+
+`almostEquilateralTriangles(50)` should return a number.
+
+```js
+assert(typeof almostEquilateralTriangles(50) === 'number');
+```
+
+`almostEquilateralTriangles(50)` should return `66`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(50), 66);
+```
+
+`almostEquilateralTriangles(10000)` should return `3688`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(10000), 3688);
+```
+
+`almostEquilateralTriangles(10000000)` should return `9973078`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(10000000), 9973078);
+```
+
+`almostEquilateralTriangles(1000000000)` should return `518408346`.
+
+```js
+assert.strictEqual(almostEquilateralTriangles(1000000000), 518408346);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function almostEquilateralTriangles(limit) {
+
+  return true;
+}
+
+almostEquilateralTriangles(50);
+```
+
+# --solutions--
+
+```js
+function almostEquilateralTriangles(limit) {
+  // Based on https://blog.dreamshire.com/project-euler-94-solution/
+  let perimetersSum = 0;
+
+  let sidesAB = 1;
+  let sideC = 1;
+  let perimeter = 0;
+  let perimeterOffset = 1;
+
+  while (perimeter <= limit) {
+    [sidesAB, sideC] = [4 * sidesAB - sideC + 2 * perimeterOffset, sidesAB];
+    perimeterOffset = -perimeterOffset;
+
+    perimetersSum += perimeter;
+    perimeter = 3 * sidesAB - perimeterOffset;
+  }
+
+  return perimetersSum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
new file mode 100644
index 0000000000..9d42e7c6f5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-95-amicable-chains.md
@@ -0,0 +1,126 @@
+---
+id: 5900f3cc1000cf542c50fede
+title: 'Problem 95: Amicable chains'
+challengeType: 5
+forumTopicId: 302212
+dashedName: problem-95-amicable-chains
+---
+
+# --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 → \cdots)
+$$
+
+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 `limit`.
+
+# --hints--
+
+`amicableChains(300)` should return a number.
+
+```js
+assert(typeof amicableChains(300) === 'number');
+```
+
+`amicableChains(300)` should return `220`.
+
+```js
+assert.strictEqual(amicableChains(300), 220);
+```
+
+`amicableChains(15000)` should return `220`.
+
+```js
+assert.strictEqual(amicableChains(15000), 220);
+```
+
+`amicableChains(100000)` should return `12496`.
+
+```js
+assert.strictEqual(amicableChains(100000), 12496);
+```
+
+`amicableChains(1000000)` should return `14316`.
+
+```js
+assert.strictEqual(amicableChains(1000000), 14316);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function amicableChains(limit) {
+
+  return true;
+}
+
+amicableChains(300);
+```
+
+# --solutions--
+
+```js
+function amicableChains(limit) {
+  function getSmallestMember(chain) {
+    let smallest = chain[0];
+    for (let i = 1; i < chain.length; i++) {
+      if (smallest > chain[i]) {
+        smallest = chain[i];
+      }
+    }
+    return smallest;
+  }
+
+  function getFactorsSums(limit) {
+    const factorsSums = new Array(limit + 1).fill(1);
+    for (let i = 2; i <= limit / 2; i++) {
+      for (let j = 2 * i; j <= limit; j += i) {
+        factorsSums[j] += i;
+      }
+    }
+    return factorsSums;
+  }
+
+  const factorsSums = getFactorsSums(limit);
+  const checkedNumbers = new Set();
+
+  let longestChain = 0;
+  let smallestMember = 0;
+  for (let i = 0; i <= limit; i++) {
+    const curChain = [];
+    let curNumber = i;
+    while (!checkedNumbers.has(curNumber) && factorsSums[curNumber] <= limit) {
+      curNumber = factorsSums[curNumber];
+
+      const chainStart = curChain.indexOf(curNumber);
+      if (chainStart === -1) {
+        curChain.push(curNumber);
+        continue;
+      }
+
+      const chainLength = curChain.length - chainStart;
+      if (chainLength > longestChain) {
+        longestChain = chainLength;
+        smallestMember = getSmallestMember(curChain.slice(chainStart));
+      }
+      break;
+    }
+
+    for (let j = 0; j < curChain.length; j++) {
+      checkedNumbers.add(curChain[j]);
+    }
+  }
+
+  return smallestMember;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-96-su-doku.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-96-su-doku.md
new file mode 100644
index 0000000000..10509108d2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-96-su-doku.md
@@ -0,0 +1,296 @@
+---
+id: 5900f3cc1000cf542c50fedf
+title: 'Problem 96: Su Doku'
+challengeType: 5
+forumTopicId: 302213
+dashedName: problem-96-su-doku
+---
+
+# --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.
+
+<div style="margin: auto; background-color: white; padding: 10px; width: 80%; text-align: center;">
+  <table border="0" cellpadding="0" cellspacing="0" align="center">
+    <tbody>
+      <tr>
+        <td>
+          <table cellpadding="5" cellspacing="0" border="1">
+            <tbody>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 3<br />9 0 0<br />0 0 1
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 2 0<br />3 0 5<br />8 0 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 0 0<br />0 0 1<br />4 0 0
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 8<br />7 0 0<br />0 0 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  1 0 2<br />0 0 0<br />7 0 8
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 0 0<br />0 0 8<br />2 0 0
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  0 0 2<br />8 0 0<br />0 0 5
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 0 9<br />2 0 3<br />0 1 0
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 0 0<br />0 0 9<br />3 0 0
+                </td>
+              </tr>
+            </tbody>
+          </table>
+        </td>
+        <td width="50">
+          <img src="images/spacer.gif" width="50" height="1" alt="" /><br />
+        </td>
+        <td>
+          <table cellpadding="5" cellspacing="0" border="1">
+            <tbody>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  4 8 3<br />9 6 7<br />2 5 1
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 2 1<br />3 4 5<br />8 7 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 5 7<br />8 2 1<br />4 9 3
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 4 8<br />7 2 9<br />1 3 6
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  1 3 2<br />5 6 4<br />7 9 8
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  9 7 6<br />1 3 8<br />2 4 5
+                </td>
+              </tr>
+              <tr>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  3 7 2<br />8 1 4<br />6 9 5
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  6 8 9<br />2 5 3<br />4 1 7
+                </td>
+                <td style="font-family:'courier new';font-size:14pt; color: black; padding: 5px; border: 2px solid black;">
+                  5 1 4<br />7 6 9<br />3 8 2
+                </td>
+              </tr>
+            </tbody>
+          </table>
+        </td>
+      </tr>
+    </tbody>
+  </table>
+</div>
+
+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 `puzzlesArr` array contains different Su Doku puzzle strings ranging in difficulty, but all with unique solutions.
+
+By solving all puzzles in `puzzlesArr`, 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.
+
+# --hints--
+
+`suDoku(testPuzzles1)` should return a number.
+
+```js
+assert(typeof suDoku(_testPuzzles1) === 'number');
+```
+
+`suDoku(testPuzzles1)` should return `1190`.
+
+```js
+assert.strictEqual(suDoku(_testPuzzles1), 1190);
+```
+
+`suDoku(testPuzzles2)` should return `24702`.
+
+```js
+assert.strictEqual(suDoku(_testPuzzles2), 24702);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testPuzzles1 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
+];
+
+const _testPuzzles2 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000',
+  '030050040008010500460000012070502080000603000040109030250000098001020600080060020',
+  '020810740700003100090002805009040087400208003160030200302700060005600008076051090',
+  '100920000524010000000000070050008102000000000402700090060000000000030945000071006',
+  '043080250600000000000001094900004070000608000010200003820500000000000005034090710',
+  '480006902002008001900370060840010200003704100001060049020085007700900600609200018',
+  '000900002050123400030000160908000000070000090000000205091000050007439020400007000',
+  '001900003900700160030005007050000009004302600200000070600100030042007006500006800',
+  '000125400008400000420800000030000095060902010510000060000003049000007200001298000',
+  '062340750100005600570000040000094800400000006005830000030000091006400007059083260',
+  '300000000005009000200504000020000700160000058704310600000890100000067080000005437',
+  '630000000000500008005674000000020000003401020000000345000007004080300902947100080',
+  '000020040008035000000070602031046970200000000000501203049000730000000010800004000',
+  '361025900080960010400000057008000471000603000259000800740000005020018060005470329',
+  '050807020600010090702540006070020301504000908103080070900076205060090003080103040',
+  '080005000000003457000070809060400903007010500408007020901020000842300000000100080',
+  '003502900000040000106000305900251008070408030800763001308000104000020000005104800',
+  '000000000009805100051907420290401065000000000140508093026709580005103600000000000',
+  '020030090000907000900208005004806500607000208003102900800605007000309000030020050',
+  '005000006070009020000500107804150000000803000000092805907006000030400010200000600',
+  '040000050001943600009000300600050002103000506800020007005000200002436700030000040',
+  '004000000000030002390700080400009001209801307600200008010008053900040000000000800',
+  '360020089000361000000000000803000602400603007607000108000000000000418000970030014',
+  '500400060009000800640020000000001008208000501700500000000090084003000600060003002',
+  '007256400400000005010030060000508000008060200000107000030070090200000004006312700',
+  '000000000079050180800000007007306800450708096003502700700000005016030420000000000',
+  '030000080009000500007509200700105008020090030900402001004207100002000800070000090',
+  '200170603050000100000006079000040700000801000009050000310400000005000060906037002',
+  '000000080800701040040020030374000900000030000005000321010060050050802006080000000',
+  '000000085000210009960080100500800016000000000890006007009070052300054000480000000',
+  '608070502050608070002000300500090006040302050800050003005000200010704090409060701',
+  '050010040107000602000905000208030501040070020901080406000401000304000709020060010',
+  '053000790009753400100000002090080010000907000080030070500000003007641200061000940',
+  '006080300049070250000405000600317004007000800100826009000702000075040190003090600',
+  '005080700700204005320000084060105040008000500070803010450000091600508007003010600',
+  '000900800128006400070800060800430007500000009600079008090004010003600284001007000',
+  '000080000270000054095000810009806400020403060006905100017000620460000038000090000',
+  '000602000400050001085010620038206710000000000019407350026040530900020007000809000',
+  '000900002050123400030000160908000000070000090000000205091000050007439020400007000',
+  '380000000000400785009020300060090000800302009000040070001070500495006000000000092',
+  '000158000002060800030000040027030510000000000046080790050000080004070100000325000',
+  '010500200900001000002008030500030007008000500600080004040100700000700006003004050',
+  '080000040000469000400000007005904600070608030008502100900000005000781000060000010',
+  '904200007010000000000706500000800090020904060040002000001607000000000030300005702',
+  '000700800006000031040002000024070000010030080000060290000800070860000500002006000',
+  '001007090590080001030000080000005800050060020004100000080000030100020079020700400',
+  '000003017015009008060000000100007000009000200000500004000000020500600340340200000',
+  '300200000000107000706030500070009080900020004010800050009040301000702000000008006'
+];
+```
+
+## --seed-contents--
+
+```js
+function suDoku(puzzlesArr) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testPuzzles1 = [
+  '003020600900305001001806400008102900700000008006708200002609500800203009005010300',
+  '200080300060070084030500209000105408000000000402706000301007040720040060004010003',
+  '000000907000420180000705026100904000050000040000507009920108000034059000507000000'
+];
+
+suDoku(testPuzzles1);
+```
+
+# --solutions--
+
+```js
+function suDoku(puzzlesArr) {
+  function solve(puzzle) {
+    for (let row = 0; row < 9; row++) {
+      for (let col = 0; col < 9; col++) {
+        if (puzzle[row][col] > 0) {
+          continue;
+        }
+
+        const allowedNumbers = getAllowedNumbers(puzzle, row, col);
+
+        for (let number = 1; number <= 9; number++) {
+          if (allowedNumbers[number]) {
+            puzzle[row][col] = number;
+            if (solve(puzzle)) {
+              return true;
+            }
+          }
+        }
+
+        puzzle[row][col] = 0;
+        return false;
+      }
+    }
+    return true;
+  }
+
+  function getAllowedNumbers(puzzle, row, col) {
+    const allowed = new Array(10).fill(true);
+    allowed[0] = false;
+
+    for (let i = 0; i < 9; i++) {
+      const numberInSameRow = puzzle[row][i];
+      if (numberInSameRow > 0) {
+        allowed[numberInSameRow] = false;
+      }
+
+      const numberInSameCol = puzzle[i][col];
+      if (numberInSameCol > 0) {
+        allowed[numberInSameCol] = false;
+      }
+    }
+
+    const rowOfSubGrid = Math.floor(row / 3) * 3;
+    const colOfSubGrid = Math.floor(col / 3) * 3;
+    for (let rowInSubGrid = 0; rowInSubGrid < 3; rowInSubGrid++) {
+      for (let colInSubGrid = 0; colInSubGrid < 3; colInSubGrid++) {
+        const numberInSameSubGrid =
+          puzzle[rowOfSubGrid + rowInSubGrid][colOfSubGrid + colInSubGrid];
+        if (numberInSameSubGrid > 0) {
+          allowed[numberInSameSubGrid] = false;
+        }
+      }
+    }
+
+    return allowed;
+  }
+
+  function parsePuzzle(string) {
+    const puzzle = [];
+    for (let row = 0; row < 9; row++) {
+      puzzle.push(
+        string
+          .slice(row * 9, 9 + row * 9)
+          .split('')
+          .map(x => parseInt(x, 10))
+      );
+    }
+    return puzzle;
+  }
+
+  let sum = 0;
+  for (let i = 0; i < puzzlesArr.length; i++) {
+    const puzzle = parsePuzzle(puzzlesArr[i]);
+    if (solve(puzzle)) {
+      sum += 100 * puzzle[0][0] + 10 * puzzle[0][1] + puzzle[0][2];
+    }
+  }
+
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
new file mode 100644
index 0000000000..15dafc79a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md
@@ -0,0 +1,88 @@
+---
+id: 5900f3ce1000cf542c50fee0
+title: 'Problem 97: Large non-Mersenne prime'
+challengeType: 5
+forumTopicId: 302214
+dashedName: problem-97-large-non-mersenne-prime
+---
+
+# --description--
+
+The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form $2^{6972593} − 1$; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form $2^p − 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 × 2^{7830457} + 1$.
+
+Find the last ten digits of that non-Mersenne prime in the form $multiplier × 2^{power} + 1$.
+
+# --hints--
+
+`largeNonMersennePrime(19, 6833086)` should return a string.
+
+```js
+assert(typeof largeNonMersennePrime(19, 6833086) === 'string');
+```
+
+`largeNonMersennePrime(19, 6833086)` should return the string `3637590017`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(19, 6833086), '3637590017');
+```
+
+`largeNonMersennePrime(27, 7046834)` should return the string `0130771969`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(27, 7046834), '0130771969');
+```
+
+`largeNonMersennePrime(6679881, 6679881)` should return the string `4455386113`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(6679881, 6679881), '4455386113');
+```
+
+`largeNonMersennePrime(28433, 7830457)` should return the string `8739992577`.
+
+```js
+assert.strictEqual(largeNonMersennePrime(28433, 7830457), '8739992577');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function largeNonMersennePrime(multiplier, power) {
+
+  return true;
+}
+
+largeNonMersennePrime(19, 6833086);
+```
+
+# --solutions--
+
+```js
+function largeNonMersennePrime(multiplier, power) {
+  function modStepsResults(number, other, mod, startValue, step) {
+    let result = startValue;
+    for (let i = 0; i < other; i++) {
+      result = step(number, result) % mod;
+    }
+    return result;
+  }
+
+  const numOfDigits = 10;
+  const mod = 10 ** numOfDigits;
+  const digitsAfterPower = modStepsResults(2, power, mod, 1, (a, b) => a * b);
+  const digitsAfterMultiply = modStepsResults(
+    digitsAfterPower,
+    multiplier,
+    mod,
+    0,
+    (a, b) => a + b
+  );
+  const lastDigits = (digitsAfterMultiply + 1) % mod;
+
+  return lastDigits.toString().padStart(10, '0');
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
new file mode 100644
index 0000000000..e63309053f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-98-anagramic-squares.md
@@ -0,0 +1,205 @@
+---
+id: 5900f3cf1000cf542c50fee1
+title: 'Problem 98: Anagramic squares'
+challengeType: 5
+forumTopicId: 302215
+dashedName: problem-98-anagramic-squares
+---
+
+# --description--
+
+By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: $1296 = 36^2$. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: $9216 = 96^2$. 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 the `words` array, 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 `words` array.
+
+# --hints--
+
+`anagramicSquares(['CARE', 'RACE'])` should return a number.
+
+```js
+assert(typeof anagramicSquares(['CARE', 'RACE']) === 'number');
+```
+
+`anagramicSquares(['CARE', 'RACE'])` should return `9216`.
+
+```js
+assert.strictEqual(anagramicSquares(['CARE', 'RACE']), 9216);
+```
+
+`anagramicSquares(testWords1)` should return `4761`.
+
+```js
+assert.strictEqual(anagramicSquares(_testWords1), 4761);
+```
+
+`anagramicSquares(testWords2)` should return `18769`.
+
+```js
+assert.strictEqual(anagramicSquares(_testWords2), 18769);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testWords1 = [
+  "DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH"
+];
+const _testWords2 = [
+  "A","ABILITY","ABLE","ABOUT","ABOVE","ABSENCE","ABSOLUTELY","ACADEMIC","ACCEPT","ACCESS","ACCIDENT","ACCOMPANY","ACCORDING","ACCOUNT","ACHIEVE","ACHIEVEMENT","ACID","ACQUIRE","ACROSS","ACT","ACTION","ACTIVE","ACTIVITY","ACTUAL","ACTUALLY","ADD","ADDITION","ADDITIONAL","ADDRESS","ADMINISTRATION","ADMIT","ADOPT","ADULT","ADVANCE","ADVANTAGE","ADVICE","ADVISE","AFFAIR","AFFECT","AFFORD","AFRAID","AFTER","AFTERNOON","AFTERWARDS","AGAIN","AGAINST","AGE","AGENCY","AGENT","AGO","AGREE","AGREEMENT","AHEAD","AID","AIM","AIR","AIRCRAFT","ALL","ALLOW","ALMOST","ALONE","ALONG","ALREADY","ALRIGHT","ALSO","ALTERNATIVE","ALTHOUGH","ALWAYS","AMONG","AMONGST","AMOUNT","AN","ANALYSIS","ANCIENT","AND","ANIMAL","ANNOUNCE","ANNUAL","ANOTHER","ANSWER","ANY","ANYBODY","ANYONE","ANYTHING","ANYWAY","APART","APPARENT","APPARENTLY","APPEAL","APPEAR","APPEARANCE","APPLICATION","APPLY","APPOINT","APPOINTMENT","APPROACH","APPROPRIATE","APPROVE","AREA","ARGUE","ARGUMENT","ARISE","ARM","ARMY","AROUND","ARRANGE","ARRANGEMENT","ARRIVE","ART","ARTICLE","ARTIST","AS","ASK","ASPECT","ASSEMBLY","ASSESS","ASSESSMENT","ASSET","ASSOCIATE","ASSOCIATION","ASSUME","ASSUMPTION","AT","ATMOSPHERE","ATTACH","ATTACK","ATTEMPT","ATTEND","ATTENTION","ATTITUDE","ATTRACT","ATTRACTIVE","AUDIENCE","AUTHOR","AUTHORITY","AVAILABLE","AVERAGE","AVOID","AWARD","AWARE","AWAY","AYE","BABY","BACK","BACKGROUND","BAD","BAG","BALANCE","BALL","BAND","BANK","BAR","BASE","BASIC","BASIS","BATTLE","BE","BEAR","BEAT","BEAUTIFUL","BECAUSE","BECOME","BED","BEDROOM","BEFORE","BEGIN","BEGINNING","BEHAVIOUR","BEHIND","BELIEF","BELIEVE","BELONG","BELOW","BENEATH","BENEFIT","BESIDE","BEST","BETTER","BETWEEN","BEYOND","BIG","BILL","BIND","BIRD","BIRTH","BIT","BLACK","BLOCK","BLOOD","BLOODY","BLOW","BLUE","BOARD","BOAT","BODY","BONE","BOOK","BORDER","BOTH","BOTTLE","BOTTOM","BOX","BOY","BRAIN","BRANCH","BREAK","BREATH","BRIDGE","BRIEF","BRIGHT","BRING","BROAD","BROTHER","BUDGET","BUILD","BUILDING","BURN","BUS","BUSINESS","BUSY","BUT","BUY","BY","CABINET","CALL","CAMPAIGN","CAN","CANDIDATE","CAPABLE","CAPACITY","CAPITAL","CAR","CARD","CARE","CAREER","CAREFUL","CAREFULLY","CARRY","CASE","CASH","CAT","CATCH","CATEGORY","CAUSE","CELL","CENTRAL","CENTRE","CENTURY","CERTAIN","CERTAINLY","CHAIN","CHAIR","CHAIRMAN","CHALLENGE","CHANCE","CHANGE","CHANNEL","CHAPTER","CHARACTER","CHARACTERISTIC","CHARGE","CHEAP","CHECK","CHEMICAL","CHIEF","CHILD","CHOICE","CHOOSE","CHURCH","CIRCLE","CIRCUMSTANCE","CITIZEN","CITY","CIVIL","CLAIM","CLASS","CLEAN","CLEAR","CLEARLY","CLIENT","CLIMB","CLOSE","CLOSELY","CLOTHES","CLUB","COAL","CODE","COFFEE","COLD","COLLEAGUE","COLLECT","COLLECTION","COLLEGE","COLOUR","COMBINATION","COMBINE","COME","COMMENT","COMMERCIAL","COMMISSION","COMMIT","COMMITMENT","COMMITTEE","COMMON","COMMUNICATION","COMMUNITY","COMPANY","COMPARE","COMPARISON","COMPETITION","COMPLETE","COMPLETELY","COMPLEX","COMPONENT","COMPUTER","CONCENTRATE","CONCENTRATION","CONCEPT","CONCERN","CONCERNED","CONCLUDE","CONCLUSION","CONDITION","CONDUCT","CONFERENCE","CONFIDENCE","CONFIRM","CONFLICT","CONGRESS","CONNECT","CONNECTION","CONSEQUENCE","CONSERVATIVE","CONSIDER","CONSIDERABLE","CONSIDERATION","CONSIST","CONSTANT","CONSTRUCTION","CONSUMER","CONTACT","CONTAIN","CONTENT","CONTEXT","CONTINUE","CONTRACT","CONTRAST","CONTRIBUTE","CONTRIBUTION","CONTROL","CONVENTION","CONVERSATION","COPY","CORNER","CORPORATE","CORRECT","COS","COST","COULD","COUNCIL","COUNT","COUNTRY","COUNTY","COUPLE","COURSE","COURT","COVER","CREATE","CREATION","CREDIT","CRIME","CRIMINAL","CRISIS","CRITERION","CRITICAL","CRITICISM","CROSS","CROWD","CRY","CULTURAL","CULTURE","CUP","CURRENT","CURRENTLY","CURRICULUM","CUSTOMER","CUT","DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","EACH","EAR","EARLY","EARN","EARTH","EASILY","EAST","EASY","EAT","ECONOMIC","ECONOMY","EDGE","EDITOR","EDUCATION","EDUCATIONAL","EFFECT","EFFECTIVE","EFFECTIVELY","EFFORT","EGG","EITHER","ELDERLY","ELECTION","ELEMENT","ELSE","ELSEWHERE","EMERGE","EMPHASIS","EMPLOY","EMPLOYEE","EMPLOYER","EMPLOYMENT","EMPTY","ENABLE","ENCOURAGE","END","ENEMY","ENERGY","ENGINE","ENGINEERING","ENJOY","ENOUGH","ENSURE","ENTER","ENTERPRISE","ENTIRE","ENTIRELY","ENTITLE","ENTRY","ENVIRONMENT","ENVIRONMENTAL","EQUAL","EQUALLY","EQUIPMENT","ERROR","ESCAPE","ESPECIALLY","ESSENTIAL","ESTABLISH","ESTABLISHMENT","ESTATE","ESTIMATE","EVEN","EVENING","EVENT","EVENTUALLY","EVER","EVERY","EVERYBODY","EVERYONE","EVERYTHING","EVIDENCE","EXACTLY","EXAMINATION","EXAMINE","EXAMPLE","EXCELLENT","EXCEPT","EXCHANGE","EXECUTIVE","EXERCISE","EXHIBITION","EXIST","EXISTENCE","EXISTING","EXPECT","EXPECTATION","EXPENDITURE","EXPENSE","EXPENSIVE","EXPERIENCE","EXPERIMENT","EXPERT","EXPLAIN","EXPLANATION","EXPLORE","EXPRESS","EXPRESSION","EXTEND","EXTENT","EXTERNAL","EXTRA","EXTREMELY","EYE","FACE","FACILITY","FACT","FACTOR","FACTORY","FAIL","FAILURE","FAIR","FAIRLY","FAITH","FALL","FAMILIAR","FAMILY","FAMOUS","FAR","FARM","FARMER","FASHION","FAST","FATHER","FAVOUR","FEAR","FEATURE","FEE","FEEL","FEELING","FEMALE","FEW","FIELD","FIGHT","FIGURE","FILE","FILL","FILM","FINAL","FINALLY","FINANCE","FINANCIAL","FIND","FINDING","FINE","FINGER","FINISH","FIRE","FIRM","FIRST","FISH","FIT","FIX","FLAT","FLIGHT","FLOOR","FLOW","FLOWER","FLY","FOCUS","FOLLOW","FOLLOWING","FOOD","FOOT","FOOTBALL","FOR","FORCE","FOREIGN","FOREST","FORGET","FORM","FORMAL","FORMER","FORWARD","FOUNDATION","FREE","FREEDOM","FREQUENTLY","FRESH","FRIEND","FROM","FRONT","FRUIT","FUEL","FULL","FULLY","FUNCTION","FUND","FUNNY","FURTHER","FUTURE","GAIN","GAME","GARDEN","GAS","GATE","GATHER","GENERAL","GENERALLY","GENERATE","GENERATION","GENTLEMAN","GET","GIRL","GIVE","GLASS","GO","GOAL","GOD","GOLD","GOOD","GOVERNMENT","GRANT","GREAT","GREEN","GREY","GROUND","GROUP","GROW","GROWING","GROWTH","GUEST","GUIDE","GUN","HAIR","HALF","HALL","HAND","HANDLE","HANG","HAPPEN","HAPPY","HARD","HARDLY","HATE","HAVE","HE","HEAD","HEALTH","HEAR","HEART","HEAT","HEAVY","HELL","HELP","HENCE","HER","HERE","HERSELF","HIDE","HIGH","HIGHLY","HILL","HIM","HIMSELF","HIS","HISTORICAL","HISTORY","HIT","HOLD","HOLE","HOLIDAY","HOME","HOPE","HORSE","HOSPITAL","HOT","HOTEL","HOUR","HOUSE","HOUSEHOLD","HOUSING","HOW","HOWEVER","HUGE","HUMAN","HURT","HUSBAND","I","IDEA","IDENTIFY","IF","IGNORE","ILLUSTRATE","IMAGE","IMAGINE","IMMEDIATE","IMMEDIATELY","IMPACT","IMPLICATION","IMPLY","IMPORTANCE","IMPORTANT","IMPOSE","IMPOSSIBLE","IMPRESSION","IMPROVE","IMPROVEMENT","IN","INCIDENT","INCLUDE","INCLUDING","INCOME","INCREASE","INCREASED","INCREASINGLY","INDEED","INDEPENDENT","INDEX","INDICATE","INDIVIDUAL","INDUSTRIAL","INDUSTRY","INFLUENCE","INFORM","INFORMATION","INITIAL","INITIATIVE","INJURY","INSIDE","INSIST","INSTANCE","INSTEAD","INSTITUTE","INSTITUTION","INSTRUCTION","INSTRUMENT","INSURANCE","INTEND","INTENTION","INTEREST","INTERESTED","INTERESTING","INTERNAL","INTERNATIONAL","INTERPRETATION","INTERVIEW","INTO","INTRODUCE","INTRODUCTION","INVESTIGATE","INVESTIGATION","INVESTMENT","INVITE","INVOLVE","IRON","IS","ISLAND","ISSUE","IT","ITEM","ITS","ITSELF","JOB","JOIN","JOINT","JOURNEY","JUDGE","JUMP","JUST","JUSTICE","KEEP","KEY","KID","KILL","KIND","KING","KITCHEN","KNEE","KNOW","KNOWLEDGE","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH","MACHINE","MAGAZINE","MAIN","MAINLY","MAINTAIN","MAJOR","MAJORITY","MAKE","MALE","MAN","MANAGE","MANAGEMENT","MANAGER","MANNER","MANY","MAP","MARK","MARKET","MARRIAGE","MARRIED","MARRY","MASS","MASTER","MATCH","MATERIAL","MATTER","MAY","MAYBE","ME","MEAL","MEAN","MEANING","MEANS","MEANWHILE","MEASURE","MECHANISM","MEDIA","MEDICAL","MEET","MEETING","MEMBER","MEMBERSHIP","MEMORY","MENTAL","MENTION","MERELY","MESSAGE","METAL","METHOD","MIDDLE","MIGHT","MILE","MILITARY","MILK","MIND","MINE","MINISTER","MINISTRY","MINUTE","MISS","MISTAKE","MODEL","MODERN","MODULE","MOMENT","MONEY","MONTH","MORE","MORNING","MOST","MOTHER","MOTION","MOTOR","MOUNTAIN","MOUTH","MOVE","MOVEMENT","MUCH","MURDER","MUSEUM","MUSIC","MUST","MY","MYSELF","NAME","NARROW","NATION","NATIONAL","NATURAL","NATURE","NEAR","NEARLY","NECESSARILY","NECESSARY","NECK","NEED","NEGOTIATION","NEIGHBOUR","NEITHER","NETWORK","NEVER","NEVERTHELESS","NEW","NEWS","NEWSPAPER","NEXT","NICE","NIGHT","NO","NOBODY","NOD","NOISE","NONE","NOR","NORMAL","NORMALLY","NORTH","NORTHERN","NOSE","NOT","NOTE","NOTHING","NOTICE","NOTION","NOW","NUCLEAR","NUMBER","NURSE","OBJECT","OBJECTIVE","OBSERVATION","OBSERVE","OBTAIN","OBVIOUS","OBVIOUSLY","OCCASION","OCCUR","ODD","OF","OFF","OFFENCE","OFFER","OFFICE","OFFICER","OFFICIAL","OFTEN","OIL","OKAY","OLD","ON","ONCE","ONE","ONLY","ONTO","OPEN","OPERATE","OPERATION","OPINION","OPPORTUNITY","OPPOSITION","OPTION","OR","ORDER","ORDINARY","ORGANISATION","ORGANISE","ORGANIZATION","ORIGIN","ORIGINAL","OTHER","OTHERWISE","OUGHT","OUR","OURSELVES","OUT","OUTCOME","OUTPUT","OUTSIDE","OVER","OVERALL","OWN","OWNER","PACKAGE","PAGE","PAIN","PAINT","PAINTING","PAIR","PANEL","PAPER","PARENT","PARK","PARLIAMENT","PART","PARTICULAR","PARTICULARLY","PARTLY","PARTNER","PARTY","PASS","PASSAGE","PAST","PATH","PATIENT","PATTERN","PAY","PAYMENT","PEACE","PENSION","PEOPLE","PER","PERCENT","PERFECT","PERFORM","PERFORMANCE","PERHAPS","PERIOD","PERMANENT","PERSON","PERSONAL","PERSUADE","PHASE","PHONE","PHOTOGRAPH","PHYSICAL","PICK","PICTURE","PIECE","PLACE","PLAN","PLANNING","PLANT","PLASTIC","PLATE","PLAY","PLAYER","PLEASE","PLEASURE","PLENTY","PLUS","POCKET","POINT","POLICE","POLICY","POLITICAL","POLITICS","POOL","POOR","POPULAR","POPULATION","POSITION","POSITIVE","POSSIBILITY","POSSIBLE","POSSIBLY","POST","POTENTIAL","POUND","POWER","POWERFUL","PRACTICAL","PRACTICE","PREFER","PREPARE","PRESENCE","PRESENT","PRESIDENT","PRESS","PRESSURE","PRETTY","PREVENT","PREVIOUS","PREVIOUSLY","PRICE","PRIMARY","PRIME","PRINCIPLE","PRIORITY","PRISON","PRISONER","PRIVATE","PROBABLY","PROBLEM","PROCEDURE","PROCESS","PRODUCE","PRODUCT","PRODUCTION","PROFESSIONAL","PROFIT","PROGRAM","PROGRAMME","PROGRESS","PROJECT","PROMISE","PROMOTE","PROPER","PROPERLY","PROPERTY","PROPORTION","PROPOSE","PROPOSAL","PROSPECT","PROTECT","PROTECTION","PROVE","PROVIDE","PROVIDED","PROVISION","PUB","PUBLIC","PUBLICATION","PUBLISH","PULL","PUPIL","PURPOSE","PUSH","PUT","QUALITY","QUARTER","QUESTION","QUICK","QUICKLY","QUIET","QUITE","RACE","RADIO","RAILWAY","RAIN","RAISE","RANGE","RAPIDLY","RARE","RATE","RATHER","REACH","REACTION","READ","READER","READING","READY","REAL","REALISE","REALITY","REALIZE","REALLY","REASON","REASONABLE","RECALL","RECEIVE","RECENT","RECENTLY","RECOGNISE","RECOGNITION","RECOGNIZE","RECOMMEND","RECORD","RECOVER","RED","REDUCE","REDUCTION","REFER","REFERENCE","REFLECT","REFORM","REFUSE","REGARD","REGION","REGIONAL","REGULAR","REGULATION","REJECT","RELATE","RELATION","RELATIONSHIP","RELATIVE","RELATIVELY","RELEASE","RELEVANT","RELIEF","RELIGION","RELIGIOUS","RELY","REMAIN","REMEMBER","REMIND","REMOVE","REPEAT","REPLACE","REPLY","REPORT","REPRESENT","REPRESENTATION","REPRESENTATIVE","REQUEST","REQUIRE","REQUIREMENT","RESEARCH","RESOURCE","RESPECT","RESPOND","RESPONSE","RESPONSIBILITY","RESPONSIBLE","REST","RESTAURANT","RESULT","RETAIN","RETURN","REVEAL","REVENUE","REVIEW","REVOLUTION","RICH","RIDE","RIGHT","RING","RISE","RISK","RIVER","ROAD","ROCK","ROLE","ROLL","ROOF","ROOM","ROUND","ROUTE","ROW","ROYAL","RULE","RUN","RURAL","SAFE","SAFETY","SALE","SAME","SAMPLE","SATISFY","SAVE","SAY","SCALE","SCENE","SCHEME","SCHOOL","SCIENCE","SCIENTIFIC","SCIENTIST","SCORE","SCREEN","SEA","SEARCH","SEASON","SEAT","SECOND","SECONDARY","SECRETARY","SECTION","SECTOR","SECURE","SECURITY","SEE","SEEK","SEEM","SELECT","SELECTION","SELL","SEND","SENIOR","SENSE","SENTENCE","SEPARATE","SEQUENCE","SERIES","SERIOUS","SERIOUSLY","SERVANT","SERVE","SERVICE","SESSION","SET","SETTLE","SETTLEMENT","SEVERAL","SEVERE","SEX","SEXUAL","SHAKE","SHALL","SHAPE","SHARE","SHE","SHEET","SHIP","SHOE","SHOOT","SHOP","SHORT","SHOT","SHOULD","SHOULDER","SHOUT","SHOW","SHUT","SIDE","SIGHT","SIGN","SIGNAL","SIGNIFICANCE","SIGNIFICANT","SILENCE","SIMILAR","SIMPLE","SIMPLY","SINCE","SING","SINGLE","SIR","SISTER","SIT","SITE","SITUATION","SIZE","SKILL","SKIN","SKY","SLEEP","SLIGHTLY","SLIP","SLOW","SLOWLY","SMALL","SMILE","SO","SOCIAL","SOCIETY","SOFT","SOFTWARE","SOIL","SOLDIER","SOLICITOR","SOLUTION","SOME","SOMEBODY","SOMEONE","SOMETHING","SOMETIMES","SOMEWHAT","SOMEWHERE","SON","SONG","SOON","SORRY","SORT","SOUND","SOURCE","SOUTH","SOUTHERN","SPACE","SPEAK","SPEAKER","SPECIAL","SPECIES","SPECIFIC","SPEECH","SPEED","SPEND","SPIRIT","SPORT","SPOT","SPREAD","SPRING","STAFF","STAGE","STAND","STANDARD","STAR","START","STATE","STATEMENT","STATION","STATUS","STAY","STEAL","STEP","STICK","STILL","STOCK","STONE","STOP","STORE","STORY","STRAIGHT","STRANGE","STRATEGY","STREET","STRENGTH","STRIKE","STRONG","STRONGLY","STRUCTURE","STUDENT","STUDIO","STUDY","STUFF","STYLE","SUBJECT","SUBSTANTIAL","SUCCEED","SUCCESS","SUCCESSFUL","SUCH","SUDDENLY","SUFFER","SUFFICIENT","SUGGEST","SUGGESTION","SUITABLE","SUM","SUMMER","SUN","SUPPLY","SUPPORT","SUPPOSE","SURE","SURELY","SURFACE","SURPRISE","SURROUND","SURVEY","SURVIVE","SWITCH","SYSTEM","TABLE","TAKE","TALK","TALL","TAPE","TARGET","TASK","TAX","TEA","TEACH","TEACHER","TEACHING","TEAM","TEAR","TECHNICAL","TECHNIQUE","TECHNOLOGY","TELEPHONE","TELEVISION","TELL","TEMPERATURE","TEND","TERM","TERMS","TERRIBLE","TEST","TEXT","THAN","THANK","THANKS","THAT","THE","THEATRE","THEIR","THEM","THEME","THEMSELVES","THEN","THEORY","THERE","THEREFORE","THESE","THEY","THIN","THING","THINK","THIS","THOSE","THOUGH","THOUGHT","THREAT","THREATEN","THROUGH","THROUGHOUT","THROW","THUS","TICKET","TIME","TINY","TITLE","TO","TODAY","TOGETHER","TOMORROW","TONE","TONIGHT","TOO","TOOL","TOOTH","TOP","TOTAL","TOTALLY","TOUCH","TOUR","TOWARDS","TOWN","TRACK","TRADE","TRADITION","TRADITIONAL","TRAFFIC","TRAIN","TRAINING","TRANSFER","TRANSPORT","TRAVEL","TREAT","TREATMENT","TREATY","TREE","TREND","TRIAL","TRIP","TROOP","TROUBLE","TRUE","TRUST","TRUTH","TRY","TURN","TWICE","TYPE","TYPICAL","UNABLE","UNDER","UNDERSTAND","UNDERSTANDING","UNDERTAKE","UNEMPLOYMENT","UNFORTUNATELY","UNION","UNIT","UNITED","UNIVERSITY","UNLESS","UNLIKELY","UNTIL","UP","UPON","UPPER","URBAN","US","USE","USED","USEFUL","USER","USUAL","USUALLY","VALUE","VARIATION","VARIETY","VARIOUS","VARY","VAST","VEHICLE","VERSION","VERY","VIA","VICTIM","VICTORY","VIDEO","VIEW","VILLAGE","VIOLENCE","VISION","VISIT","VISITOR","VITAL","VOICE","VOLUME","VOTE","WAGE","WAIT","WALK","WALL","WANT","WAR","WARM","WARN","WASH","WATCH","WATER","WAVE","WAY","WE","WEAK","WEAPON","WEAR","WEATHER","WEEK","WEEKEND","WEIGHT","WELCOME","WELFARE","WELL","WEST","WESTERN","WHAT","WHATEVER","WHEN","WHERE","WHEREAS","WHETHER","WHICH","WHILE","WHILST","WHITE","WHO","WHOLE","WHOM","WHOSE","WHY","WIDE","WIDELY","WIFE","WILD","WILL","WIN","WIND","WINDOW","WINE","WING","WINNER","WINTER","WISH","WITH","WITHDRAW","WITHIN","WITHOUT","WOMAN","WONDER","WONDERFUL","WOOD","WORD","WORK","WORKER","WORKING","WORKS","WORLD","WORRY","WORTH","WOULD","WRITE","WRITER","WRITING","WRONG","YARD","YEAH","YEAR","YES","YESTERDAY","YET","YOU","YOUNG","YOUR","YOURSELF","YOUTH"
+];
+```
+
+## --seed-contents--
+
+```js
+function anagramicSquares(words) {
+
+  return true;
+}
+
+// Only change code above this line
+const testWords1 = [
+"DAMAGE","DANGER","DANGEROUS","DARK","DATA","DATE","DAUGHTER","DAY","DEAD","DEAL","DEATH","DEBATE","DEBT","DECADE","DECIDE","DECISION","DECLARE","DEEP","DEFENCE","DEFENDANT","DEFINE","DEFINITION","DEGREE","DELIVER","DEMAND","DEMOCRATIC","DEMONSTRATE","DENY","DEPARTMENT","DEPEND","DEPUTY","DERIVE","DESCRIBE","DESCRIPTION","DESIGN","DESIRE","DESK","DESPITE","DESTROY","DETAIL","DETAILED","DETERMINE","DEVELOP","DEVELOPMENT","DEVICE","DIE","DIFFERENCE","DIFFERENT","DIFFICULT","DIFFICULTY","DINNER","DIRECT","DIRECTION","DIRECTLY","DIRECTOR","DISAPPEAR","DISCIPLINE","DISCOVER","DISCUSS","DISCUSSION","DISEASE","DISPLAY","DISTANCE","DISTINCTION","DISTRIBUTION","DISTRICT","DIVIDE","DIVISION","DO","DOCTOR","DOCUMENT","DOG","DOMESTIC","DOOR","DOUBLE","DOUBT","DOWN","DRAW","DRAWING","DREAM","DRESS","DRINK","DRIVE","DRIVER","DROP","DRUG","DRY","DUE","DURING","DUTY","LABOUR","LACK","LADY","LAND","LANGUAGE","LARGE","LARGELY","LAST","LATE","LATER","LATTER","LAUGH","LAUNCH","LAW","LAWYER","LAY","LEAD","LEADER","LEADERSHIP","LEADING","LEAF","LEAGUE","LEAN","LEARN","LEAST","LEAVE","LEFT","LEG","LEGAL","LEGISLATION","LENGTH","LESS","LET","LETTER","LEVEL","LIABILITY","LIBERAL","LIBRARY","LIE","LIFE","LIFT","LIGHT","LIKE","LIKELY","LIMIT","LIMITED","LINE","LINK","LIP","LIST","LISTEN","LITERATURE","LITTLE","LIVE","LIVING","LOAN","LOCAL","LOCATION","LONG","LOOK","LORD","LOSE","LOSS","LOT","LOVE","LOVELY","LOW","LUNCH"
+];
+
+anagramicSquares(testWords1);
+```
+
+# --solutions--
+
+```js
+function anagramicSquares(words) {
+  // Based on https://www.mathblog.dk/project-euler-98-anagrams-square-numbers/
+  function findMaximumSquare(squares, word1, word2) {
+    let maximumSquare = 0;
+
+    for (let i = 0; i < squares.length; i++) {
+      const length = squares[i].toString().length;
+
+      if (length < word1.length) {
+        continue;
+      }
+      if (length > word1.length) {
+        break;
+      }
+
+      const word1Square = squares[i];
+      const letterToDigit = mapLettersToDigits(word1, word1Square);
+
+      const noProperMappingExist = Object.keys(letterToDigit).length === 0;
+      if (noProperMappingExist) {
+        continue;
+      }
+
+      const word2Square = getNumberFromMapping(word2, letterToDigit);
+      if (word2Square === 0) {
+        continue;
+      }
+
+      const doesWord2SquareExist = squares.indexOf(word2Square) !== -1;
+      if (doesWord2SquareExist) {
+        const pairMaximum = Math.max(word1Square, word2Square);
+        maximumSquare = Math.max(maximumSquare, pairMaximum);
+      }
+    }
+    return maximumSquare;
+  }
+
+  function getNumberFromMapping(word, letterToDigit) {
+    const wouldNumberHaveLeadingZero = letterToDigit[word[0]] === 0;
+    if (wouldNumberHaveLeadingZero) {
+      return 0;
+    }
+
+    let number = 0;
+    for (let i = 0; i < word.length; i++) {
+      number = number * 10 + letterToDigit[word[i]];
+    }
+    return number;
+  }
+
+  function mapLettersToDigits(word, square) {
+    const letterToDigit = {};
+    for (let j = word.length - 1; j >= 0; j--) {
+      const curDigit = square % 10;
+      square = Math.floor(square / 10);
+
+      const curLetter = word[j];
+
+      const isLetterRepeated = letterToDigit.hasOwnProperty(curLetter);
+      if (isLetterRepeated) {
+        const isLetterUsedForTheSameDigit =
+          letterToDigit[curLetter] === curDigit;
+        if (isLetterUsedForTheSameDigit) {
+          continue;
+        }
+
+        return {};
+      }
+
+      const isDigitUsed = Object.values(letterToDigit).indexOf(curDigit) !== -1;
+      if (isDigitUsed) {
+        return {};
+      }
+
+      letterToDigit[curLetter] = curDigit;
+    }
+    return letterToDigit;
+  }
+
+  function groupWordsWithSameLetters(words) {
+    const lettersToWords = {};
+    for (let i = 0; i < words.length; i++) {
+      const word = words[i];
+      const sortedLetters = word.split('').sort().join('');
+      if (!lettersToWords.hasOwnProperty(sortedLetters)) {
+        lettersToWords[sortedLetters] = [];
+      }
+      lettersToWords[sortedLetters].push(word);
+    }
+    return lettersToWords;
+  }
+
+  const lettersToWords = groupWordsWithSameLetters(words);
+
+  const anagrams = Object.keys(lettersToWords).filter(
+    letters => lettersToWords[letters].length > 1
+  );
+  const lengthOfLongestAnagram = anagrams
+    .map(anagram => anagram.length)
+    .sort((a, b) => b - a)[0];
+
+  const squares = [];
+  const numberLimit = (10 ** lengthOfLongestAnagram) ** 0.5;
+  for (let number = 2; number < numberLimit; number++) {
+    const square = number ** 2;
+    squares.push(square);
+  }
+
+  let largestSquare = 0;
+  for (let i = 0; i < anagrams.length; i++) {
+    const curWords = lettersToWords[anagrams[i]];
+
+    for (let j = 0; j < curWords.length; j++) {
+      for (let k = j + 1; k < curWords.length; k++) {
+        const squareValue = findMaximumSquare(
+          squares,
+          curWords[j],
+          curWords[k]
+        );
+        if (squareValue > largestSquare) {
+          largestSquare = squareValue;
+        }
+      }
+    }
+  }
+
+  return largestSquare;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
new file mode 100644
index 0000000000..07d9a48f01
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/project-euler/problem-99-largest-exponential.md
@@ -0,0 +1,83 @@
+---
+id: 5900f3d01000cf542c50fee2
+title: 'Problem 99: Largest exponential'
+challengeType: 5
+forumTopicId: 302216
+dashedName: problem-99-largest-exponential
+---
+
+# --description--
+
+Comparing two numbers written in index form like $2^{11}$ and $3^7$ is not difficult, as any calculator would confirm that $2^{11} = 2048 &lt; 3^7 = 2187$.
+
+However, confirming that $632382^{518061} &lt; 519432^{525806}$ would be much more difficult, as both numbers contain over three million digits.
+
+Using the 2D `baseExp` array of base/exponent pairs, determine pair with the greatest numerical value and return it.
+
+# --hints--
+
+`largestExponential(testArray1)` should return an array.
+
+```js
+assert(Array.isArray(largestExponential(_testArray1)));
+```
+
+`largestExponential(testArray1)` should return `[840237, 507276]`.
+
+```js
+assert.deepEqual(largestExponential(_testArray1), [840237, 507276]);
+```
+
+`largestExponential(testArray2)` should return `[895447, 504922]`.
+
+```js
+assert.deepEqual(largestExponential(_testArray2), [895447, 504922]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const _testArray1 = [
+  [492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123]
+];
+const _testArray2 = [
+  [519432,525806],[632382,518061],[78864,613712],[466580,530130],[780495,510032],[525895,525320],[15991,714883],[960290,502358],[760018,511029],[166800,575487],[210884,564478],[555151,523163],[681146,515199],[563395,522587],[738250,512126],[923525,503780],[595148,520429],[177108,572629],[750923,511482],[440902,532446],[881418,505504],[422489,534197],[979858,501616],[685893,514935],[747477,511661],[167214,575367],[234140,559696],[940238,503122],[728969,512609],[232083,560102],[900971,504694],[688801,514772],[189664,569402],[891022,505104],[445689,531996],[119570,591871],[821453,508118],[371084,539600],[911745,504251],[623655,518600],[144361,582486],[352442,541775],[420726,534367],[295298,549387],[6530,787777],[468397,529976],[672336,515696],[431861,533289],[84228,610150],[805376,508857],[444409,532117],[33833,663511],[381850,538396],[402931,536157],[92901,604930],[304825,548004],[731917,512452],[753734,511344],[51894,637373],[151578,580103],[295075,549421],[303590,548183],[333594,544123],[683952,515042],[60090,628880],[951420,502692],[28335,674991],[714940,513349],[343858,542826],[549279,523586],[804571,508887],[260653,554881],[291399,549966],[402342,536213],[408889,535550],[40328,652524],[375856,539061],[768907,510590],[165993,575715],[976327,501755],[898500,504795],[360404,540830],[478714,529095],[694144,514472],[488726,528258],[841380,507226],[328012,544839],[22389,690868],[604053,519852],[329514,544641],[772965,510390],[492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123],[597706,520257],[310484,547206],[944468,502959],[121283,591152],[451131,531507],[566499,522367],[425373,533918],[40240,652665],[39130,654392],[714926,513355],[469219,529903],[806929,508783],[287970,550487],[92189,605332],[103841,599094],[671839,515725],[452048,531421],[987837,501323],[935192,503321],[88585,607450],[613883,519216],[144551,582413],[647359,517155],[213902,563816],[184120,570789],[258126,555322],[502546,527130],[407655,535678],[401528,536306],[477490,529193],[841085,507237],[732831,512408],[833000,507595],[904694,504542],[581435,521348],[455545,531110],[873558,505829],[94916,603796],[720176,513068],[545034,523891],[246348,557409],[556452,523079],[832015,507634],[173663,573564],[502634,527125],[250732,556611],[569786,522139],[216919,563178],[521815,525623],[92304,605270],[164446,576167],[753413,511364],[11410,740712],[448845,531712],[925072,503725],[564888,522477],[7062,780812],[641155,517535],[738878,512100],[636204,517828],[372540,539436],[443162,532237],[571192,522042],[655350,516680],[299741,548735],[581914,521307],[965471,502156],[513441,526277],[808682,508700],[237589,559034],[543300,524025],[804712,508889],[247511,557192],[543486,524008],[504383,526992],[326529,545039],[792493,509458],[86033,609017],[126554,589005],[579379,521481],[948026,502823],[404777,535969],[265767,554022],[266876,553840],[46631,643714],[492397,527958],[856106,506581],[795757,509305],[748946,511584],[294694,549480],[409781,535463],[775887,510253],[543747,523991],[210592,564536],[517119,525990],[520253,525751],[247926,557124],[592141,520626],[346580,542492],[544969,523902],[506501,526817],[244520,557738],[144745,582349],[69274,620858],[292620,549784],[926027,503687],[736320,512225],[515528,526113],[407549,535688],[848089,506927],[24141,685711],[9224,757964],[980684,501586],[175259,573121],[489160,528216],[878970,505604],[969546,502002],[525207,525365],[690461,514675],[156510,578551],[659778,516426],[468739,529945],[765252,510770],[76703,615230],[165151,575959],[29779,671736],[928865,503569],[577538,521605],[927555,503618],[185377,570477],[974756,501809],[800130,509093],[217016,563153],[365709,540216],[774508,510320],[588716,520851],[631673,518104],[954076,502590],[777828,510161],[990659,501222],[597799,520254],[786905,509727],[512547,526348],[756449,511212],[869787,505988],[653747,516779],[84623,609900],[839698,507295],[30159,670909],[797275,509234],[678136,515373],[897144,504851],[989554,501263],[413292,535106],[55297,633667],[788650,509637],[486748,528417],[150724,580377],[56434,632490],[77207,614869],[588631,520859],[611619,519367],[100006,601055],[528924,525093],[190225,569257],[851155,506789],[682593,515114],[613043,519275],[514673,526183],[877634,505655],[878905,505602],[1926,914951],[613245,519259],[152481,579816],[841774,507203],[71060,619442],[865335,506175],[90244,606469],[302156,548388],[399059,536557],[478465,529113],[558601,522925],[69132,620966],[267663,553700],[988276,501310],[378354,538787],[529909,525014],[161733,576968],[758541,511109],[823425,508024],[149821,580667],[269258,553438],[481152,528891],[120871,591322],[972322,501901],[981350,501567],[676129,515483],[950860,502717],[119000,592114],[392252,537272],[191618,568919],[946699,502874],[289555,550247],[799322,509139],[703886,513942],[194812,568143],[261823,554685],[203052,566221],[217330,563093],[734748,512313],[391759,537328],[807052,508777],[564467,522510],[59186,629748],[113447,594545],[518063,525916],[905944,504492],[613922,519213],[439093,532607],[445946,531981],[230530,560399],[297887,549007],[459029,530797],[403692,536075],[855118,506616],[963127,502245],[841711,507208],[407411,535699],[924729,503735],[914823,504132],[333725,544101],[176345,572832],[912507,504225],[411273,535308],[259774,555036],[632853,518038],[119723,591801],[163902,576321],[22691,689944],[402427,536212],[175769,572988],[837260,507402],[603432,519893],[313679,546767],[538165,524394],[549026,523608],[61083,627945],[898345,504798],[992556,501153],[369999,539727],[32847,665404],[891292,505088],[152715,579732],[824104,507997],[234057,559711],[730507,512532],[960529,502340],[388395,537687],[958170,502437],[57105,631806],[186025,570311],[993043,501133],[576770,521664],[215319,563513],[927342,503628],[521353,525666],[39563,653705],[752516,511408],[110755,595770],[309749,547305],[374379,539224],[919184,503952],[990652,501226],[647780,517135],[187177,570017],[168938,574877],[649558,517023],[278126,552016],[162039,576868],[658512,516499],[498115,527486],[896583,504868],[561170,522740],[747772,511647],[775093,510294],[652081,516882],[724905,512824],[499707,527365],[47388,642755],[646668,517204],[571700,522007],[180430,571747],[710015,513617],[435522,532941],[98137,602041],[759176,511070],[486124,528467],[526942,525236],[878921,505604],[408313,535602],[926980,503640],[882353,505459],[566887,522345],[3326,853312],[911981,504248],[416309,534800],[392991,537199],[622829,518651],[148647,581055],[496483,527624],[666314,516044],[48562,641293],[672618,515684],[443676,532187],[274065,552661],[265386,554079],[347668,542358],[31816,667448],[181575,571446],[961289,502320],[365689,540214],[987950,501317],[932299,503440],[27388,677243],[746701,511701],[492258,527969],[147823,581323],[57918,630985],[838849,507333],[678038,515375],[27852,676130],[850241,506828],[818403,508253],[131717,587014],[850216,506834],[904848,504529],[189758,569380],[392845,537217],[470876,529761],[925353,503711],[285431,550877],[454098,531234],[823910,508003],[318493,546112],[766067,510730],[261277,554775],[421530,534289],[694130,514478],[120439,591498],[213308,563949],[854063,506662],[365255,540263],[165437,575872],[662240,516281],[289970,550181],[847977,506933],[546083,523816],[413252,535113],[975829,501767],[361540,540701],[235522,559435],[224643,561577],[736350,512229],[328303,544808],[35022,661330],[307838,547578],[474366,529458],[873755,505819],[73978,617220],[827387,507845],[670830,515791],[326511,545034],[309909,547285],[400970,536363],[884827,505352],[718307,513175],[28462,674699],[599384,520150],[253565,556111],[284009,551093],[343403,542876],[446557,531921],[992372,501160],[961601,502308],[696629,514342],[919537,503945],[894709,504944],[892201,505051],[358160,541097],[448503,531745],[832156,507636],[920045,503924],[926137,503675],[416754,534757],[254422,555966],[92498,605151],[826833,507873],[660716,516371],[689335,514746],[160045,577467],[814642,508425],[969939,501993],[242856,558047],[76302,615517],[472083,529653],[587101,520964],[99066,601543],[498005,527503],[709800,513624],[708000,513716],[20171,698134],[285020,550936],[266564,553891],[981563,501557],[846502,506991],[334,1190800],[209268,564829],[9844,752610],[996519,501007],[410059,535426],[432931,533188],[848012,506929],[966803,502110],[983434,501486],[160700,577267],[504374,526989],[832061,507640],[392825,537214],[443842,532165],[440352,532492],[745125,511776],[13718,726392],[661753,516312],[70500,619875],[436952,532814],[424724,533973],[21954,692224],[262490,554567],[716622,513264],[907584,504425],[60086,628882],[837123,507412],[971345,501940],[947162,502855],[139920,584021],[68330,621624],[666452,516038],[731446,512481],[953350,502619],[183157,571042],[845400,507045],[651548,516910],[20399,697344],[861779,506331],[629771,518229],[801706,509026],[189207,569512],[737501,512168],[719272,513115],[479285,529045],[136046,585401],[896746,504860],[891735,505067],[684771,514999],[865309,506184],[379066,538702],[503117,527090],[621780,518717],[209518,564775],[677135,515423],[987500,501340],[197049,567613],[329315,544673],[236756,559196],[357092,541226],[520440,525733],[213471,563911],[956852,502490],[702223,514032],[404943,535955],[178880,572152],[689477,514734],[691351,514630],[866669,506128],[370561,539656],[739805,512051],[71060,619441],[624861,518534],[261660,554714],[366137,540160],[166054,575698],[601878,519990],[153445,579501],[279899,551729],[379166,538691],[423209,534125],[675310,515526],[145641,582050],[691353,514627],[917468,504026],[284778,550976],[81040,612235],[161699,576978],[616394,519057],[767490,510661],[156896,578431],[427408,533714],[254849,555884],[737217,512182],[897133,504851],[203815,566051],[270822,553189],[135854,585475],[778805,510111],[784373,509847],[305426,547921],[733418,512375],[732087,512448],[540668,524215],[702898,513996],[628057,518328],[640280,517587],[422405,534204],[10604,746569],[746038,511733],[839808,507293],[457417,530938],[479030,529064],[341758,543090],[620223,518824],[251661,556451],[561790,522696],[497733,527521],[724201,512863],[489217,528217],[415623,534867],[624610,518548],[847541,506953],[432295,533249],[400391,536421],[961158,502319],[139173,584284],[421225,534315],[579083,521501],[74274,617000],[701142,514087],[374465,539219],[217814,562985],[358972,540995],[88629,607424],[288597,550389],[285819,550812],[538400,524385],[809930,508645],[738326,512126],[955461,502535],[163829,576343],[826475,507891],[376488,538987],[102234,599905],[114650,594002],[52815,636341],[434037,533082],[804744,508880],[98385,601905],[856620,506559],[220057,562517],[844734,507078],[150677,580387],[558697,522917],[621751,518719],[207067,565321],[135297,585677],[932968,503404],[604456,519822],[579728,521462],[244138,557813],[706487,513800],[711627,513523],[853833,506674],[497220,527562],[59428,629511],[564845,522486],[623621,518603],[242689,558077],[125091,589591],[363819,540432],[686453,514901],[656813,516594],[489901,528155],[386380,537905],[542819,524052],[243987,557841],[693412,514514],[488484,528271],[896331,504881],[336730,543721],[728298,512647],[604215,519840],[153729,579413],[595687,520398],[540360,524240],[245779,557511],[924873,503730],[509628,526577],[528523,525122],[3509,847707],[522756,525555],[895447,504922],[44840,646067],[45860,644715],[463487,530404],[398164,536654],[894483,504959],[619415,518874],[966306,502129],[990922,501212],[835756,507474],[548881,523618],[453578,531282],[474993,529410],[80085,612879],[737091,512193],[50789,638638],[979768,501620],[792018,509483],[665001,516122],[86552,608694],[462772,530469],[589233,520821],[891694,505072],[592605,520594],[209645,564741],[42531,649269],[554376,523226],[803814,508929],[334157,544042],[175836,572970],[868379,506051],[658166,516520],[278203,551995],[966198,502126],[627162,518387],[296774,549165],[311803,547027],[843797,507118],[702304,514032],[563875,522553],[33103,664910],[191932,568841],[543514,524006],[506835,526794],[868368,506052],[847025,506971],[678623,515342],[876139,505726],[571997,521984],[598632,520198],[213590,563892],[625404,518497],[726508,512738],[689426,514738],[332495,544264],[411366,535302],[242546,558110],[315209,546555],[797544,509219],[93889,604371],[858879,506454],[124906,589666],[449072,531693],[235960,559345],[642403,517454],[720567,513047],[705534,513858],[603692,519870],[488137,528302],[157370,578285],[63515,625730],[666326,516041],[619226,518883],[443613,532186],[597717,520257],[96225,603069],[86940,608450],[40725,651929],[460976,530625],[268875,553508],[270671,553214],[363254,540500],[384248,538137],[762889,510892],[377941,538833],[278878,551890],[176615,572755],[860008,506412],[944392,502967],[608395,519571],[225283,561450],[45095,645728],[333798,544090],[625733,518476],[995584,501037],[506135,526853],[238050,558952],[557943,522972],[530978,524938],[634244,517949],[177168,572616],[85200,609541],[953043,502630],[523661,525484],[999295,500902],[840803,507246],[961490,502312],[471747,529685],[380705,538523],[911180,504275],[334149,544046],[478992,529065],[325789,545133],[335884,543826],[426976,533760],[749007,511582],[667067,516000],[607586,519623],[674054,515599],[188534,569675],[565185,522464],[172090,573988],[87592,608052],[907432,504424],[8912,760841],[928318,503590],[757917,511138],[718693,513153],[315141,546566],[728326,512645],[353492,541647],[638429,517695],[628892,518280],[877286,505672],[620895,518778],[385878,537959],[423311,534113],[633501,517997],[884833,505360],[883402,505416],[999665,500894],[708395,513697],[548142,523667],[756491,511205],[987352,501340],[766520,510705],[591775,520647],[833758,507563],[843890,507108],[925551,503698],[74816,616598],[646942,517187],[354923,541481],[256291,555638],[634470,517942],[930904,503494],[134221,586071],[282663,551304],[986070,501394],[123636,590176],[123678,590164],[481717,528841],[423076,534137],[866246,506145],[93313,604697],[783632,509880],[317066,546304],[502977,527103],[141272,583545],[71708,618938],[617748,518975],[581190,521362],[193824,568382],[682368,515131],[352956,541712],[351375,541905],[505362,526909],[905165,504518],[128645,588188],[267143,553787],[158409,577965],[482776,528754],[628896,518282],[485233,528547],[563606,522574],[111001,595655],[115920,593445],[365510,540237],[959724,502374],[938763,503184],[930044,503520],[970959,501956],[913658,504176],[68117,621790],[989729,501253],[567697,522288],[820427,508163],[54236,634794],[291557,549938],[124961,589646],[403177,536130],[405421,535899],[410233,535417],[815111,508403],[213176,563974],[83099,610879],[998588,500934],[513640,526263],[129817,587733],[1820,921851],[287584,550539],[299160,548820],[860621,506386],[529258,525059],[586297,521017],[953406,502616],[441234,532410],[986217,501386],[781938,509957],[461247,530595],[735424,512277],[146623,581722],[839838,507288],[510667,526494],[935085,503327],[737523,512167],[303455,548204],[992779,501145],[60240,628739],[939095,503174],[794368,509370],[501825,527189],[459028,530798],[884641,505363],[512287,526364],[835165,507499],[307723,547590],[160587,577304],[735043,512300],[493289,527887],[110717,595785],[306480,547772],[318593,546089],[179810,571911],[200531,566799],[314999,546580],[197020,567622],[301465,548487],[237808,559000],[131944,586923],[882527,505449],[468117,530003],[711319,513541],[156240,578628],[965452,502162],[992756,501148],[437959,532715],[739938,512046],[614249,519196],[391496,537356],[62746,626418],[688215,514806],[75501,616091],[883573,505412],[558824,522910],[759371,511061],[173913,573489],[891351,505089],[727464,512693],[164833,576051],[812317,508529],[540320,524243],[698061,514257],[69149,620952],[471673,529694],[159092,577753],[428134,533653],[89997,606608],[711061,513557],[779403,510081],[203327,566155],[798176,509187],[667688,515963],[636120,517833],[137410,584913],[217615,563034],[556887,523038],[667229,515991],[672276,515708],[325361,545187],[172115,573985],[13846,725685]
+];
+```
+
+## --seed-contents--
+
+```js
+function largestExponential(baseExp) {
+
+  return true;
+}
+
+// Only change code above this line
+
+const testArray1 = [
+  [492798,527927],[30125,670983],[895603,504906],[450785,531539],[840237,507276],[380711,538522],[63577,625673],[76801,615157],[502694,527123]
+];
+
+largestExponential(testArray1);
+```
+
+# --solutions--
+
+```js
+function largestExponential(baseExp) {
+  let maximum = 0;
+  let indexOfMaximum = 0;
+  for (let i = 1; i < baseExp.length; i++) {
+    const curValue = Math.log(baseExp[i][0]) * baseExp[i][1];
+    if (curValue > maximum) {
+      maximum = curValue;
+      indexOfMaximum = i;
+    }
+  }
+
+  return baseExp[indexOfMaximum];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/100-doors.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/100-doors.md
new file mode 100644
index 0000000000..e791c06558
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/100-doors.md
@@ -0,0 +1,67 @@
+---
+id: 594810f028c0303b75339acb
+title: 100 doors
+challengeType: 5
+forumTopicId: 302217
+dashedName: 100-doors
+---
+
+# --description--
+
+There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and 'toggle' the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (i.e., door #2, #4, #6, ...) and toggle it. The third time, visit every 3rd door (i.e., door #3, #6, #9, ...), etc., until you only visit the 100th door.
+
+# --instructions--
+
+Implement a function to determine the state of the doors after the last pass. Return the final result in an array, with only the door number included in the array if it is open.
+
+# --hints--
+
+`getFinalOpenedDoors` should be a function.
+
+```js
+assert(typeof getFinalOpenedDoors === 'function');
+```
+
+`getFinalOpenedDoors` should return an array.
+
+```js
+assert(Array.isArray(getFinalOpenedDoors(100)));
+```
+
+`getFinalOpenedDoors` should produce the correct result.
+
+```js
+assert.deepEqual(getFinalOpenedDoors(100), solution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const solution = [1, 4, 9, 16, 25, 36, 49, 64, 81, 100];
+```
+
+## --seed-contents--
+
+```js
+function getFinalOpenedDoors(numDoors) {
+
+}
+```
+
+# --solutions--
+
+```js
+function getFinalOpenedDoors(numDoors) {
+  // this is the final pattern (always squares).
+  // thus, the most efficient solution simply returns an array of squares up to numDoors).
+  const finalState = [];
+  let i = 1;
+  while (Math.pow(i, 2) <= numDoors) {
+    finalState.push(Math.pow(i, 2));
+    i++;
+  }
+  return finalState;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/24-game.md
new file mode 100644
index 0000000000..80b03ca6a5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/24-game.md
@@ -0,0 +1,203 @@
+---
+id: 5951e88f64ebf159166a1176
+title: 24 game
+challengeType: 5
+forumTopicId: 302218
+dashedName: 24-game
+---
+
+# --description--
+
+The [24 Game](https://en.wikipedia.org/wiki/24_Game) tests a person's mental arithmetic.
+
+The aim of the game is to arrange four numbers in a way that when evaluated, the result is 24
+
+# --instructions--
+
+Implement a function that takes a string of four digits as its argument, with each digit from 1 to 9 (inclusive) with repetitions allowed, and returns an arithmetic expression that evaluates to the number 24. If no such solution exists, return "no solution exists".
+
+**Rules:**
+<ul>
+  <li> Only the following operators/functions are allowed: multiplication, division, addition, subtraction. </li>
+  <li> Division should use floating point or rational arithmetic, etc, to preserve remainders. </li>
+  <li> Forming multiple digit numbers from the supplied digits is disallowed. (So an answer of 12+12 when given 1, 2, 2, and 1 is wrong). </li>
+  <li> The order of the digits when given does not have to be preserved. </li>
+</ul>
+
+| Example input                 | Example output            |
+| ----------------------------- | ------------------------- |
+| <code>solve24("4878");</code> | <code>(7-8/8)\*4</code>   |
+| <code>solve24("1234");</code> | <code>3\*1\*4\*2</code>   |
+| <code>solve24("6789");</code> | <code>(6\*8)/(9-7)</code> |
+| <code>solve24("1127");</code> | <code>(1+7)\*(2+1)</code> |
+
+# --hints--
+
+`solve24` should be a function.
+
+```js
+assert(typeof solve24 === 'function');
+```
+
+`solve24("4878")` should return `(7-8/8)*4` or `4*(7-8/8)`
+
+```js
+assert(include(answers[0], removeParentheses(solve24(testCases[0]))));
+```
+
+`solve24("1234")` should return any arrangement of `1*2*3*4`
+
+```js
+assert(include(answers[1], removeParentheses(solve24(testCases[1]))));
+```
+
+`solve24("6789")` should return `(6*8)/(9-7)` or `(8*6)/(9-7)`
+
+```js
+assert(include(answers[2], removeParentheses(solve24(testCases[2]))));
+```
+
+`solve24("1127")` should return a permutation of `(1+7)*(1+2)`
+
+```js
+assert(include(answers[3], removeParentheses(solve24(testCases[3]))));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  '4878',
+  '1234',
+  '6789',
+  '1127'
+];
+
+const answers = [
+  ['(7-8/8)*4', '4*(7-8/8)', '(4-8+7)*8', '(4+7-8)*8', '(7+4-8)*8', '(7-8+4)*8', '8*(4-8+7)', '8*(4+7-8)', '8*(7+4-8)', '8*(7-8+4)'],
+  ['1*2*3*4', '1*2*4*3', '1*3*2*4', '1*3*4*2', '1*4*2*3', '1*4*3*2', '2*1*3*4', '2*1*4*3', '2*3*1*4', '2*3*4*1', '2*4*3*1', '2*4*1*3', '3*1*2*4', '3*1*4*2', '3*2*1*4', '3*2*4*1', '3*4*1*2', '3*4*2*1', '4*1*2*3', '4*1*3*2', '4*2*1*3', '4*2*3*1', '4*3*1*2', '4*3*2*1', '(1+2+3)*4', '(1+3+2)*4', '(2+1+3)*4', '(2+3+1)*4', '(3+1+2)*4', '(3+2+1)*4', '4*(1+2+3)', '4*(2+1+3)', '4*(2+3+1)', '4*(3+1+2)', '4*(3+2+1)'],
+  ['(6*8)/(9-7)', '(8*6)/(9-7)', '6*8/(9-7)', '8*6/(9-7)'],
+  ['(1+7)*(2+1)', '(1+7)*(1+2)', '(1+2)*(1+7)', '(1+2)*(7+1)', '(2+1)*(1+7)', '(7+1)*(2+1)']
+];
+
+function include(ansArr, res) {
+  const index = ansArr.indexOf(res);
+  return index >= 0;
+}
+
+//The main method for detecting single parentheses
+function removeParentheses(ans) {
+  for (let i = 0; i < ans.length; i++) {
+    if (!isNaN(ans[i])) {
+      ans = removeParenthesesHelper(ans, i);
+    }
+  }
+  return ans;
+}
+
+//Helper to remove left and right parantheses
+function removeParenthesesHelper(ans, i) {
+  while (i > 0 && i < ans.length - 1) {
+    if (ans[i - 1] === '(' && ans[i + 1] === ')') {
+      //Paranthesis detected. Remove them.
+      ans = replaceChar(ans, '', i - 1);
+      ans = replaceChar(ans, '', i);
+      i--;
+    } else {
+      return ans;
+    }
+  }
+  return ans;
+}
+
+//Replace a character at a given index for the provided character
+function replaceChar(origString, replaceChar, index) {
+  let firstPart = origString.substr(0, index);
+  let lastPart = origString.substr(index + 1);
+  let newString = firstPart + replaceChar + lastPart;
+  return newString;
+}
+```
+
+## --seed-contents--
+
+```js
+function solve24 (numStr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function solve24(numStr) {
+  const digitsArr = numStr.split('');
+  const answers = [];
+
+  const digitPermutations = [];
+  const operatorPermutations = [];
+
+  function generateDigitPermutations (digits, permutations = []) {
+    if (digits.length === 0) {
+      digitPermutations.push(permutations);
+    }
+    else {
+      for (let i = 0; i < digits.length; i++) {
+        const curr = digits.slice();
+        const next = curr.splice(i, 1);
+        generateDigitPermutations(curr.slice(), permutations.concat(next));
+      }
+    }
+  }
+
+  function generateOperatorPermutations (permutations = []) {
+    const operators = ['+', '-', '*', '/'];
+    if (permutations.length === 3) {
+      operatorPermutations.push(permutations);
+    }
+    else {
+      for (let i = 0; i < operators.length; i++) {
+        const curr = permutations.slice();
+        curr.push(operators[i]);
+        generateOperatorPermutations(curr);
+      }
+    }
+  }
+
+  generateDigitPermutations(digitsArr);
+  generateOperatorPermutations();
+
+  interleave();
+
+  return answers[0];
+
+  function interleave () {
+    for (let i = 0; i < digitPermutations.length; i++) {
+      for (let j = 0; j < operatorPermutations.length; j++) {
+        const d = digitPermutations[i];
+        const o = operatorPermutations[j];
+        const perm = [
+          `${d[0]}${o[0]}${d[1]}${o[1]}${d[2]}${o[2]}${d[3]}`,
+          `(${d[0]}${o[0]}${d[1]})${o[1]}${d[2]}${o[2]}${d[3]}`,
+          `${d[0]}${o[0]}(${d[1]}${o[1]}${d[2]})${o[2]}${d[3]}`,
+          `${d[0]}${o[0]}${d[1]}${o[1]}(${d[2]}${o[2]}${d[3]})`,
+          `${d[0]}${o[0]}(${d[1]}${o[1]}${d[2]}${o[2]}${d[3]})`,
+          `(${d[0]}${o[0]}${d[1]}${o[1]}${d[2]})${o[2]}${d[3]}`,
+          `(${d[0]}${o[0]}${d[1]})${o[1]}(${d[2]}${o[2]}${d[3]})`
+        ];
+
+        perm.forEach(combination => {
+          const res = eval(combination);
+
+          if (res === 24) {
+            return answers.push(combination);
+          }
+        });
+      }
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
new file mode 100644
index 0000000000..66eecef2be
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/9-billion-names-of-god-the-integer.md
@@ -0,0 +1,116 @@
+---
+id: 5949b579404977fbaefcd736
+title: 9 billion names of God the integer
+challengeType: 5
+forumTopicId: 302219
+dashedName: 9-billion-names-of-god-the-integer
+---
+
+# --description--
+
+This task is a variation of the [short story by Arthur C. Clarke](<https://en.wikipedia.org/wiki/The Nine Billion Names of God#Plot_summary> "wp: The Nine Billion Names of God#Plot_summary").
+
+(Solvers should be aware of the consequences of completing this task.)
+
+In detail, to specify what is meant by a "name":
+
+<ul>
+  <li>The integer 1 has 1 name "1".</li>
+  <li>The integer 2 has 2 names "1+1" and "2".</li>
+  <li>The integer 3 has 3 names "1+1+1", "2+1",  and "3".</li>
+  <li>The integer 4 has 5 names "1+1+1+1", "2+1+1", "2+2", "3+1", "4".</li>
+  <li>The integer 5 has 7 names "1+1+1+1+1", "2+1+1+1", "2+2+1", "3+1+1", "3+2", "4+1", "5".</li>
+</ul>
+
+This can be visualized in the following form:
+
+<pre>          1
+        1   1
+      1   1   1
+    1   2   1   1
+  1   2   2   1   1
+1   3   3   2   1   1
+</pre>
+
+Where row $n$ corresponds to integer $n$, and each column $C$ in row $m$ from left to right corresponds to the number of names beginning with $C$.
+
+Optionally note that the sum of the $n$-th row $P(n)$ is the integer partition function.
+
+# --instructions--
+
+Implement a function that returns the sum of the $n$-th row.
+
+# --hints--
+
+`numberOfNames` should be function.
+
+```js
+assert(typeof numberOfNames === 'function');
+```
+
+`numberOfNames(5)` should equal 7.
+
+```js
+assert.equal(numberOfNames(5), 7);
+```
+
+`numberOfNames(12)` should equal 77.
+
+```js
+assert.equal(numberOfNames(12), 77);
+```
+
+`numberOfNames(18)` should equal 385.
+
+```js
+assert.equal(numberOfNames(18), 385);
+```
+
+`numberOfNames(23)` should equal 1255.
+
+```js
+assert.equal(numberOfNames(23), 1255);
+```
+
+`numberOfNames(42)` should equal 53174.
+
+```js
+assert.equal(numberOfNames(42), 53174);
+```
+
+`numberOfNames(123)` should equal 2552338241.
+
+```js
+assert.equal(numberOfNames(123), 2552338241);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function numberOfNames(num) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function numberOfNames(num) {
+  const cache = [
+    [1]
+  ];
+  for (let l = cache.length; l < num + 1; l++) {
+    let Aa;
+    let Mi;
+    const r = [0];
+    for (let x = 1; x < l + 1; x++) {
+      r.push(r[r.length - 1] + (Aa = cache[l - x < 0 ? cache.length - (l - x) : l - x])[(Mi = Math.min(x, l - x)) < 0 ? Aa.length - Mi : Mi]);
+    }
+    cache.push(r);
+  }
+  return cache[num][cache[num].length - 1];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abc-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abc-problem.md
new file mode 100644
index 0000000000..b42b619749
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abc-problem.md
@@ -0,0 +1,136 @@
+---
+id: 594810f028c0303b75339acc
+title: ABC Problem
+challengeType: 5
+forumTopicId: 302220
+dashedName: abc-problem
+---
+
+# --description--
+
+You are given a collection of ABC blocks (e.g., childhood alphabet blocks). There are 20 blocks with two letters on each block. A complete alphabet is guaranteed amongst all sides of the blocks. The sample collection of blocks:
+
+<pre>(B O)
+(X K)
+(D Q)
+(C P)
+(N A)
+(G T)
+(R E)
+(T G)
+(Q D)
+(F S)
+(J W)
+(H U)
+(V I)
+(A N)
+(O B)
+(E R)
+(F S)
+(L Y)
+(P C)
+(Z M)
+</pre>
+
+# --instructions--
+
+Implement a function that takes a string (word) and determines whether the word can be spelled with the given collection of blocks.
+
+Some rules to keep in mind:
+
+<ul>
+  <li>Once a letter on a block is used, that block cannot be used again.</li>
+  <li>The function should be case-insensitive.</li>
+</ul>
+
+# --hints--
+
+`canMakeWord` should be a function.
+
+```js
+assert(typeof canMakeWord === 'function');
+```
+
+`canMakeWord` should return a boolean.
+
+```js
+assert(typeof canMakeWord('hi') === 'boolean');
+```
+
+`canMakeWord("bark")` should return true.
+
+```js
+assert(canMakeWord(words[0]));
+```
+
+`canMakeWord("BooK")` should return false.
+
+```js
+assert(!canMakeWord(words[1]));
+```
+
+`canMakeWord("TReAT")` should return true.
+
+```js
+assert(canMakeWord(words[2]));
+```
+
+`canMakeWord("COMMON")` should return false.
+
+```js
+assert(!canMakeWord(words[3]));
+```
+
+`canMakeWord("squAD")` should return true.
+
+```js
+assert(canMakeWord(words[4]));
+```
+
+`canMakeWord("conFUSE")` should return true.
+
+```js
+assert(canMakeWord(words[5]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const words = ['bark', 'BooK', 'TReAT', 'COMMON', 'squAD', 'conFUSE'];
+```
+
+## --seed-contents--
+
+```js
+function canMakeWord(word) {
+
+}
+```
+
+# --solutions--
+
+```js
+function canMakeWord(word) {
+  const characters = 'BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM';
+  const blocks = characters.split(' ').map(pair => pair.split(''));
+
+  const letters = [...word.toUpperCase()];
+  let length = letters.length;
+  const copy = new Set(blocks);
+
+  letters.forEach(letter => {
+    for (let block of copy) {
+      const index = block.indexOf(letter);
+
+      if (index !== -1) {
+        length--;
+        copy.delete(block);
+        break;
+      }
+    }
+  });
+  return !length;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
new file mode 100644
index 0000000000..33cbddb68a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/abundant-deficient-and-perfect-number-classifications.md
@@ -0,0 +1,95 @@
+---
+id: 594810f028c0303b75339acd
+title: 'Abundant, deficient and perfect number classifications'
+challengeType: 5
+forumTopicId: 302221
+dashedName: abundant-deficient-and-perfect-number-classifications
+---
+
+# --description--
+
+These define three classifications of positive integers based on their proper divisors.
+
+Let $P(n)$ be the sum of the proper divisors of `n` where proper divisors are all positive integers `n` other than `n` itself.
+
+If `P(n) < n` then `n` is classed as `deficient`
+
+If `P(n) === n` then `n` is classed as `perfect`
+
+If `P(n) > n` then `n` is classed as `abundant`
+
+**Example**: `6` has proper divisors of `1`, `2`, and `3`. `1 + 2 + 3 = 6`, so `6` is classed as a perfect number.
+
+# --instructions--
+
+Implement a function that calculates how many of the integers from `1` to `num` (inclusive) are in each of the three classes. Output the result as an array in the following format `[deficient, perfect, abundant]`.
+
+# --hints--
+
+`getDPA` should be a function.
+
+```js
+assert(typeof getDPA === 'function');
+```
+
+`getDPA(5000)` should return an array.
+
+```js
+assert(Array.isArray(getDPA(5000)));
+```
+
+`getDPA(5000)` return array should have a length of `3`.
+
+```js
+assert(getDPA(5000).length === 3);
+```
+
+`getDPA(5000)` should return `[3758, 3, 1239]`.
+
+```js
+assert.deepEqual(getDPA(5000), [3758, 3, 1239]);
+```
+
+`getDPA(10000)` should return `[7508, 4, 2488]`.
+
+```js
+assert.deepEqual(getDPA(10000), [7508, 4, 2488]);
+```
+
+`getDPA(20000)` should return `[15043, 4, 4953]`.
+
+```js
+assert.deepEqual(getDPA(20000), [15043, 4, 4953]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function getDPA(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function getDPA(num) {
+  const dpa = [1, 0, 0];
+  for (let n = 2; n <= num; n += 1) {
+    let ds = 1;
+    const e = Math.sqrt(n);
+    for (let d = 2; d < e; d += 1) {
+      if (n % d === 0) {
+        ds += d + (n / d);
+      }
+    }
+    if (n % e === 0) {
+      ds += e;
+    }
+    dpa[ds < n ? 0 : ds === n ? 1 : 2] += 1;
+  }
+  return dpa;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/accumulator-factory.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
new file mode 100644
index 0000000000..fd90df9f34
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/accumulator-factory.md
@@ -0,0 +1,79 @@
+---
+id: 594810f028c0303b75339ace
+title: Accumulator factory
+challengeType: 5
+forumTopicId: 302222
+dashedName: accumulator-factory
+---
+
+# --description--
+
+A problem posed by [Paul Graham](https://en.wikipedia.org/wiki/Paul_Graham_(programmer)) is that of creating a function that takes a single (numeric) argument and which returns another function that is an accumulator. The returned accumulator function in turn also takes a single numeric argument, and returns the sum of all the numeric values passed in so far to that accumulator (including the initial value passed when the accumulator was created).
+
+# --instructions--
+
+Create a function that takes a number $n$ and generates accumulator functions that return the sum of every number ever passed to them.
+
+**Rules:**
+
+Do not use global variables.
+
+**Hint:**
+
+Closures save outer state.
+
+# --hints--
+
+`accumulator` should be a function.
+
+```js
+assert(typeof accumulator === 'function');
+```
+
+`accumulator(0)` should return a function.
+
+```js
+assert(typeof accumulator(0) === 'function');
+```
+
+`accumulator(0)(2)` should return a number.
+
+```js
+assert(typeof accumulator(0)(2) === 'number');
+```
+
+Passing in the values 3, -4, 1.5, and 5 should return 5.5.
+
+```js
+assert(testFn(5) === 5.5);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testFn = typeof accumulator(3) === 'function' && accumulator(3);
+if (testFn) {
+  testFn(-4);
+  testFn(1.5);
+}
+```
+
+## --seed-contents--
+
+```js
+function accumulator(sum) {
+
+}
+```
+
+# --solutions--
+
+```js
+function accumulator(sum) {
+  return function(n) {
+    return sum += n;
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ackermann-function.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ackermann-function.md
new file mode 100644
index 0000000000..f80262dc40
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ackermann-function.md
@@ -0,0 +1,71 @@
+---
+id: 594810f028c0303b75339acf
+title: Ackermann function
+challengeType: 5
+forumTopicId: 302223
+dashedName: ackermann-function
+---
+
+# --description--
+
+The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree.
+
+The Ackermann function is usually defined as follows:
+
+$A(m, n) = \\begin{cases} n+1 & \\mbox{if } m = 0 \\\\ A(m-1, 1) & \\mbox{if } m > 0 \\mbox{ and } n = 0 \\\\ A(m-1, A(m, n-1)) & \\mbox{if } m > 0 \\mbox{ and } n > 0. \\end{cases}$
+
+Its arguments are never negative and it always terminates.
+
+# --instructions--
+
+Write a function which returns the value of $A(m, n)$. Arbitrary precision is preferred (since the function grows so quickly), but not required.
+
+# --hints--
+
+`ack` should be a function.
+
+```js
+assert(typeof ack === 'function');
+```
+
+`ack(0, 0)` should return 1.
+
+```js
+assert(ack(0, 0) === 1);
+```
+
+`ack(1, 1)` should return 3.
+
+```js
+assert(ack(1, 1) === 3);
+```
+
+`ack(2, 5)` should return 13.
+
+```js
+assert(ack(2, 5) === 13);
+```
+
+`ack(3, 3)` should return 61.
+
+```js
+assert(ack(3, 3) === 61);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function ack(m, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function ack(m, n) {
+  return m === 0 ? n + 1 : ack(m - 1, n === 0 ? 1 : ack(m, n - 1));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/align-columns.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/align-columns.md
new file mode 100644
index 0000000000..45ff5fa2f3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/align-columns.md
@@ -0,0 +1,194 @@
+---
+id: 594810f028c0303b75339ad0
+title: Align columns
+challengeType: 5
+forumTopicId: 302224
+dashedName: align-columns
+---
+
+# --description--
+
+Given a text file of many lines, where fields within a line are delineated by a single `$` character, write a program that aligns each column of fields by ensuring that words in each column are separated by at least one space. Further, allow for each word in a column to be either left justified, right justified, or center justified within its column.
+
+# --instructions--
+
+Use the following text to test your programs:
+
+<pre>
+Given$a$text$file$of$many$lines
+where$fields$within$a$line$
+are$delineated$by$a$single$'dollar'$character
+write$a$program
+that$aligns$each$column$of$fields
+by$ensuring$that$words$in$each$
+column$are$separated$by$at$least$one$space.
+Further,$allow$for$each$word$in$a$column$to$be$either$left$
+justified,$right$justified
+or$center$justified$within$its$column.
+</pre>
+
+**Note that:**
+
+<ul>
+  <li>The example input texts lines may, or may not, have trailing dollar characters.</li>
+  <li>All columns should share the same alignment.</li>
+  <li>Consecutive space characters produced adjacent to the end of lines are insignificant for the purposes of the task.</li>
+  <li>Output text will be viewed in a mono-spaced font on a plain text editor or basic terminal.</li>
+  <li>The minimum space between columns should be computed from the text and not hard-coded.</li>
+  <li>It is not a requirement to add separating characters between or around columns.</li>
+</ul>
+
+# --hints--
+
+`formatText` should be a function.
+
+```js
+assert(typeof formatText === 'function');
+```
+
+`formatText` with the above input and "right" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'right'), rightAligned);
+```
+
+`formatText` with the above input and "left" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'left'), leftAligned);
+```
+
+`formatText` with the above input and "center" justification should produce the following:
+
+```js
+assert.strictEqual(formatText(testInput, 'center'), centerAligned);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testInput = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$\"dollar\"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+const rightAligned = '     Given          a      text   file     of     many     lines\n' +
+'     where     fields    within      a   line \n' +
+'       are delineated        by      a single "dollar" character\n' +
+'     write          a   program\n' +
+'      that     aligns      each column     of   fields \n' +
+'        by   ensuring      that  words     in     each \n' +
+'    column        are separated     by     at    least       one space.\n' +
+'  Further,      allow       for   each   word       in         a column to be either left \n' +
+'justified,      right justified\n' +
+'        or     center justified within    its  column.';
+
+const leftAligned = 'Given      a          text      file   of     many     lines    \n' +
+'where      fields     within    a      line   \n' +
+'are        delineated by        a      single "dollar" character\n' +
+'write      a          program  \n' +
+'that       aligns     each      column of     fields   \n' +
+'by         ensuring   that      words  in     each     \n' +
+'column     are        separated by     at     least    one       space.\n' +
+'Further,   allow      for       each   word   in       a         column to be either left \n' +
+'justified, right      justified\n' +
+'or         center     justified within its    column. ';
+
+const centerAligned = '  Given        a        text     file    of     many     lines  \n' +
+'  where      fields    within     a     line  \n' +
+'   are     delineated    by       a    single \"dollar\" character\n' +
+'  write        a       program \n' +
+'   that      aligns     each    column   of    fields  \n' +
+'    by      ensuring    that    words    in     each   \n' +
+'  column      are     separated   by     at    least      one    space.\n' +
+' Further,    allow       for     each   word     in        a     column to be either left \n' +
+'justified,   right    justified\n' +
+'    or       center   justified within  its   column. ';
+```
+
+## --seed-contents--
+
+```js
+const testArr = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$"dollar"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+function formatText(input, justification) {
+
+}
+```
+
+# --solutions--
+
+```js
+const testArr = [
+  'Given$a$text$file$of$many$lines',
+  'where$fields$within$a$line$',
+  'are$delineated$by$a$single$"dollar"$character',
+  'write$a$program',
+  'that$aligns$each$column$of$fields$',
+  'by$ensuring$that$words$in$each$',
+  'column$are$separated$by$at$least$one$space.',
+  'Further,$allow$for$each$word$in$a$column$to$be$either$left$',
+  'justified,$right$justified',
+  'or$center$justified$within$its$column.'
+];
+
+String.prototype.repeat = function (n) { return new Array(1 + parseInt(n)).join(this); };
+
+function formatText(input, justification) {
+  let x, y, max, cols = 0, diff, left, right;
+  for (x = 0; x < input.length; x++) {
+    input[x] = input[x].split('$');
+    if (input[x].length > cols) {
+      cols = input[x].length;
+    }
+  }
+  for (x = 0; x < cols; x++) {
+    max = 0;
+    for (y = 0; y < input.length; y++) {
+      if (input[y][x] && max < input[y][x].length) {
+        max = input[y][x].length;
+      }
+    }
+    for (y = 0; y < input.length; y++) {
+      if (input[y][x]) {
+        diff = (max - input[y][x].length) / 2;
+        left = ' '.repeat(Math.floor(diff));
+        right = ' '.repeat(Math.ceil(diff));
+        if (justification === 'left') {
+          right += left; left = '';
+        }
+        if (justification === 'right') {
+          left += right; right = '';
+        }
+        input[y][x] = left + input[y][x] + right;
+      }
+    }
+  }
+  for (x = 0; x < input.length; x++) {
+    input[x] = input[x].join(' ');
+  }
+  input = input.join('\n');
+  return input;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/amicable-pairs.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
new file mode 100644
index 0000000000..3fe512a48f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/amicable-pairs.md
@@ -0,0 +1,126 @@
+---
+id: 5949b579404977fbaefcd737
+title: Amicable pairs
+challengeType: 5
+forumTopicId: 302225
+dashedName: amicable-pairs
+---
+
+# --description--
+
+Two integers $N$ and $M$ are said to be [amicable pairs](<https://en.wikipedia.org/wiki/Amicable numbers> "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](<https://rosettacode.org/wiki/Proper divisors> "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
+
+**Example:**
+
+**1184** and **1210** are an amicable pair, with proper divisors:
+
+<ul>
+  <li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592  and</li>
+  <li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605   respectively.</li>
+</ul>
+
+# --instructions--
+
+Calculate and show here the Amicable pairs below 20,000 (there are eight).
+
+# --hints--
+
+`amicablePairsUpTo` should be a function.
+
+```js
+assert(typeof amicablePairsUpTo === 'function');
+```
+
+`amicablePairsUpTo(300)` should return `[[220,284]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(300), answer300);
+```
+
+`amicablePairsUpTo(3000)` should return `[[220,284],[1184,1210],[2620,2924]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(3000), answer3000);
+```
+
+`amicablePairsUpTo(20000)` should return `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
+
+```js
+assert.deepEqual(amicablePairsUpTo(20000), answer20000);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const answer300 = [[220, 284]];
+const answer3000 = [
+  [220, 284],
+  [1184, 1210],
+  [2620, 2924]
+];
+const answer20000 = [
+  [220, 284],
+  [1184, 1210],
+  [2620, 2924],
+  [5020, 5564],
+  [6232, 6368],
+  [10744, 10856],
+  [12285, 14595],
+  [17296, 18416]
+];
+```
+
+## --seed-contents--
+
+```js
+function amicablePairsUpTo(maxNum) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// amicablePairsUpTo :: Int -> [(Int, Int)]
+function amicablePairsUpTo(maxNum) {
+  return range(1, maxNum)
+    .map(x => properDivisors(x)
+      .reduce((a, b) => a + b, 0))
+    .reduce((a, m, i, lst) => {
+      const n = i + 1;
+
+      return (m > n) && lst[m - 1] === n ?
+        a.concat([
+          [n, m]
+        ]) : a;
+    }, []);
+}
+
+// properDivisors :: Int -> [Int]
+function properDivisors(n) {
+  if (n < 2) return [];
+
+  const rRoot = Math.sqrt(n);
+  const intRoot = Math.floor(rRoot);
+  const blnPerfectSquare = rRoot === intRoot;
+  const lows = range(1, intRoot)
+  .filter(x => (n % x) === 0);
+
+  return lows.concat(lows.slice(1)
+    .map(x => n / x)
+    .reverse()
+    .slice(blnPerfectSquare | 0));
+}
+
+// Int -> Int -> Maybe Int -> [Int]
+function range(m, n, step) {
+  const d = (step || 1) * (n >= m ? 1 : -1);
+
+  return Array.from({
+    length: Math.floor((n - m) / d) + 1
+  }, (_, i) => m + (i * d));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-mode.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-mode.md
new file mode 100644
index 0000000000..e9f98a9187
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-mode.md
@@ -0,0 +1,79 @@
+---
+id: 594d8d0ab97724821379b1e6
+title: Averages/Mode
+challengeType: 5
+forumTopicId: 302226
+dashedName: averagesmode
+---
+
+# --description--
+
+Write a program to find the [mode](<https://en.wikipedia.org/wiki/Mode (statistics)> "wp: Mode (statistics)") value of a collection.
+
+The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique.
+
+If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriate or possible to support an unspecified value type, use integers.
+
+# --hints--
+
+`mode` should be a function.
+
+```js
+assert(typeof mode === 'function');
+```
+
+`mode([1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17])` should equal `[6]`
+
+```js
+assert.deepEqual(mode(arr1), [6]);
+```
+
+`mode([1, 2, 4, 4, 1])` should equal `[1, 4]`.
+
+```js
+assert.deepEqual(mode(arr2).sort(), [1, 4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const arr1 = [1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17];
+const arr2 = [1, 2, 4, 4, 1];
+```
+
+## --seed-contents--
+
+```js
+function mode(arr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function mode(arr) {
+  const counter = {};
+  let result = [];
+  let max = 0;
+  // for (const i in arr) {
+  arr.forEach(el => {
+    if (!(el in counter)) {
+      counter[el] = 0;
+    }
+    counter[el]++;
+
+    if (counter[el] === max) {
+      result.push(el);
+    }
+    else if (counter[el] > max) {
+      max = counter[el];
+      result = [el];
+    }
+  });
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
new file mode 100644
index 0000000000..daac04f1a5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-pythagorean-means.md
@@ -0,0 +1,144 @@
+---
+id: 594d966a1467eb84194f0086
+title: Averages/Pythagorean means
+challengeType: 5
+forumTopicId: 302227
+dashedName: averagespythagorean-means
+---
+
+# --description--
+
+Compute all three of the [Pythagorean means](<https://en.wikipedia.org/wiki/Pythagorean means> "wp: Pythagorean means") of the set of integers $1$ through $10$ (inclusive).
+
+Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$ for this set of positive integers.
+
+<ul>
+  <li>The most common of the three means, the <a class='rosetta__link--rosetta' href='https://rosettacode.org/wiki/Averages/Arithmetic mean' title='Averages/Arithmetic mean' target='_blank'>arithmetic mean</a>, is the sum of the list divided by its length:<br>
+  <big>$ A(x_1, \ldots, x_n) = \frac{x_1 + \cdots + x_n}{n}$</big></li>
+  <li>The <a class='rosetta__link--wiki' href='https://en.wikipedia.org/wiki/Geometric mean' title='wp: Geometric mean' target='_blank'>geometric mean</a> is the $n$th root of the product of the list:<br>
+  <big>$ G(x_1, \ldots, x_n) = \sqrt[n]{x_1 \cdots x_n} $</big></li>
+  <li>The <a class='rosetta__link--wiki' href='https://en.wikipedia.org/wiki/Harmonic mean' title='wp: Harmonic mean' target='_blank'>harmonic mean</a> is $n$ divided by the sum of the reciprocal of each item in the list:<br>
+  <big>$ H(x_1, \ldots, x_n) = \frac{n}{\frac{1}{x_1} + \cdots + \frac{1}{x_n}} $</big></li>
+</ul>
+
+# --instructions--
+
+When writing your function, assume the input is an ordered array of all inclusive numbers.
+
+For the answer, please output an object in the following format:
+
+```js
+{
+  values: {
+    Arithmetic: 5.5,
+    Geometric: 4.528728688116765,
+    Harmonic: 3.414171521474055
+  },
+  test: 'is A >= G >= H ? yes'
+}
+```
+
+# --hints--
+
+`pythagoreanMeans` should be a function.
+
+```js
+assert(typeof pythagoreanMeans === 'function');
+```
+
+`pythagoreanMeans([1, 2, ..., 10])` should equal the same output above.
+
+```js
+assert.deepEqual(pythagoreanMeans(range1), answer1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const range1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+const answer1 = {
+  values: {
+    Arithmetic: 5.5,
+    Geometric: 4.528728688116765,
+    Harmonic: 3.414171521474055
+  },
+  test: 'is A >= G >= H ? yes'
+};
+```
+
+## --seed-contents--
+
+```js
+function pythagoreanMeans(rangeArr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function pythagoreanMeans(rangeArr) {
+  // arithmeticMean :: [Number] -> Number
+  const arithmeticMean = xs =>
+    foldl((sum, n) => sum + n, 0, xs) / length(xs);
+
+  // geometricMean :: [Number] -> Number
+  const geometricMean = xs =>
+    raise(foldl((product, x) => product * x, 1, xs), 1 / length(xs));
+
+  // harmonicMean :: [Number] -> Number
+  const harmonicMean = xs =>
+    length(xs) / foldl((invSum, n) => invSum + (1 / n), 0, xs);
+
+  // GENERIC FUNCTIONS ------------------------------------------------------
+
+  // A list of functions applied to a list of arguments
+  // <*> :: [(a -> b)] -> [a] -> [b]
+  const ap = (fs, xs) => //
+    Array.prototype.concat(...fs.map(f => //
+      Array.prototype.concat(...xs.map(x => [f(x)]))));
+
+  // foldl :: (b -> a -> b) -> b -> [a] -> b
+  const foldl = (f, a, xs) => xs.reduce(f, a);
+
+  // length :: [a] -> Int
+  const length = xs => xs.length;
+
+  // mapFromList :: [(k, v)] -> Dictionary
+  const mapFromList = kvs =>
+    foldl((a, [k, v]) =>
+      (a[(typeof k === 'string' && k)] = v, a), {}, kvs);
+
+  // raise :: Num -> Int -> Num
+  const raise = (n, e) => Math.pow(n, e);
+/*
+  // show :: a -> String
+  // show :: a -> Int -> String
+  const show = (...x) =>
+    JSON.stringify.apply(
+      null, x.length > 1 ? [x[0], null, x[1]] : x
+    );
+*/
+  // zip :: [a] -> [b] -> [(a,b)]
+  const zip = (xs, ys) =>
+    xs.slice(0, Math.min(xs.length, ys.length))
+      .map((x, i) => [x, ys[i]]);
+
+  // TEST -------------------------------------------------------------------
+  // mean :: Dictionary
+  const mean = mapFromList(zip(
+    ['Arithmetic', 'Geometric', 'Harmonic'],
+    ap([arithmeticMean, geometricMean, harmonicMean], [
+      rangeArr
+    ])
+  ));
+
+  return {
+    values: mean,
+    test: `is A >= G >= H ? ${mean.Arithmetic >= mean.Geometric &&
+      mean.Geometric >= mean.Harmonic ? 'yes' : 'no'}`
+  };
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
new file mode 100644
index 0000000000..080f3e6eea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/averages-root-mean-square.md
@@ -0,0 +1,57 @@
+---
+id: 594da033de4190850b893874
+title: Averages/Root mean square
+challengeType: 5
+forumTopicId: 302228
+dashedName: averagesroot-mean-square
+---
+
+# --description--
+
+Compute the [Root mean square](<https://en.wikipedia.org/wiki/Root mean square> "wp: Root mean square") of the numbers 1 through 10 inclusive.
+
+The *root mean square* is also known by its initials RMS (or rms), and as the **quadratic mean**.
+
+The RMS is calculated as the mean of the squares of the numbers, square-rooted:
+
+$$x\_{\\mathrm{rms}} = \\sqrt {{{x_1}^2 + {x_2}^2 + \\cdots + {x_n}^2} \\over n}. $$
+
+# --hints--
+
+`rms` should be a function.
+
+```js
+assert(typeof rms === 'function');
+```
+
+`rms([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])` should equal `6.2048368229954285`.
+
+```js
+assert.equal(rms(arr1), answer1);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const arr1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+const answer1 = 6.2048368229954285;
+```
+
+## --seed-contents--
+
+```js
+function rms(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function rms(arr) {
+  const sumOfSquares = arr.reduce((s, x) => s + x * x, 0);
+  return Math.sqrt(sumOfSquares / arr.length);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/babbage-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/babbage-problem.md
new file mode 100644
index 0000000000..27054cccc5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/babbage-problem.md
@@ -0,0 +1,78 @@
+---
+id: 594db4d0dedb4c06a2a4cefd
+title: Babbage problem
+challengeType: 5
+forumTopicId: 302229
+dashedName: babbage-problem
+---
+
+# --description--
+
+[Charles Babbage](https://en.wikipedia.org/wiki/Charles_Babbage "wp: Charles_Babbage"), looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example:
+
+<blockquote>
+  What is the smallest positive integer whose square ends in the digits 269,696?
+  <footer style='margin-left: 2em;'>Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, <i>Electronic Computers</i>, second edition, 1970, p. 125.</footer>
+</blockquote>
+
+He thought the answer might be 99,736, whose square is 9,947,269,696; but he couldn't be certain.
+
+The task is to find out if Babbage had the right answer.
+
+# --instructions--
+
+Implement a function to return the lowest integer that satisfies the Babbage problem. If Babbage was right, return Babbage's number.
+
+# --hints--
+
+`babbage` should be a function.
+
+```js
+assert(typeof babbage === 'function');
+```
+
+`babbage(99736, 269696)` should not return 99736 (there is a smaller answer).
+
+```js
+assert.equal(babbage(babbageAns, endDigits), answer);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const babbageAns = 99736;
+const endDigits = 269696;
+const answer = 25264;
+```
+
+## --seed-contents--
+
+```js
+function babbage(babbageNum, endDigits) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function babbage(babbageAns, endDigits) {
+  const babbageNum = Math.pow(babbageAns, 2);
+  const babbageStartDigits = parseInt(babbageNum.toString().replace('269696', ''));
+  let answer = 99736;
+
+  // count down from this answer and save any sqrt int result. return lowest one
+  for (let i = babbageStartDigits; i >= 0; i--) {
+    const num = parseInt(i.toString().concat('269696'));
+    const result = Math.sqrt(num);
+    if (result === Math.floor(Math.sqrt(num))) {
+      answer = result;
+    }
+  }
+
+  return answer;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
new file mode 100644
index 0000000000..e32338e301
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -0,0 +1,188 @@
+---
+id: 594dc6c729e5700999302b45
+title: Balanced brackets
+challengeType: 5
+forumTopicId: 302230
+dashedName: balanced-brackets
+---
+
+# --description--
+
+Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
+
+**Examples:**
+| Input                     | Output |
+| ------------------------- | ------ |
+| <code>\[]</code>          | true   |
+| <code>]\[</code>          | false  |
+| <code>[][]</code>         | true   |
+| <code>]\[]</code>         | false  |
+| <code>\[]]\[\[]</code>    | false  |
+| <code>\[\[\[\[]]]]</code> | true   |
+
+# --hints--
+
+`isBalanced` should be a function.
+
+```js
+assert(typeof isBalanced === 'function');
+```
+
+`isBalanced("[]")` should return true.
+
+```js
+assert(isBalanced(testCases[0]));
+```
+
+`isBalanced("]][[[][][][]][")` should return false.
+
+```js
+assert(!isBalanced(testCases[1]));
+```
+
+`isBalanced("[][[[[][][[[]]]]]]")` should return true.
+
+```js
+assert(isBalanced(testCases[2]));
+```
+
+`isBalanced("][")` should return false.
+
+```js
+assert(!isBalanced(testCases[3]));
+```
+
+`isBalanced("[[[]]]][[]")` should return false.
+
+```js
+assert(!isBalanced(testCases[4]));
+```
+
+`isBalanced("][[]")` should return false.
+
+```js
+assert(!isBalanced(testCases[5]));
+```
+
+`isBalanced("][[][]][[[]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[6]));
+```
+
+`isBalanced("[[][]]][")` should return false.
+
+```js
+assert(!isBalanced(testCases[7]));
+```
+
+`isBalanced("[[[]]][[]]]][][[")` should return false.
+
+```js
+assert(!isBalanced(testCases[8]));
+```
+
+`isBalanced("[]][[]]][[[[][]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[9]));
+```
+
+`isBalanced("][]][[][")` should return false.
+
+```js
+assert(!isBalanced(testCases[10]));
+```
+
+`isBalanced("[[]][[][]]")` should return true.
+
+```js
+assert(isBalanced(testCases[11]));
+```
+
+`isBalanced("[[]]")` should return true.
+
+```js
+assert(isBalanced(testCases[12]));
+```
+
+`isBalanced("]][]][[]][[[")` should return false.
+
+```js
+assert(!isBalanced(testCases[13]));
+```
+
+`isBalanced("][]][][[")` should return false.
+
+```js
+assert(!isBalanced(testCases[14]));
+```
+
+`isBalanced("][][")` should return false.
+
+```js
+assert(!isBalanced(testCases[15]));
+```
+
+`isBalanced("[]]]")` should return false.
+
+```js
+assert(!isBalanced(testCases[16]));
+```
+
+`isBalanced("")` should return true.
+
+```js
+assert(isBalanced(testCases[17]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  '[]',
+  ']][[[][][][]][',
+  '[][[[[][][[[]]]]]]',
+  '][',
+  '[[[]]]][[]',
+  '][[]',
+  '][[][]][[[]]',
+  '[[][]]][',
+  '[[[]]][[]]]][][[',
+  '[]][[]]][[[[][]]',
+  '][]][[][',
+  '[[]][[][]]',
+  '[[]]',
+  ']][]][[]][[[',
+  '][]][][[',
+  '][][',
+  '[]]]',
+  ''
+];
+```
+
+## --seed-contents--
+
+```js
+function isBalanced(str) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function isBalanced(str) {
+  if (str === '') return true;
+  let a = str;
+  let b;
+  do {
+    b = a;
+    a = a.replace(/\[\]/g, '');
+  } while (a !== b);
+  return !a;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
new file mode 100644
index 0000000000..bbd910fb6c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/circles-of-given-radius-through-two-points.md
@@ -0,0 +1,150 @@
+---
+id: 5951815dd895584b06884620
+title: Circles of given radius through two points
+challengeType: 5
+forumTopicId: 302231
+dashedName: circles-of-given-radius-through-two-points
+---
+
+# --description--
+
+Given two points on a plane and a radius, usually two circles of given radius can be drawn through the points.
+
+**Exceptions:**
+
+<ul>
+  <li>A radius of zero should be treated as never describing circles (except in the case where the points are coincident).</li>
+  <li>If the points are coincident then an infinite number of circles with the point on their circumference can be drawn, unless the radius is equal to zero as well which then collapses the circles to a point.</li>
+  <li>If the points form a diameter then return a single circle.</li>
+  <li>If the points are too far apart then no circles can be drawn.</li>
+</ul>
+
+# --instructions--
+
+Implement a function that takes two points and a radius and returns the two circles through those points. For each resulting circle, provide the coordinates for the center of each circle rounded to four decimal digits. Return each coordinate as an array, and coordinates as an array of arrays.
+
+**For edge cases, return the following:**
+
+<ul>
+  <li>If points are on the diameter, return one point. If the radius is also zero however, return <code>"Radius Zero"</code>.</li>
+  <li>If points are coincident, return <code>"Coincident point. Infinite solutions"</code>.</li>
+  <li>If points are farther apart than the diameter, return <code>"No intersection. Points further apart than circle diameter"</code>.</li>
+</ul>
+
+**Sample inputs:**
+
+<pre>      p1                p2           r
+0.1234, 0.9876    0.8765, 0.2345    2.0
+0.0000, 2.0000    0.0000, 0.0000    1.0
+0.1234, 0.9876    0.1234, 0.9876    2.0
+0.1234, 0.9876    0.8765, 0.2345    0.5
+0.1234, 0.9876    0.1234, 0.9876    0.0
+</pre>
+
+# --hints--
+
+`getCircles` should be a function.
+
+```js
+assert(typeof getCircles === 'function');
+```
+
+`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 2.0)` should return `[[1.8631, 1.9742], [-0.8632, -0.7521]]`.
+
+```js
+assert.deepEqual(getCircles(...testCases[0]), answers[0]);
+```
+
+`getCircles([0.0000, 2.0000], [0.0000, 0.0000], 1.0)` should return `[0, 1]`
+
+```js
+assert.deepEqual(getCircles(...testCases[1]), answers[1]);
+```
+
+`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 2.0)` should return `Coincident point. Infinite solutions`
+
+```js
+assert.deepEqual(getCircles(...testCases[2]), answers[2]);
+```
+
+`getCircles([0.1234, 0.9876], [0.8765, 0.2345], 0.5)` should return `No intersection. Points further apart than circle diameter`
+
+```js
+assert.deepEqual(getCircles(...testCases[3]), answers[3]);
+```
+
+`getCircles([0.1234, 0.9876], [0.1234, 0.9876], 0.0)` should return `Radius Zero`
+
+```js
+assert.deepEqual(getCircles(...testCases[4]), answers[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  [[0.1234, 0.9876], [0.8765, 0.2345], 2.0],
+  [[0.0000, 2.0000], [0.0000, 0.0000], 1.0],
+  [[0.1234, 0.9876], [0.1234, 0.9876], 2.0],
+  [[0.1234, 0.9876], [0.8765, 0.2345], 0.5],
+  [[0.1234, 0.9876], [0.1234, 0.9876], 0.0]
+];
+const answers = [
+  [[1.8631, 1.9742], [-0.8632, -0.7521]],
+  [0, 1],
+  'Coincident point. Infinite solutions',
+  'No intersection. Points further apart than circle diameter',
+  'Radius Zero'
+];
+```
+
+## --seed-contents--
+
+```js
+function getCircles(...args) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const hDist = (p1, p2) => Math.hypot(...p1.map((e, i) => e - p2[i])) / 2;
+const pAng = (p1, p2) => Math.atan(p1.map((e, i) => e - p2[i]).reduce((p, c) => c / p, 1));
+const solveF = (p, r) => t => [parseFloat((r * Math.cos(t) + p[0]).toFixed(4)), parseFloat((r * Math.sin(t) + p[1]).toFixed(4))];
+const diamPoints = (p1, p2) => p1.map((e, i) => parseFloat((e + (p2[i] - e) / 2).toFixed(4)));
+
+function getCircles(...args) {
+  const [p1, p2, s] = args;
+  const solve = solveF(p1, s);
+  const halfDist = hDist(p1, p2);
+
+  let msg = [];
+  switch (Math.sign(s - halfDist)) {
+    case 0:
+      msg = s ? diamPoints(p1, p2) :
+        'Radius Zero';
+      break;
+    case 1:
+      if (!halfDist) {
+        msg = 'Coincident point. Infinite solutions';
+      }
+      else {
+        const theta = pAng(p1, p2);
+        const theta2 = Math.acos(halfDist / s);
+        [1, -1].map(e => solve(theta + e * theta2)).forEach(
+          e => msg.push(e));
+      }
+      break;
+    case -1:
+      msg = 'No intersection. Points further apart than circle diameter';
+      break;
+    default:
+      msg = 'Reached the default';
+  }
+  return msg;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
new file mode 100644
index 0000000000..9221d424b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/closest-pair-problem.md
@@ -0,0 +1,414 @@
+---
+id: 5951a53863c8a34f02bf1bdc
+title: Closest-pair problem
+challengeType: 5
+forumTopicId: 302232
+dashedName: closest-pair-problem
+---
+
+# --description--
+
+Provide a function to find the closest two points among a set of given points in two dimensions.
+
+The straightforward solution is a $O(n^2)$ algorithm (which we can call *brute-force algorithm*); the pseudo-code (using indexes) could be simply:
+
+<pre><strong>bruteForceClosestPair</strong> of P(1), P(2), ... P(N)
+<strong>if</strong> N &#x3C; 2 <strong>then</strong>
+  <strong>return</strong> ∞
+<strong>else</strong>
+  minDistance ← |P(1) - P(2)|
+  minPoints ← { P(1), P(2) }
+  <strong>foreach</strong> i ∈ [1, N-1]
+    <strong>foreach</strong> j ∈ [i+1, N]
+      <strong>if</strong> |P(i) - P(j)| &#x3C; minDistance <strong>then</strong>
+        minDistance ← |P(i) - P(j)|
+        minPoints ← { P(i), P(j) }
+      <strong>endif</strong>
+    <strong>endfor</strong>
+  <strong>endfor</strong>
+  <strong>return</strong> minDistance, minPoints
+<strong>endif</strong>
+</pre>
+
+A better algorithm is based on the recursive divide and conquer approach, which is $O(n\log n)$ a pseudo-code could be:
+
+<pre><strong>closestPair</strong> of (xP, yP)
+  where xP is P(1) .. P(N) sorted by x coordinate, and
+  yP is P(1) .. P(N) sorted by y coordinate (ascending order)
+<strong>if</strong> N ≤ 3 <strong>then</strong>
+  <strong>return</strong> closest points of xP using brute-force algorithm
+<strong>else</strong>
+  xL ← points of xP from 1 to ⌈N/2⌉
+  xR ← points of xP from ⌈N/2⌉+1 to N
+  xm ← xP(⌈N/2⌉)<sub>x</sub>
+  yL ← { p ∈ yP : p<sub>x</sub> ≤ xm }
+  yR ← { p ∈ yP : p<sub>x</sub> > xm }
+  (dL, pairL) ← closestPair of (xL, yL)
+  (dR, pairR) ← closestPair of (xR, yR)
+  (dmin, pairMin) ← (dR, pairR)
+  <strong>if</strong> dL &#x3C; dR <strong>then</strong>
+    (dmin, pairMin) ← (dL, pairL)
+  <strong>endif</strong>
+  yS ← { p ∈ yP : |xm - p<sub>x</sub>| &#x3C; dmin }
+  nS ← number of points in yS
+  (closest, closestPair) ← (dmin, pairMin)
+  <strong>for</strong> i <strong>from</strong> 1 <strong>to</strong> nS - 1
+    k ← i + 1
+    <strong>while</strong> k ≤ nS <strong>and</strong> yS(k)<sub>y</sub> - yS(i)<sub>y</sub> &#x3C; dmin
+      <strong>if</strong> |yS(k) - yS(i)| &#x3C; closest <strong>then</strong>
+        (closest, closestPair) ← (|yS(k) - yS(i)|, {yS(k), yS(i)})
+      <strong>endif</strong>
+      k ← k + 1
+    <strong>endwhile</strong>
+  <strong>endfor</strong>
+  <strong>return</strong> closest, closestPair
+<strong>endif</strong>
+</pre>
+
+For the input, expect the argument to be an array of `Point` objects with `x` and `y` members set to numbers. Return an object containing the key:value pairs for `distance` and `pair` (the pair of two closest points).
+
+For example `getClosestPair` with input array `points`:
+
+```js
+const points = [
+  new Point(1, 2),
+  new Point(3, 3),
+  new Point(2, 2)
+];
+```
+
+Would return:
+
+```js
+{
+  distance: 1,
+  pair: [
+    {
+      x: 1,
+      y: 2
+    },
+    {
+      x: 2,
+      y: 2
+    }
+  ]
+}
+```
+
+**Note:** Sort the `pair` array by their `x` values in incrementing order.
+
+
+# --hints--
+
+`getClosestPair` should be a function.
+
+```js
+assert(typeof getClosestPair === 'function');
+```
+
+`getClosestPair(points1).distance` should be `0.0894096443343775`.
+
+```js
+assert.equal(getClosestPair(points1).distance, answer1.distance);
+```
+
+`getClosestPair(points1).pair` should be `[ { x: 7.46489, y: 4.6268 }, { x: 7.46911, y: 4.71611 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points1))).pair,
+  answer1.pair
+);
+```
+
+`getClosestPair(points2).distance` should be `65.06919393998976`.
+
+```js
+assert.equal(getClosestPair(points2).distance, answer2.distance);
+```
+
+`getClosestPair(points2).pair` should be `[ { x: 37134, y: 1963 }, { x: 37181, y: 2008 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points2))).pair,
+  answer2.pair
+);
+```
+
+`getClosestPair(points3).distance` should be `6754.625082119658`.
+
+```js
+assert.equal(getClosestPair(points3).distance, answer3.distance);
+```
+
+`getClosestPair(points3).pair` should be `[ { x: 46817, y: 64975 }, { x: 48953, y: 58567 } ]`.
+
+```js
+assert.deepEqual(
+  JSON.parse(JSON.stringify(getClosestPair(points3))).pair,
+  answer3.pair
+);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const points1 = [
+    new Point(0.748501, 4.09624),
+    new Point(3.00302, 5.26164),
+    new Point(3.61878,  9.52232),
+    new Point(7.46911,  4.71611),
+    new Point(5.7819,   2.69367),
+    new Point(2.34709,  8.74782),
+    new Point(2.87169,  5.97774),
+    new Point(6.33101,  0.463131),
+    new Point(7.46489,  4.6268),
+    new Point(1.45428,  0.087596)
+];
+
+const answer1 = {
+  distance: 0.0894096443343775,
+  pair: [
+    {
+      x: 7.46489,
+      y: 4.6268
+    },
+    {
+      x: 7.46911,
+      y: 4.71611
+    }
+  ]
+};
+
+const points2 = [
+  new Point(37100, 13118),
+  new Point(37134, 1963),
+  new Point(37181, 2008),
+  new Point(37276, 21611),
+  new Point(37307, 9320)
+];
+
+const answer2 = {
+  distance: 65.06919393998976,
+  pair: [
+    {
+      x: 37134,
+      y: 1963
+    },
+    {
+      x: 37181,
+      y: 2008
+    }
+  ]
+};
+
+const points3 = [
+  new Point(16910, 54699),
+  new Point(14773, 61107),
+  new Point(95547, 45344),
+  new Point(95951, 17573),
+  new Point(5824, 41072),
+  new Point(8769, 52562),
+  new Point(21182, 41881),
+  new Point(53226, 45749),
+  new Point(68180, 887),
+  new Point(29322, 44017),
+  new Point(46817, 64975),
+  new Point(10501, 483),
+  new Point(57094, 60703),
+  new Point(23318, 35472),
+  new Point(72452, 88070),
+  new Point(67775, 28659),
+  new Point(19450, 20518),
+  new Point(17314, 26927),
+  new Point(98088, 11164),
+  new Point(25050, 56835),
+  new Point(8364, 6892),
+  new Point(37868, 18382),
+  new Point(23723, 7701),
+  new Point(55767, 11569),
+  new Point(70721, 66707),
+  new Point(31863, 9837),
+  new Point(49358, 30795),
+  new Point(13041, 39744),
+  new Point(59635, 26523),
+  new Point(25859, 1292),
+  new Point(1551, 53890),
+  new Point(70316, 94479),
+  new Point(48549, 86338),
+  new Point(46413, 92747),
+  new Point(27186, 50426),
+  new Point(27591, 22655),
+  new Point(10905, 46153),
+  new Point(40408, 84202),
+  new Point(52821, 73520),
+  new Point(84865, 77388),
+  new Point(99819, 32527),
+  new Point(34404, 75657),
+  new Point(78457, 96615),
+  new Point(42140, 5564),
+  new Point(62175, 92342),
+  new Point(54958, 67112),
+  new Point(4092, 19709),
+  new Point(99415, 60298),
+  new Point(51090, 52158),
+  new Point(48953, 58567)
+];
+
+const answer3 = {
+  distance: 6754.625082119658,
+  pair: [
+    {
+      x: 46817,
+      y: 64975
+    },
+    {
+      x: 48953,
+      y: 58567
+    }
+  ]
+}
+```
+
+## --seed-contents--
+
+```js
+const Point = function(x, y) {
+  this.x = x;
+  this.y = y;
+};
+Point.prototype.getX = function() {
+  return this.x;
+};
+Point.prototype.getY = function() {
+  return this.y;
+};
+
+function getClosestPair(pointsArr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const Point = function(x, y) {
+  this.x = x;
+  this.y = y;
+};
+Point.prototype.getX = function() {
+  return this.x;
+};
+Point.prototype.getY = function() {
+  return this.y;
+};
+
+const mergeSort = function mergeSort(points, comp) {
+    if(points.length < 2) return points;
+
+    var n = points.length,
+        i = 0,
+        j = 0,
+        leftN = Math.floor(n / 2),
+        rightN = leftN;
+
+    var leftPart = mergeSort( points.slice(0, leftN), comp),
+        rightPart = mergeSort( points.slice(rightN), comp );
+
+    var sortedPart = [];
+
+    while((i < leftPart.length) && (j < rightPart.length)) {
+        if(comp(leftPart[i], rightPart[j]) < 0) {
+            sortedPart.push(leftPart[i]);
+            i += 1;
+        }
+        else {
+            sortedPart.push(rightPart[j]);
+            j += 1;
+        }
+    }
+    while(i < leftPart.length) {
+        sortedPart.push(leftPart[i]);
+        i += 1;
+    }
+    while(j < rightPart.length) {
+        sortedPart.push(rightPart[j]);
+        j += 1;
+    }
+    return sortedPart;
+};
+
+const closestPair = function _closestPair(Px, Py) {
+    if(Px.length < 2) return { distance: Infinity, pair: [ new Point(0, 0), new Point(0, 0) ] };
+    if(Px.length < 3) {
+        //find euclid distance
+        var d = Math.sqrt( Math.pow(Math.abs(Px[1].x - Px[0].x), 2) + Math.pow(Math.abs(Px[1].y - Px[0].y), 2) );
+        return {
+            distance: d,
+            pair: [ Px[0], Px[1] ]
+        };
+    }
+
+    var n = Px.length,
+        leftN = Math.floor(n / 2),
+        rightN = leftN;
+
+    var Xl = Px.slice(0, leftN),
+        Xr = Px.slice(rightN),
+        Xm = Xl[leftN - 1],
+        Yl = [],
+        Yr = [];
+    //separate Py
+    for(var i = 0; i < Py.length; i += 1) {
+        if(Py[i].x <= Xm.x)
+            Yl.push(Py[i]);
+        else
+            Yr.push(Py[i]);
+    }
+
+    var dLeft = _closestPair(Xl, Yl),
+        dRight = _closestPair(Xr, Yr);
+
+    var minDelta = dLeft.distance,
+        closestPair = dLeft.pair;
+    if(dLeft.distance > dRight.distance) {
+        minDelta = dRight.distance;
+        closestPair = dRight.pair;
+    }
+
+    //filter points around Xm within delta (minDelta)
+    var closeY = [];
+    for(i = 0; i < Py.length; i += 1) {
+        if(Math.abs(Py[i].x - Xm.x) < minDelta) closeY.push(Py[i]);
+    }
+    //find min within delta. 8 steps max
+    for(i = 0; i < closeY.length; i += 1) {
+        for(var j = i + 1; j < Math.min( (i + 8), closeY.length ); j += 1) {
+            var d = Math.sqrt( Math.pow(Math.abs(closeY[j].x - closeY[i].x), 2) + Math.pow(Math.abs(closeY[j].y - closeY[i].y), 2) );
+            if(d < minDelta) {
+                minDelta = d;
+                closestPair = [ closeY[i], closeY[j] ]
+            }
+        }
+    }
+
+    return {
+        distance: minDelta,
+        pair: closestPair.sort((pointA, pointB) => pointA.x - pointB.x)
+    };
+};
+
+function getClosestPair(points) {
+  const sortX = function(a, b) { return (a.x < b.x) ? -1 : ((a.x > b.x) ? 1 : 0); }
+  const sortY = function(a, b) { return (a.y < b.y) ? -1 : ((a.y > b.y) ? 1 : 0); }
+
+  const Px = mergeSort(points, sortX);
+  const Py = mergeSort(points, sortY);
+
+  return closestPair(Px, Py);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/combinations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/combinations.md
new file mode 100644
index 0000000000..27e9a3fa6d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/combinations.md
@@ -0,0 +1,95 @@
+---
+id: 5958469238c0d8d2632f46db
+title: Combinations
+challengeType: 5
+forumTopicId: 302233
+dashedName: combinations
+---
+
+# --description--
+
+Given non-negative integers `m` and `n`, generate all size `m` combinations of the integers from `0` (zero) to `n-1` in sorted order (each combination is sorted and the entire table is sorted).
+
+**Example:**
+
+`3` comb `5` is:
+
+<pre>0 1 2
+0 1 3
+0 1 4
+0 2 3
+0 2 4
+0 3 4
+1 2 3
+1 2 4
+1 3 4
+2 3 4
+</pre>
+
+# --hints--
+
+`combinations` should be a function.
+
+```js
+assert(typeof combinations === 'function');
+```
+
+`combinations(3, 5)` should return `[[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]]`.
+
+```js
+assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1);
+```
+
+`combinations(4, 6)` should return `[[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]`
+
+```js
+assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testInput1 = [3, 5];
+const testOutput1 = [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]];
+
+const testInput2 = [4, 6];
+const testOutput2 = [[0, 1, 2, 3], [0, 1, 2, 4], [0, 1, 2, 5], [0, 1, 3, 4], [0, 1, 3, 5], [0, 1, 4, 5], [0, 2, 3, 4], [0, 2, 3, 5], [0, 2, 4, 5], [0, 3, 4, 5], [1, 2, 3, 4], [1, 2, 3, 5], [1, 2, 4, 5], [1, 3, 4, 5], [2, 3, 4, 5]];
+```
+
+## --seed-contents--
+
+```js
+function combinations(m, n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function combinations(m, n) {
+  const nArr = [...Array(n).keys()];
+
+  return (function generateCombinations (size, numArr) {
+    const ret = [];
+
+    for (let i = 0; i < numArr.length; i++) {
+      if (size === 1) {
+        ret.push([numArr[i]]);
+      }
+      else {
+        const sub = generateCombinations(size - 1, numArr.slice(i + 1, numArr.length));
+        for (let subI = 0; subI < sub.length; subI++) {
+          const next = sub[subI];
+          next.unshift(numArr[i]);
+          ret.push(next);
+        }
+      }
+    }
+    return ret;
+  }(m, nArr));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/comma-quibbling.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
new file mode 100644
index 0000000000..6223a523ce
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/comma-quibbling.md
@@ -0,0 +1,101 @@
+---
+id: 596e414344c3b2872167f0fe
+title: Comma quibbling
+challengeType: 5
+forumTopicId: 302234
+dashedName: comma-quibbling
+---
+
+# --description--
+
+Comma quibbling is a task originally set by Eric Lippert in his [blog](https://blogs.msdn.com/b/ericlippert/archive/2009/04/15/comma-quibbling.aspx).
+
+# --instructions--
+
+Write a function to generate a string output which is the concatenation of input words from a list/sequence where:
+
+<ol>
+  <li>An input of no words produces the output string of just the two brace characters (<code>"{}"</code>)</li>
+  <li>An input of just one word, e.g. <code>["ABC"]</code>, produces the output string of the word inside the two braces, e.g. <code>"{ABC}"</code></li>
+  <li>An input of two words, e.g. <code>["ABC", "DEF"]</code>, produces the output string of the two words inside the two braces with the words separated by the string <code>" and "</code>, e.g. <code>"{ABC and DEF}"</code></li>
+  <li>An input of three or more words, e.g. <code>["ABC", "DEF", "G", "H"]</code>, produces the output string of all but the last word separated by <code>", "</code> with the last word separated by <code>" and "</code> and all within braces; e.g. <code>"{ABC, DEF, G and H}"</code></li>
+</ol>
+
+Test your function with the following series of inputs showing your output here on this page:
+
+<ul>
+  <li>[] # (No input words).</li>
+  <li>["ABC"]</li>
+  <li>["ABC", "DEF"]</li>
+  <li>["ABC", "DEF", "G", "H"]</li>
+</ul>
+
+**Note:** Assume words are non-empty strings of uppercase characters for this task.
+
+# --hints--
+
+`quibble` should be a function.
+
+```js
+assert(typeof quibble === 'function');
+```
+
+`quibble(["ABC"])` should return a string.
+
+```js
+assert(typeof quibble(['ABC']) === 'string');
+```
+
+`quibble([])` should return "{}".
+
+```js
+assert.equal(quibble(testCases[0]), results[0]);
+```
+
+`quibble(["ABC"])` should return "{ABC}".
+
+```js
+assert.equal(quibble(testCases[1]), results[1]);
+```
+
+`quibble(["ABC", "DEF"])` should return "{ABC and DEF}".
+
+```js
+assert.equal(quibble(testCases[2]), results[2]);
+```
+
+`quibble(["ABC", "DEF", "G", "H"])` should return "{ABC,DEF,G and H}".
+
+```js
+assert.equal(quibble(testCases[3]), results[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [[], ["ABC"], ["ABC", "DEF"], ["ABC", "DEF", "G", "H"]];
+const results = ["{}", "{ABC}", "{ABC and DEF}", "{ABC,DEF,G and H}"];
+```
+
+## --seed-contents--
+
+```js
+function quibble(words) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function quibble(words) {
+  return "{" +
+    words.slice(0, words.length - 1).join(",") +
+   (words.length > 1 ? " and " : "") +
+   (words[words.length - 1] || '') +
+  "}";
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
new file mode 100644
index 0000000000..313cda7dcc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/compare-a-list-of-strings.md
@@ -0,0 +1,132 @@
+---
+id: 596e457071c35c882915b3e4
+title: Compare a list of strings
+challengeType: 5
+forumTopicId: 302235
+dashedName: compare-a-list-of-strings
+---
+
+# --description--
+
+Given a [list](https://en.wikipedia.org/wiki/List_(abstract_data_type) "wp: List\_(abstract_data_type)") of arbitrarily many strings, implement a function for each of the following conditions:
+
+<ul>
+  <li>test if they are all lexically equal</li>
+  <li>test if every string is lexically less than the one after it  (i.e. whether the list is in strict ascending order)</li>
+</ul>
+
+# --hints--
+
+`allEqual` should be a function.
+
+```js
+assert(typeof allEqual === 'function');
+```
+
+`azSorted` should be a function.
+
+```js
+assert(typeof azSorted === 'function');
+```
+
+`allEqual(["AA", "AA", "AA", "AA"])` should return true.
+
+```js
+assert(allEqual(testCases[0]));
+```
+
+`azSorted(["AA", "AA", "AA", "AA"])` should return false.
+
+```js
+assert(!azSorted(testCases[0]));
+```
+
+`allEqual(["AA", "ACB", "BB", "CC"])` should return false.
+
+```js
+assert(!allEqual(testCases[1]));
+```
+
+`azSorted(["AA", "ACB", "BB", "CC"])` should return true.
+
+```js
+assert(azSorted(testCases[1]));
+```
+
+`allEqual([])` should return true.
+
+```js
+assert(allEqual(testCases[2]));
+```
+
+`azSorted([])` should return true.
+
+```js
+assert(azSorted(testCases[2]));
+```
+
+`allEqual(["AA"])` should return true.
+
+```js
+assert(allEqual(testCases[3]));
+```
+
+`azSorted(["AA"])` should return true.
+
+```js
+assert(azSorted(testCases[3]));
+```
+
+`allEqual(["BB", "AA"])` should return false.
+
+```js
+assert(!allEqual(testCases[4]));
+```
+
+`azSorted(["BB", "AA"])` should return false.
+
+```js
+assert(!azSorted(testCases[4]));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [['AA', 'AA', 'AA', 'AA'], ['AA', 'ACB', 'BB', 'CC'], [], ['AA'], ['BB', 'AA']];
+```
+
+## --seed-contents--
+
+```js
+function allEqual(arr) {
+
+  return true;
+}
+
+function azSorted(arr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function allEqual(a) {
+  let out = true;
+  let i = 0;
+  while (++i < a.length) {
+    out = out && (a[i - 1] === a[i]);
+  } return out;
+}
+
+function azSorted(a) {
+  let out = true;
+  let i = 0;
+  while (++i < a.length) {
+    out = out && (a[i - 1] < a[i]);
+  } return out;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
new file mode 100644
index 0000000000..740d69b7b0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/convert-seconds-to-compound-duration.md
@@ -0,0 +1,129 @@
+---
+id: 596fd036dc1ab896c5db98b1
+title: Convert seconds to compound duration
+challengeType: 5
+forumTopicId: 302236
+dashedName: convert-seconds-to-compound-duration
+---
+
+# --description--
+
+Implement a function which:
+
+<ul>
+  <li>takes a positive integer representing a duration in seconds as input (e.g., <code>100</code>), and</li>
+  <li>returns a string which shows the same duration decomposed into weeks, days, hours, minutes, and seconds as detailed below (e.g., <code>1 min, 40 sec</code>).</li>
+</ul>
+
+Demonstrate that it passes the following three test-cases:
+
+<div style='font-size:115%; font-weight: bold;'>Test Cases</div>
+
+| Input number | Output number                         |
+| ------------ | ------------------------------------- |
+| 7259         | <code>2 hr, 59 sec</code>             |
+| 86400        | <code>1 d</code>                      |
+| 6000000      | <code>9 wk, 6 d, 10 hr, 40 min</code> |
+
+<div style="font-size:115%; font-weight: bold;">Details</div>
+<ul>
+  <li>
+    The following five units should be used:
+
+| Unit   | Suffix used in Output | Conversion            |
+| ------ | --------------------- | --------------------- |
+| week   | <code>wk</code>       | 1 week = 7 days       |
+| day    | <code>d</code>        | 1 day = 24 hours      |
+| hour   | <code>hr</code>       | 1 hour = 60 minutes   |
+| minute | <code>min</code>      | 1 minute = 60 seconds |
+| second | <code>sec</code>      | ---                   |
+
+  </li>
+  <li>
+    However, <strong>only</strong> include quantities with non-zero values in the output (e.g., return <code>1 d</code> and not <code>0 wk, 1 d, 0 hr, 0 min, 0 sec</code>).
+  </li>
+  <li>
+    Give larger units precedence over smaller ones as much as possible (e.g., return <code>2 min, 10 sec</code> and not <code>1 min, 70 sec</code> or <code>130 sec</code>).
+  </li>
+  <li>
+    Mimic the formatting shown in the test-cases (quantities sorted from largest unit to smallest and separated by comma+space; value and unit of each quantity separated by space).
+  </li>
+</ul>
+
+# --hints--
+
+`convertSeconds` should be a function.
+
+```js
+assert(typeof convertSeconds === 'function');
+```
+
+`convertSeconds(7259)` should return `2 hr, 59 sec`.
+
+```js
+assert.equal(convertSeconds(testCases[0]), results[0]);
+```
+
+`convertSeconds(86400)` should return `1 d`.
+
+```js
+assert.equal(convertSeconds(testCases[1]), results[1]);
+```
+
+`convertSeconds(6000000)` should return `9 wk, 6 d, 10 hr, 40 min`.
+
+```js
+assert.equal(convertSeconds(testCases[2]), results[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [7259, 86400, 6000000];
+const results = ['2 hr, 59 sec', '1 d', '9 wk, 6 d, 10 hr, 40 min'];
+```
+
+## --seed-contents--
+
+```js
+function convertSeconds(sec) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function convertSeconds(sec) {
+  const localNames = ['wk', 'd', 'hr', 'min', 'sec'];
+  // compoundDuration :: [String] -> Int -> String
+  const compoundDuration = (labels, intSeconds) =>
+    weekParts(intSeconds)
+    .map((v, i) => [v, labels[i]])
+    .reduce((a, x) =>
+      a.concat(x[0] ? [`${x[0]} ${x[1] || '?'}`] : []), []
+    )
+    .join(', ');
+
+    // weekParts :: Int -> [Int]
+  const weekParts = intSeconds => [0, 7, 24, 60, 60]
+    .reduceRight((a, x) => {
+      const r = a.rem;
+      const mod = x !== 0 ? r % x : r;
+
+      return {
+        rem: (r - mod) / (x || 1),
+        parts: [mod].concat(a.parts)
+      };
+    }, {
+      rem: intSeconds,
+      parts: []
+    })
+    .parts;
+
+  return compoundDuration(localNames, sec);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
new file mode 100644
index 0000000000..50d6c16f8d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-occurrences-of-a-substring.md
@@ -0,0 +1,79 @@
+---
+id: 596fda99c69f779975a1b67d
+title: Count occurrences of a substring
+challengeType: 5
+forumTopicId: 302237
+dashedName: count-occurrences-of-a-substring
+---
+
+# --description--
+
+Create a function, or show a built-in function, to count the number of non-overlapping occurrences of a substring inside a string.
+
+The function should take two arguments:
+
+<ul>
+  <li>the first argument being the string to search, and</li>
+  <li>the second a substring to be searched for.</li>
+</ul>
+
+It should return an integer count.
+
+The matching should yield the highest number of non-overlapping matches.
+
+In general, this essentially means matching from left-to-right or right-to-left.
+
+# --hints--
+
+`countSubstring` should be a function.
+
+```js
+assert(typeof countSubstring === 'function');
+```
+
+`countSubstring("the three truths", "th")` should return `3`.
+
+```js
+assert.equal(countSubstring(testCases[0], searchString[0]), results[0]);
+```
+
+`countSubstring("ababababab", "abab")` should return `2`.
+
+```js
+assert.equal(countSubstring(testCases[1], searchString[1]), results[1]);
+```
+
+`countSubstring("abaabba*bbaba*bbab", "a*b")` should return `2`.
+
+```js
+assert.equal(countSubstring(testCases[2], searchString[2]), results[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = ['the three truths', 'ababababab', 'abaabba*bbaba*bbab'];
+const searchString = ['th', 'abab', 'a*b'];
+const results = [3, 2, 2];
+```
+
+## --seed-contents--
+
+```js
+function countSubstring(str, subStr) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function countSubstring(str, subStr) {
+  const escapedSubStr = subStr.replace(/[.+*?^$[\]{}()|/]/g, '\\$&');
+  const matches = str.match(new RegExp(escapedSubStr, 'g'));
+  return matches ? matches.length : 0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-the-coins.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-the-coins.md
new file mode 100644
index 0000000000..3e6bd14d1d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/count-the-coins.md
@@ -0,0 +1,93 @@
+---
+id: 59713bd26bdeb8a594fb9413
+title: Count the coins
+challengeType: 5
+forumTopicId: 302238
+dashedName: count-the-coins
+---
+
+# --description--
+
+There are four types of common coins in [US](https://en.wikipedia.org/wiki/United_States) currency:
+
+<ul>
+  <li>quarters (25 cents)</li>
+  <li>dimes (10 cents)</li>
+  <li>nickels (5 cents), and</li>
+  <li>pennies (1 cent)</li>
+</ul>
+
+<p>There are six ways to make change for 15 cents:</p>
+
+<ul>
+  <li>A dime and a nickel</li>
+  <li>A dime and 5 pennies</li>
+  <li>3 nickels</li>
+  <li>2 nickels and 5 pennies</li>
+  <li>A nickel and 10 pennies</li>
+  <li>15 pennies</li>
+</ul>
+
+# --instructions--
+
+Implement a function to determine how many ways there are to make change for a given input, `cents`, that represents an amount of US pennies using these common coins.
+
+# --hints--
+
+`countCoins` should be a function.
+
+```js
+assert(typeof countCoins === 'function');
+```
+
+`countCoins(15)` should return `6`.
+
+```js
+assert.equal(countCoins(15), 6);
+```
+
+`countCoins(85)` shouls return `163`.
+
+```js
+assert.equal(countCoins(85), 163);
+```
+
+`countCoins(100)` should return `242`.
+
+```js
+assert.equal(countCoins(100), 242);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function countCoins(cents) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function countCoins(cents) {
+  const operands = [1, 5, 10, 25];
+  const targetsLength = cents + 1;
+  const operandsLength = operands.length;
+  const t = [1];
+
+  for (let a = 0; a < operandsLength; a++) {
+    for (let b = 1; b < targetsLength; b++) {
+      // initialise undefined target
+      t[b] = t[b] ? t[b] : 0;
+
+      // accumulate target + operand ways
+      t[b] += (b < operands[a]) ? 0 : t[b - operands[a]];
+    }
+  }
+
+  return t[targetsLength - 1];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cramers-rule.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cramers-rule.md
new file mode 100644
index 0000000000..9b49a3fac2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cramers-rule.md
@@ -0,0 +1,167 @@
+---
+id: 59713da0a428c1a62d7db430
+title: Cramer's rule
+challengeType: 5
+forumTopicId: 302239
+dashedName: cramers-rule
+---
+
+# --description--
+
+In [linear algebra](<https://en.wikipedia.org/wiki/linear algebra> "wp: linear algebra"), [Cramer's rule](<https://en.wikipedia.org/wiki/Cramer's rule> "wp: Cramer's rule") is an explicit formula for the solution of a [system of linear equations](<https://en.wikipedia.org/wiki/system of linear equations> "wp: system of linear equations") with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations.
+
+Given
+
+$\\left\\{\\begin{matrix}a_1x + b_1y + c_1z&= {\\color{red}d_1}\\\\a_2x + b_2y + c_2z&= {\\color{red}d_2}\\\\a_3x + b_3y + c_3z&= {\\color{red}d_3}\\end{matrix}\\right.$
+
+which in matrix format is
+
+$\\begin{bmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{bmatrix}\\begin{bmatrix} x \\\\ y \\\\ z \\end{bmatrix}=\\begin{bmatrix} {\\color{red}d_1} \\\\ {\\color{red}d_2} \\\\ {\\color{red}d_3} \\end{bmatrix}.$
+
+Then the values of $x, y$ and $z$ can be found as follows:
+
+$x = \\frac{\\begin{vmatrix} {\\color{red}d_1} & b_1 & c_1 \\\\ {\\color{red}d_2} & b_2 & c_2 \\\\ {\\color{red}d_3} & b_3 & c_3 \\end{vmatrix} } { \\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\quad y = \\frac {\\begin{vmatrix} a_1 & {\\color{red}d_1} & c_1 \\\\ a_2 & {\\color{red}d_2} & c_2 \\\\ a_3 & {\\color{red}d_3} & c_3 \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix}}, \\text{ and }z = \\frac { \\begin{vmatrix} a_1 & b_1 & {\\color{red}d_1} \\\\ a_2 & b_2 & {\\color{red}d_2} \\\\ a_3 & b_3 & {\\color{red}d_3} \\end{vmatrix}} {\\begin{vmatrix} a_1 & b_1 & c_1 \\\\ a_2 & b_2 & c_2 \\\\ a_3 & b_3 & c_3 \\end{vmatrix} }.$
+
+# --instructions--
+
+Given the following system of equations:
+
+$\\begin{cases} 2w-x+5y+z=-3 \\\\ 3w+2x+2y-6z=-32 \\\\ w+3x+3y-z=-47 \\\\ 5w-2x-3y+3z=49 \\\\ \\end{cases}$
+
+solve for $w$, $x$, $y$ and $z$, using Cramer's rule.
+
+# --hints--
+
+`cramersRule` should be a function.
+
+```js
+assert(typeof cramersRule === 'function');
+```
+
+`cramersRule([[2, -1, 5, 1], [3, 2, 2, -6], [1, 3, 3, -1], [5, -2, -3, 3]], [-3, -32, -47, 49])` should return `[2, -12, -4, 1]`.
+
+```js
+assert.deepEqual(cramersRule(matrices[0], freeTerms[0]), answers[0]);
+```
+
+`cramersRule([[3, 1, 1], [2, 2, 5], [1, -3, -4]], [3, -1, 2])` should return `[1, 1, -1]`.
+
+```js
+assert.deepEqual(cramersRule(matrices[1], freeTerms[1]), answers[1]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const matrices = [
+  [
+    [2, -1, 5, 1],
+    [3, 2, 2, -6],
+    [1, 3, 3, -1],
+    [5, -2, -3, 3]
+  ],
+  [
+    [3, 1, 1],
+    [2, 2, 5],
+    [1, -3, -4]
+  ]
+];
+const freeTerms = [[-3, -32, -47, 49], [3, -1, 2]];
+
+const answers = [[2, -12, -4, 1], [1, 1, -1]];
+```
+
+## --seed-contents--
+
+```js
+function cramersRule(matrix, freeTerms) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+/**
+ * Compute Cramer's Rule
+ * @param  {array} matrix    x,y,z, etc. terms
+ * @param  {array} freeTerms
+ * @return {array}           solution for x,y,z, etc.
+ */
+function cramersRule(matrix, freeTerms) {
+  const det = detr(matrix);
+  const returnArray = [];
+  let i;
+
+  for (i = 0; i < matrix[0].length; i++) {
+    const tmpMatrix = insertInTerms(matrix, freeTerms, i);
+    returnArray.push(detr(tmpMatrix) / det);
+  }
+  return returnArray;
+}
+
+/**
+ * Inserts single dimensional array into
+ * @param  {array} matrix multidimensional array to have ins inserted into
+ * @param  {array} ins single dimensional array to be inserted vertically into matrix
+ * @param  {array} at  zero based offset for ins to be inserted into matrix
+ * @return {array}     New multidimensional array with ins replacing the at column in matrix
+ */
+function insertInTerms(matrix, ins, at) {
+  const tmpMatrix = clone(matrix);
+  let i;
+  for (i = 0; i < matrix.length; i++) {
+    tmpMatrix[i][at] = ins[i];
+  }
+  return tmpMatrix;
+}
+/**
+ * Compute the determinate of a matrix.  No protection, assumes square matrix
+ * function borrowed, and adapted from MIT Licensed numericjs library (www.numericjs.com)
+ * @param  {array} m Input Matrix (multidimensional array)
+ * @return {number}   result rounded to 2 decimal
+ */
+function detr(m) {
+  let ret = 1;
+  let j;
+  let k;
+  const A = clone(m);
+  const n = m[0].length;
+  let alpha;
+
+  for (j = 0; j < n - 1; j++) {
+    k = j;
+    for (let i = j + 1; i < n; i++) { if (Math.abs(A[i][j]) > Math.abs(A[k][j])) { k = i; } }
+    if (k !== j) {
+      const temp = A[k]; A[k] = A[j]; A[j] = temp;
+      ret *= -1;
+    }
+    const Aj = A[j];
+    for (let i = j + 1; i < n; i++) {
+      const Ai = A[i];
+      alpha = Ai[j] / Aj[j];
+      for (k = j + 1; k < n - 1; k += 2) {
+        const k1 = k + 1;
+        Ai[k] -= Aj[k] * alpha;
+        Ai[k1] -= Aj[k1] * alpha;
+      }
+      if (k !== n) { Ai[k] -= Aj[k] * alpha; }
+    }
+    if (Aj[j] === 0) { return 0; }
+    ret *= Aj[j];
+  }
+  return Math.round(ret * A[j][j] * 100) / 100;
+}
+
+/**
+ * Clone two dimensional Array using ECMAScript 5 map function and EcmaScript 3 slice
+ * @param  {array} m Input matrix (multidimensional array) to clone
+ * @return {array}   New matrix copy
+ */
+function clone(m) {
+  return m.map(a => a.slice());
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
new file mode 100644
index 0000000000..4ca5496cb7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cumulative-standard-deviation.md
@@ -0,0 +1,101 @@
+---
+id: 5a23c84252665b21eecc7e03
+title: Cumulative standard deviation
+challengeType: 5
+forumTopicId: 302240
+dashedName: cumulative-standard-deviation
+---
+
+# --description--
+
+Write a function that takes an array of numbers as parameter and returns the [standard deviation](<https://en.wikipedia.org/wiki/Standard Deviation>) of the series.
+
+# --hints--
+
+`standardDeviation` should be a function.
+
+```js
+assert(typeof standardDeviation == 'function');
+```
+
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return a number.
+
+```js
+assert(typeof standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]) == 'number');
+```
+
+`standardDeviation([2, 4, 4, 4, 5, 5, 7, 9])` should return `2`.
+
+```js
+assert.equal(standardDeviation([2, 4, 4, 4, 5, 5, 7, 9]), 2);
+```
+
+`standardDeviation([600, 470, 170, 430, 300])` should return `147.323`.
+
+```js
+assert.equal(standardDeviation([600, 470, 170, 430, 300]), 147.323);
+```
+
+`standardDeviation([75, 83, 96, 100, 121, 125])` should return `18.239`.
+
+```js
+assert.equal(standardDeviation([75, 83, 96, 100, 121, 125]), 18.239);
+```
+
+`standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82])` should return `16.87`.
+
+```js
+assert.equal(
+  standardDeviation([23, 37, 45, 49, 56, 63, 63, 70, 72, 82]),
+  16.87
+);
+```
+
+`standardDeviation([271, 354, 296, 301, 333, 326, 285, 298, 327, 316, 287, 314])` should return `22.631`.
+
+```js
+assert.equal(
+  standardDeviation([
+    271,
+    354,
+    296,
+    301,
+    333,
+    326,
+    285,
+    298,
+    327,
+    316,
+    287,
+    314
+  ]),
+  22.631
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function standardDeviation(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function standardDeviation(arr) {
+  var sum = 0,
+    sum_sq = 0,
+    n = arr.length;
+  arr.forEach(function(e) {
+    sum += e;
+    sum_sq += e * e;
+  });
+
+  var std_dev = Math.sqrt(sum_sq / n - Math.pow(sum / n, 2));
+  return Math.round(std_dev * 1000) / 1000;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cusip.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cusip.md
new file mode 100644
index 0000000000..0daefa3293
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cusip.md
@@ -0,0 +1,118 @@
+---
+id: 5a23c84252665b21eecc7e05
+title: CUSIP
+challengeType: 5
+forumTopicId: 302241
+dashedName: cusip
+---
+
+# --description--
+
+A **CUSIP** is a nine-character alphanumeric code that identifies a North American financial security for the purposes of facilitating clearing and settlement of trades. The CUSIP was adopted as an American National Standard under Accredited Standards X9.6.
+
+# --instructions--
+
+Write a function that takes a string as a parameter and checks if the string is valid CUSIP.
+
+# --hints--
+
+`isCusip` should be a function.
+
+```js
+assert(typeof isCusip == 'function');
+```
+
+`isCusip("037833100")` should return a boolean.
+
+```js
+assert(typeof isCusip('037833100') == 'boolean');
+```
+
+`isCusip("037833100")` should return `true`.
+
+```js
+assert.equal(isCusip('037833100'), true);
+```
+
+`isCusip("17275R102")` should return `true`.
+
+```js
+assert.equal(isCusip('17275R102'), true);
+```
+
+`isCusip("38259P50a")` should return `false`.
+
+```js
+assert.equal(isCusip('38259P50a'), false);
+```
+
+`isCusip("38259P508")` should return `true`.
+
+```js
+assert.equal(isCusip('38259P508'), true);
+```
+
+`isCusip("38259P50#")` should return `false`.
+
+```js
+assert.equal(isCusip('38259P50#'), false);
+```
+
+`isCusip("68389X105")` should return `true`.
+
+```js
+assert.equal(isCusip('68389X105'), true);
+```
+
+`isCusip("68389X106")` should return `false`.
+
+```js
+assert.equal(isCusip('68389X106'), false);
+```
+
+`isCusip("5949181")` should return `false`.
+
+```js
+assert.equal(isCusip('5949181'), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isCusip(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isCusip(s) {
+  if (s.length != 9) return false;
+  var sum = 0;
+  var ASCII = x => x.charCodeAt(0);
+  for (var i = 0; i < 7; i++) {
+    var c = s.charCodeAt(i);
+
+    var v;
+    if (c >= ASCII('0') && c <= ASCII('9')) {
+      v = c - 48;
+    } else if (c >= ASCII('A') && c <= ASCII('Z')) {
+      v = c - 64; // lower case letters apparently invalid
+    } else if (c == ASCII('*')) {
+      v = 36;
+    } else if (c == ASCII('@')) {
+      v = 37;
+    } else if (c == ASCII('#')) {
+      v = 38;
+    } else {
+      return false;
+    }
+    if (i % 2 == 1) v *= 2; // check if odd as using 0-based indexing
+    sum += Math.floor(v / 10) + (v % 10);
+  }
+  return s.charCodeAt(8) - 48 == (10 - (sum % 10)) % 10;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
new file mode 100644
index 0000000000..74e9412a08
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/cut-a-rectangle.md
@@ -0,0 +1,203 @@
+---
+id: 5a23c84252665b21eecc7e06
+title: Cut a rectangle
+challengeType: 5
+forumTopicId: 302242
+dashedName: cut-a-rectangle
+---
+
+# --description--
+
+A given rectangle is made from *m* × *n* squares. If *m* and *n* are not both odd, then it is possible to cut a path through the rectangle along the square edges such that the rectangle splits into two connected pieces with the same shape (after rotating one of the pieces by 180°). All such paths for 2 × 2 and 4 × 3 rectangles are shown below.
+
+<div style="width: 100%; text-align: center;">
+  <svg xmlns="https://www.w3.org/2000/svg" xmlns:xlink="https://www.w3.org/1999/xlink" width="520" height="170" aria-hidden="true" alt="Diagram showing the possible paths for 2 by 2 and 4 by 3 rectangles">
+    <style>
+      .diagram-g { fill: none; stroke: #ccc }
+      .diagram-s, .diagram-s2 { fill: #bff; stroke: black; fill-opacity: .4 }
+      .diagram-s2 { fill: #fbf }
+      .diagram-d { stroke:black; fill:none}
+    </style>
+    <defs>
+      <g id="diagram-m">
+        <g id="diagram-h4">
+          <g id="diagram-h2">
+            <path id="diagram-h" d="m0 10h 640" class="diagram-g"/>
+            <use xlink:href="#diagram-h" transform="translate(0, 20)"/>
+          </g>
+          <use xlink:href="#diagram-h2" transform="translate(0, 40)"/>
+        </g>
+        <use xlink:href="#diagram-h4" transform="translate(0, 80)"/>
+        <g id="diagram-v8">
+          <g id="diagram-v4">
+            <g id="diagram-v2">
+              <path id="diagram-v" d="m10 0v160 m 20 0 v-160" class="diagram-g"/>
+              <use xlink:href="#diagram-v" transform="translate(40, 0)"/>
+            </g>
+            <use xlink:href="#diagram-v2" transform="translate(80, 0)"/>
+          </g>
+          <use xlink:href="#diagram-v4" transform="translate(160, 0)"/>
+        </g>
+        <use xlink:href="#diagram-v8" transform="translate(320, 0)"/>
+      </g>
+      <path id="diagram-b" d="m0 0h80v60h-80z" class="diagram-s"/>
+    </defs>
+    <g transform="translate(.5, .5)">
+      <use xlink:href="#diagram-m"/>
+      <g transform="translate(10, 10)">
+        <path d="m0 0v40h40v-40z" class="diagram-s2"/>
+        <path d="m20 0v40" class="diagram-d"/>
+        <path d="m60 0v40h40v-40z" class="diagram-s2"/>
+        <path d="m60 20h40" class="diagram-d"/>
+        <g transform="translate(120, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 20h40v20h40" class="diagram-d"/>
+        </g>
+        <g transform="translate(220, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 40h40v-20h40" class="diagram-d"/>
+        </g>
+        <g transform="translate(320, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m20 0v40h20v-20h20v40" class="diagram-d"/>
+        </g>
+        <g transform="translate(420, 0)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m60 0v40h-20v-20h-20v40" class="diagram-d"/>
+        </g>
+        <g transform="translate(20, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m40 0v60" class="diagram-d"/>
+        </g>
+        <g transform="translate(120, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m60 0v20h-20v20h-20v20" class="diagram-d"/>
+        </g>
+        <g transform="translate(220, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m20 0v20h20v20h20v20" class="diagram-d"/>
+        </g>
+        <g transform="translate(320, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 20h20v20h20v-20h20v20h20" class="diagram-d"/>
+        </g>
+        <g transform="translate(420, 80)">
+          <use xlink:href="#diagram-b"/>
+          <path d="m0 40h20v-20h20v20h20v-20h20" class="diagram-d"/>
+        </g>
+      </g>
+    </g>
+  </svg>
+</div>
+
+# --instructions--
+
+Write a function that calculates the number of different ways to cut an *m* × *n* rectangle.
+
+# --hints--
+
+`cutRectangle` should be a function.
+
+```js
+assert(typeof cutRectangle == 'function');
+```
+
+`cutRectangle(2, 2)` should return a number.
+
+```js
+assert(typeof cutRectangle(2, 2) == 'number');
+```
+
+`cutRectangle(2, 2)` should return `2`.
+
+```js
+assert.equal(cutRectangle(2, 2), 2);
+```
+
+`cutRectangle(4, 3)` should return `9`.
+
+```js
+assert.equal(cutRectangle(4, 3), 9);
+```
+
+`cutRectangle(4, 4)` should return `22`.
+
+```js
+assert.equal(cutRectangle(4, 4), 22);
+```
+
+`cutRectangle(8, 3)` should return `53`.
+
+```js
+assert.equal(cutRectangle(8, 3), 53);
+```
+
+`cutRectangle(7, 4)` should return `151`.
+
+```js
+assert.equal(cutRectangle(7, 4), 151);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cutRectangle(w, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function cutRectangle(w, h) {
+  if (w % 2 == 1 && h % 2 == 1) return;
+
+  var dirs = [[0, -1], [-1, 0], [0, 1], [1, 0]];
+
+  var grid = new Array(h);
+  for (var i = 0; i < grid.length; i++) grid[i] = new Array(w);
+  var stack = [];
+
+  var half = Math.floor((w * h) / 2);
+  var bits = Math.pow(2, half) - 1;
+  var result = 0;
+  for (; bits > 0; bits -= 2) {
+    for (var i = 0; i < half; i++) {
+      var r = Math.floor(i / w);
+      var c = i % w;
+      grid[r][c] = (bits & (1 << i)) != 0 ? 1 : 0;
+      grid[h - r - 1][w - c - 1] = 1 - grid[r][c];
+    }
+
+    stack.push(0);
+    grid[0][0] = 2;
+    var count = 1;
+    while (stack.length != 0) {
+      var pos = stack.pop();
+      var r = Math.floor(pos / w);
+      var c = pos % w;
+
+      for (var dir of dirs) {
+        var nextR = r + dir[0];
+        var nextC = c + dir[1];
+
+        if (nextR >= 0 && nextR < h && nextC >= 0 && nextC < w) {
+          if (grid[nextR][nextC] == 1) {
+            stack.push(nextR * w + nextC);
+            grid[nextR][nextC] = 2;
+            count++;
+          }
+        }
+      }
+    }
+
+    if (count == half) {
+      result++;
+    }
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-format.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-format.md
new file mode 100644
index 0000000000..7db6dbebb1
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-format.md
@@ -0,0 +1,90 @@
+---
+id: 59669d08d75b60482359409f
+title: Date format
+challengeType: 5
+forumTopicId: 302243
+dashedName: date-format
+---
+
+# --description--
+
+Return an array with two date strings of the current date with the following specifications:
+
+- The first string's date order should be the year number, month number, and day number separated by dashes (`-`).
+- The first string's year should be four digits in length.
+- The first string's month and day should not contain any leading zeros.
+- The second string's weekday and month names should not be abbreviated.
+- The second string's day should not contain any leading zeros.
+
+Example outputs:
+
+```js
+['2007-11-23', 'Friday, November 23, 2007']
+['2021-3-2', 'Tuesday, March 2, 2021']
+```
+
+# --hints--
+
+`getDateFormats` should be a function.
+
+```js
+assert(typeof getDateFormats === 'function');
+```
+
+`getDateFormats` should return an object.
+
+```js
+assert(typeof getDateFormats() === 'object');
+```
+
+`getDateFormats` should return an array with 2 elements.
+
+```js
+assert(getDateFormats().length === 2);
+```
+
+`getDateFormats` should return the correct date in the right format
+
+```js
+assert.deepEqual(getDateFormats(), dates, equalsMessage);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const getDateSolution = () => {
+  const date = new Date();
+  const weekdays = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
+  const months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
+  const fmt1 = `${date.getFullYear()}-${(1 + date.getMonth())}-${date.getDate()}`;
+  const fmt2 = `${weekdays[date.getDay()]}, ${months[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;
+  return [fmt1, fmt2];
+};
+
+const dates = getDateSolution();
+const equalsMessage = `message: <code>getDataFormats()</code> should return <code>["${dates[0]}", "${dates[1]}"]</code>.`;
+```
+
+## --seed-contents--
+
+```js
+function getDateFormats() {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function getDateFormats() {
+  const date = new Date();
+  const weekdays = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
+  const months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
+  const fmt1 = `${date.getFullYear()}-${(1 + date.getMonth())}-${date.getDate()}`;
+  const fmt2 = `${weekdays[date.getDay()]}, ${months[date.getMonth()]} ${date.getDate()}, ${date.getFullYear()}`;
+  return [fmt1, fmt2];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-manipulation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-manipulation.md
new file mode 100644
index 0000000000..3412cd12fd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/date-manipulation.md
@@ -0,0 +1,109 @@
+---
+id: 5966c21cf732a95f1b67dd28
+title: Date manipulation
+challengeType: 5
+forumTopicId: 302244
+dashedName: date-manipulation
+---
+
+# --description--
+
+Given a date string in EST, output the given date as a string with 12 hours added to the time. Time zone should be preserved.
+
+Example input: `"March 6 2009 7:30pm EST"`
+
+Example output: `"March 7 2009 7:30am EST"`
+
+# --hints--
+
+`add12Hours` should be a function.
+
+```js
+assert(typeof add12Hours === 'function');
+```
+
+`add12Hours(dateString)` should return a string.
+
+```js
+assert(typeof add12Hours('January 17 2017 11:43am EST') === 'string');
+```
+
+`add12Hours("January 17 2017 11:43am EST")` should return `"January 17 2017 11:43pm EST"`
+
+```js
+assert(
+  add12Hours('January 17 2017 11:43am EST') === 'January 17 2017 11:43pm EST'
+);
+```
+
+Should handle day change. `add12Hours("March 6 2009 7:30pm EST")` should return `"March 7 2009 7:30am EST"`
+
+```js
+assert(add12Hours('March 6 2009 7:30pm EST') === 'March 7 2009 7:30am EST');
+```
+
+Should handle month change in a leap years. `add12Hours("February 29 2004 9:15pm EST")` should return `"March 1 2004 9:15am EST"`
+
+```js
+assert(add12Hours('February 29 2004 9:15pm EST') === 'March 1 2004 9:15am EST');
+```
+
+Should handle month change in a common years. `add12Hours("February 28 1999 3:15pm EST")` should return `"March 1 1999 3:15am EST"`
+
+```js
+assert(add12Hours('February 28 1999 3:15pm EST') === 'March 1 1999 3:15am EST');
+```
+
+Should handle year change. `add12Hours("December 31 2020 1:45pm EST")` should return `"January 1 2021 1:45am EST"`
+
+```js
+assert(
+  add12Hours('December 31 2020 1:45pm EST') === 'January 1 2021 1:45am EST'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function add12Hours(dateString) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function add12Hours(dateString) {
+  const months = ['January', 'February', 'March', 'April', 'May', 'June',
+    'July', 'August', 'September', 'October', 'November', 'December'];
+  // Get the parts of the string
+  const parts = dateString.split(' ');
+  const month = months.indexOf(parts[0]);
+  const day = parseInt(parts[1], 10);
+  const year = parseInt(parts[2], 10);
+  const time = parts[3].split(':');
+  let hours = parseInt(time[0], 10);
+  if (time[1].slice(-2) === 'pm') {
+    hours += 12;
+  }
+  const minutes = parseInt(time[1].slice(0, -2), 10);
+
+  // Create a date with given parts, and updated hours
+  const date = new Date();
+  date.setFullYear(year, month, day);
+  date.setHours(hours + 12);  // Add 12 hours
+  date.setMinutes(minutes);
+
+  let hoursOutput = date.getHours();
+  let abbreviation = 'am';
+  if (hoursOutput > 12) {
+    hoursOutput -= 12;
+    abbreviation = 'pm';
+  }
+
+  return `${months[date.getMonth()]} ${date.getDate()} ${date.getFullYear()} ${hoursOutput}:${date.getMinutes()}${abbreviation} EST`;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/day-of-the-week.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
new file mode 100644
index 0000000000..0260694251
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/day-of-the-week.md
@@ -0,0 +1,74 @@
+---
+id: 5966f99c45e8976909a85575
+title: Day of the week
+challengeType: 5
+forumTopicId: 302245
+dashedName: day-of-the-week
+---
+
+# --description--
+
+A company decides that whenever Xmas falls on a Sunday they will give their workers all extra paid holidays so that, together with any public holidays, workers will not have to work the following week (between the 25th of December and the first of January).
+
+# --instructions--
+
+Write a function that takes a start year and an end year and return an array of all the years where the 25th of December will be a Sunday.
+
+# --hints--
+
+`findXmasSunday` should be a function.
+
+```js
+assert(typeof findXmasSunday === 'function');
+```
+
+`findXmasSunday(2000, 2100)` should return an array.
+
+```js
+assert(typeof findXmasSunday(2000, 2100) === 'object');
+```
+
+`findXmasSunday(1970, 2017)` should return `[1977, 1983, 1988, 1994, 2005, 2011, 2016]`
+
+```js
+assert.deepEqual(findXmasSunday(1970, 2017), firstSolution);
+```
+
+`findXmasSunday(2008, 2121)` should return `[2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118]`
+
+```js
+assert.deepEqual(findXmasSunday(2008, 2121), secondSolution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const firstSolution = [1977, 1983, 1988, 1994, 2005, 2011, 2016];
+const secondSolution = [2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118];
+```
+
+## --seed-contents--
+
+```js
+function findXmasSunday(start, end) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function findXmasSunday(start, end) {
+  const xmasSunday = [];
+  for (let year = start; year <= end; year++) {
+    const xmas = new Date(year, 11, 25);
+    if (xmas.getDay() === 0) {
+      xmasSunday.push(year);
+    }
+  }
+  return xmasSunday;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
new file mode 100644
index 0000000000..e74d1883eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deal-cards-for-freecell.md
@@ -0,0 +1,210 @@
+---
+id: 59694356a6e7011f7f1c5f4e
+title: Deal cards for FreeCell
+challengeType: 5
+forumTopicId: 302246
+dashedName: deal-cards-for-freecell
+---
+
+# --description--
+
+*FreeCell* is the solitaire card game that Paul Alfille introduced to the PLATO system in 1978. Jim Horne, at Microsoft, changed the name to FreeCell and reimplemented the game for [DOS](https://rosettacode.org/wiki/DOS "DOS"), then [Windows](https://rosettacode.org/wiki/Windows "Windows"). This version introduced 32000 numbered deals.
+
+As the game became popular, Jim Horne disclosed the algorithm, and other implementations of FreeCell began to reproduce the Microsoft deals. These deals are numbered from 1 to 32000. Newer versions from Microsoft have 1 million deals, numbered from 1 to 1000000; some implementations allow numbers outside that range.
+
+The algorithm uses this [linear congruential generator](<https://rosettacode.org/wiki/linear congruential generator> "linear congruential generator") from Microsoft C:
+
+<ul>
+  <li>$state_{n + 1} \equiv 214013 \times state_n + 2531011 \pmod{2^{31}}$</li>
+  <li>$rand_n = state_n \div 2^{16}$</li>
+  <li>$rand_n$ is in range 0 to 32767.</li>
+</ul>
+
+The algorithm follows:
+
+<ol>
+  <li>Seed the RNG with the number of the deal.
+  </li><li>Create an <a href='https://rosettacode.org/wiki/array' title='array' target='_blank'>array</a> of 52 cards: Ace of Clubs, Ace of Diamonds, Ace of Hearts, Ace of Spades, 2 of Clubs, 2 of Diamonds, and so on through the ranks: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King. The array indexes are 0 to 51, with Ace of Clubs at 0, and King of Spades at 51.</li>
+  <li>Until the array is empty:</li>
+  <li>Choose a random card at index ≡ next random number (mod array length).</li>
+    <ul>
+      <li>Swap this random card with the last card of the array.</li>
+      <li>Remove this random card from the array. (Array length goes down by 1.)</li>
+      <li>Deal this random card.</li>
+    </ul>
+  <li>Deal all 52 cards, face up, across 8 columns. The first 8 cards go in 8 columns, the next 8 cards go on the first 8 cards, and so on.</li>
+</ol>
+
+**Example:**
+
+**Order to deal cards**
+
+<pre> 1  2  3  4  5  6  7  8
+ 9 10 11 12 13 14 15 16
+17 18 19 20 21 22 23 24
+25 26 27 28 29 30 31 32
+33 34 35 36 37 38 39 40
+41 42 43 44 45 46 47 48
+49 50 51 52</pre>
+
+**Game #1**
+
+```js
+[
+  ['JD', '2D', '9H', 'JC', '5D', '7H', '7C', '5H'],
+  ['KD', 'KC', '9S', '5S', 'AD', 'QC', 'KH', '3H'],
+  ['2S', 'KS', '9D', 'QD', 'JS', 'AS', 'AH', '3C'],
+  ['4C', '5C', 'TS', 'QH', '4H', 'AC', '4D', '7S'],
+  ['3S', 'TD', '4S', 'TH', '8H', '2C', 'JH', '7D'],
+  ['6D', '8S', '8D', 'QS', '6C', '3D', '8C', 'TC'],
+  ['6S', '9C', '2H', '6H']
+]
+```
+
+**Game #617**
+
+```js
+[
+  ['7D', 'AD', '5C', '3S', '5S', '8C', '2D', 'AH'],
+  ['TD', '7S', 'QD', 'AC', '6D', '8H', 'AS', 'KH'],
+  ['TH', 'QC', '3H', '9D', '6S', '8D', '3D', 'TC'],
+  ['KD', '5H', '9S', '3C', '8S', '7H', '4D', 'JS'],
+  ['4C', 'QS', '9C', '9H', '7C', '6H', '2C', '2S'],
+  ['4S', 'TS', '2H', '5D', 'JC', '6C', 'JH', 'QH'],
+  ['JD', 'KS', 'KC', '4H']
+]
+```
+
+# --instructions--
+
+Write a function to take a deal number and deal cards in the same order as this algorithm. The function must return a two dimensional array representing the FreeCell board.
+
+Deals can also be checked against [FreeCell solutions to 1000000 games](https://freecellgamesolutions.com/). (Summon a video solution, and it displays the initial deal.)
+
+# --hints--
+
+`dealFreeCell` should be a function.
+
+```js
+assert(typeof dealFreeCell === 'function');
+```
+
+`dealFreeCell(seed)` should return an object.
+
+```js
+assert(typeof dealFreeCell(1) === 'object');
+```
+
+`dealFreeCell(seed)` should return an array of length 7.
+
+```js
+assert(dealFreeCell(1).length === 7);
+```
+
+`dealFreeCell(1)` should return an array identical to example "Game #1"
+
+```js
+assert.deepEqual(dealFreeCell(1), game1);
+```
+
+`dealFreeCell(617)` should return an array identical to example "Game #617"
+
+```js
+assert.deepEqual(dealFreeCell(617), game617);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const replaceThis = 3;
+const game1 = [
+  ['JD', '2D', '9H', 'JC', '5D', '7H', '7C', '5H'],
+  ['KD', 'KC', '9S', '5S', 'AD', 'QC', 'KH', '3H'],
+  ['2S', 'KS', '9D', 'QD', 'JS', 'AS', 'AH', '3C'],
+  ['4C', '5C', 'TS', 'QH', '4H', 'AC', '4D', '7S'],
+  ['3S', 'TD', '4S', 'TH', '8H', '2C', 'JH', '7D'],
+  ['6D', '8S', '8D', 'QS', '6C', '3D', '8C', 'TC'],
+  ['6S', '9C', '2H', '6H']
+];
+const game617 = [
+  ['7D', 'AD', '5C', '3S', '5S', '8C', '2D', 'AH'],
+  ['TD', '7S', 'QD', 'AC', '6D', '8H', 'AS', 'KH'],
+  ['TH', 'QC', '3H', '9D', '6S', '8D', '3D', 'TC'],
+  ['KD', '5H', '9S', '3C', '8S', '7H', '4D', 'JS'],
+  ['4C', 'QS', '9C', '9H', '7C', '6H', '2C', '2S'],
+  ['4S', 'TS', '2H', '5D', 'JC', '6C', 'JH', 'QH'],
+  ['JD', 'KS', 'KC', '4H']
+];
+```
+
+## --seed-contents--
+
+```js
+function dealFreeCell(seed) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// RNG
+function FreeCellRNG(seed) {
+  return {
+    lastNum: seed,
+    next() {
+      this.lastNum = ((214013 * this.lastNum) + 2531011) % (Math.pow(2, 31));
+      return this.lastNum >> 16;
+    }
+  };
+}
+// Get cards
+function getDeck() {
+  const ranks = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K'];
+  const suits = ['C', 'D', 'H', 'S'];
+  const cards = [];
+  for (let i = 0; i < ranks.length; i += 1) {
+    for (let j = 0; j < suits.length; j += 1) {
+      cards.push(`${ranks[i]}${suits[j]}`);
+    }
+  }
+  return cards;
+}
+function dealFreeCell(seed) {
+  const rng = FreeCellRNG(seed);
+  const deck = getDeck();
+
+  const deltCards = [[], [], [], [], [], [], []];
+  let currentColumn = 0;
+  let currentRow = 0;
+
+  let rand;
+  let temp;
+  let card;
+  while (deck.length > 0) {
+    // Choose a random card
+    rand = rng.next() % deck.length;
+
+    // Swap this random card with the last card in the array
+    temp = deck[deck.length - 1];
+    deck[deck.length - 1] = deck[rand];
+    deck[rand] = temp;
+
+    // Remove this card from the array
+    card = deck.pop();
+
+    // Deal this card
+    deltCards[currentRow].push(card);
+    currentColumn += 1;
+    if (currentColumn === 8) {
+      currentColumn = 0;
+      currentRow += 1;
+    }
+  }
+
+  return deltCards;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deepcopy.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deepcopy.md
new file mode 100644
index 0000000000..24b950d8d5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/deepcopy.md
@@ -0,0 +1,85 @@
+---
+id: 596a8888ab7c01048de257d5
+title: Deepcopy
+challengeType: 5
+forumTopicId: 302247
+dashedName: deepcopy
+---
+
+# --description--
+
+Write a function that returns a deep copy of a given object. The copy must not be the same object that was given.
+
+This task will not test for:
+
+<ul>
+  <li>Objects with properties that are functions</li>
+  <li>Date objects or object with properties that are Date objects</li>
+  <li>RegEx or object with properties that are RegEx objects</li>
+  <li>Prototype copying</li>
+</ul>
+
+# --hints--
+
+`deepcopy` should be a function.
+
+```js
+assert(typeof deepcopy === 'function');
+```
+
+`deepcopy({test: "test"})` should return an object.
+
+```js
+assert(typeof deepcopy(obj1) === 'object');
+```
+
+`deepcopy` should not return the same object that was provided.
+
+```js
+assert(deepcopy(obj2) != obj2);
+```
+
+When passed an object containing an array, `deepcopy` should return a deep copy of the object.
+
+```js
+assert.deepEqual(deepcopy(obj2), obj2);
+```
+
+When passed an object containing another object, `deepcopy`  should return a deep copy of the object.
+
+```js
+assert.deepEqual(deepcopy(obj3), obj3);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const obj1 = { test: 'test' };
+const obj2 = {
+  t: 'test',
+  a: ['an', 'array']
+};
+const obj3 = {
+  t: 'try',
+  o: obj2
+};
+```
+
+## --seed-contents--
+
+```js
+function deepcopy(obj) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function deepcopy(obj) {
+  return JSON.parse(JSON.stringify(obj));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
new file mode 100644
index 0000000000..2bc3f2dd1b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/define-a-primitive-data-type.md
@@ -0,0 +1,132 @@
+---
+id: 597089c87eec450c68aa1643
+title: Define a primitive data type
+challengeType: 5
+forumTopicId: 302248
+dashedName: define-a-primitive-data-type
+---
+
+# --description--
+
+Define a type that behaves like an integer but has a lowest valid value of 1 and a highest valid value of 10.
+
+Error handling:
+
+<ul>
+  <li>If you try to instantiate a <code>Num</code> with a value outside of 1 - 10, it should throw a <code>TypeError</code> with an error message of <code>'Out of range'</code>.</li>
+  <li>If you try to instantiate a <code>Num</code> with a value that is not a number, it should throw a <code>TypeError</code> with an error message of <code>'Not a Number'</code>.</li>
+</ul>
+
+# --hints--
+
+`Num` should be a function.
+
+```js
+assert(typeof Num === 'function');
+```
+
+`new Num(4)` should return an object.
+
+```js
+assert(typeof new Num(4) === 'object');
+```
+
+`new Num('test')` should throw a TypeError with message 'Not a Number'.
+
+```js
+assert.throws(() => new Num('test'), TypeError);
+```
+
+`new Num(0)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(0), TypeError);
+```
+
+`new Num(-5)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(-5), TypeError);
+```
+
+`new Num(10)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(11), TypeError);
+```
+
+`new Num(20)` should throw a TypeError with message 'Out of range'.
+
+```js
+assert.throws(() => new Num(20), TypeError);
+```
+
+`new Num(3) + new Num(4)` should equal 7.
+
+```js
+assert.equal(new Num(3) + new Num(4), 7);
+```
+
+`new Num(3) - new Num(4)` should equal -1.
+
+```js
+assert.equal(new Num(3) - new Num(4), -1);
+```
+
+`new Num(3) * new Num(4)` should equal 12.
+
+```js
+assert.equal(new Num(3) * new Num(4), 12);
+```
+
+`new Num(3) / new Num(4)` should equal 0.75.
+
+```js
+assert.equal(new Num(3) / new Num(4), 0.75);
+```
+
+`new Num(3) < new Num(4)` should be true.
+
+```js
+assert(new Num(3) < new Num(4));
+```
+
+`new Num(3) > new Num(4)` should be false.
+
+```js
+assert(!(new Num(3) > new Num(4)));
+```
+
+`(new Num(5)).toString()` should return '5'
+
+```js
+assert.equal(new Num(5).toString(), '5');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Num(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function Num(n) {
+  if (isNaN(n)) {
+    throw new TypeError('Not a Number');
+  }
+  if (n < 1 || n > 10) {
+    throw new TypeError('Out of range');
+  }
+
+  this._value = +n;
+}
+Num.prototype.valueOf = function() { return this._value; };
+Num.prototype.toString = function () { return this._value.toString(); };
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/department-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/department-numbers.md
new file mode 100644
index 0000000000..0eba1bec54
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/department-numbers.md
@@ -0,0 +1,126 @@
+---
+id: 59f40b17e79dbf1ab720ed7a
+title: Department Numbers
+challengeType: 5
+forumTopicId: 302249
+dashedName: department-numbers
+---
+
+# --description--
+
+There is a highly organized city that has decided to assign a number to each of their departments:
+
+<ul>
+  <li>Police department</li>
+  <li>Sanitation department</li>
+  <li>Fire department</li>
+</ul>
+
+Each department can have a number between 1 and 7 (inclusive).
+
+The three department numbers are to be unique (different from each other) and must add up to the number 12.
+
+The Chief of the Police doesn't like odd numbers and wants to have an even number for his department.
+
+# --instructions--
+
+Write a program which outputs all valid combinations as an array.
+
+```js
+[2, 3, 7] [2, 4, 6] [2, 6, 4]
+[2, 7, 3] [4, 1, 7] [4, 2, 6]
+[4, 3, 5] [4, 5, 3] [4, 6, 2]
+[4, 7, 1] [6, 1, 5] [6, 2, 4]
+[6, 4, 2] [6, 5, 1]
+```
+
+# --hints--
+
+`combinations` should be a function.
+
+```js
+assert(typeof combinations === 'function');
+```
+
+`combinations([1, 2, 3], 6)` should return an Array.
+
+```js
+assert(Array.isArray(combinations([1, 2, 3], 6)));
+```
+
+`combinations([1, 2, 3, 4, 5, 6, 7], 12)` should return an array of length 14.
+
+```js
+assert(combinations(nums, total).length === len);
+```
+
+`combinations([1, 2, 3, 4, 5, 6, 7], 12)` should return all valid combinations.
+
+```js
+assert.deepEqual(combinations(nums, total), result);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const nums = [1, 2, 3, 4, 5, 6, 7];
+const total = 12;
+const len = 14;
+const result = [
+  [2, 3, 7],
+  [2, 4, 6],
+  [2, 6, 4],
+  [2, 7, 3],
+  [4, 1, 7],
+  [4, 2, 6],
+  [4, 3, 5],
+  [4, 5, 3],
+  [4, 6, 2],
+  [4, 7, 1],
+  [6, 1, 5],
+  [6, 2, 4],
+  [6, 4, 2],
+  [6, 5, 1]
+];
+```
+
+## --seed-contents--
+
+```js
+function combinations(possibleNumbers, total) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function combinations(possibleNumbers, total) {
+  let firstNumber;
+  let secondNumber;
+  let thridNumber;
+  const allCombinations = [];
+
+  for (let i = 0; i < possibleNumbers.length; i += 1) {
+    firstNumber = possibleNumbers[i];
+
+    if (firstNumber % 2 === 0) {
+      for (let j = 0; j < possibleNumbers.length; j += 1) {
+        secondNumber = possibleNumbers[j];
+
+        if (j !== i && firstNumber + secondNumber <= total) {
+          thridNumber = total - firstNumber - secondNumber;
+
+          if (thridNumber !== firstNumber && thridNumber !== secondNumber && possibleNumbers.includes(thridNumber)) {
+            allCombinations.push([firstNumber, secondNumber, thridNumber]);
+          }
+        }
+      }
+    }
+  }
+  return allCombinations;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/discordian-date.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/discordian-date.md
new file mode 100644
index 0000000000..217c79db1c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/discordian-date.md
@@ -0,0 +1,195 @@
+---
+id: 59f4eafba0343628bb682785
+title: Discordian date
+challengeType: 5
+forumTopicId: 302250
+dashedName: discordian-date
+---
+
+# --description--
+
+Convert a given date from the [Gregorian calendar](<https://en.wikipedia.org/wiki/Gregorian calendar> "wp: Gregorian calendar") to the [Discordian calendar](<https://en.wikipedia.org/wiki/Discordian calendar> "wp: Discordian calendar").
+
+# --hints--
+
+`discordianDate` should be a function.
+
+```js
+assert(typeof discordianDate === 'function');
+```
+
+`discordianDate(new Date(2010, 6, 22))` should return `"Pungenday, the 57th day of Confusion in the YOLD 3176"`.
+
+```js
+assert(
+  discordianDate(new Date(2010, 6, 22)) ===
+    'Pungenday, the 57th day of Confusion in the YOLD 3176'
+);
+```
+
+`discordianDate(new Date(2012, 1, 28))` should return `"Prickle-Prickle, the 59th day of Chaos in the YOLD 3178"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 1, 28)) ===
+    'Prickle-Prickle, the 59th day of Chaos in the YOLD 3178'
+);
+```
+
+`discordianDate(new Date(2012, 1, 29))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib\'s Day!"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 1, 29)) ===
+    "Setting Orange, the 60th day of Chaos in the YOLD 3178. Celebrate St. Tib's Day!"
+);
+```
+
+`discordianDate(new Date(2012, 2, 1))` should return `"Setting Orange, the 60th day of Chaos in the YOLD 3178"`.
+
+```js
+assert(
+  discordianDate(new Date(2012, 2, 1)) ===
+    'Setting Orange, the 60th day of Chaos in the YOLD 3178'
+);
+```
+
+`discordianDate(new Date(2010, 0, 5))` should return `"Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!"`.
+
+```js
+assert(
+  discordianDate(new Date(2010, 0, 5)) ===
+    'Setting Orange, the 5th day of Chaos in the YOLD 3176. Celebrate Mungday!'
+);
+```
+
+`discordianDate(new Date(2011, 4, 3))` should return `"Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!"`.
+
+```js
+assert(
+  discordianDate(new Date(2011, 4, 3)) ===
+    'Pungenday, the 50th day of Discord in the YOLD 3177. Celebrate Discoflux!'
+);
+```
+
+`discordianDate(new Date(2015, 9, 19))` should return `"Boomtime, the 73rd day of Bureaucracy in the YOLD 3181"`.
+
+```js
+assert(
+  discordianDate(new Date(2015, 9, 19)) ===
+    'Boomtime, the 73rd day of Bureaucracy in the YOLD 3181'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function discordianDate(date) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+/**
+ * All Hail Discordia! - this script prints Discordian date using system date.
+ *
+ * lang: JavaScript
+ * author: jklu
+ * contributors: JamesMcGuigan
+ *
+ * source: https://rosettacode.org/wiki/Discordian_date#JavaScript
+ */
+const seasons = [
+  'Chaos', 'Discord', 'Confusion',
+  'Bureaucracy', 'The Aftermath'
+];
+const weekday = [
+  'Sweetmorn', 'Boomtime', 'Pungenday',
+  'Prickle-Prickle', 'Setting Orange'
+];
+
+const apostle = [
+  'Mungday', 'Mojoday', 'Syaday',
+  'Zaraday', 'Maladay'
+];
+
+const holiday = [
+  'Chaoflux', 'Discoflux', 'Confuflux',
+  'Bureflux', 'Afflux'
+];
+
+
+Date.prototype.isLeapYear = function() {
+  const year = this.getFullYear();
+  if ((year & 3) !== 0) { return false; }
+  return ((year % 100) !== 0 || (year % 400) === 0);
+};
+
+// Get Day of Year
+Date.prototype.getDOY = function() {
+  const dayCount = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334];
+  const mn = this.getMonth();
+  const dn = this.getDate();
+  let dayOfYear = dayCount[mn] + dn;
+  if (mn > 1 && this.isLeapYear()) { dayOfYear += 1; }
+  return dayOfYear;
+};
+
+Date.prototype.isToday = function() {
+  const today = new Date();
+  return this.getDate() === today.getDate()
+      && this.getMonth() === today.getMonth()
+      && this.getFullYear() === today.getFullYear()
+  ;
+};
+
+function discordianDate(date) {
+  if (!date) { date = new Date(); }
+
+  const y = date.getFullYear();
+  const yold = y + 1166;
+  let dayOfYear = date.getDOY();
+  let celebrateHoliday = null;
+
+  if (date.isLeapYear()) {
+    if (dayOfYear === 60) {
+      celebrateHoliday = 'St. Tib\'s Day';
+    }
+    else if (dayOfYear > 60) {
+      dayOfYear--;
+    }
+  }
+  dayOfYear--;
+
+  const divDay = Math.floor(dayOfYear / 73);
+
+  const seasonDay = (dayOfYear % 73) + 1;
+  if (seasonDay === 5) {
+    celebrateHoliday = apostle[divDay];
+  }
+  if (seasonDay === 50) {
+    celebrateHoliday = holiday[divDay];
+  }
+
+  const season = seasons[divDay];
+  const dayOfWeek = weekday[dayOfYear % 5];
+
+  const nth = (seasonDay % 10 === 1) ? 'st'
+          : (seasonDay % 10 === 2) ? 'nd'
+          : (seasonDay % 10 === 3) ? 'rd'
+                                  : 'th';
+
+  return ''
+         + dayOfWeek
+         + ', the ' + seasonDay + nth
+         + ' day of ' + season
+         + ' in the YOLD ' + yold
+         + (celebrateHoliday ? '. Celebrate ' + celebrateHoliday + '!' : '')
+    ;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/dot-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/dot-product.md
new file mode 100644
index 0000000000..5584a7e26a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/dot-product.md
@@ -0,0 +1,75 @@
+---
+id: 5a23c84252665b21eecc7e1e
+title: Dot product
+challengeType: 5
+forumTopicId: 302251
+dashedName: dot-product
+---
+
+# --description--
+
+Create a function, to compute the **[dot product](<https://en.wikipedia.org/wiki/Dot product>)**, also known as the **scalar product** of two vectors.
+
+# --hints--
+
+`dotProduct` should be a function.
+
+```js
+assert(typeof dotProduct == 'function');
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return a number.
+
+```js
+assert(typeof dotProduct([1, 3, -5], [4, -2, -1]) == 'number');
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return `3`.
+
+```js
+assert.equal(dotProduct([1, 3, -5], [4, -2, -1]), 3);
+```
+
+`dotProduct([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])` should return `130`.
+
+```js
+assert.equal(dotProduct([1, 2, 3, 4, 5], [6, 7, 8, 9, 10]), 130);
+```
+
+`dotProduct([5, 4, 3, 2], [7, 8, 9, 6])` should return `106`.
+
+```js
+assert.equal(dotProduct([5, 4, 3, 2], [7, 8, 9, 6]), 106);
+```
+
+`dotProduct([-5, 4, -3, 2], [-7, -8, 9, -6])` should return `-36`.
+
+```js
+assert.equal(dotProduct([-5, 4, -3, 2], [-7, -8, 9, -6]), -36);
+```
+
+`dotProduct([17, 27, 34, 43, 15], [62, 73, 48, 95, 110])` should return `10392`.
+
+```js
+assert.equal(dotProduct([17, 27, 34, 43, 15], [62, 73, 48, 95, 110]), 10392);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function dotProduct(ary1, ary2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function dotProduct(ary1, ary2) {
+  var dotprod = 0;
+  for (var i = 0; i < ary1.length; i++) dotprod += ary1[i] * ary2[i];
+  return dotprod;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/element-wise-operations.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
new file mode 100644
index 0000000000..52a15c8d11
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/element-wise-operations.md
@@ -0,0 +1,214 @@
+---
+id: 599c333915e0ea32d04d4bec
+title: Element-wise operations
+challengeType: 5
+forumTopicId: 302252
+dashedName: element-wise-operations
+---
+
+# --description--
+
+Implement basic element-wise matrix-matrix and scalar-matrix operations.
+
+**Implement:**
+
+<ul>
+  <li>addition</li>
+  <li>subtraction</li>
+  <li>multiplication</li>
+  <li>division</li>
+  <li>exponentiation</li>
+</ul>
+
+The first parameter will be the operation to be performed, for example, "m_add" for matrix addition and "s_add" for scalar addition. The second and third parameters will be the matrices on which the operations are to be performed.
+
+# --hints--
+
+`operation` should be a function.
+
+```js
+assert(typeof operation === 'function');
+```
+
+`operation("m_add",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[2,4],[6,8]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_add',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [2, 4],
+    [6, 8]
+  ]
+);
+```
+
+`operation("s_add",[[1,2],[3,4]],2)` should return `[[3,4],[5,6]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    's_add',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    2
+  ),
+  [
+    [3, 4],
+    [5, 6]
+  ]
+);
+```
+
+`operation("m_sub",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[0,0],[0,0]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_sub',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [0, 0],
+    [0, 0]
+  ]
+);
+```
+
+`operation("m_mult",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,4],[9,16]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_mult',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 4],
+    [9, 16]
+  ]
+);
+```
+
+`operation("m_div",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,1],[1,1]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_div',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 1],
+    [1, 1]
+  ]
+);
+```
+
+`operation("m_exp",[[1,2],[3,4]],[[1,2],[3,4]])` should return `[[1,4],[27,256]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_exp',
+    [
+      [1, 2],
+      [3, 4]
+    ],
+    [
+      [1, 2],
+      [3, 4]
+    ]
+  ),
+  [
+    [1, 4],
+    [27, 256]
+  ]
+);
+```
+
+`operation("m_add",[[1,2,3,4],[5,6,7,8]],[[9,10,11,12],[13,14,15,16]])` should return `[[10,12,14,16],[18,20,22,24]]`.
+
+```js
+assert.deepEqual(
+  operation(
+    'm_add',
+    [
+      [1, 2, 3, 4],
+      [5, 6, 7, 8]
+    ],
+    [
+      [9, 10, 11, 12],
+      [13, 14, 15, 16]
+    ]
+  ),
+  [
+    [10, 12, 14, 16],
+    [18, 20, 22, 24]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function operation(op, arr1, arr2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function operation(op, arr1, arr2) {
+  const ops = {
+    add: ((a, b) => a + b),
+    sub: ((a, b) => a - b),
+    mult: ((a, b) => a * b),
+    div: ((a, b) => a / b),
+    exp: ((a, b) => Math.pow(a, b))
+  };
+  const ifm = op.startsWith('m');
+  const doOp = ops[op.substring(2)];
+  for (let i = 0; i < arr1.length; i++) {
+    for (let j = 0; j < arr1[0].length; j++) {
+      arr1[i][j] = doOp(arr1[i][j], (ifm) ? (arr2[i][j]) : (arr2));
+    }
+  }
+  return arr1;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/emirp-primes.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/emirp-primes.md
new file mode 100644
index 0000000000..564476da7a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/emirp-primes.md
@@ -0,0 +1,138 @@
+---
+id: 599d0ba974141b0f508b37d5
+title: Emirp primes
+challengeType: 5
+forumTopicId: 302253
+dashedName: emirp-primes
+---
+
+# --description--
+
+An emirp (**prime** spelled backwards) are primes that when reversed (in their decimal representation) are a different prime.
+
+# --instructions--
+
+Write a function that:
+
+<ul>
+  <li>Shows the first <code>n</code> emirp numbers.</li>
+  <li>Shows the emirp numbers in a range.</li>
+  <li>Shows the number of emirps in a range.</li>
+  <li>Shows the <code>n<sup>th</sup></code> emirp number.</li>
+</ul>
+
+The function should accept two parameters. The first will receive `n` or the range as an array. The second will receive a boolean, that specifies if the function returns the emirps as an array or a single number (the number of primes in the range or the <code>n<sup>th</sup></code> prime). According to the parameters the function should return an array or a number.
+
+# --hints--
+
+`emirps` should be a function.
+
+```js
+assert(typeof emirps === 'function');
+```
+
+`emirps(20,true)` should return `[13,17,31,37,71,73,79,97,107,113,149,157,167,179,199,311,337,347,359,389]`
+
+```js
+assert.deepEqual(emirps(20, true), [
+  13,
+  17,
+  31,
+  37,
+  71,
+  73,
+  79,
+  97,
+  107,
+  113,
+  149,
+  157,
+  167,
+  179,
+  199,
+  311,
+  337,
+  347,
+  359,
+  389
+]);
+```
+
+`emirps(1000)` should return `70529`
+
+```js
+assert.deepEqual(emirps(1000), 70529);
+```
+
+`emirps([7700,8000],true)` should return `[7717,7757,7817,7841,7867,7879,7901,7927,7949,7951,7963]`
+
+```js
+assert.deepEqual(emirps([7700, 8000], true), [
+  7717,
+  7757,
+  7817,
+  7841,
+  7867,
+  7879,
+  7901,
+  7927,
+  7949,
+  7951,
+  7963
+]);
+```
+
+`emirps([7700,8000],false)` should return `11`
+
+```js
+assert.deepEqual(emirps([7700, 8000], false), 11);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function emirps(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function emirps(num, showEmirps)
+{
+  const is_prime = function(n)
+    {
+    if (!(n % 2) || !(n % 3)) return false;
+    let p = 1;
+    while (p * p < n)
+                    { if (n % (p += 4) == 0 || n % (p += 2) == 0)
+                            { return false; } }
+    return true;
+  };
+  const is_emirp = function(n) {
+    const r = parseInt(n.toString().split('').reverse().join(''));
+    return r != n && is_prime(n) && is_prime(r);
+  };
+
+  let i,
+    arr = [];
+  if (typeof num === 'number') {
+    for (i = 0; arr.length < num; i++) if (is_emirp(i)) arr.push(i);
+    // first x emirps
+    if (showEmirps) return arr;
+    // xth emirp
+    return arr.pop();
+  }
+
+  if (Array.isArray(num)) {
+    for (i = num[0]; i <= num[1]; i++) if (is_emirp(i)) arr.push(i);
+    // emirps between x .. y
+    if (showEmirps) return arr;
+    // number of emirps between x .. y
+    return arr.length;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/entropy.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/entropy.md
new file mode 100644
index 0000000000..75d61ccc5d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/entropy.md
@@ -0,0 +1,96 @@
+---
+id: 599d15309e88c813a40baf58
+title: Entropy
+challengeType: 5
+forumTopicId: 302254
+dashedName: entropy
+---
+
+# --description--
+
+Calculate the Shannon entropy H of a given input string.
+
+Given the discreet random variable $X$ that is a string of $N$ "symbols" (total characters) consisting of $n$ different characters (n=2 for binary), the Shannon entropy of X in bits/symbol is:
+
+$H_2(X) = -\\sum\_{i=1}^n \\frac{count_i}{N} \\log_2 \\left(\\frac{count_i}{N}\\right)$
+
+where $count_i$ is the count of character $n_i$.
+
+# --hints--
+
+`entropy` should be a function.
+
+```js
+assert(typeof entropy === 'function');
+```
+
+`entropy("0")` should return `0`
+
+```js
+assert.equal(entropy('0'), 0);
+```
+
+`entropy("01")` should return `1`
+
+```js
+assert.equal(entropy('01'), 1);
+```
+
+`entropy("0123")` should return `2`
+
+```js
+assert.equal(entropy('0123'), 2);
+```
+
+`entropy("01234567")` should return `3`
+
+```js
+assert.equal(entropy('01234567'), 3);
+```
+
+`entropy("0123456789abcdef")` should return `4`
+
+```js
+assert.equal(entropy('0123456789abcdef'), 4);
+```
+
+`entropy("1223334444")` should return `1.8464393446710154`
+
+```js
+assert.equal(entropy('1223334444'), 1.8464393446710154);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function entropy(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function entropy(s) {
+    // Create a dictionary of character frequencies and iterate over it.
+  function process(s, evaluator) {
+    let h = Object.create(null),
+      k;
+    s.split('').forEach(c => {
+      h[c] && h[c]++ || (h[c] = 1); });
+    if (evaluator) for (k in h) evaluator(k, h[k]);
+    return h;
+  }
+    // Measure the entropy of a string in bits per symbol.
+
+  let sum = 0,
+    len = s.length;
+  process(s, (k, f) => {
+    const p = f / len;
+    sum -= p * Math.log(p) / Math.log(2);
+  });
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/equilibrium-index.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
new file mode 100644
index 0000000000..a7a33f9d37
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/equilibrium-index.md
@@ -0,0 +1,130 @@
+---
+id: 5987fd532b954e0f21b5d3f6
+title: Equilibrium index
+challengeType: 5
+forumTopicId: 302255
+dashedName: equilibrium-index
+---
+
+# --description--
+
+An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices.
+
+For example, in a sequence $A$:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 = -7$</big></li>
+  <li><big>$A_1 =  1$</big></li>
+  <li><big>$A_2 =  5$</big></li>
+  <li><big>$A_3 =  2$</big></li>
+  <li><big>$A_4 = -4$</big></li>
+  <li><big>$A_5 =  3$</big></li>
+  <li><big>$A_6 =  0$</big></li>
+</ul>
+
+`3` is an equilibrium index, because:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 + A_1 + A_2 = A_4 + A_5 + A_6$</big></li>
+</ul>
+
+`6` is also an equilibrium index, because:
+
+<ul style='list-style: none;'>
+  <li><big>$A_0 + A_1 + A_2 + A_3 + A_4 + A_5 = 0$</big></li>
+</ul>
+
+(sum of zero elements is zero)
+
+`7` is not an equilibrium index, because it is not a valid index of sequence $A$.
+
+# --instructions--
+
+Write a function that, given a sequence, returns its equilibrium indices (if any).
+
+Assume that the sequence may be very long.
+
+# --hints--
+
+`equilibrium` should be a function.
+
+```js
+assert(typeof equilibrium === 'function');
+```
+
+`equilibrium([-7, 1, 5, 2, -4, 3, 0])` should return `[3,6]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[0]), ans[0]);
+```
+
+`equilibrium([2, 4, 6])` should return `[]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[1]), ans[1]);
+```
+
+`equilibrium([2, 9, 2])` should return `[1]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[2]), ans[2]);
+```
+
+`equilibrium([1, -1, 1, -1, 1, -1, 1])` should return `[0,1,2,3,4,5,6]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[3]), ans[3]);
+```
+
+`equilibrium([1])` should return `[0]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[4]), ans[4]);
+```
+
+`equilibrium([])` should return `[]`.
+
+```js
+assert.deepEqual(equilibrium(equilibriumTests[5]), ans[5]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const equilibriumTests =
+  [[-7, 1, 5, 2, -4, 3, 0], // 3, 6
+  [2, 4, 6], // empty
+  [2, 9, 2], // 1
+  [1, -1, 1, -1, 1, -1, 1], // 0,1,2,3,4,5,6
+  [1], // 0
+  [] // empty
+  ];
+const ans = [[3, 6], [], [1], [0, 1, 2, 3, 4, 5, 6], [0], []];
+```
+
+## --seed-contents--
+
+```js
+function equilibrium(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function equilibrium(a) {
+  let N = a.length,
+    i,
+    l = [],
+    r = [],
+    e = [];
+  for (l[0] = a[0], r[N - 1] = a[N - 1], i = 1; i < N; i++)
+    { l[i] = l[i - 1] + a[i], r[N - i - 1] = r[N - i] + a[N - i - 1]; }
+  for (i = 0; i < N; i++)
+    { if (l[i] === r[i]) e.push(i); }
+  return e;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
new file mode 100644
index 0000000000..a6d1c4cb34
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ethiopian-multiplication.md
@@ -0,0 +1,156 @@
+---
+id: 599d1566a02b571412643b84
+title: Ethiopian multiplication
+challengeType: 5
+forumTopicId: 302257
+dashedName: ethiopian-multiplication
+---
+
+# --description--
+
+Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving.
+
+**Method:**
+
+<ol>
+  <li>Take two numbers to be multiplied and write them down at the top of two columns</li>
+  <li>In the left-hand column repeatedly halve the last number, discarding any remainders, and write the result below the last in the same column, until you write a value of <code>1</code></li>
+  <li>In the right-hand column repeatedly double the last number and write the result below. stop when you add a result in the same row as where the left hand column shows <code>1</code></li>
+  <li>Examine the table produced and discard any row where the value in the left column is even</li>
+  <li>Sum the values in the right-hand column that remain to produce the result of multiplying the original two numbers together</li>
+</ol>
+
+**For example:** `17 × 34`
+
+<pre>17   34
+</pre>
+
+Halving the first column:
+
+<pre>17   34
+8
+4
+2
+1
+</pre>
+
+Doubling the second column:
+
+<pre>17   34
+8    68
+4   136
+2   272
+1   544
+</pre>
+
+Strike-out rows whose first cell is even:
+
+<pre>17   34
+8    <strike>68</strike>
+4   <strike>136</strike>
+2   <strike>272</strike>
+1   544
+</pre>
+
+Sum the remaining numbers in the right-hand column:
+
+<!-- markdownlint-disable MD003 -->
+
+<pre>17   34
+8    --
+4   ---
+2   ---
+1   544
+   ====
+    578
+</pre>
+
+<!-- markdownlint-enable MD003 -->
+
+So `17` multiplied by `34`, by the Ethiopian method is `578`.
+
+# --instructions--
+
+The task is to define three named functions/methods/procedures/subroutines:
+
+<ol>
+  <li>one to halve an integer,</li>
+  <li>one to double an integer, and</li>
+  <li>one to state if an integer is even</li>
+</ol>
+
+Use these functions to create a function that does Ethiopian multiplication.
+
+<!-- markdownlint-disable MD046-->
+
+# --hints--
+
+`eth_mult` should be a function.
+
+```js
+assert(typeof eth_mult === 'function');
+```
+
+`eth_mult(17,34)` should return `578`.
+
+```js
+assert.equal(eth_mult(17, 34), 578);
+```
+
+`eth_mult(23,46)` should return `1058`.
+
+```js
+assert.equal(eth_mult(23, 46), 1058);
+```
+
+`eth_mult(12,27)` should return `324`.
+
+```js
+assert.equal(eth_mult(12, 27), 324);
+```
+
+`eth_mult(56,98)` should return `5488`.
+
+```js
+assert.equal(eth_mult(56, 98), 5488);
+```
+
+`eth_mult(63,74)` should return `4662`.
+
+```js
+assert.equal(eth_mult(63, 74), 4662);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function eth_mult(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function eth_mult(a, b) {
+  let sum = 0; a = [a]; b = [b];
+
+  let half = a => a / 2,
+    double = a => a * 2,
+    is_even = a => a % 2 == 0;
+
+  while (a[0] !== 1) {
+    a.unshift(Math.floor(half(a[0])));
+    b.unshift(double(b[0]));
+  }
+
+  for (let i = a.length - 1; i > 0; i -= 1) {
+    if (!is_even(a[i])) {
+      sum += b[i];
+    }
+  }
+  return sum + b[0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/euler-method.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/euler-method.md
new file mode 100644
index 0000000000..86f2d9c75e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/euler-method.md
@@ -0,0 +1,152 @@
+---
+id: 59880443fb36441083c6c20e
+title: Euler method
+challengeType: 5
+forumTopicId: 302258
+dashedName: euler-method
+---
+
+# --description--
+
+Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value. It is an explicit method for solving initial value problems (IVPs), as described in [the wikipedia page](<https://en.wikipedia.org/wiki/Euler method> "wp: Euler method").
+
+The ODE has to be provided in the following form:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dy(t)}{dt} = f(t,y(t))$</big></li>
+</ul>
+
+with an initial value
+
+<ul style='list-style: none;'>
+  <li><big>$y(t_0) = y_0$</big></li>
+</ul>
+
+To get a numeric solution, we replace the derivative on the LHS with a finite difference approximation:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dy(t)}{dt}  \approx \frac{y(t+h)-y(t)}{h}$</big></li>
+</ul>
+
+then solve for $y(t+h)$:
+
+<ul style='list-style: none;'>
+  <li><big>$y(t+h) \approx y(t) + h \, \frac{dy(t)}{dt}$</big></li>
+</ul>
+
+which is the same as
+
+<ul style='list-style: none;'>
+  <li><big>$y(t+h) \approx y(t) + h \, f(t,y(t))$</big></li>
+</ul>
+
+The iterative solution rule is then:
+
+<ul style='list-style: none;'>
+  <li><big>$y_{n+1} = y_n + h \, f(t_n, y_n)$</big></li>
+</ul>
+
+where $h$ is the step size, the most relevant parameter for accuracy of the solution. A smaller step size increases accuracy but also the computation cost, so it has always has to be hand-picked according to the problem at hand.
+
+**Example: Newton's Cooling Law**
+
+Newton's cooling law describes how an object of initial temperature $T(t_0) = T_0$ cools down in an environment of temperature $T_R$:
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dT(t)}{dt} = -k \, \Delta T$</big></li>
+</ul>
+
+or
+
+<ul style='list-style: none;'>
+  <li><big>$\frac{dT(t)}{dt} = -k \, (T(t) - T_R)$</big></li>
+</ul>
+
+It says that the cooling rate $\\frac{dT(t)}{dt}$ of the object is proportional to the current temperature difference $\\Delta T = (T(t) - T_R)$ to the surrounding environment.
+
+The analytical solution, which we will compare to the numerical approximation, is
+
+<ul style='list-style: none;'>
+  <li><big>$T(t) = T_R + (T_0 - T_R) \; e^{-k t}$</big></li>
+</ul>
+
+# --instructions--
+
+Implement a routine of Euler's method and then use it to solve the given example of Newton's cooling law for three different step sizes of:
+
+<ul>
+  <li><code>2 s</code></li>
+  <li><code>5 s</code> and</li>
+  <li><code>10 s</code></li>
+</ul>
+
+and compare with the analytical solution.
+
+**Initial values:**
+
+<ul>
+  <li>initial temperature <big>$T_0$</big> shall be <code>100 °C</code></li>
+  <li>room temperature <big>$T_R$</big> shall be <code>20 °C</code></li>
+  <li>cooling constant <big>$k$</big> shall be <code>0.07</code></li>
+  <li>time interval to calculate shall be from <code>0 s</code> to <code>100 s</code></li>
+</ul>  
+
+First parameter to the function is initial time, second parameter is initial temperature, third parameter is elapsed time and fourth parameter is step size.
+
+# --hints--
+
+`eulersMethod` should be a function.
+
+```js
+assert(typeof eulersMethod === 'function');
+```
+
+`eulersMethod(0, 100, 100, 2)` should return a number.
+
+```js
+assert(typeof eulersMethod(0, 100, 100, 2) === 'number');
+```
+
+`eulersMethod(0, 100, 100, 2)` should return 20.0424631833732.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 2), 20.0424631833732);
+```
+
+`eulersMethod(0, 100, 100, 5)` should return 20.01449963666907.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 5), 20.01449963666907);
+```
+
+`eulersMethod(0, 100, 100, 10)` should return 20.000472392.
+
+```js
+assert.equal(eulersMethod(0, 100, 100, 10), 20.000472392);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function eulersMethod(x1, y1, x2, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function eulersMethod(x1, y1, x2, h) {
+  let x = x1;
+  let y = y1;
+
+  while ((x < x2 && x1 < x2) || (x > x2 && x1 > x2)) {
+    y += h * (-0.07 * (y - 20));
+    x += h;
+  }
+
+  return y;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
new file mode 100644
index 0000000000..5b48751996
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.md
@@ -0,0 +1,74 @@
+---
+id: 598de241872ef8353c58a7a2
+title: Evaluate binomial coefficients
+challengeType: 5
+forumTopicId: 302259
+dashedName: evaluate-binomial-coefficients
+---
+
+# --description--
+
+Write a function to calculate the binomial coefficient for the given value of n and k.
+
+This formula is recommended:
+
+$\\binom{n}{k} = \\frac{n!}{(n-k)!k!} = \\frac{n(n-1)(n-2)\\ldots(n-k+1)}{k(k-1)(k-2)\\ldots 1}$
+
+# --hints--
+
+`binom` should be a function.
+
+```js
+assert(typeof binom === 'function');
+```
+
+`binom(5,3)` should return 10.
+
+```js
+assert.equal(binom(5, 3), 10);
+```
+
+`binom(7,2)` should return 21.
+
+```js
+assert.equal(binom(7, 2), 21);
+```
+
+`binom(10,4)` should return 210.
+
+```js
+assert.equal(binom(10, 4), 210);
+```
+
+`binom(6,1)` should return 6.
+
+```js
+assert.equal(binom(6, 1), 6);
+```
+
+`binom(12,8)` should return 495.
+
+```js
+assert.equal(binom(12, 8), 495);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function binom(n, k) {
+
+}
+```
+
+# --solutions--
+
+```js
+function binom(n, k) {
+  let coeff = 1;
+  for (let i = n - k + 1; i <= n; i++) coeff *= i;
+  for (let i = 1; i <= k; i++) coeff /= i;
+  return coeff;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
new file mode 100644
index 0000000000..5dffbaf6cb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.md
@@ -0,0 +1,246 @@
+---
+id: 59e09e6d412c5939baa02d16
+title: Execute a Markov algorithm
+challengeType: 5
+forumTopicId: 302260
+dashedName: execute-a-markov-algorithm
+---
+
+# --description--
+
+Create an interpreter for a [Markov Algorithm](<https://en.wikipedia.org/wiki/Markov algorithm> "wp: Markov algorithm").
+
+Rules have the syntax:
+
+<pre>[ruleset] ::= (([comment] | [rule]) [newline]+)*
+[comment] ::= # {[any character]}
+[rule] ::= [pattern] [whitespace] -> [whitespace] [.] [replacement]
+[whitespace] ::= ([tab] | [space]) [[whitespace]]
+</pre>
+
+There is one rule per line.
+
+If there is a `.` (period) present before the \[replacement], then this is a terminating rule in which case the interpreter must halt execution.
+
+A ruleset consists of a sequence of rules, with optional comments.
+
+Rulesets
+
+Use the following tests on entries:
+
+**Ruleset 1:**
+
+<pre># This rules file is extracted from Wikipedia:
+# <code>http://en.wikipedia.org/wiki/Markov_Algorithm</code>
+A -> apple
+B -> bag
+S -> shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As from T S.` should generate the output `I bought a bag of apples from my brother.`
+
+**Ruleset 2:**
+
+A test of the terminating rule
+
+<pre># Slightly modified from the rules on Wikipedia
+A -> apple
+B -> bag
+S -> .shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As from T S.` should generate `I bought a bag of apples from T shop.`
+
+**Ruleset 3:**
+
+This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
+
+<pre># BNF Syntax testing rules
+A -> apple
+WWWW -> with
+Bgage -> ->.*
+B -> bag
+->.* -> money
+W -> WW
+S -> .shop
+T -> the
+the shop -> my brother
+a never used -> .terminating rule
+</pre>
+
+Sample text of `I bought a B of As W my Bgage from T S.` should generate `I bought a bag of apples with my money from T shop.`
+
+**Ruleset 4:**
+
+This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.)
+
+<pre>### Unary Multiplication Engine, for testing Markov Algorithm implementations
+### By Donal Fellows.
+# Unary addition engine
+_+1 -> _1+
+1+1 -> 11+
+# Pass for converting from the splitting of multiplication into ordinary
+# addition
+1! -> !1
+,! -> !+
+_! -> _
+# Unary multiplication by duplicating left side, right side times
+1*1 -> x,@y
+1x -> xX
+X, -> 1,1
+X1 -> 1X
+_x -> _X
+,x -> ,X
+y1 -> 1y
+y_ -> _
+# Next phase of applying
+1@1 -> x,@y
+1@_ -> @_
+,@_ -> !_
+++ -> +
+# Termination cleanup for addition
+_1 -> 1
+1+_ -> 1
+_+_ ->
+</pre>
+
+Sample text of `_1111*11111_` should generate the output `11111111111111111111`
+
+**Ruleset 5:**
+
+A simple [Turing machine](http://en.wikipedia.org/wiki/Turing_machine "link: http&#x3A;//en.wikipedia.org/wiki/Turing_machine"), implementing a three-state [busy beaver](http://en.wikipedia.org/wiki/Busy_beaver "link: http&#x3A;//en.wikipedia.org/wiki/Busy_beaver").
+
+The tape consists of `0`s and `1`s, the states are `A`, `B`, `C` and `H` (for `H`alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
+
+Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
+
+<pre># Turing machine: three-state busy beaver
+#
+# state A, symbol 0 => write 1, move right, new state B
+A0 -> 1B
+# state A, symbol 1 => write 1, move left, new state C
+0A1 -> C01
+1A1 -> C11
+# state B, symbol 0 => write 1, move left, new state A
+0B0 -> A01
+1B0 -> A11
+# state B, symbol 1 => write 1, move right, new state B
+B1 -> 1B
+# state C, symbol 0 => write 1, move left, new state B
+0C0 -> B01
+1C0 -> B11
+# state C, symbol 1 => write 1, move left, halt
+0C1 -> H01
+1C1 -> H11
+</pre>
+
+This ruleset should turn `000000A000000` into `00011H1111000`
+
+# --hints--
+
+`markov` should be a function.
+
+```js
+assert(typeof markov === 'function');
+```
+
+`markov(["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from my brother.".
+
+```js
+assert.deepEqual(markov(rules[0], tests[0]), outputs[0]);
+```
+
+`markov(["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As from T S.")` should return "I bought a bag of apples from T shop.".
+
+```js
+assert.deepEqual(markov(rules[1], tests[1]), outputs[1]);
+```
+
+`markov(["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],"I bought a B of As W my Bgage from T S.")` should return "I bought a bag of apples with my money from T shop.".
+
+```js
+assert.deepEqual(markov(rules[2], tests[2]), outputs[2]);
+```
+
+`markov(["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],"_1111*11111_")` should return "11111111111111111111".
+
+```js
+assert.deepEqual(markov(rules[3], tests[3]), outputs[3]);
+```
+
+`markov(["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"],"")` should return "00011H1111000".
+
+```js
+assert.deepEqual(markov(rules[4], tests[4]), outputs[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+
+let rules=[["A -> apple","B -> bag","S -> shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["A -> apple","B -> bag","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["A -> apple","WWWW -> with","Bgage -> ->.*","B -> bag","->.* -> money","W -> WW","S -> .shop","T -> the","the shop -> my brother","a never used -> .terminating rule"],
+            ["_+1 -> _1+","1+1 -> 11+","1! -> !1",",! -> !+","_! -> _","1*1 -> x,@y","1x -> xX","X, -> 1,1","X1 -> 1X","_x -> _X",",x -> ,X","y1 -> 1y","y_ -> _","1@1 -> x,@y","1@_ -> @_",",@_ -> !_","++ -> +","_1 -> 1","1+_ -> 1","_+_ -> "],
+            ["A0 -> 1B","0A1 -> C01","1A1 -> C11","0B0 -> A01","1B0 -> A11","B1 -> 1B","0C0 -> B01","1C0 -> B11","0C1 -> H01","1C1 -> H11"]];
+let tests=["I bought a B of As from T S.",
+            "I bought a B of As from T S.",
+            "I bought a B of As W my Bgage from T S.",
+            "_1111*11111_",
+            "000000A000000"];
+let outputs=["I bought a bag of apples from my brother.",
+            "I bought a bag of apples from T shop.",
+            "I bought a bag of apples with my money from T shop.",
+            "11111111111111111111",
+            "00011H1111000"]
+
+```
+
+
+## --seed-contents--
+
+```js
+function markov(rules,test) {
+
+}
+```
+
+# --solutions--
+
+```js
+function markov(rules,test) {
+    let pattern = new RegExp("^([^#]*?)\\s+->\\s+(\\.?)(.*)");
+    let origTest = test;
+
+    let captures = [];
+
+    rules.forEach(function(rule){
+        let m = pattern.exec(rule);
+        for (let j = 0; j < m.length; j++)
+            m[j] = m[j + 1];
+        captures.push(m);
+    });
+
+    test = origTest;
+    let copy = test;
+    for (let j = 0; j < captures.length; j++) {
+        let c = captures[j];
+        test = test.replace(c[0], c[2]);
+        if (c[1]==".")
+            break;
+        if (test!=copy) {
+            j = -1;
+            copy = test;
+        }
+    }
+    return test;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-brain.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-brain.md
new file mode 100644
index 0000000000..a1dc29757d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/execute-brain.md
@@ -0,0 +1,202 @@
+---
+id: 59e0a8df964e4540d5abe599
+title: Execute Brain****
+challengeType: 5
+forumTopicId: 302261
+dashedName: execute-brain
+---
+
+# --description--
+
+Write a function to implement a Brain\*\*\*\* interpreter. The function will take a string as a parameter and should return a string as the output. More details are given below:
+
+RCBF is a set of [Brainf\*\*\*](https://rosettacode.org/wiki/Brainf*** "Brainf\*\*\*") compilers and interpreters written for Rosetta Code in a variety of languages.
+
+Below are links to each of the versions of RCBF.
+
+An implementation need only properly implement the following instructions:
+
+| Command           | Description                                                                        |
+| ----------------- | ---------------------------------------------------------------------------------- |
+| <code>></code>    | Move the pointer to the right                                                      |
+| <code>&lt;</code> | Move the pointer to the left                                                       |
+| <code>+</code>    | Increment the memory cell under the pointer                                        |
+| <code>-</code>    | Decrement the memory cell under the pointer                                        |
+| <code>.</code>    | Output the character signified by the cell at the pointer                          |
+| <code>,</code>    | Input a character and store it in the cell at the pointer                          |
+| <code>\[</code>   | Jump past the matching <code>]</code> if the cell under the pointer is 0           |
+| <code>]</code>    | Jump back to the matching <code>\[</code> if the cell under the pointer is nonzero |
+
+Any cell size is allowed, EOF (*E*nd-*O*-*F*ile) support is optional, as is whether you have bounded or unbounded memory.
+
+# --hints--
+
+`brain(bye)` should return a string
+
+```js
+assert(typeof brain(bye) === 'string');
+```
+
+`brain("++++++[>++++++++++<-]>+++++.")` should return "A"
+
+```js
+assert.equal(brain('++++++[>++++++++++<-]>+++++.'), 'A');
+```
+
+`brain(bye)` should return `Goodbye, World!\r\n`
+
+```js
+assert.equal(brain(bye), 'Goodbye, World!\r\n');
+```
+
+`brain(hello)` should return `Hello World!\n`
+
+```js
+assert.equal(brain(hello), 'Hello World!\n');
+```
+
+`brain(fib)` should return `1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89`
+
+```js
+assert.equal(brain(fib), '1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89');
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+let fib=`+
+
+++
+
++++
+
+++++
+
++>+>>
+
+>>++++
+
++++++++
+
+++++++++
+
++++++++++
+
+++++++++++
+
+++++++>++++
+
+++++++++++++
+
++++++++++++++
+
++++<<<<<<[>[>>
+
+>>>>+>+<<<<<<<-
+
+]>>>>>>>[<<<<<<<
+
++>>>>>>>-]<[>++++
+
+++++++[-<-[>>+>+<<
+
+<-]>>>[<<<+>>>-]+<[
+
+>[-]<[-]]>[<<[>>>+<<
+
+<-]>>[-]]<<]>>>[>>+>+
+
+<<<-]>>>[<<<+>>>-]+<[>
+
+[-]<[-]]>[<<+>>[-]]<<<<
+
+<<<]>>>>>[++++++++++++++
+
++++++++++++++++++++++++++
+
++++++++++.[-]]++++++++++<[
+
+->-<]>+++++++++++++++++++++
+
++++++++++++++++++++++++++++.
+
+[-]<<<<<<<<<<<<[>>>+>+<<<<-]>
+
+>>>[<<<<+>>>>-]<-[>>.>.<<<[-]]
+
+<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+
+
+>-]>[<+>-]<<<-]`;
+let hello='++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.'
+let bye='++++++++++[>+>+++>++++>+++++++>++++++++>+++++++++>++++++++++>+++++++++++>++++++++++++<<<<<<<<<-]>>>>+.>>>>+..<.<++++++++.>>>+.<<+.<<<<++++.<++.>>>+++++++.>>>.+++.<+++++++.--------.<<<<<+.<+++.---.';
+```
+
+## --seed-contents--
+
+```js
+function brain(prog) {
+
+}
+```
+
+# --solutions--
+
+```js
+function brain(prog){
+  var output="";
+    var code; // formatted code
+  var ip = 0; // current instruction within code
+  var nest = 0; // current bracket nesting (for Out button)
+  var ahead = []; // locations of matching brackets
+
+  var data = [0]; // data array (mod by +, -)
+  var dp = 0; // index into data (mod by <, >)
+
+  var inp = 0; // current input character (fetch with ,)
+  var quit = 0;
+    var commands = {
+    '>':function() { if (++dp >= data.length) data[dp]=0 },
+    '<':function() { if (--dp < 0) quit++ },
+    '+':function() { ++data[dp] },
+    '-':function() { --data[dp] },
+    '[':function() { if (!data[dp]) ip = ahead[ip]; else ++nest },
+    ']':function() { if ( data[dp]) ip = ahead[ip]; else --nest },
+    ',':function() {
+        var c = document.getElementById("input").value.charCodeAt(inp++);
+        data[dp] = isNaN(c) ? 0 : c; // EOF: other options are -1 or no change
+    },
+    '.':function() {
+            output+=String.fromCharCode(data[dp]);
+            /*var s = document.getElementById("output").innerHTML)
+             + String.fromCharCode(data[dp]);
+            s = s.replace(/\n/g,"<br>").replace(/ /g,"&amp;nbsp;");
+            document.getElementById("output").innerHTML = s;*/
+        },
+    };
+
+    let ar=prog.split('');
+    var st = [], back, error = -1;
+    for (ip=0; ip<ar.length; ip++) {
+        switch(ar[ip]) {
+        case '[':
+            st.push(ip);
+            break;
+        case ']':
+            if (st.length == 0) error = ip;
+            back = st.pop();
+            ahead[ip] = back;
+            ahead[back] = ip;
+            break;
+        }
+    }
+
+    for(ip=0;ip<ar.length;ip++){
+    if(commands.hasOwnProperty(ar[ip]))
+          commands[ar[ip]]();
+    }
+
+    return output;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
new file mode 100644
index 0000000000..620da453ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md
@@ -0,0 +1,139 @@
+---
+id: 598ee8b91b410510ae82efef
+title: Extensible prime generator
+challengeType: 5
+forumTopicId: 302262
+dashedName: extensible-prime-generator
+---
+
+# --description--
+
+Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime.
+
+The generator should be able to:
+
+<ul>
+  <li>Show the first <code>n</code> prime numbers</li>
+  <li>Show the prime numbers in a range</li>
+  <li>Show the number of primes in a range</li>
+  <li>Show the <code>n<sup>th</sup></code> prime number</li>
+</ul>
+
+The function should have two parameters. The first will receive `n` or the range as an array. The second will receive a boolean, that specifies if the function returns the prime numbers as an array or a single number(the number of primes in the range or the <code>n<sup>th</sup></code> prime). According to the parameters the function should return an array.
+
+# --hints--
+
+`primeGenerator` should be a function.
+
+```js
+assert(typeof primeGenerator === 'function');
+```
+
+`primeGenerator(20, true)` should return `[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71]`.
+
+```js
+assert.deepEqual(primeGenerator(20, true), [
+  2,
+  3,
+  5,
+  7,
+  11,
+  13,
+  17,
+  19,
+  23,
+  29,
+  31,
+  37,
+  41,
+  43,
+  47,
+  53,
+  59,
+  61,
+  67,
+  71
+]);
+```
+
+`primeGenerator([100, 150], true)` should return `[101, 103, 107, 109, 113, 127, 131, 137, 139, 149]`.
+
+```js
+assert.deepEqual(primeGenerator([100, 150], true), [
+  101,
+  103,
+  107,
+  109,
+  113,
+  127,
+  131,
+  137,
+  139,
+  149
+]);
+```
+
+`primeGenerator([7700, 8000], false)` should return `30`.
+
+```js
+assert.equal(primeGenerator([7700, 8000], false), 30);
+```
+
+`primeGenerator(10000, false)` should return `104729`.
+
+```js
+assert.equal(primeGenerator(10000, false), 104729);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeGenerator(num, showPrimes) {
+
+}
+```
+
+# --solutions--
+
+```js
+function primeGenerator(num, showPrimes) {
+  let i,
+    arr = [];
+
+  function isPrime(num) {
+    // try primes <= 16
+    if (num <= 16) { return (
+      num == 2 || num == 3 || num == 5 || num == 7 || num == 11 || num == 13
+    ); }
+    // cull multiples of 2, 3, 5 or 7
+    if (num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num % 7 == 0)
+      { return false; }
+    // cull square numbers ending in 1, 3, 7 or 9
+    for (let i = 10; i * i <= num; i += 10) {
+      if (num % (i + 1) == 0) return false;
+      if (num % (i + 3) == 0) return false;
+      if (num % (i + 7) == 0) return false;
+      if (num % (i + 9) == 0) return false;
+    }
+    return true;
+  }
+
+  if (typeof num === 'number') {
+    for (i = 0; arr.length < num; i++) if (isPrime(i)) arr.push(i);
+    // first x primes
+    if (showPrimes) return arr;
+    // xth prime
+    return arr.pop();
+  }
+
+  if (Array.isArray(num)) {
+    for (i = num[0]; i <= num[1]; i++) if (isPrime(i)) arr.push(i);
+    // primes between x .. y
+    if (showPrimes) return arr;
+    // number of primes between x .. y
+    return arr.length;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factorial.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factorial.md
new file mode 100644
index 0000000000..f58bdffe25
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factorial.md
@@ -0,0 +1,80 @@
+---
+id: 597b2b2a2702b44414742771
+title: Factorial
+challengeType: 5
+forumTopicId: 302263
+dashedName: factorial
+---
+
+# --description--
+
+Write a function to return the factorial of a number.
+
+Factorial of a number is given by:
+
+<pre><big>n! = n * (n-1) * (n-2) * ..... * 1</big>
+</pre>
+
+For example:
+
+<ul>
+  <li><code>3! = 3 * 2 * 1 = 6</code></li>
+  <li><code>4! = 4 * 3 * 2 * 1 = 24</code></li>
+</ul>
+
+**Note:** `0! = 1`
+
+# --hints--
+
+`factorial` should be a function.
+
+```js
+assert(typeof factorial === 'function');
+```
+
+`factorial(2)` should return a number.
+
+```js
+assert(typeof factorial(2) === 'number');
+```
+
+`factorial(3)` should return 6.
+
+```js
+assert.equal(factorial(3), 6);
+```
+
+`factorial(5)` should return 120.
+
+```js
+assert.equal(factorial(5), 120);
+```
+
+`factorial(10)` should return 3,628,800.
+
+```js
+assert.equal(factorial(10), 3628800);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function factorial(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function factorial(n) {
+  let sum = 1;
+  while (n > 1) {
+    sum *= n;
+    n--;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
new file mode 100644
index 0000000000..273062a0cf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-a-mersenne-number.md
@@ -0,0 +1,148 @@
+---
+id: 598eea87e5cf4b116c3ff81a
+title: Factors of a Mersenne number
+challengeType: 5
+forumTopicId: 302264
+dashedName: factors-of-a-mersenne-number
+---
+
+# --description--
+
+A Mersenne number is a number in the form of <code>2<sup>P</sup>-1</code>.
+
+If `P` is prime, the Mersenne number may be a Mersenne prime. (If `P` is not prime, the Mersenne number is also not prime.)
+
+In the search for Mersenne prime numbers it is advantageous to eliminate exponents by finding a small factor before starting a, potentially lengthy, [Lucas-Lehmer test](<https://rosettacode.org/wiki/Lucas-Lehmer test> "Lucas-Lehmer test").
+
+There are very efficient algorithms for determining if a number divides <code>2<sup>P</sup>-1</code> (or equivalently, if <code>2<sup>P</sup> mod (the number) = 1</code>).
+
+Some languages already have built-in implementations of this exponent-and-mod operation (called modPow or similar).
+
+The following is how to implement this modPow yourself:
+
+For example, let's compute <code>2<sup>23</sup> mod 47</code>.
+
+Convert the exponent 23 to binary, you get 10111. Starting with <code><tt>square</tt> = 1</code>, repeatedly square it.
+
+Remove the top bit of the exponent, and if it's 1 multiply `square` by the base of the exponentiation (2), then compute <code><tt>square</tt> modulo 47</code>.
+
+Use the result of the modulo from the last step as the initial value of `square` in the next step:
+
+<pre>Remove   Optional
+square        top bit  multiply by 2  mod 47
+------------  -------  -------------  ------
+1*1 = 1       1  0111  1*2 = 2           2
+2*2 = 4       0   111     no             4
+4*4 = 16      1    11  16*2 = 32        32
+32*32 = 1024  1     1  1024*2 = 2048    27
+27*27 = 729   1        729*2 = 1458      1
+</pre>
+
+Since <code>2<sup>23</sup> mod 47 = 1</code>, 47 is a factor of <code>2<sup>P</sup>-1</code>.
+
+(To see this, subtract 1 from both sides: <code>2<sup>23</sup>-1 = 0 mod 47</code>.)
+
+Since we've shown that 47 is a factor, <code>2<sup>23</sup>-1</code> is not prime.
+
+Further properties of Mersenne numbers allow us to refine the process even more.
+
+Any factor `q` of <code>2<sup>P</sup>-1</code> must be of the form `2kP+1`, `k` being a positive integer or zero. Furthermore, `q` must be `1` or `7 mod 8`.
+
+Finally any potential factor `q` must be [prime](<https://rosettacode.org/wiki/Primality by Trial Division> "Primality by Trial Division").
+
+As in other trial division algorithms, the algorithm stops when `2kP+1 > sqrt(N)`.These primarily tests only work on Mersenne numbers where `P` is prime. For example, <code>M<sub>4</sub>=15</code> yields no factors using these techniques, but factors into 3 and 5, neither of which fit `2kP+1`.
+
+# --instructions--
+
+Using the above method find a factor of <code>2<sup>p</sup>-1</code>.
+
+# --hints--
+
+`check_mersenne` should be a function.
+
+```js
+assert(typeof check_mersenne === 'function');
+```
+
+`check_mersenne(3)` should return a string.
+
+```js
+assert(typeof check_mersenne(3) == 'string');
+```
+
+`check_mersenne(3)` should return the string `M3 = 2^3-1 is prime`.
+
+```js
+assert.equal(check_mersenne(3), 'M3 = 2^3-1 is prime');
+```
+
+`check_mersenne(23)` should return the string `M23 = 2^23-1 is composite with factor 47`.
+
+```js
+assert.equal(check_mersenne(23), 'M23 = 2^23-1 is composite with factor 47');
+```
+
+`check_mersenne(929)` should return the string `M929 = 2^929-1 is composite with factor 13007`.
+
+```js
+assert.equal(
+  check_mersenne(929),
+  'M929 = 2^929-1 is composite with factor 13007'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function check_mersenne(p) {
+
+}
+```
+
+# --solutions--
+
+```js
+function check_mersenne(p){
+    function isPrime(value){
+      for (let i=2; i < value; i++){
+        if (value % i == 0){
+          return false;
+        }
+        if (value % i != 0){
+          return true;
+         }
+      }
+    }
+
+    function trial_factor(base, exp, mod){
+      let square, bits;
+      square = 1;
+      bits = exp.toString(2).split('');
+      for (let i=0,ln=bits.length; i<ln; i++){
+        square = Math.pow(square, 2) * (bits[i] == 1 ? base : 1) % mod;
+      }
+      return (square == 1);
+    }
+
+    function mersenne_factor(p){
+      let limit, k, q;
+      limit = Math.sqrt(Math.pow(2,p) - 1);
+      k = 1;
+      while ((2*k*p - 1) < limit){
+        q = 2*k*p + 1;
+        if (isPrime(q) && (q % 8 == 1 || q % 8 == 7) && trial_factor(2,p,q)){
+          return q; // q is a factor of 2**p-1
+        }
+        k++;
+      }
+      return null;
+    }
+  let f, result;
+  result="M"+p+" = 2^"+p+"-1 is ";
+  f = mersenne_factor(p);
+  result+=f == null ? "prime" : "composite with factor "+f;
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
new file mode 100644
index 0000000000..31d9b722b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md
@@ -0,0 +1,74 @@
+---
+id: 597f1e7fbc206f0e9ba95dc4
+title: Factors of an integer
+challengeType: 5
+forumTopicId: 302265
+dashedName: factors-of-an-integer
+---
+
+# --description--
+
+Write a function that returns the factors of a positive integer as an array.
+
+These factors are the positive integers by which the number being factored can be divided to yield a positive integer result.
+
+# --hints--
+
+`factors` should be a function.
+
+```js
+assert(typeof factors === 'function');
+```
+
+`factors(45)` should return `[1,3,5,9,15,45]`.
+
+```js
+assert.deepEqual(factors(45), ans[0]);
+```
+
+`factors(53)` should return `[1,53]`.
+
+```js
+assert.deepEqual(factors(53), ans[1]);
+```
+
+`factors(64)` should return `[1,2,4,8,16,32,64]`.
+
+```js
+assert.deepEqual(factors(64), ans[2]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ans=[[1,3,5,9,15,45],[1,53],[1,2,4,8,16,32,64]];
+```
+
+## --seed-contents--
+
+```js
+function factors(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function factors(num)
+{
+ let n_factors = [], i, sqr=Math.floor(Math.sqrt(num));
+
+ for (i = 1; i <=sqr ; i += 1)
+  if (num % i === 0)
+  {
+   n_factors.push(i);
+   if (num / i !== i)
+    n_factors.push(num / i);
+  }
+ n_factors.sort(function(a, b){return a - b;});
+ return n_factors;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/farey-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/farey-sequence.md
new file mode 100644
index 0000000000..8e508d134c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/farey-sequence.md
@@ -0,0 +1,109 @@
+---
+id: 59c3ec9f15068017c96eb8a3
+title: Farey sequence
+challengeType: 5
+forumTopicId: 302266
+dashedName: farey-sequence
+---
+
+# --description--
+
+The [Farey sequence](<https://en.wikipedia.org/wiki/Farey sequence> "wp: Farey sequence") <code>F<sub>n</sub></code> of order `n` is the sequence of completely reduced fractions between `0` and `1` which, when in lowest terms, have denominators less than or equal to `n`, arranged in order of increasing size.
+
+The *Farey sequence* is sometimes incorrectly called a *Farey series*.
+
+Each Farey sequence:
+
+<ul>
+  <li>starts with the value  0,  denoted by the fraction  $ \frac{0}{1} $</li>
+  <li>ends with the value  1,  denoted by the fraction  $ \frac{1}{1}$.</li>
+</ul>
+
+The Farey sequences of orders `1` to `5` are:
+
+<ul>
+  <li style='list-style: none;'>${\bf\it{F}}_1 = \frac{0}{1}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_2 = \frac{0}{1}, \frac{1}{2}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_3 = \frac{0}{1}, \frac{1}{3}, \frac{1}{2}, \frac{2}{3}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_4 = \frac{0}{1}, \frac{1}{4}, \frac{1}{3}, \frac{1}{2}, \frac{2}{3}, \frac{3}{4}, \frac{1}{1}$</li>
+  <li style='list-style: none;'>${\bf\it{F}}_5 = \frac{0}{1}, \frac{1}{5}, \frac{1}{4}, \frac{1}{3}, \frac{2}{5}, \frac{1}{2}, \frac{3}{5}, \frac{2}{3}, \frac{3}{4}, \frac{4}{5}, \frac{1}{1}$</li>
+</ul>
+
+# --instructions--
+
+Write a function that returns the Farey sequence of order `n`. The function should have one parameter that is `n`. It should return the sequence as an array.
+
+# --hints--
+
+`farey` should be a function.
+
+```js
+assert(typeof farey === 'function');
+```
+
+`farey(3)` should return an array
+
+```js
+assert(Array.isArray(farey(3)));
+```
+
+`farey(3)` should return `["1/3","1/2","2/3"]`
+
+```js
+assert.deepEqual(farey(3), ['1/3', '1/2', '2/3']);
+```
+
+`farey(4)` should return `["1/4","1/3","1/2","2/4","2/3","3/4"]`
+
+```js
+assert.deepEqual(farey(4), ['1/4', '1/3', '1/2', '2/4', '2/3', '3/4']);
+```
+
+`farey(5)` should return `["1/5","1/4","1/3","2/5","1/2","2/4","3/5","2/3","3/4","4/5"]`
+
+```js
+assert.deepEqual(farey(5), [
+  '1/5',
+  '1/4',
+  '1/3',
+  '2/5',
+  '1/2',
+  '2/4',
+  '3/5',
+  '2/3',
+  '3/4',
+  '4/5'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function farey(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function farey(n){
+    let farSeq=[];
+    for(let den = 1; den <= n; den++){
+        for(let num = 1; num < den; num++){
+            farSeq.push({
+                str:num+"/"+den,
+                val:num/den});
+        }
+    }
+    farSeq.sort(function(a,b){
+        return a.val-b.val;
+    });
+    farSeq=farSeq.map(function(a){
+        return a.str;
+    });
+    return farSeq;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
new file mode 100644
index 0000000000..6791320f73
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-n-step-number-sequences.md
@@ -0,0 +1,133 @@
+---
+id: 598eef80ba501f1268170e1e
+title: Fibonacci n-step number sequences
+challengeType: 5
+forumTopicId: 302267
+dashedName: fibonacci-n-step-number-sequences
+---
+
+# --description--
+
+These number series are an expansion of the ordinary [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence> "Fibonacci sequence") where:
+
+<ol>
+  <li>For $n = 2$ we have the Fibonacci sequence; with initial values $[1, 1]$ and $F_k^2 = F_{k-1}^2 + F_{k-2}^2$</li>
+  <li>For $n = 3$ we have the tribonacci sequence; with initial values $[1, 1, 2]$ and $F_k^3 = F_{k-1}^3 + F_{k-2}^3 + F_{k-3}^3$</li>
+  <li>For $n = 4$ we have the tetranacci sequence; with initial values $[1, 1, 2, 4]$ and $F_k^4 = F_{k-1}^4 + F_{k-2}^4 + F_{k-3}^4 + F_{k-4}^4$...</li>
+  <li>For general $n>2$ we have the Fibonacci $n$-step sequence - $F_k^n$; with initial values of the first $n$ values of the $(n-1)$'th Fibonacci $n$-step sequence $F_k^{n-1}$; and $k$'th value of this $n$'th sequence being $F_k^n = \sum_{i=1}^{(n)} {F_{k-i}^{(n)}}$</li>
+</ol>
+
+For small values of $n$, [Greek numeric prefixes](<https://en.wikipedia.org/wiki/Number prefix#Greek_series> "wp: Number prefix#Greek_series") are sometimes used to individually name each series.
+
+Fibonacci $n$-step sequences:
+
+| $n$ | Series name | Values                                                 |
+| --- | ----------- | ------------------------------------------------------ |
+| 2   | fibonacci   | 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 ...         |
+| 3   | tribonacci  | 1 1 2 4 7 13 24 44 81 149 274 504 927 1705 3136 ...    |
+| 4   | tetranacci  | 1 1 2 4 8 15 29 56 108 208 401 773 1490 2872 5536 ...  |
+| 5   | pentanacci  | 1 1 2 4 8 16 31 61 120 236 464 912 1793 3525 6930 ...  |
+| 6   | hexanacci   | 1 1 2 4 8 16 32 63 125 248 492 976 1936 3840 7617 ...  |
+| 7   | heptanacci  | 1 1 2 4 8 16 32 64 127 253 504 1004 2000 3984 7936 ... |
+| 8   | octonacci   | 1 1 2 4 8 16 32 64 128 255 509 1016 2028 4048 8080 ... |
+| 9   | nonanacci   | 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144 ... |
+| 10  | decanacci   | 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172 ... |
+
+Allied sequences can be generated where the initial values are changed: The [Lucas series](<https://en.wikipedia.org/wiki/Lucas number> "wp: Lucas number") sums the two preceding values like the fibonacci series for $n=2$ but uses $\[2, 1]$ as its initial values.
+
+# --instructions--
+
+Write a function to generate Fibonacci $n$-step number sequences and Lucas sequences. The first parameter will be $n$. The second parameter will be the number of elements to be returned. The third parameter will specify whether to output the Fibonacci sequence or the Lucas sequence. If the parameter is `"f"` then return the Fibonacci sequence and if it is `"l"`, then return the Lucas sequence. The sequences must be returned as an array.
+
+# --hints--
+
+`fib_luc` should be a function.
+
+```js
+assert(typeof fib_luc === 'function');
+```
+
+`fib_luc(2,10,"f")` should return `[1,1,2,3,5,8,13,21,34,55]`.
+
+```js
+assert.deepEqual(fib_luc(2, 10, 'f'), ans[0]);
+```
+
+`fib_luc(3,15,"f")` should return `[1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136]`.
+
+```js
+assert.deepEqual(fib_luc(3, 15, 'f'), ans[1]);
+```
+
+`fib_luc(4,15,"f")` should return `[1,1,2,4,8,15,29,56,108,208,401,773,1490,2872,5536]`.
+
+```js
+assert.deepEqual(fib_luc(4, 15, 'f'), ans[2]);
+```
+
+`fib_luc(2,10,"l")` should return `[ 2, 1, 3, 4, 7, 11, 18, 29, 47, 76]`.
+
+```js
+assert.deepEqual(fib_luc(2, 10, 'l'), ans[3]);
+```
+
+`fib_luc(3,15,"l")` should return `[ 2, 1, 3, 6, 10, 19, 35, 64, 118, 217, 399, 734, 1350, 2483, 4567 ]`.
+
+```js
+assert.deepEqual(fib_luc(3, 15, 'l'), ans[4]);
+```
+
+`fib_luc(4,15,"l")` should return `[ 2, 1, 3, 6, 12, 22, 43, 83, 160, 308, 594, 1145, 2207, 4254, 8200 ]`.
+
+```js
+assert.deepEqual(fib_luc(4, 15, 'l'), ans[5]);
+```
+
+`fib_luc(5,15,"l")` should return `[ 2, 1, 3, 6, 12, 24, 46, 91, 179, 352, 692, 1360, 2674, 5257, 10335 ]`.
+
+```js
+assert.deepEqual(fib_luc(5, 15, 'l'), ans[6]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ans = [[1,1,2,3,5,8,13,21,34,55],
+[1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136],
+[1,1,2,4,8,15,29,56,108,208,401,773,1490,2872,5536],
+[ 2, 1, 3, 4, 7, 11, 18, 29, 47, 76],
+[ 2, 1, 3, 6, 10, 19, 35, 64, 118, 217, 399, 734, 1350, 2483, 4567 ],
+[ 2, 1, 3, 6, 12, 22, 43, 83, 160, 308, 594, 1145, 2207, 4254, 8200 ],
+[ 2, 1, 3, 6, 12, 24, 46, 91, 179, 352, 692, 1360, 2674, 5257, 10335 ]];
+```
+
+## --seed-contents--
+
+```js
+function fib_luc(n, len, w) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fib_luc(n, len, w) {
+    function nacci(a, n, len) {
+        while (a.length < len) {
+            let sum = 0;
+            for (let i = Math.max(0, a.length - n); i < a.length; i++)
+                sum += a[i];
+            a.push(sum);
+        }
+        return a;
+    }
+    if(w=="f"){
+        return nacci(nacci([1,1], n, n), n, len);
+    }else{
+        return nacci(nacci([2,1], n, n), n, len);
+    }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
new file mode 100644
index 0000000000..2cce69c185
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-sequence.md
@@ -0,0 +1,75 @@
+---
+id: 597f24c1dda4e70f53c79c81
+title: Fibonacci sequence
+challengeType: 5
+forumTopicId: 302268
+dashedName: fibonacci-sequence
+---
+
+# --description--
+
+Write a function to generate the <code>n<sup>th</sup></code> Fibonacci number.
+
+The <code>n<sup>th</sup></code> Fibonacci number is given by:
+
+<code>F<sub>n</sub> = F<sub>n-1</sub> + F<sub>n-2</sub></code>
+
+The first two terms of the series are 0 and 1.
+
+Hence, the series is: 0, 1, 1, 2, 3, 5, 8, 13...
+
+# --hints--
+
+`fibonacci` should be a function.
+
+```js
+assert(typeof fibonacci === 'function');
+```
+
+`fibonacci(2)` should return a number.
+
+```js
+assert(typeof fibonacci(2) == 'number');
+```
+
+`fibonacci(3)` should return 2.
+
+```js
+assert.equal(fibonacci(3), 2);
+```
+
+`fibonacci(5)` should return 5.
+
+```js
+assert.equal(fibonacci(5), 5);
+```
+
+`fibonacci(10)` should return 55.
+
+```js
+assert.equal(fibonacci(10), 55);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fibonacci(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fibonacci(n) {
+  let a = 0, b = 1, t;
+  while (--n >= 0) {
+    t = a;
+    a = b;
+    b += t;
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-word.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
new file mode 100644
index 0000000000..708f743add
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fibonacci-word.md
@@ -0,0 +1,121 @@
+---
+id: 5992e222d397f00d21122931
+title: Fibonacci word
+challengeType: 5
+forumTopicId: 302269
+dashedName: fibonacci-word
+---
+
+# --description--
+
+The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence [as described here](https://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf):
+
+<pre>Define  F_Word<sub>1</sub>  as  <strong>1</strong>
+Define  F_Word<sub>2</sub>  as  <strong>0</strong>
+Form   F_Word<sub>3</sub>  as  F_Word<sub>2</sub>   concatenated with  F_Word<sub>1</sub>   i.e.:  <strong>01</strong>
+Form   F_Word<sub>n</sub>  as  F_Word<sub>n-1</sub>  concatenated with  F_word<sub>n-2</sub>
+</pre>
+
+# --instructions--
+
+Write a function to return the Fibonacci Words up to `n`. `n` will be provided as a parameter to the function. The function should return an array of objects. The objects should be of the form: `{ N: 1, Length: 1, Entropy: 0, Word: '1' }`.
+
+# --hints--
+
+`fibWord` should be a function.
+
+```js
+assert(typeof fibWord === 'function');
+```
+
+`fibWord(5)` should return an array.
+
+```js
+assert(Array.isArray(fibWord(5)));
+```
+
+`fibWord(5)` should return `[{ N:1, Length:1, Entropy:0, Word:"1" },{ N:2, Length:1, Entropy:0, Word:"0" },{ N:3, Length:2, Entropy:1, Word:"01" },{ N:4, Length:3, Entropy:0.9182958340544896, Word:"010" },{ N:5, Length:5, Entropy:0.9709505944546688, Word:"01001" }]`.
+
+```js
+assert.deepEqual(fibWord(5), ans);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let ans=[ { N: 1, Length: 1, Entropy: 0, Word: '1' },
+
+  { N: 2, Length: 1, Entropy: 0, Word: '0' },
+
+  { N: 3, Length: 2, Entropy: 1, Word: '01' },
+
+  { N: 4, Length: 3, Entropy: 0.9182958340544896, Word: '010' },
+
+  { N: 5, Length: 5, Entropy: 0.9709505944546688, Word: '01001' }];
+```
+
+## --seed-contents--
+
+```js
+function fibWord(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fibWord(n) {
+    function entropy(s) {
+         //create an object containing each individual char
+      //and the amount of iterations per char
+        function prob(s) {
+            var h = Object.create(null);
+            s.split('').forEach(function(c) {
+               h[c] && h[c]++ || (h[c] = 1);
+            });
+            return h;
+        }
+
+        s = s.toString(); //just in case
+        var e = 0, l = s.length, h = prob(s);
+
+        for (var i in h ) {
+            var p = h[i]/l;
+            e -= p * Math.log(p) / Math.log(2);
+        }
+        return e;
+    }
+    var wOne = "1", wTwo = "0", wNth = [wOne, wTwo], w = "", o = [];
+
+    for (var i = 0; i < n; i++) {
+        if (i === 0 || i === 1) {
+            w = wNth[i];
+        } else {
+            w = wNth[i - 1] + wNth[i - 2];
+            wNth.push(w);
+        }
+        var l = w.length;
+        var e = entropy(w);
+
+        if (l <= 21) {
+            o.push({
+                N: i + 1,
+                Length: l,
+                Entropy: e,
+                Word: w
+            });
+        } else {
+            o.push({
+                N: i + 1,
+                Length: l,
+                Entropy: e,
+                Word: "..."
+            });
+        }
+    }
+  return o;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fizzbuzz.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
new file mode 100644
index 0000000000..9839933b09
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fizzbuzz.md
@@ -0,0 +1,92 @@
+---
+id: 5e9ddb06ec35240f39657419
+title: FizzBuzz
+challengeType: 5
+forumTopicId: 385370
+dashedName: fizzbuzz
+---
+
+# --description--
+
+Write a program that generates an array of integers from 1 to 100 (inclusive). But:
+
+<ul>
+    <li>for multiples of 3, add <code>"Fizz"</code> to the array instead of the number</li>
+    <li>for multiples of 5, add <code>"Buzz"</code> to the array instead of the number</li>
+    <li>for multiples of 3 and 5, add <code>"FizzBuzz"</code> to the array instead of the number</li>
+</ul>
+
+# --instructions--
+
+Your program should return an array containing the results based on the rules above.
+
+# --hints--
+
+`fizzBuzz` should be a function.
+
+```js
+assert(typeof fizzBuzz == 'function');
+```
+
+`fizzBuzz()` should return an Array.
+
+```js
+assert(Array.isArray(fizzBuzz()) == true);
+```
+
+Numbers divisible by only 3 should return `"Fizz"`.
+
+```js
+assert.equal(fizzBuzz()[2], 'Fizz');
+```
+
+Numbers divisible by only 5 should return `"Buzz"`.
+
+```js
+assert.equal(fizzBuzz()[99], 'Buzz');
+```
+
+Numbers divisible by both 3 and 5 should return `"FizzBuzz"`.
+
+```js
+assert.equal(fizzBuzz()[89], 'FizzBuzz');
+```
+
+Numbers not divisible by either 3 or 5 should return the number itself.
+
+```js
+assert.equal(fizzBuzz()[12], 13);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fizzBuzz() {
+
+}
+```
+
+# --solutions--
+
+```js
+function fizzBuzz() {
+    let res=[];
+    for (let i =1; i < 101; i++) {
+        if (i % 3 === 0  && i % 5 === 0) {
+            res.push("FizzBuzz");
+        }
+        else if (i % 3 === 0) {
+            res.push("Fizz");
+        }
+        else if (i % 5 === 0) {
+            res.push("Buzz");
+        } 
+        else {
+            res.push(i);
+        }
+    }
+    return res;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fractran.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fractran.md
new file mode 100644
index 0000000000..e8e4d35925
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/fractran.md
@@ -0,0 +1,139 @@
+---
+id: 5a7dad05be01840e1778a0d1
+title: Fractran
+challengeType: 5
+forumTopicId: 302270
+dashedName: fractran
+---
+
+# --description--
+
+[FRACTRAN](https://en.wikipedia.org/wiki/FRACTRAN "wp: FRACTRAN") is a Turing-complete esoteric programming language invented by the mathematician [John Horton Conway](<https://en.wikipedia.org/wiki/John Horton Conway> "wp: John Horton Conway").
+
+A FRACTRAN program is an ordered list of positive fractions $P = (f_1, f_2, \\ldots, f_m)$, together with an initial positive integer input $n$.
+
+The program is run by updating the integer $n$ as follows:
+
+<ul>
+  <li>for the first fraction, $f_i$, in the list for which $nf_i$ is an integer, replace $n$ with $nf_i$ ;</li>
+  <li>repeat this rule until no fraction in the list produces an integer when multiplied by $n$, then halt.</li>
+</ul>
+
+Conway gave a program for primes in FRACTRAN:
+
+$\\dfrac{17}{91}$, $\\dfrac{78}{85}$, $\\dfrac{19}{51}$, $\\dfrac{23}{38}$, $\\dfrac{29}{33}$, $\\dfrac{77}{29}$, $\\dfrac{95}{23}$, $\\dfrac{77}{19}$, $\\dfrac{1}{17}$, $\\dfrac{11}{13}$, $\\dfrac{13}{11}$, $\\dfrac{15}{14}$, $\\dfrac{15}{2}$, $\\dfrac{55}{1}$
+
+Starting with $n=2$, this FRACTRAN program will change $n$ to $15=2\\times (\\frac{15}{2})$, then $825=15\\times (\\frac{55}{1})$, generating the following sequence of integers:
+
+$2$, $15$, $825$, $725$, $1925$, $2275$, $425$, $390$, $330$, $290$, $770$, $\\ldots$
+
+After 2, this sequence contains the following powers of 2:
+
+$2^2=4$, $2^3=8$, $2^5=32$, $2^7=128$, $2^{11}=2048$, $2^{13}=8192$, $2^{17}=131072$, $2^{19}=524288$, $\\ldots$
+
+which are the prime powers of 2.
+
+# --instructions--
+
+Write a function that takes a fractran program as a string parameter and returns the first 10 numbers of the program as an array. If the result does not have 10 numbers then return the numbers as is.
+
+# --hints--
+
+`fractran` should be a function.
+
+```js
+assert(typeof fractran == 'function');
+```
+
+`fractran("3/2, 1/3")` should return an array.
+
+```js
+assert(Array.isArray(fractran('3/2, 1/3')));
+```
+
+`fractran("3/2, 1/3")` should return `[ 2, 3, 1 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 1/3'), [2, 3, 1]);
+```
+
+`fractran("3/2, 5/3, 1/5")` should return `[ 2, 3, 5, 1 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 5/3, 1/5'), [2, 3, 5, 1]);
+```
+
+`fractran("3/2, 6/3")` should return `[ 2, 3, 6, 9, 18, 27, 54, 81, 162, 243 ]`.
+
+```js
+assert.deepEqual(fractran('3/2, 6/3'), [2, 3, 6, 9, 18, 27, 54, 81, 162, 243]);
+```
+
+`fractran("2/7, 7/2")` should return `[ 2, 7, 2, 7, 2, 7, 2, 7, 2, 7 ]`.
+
+```js
+assert.deepEqual(fractran('2/7, 7/2'), [2, 7, 2, 7, 2, 7, 2, 7, 2, 7]);
+```
+
+`fractran("17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23, 77/19, 1/17, 11/13, 13/11, 15/14, 15/2, 55/1")` should return `[ 2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290 ]`.
+
+```js
+assert.deepEqual(
+  fractran(
+    '17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23, 77/19, 1/17, 11/13, 13/11, 15/14, 15/2, 55/1'
+  ),
+  [2, 15, 825, 725, 1925, 2275, 425, 390, 330, 290]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function fractran(progStr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function fractran(progStr){
+  var num = new Array();
+  var den = new Array();
+  var val ;
+  var out="";
+  function compile(prog){
+    var regex = /\s*(\d*)\s*\/\s*(\d*)\s*(.*)/m;
+    while(regex.test(prog)){
+      num.push(regex.exec(prog)[1]);
+      den.push(regex.exec(prog)[2]);
+      prog = regex.exec(prog)[3];
+    }
+  }
+
+  function step(val){
+    var i=0;
+    while(i<den.length && val%den[i] != 0) i++;
+    return num[i]*val/den[i];
+  }
+
+  var seq=[]
+
+  function exec(val){
+    var i = 0;
+    while(val && i<limit){
+      seq.push(val)
+      val = step(val);
+      i ++;
+    }
+  }
+
+  // Main
+  compile(progStr);
+  var limit = 10;
+  exec(2);
+  return seq;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gamma-function.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gamma-function.md
new file mode 100644
index 0000000000..d764232158
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gamma-function.md
@@ -0,0 +1,104 @@
+---
+id: 5a23c84252665b21eecc7e76
+title: Gamma function
+challengeType: 5
+forumTopicId: 302271
+dashedName: gamma-function
+---
+
+# --description--
+
+Implement one algorithm (or more) to compute the [Gamma](<https://en.wikipedia.org/wiki/Gamma function>) ($\\Gamma$) function (in the real field only).
+
+The Gamma function can be defined as:
+
+<div style='padding-left: 4em;'><big><big>$\Gamma(x) = \displaystyle\int_0^\infty t^{x-1}e^{-t} dt$</big></big></div>
+
+# --hints--
+
+`gamma` should be a function.
+
+```js
+assert(typeof gamma == 'function');
+```
+
+`gamma(.1)` should return a number.
+
+```js
+assert(typeof gamma(0.1) == 'number');
+```
+
+`gamma(.1)` should return `9.513507698668736`.
+
+```js
+assert.equal(round(gamma(0.1)), round(9.513507698668736));
+```
+
+`gamma(.2)` should return `4.590843711998803`.
+
+```js
+assert.equal(round(gamma(0.2)), round(4.590843711998803));
+```
+
+`gamma(.3)` should return `2.9915689876875904`.
+
+```js
+assert.equal(round(gamma(0.3)), round(2.9915689876875904));
+```
+
+`gamma(.4)` should return `2.218159543757687`.
+
+```js
+assert.equal(round(gamma(0.4)), round(2.218159543757687));
+```
+
+`gamma(.5)` should return `1.7724538509055159`.
+
+```js
+assert.equal(round(gamma(0.5)), round(1.7724538509055159));
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+function round(x) {
+  return Number(x).toPrecision(13);
+}
+```
+
+## --seed-contents--
+
+```js
+function gamma(x) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gamma(x) {
+  var p = [0.99999999999980993, 676.5203681218851, -1259.1392167224028,
+  771.32342877765313, -176.61502916214059, 12.507343278686905,
+  -0.13857109526572012, 9.9843695780195716e-6, 1.5056327351493116e-7
+  ];
+
+  var g = 7;
+  if (x < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * x) * gamma(1 - x));
+  }
+
+  x -= 1;
+  var a = p[0];
+  var t = x + g + 0.5;
+  for (var i = 1; i < p.length; i++) {
+  a += p[i] / (x + i);
+  }
+
+  var result=Math.sqrt(2 * Math.PI) * Math.pow(t, x + 0.5) * Math.exp(-t) * a;
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
new file mode 100644
index 0000000000..2e5adf4bd9
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gaussian-elimination.md
@@ -0,0 +1,230 @@
+---
+id: 5a23c84252665b21eecc7e77
+title: Gaussian elimination
+challengeType: 5
+forumTopicId: 302272
+dashedName: gaussian-elimination
+---
+
+# --description--
+
+Write a function to solve \\(Ax = b\\) using Gaussian elimination then backwards substitution.
+
+\\(A\\) being an \\(n \\times n\\) matrix. Also, \\(x\\) and \\(b\\) are \\(n\\) by 1 vectors.
+
+To improve accuracy, please use partial pivoting and scaling.
+
+# --hints--
+
+`gaussianElimination` should be a function.
+
+```js
+assert(typeof gaussianElimination == 'function');
+```
+
+`gaussianElimination([[1,1],[1,-1]], [5,1])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    gaussianElimination(
+      [
+        [1, 1],
+        [1, -1]
+      ],
+      [5, 1]
+    )
+  )
+);
+```
+
+`gaussianElimination([[1,1],[1,-1]], [5,1])` should return `[ 3, 2 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 1],
+      [1, -1]
+    ],
+    [5, 1]
+  ),
+  [3, 2]
+);
+```
+
+`gaussianElimination([[2,3],[2,1]] , [8,4])` should return `[ 1, 2 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [2, 3],
+      [2, 1]
+    ],
+    [8, 4]
+  ),
+  [1, 2]
+);
+```
+
+`gaussianElimination([[1,3],[5,-2]], [14,19])` should return `[ 5, 3 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 3],
+      [5, -2]
+    ],
+    [14, 19]
+  ),
+  [5, 3]
+);
+```
+
+`gaussianElimination([[1,1],[5,-1]] , [10,14])` should return `[ 4, 6 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 1],
+      [5, -1]
+    ],
+    [10, 14]
+  ),
+  [4, 6]
+);
+```
+
+`gaussianElimination([[1,2,3],[4,5,6],[7,8,8]] , [6,15,23])` should return `[ 1, 1, 1 ]`.
+
+```js
+assert.deepEqual(
+  gaussianElimination(
+    [
+      [1, 2, 3],
+      [4, 5, 6],
+      [7, 8, 8]
+    ],
+    [6, 15, 23]
+  ),
+  [1, 1, 1]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gaussianElimination(A,b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gaussianElimination(A, b) {
+  // Lower Upper Decomposition
+  function ludcmp(A) {
+    // A is a matrix that we want to decompose into Lower and Upper matrices.
+    var d = true
+    var n = A.length
+    var idx = new Array(n) // Output vector with row permutations from partial pivoting
+    var vv = new Array(n) // Scaling information
+
+    for (var i=0; i<n; i++) {
+        var max = 0
+        for (var j=0; j<n; j++) {
+            var temp = Math.abs(A[i][j])
+            if (temp > max) max = temp
+        }
+        if (max == 0) return // Singular Matrix!
+        vv[i] = 1 / max // Scaling
+    }
+
+        var Acpy = new Array(n)
+        for (var i=0; i<n; i++) {
+            var Ai = A[i]
+            let Acpyi = new Array(Ai.length)
+            for (j=0; j<Ai.length; j+=1) Acpyi[j] = Ai[j]
+            Acpy[i] = Acpyi
+        }
+        A = Acpy
+
+    var tiny = 1e-20 // in case pivot element is zero
+    for (var i=0; ; i++) {
+        for (var j=0; j<i; j++) {
+            var sum = A[j][i]
+            for (var k=0; k<j; k++) sum -= A[j][k] * A[k][i];
+            A[j][i] = sum
+        }
+        var jmax = 0
+        var max = 0;
+        for (var j=i; j<n; j++) {
+            var sum = A[j][i]
+            for (var k=0; k<i; k++) sum -= A[j][k] * A[k][i];
+            A[j][i] = sum
+            var temp = vv[j] * Math.abs(sum)
+            if (temp >= max) {
+                max = temp
+                jmax = j
+            }
+        }
+        if (i <= jmax) {
+            for (var j=0; j<n; j++) {
+                var temp = A[jmax][j]
+                A[jmax][j] = A[i][j]
+                A[i][j] = temp
+            }
+            d = !d;
+            vv[jmax] = vv[i]
+        }
+        idx[i] = jmax;
+        if (i == n-1) break;
+        var temp = A[i][i]
+        if (temp == 0) A[i][i] = temp = tiny
+        temp = 1 / temp
+        for (var j=i+1; j<n; j++) A[j][i] *= temp
+    }
+    return {A:A, idx:idx, d:d}
+  }
+
+  // Lower Upper Back Substitution
+  function lubksb(lu, b) {
+    // solves the set of n linear equations A*x = b.
+    // lu is the object containing A, idx and d as determined by the routine ludcmp.
+    var A = lu.A
+    var idx = lu.idx
+    var n = idx.length
+
+        var bcpy = new Array(n)
+        for (var i=0; i<b.length; i+=1) bcpy[i] = b[i]
+        b = bcpy
+
+    for (var ii=-1, i=0; i<n; i++) {
+        var ix = idx[i]
+        var sum = b[ix]
+        b[ix] = b[i]
+        if (ii > -1)
+            for (var j=ii; j<i; j++) sum -= A[i][j] * b[j]
+        else if (sum)
+            ii = i
+        b[i] = sum
+    }
+    for (var i=n-1; i>=0; i--) {
+        var sum = b[i]
+        for (var j=i+1; j<n; j++) sum -= A[i][j] * b[j]
+        b[i] = sum / A[i][i]
+    }
+    return b // solution vector x
+  }
+
+    var lu = ludcmp(A)
+    if (lu === undefined) return // Singular Matrix!
+    return lubksb(lu, b)
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
new file mode 100644
index 0000000000..4af8e94f0e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/general-fizzbuzz.md
@@ -0,0 +1,175 @@
+---
+id: 5a23c84252665b21eecc7e78
+title: General FizzBuzz
+challengeType: 5
+forumTopicId: 302273
+dashedName: general-fizzbuzz
+---
+
+# --description--
+
+Write a generalized version of [FizzBuzz](https://rosettacode.org/wiki/FizzBuzz) that works for any list of factors, along with their words.
+
+This is basically a "fizzbuzz" implementation where the rules of the game are supplied to the user. Create a function to implement this. The function should take two parameters.
+
+The first will be an array with the FizzBuzz rules. For example: `[ [3, "Fizz"] , [5, "Buzz"] ]`.
+
+This indicates that `Fizz` should be printed if the number is a multiple of 3 and `Buzz` if it is a multiple of 5. If it is a multiple of both then the strings should be concatenated in the order specified in the array. In this case, `FizzBuzz` if the number is a multiple of 3 and 5.
+
+The second parameter is the number for which the function should return a string as stated above.
+
+# --hints--
+
+`genFizzBuzz` should be a function.
+
+```js
+assert(typeof genFizzBuzz == 'function');
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 6)` should return a string.
+
+```js
+assert(
+  typeof genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    6
+  ) == 'string'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 6)` should return `"Fizz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    6
+  ),
+  'Fizz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 10)` should return `"Buzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    10
+  ),
+  'Buzz'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 12)` should return `"Buzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    12
+  ),
+  'Buzz'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 13)` should return `"13"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    13
+  ),
+  '13'
+);
+```
+
+`genFizzBuzz([[3, "Buzz"],[5, "Fizz"]], 15)` should return `"BuzzFizz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Buzz'],
+      [5, 'Fizz']
+    ],
+    15
+  ),
+  'BuzzFizz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"]], 15)` should return `"FizzBuzz"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz']
+    ],
+    15
+  ),
+  'FizzBuzz'
+);
+```
+
+`genFizzBuzz([[3, "Fizz"],[5, "Buzz"],[7, "Baxx"]], 105)` should return `"FizzBuzzBaxx"`.
+
+```js
+assert.equal(
+  genFizzBuzz(
+    [
+      [3, 'Fizz'],
+      [5, 'Buzz'],
+      [7, 'Baxx']
+    ],
+    105
+  ),
+  'FizzBuzzBaxx'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function genFizzBuzz(rules, num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function genFizzBuzz(rules, num) {
+  let res='';
+  rules.forEach(function (e) {
+    if(num % e[0] == 0)
+      res+=e[1];
+  })
+
+  if(res==''){
+    res=num.toString();
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
new file mode 100644
index 0000000000..5f643c3a38
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generate-lower-case-ascii-alphabet.md
@@ -0,0 +1,99 @@
+---
+id: 5a23c84252665b21eecc7e7a
+title: Generate lower case ASCII alphabet
+challengeType: 5
+forumTopicId: 302274
+dashedName: generate-lower-case-ascii-alphabet
+---
+
+# --description--
+
+Write a function to generate an array of lower case ASCII characters for a given range. For example, given the range `['a', 'd']`, the function should return `['a', 'b', 'c', 'd']`.
+
+# --hints--
+
+`lascii` should be a function.
+
+```js
+assert(typeof lascii == 'function');
+```
+
+`lascii("a","d")` should return an array.
+
+```js
+assert(Array.isArray(lascii('a', 'd')));
+```
+
+`lascii('a','d')` should return `[ 'a', 'b', 'c', 'd' ]`.
+
+```js
+assert.deepEqual(lascii('a', 'd'), results[0]);
+```
+
+`lascii('c','i')` should return `[ 'c', 'd', 'e', 'f', 'g', 'h', 'i' ]`.
+
+```js
+assert.deepEqual(lascii('c', 'i'), results[1]);
+```
+
+`lascii('m','q')` should return `[ 'm', 'n', 'o', 'p', 'q' ]`.
+
+```js
+assert.deepEqual(lascii('m', 'q'), results[2]);
+```
+
+`lascii('k','n')` should return `[ 'k', 'l', 'm', 'n' ]`.
+
+```js
+assert.deepEqual(lascii('k', 'n'), results[3]);
+```
+
+`lascii('t','z')` should return `[ 't', 'u', 'v', 'w', 'x', 'y', 'z' ]`.
+
+```js
+assert.deepEqual(lascii('t', 'z'), results[4]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let results=[
+  [ 'a', 'b', 'c', 'd' ],
+  [ 'c', 'd', 'e', 'f', 'g', 'h', 'i' ],
+  [ 'm', 'n', 'o', 'p', 'q' ],
+  [ 'k', 'l', 'm', 'n' ],
+  [ 't', 'u', 'v', 'w', 'x', 'y', 'z' ]
+]
+```
+
+## --seed-contents--
+
+```js
+function lascii(cFrom, cTo) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lascii(cFrom, cTo) {
+
+  function cRange(cFrom, cTo) {
+    var iStart = cFrom.charCodeAt(0);
+
+    return Array.apply(
+      null, Array(cTo.charCodeAt(0) - iStart + 1)
+    ).map(function (_, i) {
+
+      return String.fromCharCode(iStart + i);
+
+    });
+  }
+
+  return cRange(cFrom, cTo);
+
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generator-exponential.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generator-exponential.md
new file mode 100644
index 0000000000..f888e8dff0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/generator-exponential.md
@@ -0,0 +1,117 @@
+---
+id: 5a23c84252665b21eecc7e7b
+title: Generator/Exponential
+challengeType: 5
+forumTopicId: 302275
+dashedName: generatorexponential
+---
+
+# --description--
+
+A generator is an executable entity (like a function or procedure) that contains code that yields a sequence of values, one at a time, so that each time you call the generator, the next value in the sequence is provided.
+
+Generators are often built on top of coroutines or objects so that the internal state of the object is handled "naturally".
+
+Generators are often used in situations where a sequence is potentially infinite, and where it is possible to construct the next value of the sequence with only minimal state.
+
+# --instructions--
+
+Write a function that uses generators to generate squares and cubes. Create a new generator that filters all cubes from the generator of squares.
+
+The function should return the \\( n^{th} \\) value of the filtered generator.
+
+For example for \\(n=7\\), the function should return 81 as the sequence would be 4, 9, 16, 25, 36, 49, 81. Here 64 is filtered out, as it is a cube.
+
+# --hints--
+
+`exponentialGenerator` should be a function.
+
+```js
+assert(typeof exponentialGenerator == 'function');
+```
+
+`exponentialGenerator()` should return a number.
+
+```js
+assert(typeof exponentialGenerator(10) == 'number');
+```
+
+`exponentialGenerator(10)` should return `144`.
+
+```js
+assert.equal(exponentialGenerator(10), 144);
+```
+
+`exponentialGenerator(12)` should return `196`.
+
+```js
+assert.equal(exponentialGenerator(12), 196);
+```
+
+`exponentialGenerator(14)` should return `256`.
+
+```js
+assert.equal(exponentialGenerator(14), 256);
+```
+
+`exponentialGenerator(20)` should return `484`.
+
+```js
+assert.equal(exponentialGenerator(20), 484);
+```
+
+`exponentialGenerator(25)` should return `784`.
+
+```js
+assert.equal(exponentialGenerator(25), 784);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function exponentialGenerator(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function exponentialGenerator(n){
+  function* PowersGenerator(m) {
+    var n=0;
+    while(1) {
+        yield Math.pow(n, m);
+        n += 1;
+    }
+  }
+
+  function* FilteredGenerator(g, f){
+    var value = g.next().value;
+    var filter = f.next().value;
+    while(1) {
+        if( value < filter ) {
+            yield value;
+            value = g.next().value;
+        } else if ( value > filter ) {
+            filter = f.next().value;
+        } else {
+            value = g.next().value;
+            filter = f.next().value;
+        }
+    }
+  }
+
+  var squares = PowersGenerator(2);
+  var cubes = PowersGenerator(3);
+
+  var filtered = FilteredGenerator(squares, cubes);
+
+  var curr=0;
+  for(var i=0;i<n;i++) curr=filtered.next();
+
+  return curr.value;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gray-code.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gray-code.md
new file mode 100644
index 0000000000..4e5c523737
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/gray-code.md
@@ -0,0 +1,122 @@
+---
+id: 5a23c84252665b21eecc7e80
+title: Gray code
+challengeType: 5
+forumTopicId: 302276
+dashedName: gray-code
+---
+
+# --description--
+
+[Gray code](<https://en.wikipedia.org/wiki/Gray code>) is a form of binary encoding where transitions between consecutive numbers differ by only one bit.
+
+This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs.
+
+It is also useful for generating inputs for [Karnaugh maps](<https://en.wikipedia.org/wiki/Karnaugh map>) in order from left to right or top to bottom.
+
+# --instructions--
+
+Create a function to encode a number to and decode a number from Gray code. The function should will have 2 parameters.
+
+The first would be a boolean. The function should encode for true and decode for false. The second parameter would be the number to be encoded/decoded.
+
+Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary).
+
+There are many possible Gray codes. The following encodes what is called "binary reflected Gray code."
+
+Encoding (MSB is bit 0, b is binary, g is Gray code):
+
+<pre>if b[i-1] = 1
+  g[i] = not b[i]
+else
+  g[i] = b[i]
+</pre>
+
+Or:
+
+<pre>g = b xor (b logically right shifted 1 time)
+</pre>
+
+Decoding (MSB is bit 0, b is binary, g is Gray code):
+
+<pre>b[0] = g[0]<br>
+for other bits:
+b[i] = g[i] xor b[i-1]
+</pre>
+
+# --hints--
+
+`gray` should be a function.
+
+```js
+assert(typeof gray == 'function');
+```
+
+`gray(true,177)` should return a number.
+
+```js
+assert(typeof gray(true, 177) == 'number');
+```
+
+`gray(true,177)` should return `233`.
+
+```js
+assert.equal(gray(true, 177), 233);
+```
+
+`gray(true,425)` should return `381`.
+
+```js
+assert.equal(gray(true, 425), 381);
+```
+
+`gray(true,870)` should return `725`.
+
+```js
+assert.equal(gray(true, 870), 725);
+```
+
+`gray(false,233)` should return `177`.
+
+```js
+assert.equal(gray(false, 233), 177);
+```
+
+`gray(false,381)` should return `425`.
+
+```js
+assert.equal(gray(false, 381), 425);
+```
+
+`gray(false,725)` should return `870`.
+
+```js
+assert.equal(gray(false, 725), 870);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gray(enc, number) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gray(enc, number){
+  if(enc){
+      return number ^ (number >> 1);
+  }else{
+      let n = number;
+
+      while (number >>= 1) {
+          n ^= number;
+      }
+      return n;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
new file mode 100644
index 0000000000..60b9675018
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-common-divisor.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc7e82
+title: Greatest common divisor
+challengeType: 5
+forumTopicId: 302277
+dashedName: greatest-common-divisor
+---
+
+# --description--
+
+Write a function that returns the greatest common divisor of two integers.
+
+# --hints--
+
+`gcd` should be a function.
+
+```js
+assert(typeof gcd == 'function');
+```
+
+`gcd(24,36)` should return a number.
+
+```js
+assert(typeof gcd(24, 36) == 'number');
+```
+
+`gcd(24,36)` should return `12`.
+
+```js
+assert.equal(gcd(24, 36), 12);
+```
+
+`gcd(30,48)` should return `6`.
+
+```js
+assert.equal(gcd(30, 48), 6);
+```
+
+`gcd(10,15)` should return `5`.
+
+```js
+assert.equal(gcd(10, 15), 5);
+```
+
+`gcd(100,25)` should return `25`.
+
+```js
+assert.equal(gcd(100, 25), 25);
+```
+
+`gcd(13,250)` should return `1`.
+
+```js
+assert.equal(gcd(13, 250), 1);
+```
+
+`gcd(1300,250)` should return `50`.
+
+```js
+assert.equal(gcd(1300, 250), 50);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gcd(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gcd(a, b) {
+  return b==0 ? Math.abs(a):gcd(b, a % b);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
new file mode 100644
index 0000000000..4a90c111fe
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
@@ -0,0 +1,113 @@
+---
+id: 5a23c84252665b21eecc7e84
+title: Greatest subsequential sum
+challengeType: 5
+forumTopicId: 302278
+dashedName: greatest-subsequential-sum
+---
+
+# --description--
+
+Given a sequence of integers, find a continuous subsequence which maximizes the sum of its elements, that is, the elements of no other single subsequence add up to a value larger than this one.
+
+An empty subsequence is considered to have the sum of \\( 0 \\); thus if all elements are negative, the result must be the empty sequence.
+
+# --hints--
+
+`maximumSubsequence` should be a function.
+
+```js
+assert(typeof maximumSubsequence == 'function');
+```
+
+`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return an array.
+
+```js
+assert(Array.isArray(maximumSubsequence([1, 2, -1, 3, 10, -10])));
+```
+
+`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return `[ 1, 2, -1, 3, 10 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([1, 2, -1, 3, 10, -10]), [1, 2, -1, 3, 10]);
+```
+
+`maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ])` should return `[ 0, 8, 10 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [
+  0,
+  8,
+  10
+]);
+```
+
+`maximumSubsequence([ 9, 9, -10, 1 ])` should return `[ 9, 9 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([9, 9, -10, 1]), [9, 9]);
+```
+
+`maximumSubsequence([ 7, 1, -5, -3, -8, 1 ])` should return `[ 7, 1 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([7, 1, -5, -3, -8, 1]), [7, 1]);
+```
+
+`maximumSubsequence([ -3, 6, -1, 4, -4, -6 ])` should return `[ 6, -1, 4 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([-3, 6, -1, 4, -4, -6]), [6, -1, 4]);
+```
+
+`maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ])` should return `[ 3, 5, 6, -2, -1, 4 ]`.
+
+```js
+assert.deepEqual(maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]), [
+  3,
+  5,
+  6,
+  -2,
+  -1,
+  4
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function maximumSubsequence(population) {
+
+}
+```
+
+# --solutions--
+
+```js
+function maximumSubsequence(population) {
+  function sumValues(arr) {
+      var result = 0;
+      for (var i = 0, len = arr.length; i < len; i++) {
+          result += arr[i];
+      }
+      return result;
+  }
+  var greatest;
+  var maxValue = 0;
+
+  for (var i = 0, len = population.length; i < len; i++) {
+      for (var j = i; j <= len; j++) {
+          var subsequence = population.slice(i, j);
+          var value = sumValues(subsequence);
+          if (value > maxValue) {
+              maxValue = value;
+              greatest = subsequence;
+          };
+      }
+  }
+
+  return greatest;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
new file mode 100644
index 0000000000..37768d8cd3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hailstone-sequence.md
@@ -0,0 +1,98 @@
+---
+id: 595608ff8bcd7a50bd490181
+title: Hailstone sequence
+challengeType: 5
+forumTopicId: 302279
+dashedName: hailstone-sequence
+---
+
+# --description--
+
+The Hailstone sequence of numbers can be generated from a starting positive integer, `n` by:
+
+- If `n` is `1` then the sequence ends
+- If `n` is `even` then the next `n` of the sequence `= n/2`
+- If `n` is `odd` then the next `n` of the sequence `= (3 * n) + 1`
+
+The (unproven) Collatz conjecture is that the hailstone sequence for any starting number always terminates.
+
+The hailstone sequence is also known as hailstone numbers (because the values are usually subject to multiple descents and ascents like hailstones in a cloud), or as the Collatz sequence.
+
+# --instructions--
+
+1. Create a routine to generate the hailstone sequence for a number
+2. Your function should return an array with the number less than `limit` which has the longest hailstone sequence and that sequence's length. (But don't show the actual sequence!)
+
+# --hints--
+
+`hailstoneSequence` should be a function.
+
+```js
+assert(typeof hailstoneSequence === 'function');
+```
+
+`hailstoneSequence(30)` should return an array.
+
+```js
+assert(Array.isArray(hailstoneSequence(30)));
+```
+
+`hailstoneSequence(30)` should return `[27, 112]`.
+
+```js
+assert.deepEqual(hailstoneSequence(30), [27, 112]);
+```
+
+`hailstoneSequence(50000)` should return `[35655, 324]`.
+
+```js
+assert.deepEqual(hailstoneSequence(50000), [35655, 324]);
+```
+
+`hailstoneSequence(100000)` should return `[77031, 351]`.
+
+```js
+assert.deepEqual(hailstoneSequence(100000), [77031, 351]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function hailstoneSequence(limit) {
+  const res = [];
+
+
+  return res;
+}
+```
+
+# --solutions--
+
+```js
+function hailstoneSequence (limit) {
+  function hailstone(n) {
+    const seq = [n];
+    while (n > 1) {
+      n = n % 2 ? 3 * n + 1 : n / 2;
+      seq.push(n);
+    }
+    return seq;
+  }
+
+  let n = 0;
+  let max = 0;
+  for (let i = limit; --i;) {
+    const seq = hailstone(i);
+    const sLen = seq.length;
+
+    if (sLen > max) {
+      n = i;
+      max = sLen;
+    }
+  }
+
+  return [n, max];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/happy-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/happy-numbers.md
new file mode 100644
index 0000000000..6cb33dbcaf
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/happy-numbers.md
@@ -0,0 +1,129 @@
+---
+id: 594810f028c0303b75339ad1
+title: Happy numbers
+challengeType: 5
+forumTopicId: 302280
+dashedName: happy-numbers
+---
+
+# --description--
+
+A [happy number](https://en.wikipedia.org/wiki/Happy_number) is defined by the following process:
+
+Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals `1` (where it will stay), or it loops endlessly in a cycle which does not include `1`. Those numbers for which this process ends in `1` are happy numbers, while those that do not end in `1` are unhappy numbers.
+
+# --instructions--
+
+Implement a function that returns true if the number is happy, or false if not.
+
+# --hints--
+
+`happy` should be a function.
+
+```js
+assert(typeof happy === 'function');
+```
+
+`happy(1)` should return a boolean.
+
+```js
+assert(typeof happy(1) === 'boolean');
+```
+
+`happy(1)` should return `true`.
+
+```js
+assert(happy(1));
+```
+
+`happy(2)` should return `false`.
+
+```js
+assert(!happy(2));
+```
+
+`happy(7)` should return `true`.
+
+```js
+assert(happy(7));
+```
+
+`happy(10)` should return `true`.
+
+```js
+assert(happy(10));
+```
+
+`happy(13)` should return `true`.
+
+```js
+assert(happy(13));
+```
+
+`happy(19)` should return `true`.
+
+```js
+assert(happy(19));
+```
+
+`happy(23)` should return `true`.
+
+```js
+assert(happy(23));
+```
+
+`happy(28)` should return `true`.
+
+```js
+assert(happy(28));
+```
+
+`happy(31)` should return `true`.
+
+```js
+assert(happy(31));
+```
+
+`happy(32)` should return `true`.
+
+```js
+assert(happy(32));
+```
+
+`happy(33)` should return `false`.
+
+```js
+assert(!happy(33));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function happy(number) {
+
+}
+```
+
+# --solutions--
+
+```js
+function happy (number) {
+  let m;
+  let digit;
+  const cycle = [];
+
+  while (number !== 1 && cycle[number] !== true) {
+    cycle[number] = true;
+    m = 0;
+    while (number > 0) {
+      digit = number % 10;
+      m += Math.pow(digit, 2);
+      number = (number - digit) / 10;
+    }
+    number = m;
+  }
+  return (number === 1);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
new file mode 100644
index 0000000000..400e951334
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md
@@ -0,0 +1,87 @@
+---
+id: 595668ca4cfe1af2fb9818d4
+title: Harshad or Niven series
+challengeType: 5
+forumTopicId: 302281
+dashedName: harshad-or-niven-series
+---
+
+# --description--
+
+The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits.
+
+For example, `42` is a Harshad number as `42` is divisible by `(4 + 2)` without remainder.
+
+Assume that the series is defined as the numbers in increasing order.
+
+# --instructions--
+
+Implement a function to generate successive members of the Harshad sequence.
+
+Use it to return an array with ten members of the sequence, starting with first Harshad number greater than `n`.
+
+# --hints--
+
+`isHarshadOrNiven` should be a function.
+
+```js
+assert(typeof isHarshadOrNiven === 'function');
+```
+
+`isHarshadOrNiven(10)` should return `[12, 18, 20, 21, 24, 27, 30, 36, 40, 42]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(10), [12, 18, 20, 21, 24, 27, 30, 36, 40, 42]);
+```
+
+`isHarshadOrNiven(400)` should return `[402, 405, 407, 408, 410, 414, 420, 423, 432, 440]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(400), [402, 405, 407, 408, 410, 414, 420, 423, 432, 440]);
+```
+
+`isHarshadOrNiven(1000)` should return `[1002, 1008, 1010, 1011, 1012, 1014, 1015, 1016, 1017, 1020]`
+
+```js
+assert.deepEqual(isHarshadOrNiven(1000), [1002, 1008, 1010, 1011, 1012, 1014, 1015, 1016, 1017, 1020]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isHarshadOrNiven(n) {
+  const res = [];
+
+  return res;
+}
+```
+
+# --solutions--
+
+```js
+function isHarshadOrNiven(n) {
+  function isHarshad(num) {
+    let s = 0;
+    const nStr = num.toString();
+    for (let i = 0; i < nStr.length; ++i) {
+      s += parseInt(nStr.charAt(i), 10);
+    }
+    return n % s === 0;
+  }
+
+  const res = [];
+  let count = 0;
+
+  while (count < 10) {
+    n++;
+    if (isHarshad(n)) {
+      count++;
+      res.push(n);
+    }
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
new file mode 100644
index 0000000000..d5a9a396bb
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-from-two-arrays.md
@@ -0,0 +1,105 @@
+---
+id: 595671d4d2cdc305f0d5b36f
+title: Hash from two arrays
+challengeType: 5
+forumTopicId: 302283
+dashedName: hash-from-two-arrays
+---
+
+# --description--
+
+Using two Arrays of equal length, create a Hash object where the elements from one array (the keys) are linked to the elements of the other (the values).
+
+**Related task:**
+
+<ul>
+  <li><a href='https://rosettacode.org/wiki/Associative arrays/Creation' title='Associative arrays/Creation' target='_blank'>Associative arrays/Creation</a></li>
+</ul>
+
+# --hints--
+
+`arrToObj` should be a function.
+
+```js
+assert(typeof arrToObj === 'function');
+```
+
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: "e" }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[0]), res[0]);
+```
+
+`arrToObj([1, 2, 3, 4, 5], ["a", "b", "c", "d"])` should return `{ 1: "a", 2: "b", 3: "c", 4: "d", 5: undefined }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[1]), res[1]);
+```
+
+`arrToObj([1, 2, 3], ["a", "b", "c", "d", "e"])` should return `{ 1: "a", 2: "b", 3: "c" }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[2]), res[2]);
+```
+
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": 5 }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[3]), res[3]);
+```
+
+`arrToObj(["a", "b", "c", "d", "e"], [1, 2, 3, 4])` should return `{ "a": 1, "b": 2, "c": 3 , "d": 4, "e": undefined }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[4]), res[4]);
+```
+
+`arrToObj(["a", "b", "c"], [1, 2, 3, 4, 5])` should return `{ "a": 1, "b": 2, "c": 3 }`
+
+```js
+assert.deepEqual(arrToObj(...testCases[5]), res[5]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [
+  [[1, 2, 3, 4, 5], ['a', 'b', 'c', 'd', 'e']],
+  [[1, 2, 3, 4, 5], ['a', 'b', 'c', 'd']],
+  [[1, 2, 3], ['a', 'b', 'c', 'd', 'e']],
+  [['a', 'b', 'c', 'd', 'e'], [1, 2, 3, 4, 5]],
+  [['a', 'b', 'c', 'd', 'e'], [1, 2, 3, 4]],
+  [['a', 'b', 'c'], [1, 2, 3, 4, 5]]
+];
+
+const res = [
+  { 1: 'a', 2: 'b', 3: 'c', 4: 'd', 5: 'e' },
+  { 1: 'a', 2: 'b', 3: 'c', 4: 'd', 5: undefined },
+  { 1: 'a', 2: 'b', 3: 'c' },
+  { a: 1, b: 2, c: 3, d: 4, e: 5 },
+  { a: 1, b: 2, c: 3, d: 4, e: undefined },
+  { a: 1, b: 2, c: 3 }
+];
+```
+
+## --seed-contents--
+
+```js
+function arrToObj (keys, vals) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function arrToObj (keys, vals) {
+  return keys.reduce((map, key, index) => {
+    map[key] = vals[index];
+    return map;
+  }, {});
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-join.md
new file mode 100644
index 0000000000..d2d5cabf4f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -0,0 +1,237 @@
+---
+id: 5956795bc9e2c415eb244de1
+title: Hash join
+challengeType: 5
+forumTopicId: 302284
+dashedName: hash-join
+---
+
+# --description--
+
+An [inner join](https://en.wikipedia.org/wiki/Join_(SQL)#Inner_join "wp: Join\_(SQL)#Inner_join") is an operation that combines two data tables into one table, based on matching column values. The simplest way of implementing this operation is the [nested loop join](<https://en.wikipedia.org/wiki/Nested loop join> "wp: Nested loop join") algorithm, but a more scalable alternative is the [hash join](<https://en.wikipedia.org/wiki/hash join> "wp: hash join") algorithm.
+
+The "hash join" algorithm consists of two steps:
+
+<ol>
+  <li><strong>Hash phase:</strong> Create a <a href='https://en.wikipedia.org/wiki/Multimap' title='wp: Multimap' target='_blank'>multimap</a> from one of the two tables, mapping from each join column value to all the rows that contain it.</li>
+  <ul>
+    <li>The multimap must support hash-based lookup which scales better than a simple linear search, because that's the whole point of this algorithm.</li>
+    <li>Ideally we should create the multimap for the smaller table, thus minimizing its creation time and memory size.</li>
+  </ul>
+  <li><strong>Join phase:</strong> Scan the other table, and find matching rows by looking in the multimap created before.</li>
+</ol>
+
+In pseudo-code, the algorithm could be expressed as follows:
+
+<pre><strong>let</strong> <i>A</i> = the first input table (or ideally, the larger one)
+<strong>let</strong> <i>B</i> = the second input table (or ideally, the smaller one)
+<strong>let</strong> <i>j<sub>A</sub></i> = the join column ID of table <i>A</i>
+<strong>let</strong> <i>j<sub>B</sub></i> = the join column ID of table <i>B</i>
+<strong>let</strong> <i>M<sub>B</sub></i> = a multimap for mapping from single values to multiple rows of table <i>B</i> (starts out empty)
+<strong>let</strong> <i>C</i> = the output table (starts out empty)
+<strong>for each</strong> row <i>b</i> in table <i>B</i>:
+  <strong>place</strong> <i>b</i> in multimap <i>M<sub>B</sub></i> under key <i>b(j<sub>B</sub>)</i>
+<strong>for each</strong> row <i>a</i> in table <i>A</i>:
+  <strong>for each</strong> row <i>b</i> in multimap <i>M<sub>B</sub></i> under key <i>a(j<sub>A</sub>)</i>:
+    <strong>let</strong> <i>c</i> = the concatenation of row <i>a</i> and row <i>b</i>
+    <strong>place</strong> row <i>c</i> in table <i>C</i>
+</pre>
+
+# --instructions--
+
+Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
+
+**Input**
+
+<table>
+  <tr>
+    <td style="padding: 4px; margin: 5px;">
+      <table style="border:none; border-collapse:collapse;">
+        <tr>
+          <td style="border:none"><i>A =</i></td>
+          <td style="border:none">
+            <table>
+              <tr>
+                <th style="padding: 4px; margin: 5px;">Age</th>
+                <th style="padding: 4px; margin: 5px;">Name</th>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">27</td>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">18</td>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">28</td>
+                <td style="padding: 4px; margin: 5px;">Glory</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">18</td>
+                <td style="padding: 4px; margin: 5px;">Popeye</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">28</td>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+              </tr>
+            </table>
+          </td>
+          <td style="border:none; padding-left:1.5em;" rowspan="2"></td>
+          <td style="border:none"><i>B =</i></td>
+          <td style="border:none">
+            <table>
+              <tr>
+                <th style="padding: 4px; margin: 5px;">Character</th>
+                <th style="padding: 4px; margin: 5px;">Nemesis</th>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+                <td style="padding: 4px; margin: 5px;">Whales</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Jonah</td>
+                <td style="padding: 4px; margin: 5px;">Spiders</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+                <td style="padding: 4px; margin: 5px;">Ghosts</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Alan</td>
+                <td style="padding: 4px; margin: 5px;">Zombies</td>
+              </tr>
+              <tr>
+                <td style="padding: 4px; margin: 5px;">Glory</td>
+                <td style="padding: 4px; margin: 5px;">Buffy</td>
+              </tr>
+            </table>
+          </td>
+        </tr>
+        <tr>
+          <td style="border:none">
+            <i>j<sub>A</sub> =</i>
+          </td>
+          <td style="border:none">
+            <i><code>Name</code> (i.e. column 1)</i>
+          </td>
+          <td style="border:none">
+            <i>j<sub>B</sub> =</i>
+          </td>
+          <td style="border:none">
+            <i><code>Character</code> (i.e. column 0)</i>
+          </td>
+        </tr>
+      </table>
+    </td>
+  </tr>
+</table>
+
+**Output**
+
+| A_age | A_name | B_character | B_nemesis |
+| ----- | ------ | ----------- | --------- |
+| 27    | Jonah  | Jonah       | Whales    |
+| 27    | Jonah  | Jonah       | Spiders   |
+| 18    | Alan   | Alan        | Ghosts    |
+| 18    | Alan   | Alan        | Zombies   |
+| 28    | Glory  | Glory       | Buffy     |
+| 28    | Alan   | Alan        | Ghosts    |
+| 28    | Alan   | Alan        | Zombies   |
+
+The order of the rows in the output table is not significant.
+
+# --hints--
+
+`hashJoin` should be a function.
+
+```js
+assert(typeof hashJoin === 'function');
+```
+
+`hashJoin([{ age: 27, name: "Jonah" }, { age: 18, name: "Alan" }, { age: 28, name: "Glory" }, { age: 18, name: "Popeye" }, { age: 28, name: "Alan" }], [{ character: "Jonah", nemesis: "Whales" }, { character: "Jonah", nemesis: "Spiders" }, { character: "Alan", nemesis: "Ghosts" }, { character:"Alan", nemesis: "Zombies" }, { character: "Glory", nemesis: "Buffy" }, { character: "Bob", nemesis: "foo" }])` should return `[{"A_age": 27,"A_name": "Jonah", "B_character": "Jonah", "B_nemesis": "Whales"}, {"A_age": 27,"A_name": "Jonah", "B_character": "Jonah", "B_nemesis": "Spiders"}, {"A_age": 18,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Ghosts"}, {"A_age": 18,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Zombies"}, {"A_age": 28,"A_name": "Glory", "B_character": "Glory", "B_nemesis": "Buffy"}, {"A_age": 28,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Ghosts"}, {"A_age": 28,"A_name": "Alan", "B_character": "Alan", "B_nemesis": "Zombies"}]`
+
+```js
+assert.deepEqual(hashJoin(hash1, hash2), res);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const hash1 = [
+    { age: 27, name: 'Jonah' },
+    { age: 18, name: 'Alan' },
+    { age: 28, name: 'Glory' },
+    { age: 18, name: 'Popeye' },
+    { age: 28, name: 'Alan' }
+];
+
+const hash2 = [
+    { character: 'Jonah', nemesis: 'Whales' },
+    { character: 'Jonah', nemesis: 'Spiders' },
+    { character: 'Alan', nemesis: 'Ghosts' },
+    { character: 'Alan', nemesis: 'Zombies' },
+    { character: 'Glory', nemesis: 'Buffy' },
+    { character: 'Bob', nemesis: 'foo' }
+];
+
+const res = [
+    { A_age: 27, A_name: 'Jonah', B_character: 'Jonah', B_nemesis: 'Whales' },
+    { A_age: 27, A_name: 'Jonah', B_character: 'Jonah', B_nemesis: 'Spiders' },
+    { A_age: 18, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Ghosts' },
+    { A_age: 18, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Zombies' },
+    { A_age: 28, A_name: 'Glory', B_character: 'Glory', B_nemesis: 'Buffy' },
+    { A_age: 28, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Ghosts' },
+    { A_age: 28, A_name: 'Alan', B_character: 'Alan', B_nemesis: 'Zombies' }
+];
+
+const bench1 = [{ name: 'u2v7v', num: 1 }, { name: 'n53c8', num: 10 }, { name: 'oysce', num: 9 }, { name: '0mto2s', num: 1 }, { name: 'vkh5id', num: 4 }, { name: '5od0cf', num: 8 }, { name: 'uuulue', num: 10 }, { name: '3rgsbi', num: 9 }, { name: 'kccv35r', num: 4 }, { name: '80un74', num: 9 }, { name: 'h4pp3', num: 6 }, { name: '51bit', num: 7 }, { name: 'j9ndf', num: 8 }, { name: 'vf3u1', num: 10 }, { name: 'g0bw0om', num: 10 }, { name: 'j031x', num: 7 }, { name: 'ij3asc', num: 9 }, { name: 'byv83y', num: 8 }, { name: 'bjzp4k', num: 4 }, { name: 'f3kbnm', num: 10 }];
+const bench2 = [{ friend: 'o8b', num: 8 }, { friend: 'ye', num: 2 }, { friend: '32i', num: 5 }, { friend: 'uz', num: 3 }, { friend: 'a5k', num: 4 }, { friend: 'uad', num: 7 }, { friend: '3w5', num: 10 }, { friend: 'vw', num: 10 }, { friend: 'ah', num: 4 }, { friend: 'qv', num: 7 }, { friend: 'ozv', num: 2 }, { friend: '9ri', num: 10 }, { friend: '7nu', num: 4 }, { friend: 'w3', num: 9 }, { friend: 'tgp', num: 8 }, { friend: 'ibs', num: 1 }, { friend: 'ss7', num: 6 }, { friend: 'g44', num: 9 }, { friend: 'tab', num: 9 }, { friend: 'zem', num: 10 }];
+```
+
+## --seed-contents--
+
+```js
+function hashJoin(hash1, hash2) {
+
+  return [];
+}
+```
+
+# --solutions--
+
+```js
+function hashJoin(hash1, hash2) {
+  const hJoin = (tblA, tblB, strJoin) => {
+    const [jA, jB] = strJoin.split('=');
+    const M = tblB.reduce((a, x) => {
+      const id = x[jB];
+      return (
+        a[id] ? a[id].push(x) : (a[id] = [x]),
+        a
+      );
+    }, {});
+
+    return tblA.reduce((a, x) => {
+      const match = M[x[jA]];
+      return match ? (
+                a.concat(match.map(row => dictConcat(x, row)))
+            ) : a;
+    }, []);
+  };
+
+  const dictConcat = (dctA, dctB) => {
+    const ok = Object.keys;
+    return ok(dctB).reduce(
+            (a, k) => (a[`B_${k}`] = dctB[k]) && a,
+            ok(dctA).reduce(
+                (a, k) => (a[`A_${k}`] = dctA[k]) && a, {}
+            )
+        );
+  };
+
+  return hJoin(hash1, hash2, 'name=character');
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/heronian-triangles.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
new file mode 100644
index 0000000000..7cfd2e6caa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/heronian-triangles.md
@@ -0,0 +1,155 @@
+---
+id: 595b98f8b5a2245e243aa831
+title: Heronian triangles
+challengeType: 5
+forumTopicId: 302285
+dashedName: heronian-triangles
+---
+
+# --description--
+
+[Hero's formula](<https://en.wikipedia.org/wiki/Heron's formula> "wp: Heron's formula") for the area of a triangle given the length of its three sides `a`, `b`, and `c` is given by:
+
+$A = \\sqrt{s(s-a)(s-b)(s-c)},$
+
+where `s` is half the perimeter of the triangle; that is,
+
+$s=\\frac{a+b+c}{2}.$
+
+Heronian triangles are triangles whose sides and area are all integers.
+
+An example is the triangle with sides `3, 4, 5` whose area is `6` (and whose perimeter is `12`).
+
+Note that any triangle whose sides are all an integer multiple of `3, 4, 5`; such as `6, 8, 10,` will also be a Heronian triangle.
+
+Define a Primitive Heronian triangle as a Heronian triangle where the greatest common divisor
+
+of all three sides is `1` (unity).
+
+This will exclude, for example, triangle `6, 8, 10.`
+
+# --instructions--
+
+Implement a function based on Hero's formula that returns the first <code>n<sub>th</sub></code> ordered triangles in an array of arrays.
+
+# --hints--
+
+`heronianTriangle` should be a function.
+
+```js
+assert(typeof heronianTriangle === 'function');
+```
+
+`heronianTriangle(10)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17]]`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[0]), res[0]);
+```
+
+`heronianTriangle(15)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15]],`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[1]), res[1]);
+```
+
+`heronianTriangle(20)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53]],`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[2]), res[2]);
+```
+
+`heronianTriangle(25)` should return `[[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53], [19, 20, 37],[16, 17, 17], [17, 17, 30], [16, 25, 39], [13, 20, 21]]`
+
+```js
+assert.deepEqual(heronianTriangle(testCases[3]), res[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCases = [10, 15, 20, 25];
+
+const res = [
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53]],
+  [[3, 4, 5], [5, 5, 6], [5, 5, 8], [4, 13, 15], [5, 12, 13], [9, 10, 17], [3, 25, 26], [7, 15, 20], [10, 13, 13], [8, 15, 17], [13, 13, 24], [6, 25, 29], [11, 13, 20], [5, 29, 30], [13, 14, 15], [10, 17, 21], [7, 24, 25], [8, 29, 35], [12, 17, 25], [4, 51, 53], [19, 20, 37], [16, 17, 17], [17, 17, 30], [16, 25, 39], [13, 20, 21]]
+];
+```
+
+## --seed-contents--
+
+```js
+function heronianTriangle(n) {
+
+
+  return [];
+}
+```
+
+# --solutions--
+
+```js
+function heronianTriangle(n) {
+  const list = [];
+  const result = [];
+
+  let j = 0;
+  for (let c = 1; c <= 200; c++) {
+    for (let b = 1; b <= c; b++) {
+      for (let a = 1; a <= b; a++) {
+        if (gcd(gcd(a, b), c) === 1 && isHeron(heronArea(a, b, c))) {
+          list[j++] = new Array(a, b, c, heronArea(a, b, c));
+        }
+      }
+    }
+  }
+
+  sort(list);
+
+  for (let i = 0; i < n; i++) {
+    result[i] = [list[i][0], list[i][1], list[i][2]];
+  }
+
+  return result;
+
+  function heronArea(a, b, c) {
+    const s = (a + b + c) / 2;
+    return Math.sqrt(s * (s - a) * (s - b) * (s - c));
+  }
+
+  function isHeron(h) { return h % 1 === 0 && h > 0; }
+
+  function gcd(a, b) {
+    let leftover = 1;
+    let dividend = a > b ? a : b;
+    let divisor = a > b ? b : a;
+    while (leftover !== 0) {
+      leftover = dividend % divisor;
+      if (leftover > 0) {
+        dividend = divisor;
+        divisor = leftover;
+      }
+    }
+    return divisor;
+  }
+
+  function sort(arg) {
+    let swapped = true;
+    let temp = [];
+    while (swapped) {
+      swapped = false;
+      for (let i = 1; i < arg.length; i++) {
+        if (arg[i][4] < arg[i - 1][4] || arg[i][4] === arg[i - 1][4] && arg[i][3] < arg[i - 1][3]) {
+          temp = arg[i];
+          arg[i] = arg[i - 1];
+          arg[i - 1] = temp;
+          swapped = true;
+        }
+      }
+    }
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
new file mode 100644
index 0000000000..1b5b864eda
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-figure-figure-sequences.md
@@ -0,0 +1,166 @@
+---
+id: 59622f89e4e137560018a40e
+title: Hofstadter Figure-Figure sequences
+challengeType: 5
+forumTopicId: 302286
+dashedName: hofstadter-figure-figure-sequences
+---
+
+# --description--
+
+These two sequences of positive integers are defined as:
+
+$R(1)=1\\ ;\\ S(1)=2 \\\\R(n)=R(n-1)+S(n-1), \\quad n>1.$
+
+The sequence $S(n)$ is further defined as the sequence of positive integers not present in $R(n)$.
+
+Sequence $R$ starts:
+
+<pre>1, 3, 7, 12, 18, ...</pre>
+
+Sequence $S$ starts:
+
+<pre>2, 4, 5, 6, 8, ...</pre>
+
+# --instructions--
+
+Create two functions named `ffr` and `ffs` that when given `n` return `R(n)` or `S(n)` respectively. (Note that R(1) = 1 and S(1) = 2 to avoid off-by-one errors).
+
+No maximum value for `n` should be assumed.
+
+**References**
+
+<ul>
+  <li>
+    Sloane's <a href='https://oeis.org/A005228' target='_blank'>A005228</a> and <a href='https://oeis.org/A030124' target='_blank'>A030124</a>.
+  </li>
+  <li>
+    Wikipedia: <a href='https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' title='wp: Hofstadter_sequence#Hofstadter_Figure-Figure_sequences' target='_blank'>Hofstadter Figure-Figure sequences</a>.
+  </li>
+</ul>
+
+# --hints--
+
+`ffr` should be a function.
+
+```js
+assert(typeof ffr === 'function');
+```
+
+`ffs` should be a function.
+
+```js
+assert(typeof ffs === 'function');
+```
+
+`ffr` should return integer.
+
+```js
+assert(Number.isInteger(ffr(1)));
+```
+
+`ffs` should return integer.
+
+```js
+assert(Number.isInteger(ffs(1)));
+```
+
+`ffr(10)` should return `69`
+
+```js
+assert.equal(ffr(ffrParamRes[0][0]), ffrParamRes[0][1]);
+```
+
+`ffr(50)` should return `1509`
+
+```js
+assert.equal(ffr(ffrParamRes[1][0]), ffrParamRes[1][1]);
+```
+
+`ffr(100)` should return `5764`
+
+```js
+assert.equal(ffr(ffrParamRes[2][0]), ffrParamRes[2][1]);
+```
+
+`ffr(1000)` should return `526334`
+
+```js
+assert.equal(ffr(ffrParamRes[3][0]), ffrParamRes[3][1]);
+```
+
+`ffs(10)` should return `14`
+
+```js
+assert.equal(ffs(ffsParamRes[0][0]), ffsParamRes[0][1]);
+```
+
+`ffs(50)` should return `59`
+
+```js
+assert.equal(ffs(ffsParamRes[1][0]), ffsParamRes[1][1]);
+```
+
+`ffs(100)` should return `112`
+
+```js
+assert.equal(ffs(ffsParamRes[2][0]), ffsParamRes[2][1]);
+```
+
+`ffs(1000)` should return `1041`
+
+```js
+assert.equal(ffs(ffsParamRes[3][0]), ffsParamRes[3][1]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const ffrParamRes = [[10, 69], [50, 1509], [100, 5764], [1000, 526334]];
+const ffsParamRes = [[10, 14], [50, 59], [100, 112], [1000, 1041]];
+```
+
+## --seed-contents--
+
+```js
+function ffr(n) {
+  return n;
+}
+
+function ffs(n) {
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+const R = [null, 1];
+const S = [null, 2];
+
+function extendSequences (n) {
+  let current = Math.max(R[R.length - 1], S[S.length - 1]);
+  let i;
+  while (R.length <= n || S.length <= n) {
+    i = Math.min(R.length, S.length) - 1;
+    current += 1;
+    if (current === R[i] + S[i]) {
+      R.push(current);
+    } else {
+      S.push(current);
+    }
+  }
+}
+
+function ffr (n) {
+  extendSequences(n);
+  return R[n];
+}
+
+function ffs (n) {
+  extendSequences(n);
+  return S[n];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
new file mode 100644
index 0000000000..06d4fb69b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/hofstadter-q-sequence.md
@@ -0,0 +1,92 @@
+---
+id: 59637c4d89f6786115efd814
+title: Hofstadter Q sequence
+challengeType: 5
+forumTopicId: 302287
+dashedName: hofstadter-q-sequence
+---
+
+# --description--
+
+The [Hofstadter Q sequence](https://en.wikipedia.org/wiki/Hofstadter_sequence#Hofstadter_Q_sequence "wp: Hofstadter_sequence#Hofstadter_Q_sequence") is defined as:
+
+$Q(1)=Q(2)=1, \\\\ Q(n)=Q\\big(n-Q(n-1)\\big)+Q\\big(n-Q(n-2)), \\quad n>2.$
+
+It is defined like the [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence> "Fibonacci sequence"), but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.
+
+# --instructions--
+
+Implement the Hofstadter Q Sequence equation as a function. The function should accept number, `n`, and return an integer.
+
+# --hints--
+
+`hofstadterQ` should be a function.
+
+```js
+assert(typeof hofstadterQ === 'function');
+```
+
+`hofstadterQ()` should return `integer`
+
+```js
+assert(Number.isInteger(hofstadterQ(1000)));
+```
+
+`hofstadterQ(1000)` should return `502`
+
+```js
+assert.equal(hofstadterQ(testCase[0]), res[0]);
+```
+
+`hofstadterQ(1500)` should return `755`
+
+```js
+assert.equal(hofstadterQ(testCase[1]), res[1]);
+```
+
+`hofstadterQ(2000)` should return `1005`
+
+```js
+assert.equal(hofstadterQ(testCase[2]), res[2]);
+```
+
+`hofstadterQ(2500)` should return `1261`
+
+```js
+assert.equal(hofstadterQ(testCase[3]), res[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testCase = [1000, 1500, 2000, 2500];
+const res = [502, 755, 1005, 1261];
+```
+
+## --seed-contents--
+
+```js
+function hofstadterQ(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function hofstadterQ (n) {
+  const memo = [1, 1, 1];
+  const Q = function (i) {
+    let result = memo[i];
+    if (typeof result !== 'number') {
+      result = Q(i - Q(i - 1)) + Q(i - Q(i - 2));
+      memo[i] = result;
+    }
+    return result;
+  };
+  return Q(n);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
new file mode 100644
index 0000000000..9fd1d6f6f6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/i-before-e-except-after-c.md
@@ -0,0 +1,101 @@
+---
+id: 5a23c84252665b21eecc7eb0
+title: I before E except after C
+challengeType: 5
+forumTopicId: 302288
+dashedName: i-before-e-except-after-c
+---
+
+# --description--
+
+The phrase ["I before E, except after C"](<https://en.wikipedia.org/wiki/I before E except after C>) is a widely known mnemonic which is supposed to help when spelling English words.
+
+Using the words provided, check if the two sub-clauses of the phrase are plausible individually:
+
+<ol>
+  <li>
+    <i>"I before E when not preceded by C".</i>
+  </li>
+  <li>
+    <i>"E before I when preceded by C".</i>
+  </li>
+</ol>
+
+If both sub-phrases are plausible then the original phrase can be said to be plausible.
+
+# --instructions--
+
+Write a function that accepts a word and check if the word follows this rule. The function should return true if the word follows the rule and false if it does not.
+
+# --hints--
+
+`IBeforeExceptC` should be a function.
+
+```js
+assert(typeof IBeforeExceptC == 'function');
+```
+
+`IBeforeExceptC("receive")` should return a boolean.
+
+```js
+assert(typeof IBeforeExceptC('receive') == 'boolean');
+```
+
+`IBeforeExceptC("receive")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('receive'), true);
+```
+
+`IBeforeExceptC("science")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('science'), false);
+```
+
+`IBeforeExceptC("imperceivable")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('imperceivable'), true);
+```
+
+`IBeforeExceptC("inconceivable")` should return `true`.
+
+```js
+assert.equal(IBeforeExceptC('inconceivable'), true);
+```
+
+`IBeforeExceptC("insufficient")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('insufficient'), false);
+```
+
+`IBeforeExceptC("omniscient")` should return `false`.
+
+```js
+assert.equal(IBeforeExceptC('omniscient'), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function IBeforeExceptC(word) {
+
+}
+```
+
+# --solutions--
+
+```js
+function IBeforeExceptC(word)
+{
+    if(word.indexOf("c")==-1 && word.indexOf("ie")!=-1)
+        return true;
+    else if(word.indexOf("cei")!=-1)
+        return true;
+    return false;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iban.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iban.md
new file mode 100644
index 0000000000..666c50a6be
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iban.md
@@ -0,0 +1,104 @@
+---
+id: 5a23c84252665b21eecc7eaf
+title: IBAN
+challengeType: 5
+forumTopicId: 302289
+dashedName: iban
+---
+
+# --description--
+
+The [International Bank Account Number (IBAN)](https://en.wikipedia.org/wiki/International_Bank_Account_Number) is an internationally agreed means of identifying bank accounts across national borders with a reduced risk of propagating [transcription errors](https://en.wikipedia.org/wiki/Transcription_error).
+
+The IBAN consists of up to 34 alphanumeric characters:
+
+<ul>
+  <li>first the two-letter ISO 3166-1 alpha-2 country code</li>
+  <li>then two check digits, and</li>
+  <li>finally a country-specific Basic Bank Account Number (BBAN).</li>
+</ul>
+
+The check digits enable a sanity check of the bank account number to confirm its integrity even before submitting a transaction.
+
+# --instructions--
+
+Write a function that takes IBAN string as parameter. If it is valid return true. Otherwise, return false.
+
+# --hints--
+
+`isValid` should be a function.
+
+```js
+assert(typeof isValid == 'function');
+```
+
+`isValid("GB82 WEST 1234 5698 7654 32")` should return a boolean.
+
+```js
+assert(typeof isValid('GB82 WEST 1234 5698 7654 32') == 'boolean');
+```
+
+`isValid("GB82 WEST 1234 5698 7654 32")` should return `true`.
+
+```js
+assert.equal(isValid('GB82 WEST 1234 5698 7654 32'), true);
+```
+
+`isValid("GB82 WEST 1.34 5698 7654 32")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 WEST 1.34 5698 7654 32'), false);
+```
+
+`isValid("GB82 WEST 1234 5698 7654 325")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 WEST 1234 5698 7654 325'), false);
+```
+
+`isValid("GB82 TEST 1234 5698 7654 32")` should return `false`.
+
+```js
+assert.equal(isValid('GB82 TEST 1234 5698 7654 32'), false);
+```
+
+`isValid("SA03 8000 0000 6080 1016 7519")` should return `true`.
+
+```js
+assert.equal(isValid('SA03 8000 0000 6080 1016 7519'), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isValid(iban) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isValid(iban) {
+  var ibanLen = {
+    NO:15, BE:16, DK:18, FI:18, FO:18, GL:18, NL:18, MK:19,
+    SI:19, AT:20, BA:20, EE:20, KZ:20, LT:20, LU:20, CR:21,
+    CH:21, HR:21, LI:21, LV:21, BG:22, BH:22, DE:22, GB:22,
+    GE:22, IE:22, ME:22, RS:22, AE:23, GI:23, IL:23, AD:24,
+    CZ:24, ES:24, MD:24, PK:24, RO:24, SA:24, SE:24, SK:24,
+    VG:24, TN:24, PT:25, IS:26, TR:26, FR:27, GR:27, IT:27,
+    MC:27, MR:27, SM:27, AL:28, AZ:28, CY:28, DO:28, GT:28,
+    HU:28, LB:28, PL:28, BR:29, PS:29, KW:30, MU:30, MT:31
+  }
+    iban = __helpers.removeWhiteSpace(iban)
+    if (!iban.match(/^[\dA-Z]+$/)) return false
+    var len = iban.length
+    if (len != ibanLen[iban.substr(0,2)]) return false
+    iban = iban.substr(4) + iban.substr(0,4)
+    for (var s='', i=0; i<len; i+=1) s+=parseInt(iban.charAt(i),36)
+    for (var m=s.substr(0,15)%97, s=s.substr(15); s; s=s.substr(13)) m=(m+s.substr(0,13))%97
+    return m == 1
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/identity-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/identity-matrix.md
new file mode 100644
index 0000000000..a8465da648
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/identity-matrix.md
@@ -0,0 +1,88 @@
+---
+id: 5a23c84252665b21eecc7eb1
+title: Identity matrix
+challengeType: 5
+forumTopicId: 302290
+dashedName: identity-matrix
+---
+
+# --description--
+
+An *identity matrix* is a square matrix of size \\( n \\times n \\), where the diagonal elements are all `1`s (ones), and all the other elements are all `0`s (zeroes).
+
+<ul>
+  <li style='list-style: none;'>\(\displaystyle I_{n}=\begin{bmatrix} 1 &#x26; 0 &#x26; 0 \cr 0 &#x26; 1 &#x26; 0 \cr 0 &#x26; 0 &#x26; 1 \cr \end{bmatrix}\)</li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a number `n` as a parameter and returns the identity matrix of order \\( n \\times n \\).
+
+# --hints--
+
+`idMatrix` should be a function.
+
+```js
+assert(typeof idMatrix == 'function');
+```
+
+`idMatrix(1)` should return an array.
+
+```js
+assert(Array.isArray(idMatrix(1)));
+```
+
+`idMatrix(1)` should return `[ [ 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(1), results[0]);
+```
+
+`idMatrix(2)` should return `[ [ 1, 0 ], [ 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(2), results[1]);
+```
+
+`idMatrix(3)` should return `[ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(3), results[2]);
+```
+
+`idMatrix(4)` should return `[ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ]`.
+
+```js
+assert.deepEqual(idMatrix(4), results[3]);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+let results=[[ [ 1 ] ],
+[ [ 1, 0 ], [ 0, 1 ] ],
+[ [ 1, 0, 0 ], [ 0, 1, 0 ], [ 0, 0, 1 ] ],
+[ [ 1, 0, 0, 0 ], [ 0, 1, 0, 0 ], [ 0, 0, 1, 0 ], [ 0, 0, 0, 1 ] ]]
+```
+
+## --seed-contents--
+
+```js
+function idMatrix(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function idMatrix(n) {
+    return Array.apply(null, new Array(n)).map(function (x, i, xs) {
+        return xs.map(function (_, k) {
+            return i === k ? 1 : 0;
+        })
+    });
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
new file mode 100644
index 0000000000..bbed591151
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/iterated-digits-squaring.md
@@ -0,0 +1,96 @@
+---
+id: 5a23c84252665b21eecc7ec1
+title: Iterated digits squaring
+challengeType: 5
+forumTopicId: 302291
+dashedName: iterated-digits-squaring
+---
+
+# --description--
+
+If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89:
+
+<pre>15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89
+7 -> 49 -> 97 -> 130 -> 10 -> 1
+</pre>
+
+# --instructions--
+
+Write a function that takes a number as a parameter and returns 1 or 89 after performing the mentioned process.
+
+# --hints--
+
+`iteratedSquare` should be a function.
+
+```js
+assert(typeof iteratedSquare == 'function');
+```
+
+`iteratedSquare(4)` should return a number.
+
+```js
+assert(typeof iteratedSquare(4) == 'number');
+```
+
+`iteratedSquare(4)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(4), 89);
+```
+
+`iteratedSquare(7)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(7), 1);
+```
+
+`iteratedSquare(15)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(15), 89);
+```
+
+`iteratedSquare(20)` should return `89`.
+
+```js
+assert.equal(iteratedSquare(20), 89);
+```
+
+`iteratedSquare(70)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(70), 1);
+```
+
+`iteratedSquare(100)` should return `1`.
+
+```js
+assert.equal(iteratedSquare(100), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function iteratedSquare(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function iteratedSquare(n) {
+    var total;
+    while (n != 89 && n != 1) {
+        total = 0;
+        while (n > 0) {
+            total += Math.pow(n % 10, 2);
+            n = Math.floor(n/10);
+        }
+        n = total;
+    }
+    return n;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jaro-distance.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jaro-distance.md
new file mode 100644
index 0000000000..d348acaee7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jaro-distance.md
@@ -0,0 +1,146 @@
+---
+id: 5a23c84252665b21eecc7ec2
+title: Jaro distance
+challengeType: 5
+forumTopicId: 302292
+dashedName: jaro-distance
+---
+
+# --description--
+
+The Jaro distance is a measure of similarity between two strings. The higher the Jaro distance for two strings is, the more similar the strings are. The score is normalized such that `0` equates to no similarity and `1` is an exact match.
+
+**Definition**
+
+The Jaro distance \\( d_j \\) of two given strings \\(s_1\\) and \\(s_2\\) is
+
+\\begin{align}d_j = \\begin{cases}0& & \\text{if }m=0 \\\\\\\\{\\frac {1}{3}}\\left({\\frac {m}{|s\_{1}|}}+{\\frac {m}{|s\_{2}|}}+{\\frac {m-t}{m}}\\right)& & \\text{otherwise}\\end{cases}\\end{align}
+
+Where:
+
+<ul>
+  <li>\(m\) is the number of <i>matching characters</i>;</li>
+  <li> \(t\) is half the number of <i>transpositions</i>.</li>
+</ul>
+
+Two characters from \\(s_1\\) and \\(s_2\\) respectively, are considered *matching* only if they are the same and not farther than \\(\\left\\lfloor\\frac{\\max(|s_1|,|s_2|)}{2}\\right\\rfloor-1\\).
+
+Each character of \\(s_1\\) is compared with all its matching characters in \\(s_2\\) . The number of matching (but different sequence order) characters divided by 2 defines the number of *transpositions*.
+
+**Example**
+
+Given the strings \\(s_1\\) *DWAYNE* and \\(s_2\\) *DUANE* we find:
+
+<ul>
+  <li>\(m = 4\)</li>
+  <li>\(|s_1| = 6\)</li>
+  <li>\(|s_2| = 5\)</li>
+  <li>\(t = 0\)</li>
+</ul>
+
+We find a Jaro score of: \\(d_j = \\frac{1}{3}\\left(\\frac{4}{6} + \\frac{4}{5} + \\frac{4-0}{4}\\right) = 0.822\\).
+
+# --instructions--
+
+Write a function a that takes two strings as parameters and returns the associated Jaro distance.
+
+# --hints--
+
+`jaro` should be a function.
+
+```js
+assert(typeof jaro == 'function');
+```
+
+`jaro("MARTHA", "MARHTA")` should return a number.
+
+```js
+assert(typeof jaro('MARTHA', 'MARHTA') == 'number');
+```
+
+`jaro("MARTHA", "MARHTA")` should return `0.9444444444444445`.
+
+```js
+assert.equal(jaro('MARTHA', 'MARHTA'), 0.9444444444444445);
+```
+
+`jaro("DIXON", "DICKSONX")` should return `0.7666666666666666`.
+
+```js
+assert.equal(jaro('DIXON', 'DICKSONX'), 0.7666666666666666);
+```
+
+`jaro("JELLYFISH", "SMELLYFISH")` should return `0.8962962962962964`.
+
+```js
+assert.equal(jaro('JELLYFISH', 'SMELLYFISH'), 0.8962962962962964);
+```
+
+`jaro("HELLOS", "CHELLO")` should return `0.888888888888889`.
+
+```js
+assert.equal(jaro('HELLOS', 'CHELLO'), 0.888888888888889);
+```
+
+`jaro("ABCD", "BCDA")` should return `0.8333333333333334`.
+
+```js
+assert.equal(jaro('ABCD', 'BCDA'), 0.8333333333333334);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function jaro(s, t) {
+
+}
+```
+
+# --solutions--
+
+```js
+function jaro(s, t) {
+  var s_len = s.length;
+  var t_len = t.length;
+
+  if (s_len == 0 && t_len == 0) return 1;
+
+  var match_distance = Math.max(s_len, t_len) / 2 - 1;
+
+  var s_matches = new Array(s_len);
+  var t_matches = new Array(t_len);
+
+  var matches = 0;
+  var transpositions = 0;
+
+  for (var i = 0; i < s_len; i++) {
+    var start = Math.max(0, i - match_distance);
+    var end = Math.min(i + match_distance + 1, t_len);
+
+    for (var j = start; j < end; j++) {
+      if (t_matches[j]) continue;
+      if (s.charAt(i) != t.charAt(j)) continue;
+      s_matches[i] = true;
+      t_matches[j] = true;
+      matches++;
+      break;
+    }
+  }
+
+  if (matches == 0) return 0;
+
+  var k = 0;
+  for (var i = 0; i < s_len; i++) {
+    if (!s_matches[i]) continue;
+    while (!t_matches[k]) k++;
+    if (s.charAt(i) != t.charAt(k)) transpositions++;
+    k++;
+  }
+
+  return ((matches / s_len) +
+    (matches / t_len) +
+    ((matches - transpositions / 2.0) / matches)) / 3.0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jortsort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jortsort.md
new file mode 100644
index 0000000000..0f121b99ee
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/jortsort.md
@@ -0,0 +1,90 @@
+---
+id: 5a23c84252665b21eecc7ec4
+title: JortSort
+challengeType: 5
+forumTopicId: 302293
+dashedName: jortsort
+---
+
+# --description--
+
+jortSort is a sorting toolset that makes the user do the work and guarantees efficiency because you don't have to sort ever again. It was originally presented by Jenn "Moneydollars" Schiffer at the prestigious [JSConf](https://www.youtube.com/watch?v=pj4U_W0OFoE).
+
+jortSort should be a function that takes a single array of comparable objects as its argument. It then sorts the array in ascending order and compares the sorted array to the originally provided array. If the arrays match (i.e. the original array was already sorted), the function returns true. If the arrays do not match (i.e. the original array was not sorted), the function returns false.
+
+# --hints--
+
+`jortsort` should be a function.
+
+```js
+assert(typeof jortsort == 'function');
+```
+
+`jortsort([1,2,3,4,5])` should return a boolean.
+
+```js
+assert(typeof jortsort([1, 2, 3, 4, 5]) == 'boolean');
+```
+
+`jortsort([1,2,3,4,5])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 2, 3, 4, 5]), true);
+```
+
+`jortsort([1,2,13,4,5])` should return `false`.
+
+```js
+assert.equal(jortsort([1, 2, 13, 4, 5]), false);
+```
+
+`jortsort([12,4,51,2,4])` should return `false`.
+
+```js
+assert.equal(jortsort([12, 4, 51, 2, 4]), false);
+```
+
+`jortsort([1,2])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 2]), true);
+```
+
+`jortsort([5,4,3,2,1])` should return `false`.
+
+```js
+assert.equal(jortsort([5, 4, 3, 2, 1]), false);
+```
+
+`jortsort([1,1,1,1,1])` should return `true`.
+
+```js
+assert.equal(jortsort([1, 1, 1, 1, 1]), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function jortsort(array) {
+
+}
+```
+
+# --solutions--
+
+```js
+function jortsort(array) {
+  // sort the array
+  var originalArray = array.slice(0);
+  array.sort( function(a,b){return a - b} );
+
+  // compare to see if it was originally sorted
+  for (var i = 0; i < originalArray.length; ++i) {
+    if (originalArray[i] !== array[i]) return false;
+  }
+
+  return true;
+};
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/josephus-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/josephus-problem.md
new file mode 100644
index 0000000000..245b3ed352
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/josephus-problem.md
@@ -0,0 +1,98 @@
+---
+id: 5a23c84252665b21eecc7ec5
+title: Josephus problem
+challengeType: 5
+forumTopicId: 302294
+dashedName: josephus-problem
+---
+
+# --description--
+
+[Josephus problem](<https://en.wikipedia.org/wiki/Josephus problem>) is a math puzzle with a grim description: $n$ prisoners are standing on a circle, sequentially numbered from $0$ to $n-1$.
+
+An executioner walks along the circle, starting from prisoner $0$, removing every $k$-th prisoner and killing him.
+
+As the process goes on, the circle becomes smaller and smaller, until only one prisoner remains, who is then freed.
+
+For example, if there are $n=5$ prisoners and $k=2$, the order the prisoners are killed in (let's call it the "killing sequence") will be 1, 3, 0, and 4, and the survivor will be #2.
+
+Given any $n, k > 0$, find out which prisoner will be the final survivor.
+
+In one such incident, there were 41 prisoners and every 3<sup>rd</sup> prisoner was being killed ($k=3$).
+
+Among them was a clever chap name Josephus who worked out the problem, stood at the surviving position, and lived on to tell the tale.
+
+Which number was he?
+
+# --instructions--
+
+Write a function that takes the initial number of prisoners and 'k' as parameter and returns the number of the prisoner that survives.
+
+# --hints--
+
+`josephus` should be a function.
+
+```js
+assert(typeof josephus == 'function');
+```
+
+`josephus(30,3)` should return a number.
+
+```js
+assert(typeof josephus(30, 3) == 'number');
+```
+
+`josephus(30,3)` should return `28`.
+
+```js
+assert.equal(josephus(30, 3), 28);
+```
+
+`josephus(30,5)` should return `2`.
+
+```js
+assert.equal(josephus(30, 5), 2);
+```
+
+`josephus(20,2)` should return `8`.
+
+```js
+assert.equal(josephus(20, 2), 8);
+```
+
+`josephus(17,6)` should return `1`.
+
+```js
+assert.equal(josephus(17, 6), 1);
+```
+
+`josephus(29,4)` should return `1`.
+
+```js
+assert.equal(josephus(29, 4), 1);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function josephus(init, kill) {
+
+}
+```
+
+# --solutions--
+
+```js
+function josephus(init, kill) {
+  const arr = Array.from(Array(init).keys());
+  let curr = -1
+  while (arr.length > 1) {
+    curr = (curr + kill) % arr.length;
+    arr.splice(curr, 1);
+    curr--;
+  }
+  return arr[0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/k-d-tree.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/k-d-tree.md
new file mode 100644
index 0000000000..5cb0e1f78f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/k-d-tree.md
@@ -0,0 +1,469 @@
+---
+id: 5a23c84252665b21eecc7ecb
+title: K-d tree
+challengeType: 5
+forumTopicId: 302295
+dashedName: k-d-tree
+---
+
+# --description--
+
+A k-d tree (short for *k*-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees. k-d trees are not suitable, however, for efficiently finding the nearest neighbor in high dimensional spaces. As a general rule, if the dimensionality is *k*, the number of points in the data, *N*, should be *N* ≫ 2<sup><i>k</i></sup>. Otherwise, when k-d trees are used with high-dimensional data, most of the points in the tree will be evaluated and the efficiency is no better than exhaustive search, and other methods such as approximate nearest-neighbor are used instead.
+
+# --instructions--
+
+Write a function to perform a nearest neighbour search using k-d tree. The function takes two parameters: an array of k-dimensional points, and a single k-dimensional point whose nearest neighbour should be returned by the function. A k-dimensional point will be given as an array of k elements.
+
+# --hints--
+
+`kdNN` should be a function.
+
+```js
+assert(typeof kdNN == 'function');
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [9, 2])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    kdNN(
+      [
+        [2, 3],
+        [5, 4],
+        [9, 6],
+        [4, 7],
+        [8, 1],
+        [7, 2]
+      ],
+      [9, 2]
+    )
+  )
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [9, 2])` should return `[ 8, 1 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [9, 2]
+  ),
+  [8, 1]
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [7, 1])` should return `[ 8, 1 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [7, 1]
+  ),
+  [8, 1]
+);
+```
+
+`kdNN([[[2, 3], [5, 4], [9, 6], [4, 7], [8, 1], [7, 2]], [3, 2])` should return `[ 2, 3 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3],
+      [5, 4],
+      [9, 6],
+      [4, 7],
+      [8, 1],
+      [7, 2]
+    ],
+    [3, 2]
+  ),
+  [2, 3]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [1, 2, 3])` should return `[ 1, 2, 5 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [1, 2, 3]
+  ),
+  [1, 2, 5]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [4, 5, 6])` should return `[ 4, 6, 7 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [4, 5, 6]
+  ),
+  [4, 6, 7]
+);
+```
+
+`kdNN([[2, 3, 1], [9, 4, 5], [4, 6, 7], [1, 2, 5], [7, 8, 9], [3, 6, 1]], [8, 8, 8])` should return `[ 7, 8, 9 ]`.
+
+```js
+assert.deepEqual(
+  kdNN(
+    [
+      [2, 3, 1],
+      [9, 4, 5],
+      [4, 6, 7],
+      [1, 2, 5],
+      [7, 8, 9],
+      [3, 6, 1]
+    ],
+    [8, 8, 8]
+  ),
+  [7, 8, 9]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function kdNN(fpoints, fpoint) {
+
+}
+```
+
+# --solutions--
+
+```js
+function kdNN(fpoints, fpoint) {
+  function Node(obj, dimension, parent) {
+    this.obj = obj;
+    this.left = null;
+    this.right = null;
+    this.parent = parent;
+    this.dimension = dimension;
+  }
+
+  function kdTree(points, metric, dimensions) {
+    var self = this;
+
+    function buildTree(points, depth, parent) {
+      var dim = depth % dimensions.length,
+        median,
+        node;
+
+      if (points.length === 0) {
+        return null;
+      }
+      if (points.length === 1) {
+        return new Node(points[0], dim, parent);
+      }
+
+      points.sort(function(a, b) {
+        return a[dimensions[dim]] - b[dimensions[dim]];
+      });
+
+      median = Math.floor(points.length / 2);
+      node = new Node(points[median], dim, parent);
+      node.left = buildTree(points.slice(0, median), depth + 1, node);
+      node.right = buildTree(points.slice(median + 1), depth + 1, node);
+
+      return node;
+    }
+
+    this.root = buildTree(points, 0, null);
+
+    this.insert = function(point) {
+      function innerSearch(node, parent) {
+        if (node === null) {
+          return parent;
+        }
+
+        var dimension = dimensions[node.dimension];
+        if (point[dimension] < node.obj[dimension]) {
+          return innerSearch(node.left, node);
+        } else {
+          return innerSearch(node.right, node);
+        }
+      }
+
+      var insertPosition = innerSearch(this.root, null),
+        newNode,
+        dimension;
+
+      if (insertPosition === null) {
+        this.root = new Node(point, 0, null);
+        return;
+      }
+
+      newNode = new Node(
+        point,
+        (insertPosition.dimension + 1) % dimensions.length,
+        insertPosition
+      );
+      dimension = dimensions[insertPosition.dimension];
+
+      if (point[dimension] < insertPosition.obj[dimension]) {
+        insertPosition.left = newNode;
+      } else {
+        insertPosition.right = newNode;
+      }
+    };
+
+    this.nearest = function(point, maxNodes, maxDistance) {
+      var i, result, bestNodes;
+
+      bestNodes = new BinaryHeap(function(e) {
+        return -e[1];
+      });
+
+      function nearestSearch(node) {
+        var bestChild,
+          dimension = dimensions[node.dimension],
+          ownDistance = metric(point, node.obj),
+          linearPoint = {},
+          linearDistance,
+          otherChild,
+          i;
+
+        function saveNode(node, distance) {
+          bestNodes.push([node, distance]);
+          if (bestNodes.size() > maxNodes) {
+            bestNodes.pop();
+          }
+        }
+
+        for (i = 0; i < dimensions.length; i += 1) {
+          if (i === node.dimension) {
+            linearPoint[dimensions[i]] = point[dimensions[i]];
+          } else {
+            linearPoint[dimensions[i]] = node.obj[dimensions[i]];
+          }
+        }
+
+        linearDistance = metric(linearPoint, node.obj);
+
+        if (node.right === null && node.left === null) {
+          if (
+            bestNodes.size() < maxNodes ||
+            ownDistance < bestNodes.peek()[1]
+          ) {
+            saveNode(node, ownDistance);
+          }
+          return;
+        }
+
+        if (node.right === null) {
+          bestChild = node.left;
+        } else if (node.left === null) {
+          bestChild = node.right;
+        } else {
+          if (point[dimension] < node.obj[dimension]) {
+            bestChild = node.left;
+          } else {
+            bestChild = node.right;
+          }
+        }
+
+        nearestSearch(bestChild);
+
+        if (bestNodes.size() < maxNodes || ownDistance < bestNodes.peek()[1]) {
+          saveNode(node, ownDistance);
+        }
+
+        if (
+          bestNodes.size() < maxNodes ||
+          Math.abs(linearDistance) < bestNodes.peek()[1]
+        ) {
+          if (bestChild === node.left) {
+            otherChild = node.right;
+          } else {
+            otherChild = node.left;
+          }
+          if (otherChild !== null) {
+            nearestSearch(otherChild);
+          }
+        }
+      }
+
+      if (maxDistance) {
+        for (i = 0; i < maxNodes; i += 1) {
+          bestNodes.push([null, maxDistance]);
+        }
+      }
+
+      if (self.root) nearestSearch(self.root);
+
+      result = [];
+
+      for (i = 0; i < Math.min(maxNodes, bestNodes.content.length); i += 1) {
+        if (bestNodes.content[i][0]) {
+          result.push([bestNodes.content[i][0].obj, bestNodes.content[i][1]]);
+        }
+      }
+      return result;
+    };
+  }
+
+  function BinaryHeap(scoreFunction) {
+    this.content = [];
+    this.scoreFunction = scoreFunction;
+  }
+
+  BinaryHeap.prototype = {
+    push: function(element) {
+      // Add the new element to the end of the array.
+      this.content.push(element);
+      // Allow it to bubble up.
+      this.bubbleUp(this.content.length - 1);
+    },
+
+    pop: function() {
+      // Store the first element so we can return it later.
+      var result = this.content[0];
+      // Get the element at the end of the array.
+      var end = this.content.pop();
+      // If there are any elements left, put the end element at the
+      // start, and let it sink down.
+      if (this.content.length > 0) {
+        this.content[0] = end;
+        this.sinkDown(0);
+      }
+      return result;
+    },
+
+    peek: function() {
+      return this.content[0];
+    },
+
+    size: function() {
+      return this.content.length;
+    },
+
+    bubbleUp: function(n) {
+      // Fetch the element that has to be moved.
+      var element = this.content[n];
+      // When at 0, an element can not go up any further.
+      while (n > 0) {
+        // Compute the parent element's index, and fetch it.
+        var parentN = Math.floor((n + 1) / 2) - 1,
+          parent = this.content[parentN];
+        // Swap the elements if the parent is greater.
+        if (this.scoreFunction(element) < this.scoreFunction(parent)) {
+          this.content[parentN] = element;
+          this.content[n] = parent;
+          // Update 'n' to continue at the new position.
+          n = parentN;
+        }
+        // Found a parent that is less, no need to move it further.
+        else {
+          break;
+        }
+      }
+    },
+
+    sinkDown: function(n) {
+      // Look up the target element and its score.
+      var length = this.content.length,
+        element = this.content[n],
+        elemScore = this.scoreFunction(element);
+
+      while (true) {
+        // Compute the indices of the child elements.
+        var child2N = (n + 1) * 2,
+          child1N = child2N - 1;
+        // This is used to store the new position of the element,
+        // if any.
+        var swap = null;
+        // If the first child exists (is inside the array)...
+        if (child1N < length) {
+          // Look it up and compute its score.
+          var child1 = this.content[child1N],
+            child1Score = this.scoreFunction(child1);
+          // If the score is less than our element's, we need to swap.
+          if (child1Score < elemScore) swap = child1N;
+        }
+        // Do the same checks for the other child.
+        if (child2N < length) {
+          var child2 = this.content[child2N],
+            child2Score = this.scoreFunction(child2);
+          if (child2Score < (swap == null ? elemScore : child1Score)) {
+            swap = child2N;
+          }
+        }
+
+        // If the element needs to be moved, swap it, and continue.
+        if (swap != null) {
+          this.content[n] = this.content[swap];
+          this.content[swap] = element;
+          n = swap;
+        }
+        // Otherwise, we are done.
+        else {
+          break;
+        }
+      }
+    }
+  };
+
+  var dims = [];
+
+  for (var i = 0; i < fpoint.length; i++) dims.push(i);
+
+  var tree = new kdTree(
+    fpoints,
+    function(e1, e2) {
+      var d = 0;
+      var e3 = e1;
+      if (!Array.isArray(e1)) {
+        e3 = [];
+        for (var key in e1) e3.push(e1[key]);
+
+        e1 = e3;
+      }
+      e1.forEach(function(e, i) {
+        var sqd = e1[i] - e2[i];
+        d += sqd * sqd;
+      });
+      return d;
+    },
+    dims
+  );
+
+  return tree.nearest(fpoint, 1, 1000)[0][0];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
new file mode 100644
index 0000000000..59e368bc52
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/kaprekar-numbers.md
@@ -0,0 +1,110 @@
+---
+id: 5a23c84252665b21eecc7eca
+title: Kaprekar numbers
+challengeType: 5
+forumTopicId: 302296
+dashedName: kaprekar-numbers
+---
+
+# --description--
+
+A positive integer is a [Kaprekar number](<https://en.wikipedia.org/wiki/Kaprekar number>) if:
+
+<ul>
+  <li>It is 1, or,</li>
+  <li>The decimal representation of its square may be split once into two parts consisting of positive integers which sum to the original number. </li>
+</ul>
+
+Note that a split resulting in a part consisting purely of 0s is not valid, as 0 is not considered positive.Example
+
+Kaprekar numbers:
+
+<ul>
+  <li><code>2223</code> is a Kaprekar number, as <code>2223 * 2223 = 4941729</code>, <code>4941729</code> may be split to <code>494</code> and <code>1729</code>, and <code>494 + 1729 = 2223</code></li>
+  <li>The series of Kaprekar numbers is known as <a href='https://oeis.org/A006886' target='_blank'>A006886</a>, and begins as <code>1, 9, 45, 55, ...</code></li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a number $n$, a base $bs$, and returns true if the number is a Kaprekar number for the given base. Otherwise, the function returns false.
+
+# --hints--
+
+`isKaprekar` should be a function.
+
+```js
+assert(typeof isKaprekar == 'function');
+```
+
+`isKaprekar(1, 10)` should return a boolean.
+
+```js
+assert(typeof isKaprekar(1, 10) == 'boolean');
+```
+
+`isKaprekar(1, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(1, 10), true);
+```
+
+`isKaprekar(9, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(9, 10), true);
+```
+
+`isKaprekar(2223, 10)` should return `true`.
+
+```js
+assert.equal(isKaprekar(2223, 10), true);
+```
+
+`isKaprekar(22823, 10)` should return `false`.
+
+```js
+assert.equal(isKaprekar(22823, 10), false);
+```
+
+`isKaprekar(9, 17)` should return `false`.
+
+```js
+assert.equal(isKaprekar(9, 17), false);
+```
+
+`isKaprekar(225, 17)` should return `true`.
+
+```js
+assert.equal(isKaprekar(225, 17), true);
+```
+
+`isKaprekar(999, 17)` should return `false`.
+
+```js
+assert.equal(isKaprekar(999, 17), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isKaprekar(n, bs) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isKaprekar(n, bs) {
+  if (n < 1) return false;
+  if (n == 1) return true;
+  for (var a = n * n, b = 0, s = 1; a; s *= bs) {
+    b += (a % bs) * s;
+    a = Math.floor(a / bs);
+    if (b && a + b == n) return true;
+  }
+  return false;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
new file mode 100644
index 0000000000..4112f63fb2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-0-1.md
@@ -0,0 +1,255 @@
+---
+id: 5a23c84252665b21eecc7ed1
+title: Knapsack problem/0-1
+challengeType: 5
+forumTopicId: 323649
+dashedName: knapsack-problem0-1
+---
+
+# --description--
+
+The 0-1 knapsack problem is defined as follows:
+
+You are given an array of objects representing items to be put in a knapsack. The objects have 3 attributes: name, weight, and value. The items need to be selected so that the total weight does not exceed the maximum weight and the value is maximized.
+
+# --instructions--
+
+Write a function to solve the knapsack problem. The function is given the array of objects and the maximum weight as parameters. It should return the maximum total value possible.
+
+# --hints--
+
+`knapsack([{ name:'map', weight:9, value:150 }, { name:'compass', weight:13, value:35 }, { name:'water', weight:153, value:200 }, { name:'sandwich', weight:50, value:160 }, { name:'glucose', weight:15, value:60 }, { name:'tin', weight:68, value:45 }, { name:'banana', weight:27, value:60 }, { name:'apple', weight:39, value:40 }], 100)` should return `405`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'map', weight: 9, value: 150 },
+      { name: 'compass', weight: 13, value: 35 },
+      { name: 'water', weight: 153, value: 200 },
+      { name: 'sandwich', weight: 50, value: 160 },
+      { name: 'glucose', weight: 15, value: 60 },
+      { name: 'tin', weight: 68, value: 45 },
+      { name: 'banana', weight: 27, value: 60 },
+      { name: 'apple', weight: 39, value: 40 }
+    ],
+    100
+  ),
+  405
+);
+```
+
+`knapsack([{ name:'map', weight:9, value:150 }, { name:'compass', weight:13, value:35 }, { name:'water', weight:153, value:200 }, { name:'sandwich', weight:50, value:160 }, { name:'glucose', weight:15, value:60 }, { name:'tin', weight:68, value:45 }, { name:'banana', weight:27, value:60 }, { name:'apple', weight:39, value:40 }], 200)` should return `510`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'map', weight: 9, value: 150 },
+      { name: 'compass', weight: 13, value: 35 },
+      { name: 'water', weight: 153, value: 200 },
+      { name: 'sandwich', weight: 50, value: 160 },
+      { name: 'glucose', weight: 15, value: 60 },
+      { name: 'tin', weight: 68, value: 45 },
+      { name: 'banana', weight: 27, value: 60 },
+      { name: 'apple', weight: 39, value: 40 }
+    ],
+    200
+  ),
+  510
+);
+```
+
+`knapsack([{ name:'cheese', weight:23, value:30 }, { name:'beer', weight:52, value:10 }, { name:'suntan cream', weight:11, value:70 }, { name:'camera', weight:32, value:30 }, { name:'T-shirt', weight:24, value:15 }, { name:'trousers', weight:48, value:10 }, { name:'umbrella', weight:73, value:40 }], 100)` should return `145`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'cheese', weight: 23, value: 30 },
+      { name: 'beer', weight: 52, value: 10 },
+      { name: 'suntan cream', weight: 11, value: 70 },
+      { name: 'camera', weight: 32, value: 30 },
+      { name: 'T-shirt', weight: 24, value: 15 },
+      { name: 'trousers', weight: 48, value: 10 },
+      { name: 'umbrella', weight: 73, value: 40 }
+    ],
+    100
+  ),
+  145
+);
+```
+
+`knapsack([{ name:'cheese', weight:23, value:30 }, { name:'beer', weight:52, value:10 }, { name:'suntan cream', weight:11, value:70 }, { name:'camera', weight:32, value:30 }, { name:'T-shirt', weight:24, value:15 }, { name:'trousers', weight:48, value:10 }, { name:'umbrella', weight:73, value:40 }], 200)` should return `185`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'cheese', weight: 23, value: 30 },
+      { name: 'beer', weight: 52, value: 10 },
+      { name: 'suntan cream', weight: 11, value: 70 },
+      { name: 'camera', weight: 32, value: 30 },
+      { name: 'T-shirt', weight: 24, value: 15 },
+      { name: 'trousers', weight: 48, value: 10 },
+      { name: 'umbrella', weight: 73, value: 40 }
+    ],
+    200
+  ),
+  185
+);
+```
+
+`knapsack([{ name:'waterproof trousers', weight:42, value:70 }, { name:'waterproof overclothes', weight:43, value:75 }, { name:'note-case', weight:22, value:80 }, { name:'sunglasses', weight:7, value:20 }, { name:'towel', weight:18, value:12 }, { name:'socks', weight:4, value:50 }, { name:'book', weight:30, value:10 }], 100)` should return `237`.
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'waterproof trousers', weight: 42, value: 70 },
+      { name: 'waterproof overclothes', weight: 43, value: 75 },
+      { name: 'note-case', weight: 22, value: 80 },
+      { name: 'sunglasses', weight: 7, value: 20 },
+      { name: 'towel', weight: 18, value: 12 },
+      { name: 'socks', weight: 4, value: 50 },
+      { name: 'book', weight: 30, value: 10 }
+    ],
+    100
+  ),
+  237
+);
+```
+
+`knapsack([{ name:'waterproof trousers', weight:42, value:70 }, { name:'waterproof overclothes', weight:43, value:75 }, { name:'note-case', weight:22, value:80 }, { name:'sunglasses', weight:7, value:20 }, { name:'towel', weight:18, value:12 }, { name:'socks', weight:4, value:50 }, { name:'book', weight:30, value:10 }], 200)` should return `317`.'
+
+```js
+assert.equal(
+  knapsack(
+    [
+      { name: 'waterproof trousers', weight: 42, value: 70 },
+      { name: 'waterproof overclothes', weight: 43, value: 75 },
+      { name: 'note-case', weight: 22, value: 80 },
+      { name: 'sunglasses', weight: 7, value: 20 },
+      { name: 'towel', weight: 18, value: 12 },
+      { name: 'socks', weight: 4, value: 50 },
+      { name: 'book', weight: 30, value: 10 }
+    ],
+    200
+  ),
+  317
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapsack(items, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapsack(items, maxweight) {
+  var _ = {
+    max: function(e) {
+      var mx = e[0];
+      e.forEach(function(f) {
+        if (mx < f) mx = f;
+      });
+      return mx;
+    },
+    map: function(array, func) {
+      return array.map(func);
+    },
+    isUndefined: function(a) {
+      if (a) {
+        return false;
+      }
+      return true;
+    },
+    range: function(start, end, step) {
+      var a = [];
+      var f = (f = (i, end) => i < end);
+      if (start > end) f = (i, end) => i > end;
+
+      for (var i = start; f(i, end); i += step) a.push(i);
+      return a;
+    }
+  };
+
+  var valuefn = e => e.value;
+  var weightfn = e => e.weight;
+  var _epsilon = 0.01;
+  var _p = _.max(_.map(items, valuefn));
+  var _k = (_epsilon * _p) / items.length;
+
+  var _memo = (function() {
+    var _mem = {};
+    var _key = function(i, w) {
+      return i + '::' + w;
+    };
+    return {
+      get: function(i, w) {
+        return _mem[_key(i, w)];
+      },
+      put: function(i, w, r) {
+        _mem[_key(i, w)] = r;
+        return r;
+      }
+    };
+  })();
+
+  var _m = function(i, w) {
+    i = Math.round(i);
+    w = Math.round(w);
+
+    if (i < 0 || w === 0) {
+      // empty base case
+      return { items: [], totalWeight: 0, totalValue: 0 };
+    }
+
+    var mm = _memo.get(i, w);
+    if (!_.isUndefined(mm)) {
+      return mm;
+    }
+
+    var item = items[i];
+    if (weightfn(item) > w) {
+      //item does not fit, try the next item
+      return _memo.put(i, w, _m(i - 1, w));
+    }
+    // this item could fit.
+    // are we better off excluding it?
+    var excluded = _m(i - 1, w);
+    // or including it?
+    var included = _m(i - 1, w - weightfn(item));
+    if (
+      included.totalValue + Math.floor(valuefn(item) / _k) >
+      excluded.totalValue
+    ) {
+      // better off including it
+      // make a copy of the list
+      var i1 = included.items.slice();
+      i1.push(item);
+      return _memo.put(i, w, {
+        items: i1,
+        totalWeight: included.totalWeight + weightfn(item),
+        totalValue: included.totalValue + Math.floor(valuefn(item) / _k)
+      });
+    }
+    //better off excluding it
+    return _memo.put(i, w, excluded);
+  };
+  var scaled = _m(items.length - 1, maxweight);
+
+  var val = 0;
+  scaled.items.forEach(function(e) {
+    val += e.value;
+  });
+  return val;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
new file mode 100644
index 0000000000..dfcde45510
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-bounded.md
@@ -0,0 +1,212 @@
+---
+id: 5a23c84252665b21eecc7ed2
+title: Knapsack problem/Bounded
+challengeType: 5
+forumTopicId: 323652
+dashedName: knapsack-problembounded
+---
+
+# --description--
+
+The bounded knapsack problem is defined as follows:
+
+You are given an array of objects representing items to be put in a knapsack. The objects have 4 attributes: name, pieces (the number of the particular item), weight, and value. The items need to be selected so that the total weight does not exceed the maximum weight and the value is maximized. Keep in mind that each item can appear between 0 and `pieces` times.
+
+# --instructions--
+
+Write a function to solve the knapsack problem. The function is given the array of objects and the maximum weight as parameters. It should return the maximum total value possible.
+
+# --hints--
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 300)` should return `755`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    300
+  ),
+  755
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 400)` should return `875`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    400
+  ),
+  875
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 500)` should return `1015`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    500
+  ),
+  1015
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 600)` should return `1120`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    600
+  ),
+  1120
+);
+```
+
+`findBestPack([{ name:'map', weight:9, value:150, pieces:1 }, { name:'compass', weight:13, value:35, pieces:1 }, { name:'water', weight:153, value:200, pieces:2 }, { name:'sandwich', weight:50, value:60, pieces:2 }, { name:'glucose', weight:15, value:60, pieces:2 }, { name:'tin', weight:68, value:45, pieces:3 }, { name:'banana', weight:27, value:60, pieces:3 }, { name:'apple', weight:39, value:40, pieces:3 }, { name:'cheese', weight:23, value:30, pieces:1 }, { name:'beer', weight:52, value:10, pieces:3 }, { name:'suntan, cream', weight:11, value:70, pieces:1 }, { name:'camera', weight:32, value:30, pieces:1 }, { name:'T-shirt', weight:24, value:15, pieces:2 }], 700)` should return `1225`.
+
+```js
+assert.equal(
+  findBestPack(
+    [
+      { name: 'map', weight: 9, value: 150, pieces: 1 },
+      { name: 'compass', weight: 13, value: 35, pieces: 1 },
+      { name: 'water', weight: 153, value: 200, pieces: 2 },
+      { name: 'sandwich', weight: 50, value: 60, pieces: 2 },
+      { name: 'glucose', weight: 15, value: 60, pieces: 2 },
+      { name: 'tin', weight: 68, value: 45, pieces: 3 },
+      { name: 'banana', weight: 27, value: 60, pieces: 3 },
+      { name: 'apple', weight: 39, value: 40, pieces: 3 },
+      { name: 'cheese', weight: 23, value: 30, pieces: 1 },
+      { name: 'beer', weight: 52, value: 10, pieces: 3 },
+      { name: 'suntan, cream', weight: 11, value: 70, pieces: 1 },
+      { name: 'camera', weight: 32, value: 30, pieces: 1 },
+      { name: 'T-shirt', weight: 24, value: 15, pieces: 2 }
+    ],
+    700
+  ),
+  1225
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findBestPack(data, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findBestPack(data, maxweight) {
+  var m = [[0]]; // maximum pack value found so far
+  var b = [[0]]; // best combination found so far
+  var opts = [0]; // item index for 0 of item 0
+  var P = [1]; // item encoding for 0 of item 0
+  var choose = 0;
+  for (var j = 0; j < data.length; j++) {
+    opts[j + 1] = opts[j] + data[j].pieces; // item index for 0 of item j+1
+    P[j + 1] = P[j] * (1 + data[j].pieces); // item encoding for 0 of item j+1
+  }
+  for (var j = 0; j < opts[data.length]; j++) {
+    m[0][j + 1] = b[0][j + 1] = 0; // best values and combos for empty pack: nothing
+  }
+  for (var w = 1; w <= maxweight; w++) {
+    m[w] = [0];
+    b[w] = [0];
+    for (var j = 0; j < data.length; j++) {
+      var N = data[j].pieces; // how many of these can we have?
+      var base = opts[j]; // what is the item index for 0 of these?
+      for (var n = 1; n <= N; n++) {
+        var W = n * data[j].weight; // how much do these items weigh?
+        var s = w >= W ? 1 : 0; // can we carry this many?
+        var v = s * n * data[j].value; // how much are they worth?
+        var I = base + n; // what is the item number for this many?
+        var wN = w - s * W; // how much other stuff can we be carrying?
+        var C = n * P[j] + b[wN][base]; // encoded combination
+        m[w][I] = Math.max(m[w][I - 1], v + m[wN][base]); // best value
+        choose = b[w][I] = m[w][I] > m[w][I - 1] ? C : b[w][I - 1];
+      }
+    }
+  }
+
+  var best = [];
+  for (var j = data.length - 1; j >= 0; j--) {
+    best[j] = Math.floor(choose / P[j]);
+    choose -= best[j] * P[j];
+  }
+
+  var wgt = 0;
+  var val = 0;
+  for (var i = 0; i < best.length; i++) {
+    if (0 == best[i]) continue;
+    wgt += best[i] * data[i].weight;
+    val += best[i] * data[i].value;
+  }
+
+  return val;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
new file mode 100644
index 0000000000..c106a4a743
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-continuous.md
@@ -0,0 +1,169 @@
+---
+id: 5a23c84252665b21eecc7ed3
+title: Knapsack problem/Continuous
+challengeType: 5
+forumTopicId: 323654
+dashedName: knapsack-problemcontinuous
+---
+
+# --description--
+
+A thief burgles a butcher's shop, where he can select from some items.
+
+The thief knows the weights and prices of each items. Because he has a knapsack with a limit on the maximum weight that it can carry, he wants to select the items such that he would have his profit maximized. He may cut the items; the item has a reduced price after cutting that is proportional to the original price by the ratio of masses. That means: half of an item has half the price of the original.
+
+# --instructions--
+
+Write a function that takes an array of objects representing the items available in the shop. Each object has 3 attributes: name, weight, and value. The function also takes the maximum weight as a parameter. The function should return the maximum value possible, and the total weight of the selected items should not exceed the maximum weight.
+
+# --hints--
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 10)` should return `257.875`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    10
+  ),
+  257.875
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 12)` should return `295.05405405405406`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    12
+  ),
+  295.05405405405406
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 15)` should return `349.3783783783784`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    15
+  ),
+  349.3783783783784
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 22)` should return `459.5263157894737`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    22
+  ),
+  459.5263157894737
+);
+```
+
+`knapContinuous([{ "weight":3.8, "value":36, name:"beef" }, { "weight":5.4, "value":43, name:"pork" }, { "weight":3.6, "value":90, name:"ham" }, { "weight":2.4, "value":45, name:"greaves" }, { "weight":4.0, "value":30, name:"flitch" }, { "weight":2.5, "value":56, name:"brawn" }, { "weight":3.7, "value":67, name:"welt" }, { "weight":3.0, "value":95, name:"salami" }, { "weight":5.9, "value":98, name:"sausage" }], 24)` should return `478.4736842105263`.
+
+```js
+assert.equal(
+  knapContinuous(
+    [
+      { weight: 3.8, value: 36, name: 'beef' },
+      { weight: 5.4, value: 43, name: 'pork' },
+      { weight: 3.6, value: 90, name: 'ham' },
+      { weight: 2.4, value: 45, name: 'greaves' },
+      { weight: 4.0, value: 30, name: 'flitch' },
+      { weight: 2.5, value: 56, name: 'brawn' },
+      { weight: 3.7, value: 67, name: 'welt' },
+      { weight: 3.0, value: 95, name: 'salami' },
+      { weight: 5.9, value: 98, name: 'sausage' }
+    ],
+    24
+  ),
+  478.4736842105263
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapContinuous(items, maxweight) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapContinuous(items, maxweight) {
+  function item_cmp(a, b) {
+    const ua = a.unitVal,
+      ub = b.unitVal;
+    return ua < ub ? 1 : ua > ub ? -1 : 0;
+  }
+  items = items.map(({ value, weight }) => ({
+    unitVal: value / weight,
+    weight
+  }));
+  items.sort(item_cmp);
+
+  let val = 0;
+  let wt = 0;
+  for (let { unitVal, weight } of items) {
+    var portion = Math.min(maxweight - wt, weight);
+    wt += portion;
+    var addVal = portion * unitVal;
+    val += addVal;
+    if (wt >= maxweight) {
+      break;
+    }
+  }
+  return val;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
new file mode 100644
index 0000000000..74e1ad8916
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knapsack-problem-unbounded.md
@@ -0,0 +1,185 @@
+---
+id: 5a23c84252665b21eecc7ed4
+title: Knapsack problem/Unbounded
+challengeType: 5
+forumTopicId: 323655
+dashedName: knapsack-problemunbounded
+---
+
+# --description--
+
+A traveler gets diverted and has to make an unscheduled stop in what turns out to be Shangri-La. Opting to leave, he is allowed to take as much as he likes of the items available there, so long as it will fit in his knapsack, and he can carry it.
+
+He knows that he can carry no more than a particular value of maximum weight in total; and that the capacity of his knapsack has a limited volume.
+
+Looking just above the bar codes on the items he finds their weights and volumes. He digs out his recent copy of a financial paper and gets the value of each item.
+
+He can only take whole units of any item, but there is much more of any item than he could ever carry.
+
+# --instructions--
+
+Write a function that takes an array of objects, maximum weight, and maximum volume as parameters. Each object has 4 attributes: name, value, weight, and volume. The function should return the maximum value of items the traveller can take with him.
+
+# --hints--
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 25, 0.25)` should return `54500`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    25,
+    0.25
+  ),
+  54500
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 55, 0.25)` should return `88400`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    55,
+    0.25
+  ),
+  88400
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 25, 0.15)` should return `42500`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    25,
+    0.15
+  ),
+  42500
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 35, 0.35)` should return `75900`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    35,
+    0.35
+  ),
+  75900
+);
+```
+
+`knapsackUnbounded([{ name:"panacea", value:3000, weight:0.3, volume:0.025 }, { name:"ichor", value:1800, weight:0.2, volume:0.015 }, { name:"gold", value:2500, weight:2, volume:0.002 }], 15, 0.25)` should return `43200`.
+
+```js
+assert.equal(
+  knapsackUnbounded(
+    [
+      { name: 'panacea', value: 3000, weight: 0.3, volume: 0.025 },
+      { name: 'ichor', value: 1800, weight: 0.2, volume: 0.015 },
+      { name: 'gold', value: 2500, weight: 2, volume: 0.002 }
+    ],
+    15,
+    0.25
+  ),
+  43200
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knapsackUnbounded(items, maxweight, maxvolume) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knapsackUnbounded(items, maxWeight, maxVolume) {
+  function getPickTotals(items, pick) {
+    let totalValue = 0;
+    let totalWeight = 0;
+    let totalVolume = 0;
+    for (let i = 0; i < items.length; i++) {
+      totalValue += pick[i] * items[i].value;
+      totalWeight += pick[i] * items[i].weight;
+      totalVolume += pick[i] * items[i].volume;
+    }
+    return [totalValue, totalWeight, totalVolume];
+  }
+
+  function getMaxes(items, maxWeight, maxVolume) {
+    const maxes = [];
+    for (let i = 0; i < items.length; i++) {
+      const maxUnitsInWeight = Math.floor(maxWeight / items[i].weight);
+      const maxUnitsInVolume = Math.floor(maxVolume / items[i].volume);
+      const maxUnitsInLimit = Math.min(maxUnitsInWeight, maxUnitsInVolume);
+      maxes.push(maxUnitsInLimit);
+    }
+    return maxes;
+  }
+
+  function isInLimit(value, limit) {
+    return value <= limit;
+  }
+
+  function getCombinations(maxValues, curPicks, combinations) {
+    if (maxValues.length === 0) {
+      combinations.push(curPicks);
+    }
+
+    const curMax = maxValues[0];
+    const leftMaxValues = maxValues.slice(1);
+    for (let i = 0; i <= curMax; i++) {
+      getCombinations(leftMaxValues, curPicks.concat(i), combinations);
+    }
+    return combinations;
+  }
+
+  let bestValue = 0;
+  let bestPick = [];
+  const maxes = getMaxes(items, maxWeight, maxVolume);
+  const combinations = getCombinations(maxes, [], []);
+  for (let i = 0; i < combinations.length; i++) {
+    const curPick = combinations[i];
+    const [curValue, curWeight, curVolume] = getPickTotals(items, curPick);
+    if (!isInLimit(curWeight, maxWeight) || !isInLimit(curVolume, maxVolume)) {
+      continue;
+    }
+
+    if (curValue > bestValue) {
+      bestValue = curValue;
+      bestPick = [curPick];
+    } else if (curValue === bestValue) {
+      bestPick.push(curPick);
+    }
+  }
+
+  return bestValue;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knights-tour.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knights-tour.md
new file mode 100644
index 0000000000..c7a4b0693d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/knights-tour.md
@@ -0,0 +1,225 @@
+---
+id: 5a23c84252665b21eecc7ed5
+title: Knight's tour
+challengeType: 5
+forumTopicId: 302297
+dashedName: knights-tour
+---
+
+# --description--
+
+[Knight's Tour](https://en.wikipedia.org/wiki/Knight%27s_tour) Problem: You have an empty `w` \* `h` chessboard, but for a single knight on some square. The knight must perform a sequence of legal moves that result in the knight visiting every square on the chessboard exactly once. Note that it is *not* a requirement that the tour be "closed"; that is, the knight need not end within a single move of its start position.
+
+# --instructions--
+
+Write a function that takes `w` and `h` as parameters and returns the number of initial positions from where it is possible to achieve the task stated above.
+
+# --hints--
+
+`knightTour` should be a function.
+
+```js
+assert(typeof knightTour == 'function');
+```
+
+`knightTour(6, 6)` should return a number.
+
+```js
+assert(typeof knightTour(6, 6) == 'number');
+```
+
+`knightTour(6, 6)` should return `36`.
+
+```js
+assert.equal(knightTour(6, 6), 36);
+```
+
+`knightTour(5, 6)` should return `30`.
+
+```js
+assert.equal(knightTour(5, 6), 30);
+```
+
+`knightTour(4, 6)` should return `12`.
+
+```js
+assert.equal(knightTour(4, 6), 12);
+```
+
+`knightTour(7, 3)` should return `10`.
+
+```js
+assert.equal(knightTour(7, 3), 10);
+```
+
+`knightTour(8, 6)` should return `48`.
+
+```js
+assert.equal(knightTour(8, 6), 48);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function knightTour(w, h) {
+
+}
+```
+
+# --solutions--
+
+```js
+function knightTour(w, h) {
+  function createBoards(rows, columns) {
+    const board = [];
+    const visited = [];
+    for (let i = 0; i < rows; i++) {
+      board.push(new Array(columns).fill(-1));
+      visited.push(new Array(columns).fill(false));
+    }
+    return [board, visited];
+  }
+
+  function copyBoard(board) {
+    const copied = [];
+    for (let i = 0; i < board.length; i++) {
+      copied.push([...board[i]]);
+    }
+    return copied;
+  }
+
+  function isOnBoard(value, limit) {
+    return value >= 0 && value < limit;
+  }
+
+  function markVisited(board, visited, row, column) {
+    visited[row][column] = true;
+    board[row][column] = -1;
+  }
+
+  function areAllVisited(visited) {
+    return (
+      visited.filter(row => row.filter(column => column === false).length !== 0)
+        .length === 0
+    );
+  }
+
+  function getMovesFrom(board, row, column) {
+    const possibleMoves = [];
+    for (let i = 0; i < moves.length; i++) {
+      const [rowChange, colChange] = moves[i];
+      const [rowN, colN] = [row + rowChange, column + colChange];
+      if (!isOnBoard(rowN, board.length) || !isOnBoard(colN, board[0].length)) {
+        continue;
+      }
+      possibleMoves.push([rowN, colN]);
+    }
+    return possibleMoves;
+  }
+
+  function fillAllowedMovesCounts(board) {
+    for (let row = 0; row < board.length; row++) {
+      for (let column = 0; column < board[0].length; column++) {
+        board[row][column] = getMovesFrom(board, row, column).length;
+      }
+    }
+  }
+
+  function updateAllowedMovesCounts(board, possibleMoves) {
+    for (let i = 0; i < possibleMoves.length; i++) {
+      const [row, column] = possibleMoves[i];
+      if (board[row][column] > 0) {
+        board[row][column]--;
+      }
+    }
+  }
+
+  function getBestNextMoves(board, allowedMoves) {
+    let bestMoves = [];
+    let fewestNextMoves = Infinity;
+    let zeroMove = [];
+    for (let i = 0; i < allowedMoves.length; i++) {
+      const [moveRow, moveCol] = allowedMoves[i];
+      const numMoves = board[moveRow][moveCol];
+      if (numMoves === -1) {
+        continue;
+      }
+      if (numMoves === 0) {
+        zeroMove.push(allowedMoves[i]);
+      }
+      if (numMoves < fewestNextMoves) {
+        bestMoves = [allowedMoves[i]];
+        fewestNextMoves = numMoves;
+      } else if (numMoves === fewestNextMoves) {
+        bestMoves.push(allowedMoves[i]);
+      }
+    }
+
+    if (bestMoves.length > 0) {
+      return bestMoves;
+    }
+    return zeroMove;
+  }
+
+  function solve(board, visited, lastRow, lastColumn) {
+    if (areAllVisited(visited)) {
+      return true;
+    }
+    const nextMoves = getMovesFrom(board, lastRow, lastColumn);
+    updateAllowedMovesCounts(board, nextMoves);
+    const allowedMoves = nextMoves.filter(
+      ([row, column]) => !visited[row][column]
+    );
+
+    const bestMoves = getBestNextMoves(board, allowedMoves);
+    const restMoves = allowedMoves.filter(
+      move => bestMoves.indexOf(move) === -1
+    );
+    const possibleMoves = [...bestMoves];
+    possibleMoves.push(...getBestNextMoves(board, restMoves));
+
+    for (let i = 0; i < possibleMoves.length; i++) {
+      const [moveRow, moveCol] = possibleMoves[i];
+      const newBoard = copyBoard(board);
+      const newVisited = copyBoard(visited);
+      markVisited(newBoard, newVisited, moveRow, moveCol);
+      if (solve(newBoard, newVisited, moveRow, moveCol)) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  function solveStart(board, visited, startRow, startColumn) {
+    const newBoard = copyBoard(board);
+    const newVisited = copyBoard(visited);
+    markVisited(newBoard, newVisited, startRow, startColumn);
+    return solve(newBoard, newVisited, startRow, startColumn);
+  }
+
+  const moves = [
+    [-1, -2],
+    [-2, -1],
+    [-2, 1],
+    [-1, 2],
+    [1, 2],
+    [2, 1],
+    [2, -1],
+    [1, -2]
+  ];
+
+  const [baseBoard, baseVisited] = createBoards(h, w);
+  fillAllowedMovesCounts(baseBoard);
+  let solvedCount = 0;
+  for (let row = 0; row < h; row++) {
+    for (let column = 0; column < w; column++) {
+      if (solveStart(baseBoard, baseVisited, row, column)) {
+        solvedCount++;
+      }
+    }
+  }
+  return solvedCount;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
new file mode 100644
index 0000000000..f8938faa66
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/largest-int-from-concatenated-ints.md
@@ -0,0 +1,85 @@
+---
+id: 5a23c84252665b21eecc7edb
+title: Largest int from concatenated ints
+challengeType: 5
+forumTopicId: 302298
+dashedName: largest-int-from-concatenated-ints
+---
+
+# --description--
+
+Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer.
+
+# --hints--
+
+`maxCombine` should be a function.
+
+```js
+assert(typeof maxCombine == 'function');
+```
+
+`maxCombine([1, 3, 3, 4, 55])` should return a number.
+
+```js
+assert(typeof maxCombine([1, 3, 3, 4, 55]) == 'number');
+```
+
+`maxCombine([1, 3, 3, 4, 55])` should return `554331`.
+
+```js
+assert.equal(maxCombine([1, 3, 3, 4, 55]), 554331);
+```
+
+`maxCombine([71, 45, 23, 4, 5])` should return `71545423`.
+
+```js
+assert.equal(maxCombine([71, 45, 23, 4, 5]), 71545423);
+```
+
+`maxCombine([14, 43, 53, 114, 55])` should return `55534314114`.
+
+```js
+assert.equal(maxCombine([14, 43, 53, 114, 55]), 55534314114);
+```
+
+`maxCombine([1, 34, 3, 98, 9, 76, 45, 4])` should return `998764543431`.
+
+```js
+assert.equal(maxCombine([1, 34, 3, 98, 9, 76, 45, 4]), 998764543431);
+```
+
+`maxCombine([54, 546, 548, 60])` should return `6054854654`.
+
+```js
+assert.equal(maxCombine([54, 546, 548, 60]), 6054854654);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function maxCombine(xs) {
+
+}
+```
+
+# --solutions--
+
+```js
+function maxCombine(xs) {
+  return parseInt(
+    xs
+      .sort(function(x, y) {
+        var a = x.toString(),
+          b = y.toString(),
+          ab = parseInt(a + b),
+          ba = parseInt(b + a);
+
+        return ab > ba ? -1 : ab < ba ? 1 : 0;
+      })
+      .join(''),
+    10
+  );
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
new file mode 100644
index 0000000000..e8a6170f54
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-friday-of-each-month.md
@@ -0,0 +1,99 @@
+---
+id: 5a23c84252665b21eecc7edc
+title: Last Friday of each month
+challengeType: 5
+forumTopicId: 302299
+dashedName: last-friday-of-each-month
+---
+
+# --description--
+
+Write a function that returns the date of the last Friday of a given month for a given year.
+
+# --hints--
+
+`lastFriday` should be a function.
+
+```js
+assert(typeof lastFriday == 'function');
+```
+
+`lastFriday(2018, 1)` should return a number.
+
+```js
+assert(typeof lastFriday(2018, 1) == 'number');
+```
+
+`lastFriday(2018, 1)` should return `26`.
+
+```js
+assert.equal(lastFriday(2018, 1), 26);
+```
+
+`lastFriday(2017, 2)` should return `24`.
+
+```js
+assert.equal(lastFriday(2017, 2), 24);
+```
+
+`lastFriday(2012, 3)` should return `30`.
+
+```js
+assert.equal(lastFriday(2012, 3), 30);
+```
+
+`lastFriday(1900, 4)` should return `27`.
+
+```js
+assert.equal(lastFriday(1900, 4), 27);
+```
+
+`lastFriday(2000, 5)` should return `26`.
+
+```js
+assert.equal(lastFriday(2000, 5), 26);
+```
+
+`lastFriday(2006, 6)` should return `30`.
+
+```js
+assert.equal(lastFriday(2006, 6), 30);
+```
+
+`lastFriday(2010, 7)` should return `30`.
+
+```js
+assert.equal(lastFriday(2010, 7), 30);
+```
+
+`lastFriday(2005, 8)` should return `26`.
+
+```js
+assert.equal(lastFriday(2005, 8), 26);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lastFriday(year, month) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lastFriday(year, month) {
+  var i, last_day;
+  i = 0;
+  while (true) {
+    last_day = new Date(year, month, i);
+    if (last_day.getDay() === 5) {
+      return last_day.getDate();
+    }
+    i -= 1;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
new file mode 100644
index 0000000000..a20f5b4df3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/last-letter-first-letter.md
@@ -0,0 +1,211 @@
+---
+id: 5e4ce2b6ac708cc68c1df25e
+title: Last letter-first letter
+challengeType: 5
+forumTopicId: 385256
+dashedName: last-letter-first-letter
+---
+
+# --description--
+
+A certain children's game involves starting with a word in a particular category. Each participant in turn says a word, but that word must begin with the final letter of the previous word. Once a word has been given, it cannot be repeated. If an opponent cannot give a word in the category, they fall out of the game.
+
+For example, with "animals" as the category,
+
+<pre>Child 1: dog
+Child 2: goldfish
+Child 1: hippopotamus
+Child 2: snake
+...
+</pre>
+
+# --instructions--
+
+Write a function that takes an input array of words. The function should return an array of words where the first letter of each word is the same as the last letter of the previous word. Only use the words in the input array, and once a word is used it cannot be repeated. The words in the return array should be selected and sequenced so that that its length is maximized.
+
+# --hints--
+
+`findLongestChain` should be a function.
+
+```js
+assert(typeof findLongestChain == 'function');
+```
+
+`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    findLongestChain([
+      'certain',
+      'each',
+      'game',
+      'involves',
+      'starting',
+      'with',
+      'word'
+    ])
+  )
+);
+```
+
+`findLongestChain(["certain", "each", "game", "involves", "starting", "with", "word"])` should return `["involves", "starting", "game", "each"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'certain',
+    'each',
+    'game',
+    'involves',
+    'starting',
+    'with',
+    'word'
+  ]),
+  ['involves', 'starting', 'game', 'each']
+);
+```
+
+`findLongestChain(["audino", "bagon", "kangaskhan", "banette", "bidoof", "braviary", "exeggcute", "yamask"])` should return `["braviary", "yamask", "kangaskhan"]`
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'audino',
+    'bagon',
+    'kangaskhan',
+    'banette',
+    'bidoof',
+    'braviary',
+    'exeggcute',
+    'yamask'
+  ]),
+  ['braviary', 'yamask', 'kangaskhan']
+);
+```
+
+`findLongestChain(["harp", "poliwrath", "poochyena", "porygon2", "porygonz", "archana"])` should return `["poliwrath", "harp", "poochyena", "archana"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'harp',
+    'poliwrath',
+    'poochyena',
+    'porygon2',
+    'porygonz',
+    'archana'
+  ]),
+  ['poliwrath', 'harp', 'poochyena', 'archana']
+);
+```
+
+`findLongestChain(["scolipede", "elephant", "zeaking", "sealeo", "silcoon", "tigers"])` should return `["scolipede", "elephant", "tigers", "sealeo"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'scolipede',
+    'elephant',
+    'zeaking',
+    'sealeo',
+    'silcoon',
+    'tigers'
+  ]),
+  ['scolipede', 'elephant', 'tigers', 'sealeo']
+);
+```
+
+`findLongestChain(["loudred", "lumineon", "lunatone", "machamp", "magnezone", "nosepass", "petilil", "pidgeotto", "pikachu"])` should return `["machamp", "petilil", "lumineon", "nosepass"]`.
+
+```js
+assert.deepEqual(
+  findLongestChain([
+    'loudred',
+    'lumineon',
+    'lunatone',
+    'machamp',
+    'magnezone',
+    'nosepass',
+    'petilil',
+    'pidgeotto',
+    'pikachu'
+  ]),
+  ['machamp', 'petilil', 'lumineon', 'nosepass']
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findLongestChain(items) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findLongestChain(items) {
+  function Ref(index, first_char, last_char) {
+    this.index = index;
+    this.first_char = first_char;
+    this.last_char = last_char;
+  }
+
+  var items_len = items.length
+  var refs_len = items_len;
+  var refs = []
+
+  // enough space for all items
+  var longest_path_refs_len = 0;
+  var longest_path_refs = new Array(items_len);
+
+  function search(curr_len) {
+    if (curr_len > longest_path_refs_len) {
+      longest_path_refs_len = curr_len;
+
+      for (var i = 0; i < curr_len; i++) {
+        longest_path_refs[i] = refs[i];
+      }
+    }
+
+    // recursive search
+    var last_char = refs[curr_len - 1].last_char;
+    for (var i = curr_len; i < refs_len; i++)
+      if (refs[i].first_char == last_char) {
+        var aux = refs[curr_len];
+        refs[curr_len] = refs[i];
+        refs[i] = aux;
+        search(curr_len + 1);
+        refs[i] = refs[curr_len];
+        refs[curr_len] = aux;
+      }
+  }
+
+  for (var i = 0; i < items_len; i++) {
+    var itemsi_len = items[i].length;
+    refs.push(new Ref(i, items[i][0], items[i][itemsi_len - 1]));
+  }
+
+  // try each item as possible start
+  for (var i = 0; i < items_len; i++) {
+    var aux = refs[0];
+    refs[0] = refs[i];
+    refs[i] = aux;
+    search(1);
+    refs[i] = refs[0];
+    refs[0] = aux;
+  }
+
+  var longest_path_len = longest_path_refs_len;
+  var longest_path = new Array(longest_path_len);
+
+  for (var i = 0; i < longest_path_len; i++)
+    longest_path[i] = items[longest_path_refs[i].index];
+
+  return longest_path;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/leap-year.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/leap-year.md
new file mode 100644
index 0000000000..cf41748dba
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/leap-year.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc7ede
+title: Leap year
+challengeType: 5
+forumTopicId: 302300
+dashedName: leap-year
+---
+
+# --description--
+
+Determine whether a given year is a leap year in the Gregorian calendar.
+
+# --hints--
+
+`isLeapYear` should be a function.
+
+```js
+assert(typeof isLeapYear == 'function');
+```
+
+`isLeapYear()` should return a boolean.
+
+```js
+assert(typeof isLeapYear(2018) == 'boolean');
+```
+
+`isLeapYear(2018)` should return `false`.
+
+```js
+assert.equal(isLeapYear(2018), false);
+```
+
+`isLeapYear(2016)` should return `true`.
+
+```js
+assert.equal(isLeapYear(2016), true);
+```
+
+`isLeapYear(2000)` should return `true`.
+
+```js
+assert.equal(isLeapYear(2000), true);
+```
+
+`isLeapYear(1900)` should return `false`.
+
+```js
+assert.equal(isLeapYear(1900), false);
+```
+
+`isLeapYear(1996)` should return `true`.
+
+```js
+assert.equal(isLeapYear(1996), true);
+```
+
+`isLeapYear(1800)` should return `false`.
+
+```js
+assert.equal(isLeapYear(1800), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLeapYear(year) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isLeapYear(year) {
+  return year % 100 === 0 ? year % 400 === 0 : year % 4 === 0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/least-common-multiple.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
new file mode 100644
index 0000000000..403e448d2f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/least-common-multiple.md
@@ -0,0 +1,87 @@
+---
+id: 5a23c84252665b21eecc7edf
+title: Least common multiple
+challengeType: 5
+forumTopicId: 302301
+dashedName: least-common-multiple
+---
+
+# --description--
+
+The least common multiple of 12 and 18 is 36, because 12 is a factor (12 × 3 = 36), and 18 is a factor (18 × 2 = 36), and there is no positive integer less than 36 that has both factors. As a special case, if either *m* or *n* is zero, then the least common multiple is zero. One way to calculate the least common multiple is to iterate all the multiples of *m*, until you find one that is also a multiple of *n*. If you already have *gcd* for [greatest common divisor](<https://rosettacode.org/wiki/greatest common divisor>), then this formula calculates *lcm*. ( \\operatorname{lcm}(m, n) = \\frac{|m \\times n|}{\\operatorname{gcd}(m, n)} )
+
+# --instructions--
+
+Compute the least common multiple of an array of integers. Given *m* and *n*, the least common multiple is the smallest positive integer that has both *m* and *n* as factors.
+
+# --hints--
+
+`LCM` should be a function.
+
+```js
+assert(typeof LCM == 'function');
+```
+
+`LCM([2, 4, 8])` should return a number.
+
+```js
+assert(typeof LCM([2, 4, 8]) == 'number');
+```
+
+`LCM([2, 4, 8])` should return `8`.
+
+```js
+assert.equal(LCM([2, 4, 8]), 8);
+```
+
+`LCM([4, 8, 12])` should return `24`.
+
+```js
+assert.equal(LCM([4, 8, 12]), 24);
+```
+
+`LCM([3, 4, 5, 12, 40])` should return `120`.
+
+```js
+assert.equal(LCM([3, 4, 5, 12, 40]), 120);
+```
+
+`LCM([11, 33, 90])` should return `990`.
+
+```js
+assert.equal(LCM([11, 33, 90]), 990);
+```
+
+`LCM([-50, 25, -45, -18, 90, 447])` should return `67050`.
+
+```js
+assert.equal(LCM([-50, 25, -45, -18, 90, 447]), 67050);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function LCM(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function LCM(A) {
+  var n = A.length,
+    a = Math.abs(A[0]);
+  for (var i = 1; i < n; i++) {
+    var b = Math.abs(A[i]),
+      c = a;
+    while (a && b) {
+      a > b ? (a %= b) : (b %= a);
+    }
+    a = Math.abs(c * A[i]) / (a + b);
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/left-factorials.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/left-factorials.md
new file mode 100644
index 0000000000..36c2761d93
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/left-factorials.md
@@ -0,0 +1,115 @@
+---
+id: 5a23c84252665b21eecc7ee0
+title: Left factorials
+challengeType: 5
+forumTopicId: 302302
+dashedName: left-factorials
+---
+
+# --description--
+
+**Left factorials**, $ !n $, may refer to either *subfactorials* or to *factorial sums*. The same notation can be confusingly seen used for the two different definitions. Sometimes, *subfactorials* (also known as *derangements*) may use any of the notations:
+
+<ul>
+  <li>$!n`$</li>
+  <li>$!n$</li>
+  <li>$n¡$</li>
+</ul>
+
+(It may not be visually obvious, but the last example uses an upside-down exclamation mark.) This task will be using this formula for **left factorial**:
+
+$ !n = \\sum\_{k=0}^{n-1} k! $
+
+where $!0 = 0$
+
+# --instructions--
+
+Write a function to calculate the left factorial of a given number.
+
+# --hints--
+
+`leftFactorial` should be a function.
+
+```js
+assert(typeof leftFactorial == 'function');
+```
+
+`leftFactorial(0)` should return a number.
+
+```js
+assert(typeof leftFactorial(0) == 'number');
+```
+
+`leftFactorial(0)` should return `0`.
+
+```js
+assert.equal(leftFactorial(0), 0);
+```
+
+`leftFactorial(1)` should return `1`.
+
+```js
+assert.equal(leftFactorial(1), 1);
+```
+
+`leftFactorial(2)` should return `2`.
+
+```js
+assert.equal(leftFactorial(2), 2);
+```
+
+`leftFactorial(3)` should return `4`.
+
+```js
+assert.equal(leftFactorial(3), 4);
+```
+
+`leftFactorial(10)` should return `409114`.
+
+```js
+assert.equal(leftFactorial(10), 409114);
+```
+
+`leftFactorial(17)` should return `22324392524314`.
+
+```js
+assert.equal(leftFactorial(17), 22324392524314);
+```
+
+`leftFactorial(19)` should return `6780385526348314`.
+
+```js
+assert.equal(leftFactorial(19), 6780385526348314);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function leftFactorial(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function leftFactorial(n) {
+  if (n == 0) return 0;
+  if (n == 1) return 1;
+
+  // Note: for n>=20, the result may not be correct.
+  // This is because JavaScript uses 53 bit integers and
+  // for n>=20 result becomes too large.
+
+  let res = 2,
+    fact = 2;
+  for (var i = 2; i < n; i++) {
+    res += fact;
+    fact *= i + 1;
+  }
+
+  return res;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/letter-frequency.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/letter-frequency.md
new file mode 100644
index 0000000000..d7c0a30349
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/letter-frequency.md
@@ -0,0 +1,209 @@
+---
+id: 5e4ce2bbac708cc68c1df25f
+title: Letter frequency
+challengeType: 5
+forumTopicId: 385263
+dashedName: letter-frequency
+---
+
+# --description--
+
+Given a string, calculate the frequency of each character.
+
+All characters should be counted. This includes lower and upper case letters, digits, whitespace, special characters, or any other distinct characters.
+
+# --instructions--
+
+Write a function to count the occurrences of each character in a given string.
+
+The function should return a 2D array with each of the elements in the following form: `['char', freq]`. The character should be a string with a length of 1, and frequency is a number denoting the count.
+
+For example, given the string "ab", your function should return `[['a', 1], ['b', 1]]`.
+
+# --hints--
+
+`letterFrequency` should be a function.
+
+```js
+assert(typeof letterFrequency == 'function');
+```
+
+`letterFrequency("Not all that Mrs. Bennet, however")` should return an array.
+
+```js
+assert(Array.isArray(letterFrequency('Not all that Mrs. Bennet, however')));
+```
+
+`letterFrequency("Not all that Mrs. Bennet, however")` should return `[[" ", 5], [",", 1], [".", 1], ["B", 1], ["M", 1], ["N", 1], ["a", 2], ["e", 4], ["h", 2], ["l", 2], ["n", 2], ["o", 2], ["r", 2], ["s", 1], ["t", 4], ["v", 1], ["w", 1]]`.
+
+```js
+assert.deepEqual(letterFrequency('Not all that Mrs. Bennet, however'), [
+  [' ', 5],
+  [',', 1],
+  ['.', 1],
+  ['B', 1],
+  ['M', 1],
+  ['N', 1],
+  ['a', 2],
+  ['e', 4],
+  ['h', 2],
+  ['l', 2],
+  ['n', 2],
+  ['o', 2],
+  ['r', 2],
+  ['s', 1],
+  ['t', 4],
+  ['v', 1],
+  ['w', 1]
+]);
+```
+
+`letterFrequency("daughters, could ask on the ")` should return `[[" ", 5],[",", 1],["a", 2],["c", 1],["d", 2],["e", 2],["g", 1],["h", 2],["k", 1],["l", 1],["n", 1],["o", 2],["r", 1],["s", 2],["t", 2],["u", 2]]`.
+
+```js
+assert.deepEqual(letterFrequency('daughters, could ask on the '), [
+  [' ', 5],
+  [',', 1],
+  ['a', 2],
+  ['c', 1],
+  ['d', 2],
+  ['e', 2],
+  ['g', 1],
+  ['h', 2],
+  ['k', 1],
+  ['l', 1],
+  ['n', 1],
+  ['o', 2],
+  ['r', 1],
+  ['s', 2],
+  ['t', 2],
+  ['u', 2]
+]);
+```
+
+`letterFrequency("husband any satisfactory description")` should return `[[" ", 3], ["a", 4], ["b", 1], ["c", 2], ["d", 2], ["e", 1], ["f", 1], ["h", 1], ["i", 3], ["n", 3], ["o", 2], ["p", 1], ["r", 2], ["s", 4], ["t", 3], ["u", 1], ["y", 2]]`.
+
+```js
+assert.deepEqual(letterFrequency('husband any satisfactory description'), [
+  [' ', 3],
+  ['a', 4],
+  ['b', 1],
+  ['c', 2],
+  ['d', 2],
+  ['e', 1],
+  ['f', 1],
+  ['h', 1],
+  ['i', 3],
+  ['n', 3],
+  ['o', 2],
+  ['p', 1],
+  ['r', 2],
+  ['s', 4],
+  ['t', 3],
+  ['u', 1],
+  ['y', 2]
+]);
+```
+
+`letterFrequency("in various ways--with barefaced")` should return `[[" ", 3], ["-", 2], ["a", 4], ["b", 1], ["c", 1], ["d", 1], ["e", 2], ["f", 1], ["h", 1], ["i", 3], ["n", 1], ["o", 1], ["r", 2], ["s", 2], ["t", 1], ["u", 1], ["v", 1], ["w", 2], ["y", 1]]`.
+
+```js
+assert.deepEqual(letterFrequency('in various ways--with barefaced'), [
+  [' ', 3],
+  ['-', 2],
+  ['a', 4],
+  ['b', 1],
+  ['c', 1],
+  ['d', 1],
+  ['e', 2],
+  ['f', 1],
+  ['h', 1],
+  ['i', 3],
+  ['n', 1],
+  ['o', 1],
+  ['r', 2],
+  ['s', 2],
+  ['t', 1],
+  ['u', 1],
+  ['v', 1],
+  ['w', 2],
+  ['y', 1]
+]);
+```
+
+`letterFrequency("distant surmises; but he eluded")` should return `[[" ", 4], [";", 1], ["a", 1], ["b", 1], ["d", 3], ["e", 4], ["h", 1], ["i", 2], ["l", 1], ["m", 1], ["n", 1], ["r", 1], ["s", 4], ["t", 3], ["u", 3]]`.
+
+```js
+assert.deepEqual(letterFrequency('distant surmises; but he eluded'), [
+  [' ', 4],
+  [';', 1],
+  ['a', 1],
+  ['b', 1],
+  ['d', 3],
+  ['e', 4],
+  ['h', 1],
+  ['i', 2],
+  ['l', 1],
+  ['m', 1],
+  ['n', 1],
+  ['r', 1],
+  ['s', 4],
+  ['t', 3],
+  ['u', 3]
+]);
+```
+
+`letterFrequency("last obliged to accept the second-hand,")` should return `[[" ", 5], [",", 1], ["-", 1], ["a", 3], ["b", 1], ["c", 3], ["d", 3], ["e", 4], ["g", 1], ["h", 2], ["i", 1], ["l", 2], ["n", 2], ["o", 3], ["p", 1], ["s", 2], ["t", 4]]`.
+
+```js
+assert.deepEqual(letterFrequency('last obliged to accept the second-hand,'), [
+  [' ', 5],
+  [',', 1],
+  ['-', 1],
+  ['a', 3],
+  ['b', 1],
+  ['c', 3],
+  ['d', 3],
+  ['e', 4],
+  ['g', 1],
+  ['h', 2],
+  ['i', 1],
+  ['l', 2],
+  ['n', 2],
+  ['o', 3],
+  ['p', 1],
+  ['s', 2],
+  ['t', 4]
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function letterFrequency(txt) {
+
+}
+```
+
+# --solutions--
+
+```js
+function letterFrequency(txt) {
+    var cs = txt.split(''),
+        i = cs.length,
+        dct =  {},
+        c = '',
+        keys;
+
+    while (i--) {
+        c = cs[i];
+        dct[c] = (dct[c] || 0) + 1;
+    }
+
+    keys = Object.keys(dct);
+    keys.sort();
+    return keys.map(function (c) { return [c, dct[c]]; });
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
new file mode 100644
index 0000000000..104543d9d0
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/levenshtein-distance.md
@@ -0,0 +1,105 @@
+---
+id: 5e4ce2eaac708cc68c1df260
+title: Levenshtein distance
+challengeType: 5
+forumTopicId: 385264
+dashedName: levenshtein-distance
+---
+
+# --description--
+
+In information theory and computer science, the **Levenshtein distance** is a [metric](<https://en.wikipedia.org/wiki/string metric>) for measuring the amount of difference between two sequences (i.e. an [edit distance](<https://en.wikipedia.org/wiki/edit distance>)). The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character.
+
+Example:
+
+The Levenshtein distance between "**kitten**" and "**sitting**" is 3, since the following three edits change one into the other, and there isn't a way to do it with fewer than three edits:
+
+<ul>
+  <li><strong>k</strong>itten   <strong>s</strong>itten    (substitution of 'k' with 's')</li>
+  <li>sitt<strong>e</strong>n   sitt<strong>i</strong>n    (substitution of 'e' with 'i')</li>
+  <li>sittin   sittin<strong>g</strong>    (insert 'g' at the end).</li>
+</ul>
+
+*The Levenshtein distance between "**rosettacode**", "**raisethysword**" is **8**.*
+
+*The distance between two strings is same as that when both strings are reversed.*
+
+# --instructions--
+
+Write a function that returns the Levenshtein distance between two strings given as parameters.
+
+# --hints--
+
+`levenshtein` should be a function.
+
+```js
+assert(typeof levenshtein == 'function');
+```
+
+`levenshtein("mist", "dist")` should return a number.
+
+```js
+assert(typeof levenshtein('mist', 'dist') == 'number');
+```
+
+`levenshtein("mist", "dist")` should return `1`.
+
+```js
+assert.equal(levenshtein('mist', 'dist'), 1);
+```
+
+`levenshtein("tier", "tor")` should return `2`.
+
+```js
+assert.equal(levenshtein('tier', 'tor'), 2);
+```
+
+`levenshtein("kitten", "sitting")` should return `3`.
+
+```js
+assert.equal(levenshtein('kitten', 'sitting'), 3);
+```
+
+`levenshtein("stop", "tops")` should return `2`.
+
+```js
+assert.equal(levenshtein('stop', 'tops'), 2);
+```
+
+`levenshtein("rosettacode", "raisethysword")` should return `8`.
+
+```js
+assert.equal(levenshtein('rosettacode', 'raisethysword'), 8);
+```
+
+`levenshtein("mississippi", "swiss miss")` should return `8`.
+
+```js
+assert.equal(levenshtein('mississippi', 'swiss miss'), 8);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function levenshtein(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function levenshtein(a, b) {
+  var t = [], u, i, j, m = a.length, n = b.length;
+  if (!m) { return n; }
+  if (!n) { return m; }
+  for (j = 0; j <= n; j++) { t[j] = j; }
+  for (i = 1; i <= m; i++) {
+    for (u = [i], j = 1; j <= n; j++) {
+      u[j] = a[i - 1] === b[j - 1] ? t[j - 1] : Math.min(t[j - 1], t[j], u[j - 1]) + 1;
+    } t = u;
+  } return u[n];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
new file mode 100644
index 0000000000..96bf1cf079
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/linear-congruential-generator.md
@@ -0,0 +1,97 @@
+---
+id: 5e4ce2f5ac708cc68c1df261
+title: Linear congruential generator
+challengeType: 5
+forumTopicId: 385266
+dashedName: linear-congruential-generator
+---
+
+# --description--
+
+The [linear congruential generator](<https://en.wikipedia.org/wiki/linear congruential generator>) is a very simple example of a [random number generator](<http://rosettacode.org/wiki/random number generator>). All linear congruential generators use this formula:
+
+$$r_{n + 1} = (a \times r_n + c) \bmod m$$
+
+Where:
+
+<ul>
+<li>$ r_0 $ is a seed.</li>
+<li>$r_1$, $r_2$, $r_3$, ..., are the random numbers.</li>
+<li>$a$, $c$, $m$ are constants.</li>
+</ul>
+
+If one chooses the values of $a$, $c$ and $m$ with care, then the generator produces a uniform distribution of integers from $0$ to $m - 1$.
+
+LCG numbers have poor quality. $r_n$ and $r\_{n + 1}$ are not independent, as true random numbers would be. Anyone who knows $r_n$ can predict $r\_{n + 1}$, therefore LCG is not cryptographically secure. The LCG is still good enough for simple tasks like [Miller-Rabin primality test](<http://rosettacode.org/wiki/Miller-Rabin primality test>), or [FreeCell deals](<http://rosettacode.org/wiki/deal cards for FreeCell>). Among the benefits of the LCG, one can easily reproduce a sequence of numbers, from the same $r_0$. One can also reproduce such sequence with a different programming language, because the formula is so simple.
+
+# --instructions--
+
+Write a function that takes $r_0,a,c,m,n$ as parameters and returns $r_n$.
+
+# --hints--
+
+`linearCongGenerator` should be a function.
+
+```js
+assert(typeof linearCongGenerator == 'function');
+```
+
+`linearCongGenerator(324, 1145, 177, 2148, 3)` should return a number.
+
+```js
+assert(typeof linearCongGenerator(324, 1145, 177, 2148, 3) == 'number');
+```
+
+`linearCongGenerator(324, 1145, 177, 2148, 3)` should return `855`.
+
+```js
+assert.equal(linearCongGenerator(324, 1145, 177, 2148, 3), 855);
+```
+
+`linearCongGenerator(234, 11245, 145, 83648, 4)` should return `1110`.
+
+```js
+assert.equal(linearCongGenerator(234, 11245, 145, 83648, 4), 1110);
+```
+
+`linearCongGenerator(85, 11, 1234, 214748, 5)` should return `62217`.
+
+```js
+assert.equal(linearCongGenerator(85, 11, 1234, 214748, 5), 62217);
+```
+
+`linearCongGenerator(0, 1103515245, 12345, 2147483648, 1)` should return `12345`.
+
+```js
+assert.equal(linearCongGenerator(0, 1103515245, 12345, 2147483648, 1), 12345);
+```
+
+`linearCongGenerator(0, 1103515245, 12345, 2147483648, 2)` should return `1406932606`.
+
+```js
+assert.equal(
+  linearCongGenerator(0, 1103515245, 12345, 2147483648, 2),
+  1406932606
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function linearCongGenerator(r0, a, c, m, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function linearCongGenerator(r0, a, c, m, n) {
+    for (let i = 0; i < n; i++) {
+        r0 = (a * r0 + c) % m;
+    }
+    return r0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/long-multiplication.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/long-multiplication.md
new file mode 100644
index 0000000000..431f88eeb8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/long-multiplication.md
@@ -0,0 +1,111 @@
+---
+id: 5e4ce2a1ac708cc68c1df25d
+title: Long multiplication
+challengeType: 5
+forumTopicId: 385269
+dashedName: long-multiplication
+---
+
+# --description--
+
+Explicitly implement [long multiplication](<https://en.wikipedia.org/wiki/long multiplication>).
+
+This is one possible approach to arbitrary-precision integer algebra.
+
+# --instructions--
+
+Write a function that takes two strings of large numbers as parameters. Your function should return the product of these two large numbers as a string.
+
+**Note:** In JavaScript, arithmetic operations are inaccurate with large numbers, so you will have to implement precise multiplication yourself.
+
+# --hints--
+
+`mult` should be a function.
+
+```js
+assert(typeof mult == 'function');
+```
+
+`mult("18446744073709551616", "18446744073709551616")` should return a string.
+
+```js
+assert(typeof mult('18446744073709551616', '18446744073709551616') == 'string');
+```
+
+`mult("18446744073709551616", "18446744073709551616")` should return `"340282366920938463463374607431768211456"`.
+
+```js
+assert.equal(
+  mult('18446744073709551616', '18446744073709551616'),
+  '340282366920938463463374607431768211456'
+);
+```
+
+`mult("31844674073709551616", "1844674407309551616")` should return `"58743055272886011737990786529368211456"`.
+
+```js
+assert.equal(
+  mult('31844674073709551616', '1844674407309551616'),
+  '58743055272886011737990786529368211456'
+);
+```
+
+`mult("1846744073709551616", "44844644073709551616")` should return `"82816580680737279241781007431768211456"`.
+
+```js
+assert.equal(
+  mult('1846744073709551616', '44844644073709551616'),
+  '82816580680737279241781007431768211456'
+);
+```
+
+`mult("1844674407370951616", "1844674407709551616")` should return `"3402823669833978308014392742590611456"`.
+
+```js
+assert.equal(
+  mult('1844674407370951616', '1844674407709551616'),
+  '3402823669833978308014392742590611456'
+);
+```
+
+`mult("2844674407370951616", "1844674407370955616")` should return `"5247498076580334548376218009219475456"`.
+
+```js
+assert.equal(
+  mult('2844674407370951616', '1844674407370955616'),
+  '5247498076580334548376218009219475456'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mult(strNum1, strNum2) {
+
+}
+```
+
+# --solutions--
+
+```js
+function mult(strNum1, strNum2) {
+    var a1 = strNum1.split("").reverse();
+    var a2 = strNum2.toString().split("").reverse();
+    var aResult = new Array;
+
+    for ( var iterNum1 = 0; iterNum1 < a1.length; iterNum1++ ) {
+        for ( var iterNum2 = 0; iterNum2 < a2.length; iterNum2++ ) {
+            var idxIter = iterNum1 + iterNum2;    // Get the current array position.
+            aResult[idxIter] = a1[iterNum1] * a2[iterNum2] + ( idxIter >= aResult.length ? 0 : aResult[idxIter] );
+
+            if ( aResult[idxIter] > 9 ) {    // Carrying
+                aResult[idxIter + 1] = Math.floor( aResult[idxIter] / 10 ) + ( idxIter + 1 >= aResult.length ? 0 : aResult[idxIter + 1] );
+                aResult[idxIter] %= 10;
+            }
+        }
+    }
+    return aResult.reverse().join("");
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
new file mode 100644
index 0000000000..b027a10f5e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
@@ -0,0 +1,102 @@
+---
+id: 5e6dd1278e6ca105cde40ea9
+title: Longest common subsequence
+challengeType: 5
+forumTopicId: 385271
+dashedName: longest-common-subsequence
+---
+
+# --description--
+
+The **longest common subsequence** (or [**LCS**](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
+
+***1234***
+
+***12***245***3***332***4***
+
+For a string example, consider the sequences "thisisatest" and "testing123testing". An LCS would be "tsitest":
+
+***t***hi***si***sa***test***
+
+***t***e***s***t***i***ng123***test***ing.
+
+Your code only needs to deal with strings.
+
+For more information on this problem please see [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem).
+
+# --instructions--
+
+Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
+
+# --hints--
+
+`lcs` should be a function.
+
+```js
+assert(typeof lcs == 'function');
+```
+
+`lcs("thisisatest", "testing123testing")` should return a string.
+
+```js
+assert(typeof lcs('thisisatest', 'testing123testing') == 'string');
+```
+
+`lcs("thisisatest", "testing123testing")` should return `"tsitest"`.
+
+```js
+assert.equal(lcs('thisisatest', 'testing123testing'), 'tsitest');
+```
+
+`lcs("ABCDGH", "AEDFHR")` should return `"ADH"`.
+
+```js
+assert.equal(lcs('ABCDGH', 'AEDFHR'), 'ADH');
+```
+
+`lcs("AGGTAB", "GXTXAYB")` should return `"GTAB"`.
+
+```js
+assert.equal(lcs('AGGTAB', 'GXTXAYB'), 'GTAB');
+```
+
+`lcs("BDACDB", "BDCB")` should return `"BDCB"`.
+
+```js
+assert.equal(lcs('BDACDB', 'BDCB'), 'BDCB');
+```
+
+`lcs("ABAZDC", "BACBAD")` should return `"ABAD"`.
+
+```js
+assert.equal(lcs('ABAZDC', 'BACBAD'), 'ABAD');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lcs(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lcs(a, b) {
+  var aSub = a.substr(0, a.length - 1);
+  var bSub = b.substr(0, b.length - 1);
+
+  if (a.length === 0 || b.length === 0) {
+    return '';
+  } else if (a.charAt(a.length - 1) === b.charAt(b.length - 1)) {
+    return lcs(aSub, bSub) + a.charAt(a.length - 1);
+  } else {
+    var x = lcs(a, bSub);
+    var y = lcs(aSub, b);
+    return (x.length > y.length) ? x : y;
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
new file mode 100644
index 0000000000..4de5521d55
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-increasing-subsequence.md
@@ -0,0 +1,120 @@
+---
+id: 5e6dd139859c290b6ab80292
+title: Longest increasing subsequence
+challengeType: 5
+forumTopicId: 385272
+dashedName: longest-increasing-subsequence
+---
+
+# --description--
+
+The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. An example:
+
+For the following array:
+
+$\\{3, 10, 2, 1, 20\\}$
+
+Longest increasing sequence is:
+
+$\\{3, 10, 20\\}$
+
+For more information on this problem please see [Wikipedia](<https://en.wikipedia.org/wiki/Longest increasing subsequence>).
+
+# --instructions--
+
+Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
+
+It is guaranteed that every array will have a longest increasing subsequence.
+
+# --hints--
+
+`findSequence` should be a function.
+
+```js
+assert(typeof findSequence == 'function');
+```
+
+`findSequence([3, 10, 2, 1, 20])` should return a array.
+
+```js
+assert(Array.isArray(findSequence([3, 10, 2, 1, 20])));
+```
+
+`findSequence([3, 10, 2, 1, 20])` should return `[3, 10, 20]`.
+
+```js
+assert.deepEqual(findSequence([3, 10, 2, 1, 20]), [3, 10, 20]);
+```
+
+`findSequence([2, 7, 3, 5, 8])` should return `[2, 3, 5, 8]`.
+
+```js
+assert.deepEqual(findSequence([2, 7, 3, 5, 8]), [2, 3, 5, 8]);
+```
+
+`findSequence([2, 6, 4, 5, 1])` should return `[2, 4, 5]`.
+
+```js
+assert.deepEqual(findSequence([2, 6, 4, 5, 1]), [2, 4, 5]);
+```
+
+`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` should return `[10, 22, 33, 50, 60, 80]`.
+
+```js
+assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
+  10,
+  22,
+  33,
+  50,
+  60,
+  80
+]);
+```
+
+`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` should return `[0, 2, 6, 9, 11, 15`.
+
+```js
+assert.deepEqual(
+  findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]),
+  [0, 2, 6, 9, 11, 15]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findSequence(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function findSequence(input) {
+    var len = input.length;
+    var result = []
+    for (var i = 0; i < len; i++) result.push(1)
+
+    for (var i = 0; i < len; i++)
+        for (var j = i - 1; j >= 0; j--)
+            if (input[i] > input[j] && result[j] >= result[i])
+                result[i] = result[j] + 1;
+
+    var maxValue = Math.max.apply(null, result);
+    var maxIndex = result.indexOf(Math.max.apply(Math, result));
+    var output = [];
+    output.push(input[maxIndex]);
+    for (var i = maxIndex; i >= 0; i--) {
+        if (maxValue == 0) break;
+        if (input[maxIndex] > input[i] && result[i] == maxValue - 1) {
+            output.push(input[i]);
+            maxValue--;
+        }
+    }
+    output.reverse();
+    return output;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
new file mode 100644
index 0000000000..06a0c9d550
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/longest-string-challenge.md
@@ -0,0 +1,101 @@
+---
+id: 5e6dd14192286d95fc43046e
+title: Longest string challenge
+challengeType: 5
+forumTopicId: 385275
+dashedName: longest-string-challenge
+---
+
+# --description--
+
+In this challenge, you have to find the strings that are the longest among the given strings.
+
+# --instructions--
+
+Write a function that takes an array of strings and returns the strings that have a length equal to the longest length.
+
+# --hints--
+
+`longestString` should be a function.
+
+```js
+assert(typeof longestString == 'function');
+```
+
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return a array.
+
+```js
+assert(Array.isArray(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg'])));
+```
+
+`longestString(["a", "bb", "ccc", "ee", "f", "ggg"])` should return `["ccc", "ggg"]'`.
+
+```js
+assert.deepEqual(longestString(['a', 'bb', 'ccc', 'ee', 'f', 'ggg']), [
+  'ccc',
+  'ggg'
+]);
+```
+
+`longestString(["afedg", "bb", "sdccc", "efdee", "f", "geegg"])` should return `["afedg", "sdccc", "efdee", "geegg"]`.
+
+```js
+assert.deepEqual(
+  longestString(['afedg', 'bb', 'sdccc', 'efdee', 'f', 'geegg']),
+  ['afedg', 'sdccc', 'efdee', 'geegg']
+);
+```
+
+`longestString(["a", "bhghgb", "ccc", "efde", "fssdrr", "ggg"])` should return `["bhghgb", "fssdrr"]`.
+
+```js
+assert.deepEqual(
+  longestString(['a', 'bhghgb', 'ccc', 'efde', 'fssdrr', 'ggg']),
+  ['bhghgb', 'fssdrr']
+);
+```
+
+`longestString(["ahgfhg", "bdsfsb", "ccc", "ee", "f", "ggdsfg"])` should return `["ahgfhg", "bdsfsb", "ggdsfg"]`.
+
+```js
+assert.deepEqual(
+  longestString(['ahgfhg', 'bdsfsb', 'ccc', 'ee', 'f', 'ggdsfg']),
+  ['ahgfhg', 'bdsfsb', 'ggdsfg']
+);
+```
+
+`longestString(["a", "bbdsf", "ccc", "edfe", "gzzzgg"])` should return `["gzzzgg"]`.
+
+```js
+assert.deepEqual(longestString(['a', 'bbdsf', 'ccc', 'edfe', 'gzzzgg']), [
+  'gzzzgg'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function longestString(strings) {
+
+}
+```
+
+# --solutions--
+
+```js
+function longestString(strings) {
+    var mx = 0;
+    var result = []
+    strings.forEach(function (e) {
+        if (e.length > mx) {
+            mx = e.length
+            result = [e]
+        } else if (e.length == mx)
+            result.push(e)
+    })
+
+    return result
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
new file mode 100644
index 0000000000..073e41920d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/look-and-say-sequence.md
@@ -0,0 +1,92 @@
+---
+id: 5e6dd14797f5ce267c2f19d0
+title: Look-and-say sequence
+challengeType: 5
+forumTopicId: 385277
+dashedName: look-and-say-sequence
+---
+
+# --description--
+
+The [Look and say sequence](<https://en.wikipedia.org/wiki/Look and say sequence>) is a recursively defined sequence of numbers.
+
+Sequence Definition
+
+<ul><li>Take a decimal number</li>
+<li><span>Look</span> at the number, visually grouping consecutive runs of the same digit.</li>
+<li><span>Say</span> the number, from left to right, group by group; as how many of that digit there are - followed by the digit grouped.</li></ul><span> This becomes the next number of the sequence.</span>
+
+An example:
+
+<ul><li>Starting with the number 1, you have <span>one</span> 1 which produces 11</li>
+<li>Starting with 11, you have <span>two</span> 1's. I.E.: 21</li>
+<li>Starting with 21, you have <span>one</span> 2, then <span>one</span> 1. I.E.: (12)(11) which becomes 1211</li>
+<li>Starting with 1211, you have <span>one</span> 1, <span>one</span> 2, then <span>two</span> 1's. I.E.: (11)(12)(21) which becomes 111221</li></ul>
+
+# --instructions--
+
+Write a function that accepts a string as a parameter, processes it, and returns the resultant string.
+
+# --hints--
+
+`lookAndSay` should be a function.
+
+```js
+assert(typeof lookAndSay == 'function');
+```
+
+`lookAndSay("1")` should return a string.
+
+```js
+assert(typeof lookAndSay('1') == 'string');
+```
+
+`lookAndSay("1")` should return `"11"`.
+
+```js
+assert.equal(lookAndSay('1'), '11');
+```
+
+`lookAndSay("11")` should return `"21"`.
+
+```js
+assert.equal(lookAndSay('11'), '21');
+```
+
+`lookAndSay("21")` should return `"1211"`.
+
+```js
+assert.equal(lookAndSay('21'), '1211');
+```
+
+`lookAndSay("1211")` should return `"111221"`.
+
+```js
+assert.equal(lookAndSay('1211'), '111221');
+```
+
+`lookAndSay("3542")` should return `"13151412"`.
+
+```js
+assert.equal(lookAndSay('3542'), '13151412');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lookAndSay(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lookAndSay(str) {
+    return str.replace(/(.)\1*/g, function(seq, p1) {
+      return seq.length.toString() + p1;
+    });
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
new file mode 100644
index 0000000000..e8924ccd28
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/loop-over-multiple-arrays-simultaneously.md
@@ -0,0 +1,139 @@
+---
+id: 5e6dd15004c88cf00d2a78b3
+title: Loop over multiple arrays simultaneously
+challengeType: 5
+forumTopicId: 385279
+dashedName: loop-over-multiple-arrays-simultaneously
+---
+
+# --description--
+
+Loop over multiple arrays and create a new array whose $i^{th}$ element is the concatenation of $i^{th}$ element of each of the given.
+
+For this example, if you are given this array of arrays:
+
+```js
+[ ["a", "b", "c"], ["A", "B", "C"], [1, 2, 3] ]
+```
+
+the output should be:
+
+```js
+["aA1","bB2","cC3"]
+```
+
+# --instructions--
+
+Write a function that takes an array of arrays as a parameter and returns an array of strings satisfying the given description.
+
+# --hints--
+
+`loopSimult` should be a function.
+
+```js
+assert(typeof loopSimult == 'function');
+```
+
+`loopSimult([["a", "b", "c"], ["A", "B", "C"], [1, 2, 3]])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    loopSimult([
+      ['a', 'b', 'c'],
+      ['A', 'B', 'C'],
+      [1, 2, 3]
+    ])
+  )
+);
+```
+
+`loopSimult([["a", "b", "c"], ["A", "B", "C"], [1, 2, 3]])` should return `["aA1", "bB2", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b', 'c'],
+    ['A', 'B', 'C'],
+    [1, 2, 3]
+  ]),
+  ['aA1', 'bB2', 'cC3']
+);
+```
+
+`loopSimult([["c", "b", "c"], ["4", "5", "C"], [7, 7, 3]])` should return `["c47", "b57", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['c', 'b', 'c'],
+    ['4', '5', 'C'],
+    [7, 7, 3]
+  ]),
+  ['c47', 'b57', 'cC3']
+);
+```
+
+`loopSimult([["a", "b", "c", "d"], ["A", "B", "C", "d"], [1, 2, 3, 4]])` should return `["aA1", "bB2", "cC3", "dd4"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b', 'c', 'd'],
+    ['A', 'B', 'C', 'd'],
+    [1, 2, 3, 4]
+  ]),
+  ['aA1', 'bB2', 'cC3', 'dd4']
+);
+```
+
+`loopSimult([["a", "b"], ["A", "B"], [1, 2]])` should return `["aA1", "bB2"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['a', 'b'],
+    ['A', 'B'],
+    [1, 2]
+  ]),
+  ['aA1', 'bB2']
+);
+```
+
+`loopSimult([["b", "c"], ["B", "C"], [2, 3]])` should return `["bB2", "cC3"]`.
+
+```js
+assert.deepEqual(
+  loopSimult([
+    ['b', 'c'],
+    ['B', 'C'],
+    [2, 3]
+  ]),
+  ['bB2', 'cC3']
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function loopSimult(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function loopSimult(A) {
+    var res = [], output;
+    for (var i = 0; i < A[0].length; i += 1) {
+        output = "";
+        for (var j = 0; j < A.length; j++)
+            output += A[j][i];
+        res.push(output);
+    }
+    return res;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lu-decomposition.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
new file mode 100644
index 0000000000..f7a900174e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lu-decomposition.md
@@ -0,0 +1,318 @@
+---
+id: 5e6decd8ec8d7db960950d1c
+title: LU decomposition
+challengeType: 5
+forumTopicId: 385280
+dashedName: lu-decomposition
+---
+
+# --description--
+
+Every square matrix $A$ can be decomposed into a product of a lower triangular matrix $L$ and a upper triangular matrix $U$, as described in [LU decomposition](<https://en.wikipedia.org/wiki/LU decomposition>).
+
+$A = LU$
+
+It is a modified form of Gaussian elimination.
+
+While the [Cholesky decomposition](<http://rosettacode.org/wiki/Cholesky decomposition>) only works for symmetric, positive definite matrices, the more general LU decomposition works for any square matrix.
+
+There are several algorithms for calculating $L$ and $U$.
+
+To derive *Crout's algorithm* for a 3x3 example, we have to solve the following system:
+
+\\begin{align}A = \\begin{pmatrix} a\_{11} & a\_{12} & a\_{13}\\\\ a\_{21} & a\_{22} & a\_{23}\\\\ a\_{31} & a\_{32} & a\_{33}\\\\ \\end{pmatrix}= \\begin{pmatrix} l\_{11} & 0 & 0 \\\\ l\_{21} & l\_{22} & 0 \\\\ l\_{31} & l\_{32} & l\_{33}\\\\ \\end{pmatrix} \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ 0 & u\_{22} & u\_{23} \\\\ 0 & 0 & u\_{33} \\end{pmatrix} = LU\\end{align}
+
+We now would have to solve 9 equations with 12 unknowns. To make the system uniquely solvable, usually the diagonal elements of $L$ are set to 1
+
+$l\_{11}=1$
+
+$l\_{22}=1$
+
+$l\_{33}=1$
+
+so we get a solvable system of 9 unknowns and 9 equations.
+
+\\begin{align}A = \\begin{pmatrix} a\_{11} & a\_{12} & a\_{13}\\\\ a\_{21} & a\_{22} & a\_{23}\\\\ a\_{31} & a\_{32} & a\_{33}\\\\ \\end{pmatrix} = \\begin{pmatrix} 1 & 0 & 0 \\\\ l\_{21} & 1 & 0 \\\\ l\_{31} & l\_{32} & 1\\\\ \\end{pmatrix} \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ 0 & u\_{22} & u\_{23} \\\\ 0 & 0 & u\_{33} \\end{pmatrix} = \\begin{pmatrix} u\_{11} & u\_{12} & u\_{13} \\\\ u\_{11}l\_{21} & u\_{12}l\_{21}+u\_{22} & u\_{13}l\_{21}+u\_{23} \\\\ u\_{11}l\_{31} & u\_{12}l\_{31}+u\_{22}l\_{32} & u\_{13}l\_{31} + u\_{23}l\_{32}+u\_{33} \\end{pmatrix} = LU\\end{align}
+
+Solving for the other $l$ and $u$, we get the following equations:
+
+$u\_{11}=a\_{11}$
+
+$u\_{12}=a\_{12}$
+
+$u\_{13}=a\_{13}$
+
+$u\_{22}=a\_{22} - u\_{12}l\_{21}$
+
+$u\_{23}=a\_{23} - u\_{13}l\_{21}$
+
+$u\_{33}=a\_{33} - (u\_{13}l\_{31} + u\_{23}l\_{32})$
+
+and for $l$:
+
+$l\_{21}=\\frac{1}{u\_{11}} a\_{21}$
+
+$l\_{31}=\\frac{1}{u\_{11}} a\_{31}$
+
+$l\_{32}=\\frac{1}{u\_{22}} (a\_{32} - u\_{12}l\_{31})$
+
+We see that there is a calculation pattern, which can be expressed as the following formulas, first for $U$
+
+$u\_{ij} = a\_{ij} - \\sum\_{k=1}^{i-1} u\_{kj}l\_{ik}$
+
+and then for $L$
+
+$l\_{ij} = \\frac{1}{u\_{jj}} (a\_{ij} - \\sum\_{k=1}^{j-1} u\_{kj}l\_{ik})$
+
+We see in the second formula that to get the $l\_{ij}$ below the diagonal, we have to divide by the diagonal element (pivot) $u\_{jj}$, so we get problems when $u\_{jj}$ is either 0 or very small, which leads to numerical instability.
+
+The solution to this problem is *pivoting* $A$, which means rearranging the rows of $A$, prior to the $LU$ decomposition, in a way that the largest element of each column gets onto the diagonal of $A$. Rearranging the rows means to multiply $A$ by a permutation matrix $P$:
+
+$PA \\Rightarrow A'$
+
+Example:
+
+\\begin{align} \\begin{pmatrix} 0 & 1 \\\\ 1 & 0 \\end{pmatrix} \\begin{pmatrix} 1 & 4 \\\\ 2 & 3 \\end{pmatrix} \\Rightarrow \\begin{pmatrix} 2 & 3 \\\\ 1 & 4 \\end{pmatrix} \\end{align}
+
+The decomposition algorithm is then applied on the rearranged matrix so that
+
+$PA = LU$
+
+# --instructions--
+
+The task is to implement a routine which will take a square nxn matrix $A$ and return a lower triangular matrix $L$, a upper triangular matrix $U$ and a permutation matrix $P$, so that the above equation is fullfilled. The returned value should be in the form `[L, U, P]`.
+
+# --hints--
+
+`luDecomposition` should be a function.
+
+```js
+assert(typeof luDecomposition == 'function');
+```
+
+`luDecomposition([[1, 3, 5], [2, 4, 7], [1, 1, 0]])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    luDecomposition([
+      [1, 3, 5],
+      [2, 4, 7],
+      [1, 1, 0]
+    ])
+  )
+);
+```
+
+`luDecomposition([[1, 3, 5], [2, 4, 7], [1, 1, 0]])` should return `[[[1, 0, 0], [0.5, 1, 0], [0.5, -1, 1]], [[2, 4, 7], [0, 1, 1.5], [0, 0, -2]], [[0, 1, 0], [1, 0, 0], [0, 0, 1]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, 3, 5],
+    [2, 4, 7],
+    [1, 1, 0]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0.5, 1, 0],
+      [0.5, -1, 1]
+    ],
+    [
+      [2, 4, 7],
+      [0, 1, 1.5],
+      [0, 0, -2]
+    ],
+    [
+      [0, 1, 0],
+      [1, 0, 0],
+      [0, 0, 1]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[11, 9, 24, 2], [1, 5, 2, 6], [3, 17, 18, 1], [2, 5, 7, 1]])` should return `[[[1, 0, 0, 0], [0.2727272727272727, 1, 0, 0], [0.09090909090909091, 0.2875, 1, 0], [0.18181818181818182, 0.23124999999999996, 0.0035971223021580693, 1]], [[11, 9, 24, 2], [0, 14.545454545454547, 11.454545454545455, 0.4545454545454546], [0, 0, -3.4749999999999996, 5.6875], [0, 0, 0, 0.510791366906476]], [[1, 0, 0, 0], [0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 1]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [11, 9, 24, 2],
+    [1, 5, 2, 6],
+    [3, 17, 18, 1],
+    [2, 5, 7, 1]
+  ]),
+  [
+    [
+      [1, 0, 0, 0],
+      [0.2727272727272727, 1, 0, 0],
+      [0.09090909090909091, 0.2875, 1, 0],
+      [0.18181818181818182, 0.23124999999999996, 0.0035971223021580693, 1]
+    ],
+    [
+      [11, 9, 24, 2],
+      [0, 14.545454545454547, 11.454545454545455, 0.4545454545454546],
+      [0, 0, -3.4749999999999996, 5.6875],
+      [0, 0, 0, 0.510791366906476]
+    ],
+    [
+      [1, 0, 0, 0],
+      [0, 0, 1, 0],
+      [0, 1, 0, 0],
+      [0, 0, 0, 1]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[1, 1, 1], [4, 3, -1], [3, 5, 3]])` should return `[[[1, 0, 0], [0.75, 1, 0], [0.25, 0.09090909090909091, 1]], [[4, 3, -1], [0, 2.75, 3.75], [0, 0, 0.9090909090909091]], [[0, 1, 0], [0, 0, 1], [1, 0, 0]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, 1, 1],
+    [4, 3, -1],
+    [3, 5, 3]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0.75, 1, 0],
+      [0.25, 0.09090909090909091, 1]
+    ],
+    [
+      [4, 3, -1],
+      [0, 2.75, 3.75],
+      [0, 0, 0.9090909090909091]
+    ],
+    [
+      [0, 1, 0],
+      [0, 0, 1],
+      [1, 0, 0]
+    ]
+  ]
+);
+```
+
+`luDecomposition([[1, -2, 3], [2, -5, 12], [0, 2, -10]])` should return `[[[1, 0, 0], [0, 1, 0], [0.5, 0.25, 1]], [[2, -5, 12], [0, 2, -10], [0, 0, -0.5]], [[0, 1, 0], [0, 0, 1], [1, 0, 0]]]`.
+
+```js
+assert.deepEqual(
+  luDecomposition([
+    [1, -2, 3],
+    [2, -5, 12],
+    [0, 2, -10]
+  ]),
+  [
+    [
+      [1, 0, 0],
+      [0, 1, 0],
+      [0.5, 0.25, 1]
+    ],
+    [
+      [2, -5, 12],
+      [0, 2, -10],
+      [0, 0, -0.5]
+    ],
+    [
+      [0, 1, 0],
+      [0, 0, 1],
+      [1, 0, 0]
+    ]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function luDecomposition(A) {
+
+}
+```
+
+# --solutions--
+
+```js
+function luDecomposition(A) {
+
+    function dotProduct(a, b) {
+        var sum = 0;
+        for (var i = 0; i < a.length; i++)
+            sum += a[i] * b[i]
+        return sum;
+    }
+
+    function matrixMul(A, B) {
+        var result = new Array(A.length);
+        for (var i = 0; i < A.length; i++)
+            result[i] = new Array(B[0].length)
+        var aux = new Array(B.length);
+
+        for (var j = 0; j < B[0].length; j++) {
+
+            for (var k = 0; k < B.length; k++)
+                aux[k] = B[k][j];
+
+            for (var i = 0; i < A.length; i++)
+                result[i][j] = dotProduct(A[i], aux);
+        }
+        return result;
+    }
+
+    function pivotize(m) {
+        var n = m.length;
+        var id = new Array(n);
+        for (var i = 0; i < n; i++) {
+            id[i] = new Array(n);
+            id[i].fill(0)
+            id[i][i] = 1;
+        }
+
+        for (var i = 0; i < n; i++) {
+            var maxm = m[i][i];
+            var row = i;
+            for (var j = i; j < n; j++)
+                if (m[j][i] > maxm) {
+                    maxm = m[j][i];
+                    row = j;
+                }
+
+            if (i != row) {
+                var tmp = id[i];
+                id[i] = id[row];
+                id[row] = tmp;
+            }
+        }
+        return id;
+    }
+
+    var n = A.length;
+    var L = new Array(n);
+    for (var i = 0; i < n; i++) { L[i] = new Array(n); L[i].fill(0) }
+    var U = new Array(n);
+    for (var i = 0; i < n; i++) { U[i] = new Array(n); U[i].fill(0) }
+    var P = pivotize(A);
+    var A2 = matrixMul(P, A);
+
+    for (var j = 0; j < n; j++) {
+        L[j][j] = 1;
+        for (var i = 0; i < j + 1; i++) {
+            var s1 = 0;
+            for (var k = 0; k < i; k++)
+                s1 += U[k][j] * L[i][k];
+            U[i][j] = A2[i][j] - s1;
+        }
+        for (var i = j; i < n; i++) {
+            var s2 = 0;
+            for (var k = 0; k < j; k++)
+                s2 += U[k][j] * L[i][k];
+            L[i][j] = (A2[i][j] - s2) / U[j][j];
+        }
+    }
+    return [L, U, P];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
new file mode 100644
index 0000000000..83d3d2bbfa
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lucas-lehmer-test.md
@@ -0,0 +1,109 @@
+---
+id: 5e6dee7749a0b85a3f1fc7d5
+title: Lucas-Lehmer test
+challengeType: 5
+forumTopicId: 385281
+dashedName: lucas-lehmer-test
+---
+
+# --description--
+
+Lucas-Lehmer Test: for $p$ an odd prime, the Mersenne number $2^p-1$ is prime if and only if $2^p-1$ divides $S(p-1)$ where $S(n+1)=(S(n))^2-2$, and $S(1)=4$.
+
+# --instructions--
+
+Write a function that returns whether the given Mersenne number is prime or not.
+
+# --hints--
+
+`lucasLehmer` should be a function.
+
+```js
+assert(typeof lucasLehmer == 'function');
+```
+
+`lucasLehmer(11)` should return a boolean.
+
+```js
+assert(typeof lucasLehmer(11) == 'boolean');
+```
+
+`lucasLehmer(11)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(11), false);
+```
+
+`lucasLehmer(15)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(15), false);
+```
+
+`lucasLehmer(13)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(13), true);
+```
+
+`lucasLehmer(17)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(17), true);
+```
+
+`lucasLehmer(19)` should return `true`.
+
+```js
+assert.equal(lucasLehmer(19), true);
+```
+
+`lucasLehmer(21)` should return `false`.
+
+```js
+assert.equal(lucasLehmer(21), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lucasLehmer(p) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lucasLehmer(p) {
+    function isPrime(p) {
+        if (p == 2)
+            return true;
+        else if (p <= 1 || p % 2 == 0)
+            return false;
+        else {
+            var to = Math.sqrt(p);
+            for (var i = 3; i <= to; i += 2)
+                if (p % i == 0)
+                    return false;
+            return true;
+        }
+    }
+
+    function isMersennePrime(p) {
+        if (p == 2)
+            return true;
+        else {
+            var m_p = Math.pow(2, p) - 1
+            var s = 4;
+            for (var i = 3; i <= p; i++)
+                s = (s * s - 2) % m_p
+            return s == 0;
+        }
+    }
+
+    return isPrime(p) && isMersennePrime(p)
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ludic-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
new file mode 100644
index 0000000000..0e7be774f5
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/ludic-numbers.md
@@ -0,0 +1,129 @@
+---
+id: 5ea281203167d2b0bdefca00
+title: Ludic numbers
+challengeType: 5
+forumTopicId: 385282
+dashedName: ludic-numbers
+---
+
+# --description--
+
+[Ludic numbers](https://oeis.org/wiki/Ludic_numbers) are related to prime numbers as they are generated by a sieve quite like the [Sieve of Eratosthenes](https://rosettacode.org/wiki/Sieve_of_Eratosthenes) is used to generate prime numbers.
+
+The first ludic number is 1.
+
+To generate succeeding ludic numbers create an array of increasing integers starting from 2.
+
+<code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'>2</span> 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 ...</code>
+
+(Loop)
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>2</span>.</li>
+  <li>Remove every <strong>2<sup>nd</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold;'><s>2</s></span> 3 <s>4</s> 5 <s>6</s> 7 <s>8</s> 9 <s>10</s> 11 <s>12</s> 13 <s>14</s> 15 <s>16</s> 17 <s>18</s> 19 <s>20</s> 21 <s>22</s> 23 <s>24</s> 25 <s>26</s> ...</code>
+</ul>
+
+<ul>
+  <li>(Unrolling a few loops...)</li>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>3</span>.</li>
+  <li>Remove every <strong>3<sup>rd</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>3</s></span> 5 7 <s>9</s> 11 13 <s>15</s> 17 19 <s>21</s> 23 25 <s>27</s> 29 31 <s>33</s> 35 37 <s>39</s> 41 43 <s>45</s> 47 49 <s>51</s> ...</code>
+</ul>
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>5</span>.</li>
+  <li>Remove every <strong>5<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>5</s></span> 7 11 13 17 <s>19</s> 23 25 29 31 <s>35</s> 37 41 43 47 <s>49</s> 53 55 59 61 <s>65</s> 67 71 73 77 ...</code>
+</ul>
+
+<ul>
+  <li>Take the first member of the resultant array as the next ludic number <span style='color:blue;font-weight:bold'>7</span>.</li>
+  <li>Remove every <strong>7<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <code style='margin-left: 2em;'><span style='color:blue;font-weight:bold'><s>7</s></span> 11 13 17 23 25 29 <s>31</s> 37 41 43 47 53 55 <s>59</s> 61 67 71 73 77 83 <s>85</s> 89 91 97 ...</code>
+</ul>
+
+<ul>
+  <li><big><b> ... </b></big></li>
+  <li>Take the first member of the current array as the next ludic number <span style='color:blue;font-weight:bold'>L</span>.</li>
+  <li>Remove every <strong>L<sup>th</sup></strong> indexed item from the array (including the first).</li>
+  <li><big><b> ... </b></big></li>
+</ul>
+
+# --instructions--
+
+Write a function that returns all the ludic numbers less than or equal to the given number.
+
+# --hints--
+
+`ludic` should be a function.
+
+```js
+assert(typeof ludic === 'function', '<code>ludic</code> should be a function.');
+```
+
+`ludic(2)` should return a array.
+
+```js
+assert(Array.isArray(ludic(2)));
+```
+
+`ludic(2)` should return `[1, 2]`.
+
+```js
+assert.deepEqual(ludic(2), [1, 2]);
+```
+
+`ludic(3)` should return `[1, 2, 3]`.
+
+```js
+assert.deepEqual(ludic(3), [1, 2, 3]);
+```
+
+`ludic(5)` should return `[1, 2, 3, 5]`.
+
+```js
+assert.deepEqual(ludic(5), [1, 2, 3, 5]);
+```
+
+`ludic(20)` should return `[1, 2, 3, 5, 7, 11, 13, 17]`.
+
+```js
+assert.deepEqual(ludic(20), [1, 2, 3, 5, 7, 11, 13, 17]);
+```
+
+`ludic(26)` should return `[1, 2, 3, 5, 7, 11, 13, 17, 23, 25]`.
+
+```js
+assert.deepEqual(ludic(26), [1, 2, 3, 5, 7, 11, 13, 17, 23, 25]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function ludic(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function ludic(n) {
+  const makeArr = (s, e) => new Array(e + 1 - s).fill(s).map((e, i) => e + i);
+
+  const filterAtInc = (arr, n) => arr.filter((e, i) => (i + 1) % n);
+
+  const makeLudic = (arr, result) => {
+    const iter = arr.shift();
+    result.push(iter);
+    return arr.length ? makeLudic(filterAtInc(arr, iter), result) : result;
+  };
+
+  const ludicResult = makeLudic(makeArr(2, n), [1]);
+
+  return ludicResult;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
new file mode 100644
index 0000000000..0a44e1da79
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/luhn-test-of-credit-card-numbers.md
@@ -0,0 +1,125 @@
+---
+id: 5ea28156e79528a9ab248f27
+title: Luhn test of credit card numbers
+challengeType: 5
+forumTopicId: 385284
+dashedName: luhn-test-of-credit-card-numbers
+---
+
+# --description--
+
+The [Luhn test](<https://en.wikipedia.org/wiki/Luhn algorithm>) is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits.
+
+Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test:
+
+<ol>
+  <li> Reverse the order of the digits in the number.</li>
+  <li> Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1</li>
+  <li> Taking the second, fourth ... and every other even digit in the reversed digits:</li>
+    <ol>
+      <li>Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits.</li>
+      <li>Sum the partial sums of the even digits to form s2.</li>
+    </ol>
+  <li>If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.</li>
+</ol>
+
+For example, if the trial number is 49927398716:
+
+```bash
+Reverse the digits:
+  61789372994
+Sum the odd digits:
+  6 + 7 + 9 + 7 + 9 + 4 = 42 = s1
+The even digits:
+    1, 8, 3, 2, 9
+  Two times each even digit:
+    2, 16, 6, 4, 18
+  Sum the digits of each multiplication:
+    2, 7, 6, 4, 9
+  Sum the last:
+    2 + 7 + 6 + 4 + 9 = 28 = s2
+
+s1 + s2 = 70 which ends in zero which means that 49927398716 passes the Luhn test.
+```
+
+# --instructions--
+
+Write a function that will validate a number with the Luhn test. Return true if it's a valid number. Otherwise, return false.
+
+# --hints--
+
+`luhnTest` should be a function.
+
+```js
+assert(typeof luhnTest === 'function');
+```
+
+`luhnTest("4111111111111111")` should return a boolean.
+
+```js
+assert(typeof luhnTest('4111111111111111') === 'boolean');
+```
+
+`luhnTest("4111111111111111")` should return `true`.
+
+```js
+assert.equal(luhnTest('4111111111111111'), true);
+```
+
+`luhnTest("4111111111111112")` should return `false`.
+
+```js
+assert.equal(luhnTest('4111111111111112'), false);
+```
+
+`luhnTest("49927398716")` should return `true`.
+
+```js
+assert.equal(luhnTest('49927398716'), true);
+```
+
+`luhnTest("49927398717")` should return `false`.
+
+```js
+assert.equal(luhnTest('49927398717'), false);
+```
+
+`luhnTest("1234567812345678")` should return `false`.
+
+```js
+assert.equal(luhnTest('1234567812345678'), false);
+```
+
+`luhnTest("1234567812345670")` should return `true`.
+
+```js
+assert.equal(luhnTest('1234567812345670'), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function luhnTest(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function luhnTest(str) {
+  var luhnArr = [0, 2, 4, 6, 8, 1, 3, 5, 7, 9];
+  var counter = 0;
+  var incNum;
+  var odd = false;
+  var temp = String(str).replace(/[^\d]/g, '');
+  if (temp.length == 0) return false;
+  for (var i = temp.length - 1; i >= 0; --i) {
+    incNum = parseInt(temp.charAt(i), 10);
+    counter += (odd = !odd) ? incNum : luhnArr[incNum];
+  }
+  return counter % 10 == 0;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
new file mode 100644
index 0000000000..5ffc202ebd
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lychrel-numbers.md
@@ -0,0 +1,151 @@
+---
+id: 5ea2815a8640bcc6cb7dab3c
+title: Lychrel numbers
+challengeType: 5
+forumTopicId: 385287
+dashedName: lychrel-numbers
+---
+
+# --description--
+
+<ol>
+  <li>Take an integer <code>n₀</code>, greater than zero.</li>
+  <li>Form the next number <code>n</code> of the series by reversing <code>n₀</code> and adding it to <code>n₀</code></li>
+  <li>Stop when <code>n</code> becomes palindromic - i.e. the digits of <code>n</code> in reverse order == <code>n</code>.</li>
+</ol>
+
+The above recurrence relation when applied to most starting numbers `n` = 1, 2, ... terminates in a palindrome quite quickly.
+
+For example if `n₀` = 12 we get:
+
+```bash
+12
+12 + 21 = 33,  a palindrome!
+```
+
+And if `n₀` = 55 we get:
+
+```bash
+55
+55 + 55 = 110
+110 + 011 = 121,  a palindrome!
+```
+
+Notice that the check for a palindrome happens *after* an addition.
+
+Some starting numbers seem to go on forever; the recurrence relation for 196 has been calculated for millions of repetitions forming numbers with millions of digits, without forming a palindrome. These numbers that do not end in a palindrome are called **Lychrel numbers**.
+
+For the purposes of this task a Lychrel number is any starting number that does not form a palindrome within 500 (or more) iterations.
+
+**Seed and related Lychrel numbers:**
+
+Any integer produced in the sequence of a Lychrel number is also a Lychrel number.
+
+In general, any sequence from one Lychrel number *might* converge to join the sequence from a prior Lychrel number candidate; for example the sequences for the numbers 196 and then 689 begin:
+
+```bash
+    196
+    196 + 691 = 887
+    887 + 788 = 1675
+    1675 + 5761 = 7436
+    7436 + 6347 = 13783
+    13783 + 38731 = 52514
+    52514 + 41525 = 94039
+    ...
+    689
+    689 + 986 = 1675
+    1675 + 5761 = 7436
+    ...
+```
+
+So we see that the sequence starting with 689 converges to, and continues with the same numbers as that for 196.
+
+Because of this we can further split the Lychrel numbers into true **Seed** Lychrel number candidates, and **Related** numbers that produce no palindromes but have integers in their sequence seen as part of the sequence generated from a lower Lychrel number.
+
+# --instructions--
+
+Write a function that takes a number as a parameter. Return true if the number is a Lynchrel number. Otherwise, return false. Remember that the iteration limit is 500.
+
+# --hints--
+
+`isLychrel` should be a function.
+
+```js
+assert(typeof isLychrel === 'function');
+```
+
+`isLychrel(12)` should return a boolean.
+
+```js
+assert(typeof isLychrel(12) === 'boolean');
+```
+
+`isLychrel(12)` should return `false`.
+
+```js
+assert.equal(isLychrel(12), false);
+```
+
+`isLychrel(55)` should return `false`.
+
+```js
+assert.equal(isLychrel(55), false);
+```
+
+`isLychrel(196)` should return `true`.
+
+```js
+assert.equal(isLychrel(196), true);
+```
+
+`isLychrel(879)` should return `true`.
+
+```js
+assert.equal(isLychrel(879), true);
+```
+
+`isLychrel(44987)` should return `false`.
+
+```js
+assert.equal(isLychrel(44987), false);
+```
+
+`isLychrel(7059)` should return `true`.
+
+```js
+assert.equal(isLychrel(7059), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLychrel(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isLychrel(n) {
+  function reverse(num) {
+    return parseInt(
+      num
+        .toString()
+        .split('')
+        .reverse()
+        .join('')
+    );
+  }
+
+  var i;
+  for (i = 0; i < 500; i++) {
+    n = n + reverse(n);
+    if (n == reverse(n)) break;
+  }
+
+  return i == 500;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lzw-compression.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lzw-compression.md
new file mode 100644
index 0000000000..ccde98aa94
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/lzw-compression.md
@@ -0,0 +1,239 @@
+---
+id: 5ea2815e364d9a2222ea55f8
+title: LZW compression
+challengeType: 5
+forumTopicId: 385288
+dashedName: lzw-compression
+---
+
+# --description--
+
+The Lempel-Ziv-Welch (LZW) algorithm provides loss-less data compression.
+
+You can read a complete description of it in the [Wikipedia article](https://en.wikipedia.org/wiki/Lempel-Ziv-Welch) on the subject.
+
+# --instructions--
+
+Write a function that takes two parameters. The first parameter is a boolean where `true` indicates compress and `false` indicates decompress. The second parameter is either a string or an array to be processed. If it is a string to be compressed, return an array of numbers. If it's an array of numbers to be decompressed, return a string.
+
+# --hints--
+
+`LZW` should be a function.
+
+```js
+assert(typeof LZW === 'function');
+```
+
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return a array.
+
+```js
+assert(Array.isArray(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT')));
+```
+
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return a string.
+
+```js
+assert(
+  typeof LZW(false, [
+    84,
+    79,
+    66,
+    69,
+    79,
+    82,
+    78,
+    79,
+    84,
+    256,
+    258,
+    260,
+    265,
+    259,
+    261,
+    263
+  ]) === 'string'
+);
+```
+
+`LZW(true, "TOBEORNOTTOBEORTOBEORNOT")` should return `[84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263]`.
+
+```js
+assert.deepEqual(LZW(true, 'TOBEORNOTTOBEORTOBEORNOT'), [
+  84,
+  79,
+  66,
+  69,
+  79,
+  82,
+  78,
+  79,
+  84,
+  256,
+  258,
+  260,
+  265,
+  259,
+  261,
+  263
+]);
+```
+
+`LZW(false, [84, 79, 66, 69, 79, 82, 78, 79, 84, 256, 258, 260, 265, 259, 261, 263])` should return `"TOBEORNOTTOBEORTOBEORNOT"`.
+
+```js
+assert.equal(
+  LZW(false, [
+    84,
+    79,
+    66,
+    69,
+    79,
+    82,
+    78,
+    79,
+    84,
+    256,
+    258,
+    260,
+    265,
+    259,
+    261,
+    263
+  ]),
+  'TOBEORNOTTOBEORTOBEORNOT'
+);
+```
+
+`LZW(true, "0123456789")` should return `[48, 49, 50, 51, 52, 53, 54, 55, 56, 57]`.
+
+```js
+assert.deepEqual(LZW(true, '0123456789'), [
+  48,
+  49,
+  50,
+  51,
+  52,
+  53,
+  54,
+  55,
+  56,
+  57
+]);
+```
+
+`LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57])` should return `"0123456789"`.
+
+```js
+assert.equal(
+  LZW(false, [48, 49, 50, 51, 52, 53, 54, 55, 56, 57]),
+  '0123456789'
+);
+```
+
+`LZW(true, "BABAABAAA")` should return `[66, 65, 256, 257, 65, 260]`.
+
+```js
+assert.deepEqual(LZW(true, 'BABAABAAA'), [66, 65, 256, 257, 65, 260]);
+```
+
+`LZW(false, [66, 65, 256, 257, 65, 260])` should return `"BABAABAAA"`.
+
+```js
+assert.equal(LZW(false, [66, 65, 256, 257, 65, 260]), 'BABAABAAA');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function LZW (compressData, input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function LZW (compressData, input) {
+  function compress(uncompressed) {
+    // Build the dictionary.
+    var i,
+      dictionary = {},
+      c,
+      wc,
+      w = "",
+      result = [],
+      dictSize = 256;
+    for (i = 0; i < 256; i += 1) {
+      dictionary[String.fromCharCode(i)] = i;
+    }
+
+    for (i = 0; i < uncompressed.length; i += 1) {
+      c = uncompressed.charAt(i);
+      wc = w + c;
+      //Do not use dictionary[wc] because javascript arrays
+      //will return values for array['pop'], array['push'] etc
+      // if (dictionary[wc]) {
+      if (dictionary.hasOwnProperty(wc)) {
+        w = wc;
+      } else {
+        result.push(dictionary[w]);
+        // Add wc to the dictionary.
+        dictionary[wc] = dictSize++;
+        w = String(c);
+      }
+    }
+
+    // Output the code for w.
+    if (w !== "") {
+      result.push(dictionary[w]);
+    }
+    return result;
+  }
+
+
+  function decompress(compressed) {
+    // Build the dictionary.
+    var i,
+      dictionary = [],
+      w,
+      result,
+      k,
+      entry = "",
+      dictSize = 256;
+    for (i = 0; i < 256; i += 1) {
+      dictionary[i] = String.fromCharCode(i);
+    }
+
+    w = String.fromCharCode(compressed[0]);
+    result = w;
+    for (i = 1; i < compressed.length; i += 1) {
+      k = compressed[i];
+      if (dictionary[k]) {
+        entry = dictionary[k];
+      } else {
+        if (k === dictSize) {
+          entry = w + w.charAt(0);
+        } else {
+          return null;
+        }
+      }
+
+      result += entry;
+
+      // Add w+entry[0] to the dictionary.
+      dictionary[dictSize++] = w + entry.charAt(0);
+
+      w = entry;
+    }
+    return result;
+  }
+
+  if(compressData){
+    return compress(input)
+  }else{
+    return decompress(input)
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/s-expressions.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/s-expressions.md
new file mode 100644
index 0000000000..19304897ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/s-expressions.md
@@ -0,0 +1,96 @@
+---
+id: 59667989bf71cf555dd5d2ff
+title: S-Expressions
+challengeType: 5
+forumTopicId: 302303
+dashedName: s-expressions
+---
+
+# --description--
+
+[S-Expressions](https://en.wikipedia.org/wiki/S-Expression "wp: S-Expression") are one convenient way to parse and store data.
+
+# --instructions--
+
+Write a simple reader/parser for S-Expressions that handles quoted and unquoted strings, integers and floats.
+
+The function should read a single but nested S-Expression from a string and return it as a (nested) array.
+
+Newlines and other whitespace may be ignored unless contained within a quoted string.
+
+"`()`" inside quoted strings are not interpreted, but treated as part of the string.
+
+Handling escaped quotes inside a string is optional; thus "`(foo"bar)`" may be treated as a string "`foo"bar`", or as an error.
+
+For this, the reader need not recognize `\` for escaping, but should, in addition, recognize numbers if the language has appropriate data types.
+
+Note that with the exception of `()"` (`\` if escaping is supported) and whitespace, there are no special characters. Anything else is allowed without quotes.
+
+The reader should be able to read the following input
+
+<pre>((data "quoted data" 123 4.5)
+(data (!@# (4.5) "(more" "data)")))
+</pre>
+
+and turn it into a native data structure. (See the [Pike](https://rosettacode.org/wiki/S-Expressions#Pike "\#Pike"), [Python](https://rosettacode.org/wiki/S-Expressions#Python "\#Python") and [Ruby](https://rosettacode.org/wiki/S-Expressions#Ruby "\#Ruby") implementations for examples of native data structures.)
+
+# --hints--
+
+`parseSexpr` should be a function.
+
+```js
+assert(typeof parseSexpr === 'function');
+```
+
+`parseSexpr('(data1 data2 data3)')` should return `['data1', 'data2', 'data3']`
+
+```js
+assert.deepEqual(parseSexpr(simpleSExpr), simpleSolution);
+```
+
+`parseSexpr('((data "quoted data" 123 4.5) (data (!@# (4.5) "(more" "data)")))')` should return `[['data', '"quoted data"', 123, 4.5], ['data', ['!@#', [4.5], '"(more"', '"data)"']]]`.
+
+```js
+assert.deepEqual(parseSexpr(basicSExpr), basicSolution);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const simpleSExpr = '(data1 data2 data3)';
+const simpleSolution = ['data1', 'data2', 'data3'];
+
+const basicSExpr = '((data "quoted data" 123 4.5) (data (!@# (4.5) "(more" "data)")))';
+const basicSolution = [["data","\"quoted data\"",123,4.5],["data",["!@#",[4.5],"\"(more\"","\"data)\""]]];
+```
+
+## --seed-contents--
+
+```js
+function parseSexpr(str) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function parseSexpr(str) {
+  const t = str.match(/\s*("[^"]*"|\(|\)|"|[^\s()"]+)/g);
+  for (var o, c = 0, i = t.length - 1; i >= 0; i--) {
+    var n,
+      ti = t[i].trim();
+    if (ti == '"') return;
+    else if (ti == '(') t[i] = '[', c += 1;
+    else if (ti == ')') t[i] = ']', c -= 1;
+    else if ((n = +ti) == ti) t[i] = n;
+    else t[i] = `'${ti.replace('\'', '\\\'')}'`;
+    if (i > 0 && ti != ']' && t[i - 1].trim() != '(') t.splice(i, 0, ',');
+    if (!c) if (!o) o = true; else return;
+  }
+  return c ? undefined : eval(t.join(''));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
new file mode 100644
index 0000000000..ec8a0c6e2d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sailors-coconuts-and-a-monkey-problem.md
@@ -0,0 +1,90 @@
+---
+id: 59da22823d04c95919d46269
+title: 'Sailors, coconuts and a monkey problem'
+challengeType: 5
+forumTopicId: 302304
+dashedName: sailors-coconuts-and-a-monkey-problem
+---
+
+# --description--
+
+Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and then hides "his" one of the five equally sized piles of coconuts and pushes the other four piles together to form a single visible pile of coconuts again and goes to bed. To cut a long story short, each of the sailors in turn gets up once during the night and performs the same actions of dividing the coconut pile into five, finding that one coconut is left over and giving that single remainder coconut to the monkey. In the morning (after the surreptitious and separate action of each of the five sailors during the night), the remaining coconuts are divided into five equal piles for each of the sailors, whereupon it is found that the pile of coconuts divides equally amongst the sailors with no remainder. (Nothing for the monkey in the morning.)
+
+# --instructions--
+
+Create a function that returns the minimum possible size of the initial pile of coconuts collected during the day for `N` sailors. **Note:** Of course the tale is told in a world where the collection of any amount of coconuts in a day and multiple divisions of the pile, etc. can occur in time fitting the story line, so as not to affect the mathematics. **C.f:**
+
+<ul>
+  <li><a href="https://www.youtube.com/watch?v=U9qU20VmvaU" target="_blank"> Monkeys and Coconuts - Numberphile</a> (Video) Analytical solution.</li>
+  <li><a href="https://oeis.org/A002021" target="_blank">A002021 Pile of coconuts problem</a> The On-Line Encyclopedia of Integer Sequences. (Although some of its references may use the alternate form of the tale).</li>
+</ul>
+
+# --hints--
+
+`splitCoconuts` should be a function.
+
+```js
+assert(typeof splitCoconuts === 'function');
+```
+
+`splitCoconuts(5)` should return 3121.
+
+```js
+assert(splitCoconuts(5) === 3121);
+```
+
+`splitCoconuts(6)` should return 233275.
+
+```js
+assert(splitCoconuts(6) === 233275);
+```
+
+`splitCoconuts(7)` should return 823537.
+
+```js
+assert(splitCoconuts(7) === 823537);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function splitCoconuts(intSailors) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function splitCoconuts(intSailors) {
+  let intNuts = intSailors;
+  let result = splitCoconutsHelper(intNuts, intSailors);
+  while (!result) {
+    intNuts += 1;
+    result = splitCoconutsHelper(intNuts, intSailors);
+  }
+
+  return intNuts;
+}
+
+function splitCoconutsHelper(intNuts, intSailors, intDepth) {
+  const nDepth = intDepth !== undefined ? intDepth : intSailors;
+  const portion = Math.floor(intNuts / intSailors);
+  const remain = intNuts % intSailors;
+
+  if (portion <= 0 || remain !== (nDepth ? 1 : 0)) {
+    return null;
+  }
+
+  if (nDepth) {
+    return splitCoconutsHelper(
+      intNuts - portion - remain, intSailors, nDepth - 1
+    );
+  }
+
+  return intNuts;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
new file mode 100644
index 0000000000..f4fa1a4452
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/search-a-list-of-records.md
@@ -0,0 +1,103 @@
+---
+id: 5eb3e497b8d6d7f63c5517ea
+title: Search a list of records
+challengeType: 5
+forumTopicId: 385315
+dashedName: search-a-list-of-records
+---
+
+# --description--
+
+A record consists of attributes that describe an entity. Each attribute has a name and a value. For example, a person can have an attribute `age` with a value of 25. An important operation on a list of records is to find a record with a particular attribute value.
+
+# --instructions--
+
+Write a function that takes a string as a parameter. The function should return the index of the item in `list` for which the value of the `name` attribute matches the given string.
+
+# --hints--
+
+`searchCity` should be a function.
+
+```js
+assert(typeof searchCity === 'function');
+```
+
+`searchCity("Dar Es Salaam")` should return a number.
+
+```js
+assert(typeof searchCity('Dar Es Salaam') === 'number');
+```
+
+`searchCity("Dar Es Salaam")` should return `6`.
+
+```js
+assert.equal(searchCity('Dar Es Salaam'), 6);
+```
+
+`searchCity("Casablanca")` should return `9`.
+
+```js
+assert.equal(searchCity('Casablanca'), 9);
+```
+
+`searchCity("Cairo")` should return `1`.
+
+```js
+assert.equal(searchCity('Cairo'), 1);
+```
+
+`searchCity("Mogadishu")` should return `4`.
+
+```js
+assert.equal(searchCity('Mogadishu'), 4);
+```
+
+`searchCity("Lagos")` should return `0`.
+
+```js
+assert.equal(searchCity('Lagos'), 0);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function searchCity(name) {
+
+}
+
+const list = [
+  { name: 'Lagos', population: 21.0 },
+  { name: 'Cairo', population: 15.2 },
+  { name: 'Kinshasa-Brazzaville', population: 11.3 },
+  { name: 'Greater Johannesburg', population: 7.55 },
+  { name: 'Mogadishu', population: 5.85 },
+  { name: 'Khartoum-Omdurman', population: 4.98 },
+  { name: 'Dar Es Salaam', population: 4.7 },
+  { name: 'Alexandria', population: 4.58 },
+  { name: 'Abidjan', population: 4.4 },
+  { name: 'Casablanca', population: 3.98 }
+];
+```
+
+# --solutions--
+
+```js
+function searchCity(name) {
+  return list.findIndex(item => item.name === name);
+}
+
+const list = [
+  { name: 'Lagos', population: 21.0 },
+  { name: 'Cairo', population: 15.2 },
+  { name: 'Kinshasa-Brazzaville', population: 11.3 },
+  { name: 'Greater Johannesburg', population: 7.55 },
+  { name: 'Mogadishu', population: 5.85 },
+  { name: 'Khartoum-Omdurman', population: 4.98 },
+  { name: 'Dar Es Salaam', population: 4.7 },
+  { name: 'Alexandria', population: 4.58 },
+  { name: 'Abidjan', population: 4.4 },
+  { name: 'Casablanca', population: 3.98 }
+];
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sedols.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sedols.md
new file mode 100644
index 0000000000..9d5ce33e9d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sedols.md
@@ -0,0 +1,96 @@
+---
+id: 59d9c6bc214c613ba73ff012
+title: SEDOLs
+challengeType: 5
+forumTopicId: 302305
+dashedName: sedols
+---
+
+# --description--
+
+For each number list of 6-digit [SEDOL](https://en.wikipedia.org/wiki/SEDOL "wp: SEDOL")s, calculate and append the checksum digit. That is, given the input string on the left, your function should return the corresponding string on the right:
+
+<pre>
+710889 => 7108899
+B0YBKJ => B0YBKJ7
+406566 => 4065663
+B0YBLH => B0YBLH2
+228276 => 2282765
+B0YBKL => B0YBKL9
+557910 => 5579107
+B0YBKR => B0YBKR5
+585284 => 5852842
+B0YBKT => B0YBKT7
+B00030 => B000300
+</pre>
+
+Check that each input is correctly formed, especially with respect to valid characters allowed in a SEDOL string. Your function should return `null` on an invalid input.
+
+# --hints--
+
+`sedol` should be a function.
+
+```js
+assert(typeof sedol === 'function');
+```
+
+`sedol('a')` should return null.
+
+```js
+assert(sedol('a') === null);
+```
+
+`sedol('710889')` should return '7108899'.
+
+```js
+assert(sedol('710889') === '7108899');
+```
+
+`sedol('BOATER')` should return null.
+
+```js
+assert(sedol('BOATER') === null);
+```
+
+`sedol('228276')` should return '2282765'.
+
+```js
+assert(sedol('228276') === '2282765');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sedol(input) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function sedol(input) {
+  const checkDigit = sedolCheckDigit(input);
+  if (checkDigit !== null) {
+    return input + checkDigit;
+  }
+  return null;
+}
+
+const weight = [1, 3, 1, 7, 3, 9, 1];
+function sedolCheckDigit(char6) {
+  if (char6.search(/^[0-9BCDFGHJKLMNPQRSTVWXYZ]{6}$/) === -1) {
+    return null;
+  }
+
+  let sum = 0;
+  for (let i = 0; i < char6.length; i++) {
+    sum += weight[i] * parseInt(char6.charAt(i), 36);
+  }
+  const check = (10 - (sum % 10)) % 10;
+  return check.toString();
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
new file mode 100644
index 0000000000..5ff2f5c992
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-describing-numbers.md
@@ -0,0 +1,100 @@
+---
+id: 5eaf48389ee512d4d103684b
+title: Self Describing Numbers
+challengeType: 5
+forumTopicId: 385289
+dashedName: self-describing-numbers
+---
+
+# --description--
+
+There are several so-called "self describing" or ["self-descriptive"](https://en.wikipedia.org/wiki/Self-descriptive_number) integers.
+
+An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number.
+
+For example, **2020** is a four-digit self describing number:
+
+<ul>
+    <li> position 0 has value 2 and there are two 0s in the number; </li>
+    <li> position 1 has value 0 and there are no 1s in the number; </li>
+    <li> position 2 has value 2 and there are two 2s; </li>
+    <li> position 3 has value 0 and there are zero 3s; </li>
+</ul>
+
+Self-describing numbers &lt; 100,000,000 are: 1210, 2020, 21200, 3211000, 42101000.
+
+# --instructions--
+
+Write a function that takes a positive integer as a parameter. If it is self-describing return true. Otherwise, return false.
+
+# --hints--
+
+`isSelfDescribing` should be a function.
+
+```js
+assert(typeof isSelfDescribing == 'function');
+```
+
+`isSelfDescribing()` should return a boolean.
+
+```js
+assert(typeof isSelfDescribing(2020) == 'boolean');
+```
+
+`isSelfDescribing(2020)` should return `true`.
+
+```js
+assert.equal(isSelfDescribing(2020), true);
+```
+
+`isSelfDescribing(3021)` should return `false`.
+
+```js
+assert.equal(isSelfDescribing(3021), false);
+```
+
+`isSelfDescribing(3211000)` should return `true`.
+
+```js
+assert.equal(isSelfDescribing(3211000), true);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSelfDescribing(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isSelfDescribing(n) {
+    let digits = String(n).split("");
+    digits = digits.map(function(e) {return parseInt(e)});
+    let count = digits.map((x) => {return 0})
+    digits.forEach((d) =>{
+        if (d >= count.length) {
+            return false
+        }
+        count[d] += 1;
+    });
+
+     if (digits === count) {
+        return true;
+    }
+    if (digits.length != count.length) {
+        return false;
+    }
+    
+    for (let i=0; i< digits.length; i++){
+      if (digits[i] !== count[i]) {
+        return false;
+      }
+    }
+    return true;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
new file mode 100644
index 0000000000..0cc45a42ff
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/self-referential-sequence.md
@@ -0,0 +1,202 @@
+---
+id: 5eb3e4a21f462f409d656c73
+title: Self-referential sequence
+challengeType: 5
+forumTopicId: 385317
+dashedName: self-referential-sequence
+---
+
+# --description--
+
+There are several ways to generate a self-referential sequence. One very common one (the [Look-and-say sequence](<https://rosettacode.org/wiki/Look-and-say sequence>)) is to start with a positive integer, then generate the next term by concatenating enumerated groups of adjacent alike digits:
+
+<pre>0, 10, 1110, 3110, 132110, 1113122110, 311311222110 ...</pre>
+
+The terms generated grow in length geometrically and never converge.
+
+Another way to generate a self-referential sequence is to summarize the previous term.
+
+Count how many of each alike digit there is, then concatenate the sum and digit for each of the sorted enumerated digits. Note that the first five terms are the same as for the previous sequence.
+
+<pre>0, 10, 1110, 3110, 132110, 13123110, 23124110 ...</pre>
+
+Sort the digits largest to smallest. Do not include counts of digits that do not appear in the previous term.
+
+Depending on the seed value, series generated this way always either converge to a stable value or to a short cyclical pattern. (For our purposes, converge means that an element matches a previously seen element.) The sequence shown, with a seed value of 0, converges to a stable value of 1433223110 after 11 iterations. The seed value that converges most quickly is 22. It goes stable after the first element. (The next element is 22, which has been seen before.)
+
+# --instructions--
+
+Write a function that takes the seed value as parameter, generates a self referential sequence until it converges, and returns it as an array.
+
+# --hints--
+
+`selfReferential` should be a function.
+
+```js
+assert(typeof selfReferential === 'function');
+```
+
+`selfReferential(40)` should return a array.
+
+```js
+assert(Array.isArray(selfReferential(40)));
+```
+
+`selfReferential(40)` should return `["40", "1410", "142110", "14123110", "1413124110", "2413125110", "151413224110", "152413225110", "251413324110", "152423224110", "152413423110"]`.
+
+```js
+assert.deepEqual(selfReferential(40), [
+  '40',
+  '1410',
+  '142110',
+  '14123110',
+  '1413124110',
+  '2413125110',
+  '151413224110',
+  '152413225110',
+  '251413324110',
+  '152423224110',
+  '152413423110'
+]);
+```
+
+`selfReferential(132110)` should return `["132110", "13123110", "23124110", "1413223110", "1423224110", "2413323110", "1433223110"]`.
+
+```js
+assert.deepEqual(selfReferential(132110), [
+  '132110',
+  '13123110',
+  '23124110',
+  '1413223110',
+  '1423224110',
+  '2413323110',
+  '1433223110'
+]);
+```
+
+`selfReferential(132211)` should return `["132211", "132231", "232221", "134211", "14131231", "14231241", "24132231", "14233221"]`.
+
+```js
+assert.deepEqual(selfReferential(132211), [
+  '132211',
+  '132231',
+  '232221',
+  '134211',
+  '14131231',
+  '14231241',
+  '24132231',
+  '14233221'
+]);
+```
+
+`selfReferential(1413223110)` should return `["1413223110", "1423224110", "2413323110", "1433223110"]`.
+
+```js
+assert.deepEqual(selfReferential(1413223110), [
+  '1413223110',
+  '1423224110',
+  '2413323110',
+  '1433223110'
+]);
+```
+
+`selfReferential(251413126110)` should return `["251413126110", "16151413225110", "16251413226110", "26151413325110", "16251423225110", "16251413424110", "16153413225110"]`.
+
+```js
+assert.deepEqual(selfReferential(251413126110), [
+  '251413126110',
+  '16151413225110',
+  '16251413226110',
+  '26151413325110',
+  '16251423225110',
+  '16251413424110',
+  '16153413225110'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function selfReferential(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function selfReferential(n) {
+  var descending,
+    i,
+    incr,
+    j,
+    max_i,
+    max_len,
+    max_seq,
+    seq,
+    sequence,
+    indexOf =
+      [].indexOf ||
+      function(item) {
+        for (var i = 0, l = this.length; i < l; i++) {
+          if (i in this && this[i] === item) return i;
+        }
+        return -1;
+      };
+
+  sequence = function(n) {
+    var c, cnt, cnts, d, digit, i, j, l, len, new_cnts, ref, s, seq;
+    cnts = {};
+    ref = n.toString();
+    for (j = 0, len = ref.length; j < len; j++) {
+      c = ref[j];
+      d = parseInt(c);
+      incr(cnts, d);
+    }
+    seq = [ref];
+    while (true) {
+      s = '';
+      for (i = l = 9; l >= 0; i = --l) {
+        if (cnts[i]) {
+          s += '' + cnts[i] + i;
+        }
+      }
+      if (indexOf.call(seq, s) >= 0) {
+        break;
+      }
+      seq.push(s);
+      new_cnts = {};
+      for (digit in cnts) {
+        cnt = cnts[digit];
+        incr(new_cnts, cnt);
+        incr(new_cnts, digit);
+      }
+      cnts = new_cnts;
+    }
+    return seq;
+  };
+
+  incr = function(h, k) {
+    if (h[k] == null) {
+      h[k] = 0;
+    }
+    return (h[k] += 1);
+  };
+
+  descending = function(n) {
+    var tens;
+    if (n < 10) {
+      return true;
+    }
+    tens = n / 10;
+    if (n % 10 > tens % 10) {
+      return false;
+    }
+    return descending(tens);
+  };
+
+  return sequence(n);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/semiprime.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/semiprime.md
new file mode 100644
index 0000000000..961f13632f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/semiprime.md
@@ -0,0 +1,146 @@
+---
+id: 5eb3e4aa847216613aa81983
+title: Semiprime
+challengeType: 5
+forumTopicId: 385318
+dashedName: semiprime
+---
+
+# --description--
+
+Semiprime numbers are natural numbers that are products of exactly two (possibly equal) [prime numbers](https://rosettacode.org/wiki/prime_number).
+
+<pre>1679  =  23 x 73</pre>
+
+# --instructions--
+
+Write a function that returns true if a number is semiprime, or false if it is not.
+
+# --hints--
+
+`isSemiPrime` should be a function.
+
+```js
+assert(typeof isSemiPrime === 'function');
+```
+
+`isSemiPrime(100)` should return a boolean.
+
+```js
+assert(typeof isSemiPrime(100) === 'boolean');
+```
+
+`isSemiPrime(100)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(100), false);
+```
+
+`isSemiPrime(504)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(504), false);
+```
+
+`isSemiPrime(4)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(4), true);
+```
+
+`isSemiPrime(46)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(46), true);
+```
+
+`isSemiPrime(13)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(13), false);
+```
+
+`isSemiPrime(74)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(74), true);
+```
+
+`isSemiPrime(1679)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(1679), true);
+```
+
+`isSemiPrime(2)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(2), false);
+```
+
+`isSemiPrime(95)` should return `true`.
+
+```js
+assert.equal(isSemiPrime(95), true);
+```
+
+`isSemiPrime(124)` should return `false`.
+
+```js
+assert.equal(isSemiPrime(124), false);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isSemiPrime(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function isSemiPrime(n) {
+  if (n <= 3) return false;
+
+  var ans = [];
+  var done = false;
+  while (!done) {
+    if (n % 2 === 0) {
+      ans.push(2);
+      n /= 2;
+      continue;
+    }
+    if (n % 3 === 0) {
+      ans.push(3);
+      n /= 3;
+      continue;
+    }
+    if (n === 1) return ans.length == 2;
+    var sr = Math.sqrt(n);
+    done = true;
+    // try to divide the checked number by all numbers till its square root.
+    for (var i = 6; i <= sr; i += 6) {
+      if (n % (i - 1) === 0) {
+        // is n divisible by i-1?
+        ans.push(i - 1);
+        n /= i - 1;
+        done = false;
+        break;
+      }
+      if (n % (i + 1) === 0) {
+        // is n divisible by i+1?
+        ans.push(i + 1);
+        n /= i + 1;
+        done = false;
+        break;
+      }
+    }
+  }
+  ans.push(n);
+  return ans.length == 2;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-consolidation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-consolidation.md
new file mode 100644
index 0000000000..3a97b090b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-consolidation.md
@@ -0,0 +1,196 @@
+---
+id: 5eb3e4af7d0e7b760b46cedc
+title: Set consolidation
+challengeType: 5
+forumTopicId: 385319
+dashedName: set-consolidation
+---
+
+# --description--
+
+Given two sets of items then if any item is common to any set then the result of applying *consolidation* to those sets is a set of sets whose contents is:
+
+<ul>
+  <li>The two input sets if no common item exists between the two input sets of items.</li>
+  <li>The single set that is the union of the two input sets if they share a common item.</li>
+</ul>
+
+Given N sets of items where N > 2 then the result is the same as repeatedly replacing all combinations of two sets by their consolidation until no further consolidation between set pairs is possible. If N &lt; 2 then consolidation has no strict meaning and the input can be returned.
+
+Here are some examples:
+
+**Example 1:**
+
+Given the two sets `{A,B}` and `{C,D}` then there is no common element between the sets and the result is the same as the input.
+
+**Example 2:**
+
+Given the two sets `{A,B}` and `{B,D}` then there is a common element `B` between the sets and the result is the single set `{B,D,A}`. (Note that order of items in a set is immaterial: `{A,B,D}` is the same as `{B,D,A}` and `{D,A,B}`, etc).
+
+**Example 3:**
+
+Given the three sets `{A,B}` and `{C,D}` and `{D,B}` then there is no common element between the sets `{A,B}` and `{C,D}` but the sets `{A,B}` and `{D,B}` do share a common element that consolidates to produce the result `{B,D,A}`. On examining this result with the remaining set, `{C,D}`, they share a common element and so consolidate to the final output of the single set `{A,B,C,D}`
+
+**Example 4:**
+
+The consolidation of the five sets:
+
+`{H,I,K}`, `{A,B}`, `{C,D}`, `{D,B}`, and `{F,G,H}`
+
+Is the two sets:
+
+`{A, C, B, D}`, and `{G, F, I, H, K}`
+
+# --instructions--
+
+Write a function that takes an array of strings as a parameter. Each string is represents a set with the characters representing the set elements. The function should return a 2D array containing the consolidated sets. Note: Each set should be sorted.
+
+# --hints--
+
+`setConsolidation` should be a function.
+
+```js
+assert(typeof setConsolidation === 'function');
+```
+
+`setConsolidation(["AB", "CD"])` should return a array.
+
+```js
+assert(Array.isArray(setConsolidation(['AB', 'CD'])));
+```
+
+`setConsolidation(["AB", "CD"])` should return `[["C", "D"], ["A", "B"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'CD']), [
+  ['C', 'D'],
+  ['A', 'B']
+]);
+```
+
+`setConsolidation(["AB", "BD"])` should return `[["A", "B", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'BD']), [['A', 'B', 'D']]);
+```
+
+`setConsolidation(["AB", "CD", "DB"])` should return `[["A", "B", "C", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['AB', 'CD', 'DB']), [['A', 'B', 'C', 'D']]);
+```
+
+`setConsolidation(["HIK", "AB", "CD", "DB", "FGH"])` should return `[["F", "G", "H", "I", "K"], ["A", "B", "C", "D"]]`.
+
+```js
+assert.deepEqual(setConsolidation(['HIK', 'AB', 'CD', 'DB', 'FGH']), [
+  ['F', 'G', 'H', 'I', 'K'],
+  ['A', 'B', 'C', 'D']
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function setConsolidation(sets) {
+
+}
+```
+
+# --solutions--
+
+```js
+function setConsolidation(sets) {
+  function addAll(l1, l2) {
+    l2.forEach(function(e) {
+      if (l1.indexOf(e) == -1) l1.push(e);
+    });
+  }
+
+  function consolidate(sets) {
+    var r = [];
+    for (var i = 0; i < sets.length; i++) {
+      var s = sets[i];
+      {
+        var new_r = [];
+        new_r.push(s);
+        for (var j = 0; j < r.length; j++) {
+          var x = r[j];
+          {
+            if (
+              !(function(c1, c2) {
+                for (var i = 0; i < c1.length; i++) {
+                  if (c2.indexOf(c1[i]) >= 0) return false;
+                }
+                return true;
+              })(s, x)
+            ) {
+              (function(l1, l2) {
+                addAll(l1, l2);
+              })(s, x);
+            } else {
+              new_r.push(x);
+            }
+          }
+        }
+        r = new_r;
+      }
+    }
+    return r;
+  }
+
+  function consolidateR(sets) {
+    if (sets.length < 2) return sets;
+    var r = [];
+    r.push(sets[0]);
+    {
+      var arr1 = consolidateR(sets.slice(1, sets.length));
+      for (var i = 0; i < arr1.length; i++) {
+        var x = arr1[i];
+        {
+          if (
+            !(function(c1, c2) {
+              for (var i = 0; i < c1.length; i++) {
+                if (c2.indexOf(c1[i]) >= 0) return false;
+              }
+              return true;
+            })(r[0], x)
+          ) {
+            (function(l1, l2) {
+              return l1.push.apply(l1, l2);
+            })(r[0], x);
+          } else {
+            r.push(x);
+          }
+        }
+      }
+    }
+    return r;
+  }
+
+  function hashSetList(set) {
+    var r = [];
+    for (var i = 0; i < set.length; i++) {
+      r.push([]);
+      for (var j = 0; j < set[i].length; j++)
+        (function(s, e) {
+          if (s.indexOf(e) == -1) {
+            s.push(e);
+            return true;
+          } else {
+            return false;
+          }
+        })(r[i], set[i].charAt(j));
+    }
+    return r;
+  }
+
+  var h1 = consolidate(hashSetList(sets)).map(function(e) {
+    e.sort();
+    return e;
+  });
+  return h1;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
new file mode 100644
index 0000000000..7633b59b8a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/set-of-real-numbers.md
@@ -0,0 +1,239 @@
+---
+id: 5eb3e4b20aa93c437f9e9717
+title: Set of real numbers
+challengeType: 5
+forumTopicId: 385322
+dashedName: set-of-real-numbers
+---
+
+# --description--
+
+All real numbers form the uncountable set ℝ. Among its subsets, relatively simple are the convex sets, each expressed as a range between two real numbers *a* and *b* where *a* ≤ *b*. There are actually four cases for the meaning of "between", depending on open or closed boundary:
+
+<ul>
+  <li>[<i>a</i>, <i>b</i>]: {<i>x</i> | <i>a</i> ≤ <i>x</i> and <i>x</i> ≤ <i>b</i> }</li>
+  <li>(<i>a</i>, <i>b</i>): {<i>x</i> | <i>a</i> < <i>x</i> and <i>x</i> < <i>b</i> }</li>
+  <li>[<i>a</i>, <i>b</i>): {<i>x</i> | <i>a</i> ≤ <i>x</i> and <i>x</i> < <i>b</i> }</li>
+  <li>(<i>a</i>, <i>b</i>]: {<i>x</i> | <i>a</i> < <i>x</i> and <i>x</i> ≤ <i>b</i> }</li>
+</ul>
+
+Note that if *a* = *b*, of the four only \[*a*, *a*] would be non-empty.
+
+**Task**
+
+<ul>
+  <li>Devise a way to represent any set of real numbers, for the definition of "any" in the implementation notes below.</li>
+  <li>Provide methods for these common set operations (<i>x</i> is a real number; <i>A</i> and <i>B</i> are sets):</li>
+  <ul>
+    <li>
+      <i>x</i> ∈ <i>A</i>: determine if <i>x</i> is an element of <i>A</i><br>
+      example: 1 is in [1, 2), while 2, 3, ... are not.
+    </li>
+    <li>
+      <i>A</i> ∪ <i>B</i>: union of <i>A</i> and <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> or <i>x</i> ∈ <i>B</i>}<br>
+      example: [0, 2) ∪ (1, 3) = [0, 3); [0, 1) ∪ (2, 3] = well, [0, 1) ∪ (2, 3]
+    </li>
+    <li>
+      <i>A</i> ∩ <i>B</i>: intersection of <i>A</i> and <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> and <i>x</i> ∈ <i>B</i>}<br>
+      example: [0, 2) ∩ (1, 3) = (1, 2); [0, 1) ∩ (2, 3] = empty set
+    </li>
+    <li>
+      <i>A</i> - <i>B</i>: difference between <i>A</i> and <i>B</i>, also written as <i>A</i> \ <i>B</i>, i.e. {<i>x</i> | <i>x</i> ∈ <i>A</i> and <i>x</i> ∉ <i>B</i>}<br>
+      example: [0, 2) − (1, 3) = [0, 1]
+    </li>
+  </ul>
+</ul>
+
+# --instructions--
+
+Write a function that takes 2 objects, a string and an array as parameters. The objects represents the set and have attributes: `low`, `high` and `rangeType`.
+
+The `rangeType` can have values 0, 1, 2 and 3 for `CLOSED`, `BOTH_OPEN`, `LEFT_OPEN` and `RIGHT_OPEN`, respectively. The function should implement a set using this information.
+
+The string represents the operation to be performed on the sets. It can be: `"union"`, `"intersect"` and `"subtract"` (difference).
+
+After performing the operation, the function should check if the values in the array are present in the resultant set and store a corresponding boolean value to an array. The function should return this array.
+
+# --hints--
+
+`realSet` should be a function.
+
+```js
+assert(typeof realSet == 'function');
+```
+
+`realSet({"low":0, "high":1, "rangeType":2}, {"low":0, "high":2, "rangeType":3}, "union", [1, 2, 3])` should return a array.
+
+```js
+assert(
+  Array.isArray(
+    realSet(
+      { low: 0, high: 1, rangeType: 2 },
+      { low: 0, high: 2, rangeType: 3 },
+      'union',
+      [1, 2, 3]
+    )
+  )
+);
+```
+
+`realSet({"low":0, "high":1, "rangeType":2}, {"low":0, "high":2, "rangeType":3}, "union", [1, 2, 3])` should return `[true, false, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 1, rangeType: 2 },
+    { low: 0, high: 2, rangeType: 3 },
+    'union',
+    [1, 2, 3]
+  ),
+  [true, false, false]
+);
+```
+
+`realSet({"low":0, "high":2, "rangeType":3}, {"low":1, "high":2, "rangeType":2}, "intersect", [0, 1, 2])` should return `[false, false, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 2, rangeType: 3 },
+    { low: 1, high: 2, rangeType: 2 },
+    'intersect',
+    [0, 1, 2]
+  ),
+  [false, false, false]
+);
+```
+
+`realSet({"low":0, "high":3, "rangeType":3}, {"low":0, "high":1, "rangeType":1}, "subtract", [0, 1, 2])` should return `[true, true, true]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 3, rangeType: 3 },
+    { low: 0, high: 1, rangeType: 1 },
+    'subtract',
+    [0, 1, 2]
+  ),
+  [true, true, true]
+);
+```
+
+`realSet({"low":0, "high":3, "rangeType":3}, {"low":0, "high":1, "rangeType":0}, "subtract", [0, 1, 2])` should return `[false, false, true]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 3, rangeType: 3 },
+    { low: 0, high: 1, rangeType: 0 },
+    'subtract',
+    [0, 1, 2]
+  ),
+  [false, false, true]
+);
+```
+
+`realSet({"low":0, "high":33, "rangeType":1}, {"low":30, "high":31, "rangeType":0}, "intersect", [30, 31, 32])` should return `[true, true, false]`.
+
+```js
+assert.deepEqual(
+  realSet(
+    { low: 0, high: 33, rangeType: 1 },
+    { low: 30, high: 31, rangeType: 0 },
+    'intersect',
+    [30, 31, 32]
+  ),
+  [true, true, false]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function realSet(set1, set2, operation, values) {
+
+}
+```
+
+# --solutions--
+
+```js
+function realSet(set1, set2, operation, values) {
+  const RangeType = {
+    CLOSED: 0,
+    BOTH_OPEN: 1,
+    LEFT_OPEN: 2,
+    RIGHT_OPEN: 3
+  };
+
+  function Predicate(test) {
+    this.test = test;
+    this.or = function(other) {
+      return new Predicate(t => this.test(t) || other.test(t));
+    };
+    this.and = function(other) {
+      return new Predicate(t => this.test(t) && other.test(t));
+    };
+    this.negate = function() {
+      return new Predicate(t => !this.test(t));
+    };
+  }
+
+  function RealSet(start, end, rangeType, predF) {
+    this.low = start;
+    this.high = end;
+
+    if (predF) {
+      this.predicate = new Predicate(predF);
+    } else {
+      this.predicate = new Predicate(d => {
+        switch (rangeType) {
+          case RangeType.CLOSED:
+            return start <= d && d <= end;
+          case RangeType.BOTH_OPEN:
+            return start < d && d < end;
+          case RangeType.LEFT_OPEN:
+            return start < d && d <= end;
+          case RangeType.RIGHT_OPEN:
+            return start <= d && d < end;
+        }
+      });
+    }
+
+    this.contains = function(d) {
+      return this.predicate.test(d);
+    };
+
+    this.union = function(other) {
+      var low2 = Math.min(this.low, other.low);
+      var high2 = Math.max(this.high, other.high);
+      return new RealSet(low2, high2, null, d =>
+        this.predicate.or(other.predicate).test(d)
+      );
+    };
+
+    this.intersect = function(other) {
+      var low2 = Math.min(this.low, other.low);
+      var high2 = Math.max(this.high, other.high);
+      return new RealSet(low2, high2, null, d =>
+        this.predicate.and(other.predicate).test(d)
+      );
+    };
+
+    this.subtract = function(other) {
+      return new RealSet(this.low, this.high, null, d =>
+        this.predicate.and(other.predicate.negate()).test(d)
+      );
+    };
+  }
+  set1 = new RealSet(set1.low, set1.high, set1.rangeType);
+  set2 = new RealSet(set2.low, set2.high, set2.rangeType);
+  var result = [];
+  values.forEach(function(value) {
+    result.push(set1[operation](set2).contains(value));
+  });
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-1.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-1.md
new file mode 100644
index 0000000000..dfdbce67dc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-1.md
@@ -0,0 +1,180 @@
+---
+id: 5eb3e4b5f629b9a07429a5d2
+title: SHA-1
+challengeType: 5
+forumTopicId: 385326
+dashedName: sha-1
+---
+
+# --description--
+
+**SHA-1** or **SHA1** is a one-way hash function; it computes a 160-bit message digest.
+
+SHA-1 often appears in security protocols; for example, many HTTPS websites use RSA with SHA-1 to secure their connections.
+
+BitTorrent uses SHA-1 to verify downloads.
+
+Git and Mercurial use SHA-1 digests to identify commits.
+
+A US government standard, [FIPS 180-1](https://rosettacode.org/wiki/SHA-1/FIPS-180-1), defines SHA-1.
+
+# --instructions--
+
+Write a function that returns the SHA-1 message digest for a given string.
+
+# --hints--
+
+`SHA1` should be a function.
+
+```js
+assert(typeof SHA1 === 'function');
+```
+
+`SHA1("abc")` should return a string.
+
+```js
+assert(typeof SHA1('abc') === 'string');
+```
+
+`SHA1("abc")` should return `"a9993e364706816aba3e25717850c26c9cd0d89d"`.
+
+```js
+assert.equal(SHA1('abc'), 'a9993e364706816aba3e25717850c26c9cd0d89d');
+```
+
+`SHA1("Rosetta Code")` should return `"48c98f7e5a6e736d790ab740dfc3f51a61abe2b5"`.
+
+```js
+assert.equal(SHA1('Rosetta Code'), '48c98f7e5a6e736d790ab740dfc3f51a61abe2b5');
+```
+
+`SHA1("Hello world")` should return `"7b502c3a1f48c8609ae212cdfb639dee39673f5e"`.
+
+```js
+assert.equal(SHA1('Hello world'), '7b502c3a1f48c8609ae212cdfb639dee39673f5e');
+```
+
+`SHA1("Programming")` should return `"d1a946bf8b2f2a7292c250063ee28989d742cd4b"`.
+
+```js
+assert.equal(SHA1('Programming'), 'd1a946bf8b2f2a7292c250063ee28989d742cd4b');
+```
+
+`SHA1("is Awesome")` should return `"6537205da59c72b57ed3881843c2d24103d683a3"`.
+
+```js
+assert.equal(SHA1('is Awesome'), '6537205da59c72b57ed3881843c2d24103d683a3');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function SHA1(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function SHA1(input) {
+  var hexcase = 0;
+  var b64pad = '';
+  var chrsz = 8;
+
+  function hex_sha1(s) {
+    return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
+  }
+
+  function core_sha1(x, len) {
+    x[len >> 5] |= 0x80 << (24 - (len % 32));
+    x[(((len + 64) >> 9) << 4) + 15] = len;
+
+    var w = Array(80);
+    var a = 1732584193;
+    var b = -271733879;
+    var c = -1732584194;
+    var d = 271733878;
+    var e = -1009589776;
+
+    for (var i = 0; i < x.length; i += 16) {
+      var olda = a;
+      var oldb = b;
+      var oldc = c;
+      var oldd = d;
+      var olde = e;
+
+      for (var j = 0; j < 80; j++) {
+        if (j < 16) w[j] = x[i + j];
+        else w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
+        var t = safe_add(
+          safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
+          safe_add(safe_add(e, w[j]), sha1_kt(j))
+        );
+        e = d;
+        d = c;
+        c = rol(b, 30);
+        b = a;
+        a = t;
+      }
+
+      a = safe_add(a, olda);
+      b = safe_add(b, oldb);
+      c = safe_add(c, oldc);
+      d = safe_add(d, oldd);
+      e = safe_add(e, olde);
+    }
+    return Array(a, b, c, d, e);
+  }
+
+  function sha1_ft(t, b, c, d) {
+    if (t < 20) return (b & c) | (~b & d);
+    if (t < 40) return b ^ c ^ d;
+    if (t < 60) return (b & c) | (b & d) | (c & d);
+    return b ^ c ^ d;
+  }
+
+  function sha1_kt(t) {
+    return t < 20
+      ? 1518500249
+      : t < 40
+      ? 1859775393
+      : t < 60
+      ? -1894007588
+      : -899497514;
+  }
+
+  function safe_add(x, y) {
+    var lsw = (x & 0xffff) + (y & 0xffff);
+    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+    return (msw << 16) | (lsw & 0xffff);
+  }
+
+  function rol(num, cnt) {
+    return (num << cnt) | (num >>> (32 - cnt));
+  }
+
+  function str2binb(str) {
+    var bin = Array();
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < str.length * chrsz; i += chrsz)
+      bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - (i % 32));
+    return bin;
+  }
+
+  function binb2hex(binarray) {
+    var hex_tab = hexcase ? '0123456789ABCDEF' : '0123456789abcdef';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i++) {
+      str +=
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8 + 4)) & 0xf) +
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8)) & 0xf);
+    }
+    return str;
+  }
+
+  return hex_sha1(input);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-256.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-256.md
new file mode 100644
index 0000000000..ba3af1f527
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sha-256.md
@@ -0,0 +1,436 @@
+---
+id: 5eb3e4c3a894c333d2811a3f
+title: SHA-256
+challengeType: 5
+forumTopicId: 385328
+dashedName: sha-256
+---
+
+# --description--
+
+The `SHA-2` family is a stronger alternative to `SHA-1`. The main difference between them is the length of the hash.
+Meaning `SHA-1` provides a shorter code with fewer possibilities for unique combinations. `SHA-2` or `SHA-256` creates a longer and thus more complex hash with more possibilities.
+
+# --instructions--
+
+Research implemenation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
+
+# --hints--
+
+`SHA256` should be a function.
+
+```js
+assert(typeof SHA256 === 'function');
+```
+
+`SHA256("Rosetta code")` should return a string.
+
+```js
+assert(typeof SHA256('Rosetta code') === 'string');
+```
+
+`SHA256("Rosetta code")` should return `"764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf"`.
+
+```js
+assert.equal(
+  SHA256('Rosetta code'),
+  '764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf'
+);
+```
+
+`SHA256("SHA-256 Hash")` should return `"bee8c0cabdcf8c7835f40217dd35a8b0dba9134520e633f1c57285f35ca7ee3e"`.
+
+```js
+assert.equal(
+  SHA256('SHA-256 Hash'),
+  'bee8c0cabdcf8c7835f40217dd35a8b0dba9134520e633f1c57285f35ca7ee3e'
+);
+```
+
+`SHA256("implementation")` should return `"da31012c40330e7e21538e7dd57503b16e8a0839159e96137090cccc9910b171"`.
+
+```js
+assert.equal(
+  SHA256('implementation'),
+  'da31012c40330e7e21538e7dd57503b16e8a0839159e96137090cccc9910b171'
+);
+```
+
+`SHA256("algorithm")` should return `"b1eb2ec8ac9f31ff7918231e67f96e6deda83a9ff33ed2c67443f1df81e5ed14"`.
+
+```js
+assert.equal(
+  SHA256('algorithm'),
+  'b1eb2ec8ac9f31ff7918231e67f96e6deda83a9ff33ed2c67443f1df81e5ed14'
+);
+```
+
+`SHA256("language")` should return `"a4ef304ba42a200bafd78b046e0869af9183f6eee5524aead5dcb3a5ab5f8f3f"`.
+
+```js
+assert.equal(
+  SHA256('language'),
+  'a4ef304ba42a200bafd78b046e0869af9183f6eee5524aead5dcb3a5ab5f8f3f'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function SHA256(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function SHA256(input) {
+  var chrsz = 8;
+  var hexcase = 0;
+
+  function safe_add(x, y) {
+    var lsw = (x & 0xffff) + (y & 0xffff);
+    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+    return (msw << 16) | (lsw & 0xffff);
+  }
+
+  function S(X, n) {
+    return (X >>> n) | (X << (32 - n));
+  }
+
+  function R(X, n) {
+    return X >>> n;
+  }
+
+  function Ch(x, y, z) {
+    return (x & y) ^ (~x & z);
+  }
+
+  function Maj(x, y, z) {
+    return (x & y) ^ (x & z) ^ (y & z);
+  }
+
+  function Sigma0256(x) {
+    return S(x, 2) ^ S(x, 13) ^ S(x, 22);
+  }
+
+  function Sigma1256(x) {
+    return S(x, 6) ^ S(x, 11) ^ S(x, 25);
+  }
+
+  function Gamma0256(x) {
+    return S(x, 7) ^ S(x, 18) ^ R(x, 3);
+  }
+
+  function Gamma1256(x) {
+    return S(x, 17) ^ S(x, 19) ^ R(x, 10);
+  }
+
+  function Sigma0512(x) {
+    return S(x, 28) ^ S(x, 34) ^ S(x, 39);
+  }
+
+  function Sigma1512(x) {
+    return S(x, 14) ^ S(x, 18) ^ S(x, 41);
+  }
+
+  function Gamma0512(x) {
+    return S(x, 1) ^ S(x, 8) ^ R(x, 7);
+  }
+
+  function Gamma1512(x) {
+    return S(x, 19) ^ S(x, 61) ^ R(x, 6);
+  }
+
+  function core_sha256(m, l) {
+    var K = new Array(
+      0x428a2f98,
+      0x71374491,
+      0xb5c0fbcf,
+      0xe9b5dba5,
+      0x3956c25b,
+      0x59f111f1,
+      0x923f82a4,
+      0xab1c5ed5,
+      0xd807aa98,
+      0x12835b01,
+      0x243185be,
+      0x550c7dc3,
+      0x72be5d74,
+      0x80deb1fe,
+      0x9bdc06a7,
+      0xc19bf174,
+      0xe49b69c1,
+      0xefbe4786,
+      0xfc19dc6,
+      0x240ca1cc,
+      0x2de92c6f,
+      0x4a7484aa,
+      0x5cb0a9dc,
+      0x76f988da,
+      0x983e5152,
+      0xa831c66d,
+      0xb00327c8,
+      0xbf597fc7,
+      0xc6e00bf3,
+      0xd5a79147,
+      0x6ca6351,
+      0x14292967,
+      0x27b70a85,
+      0x2e1b2138,
+      0x4d2c6dfc,
+      0x53380d13,
+      0x650a7354,
+      0x766a0abb,
+      0x81c2c92e,
+      0x92722c85,
+      0xa2bfe8a1,
+      0xa81a664b,
+      0xc24b8b70,
+      0xc76c51a3,
+      0xd192e819,
+      0xd6990624,
+      0xf40e3585,
+      0x106aa070,
+      0x19a4c116,
+      0x1e376c08,
+      0x2748774c,
+      0x34b0bcb5,
+      0x391c0cb3,
+      0x4ed8aa4a,
+      0x5b9cca4f,
+      0x682e6ff3,
+      0x748f82ee,
+      0x78a5636f,
+      0x84c87814,
+      0x8cc70208,
+      0x90befffa,
+      0xa4506ceb,
+      0xbef9a3f7,
+      0xc67178f2
+    );
+    var HASH = new Array(
+      0x6a09e667,
+      0xbb67ae85,
+      0x3c6ef372,
+      0xa54ff53a,
+      0x510e527f,
+      0x9b05688c,
+      0x1f83d9ab,
+      0x5be0cd19
+    );
+    var W = new Array(64);
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+
+    m[l >> 5] |= 0x80 << (24 - (l % 32));
+    m[(((l + 64) >> 9) << 4) + 15] = l;
+
+    for (var i = 0; i < m.length; i += 16) {
+      a = HASH[0];
+      b = HASH[1];
+      c = HASH[2];
+      d = HASH[3];
+      e = HASH[4];
+      f = HASH[5];
+      g = HASH[6];
+      h = HASH[7];
+
+      for (var j = 0; j < 64; j++) {
+        if (j < 16) W[j] = m[j + i];
+        else
+          W[j] = safe_add(
+            safe_add(
+              safe_add(Gamma1256(W[j - 2]), W[j - 7]),
+              Gamma0256(W[j - 15])
+            ),
+            W[j - 16]
+          );
+
+        T1 = safe_add(
+          safe_add(safe_add(safe_add(h, Sigma1256(e)), Ch(e, f, g)), K[j]),
+          W[j]
+        );
+        T2 = safe_add(Sigma0256(a), Maj(a, b, c));
+
+        h = g;
+        g = f;
+        f = e;
+        e = safe_add(d, T1);
+        d = c;
+        c = b;
+        b = a;
+        a = safe_add(T1, T2);
+      }
+
+      HASH[0] = safe_add(a, HASH[0]);
+      HASH[1] = safe_add(b, HASH[1]);
+      HASH[2] = safe_add(c, HASH[2]);
+      HASH[3] = safe_add(d, HASH[3]);
+      HASH[4] = safe_add(e, HASH[4]);
+      HASH[5] = safe_add(f, HASH[5]);
+      HASH[6] = safe_add(g, HASH[6]);
+      HASH[7] = safe_add(h, HASH[7]);
+    }
+    return HASH;
+  }
+
+  function core_sha512(m, l) {
+    var K = new Array(
+      0x428a2f98d728ae22,
+      0x7137449123ef65cd,
+      0xb5c0fbcfec4d3b2f,
+      0xe9b5dba58189dbbc,
+      0x3956c25bf348b538,
+      0x59f111f1b605d019,
+      0x923f82a4af194f9b,
+      0xab1c5ed5da6d8118,
+      0xd807aa98a3030242,
+      0x12835b0145706fbe,
+      0x243185be4ee4b28c,
+      0x550c7dc3d5ffb4e2,
+      0x72be5d74f27b896f,
+      0x80deb1fe3b1696b1,
+      0x9bdc06a725c71235,
+      0xc19bf174cf692694,
+      0xe49b69c19ef14ad2,
+      0xefbe4786384f25e3,
+      0x0fc19dc68b8cd5b5,
+      0x240ca1cc77ac9c65,
+      0x2de92c6f592b0275,
+      0x4a7484aa6ea6e483,
+      0x5cb0a9dcbd41fbd4,
+      0x76f988da831153b5,
+      0x983e5152ee66dfab,
+      0xa831c66d2db43210,
+      0xb00327c898fb213f,
+      0xbf597fc7beef0ee4,
+      0xc6e00bf33da88fc2,
+      0xd5a79147930aa725,
+      0x06ca6351e003826f,
+      0x142929670a0e6e70,
+      0x27b70a8546d22ffc,
+      0x2e1b21385c26c926,
+      0x4d2c6dfc5ac42aed,
+      0x53380d139d95b3df,
+      0x650a73548baf63de,
+      0x766a0abb3c77b2a8,
+      0x81c2c92e47edaee6,
+      0x92722c851482353b,
+      0xa2bfe8a14cf10364,
+      0xa81a664bbc423001,
+      0xc24b8b70d0f89791,
+      0xc76c51a30654be30,
+      0xd192e819d6ef5218,
+      0xd69906245565a910,
+      0xf40e35855771202a,
+      0x106aa07032bbd1b8,
+      0x19a4c116b8d2d0c8,
+      0x1e376c085141ab53,
+      0x2748774cdf8eeb99,
+      0x34b0bcb5e19b48a8,
+      0x391c0cb3c5c95a63,
+      0x4ed8aa4ae3418acb,
+      0x5b9cca4f7763e373,
+      0x682e6ff3d6b2b8a3,
+      0x748f82ee5defb2fc,
+      0x78a5636f43172f60,
+      0x84c87814a1f0ab72,
+      0x8cc702081a6439ec,
+      0x90befffa23631e28,
+      0xa4506cebde82bde9,
+      0xbef9a3f7b2c67915,
+      0xc67178f2e372532b,
+      0xca273eceea26619c,
+      0xd186b8c721c0c207,
+      0xeada7dd6cde0eb1e,
+      0xf57d4f7fee6ed178,
+      0x06f067aa72176fba,
+      0x0a637dc5a2c898a6,
+      0x113f9804bef90dae,
+      0x1b710b35131c471b,
+      0x28db77f523047d84,
+      0x32caab7b40c72493,
+      0x3c9ebe0a15c9bebc,
+      0x431d67c49c100d4c,
+      0x4cc5d4becb3e42b6,
+      0x597f299cfc657e2a,
+      0x5fcb6fab3ad6faec,
+      0x6c44198c4a475817
+    );
+    var HASH = new Array(
+      0x6a09e667f3bcc908,
+      0xbb67ae8584caa73b,
+      0x3c6ef372fe94f82b,
+      0xa54ff53a5f1d36f1,
+      0x510e527fade682d1,
+      0x9b05688c2b3e6c1f,
+      0x1f83d9abfb41bd6b,
+      0x5be0cd19137e2179
+    );
+    var W = new Array(80);
+    var a, b, c, d, e, f, g, h, i, j;
+    var T1, T2;
+  }
+
+  function str2binb(str) {
+    var bin = Array();
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < str.length * chrsz; i += chrsz)
+      bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - (i % 32));
+    return bin;
+  }
+
+  function binb2str(bin) {
+    var str = '';
+    var mask = (1 << chrsz) - 1;
+    for (var i = 0; i < bin.length * 32; i += chrsz)
+      str += String.fromCharCode((bin[i >> 5] >>> (24 - (i % 32))) & mask);
+    return str;
+  }
+
+  function binb2hex(binarray) {
+    var hex_tab = hexcase ? '0123456789ABCDEF' : '0123456789abcdef';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i++) {
+      str +=
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8 + 4)) & 0xf) +
+        hex_tab.charAt((binarray[i >> 2] >> ((3 - (i % 4)) * 8)) & 0xf);
+    }
+    return str;
+  }
+
+  function binb2b64(binarray) {
+    var tab =
+      'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+    var str = '';
+    for (var i = 0; i < binarray.length * 4; i += 3) {
+      var triplet =
+        (((binarray[i >> 2] >> (8 * (3 - (i % 4)))) & 0xff) << 16) |
+        (((binarray[(i + 1) >> 2] >> (8 * (3 - ((i + 1) % 4)))) & 0xff) << 8) |
+        ((binarray[(i + 2) >> 2] >> (8 * (3 - ((i + 2) % 4)))) & 0xff);
+      for (var j = 0; j < 4; j++) {
+        if (i * 8 + j * 6 > binarray.length * 32) str += '';
+        else str += tab.charAt((triplet >> (6 * (3 - j))) & 0x3f);
+      }
+    }
+    return str;
+  }
+
+  function hex_sha2(s) {
+    return binb2hex(core_sha256(str2binb(s), s.length * chrsz));
+  }
+
+  function b64_sha2(s) {
+    return binb2b64(core_sha256(str2binb(s), s.length * chrsz));
+  }
+
+  function str_sha2(s) {
+    return binb2str(core_sha256(str2binb(s), s.length * chrsz));
+  }
+  return hex_sha2(input);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
new file mode 100644
index 0000000000..e2a4065371
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-an-array-of-composite-structures.md
@@ -0,0 +1,116 @@
+---
+id: 5a23c84252665b21eecc7ffe
+title: Sort an array of composite structures
+challengeType: 5
+forumTopicId: 302306
+dashedName: sort-an-array-of-composite-structures
+---
+
+# --description--
+
+Write a function that takes an array of objects as a parameter. The function should sort the array according to the 'key' attribute of the objects and return the sorted array.
+
+# --hints--
+
+`sortByKey` should be a function.
+
+```js
+assert(typeof sortByKey == 'function');
+```
+
+`sortByKey([{key: 3, value: "foo"}, {key: 2, value: "bar"}, {key: 4, value: "baz"}, {key: 1, value: 42}, {key: 5, value: "another string"}])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    sortByKey([
+      { key: 3, value: 'foo' },
+      { key: 2, value: 'bar' },
+      { key: 4, value: 'baz' },
+      { key: 1, value: 42 },
+      { key: 5, value: 'another string' }
+    ])
+  )
+);
+```
+
+`sortByKey([{key: 3, value: "foo"}, {key: 2, value: "bar"}, {key: 4, value: "baz"}, {key: 1, value: 42}, {key: 5, value: "another string"}])` should return `[{key: 1, value: 42}, {key: 2, value: "bar"}, {key: 3, value: "foo"}, {key: 4, value: "baz"}, {key: 5, value: "another string"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 3, value: 'foo' },
+    { key: 2, value: 'bar' },
+    { key: 4, value: 'baz' },
+    { key: 1, value: 42 },
+    { key: 5, value: 'another string' }
+  ]),
+  [
+    { key: 1, value: 42 },
+    { key: 2, value: 'bar' },
+    { key: 3, value: 'foo' },
+    { key: 4, value: 'baz' },
+    { key: 5, value: 'another string' }
+  ]
+);
+```
+
+`sortByKey([{key: 3, name: "Joe"}, {key: 4, name: "Bill"}, {key: 20, name: "Alice"}, {key: 5, name: "Harry"}])` should return `[{key: 3, name: "Joe"}, {key: 4, name: "Bill"}, {key: 5, name: "Harry"}, {key: 20, name: "Alice"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 3, name: 'Joe' },
+    { key: 4, name: 'Bill' },
+    { key: 20, name: 'Alice' },
+    { key: 5, name: 'Harry' }
+  ]),
+  [
+    { key: 3, name: 'Joe' },
+    { key: 4, name: 'Bill' },
+    { key: 5, name: 'Harry' },
+    { key: 20, name: 'Alice' }
+  ]
+);
+```
+
+`sortByKey([{key: 2341, name: "Adam"}, {key: 122, name: "Bernie"}, {key: 19, name: "David"}, {key: 5531, name: "Joe"}, {key: 1234, name: "Walter"}])` should return `[{key: 19, name: "David"}, {key: 122, name: "Bernie"}, {key: 1234, name: "Walter"}, {key: 2341, name: "Adam"}, {key: 5531, name: "Joe"}]`.
+
+```js
+assert.deepEqual(
+  sortByKey([
+    { key: 2341, name: 'Adam' },
+    { key: 122, name: 'Bernie' },
+    { key: 19, name: 'David' },
+    { key: 5531, name: 'Joe' },
+    { key: 1234, name: 'Walter' }
+  ]),
+  [
+    { key: 19, name: 'David' },
+    { key: 122, name: 'Bernie' },
+    { key: 1234, name: 'Walter' },
+    { key: 2341, name: 'Adam' },
+    { key: 5531, name: 'Joe' }
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sortByKey(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sortByKey (arr) {
+  return arr.sort(function(a, b) {
+    return a.key - b.key
+  });
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
new file mode 100644
index 0000000000..b6647f2824
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -0,0 +1,147 @@
+---
+id: 5a23c84252665b21eecc8000
+title: Sort disjoint sublist
+challengeType: 5
+forumTopicId: 302307
+dashedName: sort-disjoint-sublist
+---
+
+# --description--
+
+Given a list of values and a set of integer indices into that value list, the task is to sort the values at the given indices, but preserving the values at indices outside the set of those to be sorted.
+
+Make your function work with the following list of values and set of indices:
+
+<code>values: [7, <b>6</b>, 5, 4, 3, 2, <b>1</b>, <b>0</b>]</code>
+
+```js
+indices(0-based): {6, 1, 7}
+```
+
+Where the correct result would be:
+
+<code>[7, <b>0</b>, 5, 4, 3, 2, <b>1</b>, <b>6</b>]</code>.
+
+# --hints--
+
+`sortDisjoint` should be a function.
+
+```js
+assert(typeof sortDisjoint == 'function');
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])` should return an array.
+
+```js
+assert(Array.isArray(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])));
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])` should return `[7, 0, 5, 4, 3, 2, 1, 6]`.
+
+```js
+assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7]), [
+  7,
+  0,
+  5,
+  4,
+  3,
+  2,
+  1,
+  6
+]);
+```
+
+`sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6])` should return `[7, 1, 2, 4, 3, 5, 6, 0]`.
+
+```js
+assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6]), [
+  7,
+  1,
+  2,
+  4,
+  3,
+  5,
+  6,
+  0
+]);
+```
+
+`sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7])` should return `[8, 1, 6, 5, 4, 3, 2, 7]`.
+
+```js
+assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7]), [
+  8,
+  1,
+  6,
+  5,
+  4,
+  3,
+  2,
+  7
+]);
+```
+
+`sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6])` should return `[8, 2, 6, 3, 4, 5, 7, 1]`.
+
+```js
+assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6]), [
+  8,
+  2,
+  6,
+  3,
+  4,
+  5,
+  7,
+  1
+]);
+```
+
+`sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4])` should return `[6, 1, 7, 1, 3, 5, 6]`.
+
+```js
+assert.deepEqual(sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4]), [
+  6,
+  1,
+  7,
+  1,
+  3,
+  5,
+  6
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sortDisjoint(values, indices) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sortDisjoint(values, indices) {
+  let sublist = [];
+
+  indices.sort(function(a, b) {
+    return a - b;
+  });
+
+  for (let i = 0; i < indices.length; i++) {
+    sublist.push(values[indices[i]]);
+  }
+
+  sublist.sort((a, b) => {
+    return a - b;
+  });
+
+  for (let i = 0; i < indices.length; i++) {
+    values[indices[i]] = sublist[i];
+  }
+
+  return values;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-stability.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-stability.md
new file mode 100644
index 0000000000..3f57407b6a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-stability.md
@@ -0,0 +1,168 @@
+---
+id: 5a23c84252665b21eecc8014
+title: Sort stability
+challengeType: 5
+forumTopicId: 302308
+dashedName: sort-stability
+---
+
+# --description--
+
+When sorting records in a table by a particular column or field, a [stable sort](https://en.wikipedia.org/wiki/Stable_sort#Stability) will always retain the relative order of records that have the same key.
+
+For example, in this table of countries and cities, a stable sort on the **second** column, the cities, would keep the US Birmingham above the UK Birmingham. (Although an unstable sort *might*, in this case, place the US Birmingham above the UK Birmingham, a stable sort routine would *guarantee* it).
+
+<pre>UK  London
+US  New York
+US  Birmingham
+UK  Birmingham
+</pre>
+
+Similarly, stable sorting on just the first column would generate "UK London" as the first item and "US Birmingham" as the last item (since the order of the elements having the same first word – "UK" or "US" – would be maintained).
+
+# --instructions--
+
+Write a function that takes a 2D array as a parameter. Each element has 2 elements similar to the above example. The function should sort the array as mentioned previously and return the sorted array.
+
+# --hints--
+
+`stableSort` should be a function.
+
+```js
+assert(typeof stableSort == 'function');
+```
+
+`stableSort([["UK", "London"], ["US", "New York"], ["US", "Birmingham"], ["UK", "Birmingham"]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    stableSort([
+      ['UK', 'London'],
+      ['US', 'New York'],
+      ['US', 'Birmingham'],
+      ['UK', 'Birmingham']
+    ])
+  )
+);
+```
+
+`stableSort([["UK", "London"], ["US", "New York"], ["US", "Birmingham"], ["UK", "Birmingham"]])` should return `[["US", "Birmingham"], ["UK", "Birmingham"], ["UK", "London"], ["US", "New York"]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    ['UK', 'London'],
+    ['US', 'New York'],
+    ['US', 'Birmingham'],
+    ['UK', 'Birmingham']
+  ]),
+  [
+    ['US', 'Birmingham'],
+    ['UK', 'Birmingham'],
+    ['UK', 'London'],
+    ['US', 'New York']
+  ]
+);
+```
+
+`stableSort([[2, 2], [1, 2], [1, 4], [1, 5]])` should return `[[2, 2], [1, 2], [1, 4], [1, 5]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [2, 2],
+    [1, 2],
+    [1, 4],
+    [1, 5]
+  ]),
+  [
+    [2, 2],
+    [1, 2],
+    [1, 4],
+    [1, 5]
+  ]
+);
+```
+
+`stableSort([[11, 55], [12, 45], [11, 45], [32, 45]])` should return `[[12, 45], [11, 45], [32, 45], [11, 55]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [11, 55],
+    [12, 45],
+    [11, 45],
+    [32, 45]
+  ]),
+  [
+    [12, 45],
+    [11, 45],
+    [32, 45],
+    [11, 55]
+  ]
+);
+```
+
+`stableSort([[10, 22], [1, 2], [1, 4], [1, 5], [10, 9]])` should return `[[1, 2], [1, 4], [1, 5], [10, 9], [10, 22]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [10, 22],
+    [1, 2],
+    [1, 4],
+    [1, 5],
+    [10, 9]
+  ]),
+  [
+    [1, 2],
+    [1, 4],
+    [1, 5],
+    [10, 9],
+    [10, 22]
+  ]
+);
+```
+
+`stableSort([[55, 54], [12, 22], [31, 43], [31, 54], [10, 49]])` should return `[[12, 22], [31, 43], [10, 49], [55, 54], [31, 54]]`.
+
+```js
+assert.deepEqual(
+  stableSort([
+    [55, 54],
+    [12, 22],
+    [31, 43],
+    [31, 54],
+    [10, 49]
+  ]),
+  [
+    [12, 22],
+    [31, 43],
+    [10, 49],
+    [55, 54],
+    [31, 54]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function stableSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function stableSort(arr) {
+  arr.sort(function(a, b) {
+    return a[1] < b[1] ? -1 : a[1] > b[1] ? 1 : 0;
+  });
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
new file mode 100644
index 0000000000..e7e7919d0b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sort-using-a-custom-comparator.md
@@ -0,0 +1,121 @@
+---
+id: 5a23c84252665b21eecc8016
+title: Sort using a custom comparator
+challengeType: 5
+forumTopicId: 302309
+dashedName: sort-using-a-custom-comparator
+---
+
+# --description--
+
+Write a function to sort an array (or list) of strings in order of descending length, and in ascending lexicographic order for strings of equal length.
+
+# --hints--
+
+`lengthSorter` should be a function.
+
+```js
+assert(typeof lengthSorter == 'function');
+```
+
+`lengthSorter(["Here", "are", "some", "sample", "strings", "to", "be", "sorted"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    lengthSorter([
+      'Here',
+      'are',
+      'some',
+      'sample',
+      'strings',
+      'to',
+      'be',
+      'sorted'
+    ])
+  )
+);
+```
+
+`lengthSorter(["Here", "are", "some", "sample", "strings", "to", "be", "sorted"])` should return `["strings", "sample", "sorted", "Here", "some", "are", "be", "to"]`.
+
+```js
+assert.deepEqual(
+  lengthSorter([
+    'Here',
+    'are',
+    'some',
+    'sample',
+    'strings',
+    'to',
+    'be',
+    'sorted'
+  ]),
+  ['strings', 'sample', 'sorted', 'Here', 'some', 'are', 'be', 'to']
+);
+```
+
+`lengthSorter(["I", "hope", "your", "day", "is", "going", "good", "?"])` should return `["going", "good", "hope", "your", "day", "is", "?","I"]`.
+
+```js
+assert.deepEqual(
+  lengthSorter(['I', 'hope', 'your', 'day', 'is', 'going', 'good', '?']),
+  ['going', 'good', 'hope', 'your', 'day', 'is', '?', 'I']
+);
+```
+
+`lengthSorter(["Mine", "is", "going", "great"])` should return `["going", "great", "Mine", "is"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Mine', 'is', 'going', 'great']), [
+  'going',
+  'great',
+  'Mine',
+  'is'
+]);
+```
+
+`lengthSorter(["Have", "fun", "sorting", "!!"])` should return `["sorting", "Have", "fun", "!!"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Have', 'fun', 'sorting', '!!']), [
+  'sorting',
+  'Have',
+  'fun',
+  '!!'
+]);
+```
+
+`lengthSorter(["Everything", "is", "good", "!!"])` should return `["Everything", "good", "!!", "is"]`.
+
+```js
+assert.deepEqual(lengthSorter(['Everything', 'is', 'good', '!!']), [
+  'Everything',
+  'good',
+  '!!',
+  'is'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function lengthSorter(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function lengthSorter(arr) {
+  arr.sort(function(a, b) {
+    var result = b.length - a.length;
+    if (result == 0) result = a.localeCompare(b);
+    return result;
+  });
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
new file mode 100644
index 0000000000..02b836f4de
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bead-sort.md
@@ -0,0 +1,129 @@
+---
+id: 5a23c84252665b21eecc8001
+title: Sorting algorithms/Bead sort
+challengeType: 5
+forumTopicId: 302310
+dashedName: sorting-algorithmsbead-sort
+---
+
+# --description--
+
+Sort an array of positive integers using the [Bead Sort Algorithm](https://en.wikipedia.org/wiki/Bead_sort).
+
+A *bead sort* is also known as a *gravity sort*.
+
+The algorithm has O(S), where S is the sum of the integers in the input set: Each bead is moved individually.
+
+This is the case when bead sort is implemented without a mechanism to assist in finding empty spaces below the beads, such as in software implementations.
+
+# --hints--
+
+`beadSort` should be a function.
+
+```js
+assert(typeof beadSort == 'function');
+```
+
+`beadSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(beadSort([25, 32, 12, 7, 20])));
+```
+
+`beadSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(beadSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`beadSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(beadSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`beadSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(beadSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`beadSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(beadSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`beadSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(beadSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function beadSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function beadSort(arr) {
+  var max = 0;
+  for (var i = 0; i < arr.length; i++) if (arr[i] > max) max = arr[i];
+  var grid = new Array(arr.length);
+  for (var i = 0; i < grid.length; i++) {
+    grid[i] = new Array(max);
+  }
+  var levelcount = new Array(max);
+  levelcount.fill(0);
+  for (var i = 0; i < max; i++) {
+    levelcount[i] = 0;
+    for (var j = 0; j < arr.length; j++) grid[j][i] = '_';
+  }
+  for (var i = 0; i < arr.length; i++) {
+    var num = arr[i];
+    for (var j = 0; num > 0; j++) {
+      grid[levelcount[j]++][j] = '*';
+      num--;
+    }
+  }
+  var sorted = new Array(arr.length);
+  sorted.fill(0);
+  for (var i = 0; i < arr.length; i++) {
+    var putt = 0;
+    for (
+      var j = 0;
+      j < max &&
+      (function(c) {
+        return c.charCodeAt == null ? c : c.charCodeAt(0);
+      })(grid[arr.length - 1 - i][j]) == '*'.charCodeAt(0);
+      j++
+    )
+      putt++;
+    sorted[i] = putt;
+  }
+  return sorted;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
new file mode 100644
index 0000000000..2a7b74b5e3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-bogosort.md
@@ -0,0 +1,126 @@
+---
+id: 5a23c84252665b21eecc8002
+title: Sorting algorithms/Bogosort
+challengeType: 5
+forumTopicId: 302311
+dashedName: sorting-algorithmsbogosort
+---
+
+# --description--
+
+[Bogosort](https://en.wikipedia.org/wiki/Bogosort) a list of numbers.
+
+Bogosort simply shuffles a collection randomly until it is sorted.
+
+"Bogosort" is a perversely inefficient algorithm only used as an in-joke.
+
+Its average run-time is O(n!) because the chance that any given shuffle of a set will end up in sorted order is about one in *n* factorial, and the worst case is infinite since there's no guarantee that a random shuffling will ever produce a sorted sequence.
+
+Its best case is O(n) since a single pass through the elements may suffice to order them.
+
+Pseudocode:
+
+<pre><b>while not</b> InOrder(list) <b>do</b>
+  Shuffle(list)
+<b>done</b>
+</pre>
+
+# --hints--
+
+`bogosort` should be a function.
+
+```js
+assert(typeof bogosort == 'function');
+```
+
+`bogosort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(bogosort([25, 32, 12, 7, 20])));
+```
+
+`bogosort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(bogosort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`bogosort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(bogosort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`bogosort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(bogosort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`bogosort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(bogosort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`bogosort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(bogosort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function bogosort(v) {
+
+}
+```
+
+# --solutions--
+
+```js
+function bogosort(v) {
+  function shuffle(v) {
+    for (
+      var j, x, i = v.length;
+      i;
+      j = Math.floor(Math.random() * i), x = v[--i], v[i] = v[j], v[j] = x
+    );
+    return v;
+  }
+
+  function isSorted(v) {
+    for (var i = 1; i < v.length; i++) {
+      if (v[i - 1] > v[i]) {
+        return false;
+      }
+    }
+    return true;
+  }
+  var sorted = false;
+  while (sorted == false) {
+    v = shuffle(v);
+    sorted = isSorted(v);
+  }
+  return v;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
new file mode 100644
index 0000000000..86aeeda4c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-cocktail-sort.md
@@ -0,0 +1,140 @@
+---
+id: 5a23c84252665b21eecc8004
+title: Sorting algorithms/Cocktail sort
+challengeType: 5
+forumTopicId: 302312
+dashedName: sorting-algorithmscocktail-sort
+---
+
+# --description--
+
+The cocktail shaker sort is an improvement on the [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>). The improvement is basically that values "bubble" both directions through the array, because on each iteration the cocktail shaker sort bubble sorts once forwards and once backwards. Pseudocode for the algorithm (from [wikipedia](<https://en.wikipedia.org/wiki/Cocktail sort>)):
+
+<pre><b>function</b> <i>cocktailSort</i>( A : list of sortable items )
+  <b>do</b>
+    swapped := false
+    <b>for each</b> i <b>in</b> 0 <b>to</b> length( A ) - 2 <b>do</b>
+      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b> <i>// test whether the two</i>
+                                <i>// elements are in the wrong</i>
+                                <i>// order</i>
+        swap( A[ i ], A[ i+1 ] ) <i>// let the two elements</i>
+                                 <i>// change places</i>
+        swapped := true;
+    <b>if</b> swapped = false <b>then</b>
+      <i>// we can exit the outer loop here if no swaps occurred.</i>
+      <b>break do-while loop</b>;
+    swapped := false
+    <b>for each</b> i <b>in</b> length( A ) - 2 <b>down to</b> 0 <b>do</b>
+      <b>if</b> A[ i ] > A[ i+1 ] <b>then</b>
+        swap( A[ i ], A[ i+1 ] )
+        swapped := true;
+  <b>while</b> swapped; <i>// if no elements have been swapped,</i>
+                <i>// then the list is sorted</i>
+</pre>
+
+# --instructions--
+
+Write a function that sorts a given array using cocktail sort.
+
+# --hints--
+
+`cocktailSort` should be a function.
+
+```js
+assert(typeof cocktailSort == 'function');
+```
+
+`cocktailSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(cocktailSort([25, 32, 12, 7, 20])));
+```
+
+`cocktailSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(cocktailSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`cocktailSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(cocktailSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`cocktailSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(cocktailSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`cocktailSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(cocktailSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`cocktailSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(cocktailSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function cocktailSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function cocktailSort(arr) {
+  let isSorted = true;
+  while (isSorted) {
+    for (let i = 0; i < arr.length - 1; i++) {
+      if (arr[i] > arr[i + 1]) {
+        let temp = arr[i];
+        arr[i] = arr[i + 1];
+        arr[i + 1] = temp;
+        isSorted = true;
+      }
+    }
+
+    if (!isSorted) break;
+
+    isSorted = false;
+
+    for (let j = arr.length - 1; j > 0; j--) {
+      if (arr[j - 1] > arr[j]) {
+        let temp = arr[j];
+        arr[j] = arr[j - 1];
+        arr[j - 1] = temp;
+        isSorted = true;
+      }
+    }
+  }
+
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
new file mode 100644
index 0000000000..2b31fb98db
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-comb-sort.md
@@ -0,0 +1,179 @@
+---
+id: 5a23c84252665b21eecc8005
+title: Sorting algorithms/Comb sort
+challengeType: 5
+forumTopicId: 302313
+dashedName: sorting-algorithmscomb-sort
+---
+
+# --description--
+
+Implement a *comb sort*.
+
+The **Comb Sort** is a variant of the [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>).
+
+Like the [Shell sort](<https://rosettacode.org/wiki/Shell sort>), the Comb Sort increases the gap used in comparisons and exchanges.
+
+Dividing the gap by $(1-e^{-\\varphi})^{-1} \\approx 1.247330950103979$ works best, but 1.3 may be more practical.
+
+Some implementations use the insertion sort once the gap is less than a certain amount.
+
+**Also see**
+
+<ul>
+  <li>the Wikipedia article: <a href='https://en.wikipedia.org/wiki/Comb sort' target='_blank'>Comb sort</a>.</li>
+</ul>
+
+Variants:
+
+<ul>
+  <li>Combsort11 makes sure the gap ends in (11, 8, 6, 4, 3, 2, 1), which is significantly faster than the other two possible endings.</li>
+  <li>Combsort with different endings changes to a more efficient sort when the data is almost sorted (when the gap is small). Comb sort with a low gap isn't much better than the Bubble Sort.</li>
+</ul>
+
+Pseudocode:
+
+<pre><b>function</b> combsort(<b>array</b> input)
+  gap := input<b>.size</b> <i>//initialize gap size</i>
+  <b>loop until</b> gap = 1 <b>and</b> swaps = 0
+    <i>//update the gap value for a next comb. Below is an example</i>
+    gap := int(gap / 1.25)
+    <b>if</b> gap &#x3C; 1 
+      <i>//minimum gap is 1</i>
+      gap := 1
+    <b>end if</b>
+    i := 0
+    swaps := 0 <i>//see <a href='https://rosettacode.org/wiki/Sorting_algorithms/Bubble_sort' target='_blank'>Bubble Sort</a> for an explanation</i>
+    <i>//a single "comb" over the input list</i>
+    <b>loop until</b> i + gap >= input<b>.size</b> <i>//see <a href='https://rosettacode.org/wiki/Sorting_algorithms/Shell_sort' target='_blank'>Shell sort</a> for similar idea</i>
+      <b>if</b> input[i] > input[i+gap]
+        <b>swap</b>(input[i], input[i+gap])
+        swaps := 1 <i>// Flag a swap has occurred, so the</i>
+            <i>// list is not guaranteed sorted</i>
+      <b>end if</b>
+      i := i + 1
+    <b>end loop</b>
+  <b>end loop</b>
+<b>end function</b>
+</pre>
+
+# --instructions--
+
+Write a function that sorts a given array using Comb sort.
+
+# --hints--
+
+`combSort` should be a function.
+
+```js
+assert(typeof combSort == 'function');
+```
+
+`combSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(combSort([25, 32, 12, 7, 20])));
+```
+
+`combSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(combSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`combSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(combSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`combSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(combSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`combSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(combSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`combSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(combSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function combSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function combSort(arr) {
+  function is_array_sorted(arr) {
+    var sorted = true;
+    for (var i = 0; i < arr.length - 1; i++) {
+      if (arr[i] > arr[i + 1]) {
+        sorted = false;
+        break;
+      }
+    }
+    return sorted;
+  }
+  var iteration_count = 0;
+  var gap = arr.length - 2;
+  var decrease_factor = 1.25;
+
+  // Until array is not sorted, repeat iterations
+  while (!is_array_sorted(arr)) {
+    // If not first gap
+    if (iteration_count > 0)
+      // Calculate gap
+      gap = gap == 1 ? gap : Math.floor(gap / decrease_factor);
+
+    // Set front and back elements and increment to a gap
+    var front = 0;
+    var back = gap;
+    while (back <= arr.length - 1) {
+      // If elements are not ordered swap them
+      if (arr[front] > arr[back]) {
+        var temp = arr[front];
+        arr[front] = arr[back];
+        arr[back] = temp;
+      }
+
+      // Increment and re-run swapping
+      front += 1;
+      back += 1;
+    }
+    iteration_count += 1;
+  }
+
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
new file mode 100644
index 0000000000..4aebdd0fe8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-gnome-sort.md
@@ -0,0 +1,124 @@
+---
+id: 5a23c84252665b21eecc8007
+title: Sorting algorithms/Gnome sort
+challengeType: 5
+forumTopicId: 302314
+dashedName: sorting-algorithmsgnome-sort
+---
+
+# --description--
+
+Gnome sort is a sorting algorithm which is similar to [Insertion sort](<https://rosettacode.org/wiki/Insertion sort>), except that moving an element to its proper place is accomplished by a series of swaps, as in [Bubble Sort](<https://rosettacode.org/wiki/Bubble Sort>).
+
+The pseudocode for the algorithm is:
+
+<pre><b>function</b> <i>gnomeSort</i>(a[0..size-1])
+  i := 1
+  j := 2
+  <b>while</b> i &#x3C; size <b>do</b>
+    <b>if</b> a[i-1] &#x3C;= a[i] <b>then</b>
+      <i>/// for descending sort, use >= for comparison</i>
+      i := j
+      j := j + 1
+    <b>else</b>
+      <b>swap</b> a[i-1] <b>and</b> a[i]
+      i := i - 1
+      <b>if</b> i = 0 <b>then</b>
+        i := j
+        j := j + 1
+      <b>endif</b>
+    <b>endif</b>
+  <b>done</b>
+</pre>
+
+# --instructions--
+
+Write a function to implement the above pseudo code. The function should return the sorted array.
+
+# --hints--
+
+`gnomeSort` should be a function.
+
+```js
+assert(typeof gnomeSort == 'function');
+```
+
+`gnomeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(gnomeSort([25, 32, 12, 7, 20])));
+```
+
+`gnomeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(gnomeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`gnomeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(gnomeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`gnomeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(gnomeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`gnomeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(gnomeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`gnomeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(gnomeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function gnomeSort(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function gnomeSort(a) {
+  function moveBack(i) {
+    for (; i > 0 && a[i - 1] > a[i]; i--) {
+      var t = a[i];
+      a[i] = a[i - 1];
+      a[i - 1] = t;
+    }
+  }
+  for (var i = 1; i < a.length; i++) {
+    if (a[i - 1] > a[i]) moveBack(i);
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
new file mode 100644
index 0000000000..1a4a28928c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-pancake-sort.md
@@ -0,0 +1,124 @@
+---
+id: 5a23c84252665b21eecc800b
+title: Sorting algorithms/Pancake sort
+challengeType: 5
+forumTopicId: 302315
+dashedName: sorting-algorithmspancake-sort
+---
+
+# --description--
+
+Write a function to sort an array of integers (of any convenient size) into ascending order using [Pancake sorting](<https://en.wikipedia.org/wiki/Pancake sorting>). The function should return the sorted array.
+
+In short, instead of individual elements being sorted, the only operation allowed is to "flip" one end of the list, like so:
+
+<pre>Before:
+<b>6 7 8 9</b> 2 5 3 4 1<br>
+After:
+<b>9 8 7 6</b> 2 5 3 4 1
+</pre>
+
+Only one end of the list can be flipped; this should be the low end, but the high end is okay if it's easier to code or works better, but it **must** be the same end for the entire solution. (The end flipped can't be arbitrarily changed.)
+
+# --hints--
+
+`pancakeSort` should be a function.
+
+```js
+assert(typeof pancakeSort == 'function');
+```
+
+`pancakeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(pancakeSort([25, 32, 12, 7, 20])));
+```
+
+`pancakeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(pancakeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`pancakeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(pancakeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`pancakeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(pancakeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`pancakeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(pancakeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`pancakeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(pancakeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function pancakeSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function pancakeSort(arr) {
+  for (var i = arr.length - 1; i >= 1; i--) {
+    // find the index of the largest element not yet sorted
+    var max_idx = 0;
+    var max = arr[0];
+    for (var j = 1; j <= i; j++) {
+      if (arr[j] > max) {
+        max = arr[j];
+        max_idx = j;
+      }
+    }
+
+    if (max_idx == i) continue; // element already in place
+
+    var new_slice;
+
+    // flip arr max element to index 0
+    if (max_idx > 0) {
+      new_slice = arr.slice(0, max_idx + 1).reverse();
+      for (var j = 0; j <= max_idx; j++) arr[j] = new_slice[j];
+    }
+
+    // then flip the max element to its place
+    new_slice = arr.slice(0, i + 1).reverse();
+    for (var j = 0; j <= i; j++) arr[j] = new_slice[j];
+  }
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
new file mode 100644
index 0000000000..d5fc1e3b08
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-permutation-sort.md
@@ -0,0 +1,131 @@
+---
+id: 5a23c84252665b21eecc800c
+title: Sorting algorithms/Permutation sort
+challengeType: 5
+forumTopicId: 302316
+dashedName: sorting-algorithmspermutation-sort
+---
+
+# --description--
+
+Write a function to implement a permutation sort, which proceeds by generating the possible permutations of the input array until discovering the sorted one. The function should return the sorted array.
+
+Pseudocode:
+
+<pre><b>while not</b> InOrder(list) <b>do</b>
+  nextPermutation(list)
+<b>done</b>
+</pre>
+
+# --hints--
+
+`permutationSort` should be a function.
+
+```js
+assert(typeof permutationSort == 'function');
+```
+
+`permutationSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(permutationSort([25, 32, 12, 7, 20])));
+```
+
+`permutationSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(permutationSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`permutationSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(permutationSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`permutationSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(permutationSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`permutationSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(permutationSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`permutationSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(permutationSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function permutationSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function permutationSort(arr) {
+  function pSort(a) {
+    var list = [];
+    permute(a, a.length, list);
+    for (var i = 0; i < list.length; i++) {
+      var x = list[i];
+      if (isSorted(x)) return x;
+    }
+    return a;
+  }
+
+  function permute(a, n, list) {
+    if (n === 1) {
+      var b = a.slice();
+      list.push(b);
+      return;
+    }
+    for (var i = 0; i < n; i++) {
+      swap(a, i, n - 1);
+      permute(a, n - 1, list);
+      swap(a, i, n - 1);
+    }
+  }
+
+  function isSorted(a){
+    for(let i = 0; i < a.length - 1; i++)
+      if(a[i] > a[i + 1])
+        return false;
+    return true;
+  }
+
+  function swap(arr, i, j) {
+    var temp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = temp;
+  }
+  return pSort(arr);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
new file mode 100644
index 0000000000..3d69051f4d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-shell-sort.md
@@ -0,0 +1,106 @@
+---
+id: 5a23c84252665b21eecc8010
+title: Sorting algorithms/Shell sort
+challengeType: 5
+forumTopicId: 302317
+dashedName: sorting-algorithmsshell-sort
+---
+
+# --description--
+
+Write a function to sort an array of elements using the [Shell sort](<https://en.wikipedia.org/wiki/Shell sort>) algorithm, a diminishing increment sort. The function should return the sorted array.
+
+The Shell sort (also known as Shellsort or Shell's method) is named after its inventor, Donald Shell, who published the algorithm in 1959.
+
+Shell sort is a sequence of interleaved insertion sorts based on an increment sequence. The increment size is reduced after each pass until the increment size is 1.
+
+With an increment size of 1, the sort is a basic insertion sort, but by this time the data is guaranteed to be almost sorted, which is insertion sort's "best case".
+
+Any sequence will sort the data as long as it ends in 1, but some work better than others.
+
+Empirical studies have shown a geometric increment sequence with a ratio of about 2.2 work well in practice.
+
+# --hints--
+
+`shellSort` should be a function.
+
+```js
+assert(typeof shellSort == 'function');
+```
+
+`shellSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(shellSort([25, 32, 12, 7, 20])));
+```
+
+`shellSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(shellSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`shellSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(shellSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`shellSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(shellSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`shellSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(shellSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`shellSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(shellSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function shellSort(a) {
+
+}
+```
+
+# --solutions--
+
+```js
+function shellSort(a) {
+  for (var h = a.length; h > 0; h = parseInt(h / 2)) {
+    for (var i = h; i < a.length; i++) {
+      var k = a[i];
+      for (var j = i; j >= h && k < a[j - h]; j -= h) a[j] = a[j - h];
+      a[j] = k;
+    }
+  }
+  return a;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
new file mode 100644
index 0000000000..04dee734ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-stooge-sort.md
@@ -0,0 +1,125 @@
+---
+id: 5a23c84252665b21eecc8012
+title: Sorting algorithms/Stooge sort
+challengeType: 5
+forumTopicId: 302318
+dashedName: sorting-algorithmsstooge-sort
+---
+
+# --description--
+
+Write a function to perform [Stooge Sort](<https://en.wikipedia.org/wiki/Stooge sort>) on an array of integers. The function should return a sorted array.
+
+The Stooge Sort algorithm is as follows:
+
+<pre><b>algorithm</b> stoogesort(<b>array</b> L, i = 0, j = <b>length</b>(L)-1)
+  <b>if</b> L[j] &#x3C; L[i] <b>then</b>
+    L[i] <b>↔</b> L[j]
+  <b>if</b> j - i > 1 <b>then</b>
+    t <b>:=</b> (j - i + 1)/3
+    stoogesort(L, i , j-t)
+    stoogesort(L, i+t, j )
+    stoogesort(L, i , j-t)
+  <b>return</b> L
+</pre>
+
+# --hints--
+
+`stoogeSort` should be a function.
+
+```js
+assert(typeof stoogeSort == 'function');
+```
+
+`stoogeSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(stoogeSort([25, 32, 12, 7, 20])));
+```
+
+`stoogeSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(stoogeSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`stoogeSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(stoogeSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`stoogeSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(stoogeSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`stoogeSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(stoogeSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`stoogeSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(stoogeSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function stoogeSort(arr) {
+
+}
+```
+
+# --solutions--
+
+```js
+function stoogeSort(arr) {
+  function stoogeSortRecurse(array, i, j) {
+    if (j === undefined) {
+      j = array.length - 1;
+    }
+
+    if (i === undefined) {
+      i = 0;
+    }
+
+    if (array[j] < array[i]) {
+      var aux = array[i];
+      array[i] = array[j];
+      array[j] = aux;
+    }
+
+    if (j - i > 1) {
+      var t = Math.floor((j - i + 1) / 3);
+      stoogeSortRecurse(array, i, j - t);
+      stoogeSortRecurse(array, i + t, j);
+      stoogeSortRecurse(array, i, j - t);
+    }
+  }
+  stoogeSortRecurse(arr);
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
new file mode 100644
index 0000000000..a603bbab95
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sorting-algorithms-strand-sort.md
@@ -0,0 +1,118 @@
+---
+id: 5a23c84252665b21eecc8013
+title: Sorting algorithms/Strand sort
+challengeType: 5
+forumTopicId: 302319
+dashedName: sorting-algorithmsstrand-sort
+---
+
+# --description--
+
+Write a function to sort an array using the [Strand sort](<https://en.wikipedia.org/wiki/Strand sort>). The function should return the sorted array.
+
+This is a way of sorting numbers by extracting shorter sequences of already sorted numbers from an unsorted list.
+
+# --hints--
+
+`strandSort` should be a function.
+
+```js
+assert(typeof strandSort == 'function');
+```
+
+`strandSort([25, 32, 12, 7, 20])` should return an array.
+
+```js
+assert(Array.isArray(strandSort([25, 32, 12, 7, 20])));
+```
+
+`strandSort([25, 32, 12, 7, 20])` should return `[7, 12, 20, 25, 32]`.
+
+```js
+assert.deepEqual(strandSort([25, 32, 12, 7, 20]), [7, 12, 20, 25, 32]);
+```
+
+`strandSort([38, 45, 35, 8, 13])` should return `[8, 13, 35, 38, 45]`.
+
+```js
+assert.deepEqual(strandSort([38, 45, 35, 8, 13]), [8, 13, 35, 38, 45]);
+```
+
+`strandSort([43, 36, 20, 34, 24])` should return `[20, 24, 34, 36, 43]`.
+
+```js
+assert.deepEqual(strandSort([43, 36, 20, 34, 24]), [20, 24, 34, 36, 43]);
+```
+
+`strandSort([12, 33, 26, 18, 1, 16, 38])` should return `[1, 12, 16, 18, 26, 33, 38]`.
+
+```js
+assert.deepEqual(strandSort([12, 33, 26, 18, 1, 16, 38]), [
+  1,
+  12,
+  16,
+  18,
+  26,
+  33,
+  38
+]);
+```
+
+`strandSort([3, 39, 48, 16, 1, 4, 29])` should return `[1, 3, 4, 16, 29, 39, 48]`.
+
+```js
+assert.deepEqual(strandSort([3, 39, 48, 16, 1, 4, 29]), [
+  1,
+  3,
+  4,
+  16,
+  29,
+  39,
+  48
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function strandSort(list) {
+
+}
+```
+
+# --solutions--
+
+```js
+function strandSort(list) {
+  function merge(left, right) {
+    var result = [];
+    while (left.length != 0 && right.length != 0) {
+      if (left[0] <= right[0]) result.push(left.shift());
+      else result.push(right.shift());
+    }
+    result.push.apply(result, left);
+    result.push.apply(result, right);
+    return result;
+  }
+
+  if (list.length <= 1) return list;
+  var result = [];
+  while (list.length > 0) {
+    var sorted = [];
+    sorted.push(list.shift());
+    var len = list.length;
+    for (var i = 1; i < len; i++) {
+      var elem = list[i];
+      if (sorted[i - 1] <= elem) {
+        sorted.push(elem);
+        sorted.splice(i, 1);
+      }
+    }
+
+    result = merge(result, sorted);
+  }
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/soundex.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/soundex.md
new file mode 100644
index 0000000000..b7574b3837
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/soundex.md
@@ -0,0 +1,151 @@
+---
+id: 5a23c84252665b21eecc8017
+title: Soundex
+challengeType: 5
+forumTopicId: 302320
+dashedName: soundex
+---
+
+# --description--
+
+Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+
+<ul>
+  <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
+  <li>If "H" or "W" separate two consonants that have the same soundex code, the consonant to the right of the vowel is not coded. Example: Ashcraft is coded A-261 (A, 2 for the S, C ignored, 6 for the R, 1 for the F). It is not coded A-226.</li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a string as a parameter and returns the encoded string.
+
+# --hints--
+
+`soundex` should be a function.
+
+```js
+assert(typeof soundex == 'function');
+```
+
+`soundex("Soundex")` should return a string.
+
+```js
+assert(typeof soundex('Soundex') == 'string');
+```
+
+`soundex("Soundex")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Soundex'), 'S532');
+```
+
+`soundex("Example")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Example'), 'E251');
+```
+
+`soundex("Sownteks")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Sownteks'), 'S532');
+```
+
+`soundex("Ekzampul")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Ekzampul'), 'E251');
+```
+
+`soundex("Euler")` should return `"E460"`.
+
+```js
+assert.equal(soundex('Euler'), 'E460');
+```
+
+`soundex("Gauss")` should return `"G200"`.
+
+```js
+assert.equal(soundex('Gauss'), 'G200');
+```
+
+`soundex("Hilbert")` should return `"H416"`.
+
+```js
+assert.equal(soundex('Hilbert'), 'H416');
+```
+
+`soundex("Knuth")` should return `"K530"`.
+
+```js
+assert.equal(soundex('Knuth'), 'K530');
+```
+
+`soundex("Lloyd")` should return `"L300"`.
+
+```js
+assert.equal(soundex('Lloyd'), 'L300');
+```
+
+`soundex("Lukasiewicz")` should return `"L222"`.
+
+```js
+assert.equal(soundex('Lukasiewicz'), 'L222');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function soundex(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function soundex(s) {
+  var a = s.toLowerCase().split('');
+  var f = a.shift(),
+    r = '',
+    codes = {
+      a: '',
+      e: '',
+      i: '',
+      o: '',
+      u: '',
+      b: 1,
+      f: 1,
+      p: 1,
+      v: 1,
+      c: 2,
+      g: 2,
+      j: 2,
+      k: 2,
+      q: 2,
+      s: 2,
+      x: 2,
+      z: 2,
+      d: 3,
+      t: 3,
+      l: 4,
+      m: 5,
+      n: 5,
+      r: 6
+    };
+  r =
+    f +
+    a
+      .map(function(v, i, a) {
+        return codes[v];
+      })
+      .filter(function(v, i, a) {
+        return i === 0 ? v !== codes[f] : v !== a[i - 1];
+      })
+      .join('');
+
+  return (r + '000').slice(0, 4).toUpperCase();
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/spiral-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
new file mode 100644
index 0000000000..14da95f5a2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/spiral-matrix.md
@@ -0,0 +1,109 @@
+---
+id: 5a23c84252665b21eecc801c
+title: Spiral matrix
+challengeType: 5
+forumTopicId: 302321
+dashedName: spiral-matrix
+---
+
+# --description--
+
+Produce a spiral array. A *spiral array* is a square arrangement of the first N<sup>2</sup> natural numbers, where the numbers increase sequentially as you go around the edges of the array spiraling inwards. For example, given **5**, produce this array:
+
+<pre>
+0  1  2  3  4
+15 16 17 18 5
+14 23 24 19 6
+13 22 21 20 7
+12 11 10  9 8
+</pre>
+
+# --hints--
+
+`spiralArray` should be a function.
+
+```js
+assert(typeof spiralArray == 'function');
+```
+
+`spiralArray(3)` should return an array.
+
+```js
+assert(Array.isArray(spiralArray(3)));
+```
+
+`spiralArray(3)` should return `[[0, 1, 2],[7, 8, 3],[6, 5, 4]]`.
+
+```js
+assert.deepEqual(spiralArray(3), [
+  [0, 1, 2],
+  [7, 8, 3],
+  [6, 5, 4]
+]);
+```
+
+`spiralArray(4)` should return `[[0, 1, 2, 3],[11, 12, 13, 4],[10, 15, 14, 5],[9, 8, 7, 6]]`.
+
+```js
+assert.deepEqual(spiralArray(4), [
+  [0, 1, 2, 3],
+  [11, 12, 13, 4],
+  [10, 15, 14, 5],
+  [9, 8, 7, 6]
+]);
+```
+
+`spiralArray(5)` should return `[[0, 1, 2, 3, 4],[15, 16, 17, 18, 5],[14, 23, 24, 19, 6],[13, 22, 21, 20, 7],[12, 11, 10, 9, 8]]`.
+
+```js
+assert.deepEqual(spiralArray(5), [
+  [0, 1, 2, 3, 4],
+  [15, 16, 17, 18, 5],
+  [14, 23, 24, 19, 6],
+  [13, 22, 21, 20, 7],
+  [12, 11, 10, 9, 8]
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function spiralArray(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function spiralArray(n) {
+  var arr = Array(n),
+    x = 0,
+    y = n,
+    total = n * n--,
+    dx = 1,
+    dy = 0,
+    i = 0,
+    j = 0;
+  while (y) arr[--y] = [];
+  while (i < total) {
+    arr[y][x] = i++;
+    x += dx;
+    y += dy;
+    if (++j == n) {
+      if (dy < 0) {
+        x++;
+        y++;
+        n -= 2;
+      }
+      j = dx;
+      dx = -dy;
+      dy = j;
+      j = 0;
+    }
+  }
+  return arr;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
new file mode 100644
index 0000000000..4bb28fba9a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/split-a-character-string-based-on-change-of-character.md
@@ -0,0 +1,145 @@
+---
+id: 5a23c84252665b21eecc801d
+title: Split a character string based on change of character
+challengeType: 5
+forumTopicId: 302322
+dashedName: split-a-character-string-based-on-change-of-character
+---
+
+# --description--
+
+Split a (character) string into comma (plus a blank) delimited strings based on a change of character (left to right). Blanks should be treated as any other character (except they are problematic to display clearly). The same applies to commas. For instance, the string:
+
+<pre>
+"gHHH5YY++///\\"
+</pre>
+
+should be split as:
+
+<pre>
+["g", "HHH", "5", "YY", "++", "///", "\\" ];
+</pre>
+
+# --hints--
+
+`split` should be a function.
+
+```js
+assert(typeof split == 'function');
+```
+
+`split("hello")` should return an array.
+
+```js
+assert(Array.isArray(split('hello')));
+```
+
+`split("hello")` should return `["h", "e", "ll", "o"]`.
+
+```js
+assert.deepEqual(split('hello'), ['h', 'e', 'll', 'o']);
+```
+
+`split("commission")` should return `["c", "o", "mm", "i", "ss", "i", "o", "n"]`.
+
+```js
+assert.deepEqual(split('commission'), [
+  'c',
+  'o',
+  'mm',
+  'i',
+  'ss',
+  'i',
+  'o',
+  'n'
+]);
+```
+
+`split("ssss----====llloooo")` should return `["ssss", "----", "====", "lll", "oooo"]`.
+
+```js
+assert.deepEqual(split('ssss----====llloooo'), [
+  'ssss',
+  '----',
+  '====',
+  'lll',
+  'oooo'
+]);
+```
+
+`split("sssmmmaaammmaaat")` should return `["sss", "mmm", "aaa", "mmm", "aaa", "t"]`.
+
+```js
+assert.deepEqual(split('sssmmmaaammmaaat'), [
+  'sss',
+  'mmm',
+  'aaa',
+  'mmm',
+  'aaa',
+  't'
+]);
+```
+
+`split("gHHH5YY++///\\")` should return `["g", "HHH", "5", "YY", "++", "///", "\\"]`.
+
+```js
+assert.deepEqual(split('gHHH5YY++///\\'), [
+  'g',
+  'HHH',
+  '5',
+  'YY',
+  '++',
+  '///',
+  '\\'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function split(str) {
+
+}
+```
+
+# --solutions--
+
+```js
+function split(str) {
+  const concat = xs =>
+    xs.length > 0
+      ? (() => {
+          const unit = typeof xs[0] === 'string' ? '' : [];
+          return unit.concat.apply(unit, xs);
+        })()
+      : [];
+
+  const group = xs => groupBy((a, b) => a === b, xs);
+
+  const groupBy = (f, xs) => {
+    const dct = xs.slice(1).reduce(
+      (a, x) => {
+        const h = a.active.length > 0 ? a.active[0] : undefined,
+          blnGroup = h !== undefined && f(h, x);
+        return {
+          active: blnGroup ? a.active.concat([x]) : [x],
+          sofar: blnGroup ? a.sofar : a.sofar.concat([a.active])
+        };
+      },
+      {
+        active: xs.length > 0 ? [xs[0]] : [],
+        sofar: []
+      }
+    );
+    return dct.sofar.concat(dct.active.length > 0 ? [dct.active] : []);
+  };
+
+  const map = (f, xs) => xs.map(f);
+
+  const stringChars = s => s.split('');
+
+  return map(concat, group(stringChars(str)));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
new file mode 100644
index 0000000000..d22ef19220
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/state-name-puzzle.md
@@ -0,0 +1,159 @@
+---
+id: 5a23c84252665b21eecc8024
+title: State name puzzle
+challengeType: 5
+forumTopicId: 302323
+dashedName: state-name-puzzle
+---
+
+# --description--
+
+This task is inspired by Mark Nelson's DDJ Column "Wordplay" and one of the weekly puzzle challenges from Will Shortz on NPR Weekend Edition [\[1\]](https://www.npr.org/templates/story/story.php?storyId=9264290) and originally attributed to David Edelheit. The challenge was to take the names of two U.S. States, mix them all together, then rearrange the letters to form the names of two *different* U.S. States (so that all four state names differ from one another). What states are these? The problem was reissued on [the Unicon Discussion Web](https://tapestry.tucson.az.us/twiki/bin/view/Main/StateNamesPuzzle) which includes several solutions with analysis. Several techniques may be helpful and you may wish to refer to [Gödel numbering](https://en.wikipedia.org/wiki/Goedel_numbering), [equivalence relations](https://en.wikipedia.org/wiki/Equivalence_relation), and [equivalence classes](https://en.wikipedia.org/wiki/Equivalence_classes). The basic merits of these were discussed in the Unicon Discussion Web. A second challenge in the form of a set of fictitious new states was also presented.
+
+# --instructions--
+
+Write a function to solve the challenge for the given array of names of states. The function should return an array. Each element should be an object in this form: `{"from":[],"to":[]}`. The "from" array should contain the original names and the "to" array should contain the resultant names.
+
+# --hints--
+
+`solve` should be a function.
+
+```js
+assert(typeof solve == 'function');
+```
+
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    solve([
+      'New Mexico',
+      'New York',
+      'North Carolina ',
+      'North Dakota',
+      'Ohio',
+      'Oklahoma',
+      'Oregon',
+      'Pennsylvania',
+      'Rhode Island',
+      'South Carolina',
+      'South Dakota'
+    ])
+  )
+);
+```
+
+`solve(["New Mexico", "New York", "North Carolina ", "North Dakota", "Ohio", "Oklahoma", "Oregon", "Pennsylvania", "Rhode Island", "South Carolina", "South Dakota"])` should return `[{ from: ["North Carolina ", "South Dakota"], to: ["North Dakota", "South Carolina"] }]`.
+
+```js
+assert.deepEqual(
+  solve([
+    'New Mexico',
+    'New York',
+    'North Carolina ',
+    'North Dakota',
+    'Ohio',
+    'Oklahoma',
+    'Oregon',
+    'Pennsylvania',
+    'Rhode Island',
+    'South Carolina',
+    'South Dakota'
+  ]),
+  [
+    {
+      from: ['North Carolina ', 'South Dakota'],
+      to: ['North Dakota', 'South Carolina']
+    }
+  ]
+);
+```
+
+`solve(["New York", "New Kory", "Wen Kory", "York New", "Kory New", "New Kory"])` should return `[{ from: ["New Kory", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "New York"], to: ["Kory New", "Wen Kory"] }, { from: ["New Kory", "New York"], to: ["Kory New", "York New"] }, { from: ["New York", "Wen Kory"], to: ["New Kory", "York New"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "New Kory"] }, { from: ["New York", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New York", "York New"], to: ["New Kory", "Wen Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "New Kory"] }, { from: ["New York", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "Wen Kory"] }, { from: ["Kory New", "New York"], to: ["New Kory", "York New"] }, { from: ["Kory New", "New York"], to: ["Wen Kory", "York New"] }, { from: ["New Kory", "Wen Kory"], to: ["Kory New", "York New"] }, { from: ["New Kory", "York New"], to: ["Kory New", "Wen Kory"] }, { from: ["Kory New", "New Kory"], to: ["Wen Kory", "York New"] }]`.
+
+```js
+assert.deepEqual(
+  solve([
+    'New York',
+    'New Kory',
+    'Wen Kory',
+    'York New',
+    'Kory New',
+    'New Kory'
+  ]),
+  [
+    { from: ['New Kory', 'New York'], to: ['Wen Kory', 'York New'] },
+    { from: ['New Kory', 'New York'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['New Kory', 'New York'], to: ['Kory New', 'York New'] },
+    { from: ['New York', 'Wen Kory'], to: ['New Kory', 'York New'] },
+    { from: ['New York', 'Wen Kory'], to: ['Kory New', 'New Kory'] },
+    { from: ['New York', 'Wen Kory'], to: ['Kory New', 'York New'] },
+    { from: ['New York', 'York New'], to: ['New Kory', 'Wen Kory'] },
+    { from: ['New York', 'York New'], to: ['Kory New', 'New Kory'] },
+    { from: ['New York', 'York New'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['Kory New', 'New York'], to: ['New Kory', 'Wen Kory'] },
+    { from: ['Kory New', 'New York'], to: ['New Kory', 'York New'] },
+    { from: ['Kory New', 'New York'], to: ['Wen Kory', 'York New'] },
+    { from: ['New Kory', 'Wen Kory'], to: ['Kory New', 'York New'] },
+    { from: ['New Kory', 'York New'], to: ['Kory New', 'Wen Kory'] },
+    { from: ['Kory New', 'New Kory'], to: ['Wen Kory', 'York New'] }
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function solve(input) {
+
+}
+```
+
+# --solutions--
+
+```js
+function solve(input) {
+  var orig = {};
+  input.forEach(function(e) {
+    orig[__helpers.removeWhiteSpace(e).toLowerCase()] = e;
+  });
+
+  input = Object.keys(orig);
+  var map = {};
+  for (var i = 0; i < input.length - 1; i++) {
+    var pair0 = input[i];
+    for (var j = i + 1; j < input.length; j++) {
+      var pair = [pair0, input[j]];
+      var s = pair0 + pair[1];
+      var key = s.split('').sort();
+
+      var val = map[key] ? map[key] : [];
+      val.push(pair);
+      map[key] = val;
+    }
+  }
+
+  var result = [];
+  Object.keys(map).forEach(key => {
+    for (var i = 0; i < map[key].length - 1; i++) {
+      var a = map[key][i];
+      for (var j = i + 1; j < map[key].length; j++) {
+        var b = map[key][j];
+
+        if (new Set([a[0], b[0], a[1], b[1]]).size < 4) continue;
+        var from = [orig[a[0]], orig[a[1]]].sort();
+        var to = [orig[b[0]], orig[b[1]]].sort();
+        result.push({
+          from,
+          to
+        });
+      }
+    }
+  });
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
new file mode 100644
index 0000000000..219db4002c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -0,0 +1,114 @@
+---
+id: 5a23c84252665b21eecc8028
+title: Stern-Brocot sequence
+challengeType: 5
+forumTopicId: 302324
+dashedName: stern-brocot-sequence
+---
+
+# --description--
+
+For this task, the Stern-Brocot sequence is to be generated by an algorithm similar to that employed in generating the [Fibonacci sequence](<https://rosettacode.org/wiki/Fibonacci sequence>).
+
+<ol>
+  <li>The first and second members of the sequence are both 1:</li>
+    <ul><li>1, 1</li></ul>
+  <li>Start by considering the second member of the sequence</li>
+  <li>Sum the considered member of the sequence and its precedent, (1 + 1) = 2, and append it to the end of the
+    sequence:</li>
+    <ul><li>1, 1, 2</li></ul>
+  <li>Append the considered member of the sequence to the end of the sequence:</li>
+    <ul><li>1, 1, 2, 1</li></ul>
+  <li>Consider the next member of the series, (the third member i.e. 2)</li>
+  <li>GOTO 3 </li>
+    <ul>
+      <li></li>
+      <li> ─── Expanding another loop we get: ───</li>
+      <li></li>
+    </ul>
+  <li>Sum the considered member of the sequence and its precedent, (2 + 1) = 3, and append it to the end of the
+    sequence:</li>
+    <ul><li>1, 1, 2, 1, 3</li></ul>
+  <li>Append the considered member of the sequence to the end of the sequence:</li>
+    <ul><li>1, 1, 2, 1, 3, 2</li></ul>
+  <li>Consider the next member of the series, (the fourth member i.e. 1)</li>
+</ol>
+
+# --instructions--
+
+Create a function that returns the position in the Stern-Brocot sequence at which $ n $ is first encountered, where the sequence is generated with the method outlined above. Note that this sequence uses 1 based indexing.
+
+# --hints--
+
+`sternBrocot` should be a function.
+
+```js
+assert(typeof sternBrocot == 'function');
+```
+
+`sternBrocot(2)` should return a number.
+
+```js
+assert(typeof sternBrocot(2) == 'number');
+```
+
+`sternBrocot(2)` should return `3`.
+
+```js
+assert.equal(sternBrocot(2), 3);
+```
+
+`sternBrocot(3)` should return `5`.
+
+```js
+assert.equal(sternBrocot(3), 5);
+```
+
+`sternBrocot(5)` should return `11`.
+
+```js
+assert.equal(sternBrocot(5), 11);
+```
+
+`sternBrocot(7)` should return `19`.
+
+```js
+assert.equal(sternBrocot(7), 19);
+```
+
+`sternBrocot(10)` should return `39`.
+
+```js
+assert.equal(sternBrocot(10), 39);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sternBrocot(num) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sternBrocot(num) {
+  function f(n) {
+    return n < 2
+      ? n
+      : n & 1
+      ? f(Math.floor(n / 2)) + f(Math.floor(n / 2 + 1))
+      : f(Math.floor(n / 2));
+  }
+
+  function gcd(a, b) {
+    return a ? (a < b ? gcd(b % a, a) : gcd(a % b, b)) : b;
+  }
+  var n;
+  for (n = 1; f(n) != num; n++);
+  return n;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
new file mode 100644
index 0000000000..e89ca872e6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/straddling-checkerboard.md
@@ -0,0 +1,186 @@
+---
+id: 5a23c84252665b21eecc8029
+title: Straddling checkerboard
+challengeType: 5
+forumTopicId: 302325
+dashedName: straddling-checkerboard
+---
+
+# --description--
+
+Implement functions to encrypt and decrypt a message using the [straddling checkerboard](https://en.wikipedia.org/wiki/Straddling_checkerboard) method. The functions will take a string and an array as parameters. The array has 3 strings representing the 3 rows of the checkerboard. The output will be a series of decimal digits. Numbers should be encrypted by inserting the escape character before each digit, then including the digit unencrypted. This should be reversed for decryption.
+
+# --hints--
+
+`straddle` should be a function.
+
+```js
+assert(typeof straddle == 'function');
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
+
+```js
+assert(
+  typeof straddle(
+    'One night-it was on the twentieth of March, 1888-I was returning.',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ) == 'string'
+);
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning.",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"34045747525284613427502840425027537379697175891898898898584619028294547488"`.
+
+```js
+assert.equal(
+  straddle(
+    'One night-it was on the twentieth of March, 1888-I was returning.',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ),
+  '34045747525284613427502840425027537379697175891898898898584619028294547488'
+);
+```
+
+`straddle("One night-it was on the twentieth of March, 1888-I was returning",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"139539363509369743061399059745399365901344308320791798798798367430685972839363935"`.
+
+```js
+assert.equal(
+  straddle('One night-it was on the twentieth of March, 1888-I was returning', [
+    'HOL MES RT',
+    'ABCDFGIJKN',
+    'PQUVWXYZ./'
+  ]),
+  '139539363509369743061399059745399365901344308320791798798798367430685972839363935'
+);
+```
+
+`straddle("Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769"`.
+
+```js
+assert.equal(
+  straddle('Thecheckerboardcakerecipespecifies3largeeggsand2.25cupsofflour.', [
+    'ET AON RIS',
+    'BCDFGHJKLM',
+    'PQ/UVWXYZ.'
+  ]),
+  '125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769'
+);
+```
+
+`unstraddle` should be a function.
+
+```js
+assert(typeof unstraddle == 'function');
+```
+
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return a string.
+
+```js
+assert(
+  typeof unstraddle(
+    '34045747525284613427502840425027537379697175891898898898584619028294547488',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ) == 'string'
+);
+```
+
+`unstraddle("34045747525284613427502840425027537379697175891898898898584619028294547488",["ESTONIA  R", "BCDFGHJKLM", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING."`.
+
+```js
+assert.equal(
+  unstraddle(
+    '34045747525284613427502840425027537379697175891898898898584619028294547488',
+    ['ESTONIA  R', 'BCDFGHJKLM', 'PQUVWXYZ./']
+  ),
+  'ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING.'
+);
+```
+
+`unstraddle("139539363509369743061399059745399365901344308320791798798798367430685972839363935",["HOL MES RT", "ABCDFGIJKN", "PQUVWXYZ./"])` should return `"ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING"`.
+
+```js
+assert.equal(
+  unstraddle(
+    '139539363509369743061399059745399365901344308320791798798798367430685972839363935',
+    ['HOL MES RT', 'ABCDFGIJKN', 'PQUVWXYZ./']
+  ),
+  'ONENIGHTITWASONTHETWENTIETHOFMARCH1888IWASRETURNING'
+);
+```
+
+`unstraddle("125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769",["ET AON RIS", "BCDFGHJKLM", "PQ/UVWXYZ."])` should return `"THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR."`.
+
+```js
+assert.equal(
+  unstraddle(
+    '125021250212707204372221327070218600960021823809623283724002424935226226962262521636094232328463769',
+    ['ET AON RIS', 'BCDFGHJKLM', 'PQ/UVWXYZ.']
+  ),
+  'THECHECKERBOARDCAKERECIPESPECIFIES3LARGEEGGSAND2.25CUPSOFFLOUR.'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function straddle(message, alphabet) {
+
+}
+
+function unstraddle(message, alphabet) {
+
+}
+```
+
+# --solutions--
+
+```js
+function straddle(message, alphabet) {
+  var prefixes = new Array(
+    '',
+    alphabet[0].indexOf(' '),
+    alphabet[0].lastIndexOf(' ')
+  );
+
+  var out = '';
+  message = message.toUpperCase();
+  message = message.replace(/([0-9])/g, '/$1'); // dumb way to escape numbers
+  for (var i = 0; i < message.length; i++) {
+    var chr = message[i];
+    if (chr == ' ') continue;
+    for (var j = 0; j < 3; j++) {
+      var k = alphabet[j].indexOf(chr);
+      if (k < 0) continue;
+      out += prefixes[j].toString() + k;
+    }
+    if (chr == '/') out += message[++i];
+  }
+  return out;
+}
+function unstraddle(message, alphabet) {
+  var prefixes = new Array(
+    '',
+    alphabet[0].indexOf(' '),
+    alphabet[0].lastIndexOf(' ')
+  );
+  var out = '';
+  var n, o;
+  for (var i = 0; i < message.length; i++) {
+    n = message[i] * 1;
+    switch (n) {
+      case prefixes[1]:
+        o = alphabet[1][message[++i]];
+        break;
+      case prefixes[2]:
+        o = alphabet[2][message[++i]];
+        break;
+      default:
+        o = alphabet[0][n];
+    }
+    o == '/' ? (out += message[++i]) : (out += o);
+  }
+  return out;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stream-merge.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stream-merge.md
new file mode 100644
index 0000000000..234158bb50
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/stream-merge.md
@@ -0,0 +1,140 @@
+---
+id: 5a23c84252665b21eecc802a
+title: Stream Merge
+challengeType: 5
+forumTopicId: 302326
+dashedName: stream-merge
+---
+
+# --description--
+
+Write a function that takes multiple sorted arrays of items, and returns one array of sorted items.
+
+# --hints--
+
+`mergeLists` should be a function.
+
+```js
+assert(typeof mergeLists == 'function');
+```
+
+`mergeLists([[1, 3, 5, 9, 10], [2, 4, 6, 7, 8]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    mergeLists([
+      [1, 3, 5, 9, 10],
+      [2, 4, 6, 7, 8]
+    ])
+  )
+);
+```
+
+`mergeLists([[1, 3, 5, 9, 10], [2, 4, 6, 7, 8]])` should return `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 3, 5, 9, 10],
+    [2, 4, 6, 7, 8]
+  ]),
+  [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+);
+```
+
+`mergeLists([[1, 4, 7, 10], [2, 5, 8, 11], [3, 6, 9, 12]])` should return `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 4, 7, 10],
+    [2, 5, 8, 11],
+    [3, 6, 9, 12]
+  ]),
+  [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
+);
+```
+
+`mergeLists([[1, 3, 9, 14, 15, 17, 28], [7, 8, 14, 14, 23, 26, 28, 29, 30], [9, 23, 25, 29]])` should return `[1, 3, 7, 8, 9, 9, 14, 14, 14, 15, 17, 23, 23, 25, 26, 28, 28, 29, 29, 30]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 3, 9, 14, 15, 17, 28],
+    [7, 8, 14, 14, 23, 26, 28, 29, 30],
+    [9, 23, 25, 29]
+  ]),
+  [1, 3, 7, 8, 9, 9, 14, 14, 14, 15, 17, 23, 23, 25, 26, 28, 28, 29, 29, 30]
+);
+```
+
+`mergeLists([[3, 14, 15], [2, 17, 18], [], [2, 3, 5, 7]])` should return `[2, 2, 3, 3, 5, 7, 14, 15, 17, 18]`.
+
+```js
+assert.deepEqual(mergeLists([[3, 14, 15], [2, 17, 18], [], [2, 3, 5, 7]]), [
+  2,
+  2,
+  3,
+  3,
+  5,
+  7,
+  14,
+  15,
+  17,
+  18
+]);
+```
+
+`mergeLists([[1, 19, 1999], [17, 33, 2999, 3000], [8, 500, 3999]])` should return `[1, 8, 17, 19, 33, 500, 1999, 2999, 3000, 3999]`.
+
+```js
+assert.deepEqual(
+  mergeLists([
+    [1, 19, 1999],
+    [17, 33, 2999, 3000],
+    [8, 500, 3999]
+  ]),
+  [1, 8, 17, 19, 33, 500, 1999, 2999, 3000, 3999]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function mergeLists(lists) {
+
+}
+```
+
+# --solutions--
+
+```js
+function mergeLists(lists) {
+  function merge(l1, l2) {
+    var result = [],
+      i = 0,
+      j = 0;
+    while (l1.length && l2.length) {
+      if (l1[i] <= l2[j]) {
+        result.push(l1.shift());
+      } else {
+        result.push(l2.shift());
+      }
+    }
+
+    result.push.apply(result, l1);
+    result.push.apply(result, l2);
+    return result;
+  }
+
+  var result = lists[0];
+  for (var i = 1; i < lists.length; i++) {
+    result = merge(result, lists[i]);
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
new file mode 100644
index 0000000000..317f9dd7b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/strip-control-codes-and-extended-characters-from-a-string.md
@@ -0,0 +1,80 @@
+---
+id: 5a23c84252665b21eecc8036
+title: Strip control codes and extended characters from a string
+challengeType: 5
+forumTopicId: 302327
+dashedName: strip-control-codes-and-extended-characters-from-a-string
+---
+
+# --description--
+
+The task is to strip control codes and extended characters from a string. The solution should demonstrate how to achieve each of the following results: A string with control codes and extended characters stripped. In ASCII, the control codes have decimal codes 0 through to 31 and 127. On an ASCII based system, if the control codes are stripped, the resultant string would have all of its characters within the range of 32 to 126 decimal on the ASCII table. On a non-ASCII based system, we consider characters that do not have a corresponding glyph on the ASCII table (within the ASCII range of 32 to 126 decimal) to be an extended character for the purpose of this task.
+
+# --hints--
+
+`strip` should be a function.
+
+```js
+assert(typeof strip == 'function');
+```
+
+`strip("abc")` should return a string.
+
+```js
+assert(typeof strip('abc') == 'string');
+```
+
+`strip("\ba\x00b\n\rc\fd\xc3")` should return `"abcd"`.
+
+```js
+assert.equal(strip('\ba\x00b\n\rc\fd\xc3'), 'abcd');
+```
+
+`strip("\u0000\n abc\u00E9def\u007F")` should return `" abcdef"`.
+
+```js
+assert.equal(strip('\u0000\n abc\u00E9def\u007F'), ' abcdef');
+```
+
+`strip("a\n\tb\u2102d\u2147f")` should return `"abdf"`.
+
+```js
+assert.equal(strip('a\n\tb\u2102d\u2147f'), 'abdf');
+```
+
+`strip("Français.")` should return `"Franais."`.
+
+```js
+assert.equal(strip('Français.'), 'Franais.');
+```
+
+`strip("123\tabc\u0007DEF\u007F+-*/€æŧðłþ")` should return `"123abcDEF+-*/"`.
+
+```js
+assert.equal(strip('123\tabc\u0007DEF\u007F+-*/€æŧðłþ'), '123abcDEF+-*/');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function strip(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function strip(s) {
+  return s
+    .split('')
+    .filter(function(x) {
+      var n = x.charCodeAt(0);
+
+      return 31 < n && 127 > n;
+    })
+    .join('');
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/subleq.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/subleq.md
new file mode 100644
index 0000000000..d302bb9f99
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/subleq.md
@@ -0,0 +1,196 @@
+---
+id: 5a23c84252665b21eecc8038
+title: Subleq
+challengeType: 5
+forumTopicId: 302328
+dashedName: subleq
+---
+
+# --description--
+
+[Subleq](https://rosettacode.org/wiki/eso:Subleq) is an example of a [One-Instruction Set Computer (OISC)](https://en.wikipedia.org/wiki/One_instruction_set_computer).
+
+It is named after its only instruction, which is **SU**btract and **B**ranch if **L**ess than or **EQ**ual
+
+to zero.
+
+Your task is to create an interpreter which emulates such a machine.
+
+The machine's memory consists of an array of signed integers. Any reasonable word size is fine, but the memory must be
+
+able to hold negative as well as positive numbers.
+
+Execution begins with the instruction pointer aimed at the first word, which is address 0. It proceeds as follows:
+
+<ol>
+  <li>Let A, B, and C be the value stored in the three consecutive words in memory starting at the instruction pointer.</li>
+  <li>Advance the instruction pointer 3 words to point at the address after the one containing C.</li>
+  <li>If A is -1, then a character is read from standard input and its code point stored in the address given by B. C
+    is unused.</li>
+  <li>If B is -1, then the number contained in the address given by A is interpreted as a code point and the
+    corresponding character output. C is again unused.</li>
+  <li>Otherwise, both A and B are treated as the addresses of memory locations. The number contained in the address
+    given by A is subtracted from the number at the address given by B (and the result stored back in address B). If
+    the result is zero or negative, the value C becomes the new instruction pointer.</li>
+  <li>If the instruction pointer becomes negative, execution halts.</li>
+</ol>
+
+Other negative addresses besides -1 may be treated as equivalent to -1, or generate an error, as you see fit.
+
+Your solution should accept a program to execute on the machine, separately from the input fed to the program itself.
+
+This program should be in raw subleq "machine code" - whitespace-separated decimal numbers, with no symbolic names or
+
+other assembly-level extensions, to be loaded into memory starting at address 0. Show the output of your solution when
+
+fed this "Hello, world!" program. (Note that the example assumes ASCII or a superset of it, such as any of the Latin-N
+
+character sets or Unicode. You may translate it into another character set if your implementation is on a
+
+non-ASCiI-compatible environment.)
+
+<pre>15 17 -1 17 -1 -1 16 1 -1 16 3 -1 15 15 0 0 -1 72 101 108 108 111 44 32 119 111 114 108 100 33 10 0</pre>
+
+Which corresponds to something like this in a hypothetical assembler language:
+
+<pre>start:
+    zero, message, -1
+    message, -1, -1
+    neg1, start+1, -1
+    neg1, start+3, -1
+    zero, zero, start
+zero: 0
+neg1: -1
+message: "Hello, world!\n\0"
+</pre>
+
+# --instructions--
+
+Write a function that takes an array of integers as a parameter. This represents the memory elements. The function
+
+should interpret the sequence and return the output string. For this task, assume that there is no standard input.
+
+# --hints--
+
+`Subleq` should be a function.
+
+```js
+assert(typeof Subleq == 'function');
+```
+
+`Subleq([15, 17, -1, 17, -1, -1, 16, 1, -1, 16, 3, -1, 15, 15, 0, 0, -1, 72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33, 0])` should return a string.
+
+```js
+assert(
+  typeof Subleq([
+    15,
+    17,
+    -1,
+    17,
+    -1,
+    -1,
+    16,
+    1,
+    -1,
+    16,
+    3,
+    -1,
+    15,
+    15,
+    0,
+    0,
+    -1,
+    72,
+    101,
+    108,
+    108,
+    111,
+    44,
+    32,
+    119,
+    111,
+    114,
+    108,
+    100,
+    33,
+    0
+  ]) == 'string'
+);
+```
+
+`Subleq([15, 17, -1, 17, -1, -1, 16, 1, -1, 16, 3, -1, 15, 15, 0, 0, -1, 72, 101, 108, 108, 111, 44, 32, 119, 111, 114, 108, 100, 33, 0])` should return `"Hello, world!"`.
+
+```js
+assert.equal(
+  Subleq([
+    15,
+    17,
+    -1,
+    17,
+    -1,
+    -1,
+    16,
+    1,
+    -1,
+    16,
+    3,
+    -1,
+    15,
+    15,
+    0,
+    0,
+    -1,
+    72,
+    101,
+    108,
+    108,
+    111,
+    44,
+    32,
+    119,
+    111,
+    114,
+    108,
+    100,
+    33,
+    0
+  ]),
+  'Hello, world!'
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function Subleq(mem) {
+
+}
+```
+
+# --solutions--
+
+```js
+function Subleq(mem) {
+  var out = '';
+  var instructionPointer = 0;
+  do {
+    var a = mem[instructionPointer];
+    var b = mem[instructionPointer + 1];
+    if (a === -1) {
+    } else if (b === -1) {
+      out += String.fromCharCode(mem[a]);
+    } else {
+      mem[b] -= mem[a];
+      if (mem[b] < 1) {
+        instructionPointer = mem[instructionPointer + 2];
+        continue;
+      }
+    }
+    instructionPointer += 3;
+  } while (instructionPointer >= 0);
+
+  return out;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sudoku.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sudoku.md
new file mode 100644
index 0000000000..e0f6864a89
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sudoku.md
@@ -0,0 +1,321 @@
+---
+id: 5a23c84252665b21eecc803c
+title: Sudoku
+challengeType: 5
+forumTopicId: 302329
+dashedName: sudoku
+---
+
+# --description--
+
+Write a function to solve a partially filled-in normal 9x9 [Sudoku](https://en.wikipedia.org/wiki/Sudoku) grid and return the result. The blank fields are represented by `-1`. [Algorithmics of Sudoku](https://en.wikipedia.org/wiki/Algorithmics_of_sudoku) may help implement this.
+
+# --hints--
+
+`solveSudoku` should be a function.
+
+```js
+assert(typeof solveSudoku == 'function');
+```
+
+`solveSudoku([[8, 1, 9, -1, -1, 5, -1, -1, -1],[-1, -1, 2, -1, -1, -1, 7, 5, -1],[-1, 3, 7, 1, -1, 4, -1, 6, -1],[4, -1, -1, 5, 9, -1, 1, -1, -1],[7, -1, -1, 3, -1, 8, -1, -1, 2],[-1, -1, 3, -1, 6, 2, -1, -1, 7],[-1, 5, -1, 7, -1, 9, 2, 1, -1],[-1, 6, 4, -1, -1, -1, 9, -1, -1],[-1, -1, -1, 2, -1, -1, 4, 3, 8]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    solveSudoku([
+      [8, 1, 9, -1, -1, 5, -1, -1, -1],
+      [-1, -1, 2, -1, -1, -1, 7, 5, -1],
+      [-1, 3, 7, 1, -1, 4, -1, 6, -1],
+      [4, -1, -1, 5, 9, -1, 1, -1, -1],
+      [7, -1, -1, 3, -1, 8, -1, -1, 2],
+      [-1, -1, 3, -1, 6, 2, -1, -1, 7],
+      [-1, 5, -1, 7, -1, 9, 2, 1, -1],
+      [-1, 6, 4, -1, -1, -1, 9, -1, -1],
+      [-1, -1, -1, 2, -1, -1, 4, 3, 8]
+    ])
+  )
+);
+```
+
+`solveSudoku([[8, 1, 9, -1, -1, 5, -1, -1, -1],[-1, -1, 2, -1, -1, -1, 7, 5, -1],[-1, 3, 7, 1, -1, 4, -1, 6, -1],[4, -1, -1, 5, 9, -1, 1, -1, -1],[7, -1, -1, 3, -1, 8, -1, -1, 2],[-1, -1, 3, -1, 6, 2, -1, -1, 7],[-1, 5, -1, 7, -1, 9, 2, 1, -1],[-1, 6, 4, -1, -1, -1, 9, -1, -1],[-1, -1, -1, 2, -1, -1, 4, 3, 8]])` should return `[[8, 1, 9, 6, 7, 5, 3, 2, 4],[6, 4, 2, 9, 8, 3, 7, 5, 1],[5, 3, 7, 1, 2, 4, 8, 6, 9],[4, 2, 6, 5, 9, 7, 1, 8, 3],[7, 9, 5, 3, 1, 8, 6, 4, 2],[1, 8, 3, 4, 6, 2, 5, 9, 7],[3, 5, 8, 7, 4, 9, 2, 1, 6],[2, 6, 4, 8, 3, 1, 9, 7, 5],[9, 7, 1, 2, 5, 6, 4, 3, 8]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [8, 1, 9, -1, -1, 5, -1, -1, -1],
+    [-1, -1, 2, -1, -1, -1, 7, 5, -1],
+    [-1, 3, 7, 1, -1, 4, -1, 6, -1],
+    [4, -1, -1, 5, 9, -1, 1, -1, -1],
+    [7, -1, -1, 3, -1, 8, -1, -1, 2],
+    [-1, -1, 3, -1, 6, 2, -1, -1, 7],
+    [-1, 5, -1, 7, -1, 9, 2, 1, -1],
+    [-1, 6, 4, -1, -1, -1, 9, -1, -1],
+    [-1, -1, -1, 2, -1, -1, 4, 3, 8]
+  ]),
+  [
+    [8, 1, 9, 6, 7, 5, 3, 2, 4],
+    [6, 4, 2, 9, 8, 3, 7, 5, 1],
+    [5, 3, 7, 1, 2, 4, 8, 6, 9],
+    [4, 2, 6, 5, 9, 7, 1, 8, 3],
+    [7, 9, 5, 3, 1, 8, 6, 4, 2],
+    [1, 8, 3, 4, 6, 2, 5, 9, 7],
+    [3, 5, 8, 7, 4, 9, 2, 1, 6],
+    [2, 6, 4, 8, 3, 1, 9, 7, 5],
+    [9, 7, 1, 2, 5, 6, 4, 3, 8]
+  ]
+);
+```
+
+`solveSudoku([[5, 3, -1, -1, 2, 4, 7, -1, -1],[-1, -1, 2, -1, -1, -1, 8, -1, -1],[1, -1, -1, 7, -1, 3, 9, -1, 2],[-1, -1, 8, -1, 7, 2, -1, 4, 9],[-1, 2, -1, 9, 8, -1, -1, 7, -1],[7, 9, -1, -1, -1, -1, -1, 8, -1],[-1, -1, -1, -1, 3, -1, 5, -1, 6],[9, 6, -1, -1, 1, -1, 3, -1, -1],[-1, 5, -1, 6, 9, -1, -1, 1, -1]])` should return `[[5, 3, 9, 8, 2, 4, 7, 6, 1],[6, 7, 2, 1, 5, 9, 8, 3, 4],[1, 8, 4, 7, 6, 3, 9, 5, 2],[3, 1, 8, 5, 7, 2, 6, 4, 9],[4, 2, 5, 9, 8, 6, 1, 7, 3],[7, 9, 6, 3, 4, 1, 2, 8, 5],[8, 4, 1, 2, 3, 7, 5, 9, 6],[9, 6, 7, 4, 1, 5, 3, 2, 8],[2, 5, 3, 6, 9, 8, 4, 1, 7]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [5, 3, -1, -1, 2, 4, 7, -1, -1],
+    [-1, -1, 2, -1, -1, -1, 8, -1, -1],
+    [1, -1, -1, 7, -1, 3, 9, -1, 2],
+    [-1, -1, 8, -1, 7, 2, -1, 4, 9],
+    [-1, 2, -1, 9, 8, -1, -1, 7, -1],
+    [7, 9, -1, -1, -1, -1, -1, 8, -1],
+    [-1, -1, -1, -1, 3, -1, 5, -1, 6],
+    [9, 6, -1, -1, 1, -1, 3, -1, -1],
+    [-1, 5, -1, 6, 9, -1, -1, 1, -1]
+  ]),
+  [
+    [5, 3, 9, 8, 2, 4, 7, 6, 1],
+    [6, 7, 2, 1, 5, 9, 8, 3, 4],
+    [1, 8, 4, 7, 6, 3, 9, 5, 2],
+    [3, 1, 8, 5, 7, 2, 6, 4, 9],
+    [4, 2, 5, 9, 8, 6, 1, 7, 3],
+    [7, 9, 6, 3, 4, 1, 2, 8, 5],
+    [8, 4, 1, 2, 3, 7, 5, 9, 6],
+    [9, 6, 7, 4, 1, 5, 3, 2, 8],
+    [2, 5, 3, 6, 9, 8, 4, 1, 7]
+  ]
+);
+```
+
+`solveSudoku([[-1, -1, 3, -1, 2, -1, 6, -1, -1],[9, -1, -1, 3, -1, 5, -1, -1, 1],[-1, -1, 1, 8, -1, 6, 4, -1, -1],[-1, -1, 8, 1, -1, 2, 9, -1, -1],[7, -1, -1, -1, -1, -1, -1, -1, 8],[-1, -1, 6, 7, -1, 8, 2, -1, -1],[-1, -1, 2, 6, -1, 9, 5, -1, -1],[8, -1, -1, 2, -1, 3, -1, -1, 9],[-1, -1, 5, -1, 1, -1, 3, -1, -1]])` should return `[[4, 8, 3, 9, 2, 1, 6, 5, 7],[9, 6, 7, 3, 4, 5, 8, 2, 1],[2, 5, 1, 8, 7, 6, 4, 9, 3],[5, 4, 8, 1, 3, 2, 9, 7, 6],[7, 2, 9, 5, 6, 4, 1, 3, 8],[1, 3, 6, 7, 9, 8, 2, 4, 5],[3, 7, 2, 6, 8, 9, 5, 1, 4],[8, 1, 4, 2, 5, 3, 7, 6, 9],[6, 9, 5, 4, 1, 7, 3, 8, 2]]`.
+
+```js
+assert.deepEqual(
+  solveSudoku([
+    [-1, -1, 3, -1, 2, -1, 6, -1, -1],
+    [9, -1, -1, 3, -1, 5, -1, -1, 1],
+    [-1, -1, 1, 8, -1, 6, 4, -1, -1],
+    [-1, -1, 8, 1, -1, 2, 9, -1, -1],
+    [7, -1, -1, -1, -1, -1, -1, -1, 8],
+    [-1, -1, 6, 7, -1, 8, 2, -1, -1],
+    [-1, -1, 2, 6, -1, 9, 5, -1, -1],
+    [8, -1, -1, 2, -1, 3, -1, -1, 9],
+    [-1, -1, 5, -1, 1, -1, 3, -1, -1]
+  ]),
+  [
+    [4, 8, 3, 9, 2, 1, 6, 5, 7],
+    [9, 6, 7, 3, 4, 5, 8, 2, 1],
+    [2, 5, 1, 8, 7, 6, 4, 9, 3],
+    [5, 4, 8, 1, 3, 2, 9, 7, 6],
+    [7, 2, 9, 5, 6, 4, 1, 3, 8],
+    [1, 3, 6, 7, 9, 8, 2, 4, 5],
+    [3, 7, 2, 6, 8, 9, 5, 1, 4],
+    [8, 1, 4, 2, 5, 3, 7, 6, 9],
+    [6, 9, 5, 4, 1, 7, 3, 8, 2]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function solveSudoku(puzzle) {
+
+}
+```
+
+# --solutions--
+
+```js
+function solveSudoku(puzzle) {
+  var solution;
+
+  class DoX {
+    constructor(V, H) {
+      this.V = V;
+      this.L = this;
+      this.R = this;
+      this.U = this;
+      this.D = this;
+      this.S = 1;
+      this.H = H || this;
+      H && (H.S += 1);
+    }
+  }
+
+  const addRight = (e, n) => {
+    n.R = e.R;
+    n.L = e;
+    e.R.L = n;
+    return (e.R = n);
+  };
+
+  const addBelow = (e, n) => {
+    n.D = e.D;
+    n.U = e;
+    e.D.U = n;
+    return (e.D = n);
+  };
+
+  const search = function(h, s) {
+    if (h.R == h) {
+      printSol(s);
+    } else {
+      let c = chooseColumn(h);
+      cover(c);
+      for (let r = c.D; r != c; r = r.D) {
+        s.push(r);
+        for (let j = r.R; r != j; j = j.R) {
+          cover(j.H);
+        }
+        search(h, s);
+        r = s.pop();
+        for (let j = r.R; j != r; j = j.R) {
+          uncover(j.H);
+        }
+      }
+      uncover(c);
+    }
+  };
+
+  const chooseColumn = h => {
+    let s = Number.POSITIVE_INFINITY;
+    let c = h;
+    for (let j = h.R; j != h; j = j.R) {
+      if (j.S < s) {
+        c = j;
+        s = j.S;
+      }
+    }
+    return c;
+  };
+
+  const cover = c => {
+    c.L.R = c.R;
+    c.R.L = c.L;
+    for (let i = c.D; i != c; i = i.D) {
+      for (let j = i.R; j != i; j = j.R) {
+        j.U.D = j.D;
+        j.D.U = j.U;
+        j.H.S = j.H.S - 1;
+      }
+    }
+  };
+
+  const uncover = c => {
+    for (let i = c.U; i != c; i = i.U) {
+      for (let j = i.L; i != j; j = j.L) {
+        j.H.S = j.H.S + 1;
+        j.U.D = j;
+        j.D.U = j;
+      }
+    }
+    c.L.R = c;
+    c.R.L = c;
+  };
+
+  const printSol = a => {
+    solution = a.reduce((p, c) => {
+      let [i, v] = c.V.split(':');
+      p[i * 1] = v;
+      return p;
+    }, new Array(a.length).fill('.'));
+  };
+
+  const gridMeta = s => {
+    const g = s.split('');
+    const cellCount = g.length;
+    const tokenCount = Math.sqrt(cellCount);
+    const N = Math.sqrt(tokenCount);
+    const g2D = g.map(e =>
+      isNaN(e * 1)
+        ? new Array(tokenCount).fill(1).map((_, i) => i + 1)
+        : [e * 1]
+    );
+    return [cellCount, N, tokenCount, g2D];
+  };
+
+  const indexesN = n => i => {
+    let c = Math.floor(i / (n * n));
+    i %= n * n;
+    return [c, i, Math.floor(c / n) * n + Math.floor(i / n)];
+  };
+
+  const reduceGrid = puzString => {
+    const [
+      numCells, // The total number of cells in a grid (81 for a 9x9 grid)
+      N, // the 'n' value of the grid. (3 for a 9x9 grid)
+      U, // The total number of unique tokens to be placed.
+      g2D // A 2D array representation of the grid, with each element
+      // being an array of candidates for a cell. Known cells are
+      // single element arrays.
+    ] = gridMeta(puzString);
+
+    const getIndex = indexesN(N);
+
+    const headRow = new Array(4 * numCells)
+      .fill('')
+      .map((_, i) => new DoX(`H${i}`));
+
+    let H = new DoX('ROOT');
+    headRow.reduce((p, c) => addRight(p, c), H);
+
+    for (let i = 0; i < numCells; i++) {
+      const [ri, ci, bi] = getIndex(i);
+      g2D[i].forEach(num => {
+        let id = `${i}:${num}`;
+        let candIdx = num - 1;
+
+        // The 4 columns that we will populate.
+        const A = headRow[i];
+        const B = headRow[numCells + candIdx + ri * U];
+        const C = headRow[numCells * 2 + candIdx + ci * U];
+        const D = headRow[numCells * 3 + candIdx + bi * U];
+
+        // The Row-Column Constraint
+        let rcc = addBelow(A.U, new DoX(id, A));
+
+        // The Row-Number Constraint
+        let rnc = addBelow(B.U, addRight(rcc, new DoX(id, B)));
+
+        // The Column-Number Constraint
+        let cnc = addBelow(C.U, addRight(rnc, new DoX(id, C)));
+
+        // The Block-Number Constraint
+        addBelow(D.U, addRight(cnc, new DoX(id, D)));
+      });
+    }
+    search(H, []);
+  };
+
+  var stringPuzzle = '';
+
+  for (var i = 0; i < puzzle.length; i++) {
+    puzzle[i].forEach(function(e) {
+      if (e == -1) stringPuzzle += '.';
+      else stringPuzzle += e;
+    });
+  }
+
+  reduceGrid(stringPuzzle);
+
+  var result = [];
+
+  for (var i = 0; i < 9; i++) {
+    result.push(solution.slice(i * 9, (i + 1) * 9).map(e => parseInt(e)));
+  }
+
+  return result;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
new file mode 100644
index 0000000000..d13a1bdb03
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-digits-of-an-integer.md
@@ -0,0 +1,89 @@
+---
+id: 5a23c84252665b21eecc803f
+title: Sum digits of an integer
+challengeType: 5
+forumTopicId: 302331
+dashedName: sum-digits-of-an-integer
+---
+
+# --description--
+
+Write a function that takes a string as a parameter. This string represents a number that can be in any base (less than 37) and return the sum of its digits.
+
+<ul>
+  <li><b>1</b><sub>10</sub> sums to <b>1</b></li>
+  <li><b>1234</b><sub>10</sub> sums to <b>10</b></li>
+  <li><b>fe</b><sub>16</sub> sums to <b>29</b></li>
+  <li><b>f0e</b><sub>16</sub> sums to <b>29</b></li>
+</ul>
+
+# --hints--
+
+`sumDigits` should be a function.
+
+```js
+assert(typeof sumDigits == 'function');
+```
+
+`sumDigits("1")` should return a number.
+
+```js
+assert(typeof sumDigits('1') == 'number');
+```
+
+`sumDigits("1")` should return `1`.
+
+```js
+assert.equal(sumDigits('1'), 1);
+```
+
+`sumDigits("12345")` should return `15`.
+
+```js
+assert.equal(sumDigits('12345'), 15);
+```
+
+`sumDigits("254")` should return `11`.
+
+```js
+assert.equal(sumDigits('254'), 11);
+```
+
+`sumDigits("fe")` should return `29`.
+
+```js
+assert.equal(sumDigits('fe'), 29);
+```
+
+`sumDigits("f0e")` should return `29`.
+
+```js
+assert.equal(sumDigits('f0e'), 29);
+```
+
+`sumDigits("999ABCXYZ")` should return `162`.
+
+```js
+assert.equal(sumDigits('999ABCXYZ'), 162);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumDigits(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumDigits(n) {
+  n += '';
+  for (var s = 0, i = 0, e = n.length; i < e; i += 1)
+    s += parseInt(n.charAt(i), 36);
+  return s;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
new file mode 100644
index 0000000000..f92d5b9d21
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-multiples-of-3-and-5.md
@@ -0,0 +1,77 @@
+---
+id: 5a23c84252665b21eecc8040
+title: Sum multiples of 3 and 5
+challengeType: 5
+forumTopicId: 302332
+dashedName: sum-multiples-of-3-and-5
+---
+
+# --description--
+
+The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below *n*.
+
+# --hints--
+
+`sumMults` should be a function.
+
+```js
+assert(typeof sumMults == 'function');
+```
+
+`sumMults(10)` should return a number.
+
+```js
+assert(typeof sumMults(10) == 'number');
+```
+
+`sumMults(10)` should return `23`.
+
+```js
+assert.equal(sumMults(10), 23);
+```
+
+`sumMults(100)` should return `2318`.
+
+```js
+assert.equal(sumMults(100), 2318);
+```
+
+`sumMults(1000)` should return `233168`.
+
+```js
+assert.equal(sumMults(1000), 233168);
+```
+
+`sumMults(10000)` should return `23331668`.
+
+```js
+assert.equal(sumMults(10000), 23331668);
+```
+
+`sumMults(100000)` should return `2333316668`.
+
+```js
+assert.equal(sumMults(100000), 2333316668);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumMults(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumMults(n) {
+  var sum = 0;
+  for (var i = 1; i < n; i++) {
+    if (i % 3 == 0 || i % 5 == 0) sum += i;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
new file mode 100644
index 0000000000..3e7e0b4e4f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-a-series.md
@@ -0,0 +1,82 @@
+---
+id: 5a23c84252665b21eecc8041
+title: Sum of a series
+challengeType: 5
+forumTopicId: 302333
+dashedName: sum-of-a-series
+---
+
+# --description--
+
+Compute the **n**<sup>th</sup> term of a [series](<https://en.wikipedia.org/wiki/Series (mathematics)>), i.e. the sum of the **n** first terms of the corresponding [sequence](https://en.wikipedia.org/wiki/sequence). Informally this value, or its limit when **n** tends to infinity, is also called the *sum of the series*, thus the title of this task. For this task, use: $S_n = \displaystyle\sum_{k=1}^n \frac{1}{k^2}$.
+
+# --instructions--
+
+Write a function that take $a$ and $b$ as parameters and returns the sum of $a^{th}$ to $b^{th}$ members of the sequence.
+
+# --hints--
+
+`sum` should be a function.
+
+```js
+assert(typeof sum == 'function');
+```
+
+`sum(1, 100)` should return a number.
+
+```js
+assert(typeof sum(1, 100) == 'number');
+```
+
+`sum(1, 100)` should return `1.6349839001848923`.
+
+```js
+assert.equal(sum(1, 100), 1.6349839001848923);
+```
+
+`sum(33, 46)` should return `0.009262256361481223`.
+
+```js
+assert.equal(sum(33, 46), 0.009262256361481223);
+```
+
+`sum(21, 213)` should return `0.044086990748706555`.
+
+```js
+assert.equal(sum(21, 213), 0.044086990748706555);
+```
+
+`sum(11, 111)` should return `0.08619778593108679`.
+
+```js
+assert.equal(sum(11, 111), 0.08619778593108679);
+```
+
+`sum(1, 10)` should return `1.5497677311665408`.
+
+```js
+assert.equal(sum(1, 10), 1.5497677311665408);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sum(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sum(a, b) {
+  function fn(x) {
+    return 1 / (x * x);
+  }
+  var s = 0;
+  for (; a <= b; a++) s += fn(a);
+  return s;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-squares.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
new file mode 100644
index 0000000000..d211cbc165
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-of-squares.md
@@ -0,0 +1,79 @@
+---
+id: 5a23c84252665b21eecc8042
+title: Sum of squares
+challengeType: 5
+forumTopicId: 302334
+dashedName: sum-of-squares
+---
+
+# --description--
+
+Write a function to find the sum of squares of an array of integers.
+
+# --hints--
+
+`sumsq` should be a function.
+
+```js
+assert(typeof sumsq == 'function');
+```
+
+`sumsq([1, 2, 3, 4, 5])` should return a number.
+
+```js
+assert(typeof sumsq([1, 2, 3, 4, 5]) == 'number');
+```
+
+`sumsq([1, 2, 3, 4, 5])` should return `55`.
+
+```js
+assert.equal(sumsq([1, 2, 3, 4, 5]), 55);
+```
+
+`sumsq([25, 32, 12, 7, 20])` should return `2242`.
+
+```js
+assert.equal(sumsq([25, 32, 12, 7, 20]), 2242);
+```
+
+`sumsq([38, 45, 35, 8, 13])` should return `4927`.
+
+```js
+assert.equal(sumsq([38, 45, 35, 8, 13]), 4927);
+```
+
+`sumsq([43, 36, 20, 34, 24])` should return `5277`.
+
+```js
+assert.equal(sumsq([43, 36, 20, 34, 24]), 5277);
+```
+
+`sumsq([12, 33, 26, 18, 1, 16, 3])` should return `2499`.
+
+```js
+assert.equal(sumsq([12, 33, 26, 18, 1, 16, 3]), 2499);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumsq(array) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumsq(array) {
+  var sum = 0;
+  var i, iLen;
+
+  for (i = 0, iLen = array.length; i < iLen; i++) {
+    sum += array[i] * array[i];
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-to-100.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-to-100.md
new file mode 100644
index 0000000000..f30b422ba8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sum-to-100.md
@@ -0,0 +1,180 @@
+---
+id: 5a23c84252665b21eecc8043
+title: Sum to 100
+challengeType: 5
+forumTopicId: 302335
+dashedName: sum-to-100
+---
+
+# --description--
+
+Find solutions to the *sum to one hundred* puzzle.
+
+Add (insert) the mathematical operators **+** or **─** (plus or minus) before any of the digits in the decimal numeric string **123456789** such that the resulting mathematical expression adds up to a particular sum (in this iconic case, **100**).
+
+Example:
+
+<pre><b>123 + 4 - 5 + 67 - 89   =   100</b></pre>
+
+# --instructions--
+
+Write a function that takes a number as parameter. The function should return an array containing all solutions for the given number. The solutions should be strings representing the expressions. For example: "1+23-456+78-9". Sort the array before returning it.
+
+# --hints--
+
+`sumTo100` should be a function.
+
+```js
+assert(typeof sumTo100 == 'function');
+```
+
+`sumTo100(199)` should return an array.
+
+```js
+assert(Array.isArray(sumTo100(199)));
+```
+
+`sumTo100(199)` should return `["-1+2-3+45+67+89", "123-4+5+6+78-9", "123-4+56+7+8+9"]`.
+
+```js
+assert.deepEqual(sumTo100(199), [
+  '-1+2-3+45+67+89',
+  '123-4+5+6+78-9',
+  '123-4+56+7+8+9'
+]);
+```
+
+`sumTo100(209)` should return `["1+234+56+7-89"]`.
+
+```js
+assert.deepEqual(sumTo100(209), ['1+234+56+7-89']);
+```
+
+`sumTo100(243)` should return `["-1-234+567-89", "-12+345+6-7-89", "123+45+6+78-9"]`.
+
+```js
+assert.deepEqual(sumTo100(243), [
+  '-1-234+567-89',
+  '-12+345+6-7-89',
+  '123+45+6+78-9'
+]);
+```
+
+`sumTo100(197)` should return `["1-2-3+45+67+89", "12+34-5+67+89", "123+4-5+6+78-9"]`.
+
+```js
+assert.deepEqual(sumTo100(197), [
+  '1-2-3+45+67+89',
+  '12+34-5+67+89',
+  '123+4-5+6+78-9'
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function sumTo100(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function sumTo100(n) {
+  var permutationsWithRepetition = function(n, as) {
+    return as.length > 0
+      ? foldl1(curry(cartesianProduct)(as), replicate(n, as))
+      : [];
+  };
+
+  var cartesianProduct = function(xs, ys) {
+    return [].concat.apply(
+      [],
+      xs.map(function(x) {
+        return [].concat.apply(
+          [],
+          ys.map(function(y) {
+            return [[x].concat(y)];
+          })
+        );
+      })
+    );
+  };
+
+  var curry = function(f) {
+    return function(a) {
+      return function(b) {
+        return f(a, b);
+      };
+    };
+  };
+
+  var flip = function(f) {
+    return function(a, b) {
+      return f.apply(null, [b, a]);
+    };
+  };
+
+  var foldl1 = function(f, xs) {
+    return xs.length > 0 ? xs.slice(1).reduce(f, xs[0]) : [];
+  };
+
+  var replicate = function(n, a) {
+    var v = [a],
+      o = [];
+    if (n < 1) return o;
+    while (n > 1) {
+      if (n & 1) o = o.concat(v);
+      n >>= 1;
+      v = v.concat(v);
+    }
+    return o.concat(v);
+  };
+
+  var asSum = function(xs) {
+    var dct = xs.reduceRight(
+      function(a, sign, i) {
+        var d = i + 1; //  zero-based index to [1-9] positions
+        if (sign !== 0) {
+          // Sum increased, digits cleared
+          return {
+            digits: [],
+            n: a.n + sign * parseInt([d].concat(a.digits).join(''), 10)
+          };
+        } else
+          return {
+            // Digits extended, sum unchanged
+            digits: [d].concat(a.digits),
+            n: a.n
+          };
+      },
+      {
+        digits: [],
+        n: 0
+      }
+    );
+    return (
+      dct.n + (dct.digits.length > 0 ? parseInt(dct.digits.join(''), 10) : 0)
+    );
+  };
+
+  var asString = function(xs) {
+    var ns = xs.reduce(function(a, sign, i) {
+      var d = (i + 1).toString();
+      return sign === 0 ? a + d : a + (sign > 0 ? '+' : '-') + d;
+    }, '');
+
+    return ns[0] === '+' ? tail(ns) : ns;
+  };
+
+  var universe = permutationsWithRepetition(9, [0, 1, -1])
+    .filter(function(x) {
+      return x[0] !== 1 && asSum(x) === n;
+    })
+    .map(asString);
+  return universe.sort();
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
new file mode 100644
index 0000000000..c3b671bf5a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/sutherland-hodgman-polygon-clipping.md
@@ -0,0 +1,199 @@
+---
+id: 5a23c84252665b21eecc8045
+title: Sutherland-Hodgman polygon clipping
+challengeType: 5
+forumTopicId: 302336
+dashedName: sutherland-hodgman-polygon-clipping
+---
+
+# --description--
+
+The [Sutherland-Hodgman clipping algorithm](<https://en.wikipedia.org/wiki/Sutherland-Hodgman clipping algorithm>) finds the polygon that is the intersection between an arbitrary polygon (the "subject polygon") and a convex polygon (the "clip polygon"). It is used in computer graphics (especially 2D graphics) to reduce the complexity of a scene being displayed by eliminating parts of a polygon that do not need to be displayed. Take the closed polygon defined by the points:
+
+<pre>[(50, 150), (200, 50), (350, 150), (350, 300), (250, 300), (200, 250), (150, 350), (100, 250), (100, 200)]</pre>
+
+and clip it by the rectangle defined by the points:
+
+<pre>[(100, 100), (300, 100), (300, 300), (100, 300)]</pre>
+
+# --instructions--
+
+Write a function that takes 2 arrays as parameters. The first array contains the points of the subject polygon and the second array contains the points of the clipping polygon. The function should return an array containing the points of the clipped polygon. Each number should be rounded to 3 decimal places.
+
+# --hints--
+
+`clip` should be a function.
+
+```js
+assert(typeof clip == 'function');
+```
+
+`clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    clip(
+      [
+        [50, 150],
+        [200, 50],
+        [350, 150],
+        [350, 300],
+        [250, 300],
+        [200, 250],
+        [150, 350],
+        [100, 250],
+        [100, 200]
+      ],
+      [
+        [100, 100],
+        [300, 100],
+        [300, 300],
+        [100, 300]
+      ]
+    )
+  )
+);
+```
+
+`clip([[50, 150], [200, 50], [350, 150], [350, 300], [250, 300], [200, 250], [150, 350], [100, 250], [100, 200]], [[100, 100], [300, 100], [300, 300], [100, 300]])` should return `[[100, 116.667], [125, 100], [275, 100], [300, 116.667], [300, 300], [250, 300], [200, 250], [175, 300], [125, 300], [100, 250]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [50, 150],
+      [200, 50],
+      [350, 150],
+      [350, 300],
+      [250, 300],
+      [200, 250],
+      [150, 350],
+      [100, 250],
+      [100, 200]
+    ],
+    [
+      [100, 100],
+      [300, 100],
+      [300, 300],
+      [100, 300]
+    ]
+  ),
+  [
+    [100, 116.667],
+    [125, 100],
+    [275, 100],
+    [300, 116.667],
+    [300, 300],
+    [250, 300],
+    [200, 250],
+    [175, 300],
+    [125, 300],
+    [100, 250]
+  ]
+);
+```
+
+`clip([[150, 200], [400, 450], [30, 50]], [[10, 10], [300, 200], [400, 600], [100, 300]])` should return `[[150, 200], [350, 400], [348.611, 394.444], [30, 50]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [150, 200],
+      [400, 450],
+      [30, 50]
+    ],
+    [
+      [10, 10],
+      [300, 200],
+      [400, 600],
+      [100, 300]
+    ]
+  ),
+  [
+    [150, 200],
+    [350, 400],
+    [348.611, 394.444],
+    [30, 50]
+  ]
+);
+```
+
+`clip([[250, 200], [100, 450], [130, 250]], [[50, 60], [100, 230], [400, 600], [100, 300]])` should return `[[129.167, 329.167], [119.565, 319.565], [121.854, 304.305]]`.
+
+```js
+assert.deepEqual(
+  clip(
+    [
+      [250, 200],
+      [100, 450],
+      [130, 250]
+    ],
+    [
+      [50, 60],
+      [100, 230],
+      [400, 600],
+      [100, 300]
+    ]
+  ),
+  [
+    [129.167, 329.167],
+    [119.565, 319.565],
+    [121.854, 304.305]
+  ]
+);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function clip(subjectPolygon, clipPolygon) {
+
+}
+```
+
+# --solutions--
+
+```js
+function clip(subjectPolygon, clipPolygon) {
+  var cp1, cp2, s, e, i, j;
+  var inside = function(p) {
+    return (
+      (cp2[0] - cp1[0]) * (p[1] - cp1[1]) > (cp2[1] - cp1[1]) * (p[0] - cp1[0])
+    );
+  };
+  var intersection = function() {
+    var dc = [cp1[0] - cp2[0], cp1[1] - cp2[1]],
+      dp = [s[0] - e[0], s[1] - e[1]],
+      n1 = cp1[0] * cp2[1] - cp1[1] * cp2[0],
+      n2 = s[0] * e[1] - s[1] * e[0],
+      n3 = 1.0 / (dc[0] * dp[1] - dc[1] * dp[0]);
+    return [(n1 * dp[0] - n2 * dc[0]) * n3, (n1 * dp[1] - n2 * dc[1]) * n3];
+  };
+  var outputList = subjectPolygon;
+  cp1 = clipPolygon[clipPolygon.length - 1];
+  for (j in clipPolygon) {
+    var cp2 = clipPolygon[j];
+    var inputList = outputList;
+    outputList = [];
+    s = inputList[inputList.length - 1]; //last on the input list
+    for (i in inputList) {
+      var e = inputList[i];
+      if (inside(e)) {
+        if (!inside(s)) {
+          outputList.push(intersection());
+        }
+        outputList.push(e);
+      } else if (inside(s)) {
+        outputList.push(intersection());
+      }
+      s = e;
+    }
+    cp1 = cp2;
+  }
+  return outputList.map(e => e.map(f => Math.round(f * 1000) / 1000));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/symmetric-difference.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
new file mode 100644
index 0000000000..422cb77cc2
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/symmetric-difference.md
@@ -0,0 +1,121 @@
+---
+id: 5a23c84252665b21eecc8046
+title: Symmetric difference
+challengeType: 5
+forumTopicId: 16086
+dashedName: symmetric-difference
+---
+
+# --description--
+
+Given two [set](https://rosettacode.org/wiki/set)s *A* and *B*, compute $(A \\setminus B) \\cup (B \\setminus A).$ That is, enumerate the items that are in *A* or *B* but not both. This set is called the [symmetric difference](<https://en.wikipedia.org/wiki/Symmetric difference>) of *A* and *B*. In other words: $(A \\cup B) \\setminus (A \\cap B)$ (the set of items that are in at least one of *A* or *B* minus the set of items that are in both *A* and *B*).
+
+# --instructions--
+
+Write a function that takes two arrays as parameters and returns the symmetric difference. Sort the resultant array before returning it.
+
+# --hints--
+
+`symmetricDifference` should be a function.
+
+```js
+assert(typeof symmetricDifference == 'function');
+```
+
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return an array.
+
+```js
+assert(
+  Array.isArray(
+    symmetricDifference(
+      ['John', 'Bob', 'Mary', 'Serena'],
+      ['Jim', 'Mary', 'John', 'Bob']
+    )
+  )
+);
+```
+
+`symmetricDifference(["John", "Bob", "Mary", "Serena"], ["Jim", "Mary", "John", "Bob"])` should return `["Jim", "Serena"]`.
+
+```js
+assert.deepEqual(
+  symmetricDifference(
+    ['John', 'Bob', 'Mary', 'Serena'],
+    ['Jim', 'Mary', 'John', 'Bob']
+  ),
+  ['Jim', 'Serena']
+);
+```
+
+`symmetricDifference([1, 2, 3], [3, 4])` should return `[1, 2, 4]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 3], [3, 4]), [1, 2, 4]);
+```
+
+`symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7])` should return `[1, 2, 5, 7, 8]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 3, 4, 5], [3, 4, 8, 7]), [
+  1,
+  2,
+  5,
+  7,
+  8
+]);
+```
+
+`symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9])` should return `[2, 4, 9]`.
+
+```js
+assert.deepEqual(
+  symmetricDifference([1, 2, 3, 4, 5, 6, 7, 8], [1, 3, 5, 6, 7, 8, 9]),
+  [2, 4, 9]
+);
+```
+
+`symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9])` should return `[1, 3, 4, 8]`.
+
+```js
+assert.deepEqual(symmetricDifference([1, 2, 4, 7, 9], [2, 3, 7, 8, 9]), [
+  1,
+  3,
+  4,
+  8
+]);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function symmetricDifference(A, B) {
+
+}
+```
+
+# --solutions--
+
+```js
+function symmetricDifference(A, B) {
+  function relative_complement(A, B) {
+    return A.filter(function(elem) {
+      return B.indexOf(elem) == -1;
+    });
+  }
+
+  function unique(ary) {
+    var u = ary.concat().sort();
+    for (var i = 1; i < u.length; ) {
+      if (u[i - 1] === u[i]) u.splice(i, 1);
+      else i++;
+    }
+    return u;
+  }
+
+  return unique(
+    relative_complement(A, B).concat(relative_complement(B, A))
+  ).sort();
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
new file mode 100644
index 0000000000..54a2aa0e7f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/taxicab-numbers.md
@@ -0,0 +1,140 @@
+---
+id: 594ecc0d9a8cf816e3340187
+title: Taxicab numbers
+challengeType: 5
+forumTopicId: 302337
+dashedName: taxicab-numbers
+---
+
+# --description--
+
+A [taxicab number](<https://en.wikipedia.org/wiki/Hardy–Ramanujan number> "wp: Hardy–Ramanujan number") (the definition that is being used here) is a positive integer that can be expressed as the sum of two positive cubes in more than one way.
+
+The first taxicab number is `1729`, which is:
+
+1<sup>3</sup> + 12<sup>3</sup> and
+
+9<sup>3</sup> + 10<sup>3</sup>.
+
+Taxicab numbers are also known as:
+
+<ul>
+  <li>taxi numbers</li>
+  <li>taxi-cab numbers</li>
+  <li>taxi cab numbers</li>
+  <li>Hardy-Ramanujan numbers</li>
+</ul>
+
+# --instructions--
+
+Write a function that returns the lowest `n` taxicab numbers. For each of the taxicab numbers, show the number as well as its constituent cubes.
+
+**See also:**
+
+<ul>
+  <li><a href='https://oeis.org/A001235' target='_blank'>A001235 taxicab numbers</a> on The On-Line Encyclopedia of Integer Sequences.</li>
+  <li><a href='https://en.wikipedia.org/wiki/Taxicab_number' target='_blank'>taxicab number</a> on Wikipedia.</li>
+</ul>
+
+# --hints--
+
+`taxicabNumbers` should be a function.
+
+```js
+assert(typeof taxicabNumbers === 'function');
+```
+
+`taxicabNumbers` should return an array.
+
+```js
+assert(typeof taxicabNumbers(2) === 'object');
+```
+
+`taxicabNumbers` should return an array of numbers.
+
+```js
+assert(typeof taxicabNumbers(100)[0] === 'number');
+```
+
+`taxicabNumbers(4)` should return [1729, 4104, 13832, 20683].
+
+```js
+assert.deepEqual(taxicabNumbers(4), res4);
+```
+
+`taxicabNumbers(25)` should return [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]
+
+```js
+assert.deepEqual(taxicabNumbers(25), res25);
+```
+
+`taxicabNumbers(39)` resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].
+
+```js
+assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const res4 = [1729, 4104, 13832, 20683];
+const res25 = [
+  1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656,
+  110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763,
+  373464, 402597
+];
+
+const res39From20To29 = [314496, 320264, 327763, 373464, 402597, 439101, 443889, 513000, 513856];
+```
+
+## --seed-contents--
+
+```js
+function taxicabNumbers(n) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function taxicabNumbers(nNumbers) {
+  const cubeN = [];
+  const s3s = {};
+
+  const e = 100;
+  for (let n = 1; n < e; n += 1) {
+    cubeN[n] = n * n * n;
+  }
+
+  for (let a = 1; a < e - 1; a += 1) {
+    const a3 = cubeN[a];
+    for (let b = a; b < e; b += 1) {
+      const b3 = cubeN[b];
+      const s3 = a3 + b3;
+
+      let abs = s3s[s3];
+      if (!abs) {
+        s3s[s3] = abs = [];
+      }
+      abs.push([a, b]);
+    }
+  }
+
+  let i = 0;
+  const res = [];
+  Object.keys(s3s).forEach(s3 => {
+    const abs = s3s[s3];
+    if (abs.length >= 2) { // No two cube pairs found
+      i += 1;
+      if (i <= nNumbers) {
+        res.push(s3);
+      }
+    }
+  });
+  return res.map(item => parseInt(item, 10));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
new file mode 100644
index 0000000000..24a65a163e
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/tokenize-a-string-with-escaping.md
@@ -0,0 +1,124 @@
+---
+id: 594faaab4e2a8626833e9c3d
+title: Tokenize a string with escaping
+challengeType: 5
+forumTopicId: 302338
+dashedName: tokenize-a-string-with-escaping
+---
+
+# --description--
+
+Write a function or program that can split a string at each non-escaped occurrence of a separator character.
+
+It should accept three input parameters:
+
+<ul>
+  <li>The <strong>string</strong></li>
+  <li>The <strong>separator character</strong></li>
+  <li>The <strong>escape character</strong></li>
+</ul>
+
+It should output a list of strings.
+
+Rules for splitting:
+
+<ul>
+  <li>The fields that were separated by the separators, become the elements of the output list.</li>
+  <li>Empty fields should be preserved, even at the start and end.</li>
+</ul>
+
+Rules for escaping:
+
+<ul>
+  <li>"Escaped" means preceded by an occurrence of the escape character that is not already escaped itself.</li>
+  <li>When the escape character precedes a character that has no special meaning, it still counts as an escape (but does not do anything special).</li>
+  <li>Each occurrences of the escape character that was used to escape something, should not become part of the output.</li>
+</ul>
+
+Demonstrate that your function satisfies the following test-case:
+
+Given the string
+
+<pre>one^|uno||three^^^^|four^^^|^cuatro|</pre>
+
+and using `|` as a separator and `^` as escape character, your function should output the following array:
+
+<pre>  ['one|uno', '', 'three^^', 'four^|cuatro', '']
+</pre>
+
+# --hints--
+
+`tokenize` should be a function.
+
+```js
+assert(typeof tokenize === 'function');
+```
+
+`tokenize` should return an array.
+
+```js
+assert(typeof tokenize('a', 'b', 'c') === 'object');
+```
+
+`tokenize('one^|uno||three^^^^|four^^^|^cuatro|', '|', '^')` should return `['one|uno', '', 'three^^', 'four^|cuatro', '']`
+
+```js
+assert.deepEqual(tokenize(testStr1, '|', '^'), res1);
+```
+
+`tokenize('a@&bcd&ef&&@@hi', '&', '@')` should return `['a&bcd', 'ef', '', '@hi']`
+
+```js
+assert.deepEqual(tokenize(testStr2, '&', '@'), res2);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testStr1 = 'one^|uno||three^^^^|four^^^|^cuatro|';
+const res1 = ['one|uno', '', 'three^^', 'four^|cuatro', ''];
+
+// TODO add more tests
+const testStr2 = 'a@&bcd&ef&&@@hi';
+const res2 = ['a&bcd', 'ef', '', '@hi'];
+```
+
+## --seed-contents--
+
+```js
+function tokenize(str, sep, esc) {
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+// tokenize :: String -> Character -> Character -> [String]
+function tokenize(str, charDelim, charEsc) {
+  const dctParse = str.split('')
+    .reduce((a, x) => {
+      const blnEsc = a.esc;
+      const blnBreak = !blnEsc && x === charDelim;
+      const blnEscChar = !blnEsc && x === charEsc;
+
+      return {
+        esc: blnEscChar,
+        token: blnBreak ? '' : (
+          a.token + (blnEscChar ? '' : x)
+        ),
+        list: a.list.concat(blnBreak ? a.token : [])
+      };
+    }, {
+      esc: false,
+      token: '',
+      list: []
+    });
+
+  return dctParse.list.concat(
+    dctParse.token
+  );
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
new file mode 100644
index 0000000000..56cd284379
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/top-rank-per-group.md
@@ -0,0 +1,192 @@
+---
+id: 595011cba5a81735713873bd
+title: Top rank per group
+challengeType: 5
+forumTopicId: 302339
+dashedName: top-rank-per-group
+---
+
+# --description--
+
+Find the top `n` ranked data in each group, where `n` is provided as a parameter. Name of the rank and the group are also provided as parameter.
+
+Given the following data:
+
+```js
+testData1 = [
+  { name: 'Tyler Bennett', id: 'E10297', salary: 32000, dept: 'D101' },
+  { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050' },
+  { name: 'George Woltman', id: 'E00127', salary: 53500, dept: 'D101' },
+  { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' },
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D202' },
+  { name: 'David McClellan', id: 'E04242', salary: 41500, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D202' },
+  { name: 'Nathan Adams', id: 'E41298', salary: 21900, dept: 'D050' },
+  { name: 'Richard Potter', id: 'E43128', salary: 15900, dept: 'D101' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D202' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
+];
+```
+
+One could rank top 10 employees in each department by calling:
+
+```js
+topRankPerGroup(10, testData1, 'dept', 'salary')
+```
+
+Given the following data:
+
+```js
+testData2 = [
+  { name: 'Friday 13th', genre: 'horror', rating: 9.9 },
+  { name: "Nightmare on Elm's Street", genre: 'horror', rating: 5.7 },
+  { name: 'Titanic', genre: 'drama', rating: 7.3 },
+  { name: 'Maze Runner', genre: 'scifi', rating: 7.1 },
+  { name: 'Blade runner', genre: 'scifi', rating: 8.9 }
+];
+```
+
+One could rank the top-rated movie in each genre by calling:
+
+```js
+topRankPerGroup(1, testData2, 'genre', 'rating')
+```
+
+The function should return an array with an array for each group containing the top `n` objects.
+
+For example, given data:
+
+```js
+[
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D050' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D050' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D050' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D101' }
+];
+```
+
+Top two ranking employees in each department by salary would be:
+
+```js
+[ [ { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D050' },
+    { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D050' } ],
+  [ { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D101' },
+    { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D101' } ] ]
+```
+
+# --hints--
+
+`topRankPerGroup` should be a function.
+
+```js
+assert(typeof topRankPerGroup === 'function');
+```
+
+`topRankPerGroup` should return undefined on negative n values.
+
+```js
+assert(typeof topRankPerGroup(-1, []) === 'undefined');
+```
+
+For `topRankPerGroup(10, testData1, 'dept', 'salary')`, the first result in the first group should be `{ name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050'}`.
+
+```js
+assert.deepEqual(res1[0][0], { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050'});
+```
+
+For `topRankPerGroup(10, testData1, 'dept', 'salary')`, the last result in the last group should be `{ name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' }`.
+
+```js
+assert.deepEqual(res1[3][3], { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' });
+```
+
+`topRankPerGroup(1, ...)` should return only top ranking result per group.
+
+```js
+assert.equal(res2[2].length, 1);
+```
+
+`topRankPerGroup(2, ...)` should return two ranking results per group.
+
+```js
+assert.equal(res3[2][1].name, 'Maze Runner');
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const testData1 = [
+  { name: 'Tyler Bennett', id: 'E10297', salary: 32000, dept: 'D101' },
+  { name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050' },
+  { name: 'George Woltman', id: 'E00127', salary: 53500, dept: 'D101' },
+  { name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' },
+  { name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D202' },
+  { name: 'David McClellan', id: 'E04242', salary: 41500, dept: 'D101' },
+  { name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D202' },
+  { name: 'Nathan Adams', id: 'E41298', salary: 21900, dept: 'D050' },
+  { name: 'Richard Potter', id: 'E43128', salary: 15900, dept: 'D101' },
+  { name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D202' },
+  { name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
+  { name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
+  { name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
+];
+
+const res1 = topRankPerGroup(10, testData1, 'dept', 'salary');
+
+const testData2 = [
+  { name: 'Friday 13th', genre: 'horror', rating: 9.9 },
+  { name: "Nightmare on Elm's Street", genre: 'horror', rating: 5.7 },
+  { name: 'Titanic', genre: 'drama', rating: 7.3 },
+  { name: 'Maze Runner', genre: 'scifi', rating: 7.1 },
+  { name: 'Blade runner', genre: 'scifi', rating: 8.9 }
+];
+
+const res2 = topRankPerGroup(1, testData2, 'genre', 'rating');
+const res3 = topRankPerGroup(2, testData2, 'genre', 'rating');
+```
+
+## --seed-contents--
+
+```js
+function topRankPerGroup(n, data, groupName, rankName) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+const collectDept = function (arrOfObj, groupName) {
+  const collect = arrOfObj.reduce((rtnObj, obj) => {
+    if (rtnObj[obj[groupName]] === undefined) {
+      rtnObj[obj[groupName]] = [];
+    }
+    rtnObj[obj[groupName]].push(obj);
+    return rtnObj;
+  }, {} // initial value to reduce
+  );
+
+  return Object.keys(collect).sort().map(key => collect[key]);
+};
+
+const sortRank = function (arrOfRankArrs, rankName) {
+  return arrOfRankArrs.map(item => item.sort((a, b) => {
+    if (a[rankName] > b[rankName]) { return -1; }
+    if (a[rankName] < b[rankName]) { return 1; }
+    return 0;
+  }));
+};
+
+function topRankPerGroup(n, data, groupName, rankName) {
+  if (n < 0) { return; }
+  return sortRank(collectDept(data, groupName),
+    rankName).map(list => list.slice(0, n));
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/topological-sort.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/topological-sort.md
new file mode 100644
index 0000000000..f57d218e66
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/topological-sort.md
@@ -0,0 +1,185 @@
+---
+id: 594fa2746886f41f7d8bf225
+title: Topological sort
+challengeType: 5
+forumTopicId: 302340
+dashedName: topological-sort
+---
+
+# --description--
+
+Given a mapping between items, and items they depend on, a topological sort orders items so that no item precedes an item it depends upon. There are two popular algorithms for topological sorting: Kahn's (1962) topological sort and depth-first search.
+
+# --instructions--
+
+Write a function that will return a list with valid compile order of libraries from their dependencies.
+
+- Assume library names are single words.
+- Items mentioned as only dependents have no dependents of their own, but their order of compiling must be given.
+- Any self dependencies should be ignored.
+- Any un-orderable dependencies should be ignored.
+
+Use the following data as an example:
+
+<pre>
+LIBRARY          LIBRARY DEPENDENCIES
+=======          ====================
+des_system_lib   std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee
+dw01             ieee dw01 dware gtech
+dw02             ieee dw02 dware
+dw03             std synopsys dware dw03 dw02 dw01 ieee gtech
+dw04             dw04 ieee dw01 dware gtech
+dw05             dw05 ieee dware
+dw06             dw06 ieee dware
+dw07             ieee dware
+dware            ieee dware
+gtech            ieee gtech
+ramlib           std ieee
+std_cell_lib     ieee std_cell_lib
+synopsys
+</pre>
+
+The compiling of a library in the VHDL language has the constraint that a library must be compiled after any library it depends on. The above data would be un-orderable if, for example, `dw04` is added to the list of dependencies of `dw01`.
+
+The input of the function will be a multiline string, each line will consist of the name of the library, followed by its dependencies (if exist).
+
+For example:
+
+```js
+const libsSimple =
+  `aaa bbb
+  bbb`;
+```
+
+# --hints--
+
+`topologicalSort` should be a function.
+
+```js
+assert(typeof topologicalSort === 'function');
+```
+
+`topologicalSort(libsSimple)` should return an array.
+
+```js
+assert(Array.isArray(topologicalSort(libsSimple)));
+```
+
+`topologicalSort(libsSimple)` should return `['bbb', 'aaa']`.
+
+```js
+assert.deepEqual(topologicalSort(libsSimple), ['bbb', 'aaa']);
+```
+
+`topologicalSort(libsVHDL)` should return `['ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06', 'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys', 'dw03', 'des_system_lib']`.
+
+```js
+assert.deepEqual(topologicalSort(libsVHDL), ['ieee', 'std_cell_lib', 'gtech', 'dware', 'dw07', 'dw06', 'dw05', 'dw02', 'dw01', 'dw04', 'std', 'ramlib', 'synopsys', 'dw03', 'des_system_lib']);
+```
+
+`topologicalSort(libsCustom)` should return `['base', 'c', 'd', 'b', 'a']`.
+
+```js
+assert.deepEqual(topologicalSort(libsCustom), ['base', 'c', 'd', 'b', 'a']);
+```
+
+`topologicalSort` should ignore unorderable dependencies.
+
+```js
+assert.deepEqual(topologicalSort(libsUnorderable), ['Base']);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const libsSimple =
+  `aaa bbb
+  bbb`;
+
+const libsVHDL =
+  `des_system_lib   std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee
+  dw01             ieee dw01 dware gtech
+  dw02             ieee dw02 dware
+  dw03             std synopsys dware dw03 dw02 dw01 ieee gtech
+  dw04             dw04 ieee dw01 dware gtech
+  dw05             dw05 ieee dware
+  dw06             dw06 ieee dware
+  dw07             ieee dware
+  dware            ieee dware
+  gtech            ieee gtech
+  ramlib           std ieee
+  std_cell_lib     ieee std_cell_lib
+  synopsys`;
+
+const libsCustom =
+  `a b c d
+  b c d
+  d c
+  c base
+  base`;
+
+const libsUnorderable =
+  `TestLib Base MainLib
+  MainLib TestLib
+  Base`;
+```
+
+## --seed-contents--
+
+```js
+function topologicalSort(libs) {
+
+  return true;
+}
+```
+
+# --solutions--
+
+```js
+function topologicalSort(libs) {
+  // A map of the input data, with the keys as the packages, and the values as
+  // and array of packages on which it depends.
+  const D = libs
+    .split('\n')
+    .map(e => e.split(' ').filter(ep => ep !== ''))
+    .reduce((p, c) =>
+      p.set(c[0], c.filter((e, i) => (i > 0 && e !== c[0] ? e : null))), new Map());
+  [].concat(...D.values()).forEach(e => {
+    D.set(e, D.get(e) || []);
+  });
+
+  // The above map rotated so that it represents a DAG of the form
+  // Map {
+  //    A => [ A, B, C],
+  //    B => [C],
+  //    C => []
+  // }
+  // where each key represents a node, and the array contains the edges.
+  const G = [...D.keys()].reduce((p, c) =>
+    p.set(
+      c,
+      [...D.keys()].filter(e => D.get(e).includes(c))),
+    new Map()
+  );
+
+  // An array of leaf nodes; nodes with 0 in degrees.
+  const Q = [...D.keys()].filter(e => D.get(e).length === 0);
+
+  // The result array.
+  const S = [];
+  while (Q.length) {
+    const u = Q.pop();
+    S.push(u);
+    G.get(u).forEach(v => {
+      D.set(v, D.get(v).filter(e => e !== u));
+      if (D.get(v).length === 0) {
+        Q.push(v);
+      }
+    });
+  }
+
+  return S;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
new file mode 100644
index 0000000000..4de9c851ba
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/towers-of-hanoi.md
@@ -0,0 +1,87 @@
+---
+id: 5951ed8945deab770972ae56
+title: Towers of Hanoi
+challengeType: 5
+forumTopicId: 302341
+dashedName: towers-of-hanoi
+---
+
+# --description--
+
+Solve the [Towers of Hanoi](https://en.wikipedia.org/wiki/Towers_of_Hanoi "wp: Towers_of_Hanoi") problem.
+
+Your solution should accept the number of discs as the first parameters, and three string used to identify each of the three stacks of discs, for example `towerOfHanoi(4, 'A', 'B', 'C')`. The function should return an array of arrays containing the list of moves, source -> destination.
+
+For example, the array `[['A', 'C'], ['B', 'A']]` indicates that the 1st move was to move a disc from stack A to C, and the 2nd move was to move a disc from stack B to A.
+
+<p></p>
+
+# --hints--
+
+`towerOfHanoi` should be a function.
+
+```js
+assert(typeof towerOfHanoi === 'function');
+```
+
+`towerOfHanoi(3, ...)` should return 7 moves.
+
+```js
+assert(res3.length === 7);
+```
+
+`towerOfHanoi(3, 'A', 'B', 'C')` should return `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B']]`.
+
+```js
+assert.deepEqual(towerOfHanoi(3, 'A', 'B', 'C'), res3Moves);
+```
+
+`towerOfHanoi(5, "X", "Y", "Z")` 10th move should be Y -> X.
+
+```js
+assert.deepEqual(res5[9], ['Y', 'X']);
+```
+
+`towerOfHanoi(7, 'A', 'B', 'C')` first ten moves should be `[['A','B'], ['A','C'], ['B','C'], ['A','B'], ['C','A'], ['C','B'], ['A','B'], ['A','C'], ['B','C'], ['B','A']]`
+
+```js
+assert.deepEqual(towerOfHanoi(7, 'A', 'B', 'C').slice(0, 10), res7First10Moves);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const res3 = towerOfHanoi(3, 'A', 'B', 'C');
+const res3Moves = [['A', 'B'], ['A', 'C'], ['B', 'C'], ['A', 'B'], ['C', 'A'], ['C', 'B'], ['A', 'B']];
+const res5 = towerOfHanoi(5, 'X', 'Y', 'Z');
+const res7First10Moves = [['A', 'B'], ['A', 'C'], ['B', 'C'], ['A', 'B'], ['C', 'A'], ['C', 'B'], ['A', 'B'], ['A', 'C'], ['B', 'C'], ['B', 'A']];
+```
+
+## --seed-contents--
+
+```js
+function towerOfHanoi(n, a, b, c) {
+
+  return [[]];
+}
+```
+
+# --solutions--
+
+```js
+function towerOfHanoi(n, a, b, c) {
+  const res = [];
+  towerOfHanoiHelper(n, a, c, b, res);
+  return res;
+}
+
+function towerOfHanoiHelper(n, a, b, c, res) {
+  if (n > 0) {
+    towerOfHanoiHelper(n - 1, a, c, b, res);
+    res.push([a, c]);
+    towerOfHanoiHelper(n - 1, b, a, c, res);
+  }
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-cross-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
new file mode 100644
index 0000000000..4dab99b445
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-cross-product.md
@@ -0,0 +1,75 @@
+---
+id: 594810f028c0303b75339ad2
+title: Vector cross product
+challengeType: 5
+forumTopicId: 302342
+dashedName: vector-cross-product
+---
+
+# --description--
+
+A vector is defined as having three dimensions as being represented by an ordered collection of three numbers: (X, Y, Z).
+
+# --instructions--
+
+Write a function that takes two vectors (arrays) as input and computes their cross product. Your function should return `null` on invalid inputs such as vectors of different lengths.
+
+# --hints--
+
+`crossProduct` should be a function.
+
+```js
+assert.equal(typeof crossProduct, 'function');
+```
+
+`crossProduct()` should return null.
+
+```js
+assert.equal(crossProduct(), null);
+```
+
+`crossProduct([1, 2, 3], [4, 5, 6])` should return `[-3, 6, -3]`.
+
+```js
+assert.deepEqual(res12, exp12);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const tv1 = [1, 2, 3];
+const tv2 = [4, 5, 6];
+const res12 = crossProduct(tv1, tv2);
+const exp12 = [-3, 6, -3];
+```
+
+## --seed-contents--
+
+```js
+function crossProduct(a, b) {
+
+}
+```
+
+# --solutions--
+
+```js
+function crossProduct(a, b) {
+  if (!a || !b) {
+    return null;
+  }
+
+  // Check lengths
+  if (a.length !== 3 || b.length !== 3) {
+    return null;
+  }
+
+  return [
+    (a[1] * b[2]) - (a[2] * b[1]),
+    (a[2] * b[0]) - (a[0] * b[2]),
+    (a[0] * b[1]) - (a[1] * b[0])
+  ];
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-dot-product.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
new file mode 100644
index 0000000000..fb8ae242ae
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/vector-dot-product.md
@@ -0,0 +1,96 @@
+---
+id: 594810f028c0303b75339ad3
+title: Vector dot product
+challengeType: 5
+forumTopicId: 302343
+dashedName: vector-dot-product
+---
+
+# --description--
+
+A vector can have one or more values represented by an ordered collection. Examples could be (x), (x, y), or (x, y, z).
+
+# --instructions--
+
+Write a function that takes two vectors (represented as one-dimensional arrays) as input and computes their dot product. Your function should return `null` on invalid inputs such as vectors of different lengths or passing anything other than two vectors.
+
+# --hints--
+
+`dotProduct` should be a function.
+
+```js
+assert.equal(typeof dotProduct, 'function');
+```
+
+`dotProduct()` should return `null`.
+
+```js
+assert.equal(dotProduct(), null);
+```
+
+`dotProduct([1], [1])` should return `1`.
+
+```js
+assert.equal(dotProduct([1], [1]), 1);
+```
+
+`dotProduct([1], [1, 2])` should return `null`.
+
+```js
+assert.equal(dotProduct([1], [1, 2]), null);
+```
+
+`dotProduct([1, 3, -5], [4, -2, -1])` should return `3`.
+
+```js
+assert.equal(dotProduct([1, 3, -5], [4, -2, -1]), 3);
+```
+
+`dotProduct([3, 2, 1], [2, 4, 2], [5, 3, 1])` should return `null`.
+
+```js
+assert.equal(dotProduct([3, 2, 1], [2, 4, 2], [5, 3, 1]), null);
+```
+
+`dotProduct([ 0, 3, 6, 9, 12 ], [ 0, 4, 8, 12, 16 ])` should return `360`.
+
+```js
+assert.equal(dotProduct([ 0, 3, 6, 9, 12 ], [ 0, 4, 8, 12, 16 ]), 360);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function dotProduct(...vectors) {
+
+}
+```
+
+# --solutions--
+
+```js
+function dotProduct(...vectors) {
+  if (!vectors || !vectors.length || vectors.length > 2 || vectors[0].length !== vectors[1].length) {
+    return null;
+  }
+  const vectorLen = vectors[0].length;
+
+  let prod = 0;
+  let sum = 0;
+  let j = vectorLen;
+  let i = 2;
+  // Sum terms
+  while (j--) {
+    i = 2;
+    prod = 1;
+
+    while (i--) {
+      prod *= vectors[i][j];
+    }
+    sum += prod;
+  }
+  return sum;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-frequency.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-frequency.md
new file mode 100644
index 0000000000..70d2d054dc
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-frequency.md
@@ -0,0 +1,136 @@
+---
+id: 5e94a54cc7b022105bf0fd2c
+title: Word frequency
+challengeType: 5
+forumTopicId: 393913
+dashedName: word-frequency
+---
+
+# --description--
+
+Given a text string and an integer n, return the n most common words in the file (and the number of their occurrences) in decreasing frequency.
+
+# --instructions--
+
+Write a function to count the occurrences of each word and return the n most commons words along with the number of their occurences in decreasing frequency.
+
+The function should return a 2D array with each of the elements in the following form: `[word, freq]`. `word` should be the lowercase version of the word and `freq` the number denoting the count.
+
+The function should return an empty array, if no string is provided.
+
+The function should be case insensitive, for example, the strings "Hello" and "hello" should be treated the same.
+
+You can treat words that have special characters such as underscores, dashes, apostrophes, commas, etc., as distinct words.
+
+For example, given the string "Hello hello goodbye", your function should return `[['hello', 2], ['goodbye', 1]]`.
+
+# --hints--
+
+`wordFrequency` should be a function.
+
+```js
+assert(typeof wordFrequency == 'function');
+```
+
+`wordFrequency` should return an array.
+
+```js
+assert(Array.isArray(wordFrequency('test')));
+```
+
+`wordFrequency("Hello hello world", 2)` should return `[['hello', 2], ['world', 1]]`
+
+```js
+assert.deepEqual(wordFrequency(example_1, 2), example_1_solution);
+```
+
+`wordFrequency("The quick brown fox jumped over the lazy dog", 1)` should return `[['the', 2]]`
+
+```js
+assert.deepEqual(wordFrequency(example_2, 1), example_2_solution);
+```
+
+`wordFrequency("Opensource opensource open-source open source", 1)` should return `[['opensource', 2]]`
+
+```js
+assert.deepEqual(wordFrequency(example_3, 1), example_3_solution);
+```
+
+`wordFrequency("Apple App apply aPP aPPlE", 3)` should return `[['app', 2], ['apple', 2], ['apply', 1]]` or `[['apple', 2], ['app', 2], ['apply', 1]]`
+
+```js
+const arr = JSON.stringify(wordFrequency(example_4, 3));
+assert(arr === example_4_solution_a || arr === example_4_solution_b);
+```
+
+`wordFrequency("c d a d c a b d d c", 4)` should return `[['d', 4], ['c', 3], ['a', 2], ['b', 1]]`
+
+```js
+assert.deepEqual(wordFrequency(example_5, 4), example_5_solution);
+```
+
+`wordFrequency("", 5)` should return `[]`
+
+```js
+assert.deepEqual(wordFrequency(example_6, 5), example_6_solution);
+```
+
+# --seed--
+
+## --before-user-code--
+
+```js
+var example_1 = 'Hello hello world';
+var example_1_solution = [['hello', 2], ['world', 1]];
+var example_2 = 'The quick brown fox jumped over the lazy dog';
+var example_2_solution = [['the', 2]];
+var example_3 = 'Opensource opensource open-source open source';
+var example_3_solution = [['opensource', 2]];
+var example_4 = 'Apple App apply aPP aPPlE';
+var example_4_solution_a = "[[\"app\",2],[\"apple\",2],[\"apply\",1]]";
+var example_4_solution_b = "[[\"apple\",2],[\"app\",2],[\"apply\",1]]";
+var example_5 = 'c d a d c a b d d c';
+var example_5_solution = [['d', 4], ['c', 3], ['a', 2], ['b', 1]];
+var example_6 = '';
+var example_6_solution = [];
+```
+
+## --seed-contents--
+
+```js
+function wordFrequency(txt, n) {
+
+}
+```
+
+# --solutions--
+
+```js
+function wordFrequency(txt, n) {
+  var words = txt.split(/\s+/);
+  var wordCount = {};
+  words.forEach(word => {
+    if (word == '') {
+      return;
+    }
+    const lowerWord = word.toLowerCase();
+    wordCount[lowerWord] =
+      lowerWord in wordCount ? wordCount[lowerWord] + 1 : 1;
+  });
+
+  var wordsArray = [];
+  for (let [word, count] of Object.entries(wordCount)) {
+    wordsArray.push([word, count]);
+  }
+
+  wordsArray.sort((a, b) => {
+    if (a[1] !== b[1]) {
+      return b[1] - a[1];
+    } else if (a[0] !== b[0]) {
+      return a[0] < b[0] ? -1 : 1;
+    }
+    return 0;
+  });
+  return wordsArray.slice(0, n);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-wrap.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-wrap.md
new file mode 100644
index 0000000000..344be87802
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/word-wrap.md
@@ -0,0 +1,106 @@
+---
+id: 594810f028c0303b75339ad4
+title: Word wrap
+challengeType: 5
+forumTopicId: 302344
+dashedName: word-wrap
+---
+
+# --description--
+
+Even today, with proportional fonts and complex layouts, there are still cases where you need to wrap text at a specified column. The basic task is to wrap a paragraph of text in a simple way.
+
+# --instructions--
+
+Write a function that can wrap this text to any number of characters. As an example, the text wrapped to 80 characters should look like the following:
+
+<pre>
+Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX
+algorithm. If your language provides this, you get easy extra credit, but you
+must reference documentation indicating that the algorithm is something better
+than a simple minimum length algorithm.
+</pre>
+
+# --hints--
+
+wrap should be a function.
+
+```js
+assert.equal(typeof wrap, 'function');
+```
+
+wrap should return a string.
+
+```js
+assert.equal(typeof wrap('abc', 10), 'string');
+```
+
+wrap(80) should return 4 lines.
+
+```js
+assert(wrapped80.split('\n').length === 4);
+```
+
+Your `wrap` function should return our expected text.
+
+```js
+assert.equal(wrapped80.split('\n')[0], firstRow80);
+```
+
+wrap(42) should return 7 lines.
+
+```js
+assert(wrapped42.split('\n').length === 7);
+```
+
+Your `wrap` function should return our expected text.
+
+```js
+assert.equal(wrapped42.split('\n')[0], firstRow42);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const text =
+`Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX algorithm.
+If your language provides this, you get easy extra credit,
+but you ''must reference documentation'' indicating that the algorithm
+is something better than a simple minimum length algorithm.`;
+
+const wrapped80 = wrap(text, 80);
+const wrapped42 = wrap(text, 42);
+
+const firstRow80 =
+    'Wrap text using a more sophisticated algorithm such as the Knuth and Plass TeX';
+
+const firstRow42 = 'Wrap text using a more sophisticated';
+```
+
+## --seed-contents--
+
+```js
+function wrap(text, limit) {
+  return text;
+}
+```
+
+# --solutions--
+
+```js
+function wrap(text, limit) {
+  const noNewlines = text.replace('\n', '');
+  if (noNewlines.length > limit) {
+    // find the last space within limit
+    const edge = noNewlines.slice(0, limit).lastIndexOf(' ');
+    if (edge > 0) {
+      const line = noNewlines.slice(0, edge);
+      const remainder = noNewlines.slice(edge + 1);
+      return line + '\n' + wrap(remainder, limit);
+    }
+  }
+  return text;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/y-combinator.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/y-combinator.md
new file mode 100644
index 0000000000..690e647586
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/y-combinator.md
@@ -0,0 +1,87 @@
+---
+id: 594810f028c0303b75339ad5
+title: Y combinator
+challengeType: 5
+forumTopicId: 302345
+dashedName: y-combinator
+---
+
+# --description--
+
+In strict [functional programming](<https://en.wikipedia.org/wiki/Functional programming> "wp: functional programming") and the [lambda calculus](<https://en.wikipedia.org/wiki/lambda calculus> "wp: lambda calculus"), functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's state is used in the body of the function. The [Y combinator](https://mvanier.livejournal.com/2897.html) is itself a stateless function that, when applied to another stateless function, returns a recursive version of the function. The Y combinator is the simplest of the class of such functions, called [fixed-point combinators](<https://en.wikipedia.org/wiki/Fixed-point combinator> "wp: fixed-point combinator").
+
+# --instructions--
+
+Define the stateless Y combinator function and use it to compute [factorial](https://en.wikipedia.org/wiki/Factorial "wp: factorial"). The `factorial(N)` function is already given to you. **See also:**
+
+<ul>
+  <li><a href="https://vimeo.com/45140590" target="_blank">Jim Weirich: Adventures in Functional Programming</a>.</li>
+</ul>
+
+# --hints--
+
+Y should return a function.
+
+```js
+assert.equal(typeof Y((f) => (n) => n), 'function');
+```
+
+factorial(1) should return 1.
+
+```js
+assert.equal(factorial(1), 1);
+```
+
+factorial(2) should return 2.
+
+```js
+assert.equal(factorial(2), 2);
+```
+
+factorial(3) should return 6.
+
+```js
+assert.equal(factorial(3), 6);
+```
+
+factorial(4) should return 24.
+
+```js
+assert.equal(factorial(4), 24);
+```
+
+factorial(10) should return 3628800.
+
+```js
+assert.equal(factorial(10), 3628800);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+var factorial = Y(f => n => (n > 1 ? n * f(n - 1) : 1));
+```
+
+## --seed-contents--
+
+```js
+function Y(f) {
+  return function() {
+
+  };
+}
+
+var factorial = Y(function(f) {
+  return function (n) {
+    return n > 1 ? n * f(n - 1) : 1;
+  };
+});
+```
+
+# --solutions--
+
+```js
+var Y = f => (x => x(x))(y => f(x => y(y)(x)));
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
new file mode 100644
index 0000000000..7794021986
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zeckendorf-number-representation.md
@@ -0,0 +1,205 @@
+---
+id: 594810f028c0303b75339ad6
+title: Zeckendorf number representation
+challengeType: 5
+forumTopicId: 302346
+dashedName: zeckendorf-number-representation
+---
+
+# --description--
+
+Just as numbers can be represented in a positional notation as sums of multiples of the powers of ten (decimal) or two (binary); all the positive integers can be represented as the sum of one or zero times the distinct members of the Fibonacci series. Recall that the first six distinct Fibonacci numbers are: `1, 2, 3, 5, 8, 13`.
+
+The decimal number eleven can be written as `0*13 + 1*8 + 0*5 + 1*3 + 0*2 + 0*1` or `010100` in positional notation where the columns represent multiplication by a particular member of the sequence. Leading zeroes are dropped so that 11 decimal becomes `10100`. 10100 is not the only way to make 11 from the Fibonacci numbers however `0*13 + 1*8 + 0*5 + 0*3 + 1*2 + 1*1` or 010011 would also represent decimal 11. For a true Zeckendorf number there is the added restriction that *no two consecutive Fibonacci numbers can be used* which leads to the former unique solution.
+
+# --instructions--
+
+Write a function that generates and returns the Zeckendorf number representation of `n`.
+
+# --hints--
+
+`zeckendorf` should be a function.
+
+```js
+assert.equal(typeof zeckendorf, 'function');
+```
+
+`zeckendorf(0)` should return `0`.
+
+```js
+assert.equal(zeckendorf(0), 0);
+
+```
+
+`zeckendorf(1)` should return `1`.
+
+```js
+assert.equal(zeckendorf(1), 1);
+```
+
+`zeckendorf(2)` should return `10`.
+
+```js
+assert.equal(zeckendorf(2), 10);
+```
+
+`zeckendorf(3)` should return `100`.
+
+```js
+assert.equal(zeckendorf(3), 100);
+```
+
+`zeckendorf(4)` should return `101`.
+
+```js
+assert.equal(zeckendorf(4), 101);
+```
+
+`zeckendorf(5)` should return `1000`.
+
+```js
+assert.equal(zeckendorf(5), 1000);
+```
+
+`zeckendorf(6)` should return `1001`.
+
+```js
+assert.equal(zeckendorf(6), 1001);
+```
+
+`zeckendorf(7)` should return `1010`.
+
+```js
+assert.equal(zeckendorf(7), 1010);
+```
+
+`zeckendorf(8)` should return `10000`.
+
+```js
+assert.equal(zeckendorf(8), 10000);
+```
+
+`zeckendorf(9)` should return `10001`.
+
+```js
+assert.equal(zeckendorf(9), 10001);
+```
+
+`zeckendorf(10)` should return `10010`.
+
+```js
+assert.equal(zeckendorf(10), 10010);
+```
+
+`zeckendorf(11)` should return `10100`.
+
+```js
+assert.equal(zeckendorf(11), 10100);
+```
+
+`zeckendorf(12)` should return `10101`.
+
+```js
+assert.equal(zeckendorf(12), 10101);
+```
+
+`zeckendorf(13)` should return `100000`.
+
+```js
+assert.equal(zeckendorf(13), 100000);
+```
+
+`zeckendorf(14)` should return `100001`.
+
+```js
+assert.equal(zeckendorf(14), 100001);
+```
+
+`zeckendorf(15)` should return `100010`.
+
+```js
+assert.equal(zeckendorf(15), 100010);
+```
+
+`zeckendorf(16)` should return `100100`.
+
+```js
+assert.equal(zeckendorf(16), 100100);
+```
+
+`zeckendorf(17)` should return `100101`.
+
+```js
+assert.equal(zeckendorf(17), 100101);
+```
+
+`zeckendorf(18)` should return `101000`.
+
+```js
+assert.equal(zeckendorf(18), 101000);
+```
+
+`zeckendorf(19)` should return `101001`.
+
+```js
+assert.equal(zeckendorf(19), 101001);
+```
+
+`zeckendorf(20)` should return `101010`.
+
+```js
+assert.equal(zeckendorf(20), 101010);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function zeckendorf(n) {
+
+}
+```
+
+# --solutions--
+
+```js
+// zeckendorf :: Int -> Int
+function zeckendorf(n) {
+  const f = (m, x) => (m < x ? [m, 0] : [m - x, 1]);
+  return parseInt((n === 0 ? ([0]) :
+    mapAccumL(f, n, reverse(
+      tail(fibUntil(n))
+    ))[1]).join(''));
+}
+
+// fibUntil :: Int -> [Int]
+let fibUntil = n => {
+  const xs = [];
+  until(
+      ([a]) => a > n,
+      ([a, b]) => (xs.push(a), [b, a + b]), [1, 1]
+  );
+  return xs;
+};
+
+let mapAccumL = (f, acc, xs) => (
+  xs.reduce((a, x) => {
+    const pair = f(a[0], x);
+
+    return [pair[0], a[1].concat(pair[1])];
+  }, [acc, []])
+);
+
+let until = (p, f, x) => {
+  let v = x;
+  while (!p(v)) v = f(v);
+  return v;
+};
+
+const tail = xs => (
+   xs.length ? xs.slice(1) : undefined
+);
+
+const reverse = xs => xs.slice(0).reverse();
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
new file mode 100644
index 0000000000..64d4e8b5d4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -0,0 +1,321 @@
+---
+id: 594810f028c0303b75339ad7
+title: Zhang-Suen thinning algorithm
+challengeType: 5
+forumTopicId: 302347
+dashedName: zhang-suen-thinning-algorithm
+---
+
+# --description--
+
+This is an algorithm used to thin a black and white i.e. one bit per pixel images. For example, with an input image of:
+
+<!-- TODO write fully in markdown>
+<!-- markdownlint-disable -->
+
+<pre>
+ #################                   #############
+ ##################               ################
+ ###################            ##################
+ ########     #######          ###################
+   ######     #######         #######       ######
+   ######     #######        #######
+   #################         #######
+   ################          #######
+   #################         #######
+   ######     #######        #######
+   ######     #######        #######
+   ######     #######         #######       ######
+ ########     #######          ###################
+ ########     ####### ######    ################## ######
+ ########     ####### ######      ################ ######
+ ########     ####### ######         ############# ######
+</pre>
+
+It produces the thinned output:
+
+<pre>
+
+    # ##########                       #######
+     ##        #                   ####       #
+     #          #                 ##
+     #          #                #
+     #          #                #
+     #          #                #
+     ############               #
+     #          #               #
+     #          #                #
+     #          #                #
+     #          #                #
+     #                            ##
+     #                             ############
+                       ###                          ###
+
+</pre>
+
+<h2>Algorithm</h2>
+
+Assume black pixels are one and white pixels zero, and that the input image is a rectangular N by M array of ones and zeroes. The algorithm operates on all black pixels P1 that can have eight neighbours. The neighbours are, in order, arranged as:
+
+<table border="3">
+  <tr><td style="text-align: center;">P9</td><td style="text-align: center;">P2</td><td style="text-align: center;">P3</td></tr>
+  <tr><td style="text-align: center;">P8</td><td style="text-align: center;"><strong>P1</strong></td><td style="text-align: center;">P4</td></tr>
+  <tr><td style="text-align: center;">P7</td><td style="text-align: center;">P6</td><td style="text-align: center;">P5</td></tr>
+</table>
+
+Obviously the boundary pixels of the image cannot have the full eight neighbours.
+
+<ul>
+  <li>Define $A(P1)$ = the number of transitions from white to black, (0 -> 1) in the sequence P2, P3, P4, P5, P6, P7, P8, P9, P2. (Note the extra P2 at the end - it is circular).</li>
+  <li>Define $B(P1)$ = the number of black pixel neighbours of P1. ( = sum(P2 .. P9) )</li>
+</ul>
+
+**Step 1:**
+
+All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
+
+  <ol>
+    <li>The pixel is black and has eight neighbours</li>
+    <li>$2 <= B(P1) <= 6$</li>
+    <li>$A(P1) = 1$</li>
+    <li>At least one of <strong>P2, P4 and P6</strong> is white</li>
+    <li>At least one of <strong>P4, P6 and P8</strong> is white</li>
+  </ol>
+
+After iterating over the image and collecting all the pixels satisfying all step 1 conditions, all these condition satisfying pixels are set to white.
+
+**Step 2:**
+
+All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
+
+  <ol>
+    <li>The pixel is black and has eight neighbours</li>
+    <li>$2 <= B(P1) <= 6$</li>
+    <li>$A(P1) = 1$</li>
+    <li>At least one of <strong>P2, P4 and P8</strong> is white</li>
+    <li>At least one of <strong>P2, P6 and P8</strong> is white</li>
+  </ol>
+  
+After iterating over the image and collecting all the pixels satisfying all step 2 conditions, all these condition satisfying pixels are again set to white.
+
+**Iteration:**
+
+If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.
+
+# --instructions--
+
+Write a routine to perform Zhang-Suen thinning on the provided image matrix.
+
+# --hints--
+
+`thinImage` should be a function.
+
+```js
+assert.equal(typeof thinImage, 'function');
+```
+
+`thinImage` should return an array.
+
+```js
+assert(Array.isArray(result));
+```
+
+`thinImage` should return an array of strings.
+
+```js
+assert.equal(typeof result[0], 'string');
+```
+
+`thinImage` should return an array of strings.
+
+```js
+assert.deepEqual(result, expected);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const imageForTests = [
+  '                                                          ',
+  ' #################                   #############        ',
+  ' ##################               ################        ',
+  ' ###################            ##################        ',
+  ' ########     #######          ###################        ',
+  '   ######     #######         #######       ######        ',
+  '   ######     #######        #######                      ',
+  '   #################         #######                      ',
+  '   ################          #######                      ',
+  '   #################         #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######         #######       ######        ',
+  ' ########     #######          ###################        ',
+  ' ########     ####### ######    ################## ###### ',
+  ' ########     ####### ######      ################ ###### ',
+  ' ########     ####### ######         ############# ###### ',
+  '                                                          '];
+const expected = [
+  '                                                          ',
+  '                                                          ',
+  '    # ##########                       #######            ',
+  '     ##        #                   ####       #           ',
+  '     #          #                 ##                      ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     ############               #                         ',
+  '     #          #               #                         ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #          #                #                        ',
+  '     #                            ##                      ',
+  '     #                             ############           ',
+  '                       ###                          ###   ',
+  '                                                          ',
+  '                                                          '
+];
+const result = thinImage(imageForTests);
+```
+
+## --seed-contents--
+
+```js
+const testImage = [
+  '                                                          ',
+  ' #################                   #############        ',
+  ' ##################               ################        ',
+  ' ###################            ##################        ',
+  ' ########     #######          ###################        ',
+  '   ######     #######         #######       ######        ',
+  '   ######     #######        #######                      ',
+  '   #################         #######                      ',
+  '   ################          #######                      ',
+  '   #################         #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######        #######                      ',
+  '   ######     #######         #######       ######        ',
+  ' ########     #######          ###################        ',
+  ' ########     ####### ######    ################## ###### ',
+  ' ########     ####### ######      ################ ###### ',
+  ' ########     ####### ######         ############# ###### ',
+  '                                                          '];
+
+function thinImage(image) {
+
+}
+```
+
+# --solutions--
+
+```js
+function Point(x, y) {
+  this.x = x;
+  this.y = y;
+}
+
+const ZhangSuen = (function () {
+  function ZhangSuen() {
+  }
+
+  ZhangSuen.nbrs = [[0, -1], [1, -1], [1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1]];
+
+  ZhangSuen.nbrGroups = [[[0, 2, 4], [2, 4, 6]], [[0, 2, 6], [0, 4, 6]]];
+
+  ZhangSuen.toWhite = [];
+
+  ZhangSuen.main = function (image) {
+    ZhangSuen.grid = new Array(image);
+    for (let r = 0; r < image.length; r++) {
+      ZhangSuen.grid[r] = image[r].split('');
+    }
+    ZhangSuen.thinImage();
+    return ZhangSuen.getResult();
+  };
+
+  ZhangSuen.thinImage = function () {
+    let firstStep = false;
+    let hasChanged;
+    do {
+      hasChanged = false;
+      firstStep = !firstStep;
+      for (let r = 1; r < ZhangSuen.grid.length - 1; r++) {
+        for (let c = 1; c < ZhangSuen.grid[0].length - 1; c++) {
+          if (ZhangSuen.grid[r][c] !== '#') {
+            continue;
+          }
+          const nn = ZhangSuen.numNeighbors(r, c);
+          if (nn < 2 || nn > 6) {
+            continue;
+          }
+          if (ZhangSuen.numTransitions(r, c) !== 1) {
+            continue;
+          }
+          if (!ZhangSuen.atLeastOneIsWhite(r, c, firstStep ? 0 : 1)) {
+            continue;
+          }
+          ZhangSuen.toWhite.push(new Point(c, r));
+          hasChanged = true;
+        }
+      }
+      for (let i = 0; i < ZhangSuen.toWhite.length; i++) {
+        const p = ZhangSuen.toWhite[i];
+        ZhangSuen.grid[p.y][p.x] = ' ';
+      }
+      ZhangSuen.toWhite = [];
+    } while ((firstStep || hasChanged));
+  };
+
+  ZhangSuen.numNeighbors = function (r, c) {
+    let count = 0;
+    for (let i = 0; i < ZhangSuen.nbrs.length - 1; i++) {
+      if (ZhangSuen.grid[r + ZhangSuen.nbrs[i][1]][c + ZhangSuen.nbrs[i][0]] === '#') {
+        count++;
+      }
+    }
+    return count;
+  };
+
+  ZhangSuen.numTransitions = function (r, c) {
+    let count = 0;
+    for (let i = 0; i < ZhangSuen.nbrs.length - 1; i++) {
+      if (ZhangSuen.grid[r + ZhangSuen.nbrs[i][1]][c + ZhangSuen.nbrs[i][0]] === ' ') {
+        if (ZhangSuen.grid[r + ZhangSuen.nbrs[i + 1][1]][c + ZhangSuen.nbrs[i + 1][0]] === '#') {
+          count++;
+        }
+      }
+    }
+    return count;
+  };
+
+  ZhangSuen.atLeastOneIsWhite = function (r, c, step) {
+    let count = 0;
+    const group = ZhangSuen.nbrGroups[step];
+    for (let i = 0; i < 2; i++) {
+      for (let j = 0; j < group[i].length; j++) {
+        const nbr = ZhangSuen.nbrs[group[i][j]];
+        if (ZhangSuen.grid[r + nbr[1]][c + nbr[0]] === ' ') {
+          count++;
+          break;
+        }
+      }
+    }
+    return count > 1;
+  };
+
+  ZhangSuen.getResult = function () {
+    const result = [];
+    for (let i = 0; i < ZhangSuen.grid.length; i++) {
+      const row = ZhangSuen.grid[i].join('');
+      result.push(row);
+    }
+    return result;
+  };
+  return ZhangSuen;
+}());
+
+function thinImage(image) {
+  return ZhangSuen.main(image);
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
new file mode 100644
index 0000000000..4f5277c28a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/rosetta-code/zig-zag-matrix.md
@@ -0,0 +1,117 @@
+---
+id: 594810f028c0303b75339ad8
+title: Zig-zag matrix
+challengeType: 5
+forumTopicId: 302348
+dashedName: zig-zag-matrix
+---
+
+# --description--
+
+A 'zig-zag' array is a square arrangement of the first $N^2$ integers, where the numbers increase sequentially as you zig-zag along the array's [anti-diagonals](https://en.wiktionary.org/wiki/antidiagonal).
+
+For example, for the input `5`, the following result should be produced:
+
+<pre>
+ 0  1  5  6 14
+ 2  4  7 13 15
+ 3  8 12 16 21
+ 9 11 17 20 22
+10 18 19 23 24
+</pre>
+
+# --instructions--
+
+Write a function that takes the size of the zig-zag matrix, and returns the corresponding matrix as two-dimensional array.
+
+# --hints--
+
+ZigZagMatrix should be a function.
+
+```js
+assert.equal(typeof ZigZagMatrix, 'function');
+```
+
+ZigZagMatrix should return array.
+
+```js
+assert.equal(typeof ZigZagMatrix(1), 'object');
+```
+
+ZigZagMatrix should return an array of nested arrays.
+
+```js
+assert.equal(typeof ZigZagMatrix(1)[0], 'object');
+```
+
+ZigZagMatrix(1) should return \[[0]].
+
+```js
+assert.deepEqual(ZigZagMatrix(1), zm1);
+```
+
+ZigZagMatrix(2) should return \[[0, 1], [2, 3]].
+
+```js
+assert.deepEqual(ZigZagMatrix(2), zm2);
+```
+
+ZigZagMatrix(5) should return specified matrix.
+
+```js
+assert.deepEqual(ZigZagMatrix(5), zm5);
+```
+
+# --seed--
+
+## --after-user-code--
+
+```js
+const zm1 = [[0]];
+const zm2 = [[0, 1], [2, 3]];
+const zm5 = [
+  [0, 1, 5, 6, 14],
+  [2, 4, 7, 13, 15],
+  [3, 8, 12, 16, 21],
+  [9, 11, 17, 20, 22],
+  [10, 18, 19, 23, 24]
+];
+```
+
+## --seed-contents--
+
+```js
+function ZigZagMatrix(n) {
+
+  return [[], []];
+}
+```
+
+# --solutions--
+
+```js
+function ZigZagMatrix(n) {
+  const mtx = [];
+  for (let i = 0; i < n; i++) {
+    mtx[i] = [];
+  }
+
+  let i = 1;
+  let j = 1;
+  for (let e = 0; e < n * n; e++) {
+    mtx[i - 1][j - 1] = e;
+    if ((i + j) % 2 === 0) {
+      // Even stripes
+      if (j < n) j++;
+      else i += 2;
+      if (i > 1) i--;
+    } else {
+      // Odd stripes
+      if (i < n) i++;
+      else j += 2;
+      if (j > 1) j--;
+    }
+  }
+  return mtx;
+}
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
new file mode 100644
index 0000000000..35f9887785
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-camper-leaderboard.md
@@ -0,0 +1,31 @@
+---
+id: bd7156d8c242eddfaeb5bd13
+title: Build a freeCodeCamp Forum Homepage
+challengeType: 3
+forumTopicId: 302349
+dashedName: build-a-freecodecamp-forum-homepage
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/JqdoMV>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see a list of the most recent posts on the freeCodeCamp forum.
+
+**User Story:** For each topic, I can see the title and a list of links to users who have recently posted in it.
+
+**User Story:** I can see the number of replies and views that each topic has had, and a timestamp of when the topic was last active.
+
+**Hint:** To get the 30 most recent forum posts: <https://forum-proxy.freecodecamp.rocks/latest>.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
new file mode 100644
index 0000000000..5cf03cdd2a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-light-bright-app.md
@@ -0,0 +1,37 @@
+---
+id: 5a5d02bd919fcf9ca8cf46cb
+title: Build a Light-Bright App
+challengeType: 3
+forumTopicId: 302350
+dashedName: build-a-light-bright-app
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/eyLYXE>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can click or drag the mouse cursor to color the circles.
+
+**User Story:** I can double-click on a colored circle to remove the color.
+
+**User Story:** I can click on a colored circle to change its color.
+
+**User Story:** I should get a circle of different color on each click.
+
+**User Story:** I can click on the 'Reset' button to remove the recent color.
+
+**User Story:** I can click on the 'Reset All' button to remove all the colors from the circles.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
new file mode 100644
index 0000000000..5d39e057a6
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-nightlife-coordination-app.md
@@ -0,0 +1,31 @@
+---
+id: bd7158d8c443eddfaeb5bdff
+title: Build a Nightlife Coordination App
+challengeType: 4
+forumTopicId: 302351
+dashedName: build-a-nightlife-coordination-app
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://yoyo44.herokuapp.com/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** As an unauthenticated user, you can view all bars in my area.
+
+**User Story:** As an authenticated user, you can add myself to a bar to indicate you am going there tonight.
+
+**User Story:** As an authenticated user, you can remove myself from a bar if you no longer want to go there.
+
+**User Story:** As an unauthenticated user, when you login you should not have to search again.
+
+**Hint:** Try using the [Yelp API](https://www.yelp.com/developers/documentation/v3) to find venues in the cities your users search for. If you use Yelp's API, be sure to mention so in your app.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
new file mode 100644
index 0000000000..bd190875b3
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pinterest-clone.md
@@ -0,0 +1,37 @@
+---
+id: bd7158d8c443eddfaeb5bdee
+title: Build a Pinterest Clone
+challengeType: 4
+forumTopicId: 302352
+dashedName: build-a-pinterest-clone
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://build-a-pinterest-clone.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** As an unauthenticated user, I can login with GitHub.
+
+**User Story:** As an authenticated user, I can link to images.
+
+**User Story:** As an authenticated user, I can delete images that I've linked to.
+
+**User Story:** As an authenticated user, I can see a Pinterest-style wall of all the images I've linked to.
+
+**User Story:** As an unauthenticated user, I can browse other users' walls of images.
+
+**User Story:** 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)
+
+**Hint:** [Masonry.js](https://masonry.desandro.com/) is a library that allows for Pinterest-style image grids.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
new file mode 100644
index 0000000000..cfa0cc598b
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-pong-game.md
@@ -0,0 +1,33 @@
+---
+id: 5a4b7fcdb66f799f199e11db
+title: Build a Pong Game
+challengeType: 3
+forumTopicId: 302353
+dashedName: build-a-pong-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/satyamdev/full/pdMmBp>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can control a paddle.
+
+**User Story:** The computer can control the other paddle.
+
+**User Story:** The computer's paddle is unbeatable. It should never miss the ball.
+
+**User Story:** The game keeps track of the player and computer's score.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
new file mode 100644
index 0000000000..7817e26951
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-recipe-box.md
@@ -0,0 +1,37 @@
+---
+id: bd7155d8c242eddfaeb5bd13
+title: Build a Recipe Box
+challengeType: 3
+forumTopicId: 302354
+dashedName: build-a-recipe-box
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/dNVazZ/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can create recipes that have names and ingredients.
+
+**User Story:** I can see an index view where the names of all the recipes are visible.
+
+**User Story:** I can click into any of those recipes to view it.
+
+**User Story:** I can edit these recipes.
+
+**User Story:** I can delete these recipes.
+
+**User Story:** All new recipes I add are saved in my browser's local storage. If I refresh the page, these recipes will still be there.
+
+**Hint:** You should prefix your local storage keys on CodePen, i.e. `_username_recipes`
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
new file mode 100644
index 0000000000..de57859782
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-roguelike-dungeon-crawler-game.md
@@ -0,0 +1,41 @@
+---
+id: bd7153d8c242eddfaeb5bd13
+title: Build a Roguelike Dungeon Crawler Game
+challengeType: 3
+forumTopicId: 302355
+dashedName: build-a-roguelike-dungeon-crawler-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/apLXEJ/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.
+
+**User Story:** All the items and enemies on the map are arranged at random.
+
+**User Story:** I can move throughout a map, discovering items.
+
+**User Story:** I can move anywhere within the map's boundaries, but I can't move through an enemy until I've beaten it.
+
+**User Story:** 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.
+
+**User Story:** When I beat an enemy, the enemy goes away and I get XP, which eventually increases my level.
+
+**User Story:** When I fight an enemy, we take turns damaging each other until one of us loses. I do damage based off of my level and my weapon. The enemy does damage based off of its level. Damage is somewhat random within a range.
+
+**User Story:** When I find and beat the boss, I win.
+
+**User Story:** The game should be challenging, but theoretically winnable.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
new file mode 100644
index 0000000000..9de29f1566
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-simon-game.md
@@ -0,0 +1,41 @@
+---
+id: bd7158d8c442eddfaeb5bd1c
+title: Build a Simon Game
+challengeType: 3
+forumTopicId: 302357
+dashedName: build-a-simon-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: [https://codepen.io/freeCodeCamp/full/obYBjE](https://codepen.io/Em-Ant/full/QbRyqq/).
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I am presented with a random series of button presses.
+
+**User Story:** Each time I input a series of button presses correctly, I see the same series of button presses but with an additional step.
+
+**User Story:** I hear a sound that corresponds to each button both when the series of button presses plays, and when I personally press a button.
+
+**User Story:** 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.
+
+**User Story:** I can see how many steps are in the current series of button presses.
+
+**User Story:** If I want to restart, I can hit a button to do so, and the game will return to a single step.
+
+**User Story:** I can play in strict mode where if I get a button press wrong, it notifies me that I have done so, and the game restarts at a new random series of button presses.
+
+**User Story:** I can win the game by getting a series of 20 steps correct. I am notified of my victory, then the game starts over.
+
+**Hint:** Here are mp3s you can use for each button: `https://s3.amazonaws.com/freecodecamp/simonSound1.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound2.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound3.mp3`, `https://s3.amazonaws.com/freecodecamp/simonSound4.mp3`.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
new file mode 100644
index 0000000000..bf79eae711
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-tic-tac-toe-game.md
@@ -0,0 +1,29 @@
+---
+id: bd7158d8c442eedfaeb5bd1c
+title: Build a Tic Tac Toe Game
+challengeType: 3
+forumTopicId: 302358
+dashedName: build-a-tic-tac-toe-game
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/KzXQgy/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can play a game of Tic Tac Toe with the computer.
+
+**User Story:** My game will reset as soon as it's over so I can play again.
+
+**User Story:** I can choose whether I want to play as X or O.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
new file mode 100644
index 0000000000..3e6e257ce8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-voting-app.md
@@ -0,0 +1,37 @@
+---
+id: bd7158d8c443eddfaeb5bdef
+title: Build a Voting App
+challengeType: 4
+forumTopicId: 302359
+dashedName: build-a-voting-app
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://voting-app.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** As an authenticated user, you can keep my polls and come back later to access them.
+
+**User Story:** As an authenticated user, you can share my polls with my friends.
+
+**User Story:** As an authenticated user, you can see the aggregate results of my polls.
+
+**User Story:** As an authenticated user, you can delete polls that I decide I don't want anymore.
+
+**User Story:** As an authenticated user, you can create a poll with any number of possible items.
+
+**User Story:** As an unauthenticated or authenticated user, you can see and vote on everyone's polls.
+
+**User Story:** As an unauthenticated or authenticated user, you can see the results of polls in chart form. (This could be implemented using Chart.js or Google Charts.)
+
+**User Story:** As an authenticated user, if you don't like the options on a poll, you can create a new option.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
new file mode 100644
index 0000000000..d4cf3b350f
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-a-wikipedia-viewer.md
@@ -0,0 +1,33 @@
+---
+id: bd7158d8c442eddfaeb5bd19
+title: Build a Wikipedia Viewer
+challengeType: 3
+forumTopicId: 302360
+dashedName: build-a-wikipedia-viewer
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/wGqEga/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.
+
+**User Story:** I can click a button to see a random Wikipedia entry.
+
+Hint #1: Here's a URL you can use to get a random Wikipedia article: `https://en.wikipedia.org/wiki/Special:Random`.
+
+Hint #2: Here's an entry on using Wikipedia's API: `https://www.mediawiki.org/wiki/API:Main_page`.
+
+Hint #3: Use this [link](https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm) to experiment with Wikipedia's API.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
new file mode 100644
index 0000000000..a17732de47
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-an-image-search-abstraction-layer.md
@@ -0,0 +1,27 @@
+---
+id: bd7158d8c443edefaeb5bdee
+title: Build an Image Search Abstraction Layer
+challengeType: 4
+forumTopicId: 302361
+dashedName: build-an-image-search-abstraction-layer
+---
+
+# --description--
+
+Build a full stack JavaScript app that allows you to search for images like this: <https://image-search-abstraction-layer.freecodecamp.rocks/query/lolcats%20funny?page=10> and browse recent search queries like this: <https://image-search-abstraction-layer.freecodecamp.rocks/recent/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** You can get the image URLs, description and page URLs for a set of images relating to a given search string.
+
+**User Story:** You can paginate through the responses by adding a `?page=2` parameter to the URL.
+
+**User Story:** You can get a list of the most recently submitted search strings.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
new file mode 100644
index 0000000000..10998f981d
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/build-the-game-of-life.md
@@ -0,0 +1,39 @@
+---
+id: bd7154d8c242eddfaeb5bd13
+title: Build the Game of Life
+challengeType: 3
+forumTopicId: 302362
+dashedName: build-the-game-of-life
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/BpwMZv/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** When I first arrive at the game, it will randomly generate a board and start playing.
+
+**User Story:** I can start and stop the board.
+
+**User Story:** I can set up the board.
+
+**User Story:** I can clear the board.
+
+**User Story:** When I press start, the game will play out.
+
+**User Story:** Each time the board changes, I can see how many generations have gone by.
+
+**Hint:** Here's an explanation of Conway's Game of Life from John Conway himself: <https://www.youtube.com/watch?v=E8kUJL04ELA>
+
+**Hint:** Here's an overview of Conway's Game of Life with rules for your reference: <https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life>
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
new file mode 100644
index 0000000000..fbae3e461a
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/chart-the-stock-market.md
@@ -0,0 +1,29 @@
+---
+id: bd7158d8c443eddfaeb5bd0e
+title: Chart the Stock Market
+challengeType: 4
+forumTopicId: 302363
+dashedName: chart-the-stock-market
+---
+
+# --description--
+
+Build a full stack JavaScript app that is functionally similar to this: <https://chart-the-stock-market.freecodecamp.rocks/>. Use a site builder of your choice to complete the project.
+
+Here are the specific user stories you should implement for this project:
+
+**User Story:** You can view a graph displaying the recent trend lines for each added stock.
+
+**User Story:** You can add new stocks by their symbol name.
+
+**User Story:** You can remove stocks.
+
+**User Story:** You can see changes in real-time when any other user adds or removes a stock. For this you will need to use Web Sockets.
+
+When you are done, make sure a working demo of your project is hosted somewhere public. Then submit the URL to it in the `Solution Link` field. Optionally, also submit a link to your project's source code in the `GitHub Link` field.
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
new file mode 100644
index 0000000000..5a5420d771
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/manage-a-book-trading-club.md
@@ -0,0 +1,31 @@
+---
+id: bd7158d8c443eddfaeb5bd0f
+title: Manage a Book Trading Club
+challengeType: 4
+forumTopicId: 302364
+dashedName: manage-a-book-trading-club
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://manage-a-book-trading-club.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can view all books posted by every user.
+
+**User Story:** I can add a new book.
+
+**User Story:** I can update my settings to store my full name, city, and state.
+
+**User Story:** I can propose a trade and wait for the other user to accept the trade.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
new file mode 100644
index 0000000000..aa1dcc3a84
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/map-data-across-the-globe.md
@@ -0,0 +1,31 @@
+---
+id: bd7108d8c242eddfaeb5bd13
+title: Map Data Across the Globe
+challengeType: 3
+forumTopicId: 302365
+dashedName: map-data-across-the-globe
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/mVEJag>.
+
+Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see where all Meteorites landed on a world map.
+
+**User Story:** I can tell the relative size of the meteorite, just by looking at the way it's represented on the map.
+
+**User Story:** I can mouse over the meteorite's data point for additional data.
+
+**Hint:** Here's a dataset you can use to build this: <https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json>
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
new file mode 100644
index 0000000000..6070f83ea8
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/p2p-video-chat-application.md
@@ -0,0 +1,41 @@
+---
+id: bd7150d8c442eddfafb5bd1c
+title: P2P Video Chat Application
+challengeType: 4
+forumTopicId: 302366
+dashedName: p2p-video-chat-application
+---
+
+# --description--
+
+**Objective:** Build a [Replit](https://replit.com/) app that is functionally similar to this: <https://p2p-video-chat-application.freecodecamp.rocks/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** Upon arriving, the browser will prompt me to access my camera and microphone.
+
+**User Story:** After I give it permission, I am prompted to type in a room name.
+
+**User Story:** Once I type in the room name, a room will be created if no room of that name existed before.
+
+**User Story:** 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.
+
+**User Story:** 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.
+
+**User Story:** Anyone can create or join any room. And there can be any number of rooms, but all of them must have unique names.
+
+**User Story:** I can choose to not permit the site to access my microphone and webcam. If I choose not to do this, or if some other driver problem occurs, I see an error message saying these are required.
+
+**User Story:** 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.
+
+**User Story:** If one of the two people in the room get disconnected, they can reconnect to the same room and continue chatting.
+
+Once you've finished implementing these user stories, enter the URL to your live app and, optionally, your GitHub repository. Then click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
new file mode 100644
index 0000000000..9e83b937f4
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-national-contiguity-with-a-force-directed-graph.md
@@ -0,0 +1,31 @@
+---
+id: bd7198d8c242eddfaeb5bd13
+title: Show National Contiguity with a Force Directed Graph
+challengeType: 3
+forumTopicId: 302367
+dashedName: show-national-contiguity-with-a-force-directed-graph
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/xVopBo>.
+
+Fulfill the following [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see a Force-directed Graph that shows which countries share borders.
+
+**User Story:** I can see each country's flag on its node.
+
+**Hint:** Here's a dataset you can use to build this: <https://raw.githubusercontent.com/DealPete/forceDirected/master/countries.json>
+
+**Hint:** You can create a spritesheet of national flags at <https://www.flag-sprites.com>.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
new file mode 100644
index 0000000000..9d470d6b1c
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/show-the-local-weather.md
@@ -0,0 +1,33 @@
+---
+id: bd7158d8c442eddfaeb5bd10
+title: Show the Local Weather
+challengeType: 3
+forumTopicId: 302368
+dashedName: show-the-local-weather
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/bELRjV>.
+
+**Rule #1:** Don't look at the example project's code. Figure it out for yourself.
+
+**Rule #2:** Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see the weather in my current location.
+
+**User Story:** I can see a different icon or background image (e.g. snowy mountain, hot desert) depending on the weather.
+
+**User Story:** I can push a button to toggle between Fahrenheit and Celsius.
+
+**Note:** Many internet browsers now require an HTTP Secure (`https://`) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <https://weather-proxy.freecodecamp.rocks/> which uses an HTTP Secure connection for the weather. Also, be sure to connect to [CodePen.io](https://codepen.io) via `https://`.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
new file mode 100644
index 0000000000..55d17b1745
--- /dev/null
+++ b/curriculum/challenges/portuguese/10-coding-interview-prep/take-home-projects/use-the-twitch-json-api.md
@@ -0,0 +1,35 @@
+---
+id: bd7158d8c442eddfaeb5bd1f
+title: Use the Twitch JSON API
+challengeType: 3
+forumTopicId: 19541
+dashedName: use-the-twitch-json-api
+---
+
+# --description--
+
+**Objective:** Build a [CodePen.io](https://codepen.io) app that is functionally similar to this: <https://codepen.io/freeCodeCamp/full/Myvqmo/>.
+
+Fulfill the below [user stories](https://en.wikipedia.org/wiki/User_story). Use whichever libraries or APIs you need. Give it your own personal style.
+
+**User Story:** I can see whether freeCodeCamp is currently streaming on Twitch.tv.
+
+**User Story:** I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.
+
+**User Story:** if a Twitch user is currently streaming, I can see additional details about what they are streaming.
+
+**Hint:** The relevant documentation about Twitch.tv's JSON API is here: <https://dev.twitch.tv/docs/api/reference/#get-streams>.
+
+**Hint:** Here's an array of the Twitch.tv usernames of people who regularly stream: `["ESL_SC2", "OgamingSC2", "cretetion", "freecodecamp", "storbeck", "habathcx", "RobotCaleb", "noobs2ninjas"]`
+
+**UPDATE:** Due to a change in conditions on API usage, Twitch.tv requires an API key, but we've built a workaround. Use <https://twitch-proxy.freecodecamp.rocks/> instead of Twitch's API base URL (i.e. `https://api.twitch.tv/helix` ) and you'll still be able to get account information, without needing to sign up for an API key.
+
+When you are finished, include a link to your project on CodePen and click the "I've completed this challenge" button.
+
+You can get feedback on your project by sharing it on the [freeCodeCamp forum](https://forum.freecodecamp.org/c/project-feedback/409).
+
+# --solutions--
+
+```js
+// solution required
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
new file mode 100644
index 0000000000..7d7338ee65
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/deep-learning-demystified.md
@@ -0,0 +1,34 @@
+---
+id: 5e9a0e9ef99a403d019610cc
+title: Deep Learning Demystified
+challengeType: 11
+videoId: bejQ-W9BGJg
+dashedName: deep-learning-demystified
+---
+
+# --question--
+
+## --text--
+
+How should you assign weights to input neurons before training your network for the first time?
+
+## --answers--
+
+From smallest to largest.
+
+---
+
+Completely randomly.
+
+---
+
+Alphabetically.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
new file mode 100644
index 0000000000..b06b2fbed8
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-convolutional-neural-networks-work.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610cd
+title: How Convolutional Neural Networks work
+challengeType: 11
+videoId: Y5M7KH4A4n4
+dashedName: how-convolutional-neural-networks-work
+---
+
+# --question--
+
+## --text--
+
+When are Convolutional Neural Networks not useful?
+
+## --answers--
+
+If your data can't be made to look like an image, or if you can rearrange elements of your data and it's still just as useful.
+
+---
+
+If your data is made up of different 2D or 3D images.
+
+---
+
+If your data is text or sound based.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
new file mode 100644
index 0000000000..ae41c9be52
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/how-deep-neural-networks-work.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610ca
+title: How Deep Neural Networks Work
+challengeType: 11
+videoId: zvalnHWGtx4
+dashedName: how-deep-neural-networks-work
+---
+
+# --question--
+
+## --text--
+
+Why is it better to calculate the gradient (slope) directly rather than numerically?
+
+## --answers--
+
+It is computationally expensive to go back through the entire neural network and adjust the weights for each layer of the neural network.
+
+---
+
+It is more accurate.
+
+---
+
+There is no difference between the two methods.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
new file mode 100644
index 0000000000..ab702e9b66
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/how-neural-networks-work/recurrent-neural-networks-rnn-and-long-short-term-memory-lstm.md
@@ -0,0 +1,30 @@
+---
+id: 5e9a0e9ef99a403d019610cb
+title: Recurrent Neural Networks RNN and Long Short Term Memory LSTM
+challengeType: 11
+videoId: UVimlsy9eW0
+dashedName: recurrent-neural-networks-rnn-and-long-short-term-memory-lstm
+---
+
+# --question--
+
+## --text--
+
+What are the main neural network components that make up a Long Short Term Memory network?
+
+## --answers--
+
+New information and prediction.
+
+---
+
+Prediction, collected possibilities, and selection.
+
+---
+
+Prediction, ignoring, forgetting, and selection.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
new file mode 100644
index 0000000000..b61ec6d5d1
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/book-recommendation-engine-using-knn.md
@@ -0,0 +1,35 @@
+---
+id: 5e46f8e3ac417301a38fb92f
+title: Book Recommendation Engine using KNN
+challengeType: 10
+forumTopicId: 462378
+dashedName: book-recommendation-engine-using-knn
+---
+
+# --description--
+
+In this challenge, you will create a book recommendation algorithm using K-Nearest Neighbors.
+
+You will use the Book-Crossings dataset. This dataset contains 1.1 million ratings (scale of 1-10) of 270,000 books by 90,000 users.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-book-recommendation-engine/blob/master/fcc_book_recommendation_knn.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
new file mode 100644
index 0000000000..07288906ad
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/cat-and-dog-image-classifier.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8dcac417301a38fb92e
+title: Cat and Dog Image Classifier
+challengeType: 10
+forumTopicId: 462377
+dashedName: cat-and-dog-image-classifier
+---
+
+# --description--
+
+For this challenge, you will use TensorFlow 2.0 and Keras to create a convolutional neural network that correctly classifies images of cats and dogs with at least 63% accuracy.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-cat-and-dog-image-classifier/blob/master/fcc_cat_dog.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
new file mode 100644
index 0000000000..56b993d65c
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/linear-regression-health-costs-calculator.md
@@ -0,0 +1,35 @@
+---
+id: 5e46f8edac417301a38fb930
+title: Linear Regression Health Costs Calculator
+challengeType: 10
+forumTopicId: 462379
+dashedName: linear-regression-health-costs-calculator
+---
+
+# --description--
+
+In this challenge, you will predict healthcare costs using a regression algorithm.
+
+You are given a dataset that contains information about different people including their healthcare costs. Use the data to predict healthcare costs based on new data.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-linear-regression-health-costs-calculator/blob/master/fcc_predict_health_costs_with_regression.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
new file mode 100644
index 0000000000..c5919ba470
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/neural-network-sms-text-classifier.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8edac417301a38fb931
+title: Neural Network SMS Text Classifier
+challengeType: 10
+forumTopicId: 462380
+dashedName: neural-network-sms-text-classifier
+---
+
+# --description--
+
+In this challenge, you need to create a machine learning model that will classify SMS messages as either "ham" or "spam". A "ham" message is a normal message sent by a friend. A "spam" message is an advertisement or a message sent by a company.
+
+You can access [the full project instructions and starter code on Google Colaboratory](https://colab.research.google.com/github/freeCodeCamp/boilerplate-neural-network-sms-text-classifier/blob/master/fcc_sms_text_classification.ipynb).
+
+After going to that link, create a copy of the notebook either in your own account or locally. Once you complete the project and it passes the test (included at that link), submit your project link below. If you are submitting a Google Colaboratory link, make sure to turn on link sharing for "anyone with the link."
+
+We are still developing the interactive instructional content for the machine learning curriculum. For now, you can go through the video challenges in this certification. You may also have to seek out additional learning resources, similar to what you would do when working on a real-world project.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
new file mode 100644
index 0000000000..d2d0410e52
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/machine-learning-with-python-projects/rock-paper-scissors.md
@@ -0,0 +1,33 @@
+---
+id: 5e46f8d6ac417301a38fb92d
+title: Rock Paper Scissors
+challengeType: 10
+forumTopicId: 462376
+dashedName: rock-paper-scissors
+---
+
+# --description--
+
+For this challenge, you will create a program to play Rock, Paper, Scissors. A program that picks at random will usually win 50% of the time. To pass this challenge your program must play matches against four different bots, winning at least 60% of the games in each match.
+
+You can access [the full project description and starter code on Replit](https://replit.com/github/freeCodeCamp/boilerplate-rock-paper-scissors).
+
+After going to that link, fork the project. Once you complete the project based on the instructions in 'README.md', submit your project link below.
+
+We are still developing the interactive instructional part of the machine learning curriculum. For now, you will have to use other resources to learn how to pass this challenge.
+
+# --hints--
+
+It should pass all Python tests.
+
+```js
+
+```
+
+# --solutions--
+
+```py
+  # Python challenges don't need solutions,
+  # because they would need to be tested against a full working project.
+  # Please check our contributing guidelines to learn more.
+```
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/conclusion.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/conclusion.md
new file mode 100644
index 0000000000..b87ca8022b
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/conclusion.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da6
+title: Conclusion
+challengeType: 11
+videoId: LMNub5frQi4
+dashedName: conclusion
+---
+
+# --question--
+
+## --text--
+
+Most people that are experts in AI or machine learning usually...:
+
+## --answers--
+
+have one specialization.
+
+---
+
+have many specializations.
+
+---
+
+have a deep understanding of many different frameworks.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
new file mode 100644
index 0000000000..71a466e2b5
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-evaluating-the-model.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d99
+title: 'Convolutional Neural Networks: Evaluating the Model'
+challengeType: 11
+videoId: eCATNvwraXg
+dashedName: convolutional-neural-networks-evaluating-the-model
+---
+
+# --question--
+
+## --text--
+
+What is **not** a good way to increase the accuracy of a convolutional neural network?
+
+## --answers--
+
+Augmenting the data you already have.
+
+---
+
+Using a pre-trained model.
+
+---
+
+Using your test data to retrain the model.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
new file mode 100644
index 0000000000..9d34c0b25a
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-picking-a-pretrained-model.md
@@ -0,0 +1,49 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9a
+title: 'Convolutional Neural Networks: Picking a Pretrained Model'
+challengeType: 11
+videoId: h1XUt1AgIOI
+dashedName: convolutional-neural-networks-picking-a-pretrained-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to use Google's pre-trained MobileNet V2 model as a base for a convolutional neural network:
+
+```py
+base_model = tf.__A__.applications.__B__(input_shape=(160, 160, 3),
+                                               include_top=__C__,
+                                               weights='imagenet'
+                                               )
+```
+
+## --answers--
+
+A: `keras`
+
+B: `MobileNetV2`
+
+C: `False`
+
+---
+
+A: `Keras`
+
+B: `MobileNetV2`
+
+C: `True`
+
+---
+
+A: `keras`
+
+B: `mobile_net_v2`
+
+C: `False`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
new file mode 100644
index 0000000000..87c0b9ef9b
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks-the-convolutional-layer.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d97
+title: 'Convolutional Neural Networks: The Convolutional Layer'
+challengeType: 11
+videoId: LrdmcQpTyLw
+dashedName: convolutional-neural-networks-the-convolutional-layer
+---
+
+# --question--
+
+## --text--
+
+What are the three main properties of each convolutional layer?
+
+## --answers--
+
+Input size, the number of filters, and the sample size of the filters.
+
+---
+
+Input size, input dimensions, and the color values of the input.
+
+---
+
+Input size, input padding, and stride.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
new file mode 100644
index 0000000000..616ef13476
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/convolutional-neural-networks.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d96
+title: Convolutional Neural Networks
+challengeType: 11
+videoId: _1kTP7uoU9E
+dashedName: convolutional-neural-networks
+---
+
+# --question--
+
+## --text--
+
+Dense neural networks analyze input on a global scale and recognize patterns in specific areas. Convolutional neural networks...:
+
+## --answers--
+
+also analyze input globally and extract features from specific areas.
+
+---
+
+do not work well for image classification or object detection.
+
+---
+
+scan through the entire input a little at a time and learn local patterns.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
new file mode 100644
index 0000000000..4b792df4cd
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-building-the-model.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8e
+title: 'Core Learning Algorithms: Building the Model'
+challengeType: 11
+videoId: 5wHw8BTd2ZQ
+dashedName: core-learning-algorithms-building-the-model
+---
+
+# --question--
+
+## --text--
+
+What kind of estimator/model does TensorFlow recommend using for classification?
+
+## --answers--
+
+`LinearClassifier`
+
+---
+
+`DNNClassifier`
+
+---
+
+`BoostedTreesClassifier`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
new file mode 100644
index 0000000000..245cf7febe
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-classification.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8d
+title: 'Core Learning Algorithms: Classification'
+challengeType: 11
+videoId: qFF7ZQNvK9E
+dashedName: core-learning-algorithms-classification
+---
+
+# --question--
+
+## --text--
+
+What is classification?
+
+## --answers--
+
+The process of separating data points into different classes.
+
+---
+
+Predicting a numeric value or forecast based on independent and dependent variables.
+
+---
+
+None of the above.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
new file mode 100644
index 0000000000..0f8065dedc
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-clustering.md
@@ -0,0 +1,38 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8f
+title: 'Core Learning Algorithms: Clustering'
+challengeType: 11
+videoId: 8sqIaHc9Cz4
+dashedName: core-learning-algorithms-clustering
+---
+
+# --question--
+
+## --text--
+
+Which of the following steps is **not** part of the K-Means algorithm?
+
+## --answers--
+
+Randomly pick K points to place K centeroids.
+
+---
+
+Assign each K point to the closest K centeroid.
+
+---
+
+Move each K centeroid into the middle of all of their data points.
+
+---
+
+Shuffle the K points so they're redistributed randomly.
+
+---
+
+Reassign each K point to the closest K centeroid.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
new file mode 100644
index 0000000000..b829085f33
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-hidden-markov-models.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d90
+title: 'Core Learning Algorithms: Hidden Markov Models'
+challengeType: 11
+videoId: IZg24y4wEPY
+dashedName: core-learning-algorithms-hidden-markov-models
+---
+
+# --question--
+
+## --text--
+
+What makes a Hidden Markov model different than linear regression or classification?
+
+## --answers--
+
+It uses probability distributions to predict future events or states.
+
+---
+
+It analyzes the relationship between independent and dependent variables to make predictions.
+
+---
+
+It separates data points into separate categories.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
new file mode 100644
index 0000000000..29ca4b4896
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-the-training-process.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8c
+title: 'Core Learning Algorithms: The Training Process'
+challengeType: 11
+videoId: _cEwvqVoBhI
+dashedName: core-learning-algorithms-the-training-process
+---
+
+# --question--
+
+## --text--
+
+What are epochs?
+
+## --answers--
+
+The number of times the model will see the same data.
+
+---
+
+A type of graph.
+
+---
+
+The number of elements you feed to the model at once.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
new file mode 100644
index 0000000000..d31d7425eb
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-training-and-testing-data.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8b
+title: 'Core Learning Algorithms: Training and Testing Data'
+challengeType: 11
+videoId: wz9J1slsi7I
+dashedName: core-learning-algorithms-training-and-testing-data
+---
+
+# --question--
+
+## --text--
+
+What is categorical data?
+
+## --answers--
+
+Another term for one-hot encoding.
+
+---
+
+Any data that is not numeric.
+
+---
+
+Any data that is represented numerically.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
new file mode 100644
index 0000000000..2f77b3c6ea
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-using-probabilities-to-make-predictions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d91
+title: 'Core Learning Algorithms: Using Probabilities to make Predictions'
+challengeType: 11
+videoId: fYAYvLUawnc
+dashedName: core-learning-algorithms-using-probabilities-to-make-predictions
+---
+
+# --question--
+
+## --text--
+
+What TensorFlow module should you import to implement `.HiddenMarkovModel()`?
+
+## --answers--
+
+`tensorflow.keras`
+
+---
+
+`tensorflow_gpu`
+
+---
+
+`tensorflow_probability`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
new file mode 100644
index 0000000000..bd2c0c44f1
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms-working-with-data.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d8a
+title: 'Core Learning Algorithms: Working with Data'
+challengeType: 11
+videoId: u85IOSsJsPI
+dashedName: core-learning-algorithms-working-with-data
+---
+
+# --question--
+
+## --text--
+
+What does the pandas `.head()` function do?
+
+## --answers--
+
+Returns the number of entries in a data frame.
+
+---
+
+Returns the number of columns in a data frame.
+
+---
+
+By default, shows the first five rows or entries in a data frame.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
new file mode 100644
index 0000000000..470a5db663
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/core-learning-algorithms.md
@@ -0,0 +1,36 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d89
+title: Core Learning Algorithms
+challengeType: 11
+videoId: u5lZURgcWnU
+dashedName: core-learning-algorithms
+---
+
+# --question--
+
+## --text--
+
+Which type of analysis would be best suited for the following problem?:
+
+You have the average temperature in the month of March for the last 100 years. Using this data, you want to predict the average temperature in the month of March 5 years from now.
+
+## --answers--
+
+Multiple regression
+
+---
+
+Correlation
+
+---
+
+Decision tree
+
+---
+
+Linear regression
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
new file mode 100644
index 0000000000..68999197b2
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/creating-a-convolutional-neural-network.md
@@ -0,0 +1,52 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d98
+title: Creating a Convolutional Neural Network
+challengeType: 11
+videoId: kfv0K8MtkIc
+dashedName: creating-a-convolutional-neural-network
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to complete the architecture for a convolutional neural network:
+
+```py
+model = models.__A__()
+model.add(layers.__B__(32, (3, 3), activation='relu', input_shape=(32, 32, 3)))
+model.add(layers.__C__(2, 2))
+model.add(layers.__B__(64, (3, 3), activation='relu'))
+model.add(layers.__C__(2, 2))
+model.add(layers.__B__(32, (3, 3), activation='relu'))
+model.add(layers.__C__(2, 2))
+```
+
+## --answers--
+
+A: `Sequential`
+
+B: `add`
+
+C: `Wrapper`
+
+---
+
+A: `keras`
+
+B: `Cropping2D`
+
+C: `AlphaDropout`
+
+---
+
+A: `Sequential`
+
+B: `Conv2D`
+
+C: `MaxPooling2D`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
new file mode 100644
index 0000000000..185278bb1e
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-machine-learning-fundamentals.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d87
+title: 'Introduction: Machine Learning Fundamentals'
+challengeType: 11
+videoId: KwL1qTR5MT8
+dashedName: introduction-machine-learning-fundamentals
+---
+
+# --question--
+
+## --text--
+
+Which statement below is **false**?
+
+## --answers--
+
+Neural networks are modeled after the way the human brain works.
+
+---
+
+Computer programs that play tic-tac-toe or chess against human players are examples of simple artificial intelligence.
+
+---
+
+Machine learning is a subset of artificial intelligence.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
new file mode 100644
index 0000000000..cefca2bfe2
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/introduction-to-tensorflow.md
@@ -0,0 +1,38 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d88
+title: Introduction to TensorFlow
+challengeType: 11
+videoId: r9hRyGGjOgQ
+dashedName: introduction-to-tensorflow
+---
+
+# --question--
+
+## --text--
+
+Which of the following is **not** a type of tensor?
+
+## --answers--
+
+Variable
+
+---
+
+Flowing
+
+---
+
+Placeholder
+
+---
+
+SparseTensor
+
+---
+
+Constant
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
new file mode 100644
index 0000000000..7b7546ba33
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-building-the-model.md
@@ -0,0 +1,62 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da1
+title: 'Natural Language Processing With RNNs: Building the Model'
+challengeType: 11
+videoId: 32WBFS7lfsw
+dashedName: natural-language-processing-with-rnns-building-the-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to complete the `build_model` function:
+
+```py
+def build_mode(vocab_size, embedding_dim, rnn_units, batch_size):
+    model = tf.keras.Sequential([
+        tf.keras.layers.Embedding(vocab_size,
+                                  embedding_dim,
+                                  batch_input_shape=[batch_size, None]),
+        tf.keras.layers.__A__(rnn_units,
+                              return_sequences=__B__,
+                              recurrent_initializer='glorot_uniform),
+        tf.keras.layers.Dense(__C__)
+    ])
+    __D__
+```
+
+## --answers--
+
+A: `ELU`
+
+B: `True`
+
+C: `vocab_size`
+
+D: `return model`
+
+---
+
+A: `LSTM`
+
+B: `False`
+
+C: `batch_size`
+
+D: `return model`
+
+---
+
+A: `LSTM`
+
+B: `True`
+
+C: `vocab_size`
+
+D: `return model`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
new file mode 100644
index 0000000000..f3a22f813d
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-create-a-play-generator.md
@@ -0,0 +1,40 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da0
+title: 'Natural Language Processing With RNNs: Create a Play Generator'
+challengeType: 11
+videoId: j5xsxjq_Xk8
+dashedName: natural-language-processing-with-rnns-create-a-play-generator
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to create the training examples for the RNN:
+
+```py
+char_dataset = tf.data.__A__.__B__(text_as_int)
+```
+
+## --answers--
+
+A: `Dataset`
+
+B: `from_tensor_slices`
+
+---
+
+A: `data`
+
+B: `from_tensors`
+
+---
+
+A: `DataSet`
+
+B: `from_generator`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
new file mode 100644
index 0000000000..29dbc05f8d
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-making-predictions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9f
+title: 'Natural Language Processing With RNNs: Making Predictions'
+challengeType: 11
+videoId: WO1hINnBj20
+dashedName: natural-language-processing-with-rnns-making-predictions
+---
+
+# --question--
+
+## --text--
+
+Before you make a prediction with your own review, you should...:
+
+## --answers--
+
+decode the training dataset and compare the results to the test data.
+
+---
+
+use the encodings from the training dataset to encode your review.
+
+---
+
+assign random values between 0 and the maximum number of vocabulary in your dataset to each word in your review.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
new file mode 100644
index 0000000000..c572d154e1
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-part-2.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9c
+title: 'Natural Language Processing With RNNs: Part 2'
+challengeType: 11
+videoId: mUU9YXOFbZg
+dashedName: natural-language-processing-with-rnns-part-2
+---
+
+# --question--
+
+## --text--
+
+Word embeddings are...:
+
+## --answers--
+
+an unordered group of encoded words that describes the frequency of words in a given document.
+
+---
+
+a group of encoded words that preserves the original order of the words in a given document.
+
+---
+
+a vectorized representation of words in a given document that places words with similar meanings near each other.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
new file mode 100644
index 0000000000..e3d8d7e263
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-recurring-neural-networks.md
@@ -0,0 +1,34 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9d
+title: 'Natural Language Processing With RNNs: Recurring Neural Networks'
+challengeType: 11
+videoId: bX5681NPOcA
+dashedName: natural-language-processing-with-rnns-recurring-neural-networks
+---
+
+# --question--
+
+## --text--
+
+What is true about Recurrent Neural Networks?
+
+## --answers--
+
+1: They are a type of feed-forward neural network.
+
+---
+
+2: They maintain an internal memory/state of the input that was already processed.
+
+---
+
+3: RNN's contain a loop and process one piece of input at a time.
+
+---
+
+4: Both 2 and 3.
+
+## --video-solution--
+
+4
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
new file mode 100644
index 0000000000..60118b25c8
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-sentimental-analysis.md
@@ -0,0 +1,50 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9e
+title: 'Natural Language Processing With RNNs: Sentiment Analysis'
+challengeType: 11
+videoId: lYeLtu8Nq7c
+dashedName: natural-language-processing-with-rnns-sentiment-analysis
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to create the model for the RNN:
+
+```py
+model = __A__.keras.Sequential([
+    __A__.keras.layers.__B__(88584, 32),
+    __A__.keras.layers.__C__(32),
+    __A__.keras.layers.DENSE(1, activation='sigmoid')
+])
+```
+
+## --answers--
+
+A: `tensor_flow`
+
+B: `embedding`
+
+C: `LSTM`
+
+---
+
+A: `tf`
+
+B: `Embedding`
+
+C: `AlphaDropout`
+
+---
+
+A: `tf`
+
+B: `Embedding`
+
+C: `LSTM`
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
new file mode 100644
index 0000000000..2ae0cab5b7
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns-training-the-model.md
@@ -0,0 +1,54 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da2
+title: 'Natural Language Processing With RNNs: Training the Model'
+challengeType: 11
+videoId: hEUiK7j9UI8
+dashedName: natural-language-processing-with-rnns-training-the-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to save your model's checkpoints in the `./checkpoints` directory and call the latest checkpoint for training:
+
+```py
+checkpoint_dir = __A__
+checkpoint_prefix = os.path.join(checkpoint_dir, 'ckpt_{epoch}')
+
+checkpoint_callback = tf.keras.callbacks.__B__(
+    filepath=checkpoint_prefix,
+    save_weights_only=True
+)
+
+history = model.fit(data, epochs=2, callbacks=[__C__])
+```
+
+## --answers--
+
+A: `'./training_checkpoints'`
+
+B: `ModelCheckpoint`
+
+C: `checkpoint_prefix`
+
+---
+
+A: `'./checkpoints'`
+
+B: `ModelCheckpoint`
+
+C: `checkpoint_callback`
+
+---
+
+A: `'./checkpoints'`
+
+B: `BaseLogger`
+
+C: `checkpoint_callback`
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
new file mode 100644
index 0000000000..f4bde45483
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/natural-language-processing-with-rnns.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d9b
+title: Natural Language Processing With RNNs
+challengeType: 11
+videoId: ZyCaF5S-lKg
+dashedName: natural-language-processing-with-rnns
+---
+
+# --question--
+
+## --text--
+
+Natural Language Processing is a branch of artificial intelligence that...:
+
+## --answers--
+
+deals with how computers understand and process natural/human languages.
+
+---
+
+translates image data into natural/human languages.
+
+---
+
+is focused on translating computer languages into natural/human languages.
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
new file mode 100644
index 0000000000..635e29a35d
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-activation-functions.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d93
+title: 'Neural Networks: Activation Functions'
+challengeType: 11
+videoId: S45tqW6BqRs
+dashedName: neural-networks-activation-functions
+---
+
+# --question--
+
+## --text--
+
+Which activation function switches values between -1 and 1?
+
+## --answers--
+
+ReLU (Rectified Linear Unit)
+
+---
+
+Tanh (Hyperbolic Tangent)
+
+---
+
+Sigmoid
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
new file mode 100644
index 0000000000..05b3df57e0
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-creating-a-model.md
@@ -0,0 +1,50 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d95
+title: 'Neural Networks: Creating a Model'
+challengeType: 11
+videoId: K8bz1bmOCTw
+dashedName: neural-networks-creating-a-model
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks below to build a sequential model of dense layers:
+
+```py
+model = __A__.__B__([
+    __A__.layers.Flatten(input_shape=(28, 28)),
+    __A__.layers.__C__(128, activation='relu'),
+    __A__.layers.__C__(10, activation='softmax')
+])
+```
+
+## --answers--
+
+A: `keras`
+
+B: `Sequential`
+
+C: `Dense`
+
+---
+
+A: `tf`
+
+B: `Sequential`
+
+C: `Categorical`
+
+---
+
+A: `keras`
+
+B: `sequential`
+
+C: `dense`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
new file mode 100644
index 0000000000..216b851ab5
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-optimizers.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d94
+title: 'Neural Networks: Optimizers'
+challengeType: 11
+videoId: hdOtRPQe1o4
+dashedName: neural-networks-optimizers
+---
+
+# --question--
+
+## --text--
+
+What is an optimizer function?
+
+## --answers--
+
+A function that increases the accuracy of a model's predictions.
+
+---
+
+A function that implements the gradient descent and backpropagation algorithms for you.
+
+---
+
+A function that reduces the time a model needs to train.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
new file mode 100644
index 0000000000..d9d07b00fc
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/neural-networks-with-tensorflow.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72d92
+title: Neural Networks with TensorFlow
+challengeType: 11
+videoId: uisdfrNrZW4
+dashedName: neural-networks-with-tensorflow
+---
+
+# --question--
+
+## --text--
+
+A densely connected neural network is one in which...:
+
+## --answers--
+
+all the neurons in the current layer are connected to one neuron in the previous layer.
+
+---
+
+all the neurons in each layer are connected randomly.
+
+---
+
+all the neurons in the current layer are connected to every neuron in the previous layer.
+
+## --video-solution--
+
+3
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
new file mode 100644
index 0000000000..1b9f6923a9
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-example.md
@@ -0,0 +1,46 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da5
+title: 'Reinforcement Learning With Q-Learning: Example'
+challengeType: 11
+videoId: RBBSNta234s
+dashedName: reinforcement-learning-with-q-learning-example
+---
+
+# --question--
+
+## --text--
+
+Fill in the blanks to complete the following Q-Learning equation:
+
+```py
+Q[__A__, __B__] = Q[__A__, __B__] + LEARNING_RATE * (reward + GAMMA * np.max(Q[__C__, :]) - Q[__A__, __B__])
+```
+
+## --answers--
+
+A: `state`
+
+B: `action`
+
+C: `next_state`
+
+---
+
+A: `state`
+
+B: `action`
+
+C: `prev_state`
+
+---
+
+A: `state`
+
+B: `reaction`
+
+C: `next_state`
+
+## --video-solution--
+
+1
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
new file mode 100644
index 0000000000..089f144038
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning-part-2.md
@@ -0,0 +1,26 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da4
+title: 'Reinforcement Learning With Q-Learning: Part 2'
+challengeType: 11
+videoId: DX7hJuaUZ7o
+dashedName: reinforcement-learning-with-q-learning-part-2
+---
+
+# --question--
+
+## --text--
+
+What can happen if the agent does not have a good balance of taking random actions and using learned actions?
+
+## --answers--
+
+The agent will always try to minimize its reward for the current state/action, leading to local minima.
+
+---
+
+The agent will always try to maximize its reward for the current state/action, leading to local maxima.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
new file mode 100644
index 0000000000..3cbeedcfb3
--- /dev/null
+++ b/curriculum/challenges/portuguese/11-machine-learning-with-python/tensorflow/reinforcement-learning-with-q-learning.md
@@ -0,0 +1,30 @@
+---
+id: 5e8f2f13c4cdbe86b5c72da3
+title: Reinforcement Learning With Q-Learning
+challengeType: 11
+videoId: Cf7DSU0gVb4
+dashedName: reinforcement-learning-with-q-learning
+---
+
+# --question--
+
+## --text--
+
+The key components of reinforcement learning are...
+
+## --answers--
+
+environment, representative, state, reaction, and reward.
+
+---
+
+environment, agent, state, action, and reward.
+
+---
+
+habitat, agent, state, action, and punishment.
+
+## --video-solution--
+
+2
+
diff --git a/curriculum/challenges/portuguese/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml b/curriculum/challenges/portuguese/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
new file mode 100644
index 0000000000..ab4cdbb46e
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/apis-and-microservices-certificate/apis-and-microservices-certificate.yml
@@ -0,0 +1,15 @@
+id: 561add10cb82ac38a17523bc
+title: APIs and Microservices Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7158d8c443edefaeb5bdef
+    title: Timestamp Microservice
+  - id: bd7158d8c443edefaeb5bdff
+    title: Request Header Parser Microservice
+  - id: bd7158d8c443edefaeb5bd0e
+    title: URL Shortener Microservice
+  - id: 5a8b073d06fa14fcfde687aa
+    title: Exercise Tracker
+  - id: bd7158d8c443edefaeb5bd0f
+    title: File Metadata Microservice
diff --git a/curriculum/challenges/portuguese/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml b/curriculum/challenges/portuguese/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
new file mode 100644
index 0000000000..43f9a87fce
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/data-analysis-with-python-certificate/data-analysis-with-python-certificate.yml
@@ -0,0 +1,16 @@
+id: 5e46fc95ac417301a38fb934
+title: Data Analysis with Python Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 5e46f7e5ac417301a38fb928
+    title: Mean-Variance-Standard Deviation Calculator
+  - id: 5e46f7e5ac417301a38fb929
+    title: Demographic Data Analyzer
+  - id: 5e46f7f8ac417301a38fb92a
+    title: Medical Data Visualizer
+  - id: 5e46f802ac417301a38fb92b
+    title: Page View Time Series Visualizer
+  - id: 5e4f5c4b570f7e3a4949899f
+    title: Sea Level Predictor
+
diff --git a/curriculum/challenges/portuguese/12-certificates/data-visualization-certificate/data-visualization-certificate.yml b/curriculum/challenges/portuguese/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
new file mode 100644
index 0000000000..800f59f079
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/data-visualization-certificate/data-visualization-certificate.yml
@@ -0,0 +1,15 @@
+id: 5a553ca864b52e1d8bceea14
+title: Data Visualization Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7168d8c242eddfaeb5bd13
+    title: Visualize Data with a Bar Chart
+  - id: bd7178d8c242eddfaeb5bd13
+    title: Visualize Data with a Scatterplot Graph
+  - id: bd7188d8c242eddfaeb5bd13
+    title: Visualize Data with a Heat Map
+  - id: 587d7fa6367417b2b2512bbf
+    title: Visualize Data with a Choropleth Map
+  - id: 587d7fa6367417b2b2512bc0
+    title: Visualize Data with a Treemap Diagram
diff --git a/curriculum/challenges/portuguese/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml b/curriculum/challenges/portuguese/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
new file mode 100644
index 0000000000..e46cb47106
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/front-end-libraries-certificate/front-end-libraries-certificate.yml
@@ -0,0 +1,15 @@
+id: 561acd10cb82ac38a17513bc
+title: Front End Libraries Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7158d8c442eddfaeb5bd13
+    title: Build a Random Quote Machine
+  - id: bd7157d8c242eddfaeb5bd13
+    title: Build a Markdown Previewer
+  - id: 587d7dbc367417b2b2512bae
+    title: Build a Drum Machine
+  - id: bd7158d8c442eddfaeb5bd17
+    title: Build a JavaScript Calculator
+  - id: bd7158d8c442eddfaeb5bd0f
+    title: Build a 25 + 5 Clock
diff --git a/curriculum/challenges/portuguese/12-certificates/information-security-certificate/information-security-certificate.yml b/curriculum/challenges/portuguese/12-certificates/information-security-certificate/information-security-certificate.yml
new file mode 100644
index 0000000000..e2e589dac5
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/information-security-certificate/information-security-certificate.yml
@@ -0,0 +1,15 @@
+id: 5e6021435ac9d0ecd8b94b00
+title: Information Security Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 587d824a367417b2b2512c44
+    title: Stock Price Checker
+  - id: 587d824a367417b2b2512c45
+    title: Anonymous Message Board
+  - id: 5e46f979ac417301a38fb932
+    title: Port Scanner
+  - id: 5e46f983ac417301a38fb933
+    title: SHA-1 Password Cracker
+  - id: 5e601c775ac9d0ecd8b94aff
+    title: Secure Real Time Multiplayer Game
diff --git a/curriculum/challenges/portuguese/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml b/curriculum/challenges/portuguese/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
new file mode 100644
index 0000000000..ae8984cbb1
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/javascript-algorithms-and-data-structures-certificate/javascript-algorithms-and-data-structures-certificate.yml
@@ -0,0 +1,15 @@
+id: 561abd10cb81ac38a17513bc
+title: JavaScript Algorithms and Data Structures Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: aaa48de84e1ecc7c742e1124
+    title: Palindrome Checker
+  - id: a7f4d8f2483413a6ce226cac
+    title: Roman Numeral Converter
+  - id: 56533eb9ac21ba0edf2244e2
+    title: Caesars Cipher
+  - id: aff0395860f5d3034dc0bfc9
+    title: Telephone Number Validator
+  - id: aa2e6f85cab2ab736c9a9b24
+    title: Cash Register
diff --git a/curriculum/challenges/portuguese/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml b/curriculum/challenges/portuguese/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
new file mode 100644
index 0000000000..30bbc54567
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/legacy-back-end-certificate/legacy-back-end-certificate.yml
@@ -0,0 +1,25 @@
+id: 660add10cb82ac38a17513be
+title: Legacy Back End Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7158d8c443edefaeb5bdef
+    title: Timestamp Microservice
+  - id: bd7158d8c443edefaeb5bdff
+    title: Request Header Parser Microservice
+  - id: bd7158d8c443edefaeb5bd0e
+    title: URL Shortener Microservice
+  - id: bd7158d8c443edefaeb5bdee
+    title: Image Search Abstraction Layer
+  - id: bd7158d8c443edefaeb5bd0f
+    title: File Metadata Microservice
+  - id: bd7158d8c443eddfaeb5bdef
+    title: Build a Voting App
+  - id: bd7158d8c443eddfaeb5bdff
+    title: Build a Nightlife Coordination App
+  - id: bd7158d8c443eddfaeb5bd0e
+    title: Chart the Stock Market
+  - id: bd7158d8c443eddfaeb5bd0f
+    title: Manage a Book Trading Club
+  - id: bd7158d8c443eddfaeb5bdee
+    title: Build a Pinterest Clone
diff --git a/curriculum/challenges/portuguese/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml b/curriculum/challenges/portuguese/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
new file mode 100644
index 0000000000..47878fc563
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/legacy-data-visualization-certificate/legacy-data-visualization-certificate.yml
@@ -0,0 +1,25 @@
+id: 561add10cb82ac39a17513bc
+title: Legacy Data Visualization Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7157d8c242eddfaeb5bd13
+    title: Build a Markdown Previewer
+  - id: bd7156d8c242eddfaeb5bd13
+    title: Build a Camper Leaderboard
+  - id: bd7155d8c242eddfaeb5bd13
+    title: Build a Recipe Box
+  - id: bd7154d8c242eddfaeb5bd13
+    title: Build the Game of Life
+  - id: bd7153d8c242eddfaeb5bd13
+    title: Build a Roguelike Dungeon Crawler Game
+  - id: bd7168d8c242eddfaeb5bd13
+    title: Visualize Data with a Bar Chart
+  - id: bd7178d8c242eddfaeb5bd13
+    title: Visualize Data with a Scatterplot Graph
+  - id: bd7188d8c242eddfaeb5bd13
+    title: Visualize Data with a Heat Map
+  - id: bd7198d8c242eddfaeb5bd13
+    title: Show National Contiguity with a Force Directed Graph
+  - id: bd7108d8c242eddfaeb5bd13
+    title: Map Data Across the Globe
diff --git a/curriculum/challenges/portuguese/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml b/curriculum/challenges/portuguese/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
new file mode 100644
index 0000000000..22c46cdfcc
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/legacy-front-end-certificate/legacy-front-end-certificate.yml
@@ -0,0 +1,25 @@
+id: 561add10cb82ac38a17513be
+title: Legacy Front End Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7158d8c242eddfaeb5bd13
+    title: Build a Personal Portfolio Webpage
+  - id: bd7158d8c442eddfaeb5bd13
+    title: Build a Random Quote Machine
+  - id: bd7158d8c442eddfaeb5bd0f
+    title: Build a 25 + 5 Clock
+  - id: bd7158d8c442eddfaeb5bd17
+    title: Build a JavaScript Calculator
+  - id: bd7158d8c442eddfaeb5bd10
+    title: Show the Local Weather
+  - id: bd7158d8c442eddfaeb5bd1f
+    title: Use the Twitch JSON API
+  - id: bd7158d8c442eddfaeb5bd18
+    title: Stylize Stories on Camper News
+  - id: bd7158d8c442eddfaeb5bd19
+    title: Build a Wikipedia Viewer
+  - id: bd7158d8c442eedfaeb5bd1c
+    title: Build a Tic Tac Toe Game
+  - id: bd7158d8c442eddfaeb5bd1c
+    title: Build a Simon Game
diff --git a/curriculum/challenges/portuguese/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml b/curriculum/challenges/portuguese/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
new file mode 100644
index 0000000000..0864f87cd0
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/legacy-full-stack-certificate/legacy-full-stack-certificate.yml
@@ -0,0 +1,17 @@
+id: 561add10cb82ac38a17213bd
+title: Legacy Full Stack Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 561add10cb82ac38a17513bc
+    title: Responsive Web Design Certificate
+  - id: 561abd10cb81ac38a17513bc
+    title: JavaScript Algorithms and Data Structures Certificate
+  - id: 561acd10cb82ac38a17513bc
+    title: Front End Libraries Certificate
+  - id: 5a553ca864b52e1d8bceea14
+    title: Data Visualization Certificate
+  - id: 561add10cb82ac38a17523bc
+    title: API's and Microservices Certificate
+  - id: 561add10cb82ac38a17213bc
+    title: Legacy Information Security and Quality Assurance Certificate
diff --git a/curriculum/challenges/portuguese/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml b/curriculum/challenges/portuguese/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
new file mode 100644
index 0000000000..6a5be51175
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/legacy-information-security-and-quality-assurance-certificate/legacy-information-security-and-quality-assurance-certificate.yml
@@ -0,0 +1,15 @@
+id: 561add10cb82ac38a17213bc
+title: Legacy Information Security and Quality Assurance Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 587d8249367417b2b2512c41
+    title: Metric-Imperial Converter
+  - id: 587d8249367417b2b2512c42
+    title: Issue Tracker
+  - id: 587d824a367417b2b2512c43
+    title: Personal Library
+  - id: 587d824a367417b2b2512c44
+    title: Stock Price Checker
+  - id: 587d824a367417b2b2512c45
+    title: Anonymous Message Board
diff --git a/curriculum/challenges/portuguese/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml b/curriculum/challenges/portuguese/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
new file mode 100644
index 0000000000..dab0dc2a74
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/machine-learning-with-python-certificate/machine-learning-with-python-certificate.yml
@@ -0,0 +1,16 @@
+id: 5e46fc95ac417301a38fb935
+title: Machine Learning with Python Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 5e46f8d6ac417301a38fb92d
+    title: Rock Paper Scissors
+  - id: 5e46f8dcac417301a38fb92e
+    title: Cat and Dog Image Classifier
+  - id: 5e46f8e3ac417301a38fb92f
+    title: Book Recommendation Engine using KNN
+  - id: 5e46f8edac417301a38fb930
+    title: Linear Regression Health Costs Calculator
+  - id: 5e46f8edac417301a38fb931
+    title: Neural Network SMS Text Classifier
+
diff --git a/curriculum/challenges/portuguese/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml b/curriculum/challenges/portuguese/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
new file mode 100644
index 0000000000..aae674311d
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/quality-assurance-certificate/quality-assurance-certificate.yml
@@ -0,0 +1,16 @@
+id: 5e611829481575a52dc59c0e
+title: Quality Assurance Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 587d8249367417b2b2512c41
+    title: Metric-Imperial Converter
+  - id: 587d8249367417b2b2512c42
+    title: Issue Tracker
+  - id: 587d824a367417b2b2512c43
+    title: Personal Library
+  - id: 5e601bf95ac9d0ecd8b94afd
+    title: Sudoku Solver
+  - id: 5e601c0d5ac9d0ecd8b94afe
+    title: American British Translator
+
diff --git a/curriculum/challenges/portuguese/12-certificates/responsive-web-design-certificate/responsive-web-design-certificate.yml b/curriculum/challenges/portuguese/12-certificates/responsive-web-design-certificate/responsive-web-design-certificate.yml
new file mode 100644
index 0000000000..9b29ab8b89
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/responsive-web-design-certificate/responsive-web-design-certificate.yml
@@ -0,0 +1,15 @@
+id: 561add10cb82ac38a17513bc
+title: Responsive Web Design Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: bd7158d8c442eddfaeb5bd18
+    title: Build a Tribute Page
+  - id: 587d78af367417b2b2512b03
+    title: Build a Survey Form
+  - id: 587d78af367417b2b2512b04
+    title: Build a Product Landing Page
+  - id: 587d78b0367417b2b2512b05
+    title: Build a Technical Documentation Page
+  - id: bd7158d8c242eddfaeb5bd13
+    title: Build a Personal Portfolio Webpage
diff --git a/curriculum/challenges/portuguese/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml b/curriculum/challenges/portuguese/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml
new file mode 100644
index 0000000000..416a36f8f0
--- /dev/null
+++ b/curriculum/challenges/portuguese/12-certificates/scientific-computing-with-python-certificate/scientific-computing-with-python-certificate.yml
@@ -0,0 +1,15 @@
+id: 5e44431b903586ffb414c951
+title: Scientific Computing with Python Certificate
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 5e44412c903586ffb414c94c
+    title: Arithmetic Formatter
+  - id: 5e444136903586ffb414c94d
+    title: Time Calculator
+  - id: 5e44413e903586ffb414c94e
+    title: Budget App
+  - id: 5e444147903586ffb414c94f
+    title: Polygon Area Calculator
+  - id: 5e44414f903586ffb414c950
+    title: Probability Calculator
diff --git a/utils/is-audited.js b/utils/is-audited.js
index 7a3adf4540..ed66966cb6 100644
--- a/utils/is-audited.js
+++ b/utils/is-audited.js
@@ -29,7 +29,12 @@ const auditedCerts = {
     'data-visualization',
     'apis-and-microservices',
     'quality-assurance'
-  ]
+  ],
+  italian: [
+    'responsive-web-design',
+    'javascript-algorithms-and-data-structures'
+  ],
+  portuguese: ['responsive-web-design']
 };
 
 function isAuditedCert(lang, cert) {